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]