Search

Natural language processing is an important direction in the field of computer science and artificial intelligence. It can realize various theories and methods of effective communication between humans and computers using natural language. Machine learning is a branch of natural language processing research, which is based on a large-scale English-Chinese database. Due to the relatively poor alignment corpus of English and Chinese bilingual sentences containing unknown words, machine translation is unprofessional and unbalanced, which is the problem studied in this paper. The purpose of this paper is to design and implement a length-based system for sentence alignment between English and Chinese bilingual texts. The research content of this paper is mainly divided into the following parts. First, the evaluation function of bilingual sentence alignment is designed, and on this basis, the bilingual sentence alignment algorithm based on the length and the optimal sentence pair sequence search algorithm is designed. In this paper, China National Knowledge Infrastructure (CNKI) is selected as an English-Chinese bilingual candidate website and English-Chinese bilingual web pages are downloaded. After analyzing the downloaded pages, nontext content such as page tags is removed, and bilingual text information is stored so as to establish an English-Chinese bilingual corpus based on segment alignment and retain English-Chinese bilingual keywords in the web pages. Second, extract the dictionary from the software StarDict, analyze the original dictionary format, and turn it into a custom dictionary format, which is convenient and better to use the double-sentence sentence alignment system, which is conducive to expanding the number of dictionaries and increasing the professionalism of vocabulary. Finally, we extract the stems of English words from the established corpus to simplify the complexity of English word processing, reduce the noise caused by the conversion of word parts of speech, and improve the operation efficiency. A bilingual sentence alignment system based on length is implemented. Finally, the system parameters are adjusted for comparative experiments to test the system performance. [ABSTRACT FROM AUTHOR]

Nowadays, with the development of computer science and technology, computer intelligent algorithms are more and more widely used in various industries. Every calculation formula in the computer intelligent algorithm has systematic logic and singleness, in order to expound the dynamic algorithm of football training optimized by the computer intelligent algorithm in detail. In this paper, the monitoring system using the computer intelligent algorithm can dynamically observe people or objects and systematically analyze them. This paper mainly studies the research of a football training dynamic monitoring system based on the computer intelligent algorithm and the design and optimization of the computer intelligent dynamic monitoring system in football training. Finally, the overall composition of the computer intelligent dynamic monitoring system and the application of the optimized computer intelligent dynamic monitoring system to the analysis of sample data are studied. [ABSTRACT FROM AUTHOR]

This umbrella review is motivated to understand the shift in research themes on brain-computer interfacing (BCI) and it determined that a shift away from themes that focus on medical advancement and system development to applications that included education, marketing, gaming, safety, and security has occurred. The background of this review examined aspects of BCI categorisation, neuroimaging methods, brain control signal classification, applications, and ethics. The specific area of BCI software and hardware development was not examined. A search using One Search was undertaken and 92 BCI reviews were selected for inclusion. Publication demographics indicate the average number of authors on review papers considered was 4.2 ± 1.8. The results also indicate a rapid increase in the number of BCI reviews from 2003, with only three reviews before that period, two in 1972, and one in 1996. While BCI authors were predominantly Euro-American in early reviews, this shifted to a more global authorship, which China dominated by 2020–2022. The review revealed six disciplines associated with BCI systems: life sciences and biomedicine (n = 42), neurosciences and neurology (n = 35), and rehabilitation (n = 20); (2) the second domain centred on the theme of functionality: computer science (n = 20), engineering (n = 28) and technology (n = 38). There was a thematic shift from understanding brain function and modes of interfacing BCI systems to more applied research novel areas of research-identified surround artificial intelligence, including machine learning, pre-processing, and deep learning. As BCI systems become more invasive in the lives of "normal" individuals, it is expected that there will be a refocus and thematic shift towards increased research into ethical issues and the need for legal oversight in BCI application. [ABSTRACT FROM AUTHOR]

Recent advancements in computer science include some optimization models that have been developed and used in real applications. Some metaheuristic search/optimization algorithms have been tested to obtain optimal solutions to speed controller applications in self-driving cars. Some metaheuristic algorithms are based on social behaviour, resulting in several search models, functions, and parameters, and thus algorithm-specific strengths and weaknesses. The present paper proposes a fitness function on the basis of the mathematical description of proportional integrative derivate controllers showing that mean square error is not always the best measure when looking for a solution to the problem. The fitness developed in this paper contains features and equations from the mathematical background of proportional integrative derivative controllers to calculate the best performance of the system. Such results are applied to quantitatively evaluate the performance of twenty-one optimization algorithms. Furthermore, improved versions of the fitness function are considered, in order to investigate which aspects are enhanced by applying the optimization algorithms. Results show that the right fitness function is a key point to get a good performance, regardless of the chosen algorithm. The aim of this paper is to present a novel objective function to carry out optimizations of the gains of a PID controller, using several computational intelligence techniques to perform the optimizations. The result of these optimizations will demonstrate the improved efficiency of the selected control schema. [ABSTRACT FROM AUTHOR]

Artificial Intelligence (AI) is the domain of computer science that focuses on the development of machines that operate like humans. In the field of AI, medical disease detection is an instantly growing domain of research. In the past years, numerous endeavours have been made for the improvements of medical disease detection, because the errors and problems in medical disease detection cause serious wrong medical treatment. Meta-heuristic techniques have been frequently utilized for the detection of medical diseases and promise better accuracy of perception and prediction of diseases in the domain of biomedical. Particle Swarm Optimization (PSO) is a swarm-based intelligent stochastic search technique encouraged from the intrinsic manner of bee swarm during the searching of their food source. Consequently, for the versatility of numerical experimentation, PSO has been mostly applied to address the diverse kinds of optimization problems. However, the PSO techniques are frequently adopted for the detection of diseases but there is still a gap in the comparative survey. This paper presents an insight into the diagnosis of medical diseases in health care using various PSO approaches. This study presents to deliver a systematic literature review of current PSO approaches for knowledge discovery in the field of disease detection. The systematic analysis discloses the potential research areas of PSO strategies as well as the research gaps, although, the main goal is to provide the directions for future enhancement and development in this area. This paper gives a systematic survey of this conceptual model for the advanced research, which has been explored in the specified literature to date. This review comprehends the fundamental concepts, theoretical foundations, and conventional application fields. It is predicted that our study will be beneficial for the researchers to review the PSO algorithms in-depth for disease detection. Several challenges that can be undertaken to move the field forward are discussed according to the current state of the PSO strategies in health care. [ABSTRACT FROM AUTHOR]

The main objective of this paper is to introduce I p , q ϱ -derivative and I p , q ϱ -integral for interval-valued functions and discuss their key properties. Also, we prove the I p , q ϱ -Hermite–Hadamard inequalities for interval-valued functions is the development of p , q ϱ -Hermite–Hadamard inequalities by using new defined I p , q ϱ -integral. Moreover, we prove some results for midpoint- and trapezoidal-type inequalities by using the concept of Pompeiu–Hausdorff distance between the intervals. It is also shown that the results presented in this paper are extensions of some of the results already shown in earlier works. The proposed studies produce variants that would be useful for performing in-depth investigations on fractal theory, optimization, and research problems in different applied fields, such as computer science, quantum mechanics, and quantum physics. [ABSTRACT FROM AUTHOR]

This paper is to study the minimal realization theory for a fuzzy multiset language in the framework of category theory, which has already provided the tools and techniques for the advancement of several features of theoretical computer science. Specifically, by using the well-known categorical concepts, it is shown herein that there is a minimal realization (called the Nerode realization) for each fuzzy multiset language, and all minimal realizations for a given fuzzy multiset language are isomorphic to it. [ABSTRACT FROM AUTHOR]

For applied scientists and engineers, graph theory is a strong and vital tool for evaluating and inventing solutions for a variety of issues. Graph theory is extremely important in complex systems, particularly in computer science. Many scientific areas use graph theory, including biological sciences, engineering, coding, and operational research. A strategy for the orthogonal labelling of a bipartite graph G with n edges has been proposed in the literature, yielding cyclic decompositions of balanced complete bipartite graphs K n , n by the graph G. A generalization to circulant-balanced complete multipartite graphs K n , n , ⋯ , n ⏟ m ; m , n ≥ 2 , is our objective here. In this paper, we expand the orthogonal labelling approach used to generate cyclic decompositions for K n , n to a generalized orthogonal labelling approach that may be used for decomposing K n , n , ⋯ , n ⏟ m . We can decompose K n , n , ⋯ , n ⏟ m into distinct graph classes based on the proposed generalized orthogonal labelling approach. [ABSTRACT FROM AUTHOR]

With the rapid rise in the number of people buying houses, the demand for interior space design has also increased accordingly. The diversification of existing room types and the diversity of the public's perception of fashion make interior designers in short supply. The future of computer science and technology in the field of automatic design of indoor areas will be immeasurable. This paper proposes an automatic layout method for spatial area design based on convolutional neural networks (CNN). CNN methods are a fast and efficient method. By mimicking the designer's design process, it proposes a two-stage algorithm that defines the room first and the wall later, and the algorithm also provides a large-scale dataset called RPLAN that contains more than 80,000 interior layout plans from real residential buildings. Starting from the prediction living room, the automatic layout of the indoor areas is completed by iteration. A large number of empirical results show that the interior area design effect of this method is comparable to the interior design floor plan of professional designers. [ABSTRACT FROM AUTHOR]

Artificial intelligence (AI) is a subfield of computer science concerned with developing intelligent machines capable of performing tasks similar to those performed by humans. This human-created intelligence began more than 60 years ago. The goal of previous generations of applications was to demonstrate generic human-like behaviour. The goal has expanded with the advancement and increased compliance of this technology. It includes areas such as healthcare, gaming, and smart devices. The COVID-19 epidemic has posed a significant barrier to maintaining a sustainable strategy for mental health support clients with major mental illnesses and clinicians who have had to shift delivery modes quickly. In this study, we have conducted a systematic literature review (SLR) to provide an overview of the current state of the literature related to software measurement of healthcare using artificial intelligence. The study followed a secondary research strategy. The systematic literature review aim was to analyze software measurement of mental health illness in terms of previous literature. This study screened out of 28 research papers out of 1076 initial searches. We used Science Direct, IEEE Xplore, Springer Link, ACM, and Hindawi as database search engines. The research objective was to explore the needs of software applications and automation in the healthcare sector to bring efficiency to the systems. The research concluded that the healthcare setting crucially requires the implementation of software automation. [ABSTRACT FROM AUTHOR]

Fuzzy graph (FG) models take on the presence being ubiquitous in environmental and fabricated structures by humans, specifically the vibrant processes in physical, biological, and social systems. Owing to the unpredictable and indiscriminate data which are intrinsic in real life and problems being often ambiguous, it is very challenging for an expert to exemplify these problems through applying an FG. Vague graph structure (VGS), belonging to the FG family, has good capabilities when facing with problems that cannot be expressed by FGs. VGS can handle the vagueness connected with the incompatible and determinate information of any real-world problem, where FGs may not succeed to bear satisfactory results. The previous definitions' restrictions in FGs have led us to propose new definitions in the VGS. Domination is one of the key issues that has many applications in computer science and social networks. Today, many researchers are trying to prove its application in medical sciences and psychology. Therefore, in this paper, different concepts related to domination in VGSs such as Ni-dominating set, vague full dominating set, minimal N i -DS, and strong capacity Ni-dominating set are defined using some examples. Finally, an application of domination in medical sciences has been presented. [ABSTRACT FROM AUTHOR]

Metric dimension is one of the distance-based parameter which is frequently used to study the structural and chemical properties of the different networks in the various fields of computer science and chemistry such as image processing, pattern recognition, navigation, integer programming, optimal transportation models, and drugs discovery. In particular, it is used to find the locations of robots with respect to shortest distance among the destinations, minimum consumption of time, and lesser number of the utilized nodes and to characterize the chemical compounds having unique presentation in molecular networks. The fractional metric dimension being a latest developed weighted version of the metric dimension is used in the distance-related problems of the aforementioned fields to find their nonintegral optimal solutions. In this paper, we have formulated the local resolving neighborhoods with their cardinalities for all the edges of the convex polytopes networks to compute their local fractional metric dimensions in the form of exact values and sharp bounds. Moreover, the boundedness of all the obtained results is also proved. [ABSTRACT FROM AUTHOR]

A convex polytope is the convex hull of a finite set of points in the Euclidean space ℝ n . By preserving the adjacency-incidence relation between vertices of a polytope, its structural graph is constructed. A graph is called Hamilton-connected if there exists at least one Hamiltonian path between any of its two vertices. The detour index is defined to be the sum of the lengths of longest distances, i.e., detours between vertices in a graph. Hamiltonian and Hamilton-connected graphs have diverse applications in computer science and electrical engineering, whereas the detour index has important applications in chemistry. Checking whether a graph is Hamilton-connected and computing the detour index of an arbitrary graph are both NP-complete problems. In this paper, we study these problems simultaneously for certain families of convex polytopes. We construct two infinite families of Hamilton-connected convex polytopes. Hamilton-connectivity is shown by constructing Hamiltonian paths between any pair of vertices. We then use the Hamilton-connectivity to compute the detour index of these families. A family of non-Hamilton-connected convex polytopes has also been constructed to show that not all convex polytope families are Hamilton-connected. [ABSTRACT FROM AUTHOR]

Topological indices or coindices are one of the graph-theoretic tools which are widely used to study the different structural and chemical properties of the under study networks or graphs in the subject of computer science and chemistry, respectively. For these investigations, the operations of graphs always played an important role for the study of the complex networks under the various topological indices or coindices. In this paper, we determine bounds for the second Zagreb coindex of a well-known family of graphs called F -sum (S -sum, R -sum, Q -sum, and T -sum) graphs in the form of Zagreb indices and coindices of their factor graphs, where these graphs are obtained by using four subdivision-related operations and Cartesian product of graphs. At the end, we illustrate the obtained results by providing the exact and bonded values of some specific F -sum graphs. [ABSTRACT FROM AUTHOR]

The conjugate gradient is a useful tool in solving large- and small-scale unconstrained optimization problems. In addition, the conjugate gradient method can be applied in many fields, such as engineering, medical research, and computer science. In this paper, a convex combination of two different search directions is proposed. The new combination satisfies the sufficient descent condition and the convergence analysis. Moreover, a new conjugate gradient formula is proposed. The new formula satisfies the convergence properties with the descent property related to Hestenes–Stiefel conjugate gradient formula. The numerical results show that the new search direction outperforms both two search directions, making it convex between them. The numerical result includes the number of iterations, function evaluations, and central processing unit time. Finally, we present some examples about image restoration as an application of the proposed conjugate gradient method. [ABSTRACT FROM AUTHOR]

The different distance-based parameters are used to study the problems in various fields of computer science and chemistry such as pattern recognition, image processing, integer programming, navigation, drug discovery, and formation of different chemical compounds. In particular, distance among the nodes (vertices) of the networks plays a supreme role to study structural properties of networks such as connectivity, robustness, completeness, complexity, and clustering. Metric dimension is used to find the locations of machines with respect to minimum utilization of time, lesser number of the utilized nodes as places of the objects, and shortest distance among destinations. In this paper, lower bound of local fractional metric dimension for the connected networks is improved from unity and expressed in terms of ratio obtained by the cardinalities of the under-study network and the local resolving neighbourhood with maximum order for some edges of network. In the same context, the LFMDs of prism-related networks such as circular diagonal ladder, antiprism, triangular winged prism, and sun flower networks are computed with the help of obtained criteria. At the end, the bounded- and unboundedness of the obtained results is also shown numerically. [ABSTRACT FROM AUTHOR]

The configuration information of Integrated Modular Avionics (IMA) system includes almost all details of whole system architecture, which is used to configure the hardware interfaces, operating system, and interactions among applications to make an IMA system work correctly and reliably. It is very important to ensure the correctness and integrity of the configuration in the IMA system design phase. In this paper, we focus on modelling and verification of configuration information of IMA/ARINC653 system based on MARTE (Modelling and Analysis for Real-time and Embedded Systems). Firstly, we define semantic mapping from key concepts of configuration (such as modules, partitions, memory, process, and communications) to components of MARTE element and propose a method for model transformation between XML-formatted configuration information and MARTE models. Then we present a formal verification framework for ARINC653 system configuration based on theorem proof techniques, including construction of corresponding REAL theorems according to the semantics of those key components of configuration information and formal verification of theorems for the properties of IMA, such as time constraints, spatial isolation, and health monitoring. After that, a special issue of schedulability analysis of ARINC653 system is studied. We design a hierarchical scheduling strategy with consideration of characters of the ARINC653 system, and a scheduling analyzer MAST-2 is used to implement hierarchical schedule analysis. Lastly, we design a prototype tool, called Configuration Checker for ARINC653 (CC653), and two case studies show that the methods proposed in this paper are feasible and efficient. [ABSTRACT FROM AUTHOR]

To enhance the performance of deep auto-encoder (AE) under complex working conditions, a novel deep auto-encoder network method for rolling bearing fault diagnosis is proposed in this paper. First, multiscale analysis is adopted to extract the multiscale features from the raw vibration signals of rolling bearing. Second, the sparse penalty term and contractive penalty term are used simultaneously to regularize the loss function of auto-encoder to enhance the feature learning ability of networks. Finally, the cuckoo search algorithm (CS) is used to find the optimal hyperparameters automatically. The proposed method is applied to the experimental data analysis. The results indicate that the proposed method could more effectively distinguish fault categories and severities of rolling bearings under different working conditions than other methods. [ABSTRACT FROM AUTHOR]

Recently, wide applications of fuzzy set theory have attracted the attention of both researchers and practitioners. Fuzzy portfolio develops as a new area in the research field of investment portfolio. This paper investigates the major research hotspots, development trend, and evolution of fuzzy portfolio, which provides a systematic review of the current fuzzy portfolio literature. CiteSpace, the most commonly used bibliometrics software, is used in this article. According to the 602 articles with 15132 references, several conclusions can be summarized as follows: (1) Fuzzy portfolio becomes increasingly interdisciplinary with the connections among "Computer Science" and so on. (2) Most contributive authors are Markowitz and Zadeh. (3) South China University of Technology makes excellent performance in this research area and China is the most influential country. (4) European Journal of Operations Research is the cradle of plenty of crucial fuzzy portfolio investigations. (5) We find some research hotspots helpful to make scientific predictions of future trends by analyzing the keywords. By utilizing the effective bibliometric methods, we provide a comprehensive analysis and deep insights into the fuzzy portfolio research, enabling the individuals, especially the new beginners who are interested in this area to learn fuzzy portfolio, which will be of great help for their future explorations. [ABSTRACT FROM AUTHOR]

Ever since it was proposed, grey system theory has attracted the attention of scientific researchers and scholars. And it also has been widely used in many fields and solved a large number of practical problems in production, life, and scientific research. With the development and popularization of computer science and network technology, this traditional mathematical model can be applied more simply and efficiently to solve practical problems. Firstly, this paper, to implement steps of grey relational analysis, has made the exclusive analysis and has made the simple introduction to grey relational analysis characteristics. Then, based on grey relational theory and ASP.NET technology, the crop evaluation system is developed. Lastly, by using Excel and the crop evaluation system, the paper carries out a comprehensive evaluation about eight features of Fuji apple, which is from nine different producing areas, respectively. The experiment results show that the crop evaluation system is effective and could greatly improve the work efficiency of the researcher and expand the application scope. [ABSTRACT FROM AUTHOR]

The longest common subsequence (LCS) problem is a classic computer science problem. For the essential problem of computing LCS between two arbitrary sequences s1 and s2, this paper proposes an algorithm taking O(n+r) space and O(r+n2) time, where r is the total number of elements in the set (i,j)|s1[i]=s2[j]. The algorithm can be more efficient than relevant classical algorithms in specific ranges of r. [ABSTRACT FROM AUTHOR]

Dictionary learning (DL) and sparse representation (SR) based classifiers have greatly impacted the classification performance and have had good recognition rate on image data. In video semantic analysis (VSA), the local structure of video data contains more vital discriminative information needed for classification. However, this has not been fully exploited by the current DL based approaches. Besides, similar coding findings are not being realized from video features with the same video category. Based on the issues stated afore, a novel learning algorithm, called sparsity based locality-sensitive discriminative dictionary learning (SLSDDL) for VSA is proposed in this paper. In the proposed algorithm, a discriminant loss function for the category based on sparse coding of the sparse coefficients is introduced into structure of locality-sensitive dictionary learning (LSDL) algorithm. Finally, the sparse coefficients for the testing video feature sample are solved by the optimized method of SLSDDL and the classification result for video semantic is obtained by minimizing the error between the original and reconstructed samples. The experiment results show that the proposed SLSDDL significantly improves the performance of video semantic detection compared with the comparative state-of-the-art approaches. Moreover, the robustness to various diverse environments in video is also demonstrated, which proves the universality of the novel approach. [ABSTRACT FROM AUTHOR]

The present paper provides insight into an emerging research discipline called Psychoinformatics. In the context of Psychoinformatics, we emphasize the cooperation between the disciplines of psychology and computer science in handling large data sets derived from heavily used devices, such as smartphones or online social network sites, in order to shed light on a large number of psychological traits, including personality and mood. New challenges await psychologists in light of the resulting “Big Data” sets, because classic psychological methods will only in part be able to analyze this data derived from ubiquitous mobile devices, as well as other everyday technologies. As a consequence, psychologists must enrich their scientific methods through the inclusion of methods from informatics. The paper provides a brief review of one area of this research field, dealing mainly with social networks and smartphones. Moreover, we highlight how data derived from Psychoinformatics can be combined in a meaningful way with data from human neuroscience. We close the paper with some observations of areas for future research and problems that require consideration within this new discipline. [ABSTRACT FROM AUTHOR]

Algorithms represent one of the fundamental issues in computer science, while asymptotic notations are widely accepted as the main tool for estimating the complexity of algorithms. Over the years a certain number of asymptotic notations have been proposed. Each of these notations is based on the comparison of various complexity functions with a given complexity function. In this paper, we define a new asymptotic notation, called “Weak Theta,” that uses the comparison of various complexity functions with two given complexity functions. Weak Theta notation is especially useful in characterizing complexity functions whose behaviour is hard to be approximated using a single complexity function. In addition, in order to highlight the main particularities of Weak Theta, we propose and prove several theoretical results: properties of Weak Theta, criteria for comparing two complexity functions, and properties of a new set of complexity functions (also defined in the paper) based on Weak Theta. Furthermore, to illustrate the usefulness of our notation, we discuss an application of Weak Theta in artificial intelligence. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) have been quite a hot research area in the last few years. Due to their unique characteristics such as high dynamic topology and predictable mobility, VANETs attract so much attention of both academia and industry. In this paper, we provide an overview of the main aspects of VANETs from a research perspective. This paper starts with the basic architecture of networks, then discusses three popular research issues and general research methods, and ends up with the analysis on challenges and future trends of VANETs. [ABSTRACT FROM AUTHOR]

With the development of computer science, computational electromagnetics have also been widely used. Electromagnetic phenomena are closely related to eigenvalue problems. On the other hand, in order to solve the uncertainty of input data, the stochastic eigenvalue complementarity problem, which is a general formulation for the eigenvalue complementarity problem, has aroused interest in research. So, in this paper, we propose a new kind of stochastic eigenvalue complementarity problem. We reformulate the given stochastic eigenvalue complementarity problem as a system of nonsmooth equations with nonnegative constraints. Then, a projected smoothing Newton method is presented to solve it. The global and local convergence properties of the given method for solving the proposed stochastic eigenvalue complementarity problem are also given. Finally, the related numerical results show that the proposed method is efficient. [ABSTRACT FROM AUTHOR]

In recent years, theoretical and practical research on large-scale networked systems has gained an increasing attention from multiple disciplines including engineering, computer science, and mathematics. Lying in the core part of the area are the distributed estimation and fault detection problems that have recently been attracting growing research interests. In particular, an urgent need has arisen to understand the effects of distributed information structures on filtering and fault detection in sensor networks. In this paper, a bibliographical review is provided on distributed filtering and fault detection problems over sensor networks. The algorithms employed to study the distributed filtering and detection problems are categorised and then discussed. In addition, some recent advances on distributed detection problems for faulty sensors and fault events are also summarized in great detail. Finally, we conclude the paper by outlining future research challenges for distributed filtering and fault detection for sensor networks. [ABSTRACT FROM AUTHOR]

Node location is of great significance as a supporting technology of wireless sensor network (WSN). The information without position would be greatly devalued. So this paper is about location algorithm for nodes of ship-borne WSN based on research on structure of ship and work environment of ship-borne WSN. The whole location process consists of two steps: one is location algorithm among cabins (LAAC), and the other one is location algorithm in the cabin (LAIC). LAAC refers to location with the topology of ship-borne WSN. We can learn which cabin the node lies in. LAIC refers to location based on received signal strength indication (RSSI), we can get distance relationship between nodes by RSSI, and then obtain the specific location by solving this distance relationship. In the last part, this paper verifies the designed location algorithm by experimenting on "A" ship. Experiments show that the location algorithm designed by this paper is feasible. [ABSTRACT FROM AUTHOR]

This paper presents an efficient data aggregation approach for cluster-based underwater wireless sensor networks in order to prolong network lifetime. In data aggregation, an aggregator collects sensed data fromsurrounding nodes and transmits the aggregated data to a base station. The major goal of data aggregation is to minimize data redundancy, ensuring high data accuracy and reducing the aggregator's energy consumption. Hence, similarity functions could be useful as a part of the data aggregation process for resolving inconsistencies in collected data. Our approach is to determine and apply well-suited similarity functions for clusterbased underwater wireless sensor networks. In this paper, we show the effectiveness of similarity functions, especially the Euclidean distance and cosine distance, in reducing the packet size and minimizing the data redundancy of cluster-based underwater wireless sensor networks. Our results show that the Euclidean distance and cosine distance increase the efficiency of the network both in theory and simulation. [ABSTRACT FROM AUTHOR]

Big data and distributed computing are of great importance in wireless sensor networks (WSNs).They are always bonded together, and the latter one upholds the former one. In distributed computing, mobile agent model is the mainstream technology. With autonomy, communicativeness, mobility, and role, mobile agent model is more suitable for large-scale, resources-restrained WSN to deal with big data. This paper mainly studies migration schemes for mobile agents, determines core factors of migration strategy, and proposes SMLA and DMLA algorithms. And aiming at revealing the characteristics of target tracking, this paper puts forward pid-DMLA algorithm; and considering multiple agents' cooperation, it presents Mpid-DMLA algorithm. Moreover, this paper evaluates and analyzes the advantages and disadvantages of the above-mentioned four algorithms by simulations. [ABSTRACT FROM AUTHOR]

In the latest years, the rapid progress of urban computing has engendered big issues, which creates both opportunities and challenges. The heterogeneous and big volume of data and the big difference between physical and virtual worlds have resulted in lots of problems in quickly solving practical problems in urban computing. In this paper, we propose a general application framework of ELM for urban computing. We present several real case studies of the framework like smog-related health hazard prediction and optimal retain store placement. Experiments involving urban data in China show the efficiency, accuracy, and flexibility of our proposed framework. [ABSTRACT FROM AUTHOR]

Traditional optimization algorithms for blind signal separation (BSS) are mainly based on the gradient, which requires the objective function to be continuous and differentiable, so the applications of these algorithms are very limited. Moreover, these algorithms have problems with the convergence speed and accuracy. To overcome these drawbacks, this paper presents a modified glowworm swarm optimization (MGSO) algorithm based on a novel step adjustment rule and then applies MGSO to BSS. Taking kurtosis of the mixed signals as the objective function of BSS, MGSO-BSS succeeds in separating the mixed signals in Matlab environment. The simulation results prove that MGSO is more effective in capturing the global optimum of the objective function of the BSS algorithm and has faster convergence speed and higher accuracy, compared with particle swarm optimization (PSO) and GSO. [ABSTRACT FROM AUTHOR]

In social media, trust and distrust among users are important factors in helping users make decisions, dissect information, and receive recommendations. However, the sparsity and imbalance of social relations bring great difficulties and challenges in predicting trust and distrust. Meanwhile, there are numerous inducing factors to determine trust and distrust relations. The relationship among inducing factors may be dependency, independence, and conflicting. Dempster-Shafer theory and neural network are effective and efficient strategies to deal with these difficulties and challenges. In this paper, we study trust and distrust prediction based on the combination of Dempster-Shafer theory and neural network. We firstly analyze the inducing factors about trust and distrust, namely, homophily, status theory, and emotion tendency. Then, we quantify inducing factors of trust and distrust, take these features as evidences, and construct evidence prototype as input nodes of multilayer neural network. Finally, we propose a framework of predicting trust and distrust which uses multilayer neural network to model the implementing process of Dempster-Shafer theory in different hidden layers, aiming to overcome the disadvantage of Dempster-Shafer theory without optimization method. Experimental results on a real-world dataset demonstrate the effectiveness of the proposed framework. [ABSTRACT FROM AUTHOR]

This paper proposes a hybrid metaheuristic approach that improves global numerical optimization by increasing optimal quality and accelerating convergence. This algorithm involves a recently developed process for chemical reaction optimization and two adjustment operators (turning and mutation operators). Three types of mutation operators (uniform, nonuniform, and polynomial) were combined with chemical reaction optimization and turning operator to find the most appropriate framework. The best solution among these three options was selected to be a hybrid mutation chemical reaction optimization algorithm for global numerical optimization. The optimal quality, convergence speed, and statistical hypothesis testing of our algorithm are superior to those previous high performance algorithms such as RCCRO, HP-CRO2, and OCRO. [ABSTRACT FROM AUTHOR]

The assumption that the training and testing samples are drawn from the same distribution is violated under covariate shift setting, and most algorithms for the covariate shift setting try to first estimate distributions and then reweight samples based on the distributions estimated. Due to the difficulty of estimating a correct distribution, previous methods can not get good classification performance. In this paper, we firstly present two types of covariate shift problems. Rather than estimating the distributions, we then desire an effective method to select a maximum subset following the target testing distribution based on feature space split from the auxiliary set or the target training set. Finally, we prove that our subset selection method can consistently deal with both scenarios of covariate shift. Experimental results demonstrate that training a classifier with the selected maximum subset exhibits good generalization ability and running efficiency over those of traditional methods under covariate shift setting. [ABSTRACT FROM AUTHOR]

We consider algorithmic design, enhancement, and improvement of evolutionary computation as a mechanism design problem. All individuals or several groups of individuals can be considered as self-interested agents. The individuals in evolutionary computation can manipulate parameter settings and operations by satisfying their own preferences, which are defined by an evolutionary computation algorithm designer, rather than by following a fixed algorithm rule. Evolutionary computation algorithm designers or self-adaptive methods should construct proper rules and mechanisms for all agents (individuals) to conduct their evolution behaviour correctly in order to definitely achieve the desired and preset objective(s). As a case study, we propose a formal framework on parameter setting, strategy selection, and algorithmic design of evolutionary computation by considering the Nash strategy equilibrium of a mechanism design in the search process. The evaluation results present the efficiency of the framework. This primary principle can be implemented in any evolutionary computation algorithm that needs to consider strategy selection issues in its optimization process. The final objective of our work is to solve evolutionary computation design as an algorithmic mechanism design problem and establish its fundamental aspect by taking this perspective. This paper is the first step towards achieving this objective by implementing a strategy equilibrium solution (such as Nash equilibrium) in evolutionary computation algorithm. [ABSTRACT FROM AUTHOR]

A polygonal approximation method based on the new artificial bee colony (NABC) algorithm is proposed in this paper. In the present method, a solution is represented by a vector, and the objective function is defined as the integral square error between the given curve and its corresponding polygon. The search process, including the employed bee stage, the onlooker bee stage, and the scout bee stage, has been constructed for this specific problem. Most experiments show that the present method when compared with the DE-based method can obtain superior approximation results with less error norm with respect to the original curves. [ABSTRACT FROM AUTHOR]

Degradation diagnosis plays an important role for degraded character processing, which can tell the recognition difficulty of a given degraded character. In this paper, we present a framework for automated degraded character recognition system by statistical syntactic approach using 3D primitive symbol, which is integrated by degradation diagnosis to provide accurate and reliable recognition results. Our contribution is to design the framework to build the character recognition submodels corresponding to degradation subject to camera vibration or out of focus. In each character recognition submodel, statistical syntactic approach using 3D primitive symbol is proposed to improve degraded character recognition performance. In the experiments, we show attractive experimental results, highlighting the system efficiency and recognition performance by statistical syntactic approach using 3D primitive symbol on the degraded character dataset. [ABSTRACT FROM AUTHOR]

In order to simplify key management, two-party and three-party key agreement schemes based on user identities have been proposed recently. Multiparty (including more than three parties) key agreement protocols, which also are called conference key schemes, can be applied to distributed systems and wireless environments, such as ad hoc networks, for the purpose of multiparty secure communication. However, it is hard to extend two- or three-party schemes to multiparty ones with the guarantee of efficiency and security. In addition to the above two properties, interdomain environments should also be considered in key agreement systems due to diversified network domains. However, only few identity-based multiparty conference key agreement schemes for single domain environments and none for interdomain environments were proposed in the literature and they did not satisfy all of the security attributes such as forward secrecy and withstanding impersonation. In this paper, we will propose a novel efficient single domain identity-based multiparty conference key scheme and extend it to an interdomain one. Finally, we prove that the proposed schemes satisfy the required security attributes via formal methods. [ABSTRACT FROM AUTHOR]

In vehicular networks, the multihop message delivery from information source to moving vehicles presents a challenging task due to many factors, including high mobility, frequent disconnection, and real-time requirement for applications. In this paper, we propose a moving target oriented opportunistic routing algorithm in vehicular networks for message delivery from information source to a moving target vehicle. In order to adapt the constantly changing topology of networks, the forwarding decisions are made locally by each intermediate vehicle based on the trajectory information of the target vehicle. The simulation and real trace experiment show that our design provides an efficient message delivery with a higher success ratio, shorter success time, and lower transmission overhead compared with other reference approaches. [ABSTRACT FROM AUTHOR]

Dynamic service composition provides us with a promising approach to cooperate different sensor nodes in WSN to build complex applications based on their basic functions. Usually multiple nodes located in different regions provide data with different security levels, and it is critical to ensure the security of the information flow in the composite services. However, the energy-limited nature of sensor nodes in WSN poses a significant challenge for the centralized information flow verification with which the verification node needs to consume lots of computation and network resources. In this paper, we specify the security constraints for each service participant to secure the information flow in a service chain based in the lattice model and then present a distributed verification framework that cooperates different service participants to verify their information flow policies distributively The evaluation results show a significant decrease on the verification cost of the single verification node, which provides a better load balance in each sensor node. [ABSTRACT FROM AUTHOR]

With the increase of the storage capacity, computing, and wireless networking of the vehicular embedded devices, the vehicular networks bring a potential to enable new applications for drivers and passengers in the vehicles. Due to the prohibitive cost of deployment and management of a roadside unit (RSU), it is difficult to cover roads with a large number of RSUs so that every vehicle can always keep a connection with the nearby RSU. In this paper, we study the problem of deploying the RSUs to provide the desired connectivity performance while minimizing the number of the deployed RSUs. The key idea of our solution is to exploit the time-stable mobility pattern to find the optimal deployment places. We analyze a realistic vehicle trace, observe the mobility pattern, and propose a graph model to characterize it. Based on the graph model, we transform the gateway deployment problem into a vertex selection problem in a graph. By reducing it into the minimum vertex coverage problem, we show that the RSU deployment problem is NP-complete. Then, a heuristic algorithm RoadGate is proposed to search greedily the optimal positions. Extensive simulations based on the synthetic and realistic scenarios are carried out to evaluate the performance. The results show that RoadGate outperforms other approaches in terms of the number of required RSUs and the actual achieved coverage performance. [ABSTRACT FROM AUTHOR]

With the development of wireless sensor network (WSN) technologies, WSNs have been applied in many areas. In all WSN technologies, localization is a crucial problem. Traditional localization approaches in WSNs mainly focus on calculating the current location of sensor nodes or mobile objects. In this paper, we study the problem of future location prediction in WSNs. We assume the location histories of mobile objects as a rating matrix and then use a random walk based social recommender algorithm to predict the future locations of mobile objects. Experiments show that the proposed algorithm has better prediction accuracy and can solve the rating matrix sparsity problem more effectively than related works. [ABSTRACT FROM AUTHOR]

The key for cooperative collision avoidance (CCA) systems is the real-time and reliable delivery of safety-related messages among vehicles, which include periodical beacons and risk-triggered warning messages. In this paper, we first design a risk-aware dynamic medium-access control (R-MAC) protocol tailored for vehicular CCA applications. In this protocol, each frame is divided into two parts: TDMA segment for transferring beacons and CSMA segment for delivering warning messages. Then, we propose a stochastic model to predict the average total number of potential collisions in a platoon of vehicles, which determines the size of CSMA segment in the R-MAC protocol meticulously. Monte Carlo simulations validate that our model is reliable and practical. The performance of the R-MAC protocol is verified through theoretical analysis and extensive simulations under different traffic scenes. Simulation results show that R-MAC outperforms the traditional IEEE 802.11p protocol in terms of packets delivery rate and transmission delay, as well as the Jain's fairness index of the medium access between beacons and warning messages. [ABSTRACT FROM AUTHOR]

In Machine-to-Machine (M2M) communications, authentication of a device is of upmost importance for applications of Internet of Things. As traditional authentication schemes always assume the presence of a person, most authentication technologies cannot be applied in machine-centric M2M context. In this paper, we make the first attempt to formally model the authentication in M2M. We first model four attacking adversaries that can formulate all possible attacks in M2M, which are channel eavesdropping attack, credential compromise attack, function compromise attack, and ghost compromise attack. Next, we propose four models to tackle those corresponding adversaries, namely, credential-based model, machine-metrics-based model, reference-based model, and witness-based model. We also illustrate several concrete attacking methods and authentication approaches. We proof the authentication security for all proposed models and compare them for clarity. Our models present soundness and completeness in terms of authentication security, which can guide the design and analysis of concrete authentication protocols. Particularly, we construct a uniform authentication framework for M2M context and point out all possible authentication mechanisms in M2M. [ABSTRACT FROM AUTHOR]

In designing wireless sensor networks, it is important to reduce energy dissipation and prolong network lifetime. This paper presents research on the existing clustering algorithm applied in heterogeneous sensor networks and then puts forward an energy-efficient prediction clustering algorithm, which is adaptive to sensor networks with energy and objects heterogeneous. This algorithm enables the nodes to select the cluster head according to factors such as energy and communication cost, thus the nodes with higher residual energy have higher probability to become a cluster head than those with lower residual energy, so that the network energy can be dissipated uniformly. In order to reduce energy consumption when broadcasting in clustering phase and prolong network lifetime, an energy consumption prediction model is established for regular data acquisition nodes. Simulation results show that compared with current clustering algorithms, this algorithm can achieve longer sensor network lifetime, higher energy efficiency, and superior network monitoring quality. [ABSTRACT FROM AUTHOR]

Opportunistic activity recognition as research discipline is characterized by the fact that human activities (and more generally the context) shall be recognized with sensors that are initially unknown to the system. In contrast to "traditional" applications -- where sensors, their modalities, locations, and working characteristics have to be defined at design time-opportunistic systems do not rely on an initially defined and fixed sensing infrastructure. Sensors have to be utilized upon their spontaneous availability and activity recognition capabilities and dynamic sensor ensembles have to be configured at runtime with respect to maximized recognition accuracy and minimized energy consumption. This requirement contains two research challenges that this paper tackles: (i) estimating the accuracy of an ensemble without being able to compare the output in the form of recognized activity classes to a (labeled) ground truth and (ii) optimizing the accuracy/energy trade-off by applying exact and heuristic methods adapted for cooperative sensor ensembles. [ABSTRACT FROM AUTHOR]

Mobility is a common character of the emerging RFID-based internet-of-things. However, most of prior RFID anticollision algorithms ignore the movement of tags, which can degrade the identification performance seriously and even result in tag starvation problem. This paper presents a novel anticollision algorithm named Query Splitting-based Anticollision (QSA) for mobile RFID-based internet-of-things. By designing adaptive query, QSA reduces the number of collisions efficiently and makes it possible to identify multiple mobile tags without rollback. In QSA, we propose a query stack technology to avoid the rollback operation caused by new arriving tags, which solves the tag starvation problem under mobile environments. The performance evaluation shows that the proposed algorithm takes fewer timeslots and has better performance in identifying mobile tags. [ABSTRACT FROM AUTHOR]

Due to the low-cost and low-power requirement in an individual sensor node, the available computing resources turn out to be very limited like small memory footprint and irreplaceable battery power. Sensed data fusion might be needed before being transmitted as a tradeoff between procession and transmission in consideration of saving power consumption. Even worse, the application program needs to be complicated enough to be self-organizing and dynamically reconfigurable because changes in an operating environment continue even after deployment. State-driven operating system platform offers numerous benefits in this challenging situation. It provides a powerful way to accommodate complex reactive systems like diverse wireless sensor network applications. The memory usage can be bounded within a state transition table. The complicated issues like concurrency control and asynchronous event handling capabilities can be easily achieved in a well-defined behavior of state transition diagram. In this paper, we present an efficient and effective design of the state-driven operating system for wireless sensor nodes. We describe that the new platform can operate in an extremely resource constrained situation while providing the desired concurrency, reactivity, and reconfigurability We also compare the executing results after comparing some benchmark test results with those on TinyOS. [ABSTRACT FROM AUTHOR]