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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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]

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 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]

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]

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]

We live in a real society today with the Internet as the carrier. Marxist philosophy is of great significance to the study of computer science and technology majors, such as the standardization of learning methods and the improvement of learning horizons. In order to study the ideology of the current Internet carrier, this study first introduces the ideology in the Internet scenario and again describes the basic principles of Marxism. Web text data were collected from both static and dynamic websites, and the data were initially preprocessed using the ICTCLAS word separation tool. After that, a text lexicon set related to Marxism was built and combined with the surplus value calculation formula. Analysis of the text data shows that the expectation error of the Internet population approximately obeys a positive-term distribution, and the online text data are feasible in the estimation of the influence of Marxism. The statistical results show that the percentage of serious philosophical discussions from 2017 to 2021 in which Marxism is mentioned has steadily increased from 62% to 78%, indicating that Marxism still has great influence to this day. For these three different attitudes toward Marxism, the number of comments agreeing and disagreeing differed significantly, indicating that different groups of people show very different attitudes toward Marxism. [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]

Cloud computing is the result of the revolution in information technology and a massively complex computing system. As a model for business computing, cloud computing aims to facilitate resource sharing and collaborative work, meet the service needs of users, and generate revenue for cloud service providers. How to reasonably allocate cloud resources, efficiently manage and schedule massive application tasks in real time, reduce the cost of users, and increase the income of cloud service providers on the basis of ensuring the load balance of the cloud computing system and enhancing the utilization of cloud resources is, therefore, one of the research hotspots in the current cloud computing environment. Simultaneously, with the rapid development of human motion simulation and virtual reality technologies, the natural cooperation between humans and computers has become the primary focus of computer science research. The motion capture system is able to track, detect, capture, and record real-time human motion. By analyzing the captured three-dimensional data, we can determine the various characteristics of human motion posture at various times. Due to the potential research and practical value of motion capture technology, it is predominantly used in cutting-edge fields such as animation video production, rehabilitation medicine, sports training, and game software development, thereby effectively realizing the connection between the three-dimensional world and the real world. However, the combination of motion capture technology and educational activities is not universally applicable. This research proposes an approach to dance posture analysis based on matching feature vectors, which can be applied to dance teaching and significantly improves the quality of education and teaching activities. For the purpose of this study, it will be determined whether the combination of dance instruction-based motion capture technology and education is effective and feasible. [ABSTRACT FROM AUTHOR]

With the needs of developing technology, we aim to provide an open forum on this research idea, specifically in smart devices and their application, and related algorithms/applications. Recently, AI-oriented research has been provided with its fundamental research on application to networked systems [[4]] and the heuristic and metaheuristic algorithms also obtained much attention based on nature-inspired optimization algorithms [[5]]. From the Special Issue, we can see that the topics range from smart device development and applications to processing algorithm development and applications as well. [Extracted from the article]

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]

With the emergence and tremendous growth of text mining, a computer-assisted approach for capturing sentiment viewpoints from textual data is gradually becoming a promising field, particularly when researchers are increasingly facing the problem of filtering bunches of useless information without capturing the essence in the big data era. This study aims at observing and classifying the sentiment orientation in CEO letters, digging the main corporate social responsibility (CSR) themes, and examining the effectiveness of CEO letters' sentiment on forecasting financial performance. A specific sentiment dictionary has been proposed to identify and classify the sentiment orientation in CEO letters by utilizing the appraisal theory. Additionally, the qualitative data analysis software NVivo is applied to explore the CSR topics. Furthermore, a modified Altman's Z-score model and machine-learning approach are employed to predict financial performance. The results of preliminary evaluations validate that approximately 62.14% of the texts represent positive polarity even when companies are not in a promising economic situation. The CSR themes mainly focus on business ethical responsibility, particularly ethical activities. Among various machine-learning approaches, the logistic regression approach is appropriate for predicting financial performance with the state-of-the-art accuracy of 70.46 %. The encouraging results indicate that the sentiment information inCEO letters is a vital factor for anticipating financial performance. This work not only offers a new analytic framework for associating linguistic theory with computer science and economic models but will also improve stakeholders' decision-making. [ABSTRACT FROM AUTHOR]