Search results

This study aims to evaluate the influence of connected and autonomous vehicle (CAV) merging algorithms on the driver behavior of human-driven vehicles on the mainline.

Previous studies designed their merging algorithms mostly based on either the simulation or the restricted field testing, which lacks consideration of realistic driving behaviors in the merging scenario. This study developed a multi-driver simulator system to embed realistic driving behavior in the validation of merging algorithms.

Four types of CAV merging algorithms were evaluated regarding their influences on driving safety and driving comfort of the mainline vehicle platoon. The results revealed significant variation of the algorithm influences. Specifically, the results show that the reference-trajectory-based merging algorithm may outperform the social-psychology-based merging algorithm which only considers the ramp vehicles.

To the best of the authors’ knowledge, this is the first time to evaluate a CAV control algorithm considering realistic driver interactions rather than by the simulation. To achieve the research purpose, a novel multi-driver driving simulator was developed, which enables multi-drivers to simultaneously interact with each other during a virtual driving test. The results are expected to have practical implications for further improvement of the CAV merging algorithm.

A simultaneous solution to the localization and mapping problem of a graph‐like environment by a swarm of robots requires solutions to task coordination and map merging. The purpose of this paper is to examine the performance of two different map‐merging strategies.

Building a representation of the environment is a key problem in robotics where the problem is known as simultaneous localization and mapping (SLAM). When large groups of robots operate within the environment, the SLAM problem becomes complicated by issues related to coordination of the elements of the swarm and integration of the environmental representations obtained by individual swarm elements. This paper considers these issues within the formalism of a group of simulated robots operating within a graph‐like environment. Starting at a common node, the swarm partitions the unknown edges of the known graph and explores the graph for a pre‐arranged period. The swarm elements then meet at a particular time and location to integrate their partial world models. This process is repeated until the entire world has been mapped. A correctness proof of the algorithm is presented, and different coordination strategies are compared via simulation.

The paper demonstrates that a swarm of identical robots, each equipped with its own marker, and capable of simple sensing and action abilities, can explore and map an unknown graph‐like environment. Moreover, experimental results show that exploration with multiple robots can provide an improvement in exploration effort over a single robot and that this improvement does not scale linearly with the size of the swarm.

The paper represents efforts toward exploration and mapping in a graph‐like world with robot swarms. The paper suggests several extensions and variations including the development of adaptive partitioning and rendezvous schedule strategies to further improve both overall swarm efficiency and individual robot utilization during exploration.

The novelty associated with this paper is the formal extension of the single robot graph‐like exploration of Dudek et al. to robot swarms. The paper here examines fundamental limits to multiple robot SLAM and does this within a topological framework. Results obtained within this topological formalism can be readily transferred to the more traditional metric representation.

The purpose of this paper is to merge the ontologies that remove the redundancy and improve the storage efficiency. The count of ontologies developed in the past few eras is noticeably very high. With the availability of these ontologies, the needed information can be smoothly attained, but the presence of comparably varied ontologies nurtures the dispute of rework and merging of data. The assessment of the existing ontologies exposes the existence of the superfluous information; hence, ontology merging is the only solution. The existing ontology merging methods focus only on highly relevant classes and instances, whereas somewhat relevant classes and instances have been simply dropped. Those somewhat relevant classes and instances may also be useful or relevant to the given domain. In this paper, we propose a new method called hybrid semantic similarity measure (HSSM)-based ontology merging using formal concept analysis (FCA) and semantic similarity measure.

The HSSM categorizes the relevancy into three classes, namely highly relevant, moderate relevant and least relevant classes and instances. To achieve high efficiency in merging, HSSM performs both FCA part and the semantic similarity part.

The experimental results proved that the HSSM produced better results compared with existing algorithms in terms of similarity distance and time. An inconsistency check can also be done for the dissimilar classes and instances within an ontology. The output ontology will have set of highly relevant and moderate classes and instances as well as few least relevant classes and instances that will eventually lead to exhaustive ontology for the particular domain.

In this paper, a HSSM method is proposed and used to merge the academic social network ontologies; this is observed to be an extremely powerful methodology compared with other former studies. This HSSM approach can be applied for various domain ontologies and it may deliver a novel vision to the researchers.

The HSSM is not applied for merging the ontologies in any former studies up to the knowledge of authors.

In federated search, a query is sent simultaneously to multiple resources and each one of them returns a list of results. These lists are merged into a single list using the results merging process. In this work, the authors apply machine learning methods for results merging in federated patent search. Even though several methods for results merging have been developed, none of them were tested on patent data nor considered several machine learning models. Thus, the authors experiment with state-of-the-art methods using patent data and they propose two new methods for results merging that use machine learning models.

The methods are based on a centralized index containing samples of documents from all the remote resources, and they implement machine learning models to estimate comparable scores for the documents retrieved by different resources. The authors examine the new methods in cooperative and uncooperative settings where document scores from the remote search engines are available and not, respectively. In uncooperative environments, they propose two methods for assigning document scores.

The effectiveness of the new results merging methods was measured against state-of-the-art models and found to be superior to them in many cases with significant improvements. The random forest model achieves the best results in comparison to all other models and presents new insights for the results merging problem.

In this article the authors prove that machine learning models can substitute other standard methods and models that used for results merging for many years. Our methods outperformed state-of-the-art estimation methods for results merging, and they proved that they are more effective for federated patent search.

The purpose of this paper is to focus on duplicate record detection algorithms used for detection in bibliographic databases.

Individual algorithms, their application process for duplicate detection and their results are described based on available literature (published articles), information found at various library web sites and follow‐up e‐mail communications.

Algorithms are categorized according to their application as a process of a single step or two consecutive steps. The results of deletion, merging, and temporary and virtual consolidation of duplicate records are studied.

The paper presents an overview of the duplication detection algorithms and an up‐to‐date state of their application in different library systems.

On-ramp merging areas are typical bottlenecks in the freeway network since merging on-ramp vehicles may cause intensive disturbances on the mainline traffic flow and lead to various negative impacts on traffic efficiency and safety. The connected and autonomous vehicles (CAVs), with their capabilities of real-time communication and precise motion control, hold a great potential to facilitate ramp merging operation through enhanced coordination strategies. This paper aims to present a comprehensive review of the existing ramp merging strategies leveraging CAVs, focusing on the latest trends and developments in the research field.

The review comprehensively covers 44 papers recently published in leading transportation journals. Based on the application context, control strategies are categorized into three categories: merging into sing-lane freeways with total CAVs, merging into sing-lane freeways with mixed traffic flows and merging into multilane freeways.

Relevant literature is reviewed regarding the required technologies, control decision level, applied methods and impacts on traffic performance. More importantly, the authors identify the existing research gaps and provide insightful discussions on the potential and promising directions for future research based on the review, which facilitates further advancement in this research topic.

Many strategies based on the communication and automation capabilities of CAVs have been developed over the past decades, devoted to facilitating the merging/lane-changing maneuvers at freeway on-ramps. Despite the significant progress made, an up-to-date review covering these latest developments is missing to the authors’ best knowledge. This paper conducts a thorough review of the cooperation/coordination strategies that facilitate freeway on-ramp merging using CAVs, focusing on the latest developments in this field. Based on the review, the authors identify the existing research gaps in CAV ramp merging and discuss the potential and promising future research directions to address the gaps.

An indexing language is made more accessible to searchers and indexers by the presence of entry terms or near‐synonyms. This paper first presents an evaluation of existing entry terms and then presents and tests a strategy for creating entry terms. The key tools in the evaluation of the entry terms are documents already indexed into the Medical Subject Headings (MeSH) and an automatic indexer. If the automatic indexer can better map the title to the index terms with the use of entry terms than without entry terms, then the entry terms have helped. Sensitive assessment of the automatic indexer requires the introduction of measures of conceptual closeness between the computer and human output. With the tools described in this paper, one can systematically demonstrate that certain entry terms have ambiguous meanings. In the selection of new entry terms another controlled vocabulary or thesaurus, called the Systematized Nomenclature of Medicine (SNOMED), was consulted. An algorithm for mapping terms from SNOMED to MeSH was implemented and evaluated with the automatic indexer. The new SNOMED‐based entry terms did not help indexing but did show how new concepts might be identified which would constitute meaningful amendments to MeSH. Finally, an improved algorithm for combining two thesauri was applied to the Computing Reviews Classification Structure (CRCS) and MeSH. CRCS plus MeSH supported better indexing than did MeSH alone.

The complexity of business environments often causes organizations to produce several inconsistent views of the same business process (BP), leading to fragmentation. BP view integration attempts to produce an integrated view from different views of the same model, facilitating the management of BP models.

To study the trends of BP view integration, the authors conduct an extensive and systematic literature review to summarize findings since the 1970s. With a starting corpus of 918 documents, this survey draws up a systematic inventory of solutions used in academia and industry. By narrowing it down to 71 articles, the authors discuss in-depth 17 BP integration techniques papers, classifying each solution according to 9 criteria.

The authors' study shows that most view-integration methods (11) utilize annotation-based matching, based on formal merging rules. While most solutions are formalized, only approximately half are validated with a real-world use case scenario. View integration can be applied to areas other than database schema integration and BP view integration.

By summarizing existing knowledge up to June 2021, the authors explore possible future research directions. The authors highlight the application of view integration to the blockchain research area, where stakeholders can have different views on the same blockchain. The authors expect that this study contributes to interdisciplinary research across view integration, namely to the context of blockchain.

This survey serves to pave the way for future trends, where the authors highlight the application of view integration to blockchain research.

A computational procedure based on a hybrid Lagrangian‐Eulerian discrete‐vortical element formulation and conformal transformation schemes are employed in this study to simulate the interaction of an air jet with swirling air flow inside a two‐dimensional cylinder. Such an investigation is of importance to many flow‐related industrial and environmental problems, such as mixing, cooling, combustion and dispersion of air‐borne or water‐borne contaminants because of the role of vortices in the global transport of matter and heat. The basis for the simulation is discussed and numerical results compared with theoretical results for the velocity field and streamfunction obtained by the method of images. The swirling air motion and the features of a real jet are well simulated and numerical results are validated by predictions of theory to within 20 per cent. To illustrate the merging and interaction processes of vortices and the formation of large eddies, velocity vectors, particle trajectories and streamline contours are presented.

This paper tactics to implement the attack detection in medical Internet of things (IoT) devices using improved deep learning architecture for accomplishing the concept bring your own device (BYOD). Here, a simulation-based hospital environment is modeled where many IoT devices or medical equipment are communicated with each other. The node or the device, which is creating the attack are recognized with the support of attribute collection. The dataset pertaining to the attack detection in medical IoT is gathered from each node that is considered as features. These features are subjected to a deep belief network (DBN), which is a part of deep learning algorithm. Despite the existing DBN, the number of hidden neurons of DBN is tuned or optimized correctly with the help of a hybrid meta-heuristic algorithm by merging grasshopper optimization algorithm (GOA) and spider monkey optimization (SMO) in order to enhance the accuracy of detection. The hybrid algorithm is termed as local leader phase-based GOA (LLP-GOA). The DBN is used to train the nodes by creating the data library with attack details, thus maintaining accurate detection during testing.

This paper has presented novel attack detection in medical IoT devices using improved deep learning architecture as BYOD. With this, this paper aims to show the high convergence and better performance in detecting attacks in the hospital network.

From the analysis, the overall performance analysis of the proposed LLP-GOA-based DBN in terms of accuracy was 0.25% better than particle swarm optimization (PSO)-DBN, 0.15% enhanced than grey wolf algorithm (GWO)-DBN, 0.26% enhanced than SMO-DBN and 0.43% enhanced than GOA-DBN. Similarly, the accuracy of the proposed LLP-GOA-DBN model was 13% better than support vector machine (SVM), 5.4% enhanced than k-nearest neighbor (KNN), 8.7% finer than neural network (NN) and 3.5% enhanced than DBN.

This paper adopts a hybrid algorithm termed as LLP-GOA for the accurate detection of attacks in medical IoT for improving the enhanced security in healthcare sector using the optimized deep learning. This is the first work which utilizes LLP-GOA algorithm for improving the performance of DBN for enhancing the security in the healthcare sector.