Search

With the development of computer technology, automatic test paper generation systems have gradually become an effective tool for detecting and maintaining national machine security and protecting the rights and interests of workers. This article achieved multi-level oral scores for different types of questions through online scoring using artificial neural networks in recent years. Based on its specific situation and evaluation index requirements, an analysis module that is reasonable, efficient, and in line with the hierarchical structure and module requirements of national conditions has been designed to complete the research on automatic test paper generation technology, in order to help better manage and allocate human resources and improve production efficiency. Afterwards, this article conducted functional testing on the technical module. The test results showed that the scalability of the system was over 82%. [ABSTRACT FROM AUTHOR]

Differentiation/ranking of authors in the scientific sphere is carried out according to their influence on the particular field(s) of science. The impact of the contribution is measured by the impact a text has on the development of the field/issue. It can be measured by the usage of ideas from other researchers works given as citations. Nowadays, citations are tracked by specific algorithms and citation management systems that have access to various databases, catalogues and bibliography systems through metadata. In the presented article, I discuss problematic issues that authors are facing while writing texts in different languages (other than the English language) and publishing them in periodicals. The most popular (often indicative) texts/authors still fail to be captured/cached by the algorithms, therefore creating an imbalance between the actual number of citations performed by other scholars and cached h-index displayed by the algorithm. The paper discusses the causes of the problem and suggests solutions for both authors and publishers. [ABSTRACT FROM AUTHOR]

Digital automation in reconstruction of apictorial hand torn paper document increases efficacy and reduces human effort. Reconstruction of torn document has importance in various fields like archaeology, art conservation and forensic sciences. The devised novel technique for hand torn paper document, consists of pre-processing, feature extraction and reconstruction phase. Torn fragment's boundaries are simplified as polygons using douglas peucker polyline simplification algorithm. Features such as Euclidean distance and number of sudden changes in contour orientation are extracted. Our matching criteria identify the matching counterparts. Proposed features curtail ambiguity and enriches efficacy in reconstruction. Reconstructed results of hand torn paper document favour the proposed methodology. [ABSTRACT FROM AUTHOR]

The 5G technology will become a truly integrated technology. It's becoming the most famous technology because of its optimal system computing complex and transforming a group of individual network components. Adequate resources must be provided for the various devices that are typically on the same network. The various functions in the data system also require resource allocation to suit its needs. This will ensure that the various devices on that network perform different types of work effectively. It also represents the various device functionalites to ensure the estimated resources onetime manner. Only then will it be convenient to carry out a variety of jobs depending on their speed and selection. And its various data requirements vary according to the functionality of the various devices featured in this series segment dynamic configuration. In this paper a smart resource utilization scheme was proposed. Its main purpose is to better manage the off-the-shelf resources available here. And provide it where it is needed and streamline data delivery to users on the network. This ensures that all data goes to the users in the correct manner. The proposed method getting 49% energy consumption, 90% resource utilization, 92% resource reservation and 91% Quality of services. [ABSTRACT FROM AUTHOR]

Abstract: There are a number of issues which are involved with organizing a conference. Among these issues, assigning conference-papers to reviewers is one of the most difficult tasks. Assigning conference-papers to reviewers is automatically the most crucial part. In this paper, we address this issue of paper-to-reviewer assignment, and we propose a method to model the reviewers, based on the matching degree between the reviewers and the papers by combining a preference-based approach and a topic-based approach. We explain the assignment algorithm and show the evaluation results in comparison with the Hungarian algorithm. [Copyright &y& Elsevier]

Abstract: The paper describes a system for executable papers for publishers enabling them to reuse content and to generate further advances of science and engineering. The executable algorithmic descriptions within a paper are presented in natural language sentences and basic code, thereby making long term compatibility absolute. Authors are required to use publicly numerical libraries on the Internet or references to publications with executable papers. As used by authors the system automatically creates a web of algorithmic knowledge on the Internet. Novelty of new algorithms in publications can be evaluated by automated tools available to authors, reviewers and readers of scientific papers published. [Copyright &y& Elsevier]

Technical terms are vital elements for understanding the techniques used in academic research papers, and in this paper, we use focused technical terms to explore technical trends in the research literature. The major purpose of this work is to understand the relationship between techniques and research topics to better explore technical trends. We define this new text mining issue and apply machine learning algorithms for solving this problem by (1) recognizing focused technical terms from research papers; (2) classifying these terms into predefined technology categories; (3) analyzing the evolution of technical trends. The dataset consists of 656 papers collected from well-known conferences on ACM. The experimental results indicate that our proposed methods can effectively explore interesting evolutionary technical trends in various research topics. [ABSTRACT FROM AUTHOR]

Abstract: A lot of work has been done in the field of multi-valued model checking home and abroad. But some research works are not perfect. Some problems in the semantic definitions of temporal operators and corresponding model checking algorithms are found in the paper “Model Checking Using Partial Kripke Structure with 3-Valued Temporal Logic”. Some counterexamples are given to show these errors. On the basis of the discussion, some sound semantic definitions of temporal operators and correct algorithms of model checking for some temporal operators are given. [Copyright &y& Elsevier]

Academic research is crucial to the development of science and technology and is an important factor that affects national strength. When writing an academic research paper, a rhetorical structure is typically used to present the paper's ideas, but this task is quite difficult for junior researchers. To solve this problem, some studies have adopted text mining to assist with the writing, but the existing methods still require human intervention to generate sentences. Recently, due to the increasing maturity of deep learning technology and the ability to address the problem of automatic text generation, progress has been made in this area. The highly complex deep learning operations can correctly generate sequences and find correlations between sequences. When a user provides a few keywords and key sentences, the proposed algorithm can generate an introduction section for the user. The results show that the generated introduction is more coherent, clearer, and more fluent than existing summarization methods. In addition, the method proposed in this study improves the accuracy compared with traditional text extraction methods. The manuscript produced by this study has been evaluated to show that the study can produce a comprehensive introduction compared with previous studies. • The proposed framework can generate a comprehensive introduction based on users' brief inputs. • This paper demonstrates a three-testing-threshold approach to check the content quality. • The introduction generated through this method has less than 3% similarity to the original text by comparison. [ABSTRACT FROM AUTHOR]

The smart car collects the signal through the infrared sensor, and obtains the gray map in front of the car, according to the gray map, the tracking is judged.Due to the complexity of the environment, many gray-scale maps are difficult to trace, and even cannot be judged, which brings great uncertainty to the operation of the smart car.The paper designs a method to improve the infrared tracking accuracy of smart cars.First, determine the level of contrast in this graph.By improving the brightness in the grayscale image, the gray signal around the tracking line is eliminated, and then the tracking line is highlighted by increasing the contrast.Therefore, it effectively overcomes the shortcomings of poor practicality of smart cars and improves the infrared tracking accuracy of smart cars. [ABSTRACT FROM AUTHOR]

The article focuses on the research flaws in the study "The Harmful Effects of Algorithms in Grades 1-4," by Constance Kamii and Ann Dominick. The research explained the benefits of "no algorithms" experience in mastering arithmetic, where the authors theorized that the approach improved the ability of children to master mental math techniques and disadvantages of standard addition algorithm. The flaws proved that standard algorithms are essential in solving arithmetic problems in simple ways.

In this paper, a pipeline leakage detection algorithm based on information fusion of pressure and flow is proposed, and its core work is the construction of BPA based on discount factors. The wavelet packet decomposition is carried out for the original signals, and the processed signals are used to train different SVM classifiers to achieve the first identification results. For the samples whose initial classification results are not completely consistent, BPA is calculated according to the confusion matrixes of the initial SVM classifiers. In this paper, static discount factors and dynamic discount factors are constructed using different methods, and dynamic discount factors are modified when decisions fail. Then comprehensive discount factors are constructed based on the combination of different static discount factors and dynamic discount factors. The Shafer discount rule is used to modify BPA. Finally, D-S evidence theory is used to fuse the BPA results of all classifiers under different discount combinations. Experiments show that this algorithm can effectively use the correlation of evidences to reasonably fuse the decision results of multiple sensors, overcome the problem that the accuracy of a single sensor is not high enough for leakage identification, and improve the identification accuracy of pipeline leakage. [ABSTRACT FROM AUTHOR]

As urbanization progresses, urban road congestion has intensified, highlighting the need for effective vehicle and pedestrian detection as a cornerstone of public safety transportation. This area holds significant relevance in video surveillance and public safety domains. Despite its importance, achieving precise vehicle and pedestrian detection in complex road environments remains challenging. This paper presents a vehicle-pedestrian detection algorithm based on the improved YOLOv5. Key modifications include the integration of a small target detection layer and alterations to the feature pyramid using the feature fusion technique inherent to the weighted Bidirectional Feature Pyramid Network (BIFPN). This ensures efficient multi-scale feature fusion. A coordinated attention mechanism is introduced to preserve accurate target location data. Furthermore, the paper incorporates the SIOU metric to refine the localization loss function, bolstering both speed and edge regression accuracy. Experimental outcomes indicate that our improved YOLOv5 algorithm augments detection accuracy by 1.9% and achieves a detection speed of 67 FPS, which surpasses many competing target detection algorithms. [ABSTRACT FROM AUTHOR]

The year 2008 is etched in human history as the year of the 'Global Financial Crises'. Post the crises, Historians and financial commentators alike rushed to impute blame. Some blamed securitizations, some the banks and some Lehman Brothers and AIG. However, in the midst of all of this humbug, a key epicentre of the crises escaped academic scrutiny; 'Automation Technology'. The paper therefore aims to present an alternative view of financial history; one which impleads 'automation technology in finance' i.e., Risk Modelling Algorithms and RegTech. However, the underlying aim of this paper is to make a case against systemic automation bias in finance and to achieve that end, the paper employs an inter-disciplinary approach and uses history, law and data science to show case the multifarious perils of using automation technology blindfold in finance whilst also proposing possible solutions such as the incorporating of design thinking and systems theory in finance. Expired data sets, human assumptions, turning code in law, and a lack of standardized financial semantics as but some of these 'perils'. On the law front; it presents a twofold challenge under constitutional and anti-trust law and aims to reconcile law and technology. Lastly the paper aims to guide regulators by categorizing multiple stages of technological complexity and recommends application of different regulatory approaches to regulating automation. Therefore, the paper shall maintain a 'solution' oriented approach throughout. [ABSTRACT FROM AUTHOR]

p , q -quasirung orthopair fuzzy set (p , q -QOFS) is an extension of the q -rung orthopair fuzzy set (q -ROFS) theory used to represent uncertainty and vagueness in decision-making processes. The paper aims to utilize robust sine-trigonometric operational laws to investigate the group decision-making process within the p , q -QOFSs framework. The p , q -QOFS possess a distinctive characteristic of handling uncertain information by utilizing a wider space for membership representation compared to q -ROFS. Consequently, the current paper has been categorized into three distinct phases. In the initial phase, novel operational laws will be presented for p , q -QOFSs. The fundamental concept behind these newly proposed operations is to integrate the properties of the sine function, which include being periodic and symmetric about the origin, into the decision-making process for objects. Then, based on these laws, several operators for aggregating information will be obtained, along with their necessary properties and relationships. Lastly, an algorithm will be presented for interpreting the problem of multi attribute group decision-making (MAGDM), utilizing the operators, and demonstrating it with an illustrative example. A comprehensive comparative analysis will be conducted with some of the existing methods to uncover their impacts. [ABSTRACT FROM AUTHOR]

Honey badger algorithm (HBA) is a recent swarm-based metaheuristic algorithm that excels in simplicity and high exploitation capability. However, it suffers from some limitations including weak exploration capacity and an imbalance between exploration and exploitation. In this paper, an improved honey badger algorithm called ODEHBA is proposed to improve the performance of basic HBA. Firstly, an improved orthogonal opposition-based learning technique is employed to assist population in escaping local optimum. Secondly, differential evolution is utilized to ensure the enrichment of population diversity and to enhance convergence speed. Finally, the exploration capability of ODEHBA is boosted by an equilibrium pool strategy. To validate the efficacy of proposed ODEHBA, it is compared with 13 well-known metaheuristic algorithms on CEC2022 benchmark test sets. Friedman test and Wilcoxon rank-sum test are utilized to assess the performance of ODEHBA. Furthermore, three engineering design problems and Internet of Vehicles (IoV) routing problem are applied to validate the capability of ODEHBA. The simulation results demonstrate that ODEHBA excels in solving complex numerical problems, engineering design, and IoV routing problems. This holds significant practical implications for cost reduction and improved resource utilization. [ABSTRACT FROM AUTHOR]

Cognitive radio network (CRN) is getting growing interest of the researchers due to its wide applicability for spectrum sharing with massive number of active devices in Internet of Things (IoT). In existing schemes, a large part of the spectrum may remain underutilized which was assigned to service providers as primary users (PU). Secondary user (SU) may be the alternative to use the spectrum. The main challenge is that SU keeps on sending the packets in an incremental manner until a free channel is found in real conditions. It results in excessive communication and packet loss. This paper presents an efficient tree-centric approach where a centralized base-station maintains a tree of available channels and intelligently allocate to the SUs as per the real-time availability of channels. It analyzes for the effective usage of these channels by the SUs. It also manages the authenticated SUs to avoid any interference due to the hidden node problem. A number of extensive simulations are performed using network simulator. The existing instantaneous approaches require 10 to 12 attempts to send request for acquiring free channel with an average delay of 315 ms, the Hybrid-P1 and Hybrid-P2 approaches consumed 4 requests each with a delay of 128 ms to 135 ms. Our proposed CDC mechanism achieves a channel access mostly in 1 to 2 requests with an average delay of about 72 ms. Results are extracted from the trace files that prove the dominance of proposed scheme. [ABSTRACT FROM AUTHOR]

To address the problem of the non-line-of-sight (NLOS) errors in ultra-wideband (UWB) ranging and cumulative errors in LiDAR, this paper proposes an indoor localization method based on the Improved Harris Hawk Algorithm optimized particle filter. By introducing the improved Harris Hawk algorithm, the particle degradation phenomenon of particle filtering is eliminated which can reduce the required number of particles and improve the algorithm's operational speed and real-time performance. Additionally, the graph optimization method is employed to optimize the global bit position through the combined function of UWB/LiDAR. Experimental results demonstrate that, compared to the original particle filter algorithm, the number of particles required after optimization by the improved tennon whisker search algorithm is reduced to only 25%. Moreover, compared to single UWB and LiDAR positioning, the proposed method improves respectively the positioning accuracy by 41.87% and 78.42%. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper, we aim to optimize the two different social objectives of opinion optimization at equilibrium by controlling some individuals. This is usually called "Stackelberg games", in which a centralized authority is allowed to assign the strategies to a subset of individuals. The Stackelberg strategies of the centralized authority are the algorithms to select a subset of individuals and decide the actions for them in order to palliate the cost caused by the selfish behavior of the uncontrolled individuals. We give some combinatoral algorithms and linear program rounding algorithms as Stackelberg strategies for approximately optimizing the objective of utilitarian social cost (on special cases) and the objective of total expressed opinion (on general directed graphs), respectively. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of optimal preview pinning control for Boolean networks. The primary objective is to design efficient control strategies that leverage future reference information for improved control performance. We propose a policy iteration algorithm specifically for Boolean networks based on an augmented error system, constructed using the state augmentation technique in combination with the Exclusive-Or operator approach. The algorithm effectively optimizes control policies using future information. Finally, an example is presented to illustrate the effectiveness of the proposed algorithm. • First study of optimal preview pinning control problem of BNs. • Transformation using the semi-tensor product and exclusive-OR operator. • Deduction of a policy iteration algorithm for BNs. [ABSTRACT FROM AUTHOR]

Particle Swarm Optimization (PSO) is considered as one of Maximum Power Point Tracking (MPPT) controller algorithm developed for PhotoVoltaic system (PV) to guarantee a maximum power extraction under different climatic conditions of temperature and irradiation. Classical MPPT algorithms like Perturbe and Observe (P&O), PSO, Adaptive Neuro-Fuzzy Inference System (ANFIS) are an effective method for tracking the maximum power point (MPP) for the PV systems, but the problems with these approaches that they are less stable, high oscillation around steady state and slower convergence to the MPP. Based on recent research, the purpose of this paper is to introduces a novel MPPT controller based on a modified version of heterogeneous multi swarm PSO algorithm using an adaptive factor selection strategy (FMSPSO), to overcome the previous shortcomings and compared with conventional PSO, ANFIS and classical P&O controllers. Simulation and experimental results revealed that the new FMSPSO algorithm can overcome the previous shortcomings providing the superior performance to track the MPP efficiently with a shorter convergence time and small oscillations compared to other algorithms. The experimental confirmation of the FMSPSO algorithm has been carried out using NI-myRIO-1900 card and shows that with the proposed MPPT approach efficiency can reach a value greater than 99% even in climatic variation of irradiation and temperature. • A classical MPPT controller cannot track the dynamic the MPP, has obvious oscillations, and converges slowly. • A novel MPPT controller based on a modified version of MSPSO algorithm using an adaptive factor selection strategy (FMSPSO) is proposed. • A FMSPSO based MPPT algorithm is compared with conventional PSO, classical P&O and ANFIS controllers for validation. • The proposed FMSPSO algorithm provides the superior performance by boosting the PV system tracking efficiency more than 99%. [ABSTRACT FROM AUTHOR]

Web attacks often target web applications because they can be accessed over a network and often have vulnerabilities. The success of an intrusion detection system (IDS) in detecting web attacks depends on an effective traffic classification system. Several previous studies have utilized machine learning classification methods to create an efficient IDS with various datasets for different types of attacks. This paper utilizes the Canadian Institute for Cyber Security's (CIC-IDS2017) IDS dataset to assess web attacks. Importantly, the dataset contains 80 attributes of recent assaults, as reported in the 2016 McAfee report. Three machine learning algorithms have been evaluated in this research, namely random forests (RF), k-nearest neighbor (KNN), and naive bayes (NB). The primary goal of this research is to propose an effective machine learning algorithm for the IDS web attacks model. The evaluation compares the performance of three algorithms (RF, KNN, and NB) based on their accuracy and precision in detecting anomalous traffic. The results indicate that the RF outperformed the NB and KNN in terms of average accuracy achieved during the training phase. During the testing phase, the KNN algorithm outperformed others, achieving an average accuracy of 99.4916%. However, RF and KNN achieved 100% average precision and recall rates compared to other algorithms. Finally, the RF and KNN algorithms have been identified as the most effective for detecting IDS web attacks. [ABSTRACT FROM AUTHOR]

In recent years, there has been an increasing demand for efficient and robust control algorithms to optimize the performance of autonomous systems. Traditional control techniques often struggle to handle the complexity and uncertainty associated with such systems. To address these challenges, hybrid neuro-fuzzy-genetic algorithms have emerged as a promising approach. This paper presents a comprehensive review of the application of hybrid neuro-fuzzy-genetic algorithms for optimal control of autonomous systems. The proposed algorithms combine the strengths of neural networks, fuzzy logic, and genetic algorithms to achieve adaptive and optimal control in real-time scenarios. The neurofuzzy component provides the ability to model and handle complex and uncertain systems, while the genetic algorithm component facilitates the optimization of control parameters. The combination of these techniques enables autonomous systems to adapt and optimize their control strategies based on changing environments and objectives. The paper discusses the underlying principles of hybrid neuro-fuzzy-genetic algorithms, their advantages, and challenges. It also provides a review of the state-of-the-art research in this field, highlighting successful applications and potential future directions. Overall, the integration of neuro-fuzzy-genetic algorithms in autonomous systems holds great promise for achieving optimal control in various domains, including robotics, aerospace, and autonomous vehicles. [ABSTRACT FROM AUTHOR]

I n network information mining, people must measure the influence of important nodes in complex networks, otherwise it cannot be mined. However, traditional node influence measurement methods have defects and strong application limitations. Therefore, this paper proposes a multi-scale centrality algorithm under some traditional methods, and carries out related research. This paper introduces the basic concept and application advantages of multi-scale centrality algorithm, then constructs the algorithm model, and finally verifies the effectiveness of the algorithm model in the measurement of node influence in complex networks. After verification, the algorithm is effective and the measurement result is accurate. [ABSTRACT FROM AUTHOR]

With the construction of smart cities, smart ports are developing rapidly, providing favorable conditions for enhancing port competitiveness, promoting industrial upgrading, and economic transformation. With the continuous progress of society and science and technology, the safety risks of intelligent ports are also increasing. In order to better address these risks, it is necessary to establish a stable and efficient management system. This paper applies data mining and fuzzy control theory technologies for large-volume, high-precision real-time information collection, based on the research of the BP neural network algorithm. By establishing and analyzing a safety risk management system model based on the BP multilayer neuron network, it provides a rationality evaluation method and design concept. After designing the safety risk management system, this paper conducts a performance test on the system. The test results show that through optimization, the accuracy, generalization ability, and reliability of the model can be improved. Its accuracy is as high as 92% or more, fully demonstrating the system's reliability and superiority! [ABSTRACT FROM AUTHOR]

The rapid development of the Internet leads to the rapid growth of network information, we call it information explosion. The Internet is full of information, and it is difficult for users to find this information and useful knowledge of the ocean. The Web has become the world's largest information repository, and there is an urgent need for efficient access to the valuable knowledge of vast amounts of web information. The purpose of this paper is to study the process and algorithm analysis of text mining system based on artificial intelligence. This paper presents an algorithm of document feature acquisition based on genetic algorithm. Selecting suitable features is an important task in specific text classification and information retrieval. Finding appropriate feature vectors to represent the text will undoubtedly help with subsequent sorting and grouping. Based on the genetic algorithm of variable length chromosome, this paper improves the crossover, mutation and selection operations, and proposes an algorithm to obtain text feature vectors. This method has a wide range of applications and good results. [ABSTRACT FROM AUTHOR]

With the rapid growth of social economy, the requirements for resource utilization are becoming higher and higher. How to effectively solve the problem of energy shortage has become a hot topic. However, there are still many deficiencies in the current resource scheduling algorithm. For example, for different types of satellites with different needs and requirements, their performance indicators are different, and in the satellite communication system, the interaction between multiple nodes needs to be considered. Therefore, this paper studies the artificial intelligence algorithm, and proposes an improved particle complementary scheduling strategy for a single user in view of the shortcomings of the existing particle swarm optimization (PSO) algorithm. On this basis, this paper applies this method to evaluate the system performance and verify its effectiveness. The verification results show that the utilization efficiency of the satellite communication system resource scheduling algorithm is above 93%. [ABSTRACT FROM AUTHOR]

Big data has become the mainstream of information dissemination today. Big data plays an important role in the field of intelligent network monitoring. How to improve the hidden danger identification of intelligent network monitoring system and improve its accuracy is a hot issue to be solved. Therefore, in the context of big data, this paper uses intelligent analysis algorithm to identify and analyze the hidden dangers of intelligent network monitoring system. This paper mainly applies the methods of experimental setup, fuzzy analysis and data comparison to carry out relevant research on intelligent analysis of hidden danger identification of intelligent network monitoring system. The experimental data shows that the accuracy of the data obtained by the proposed method in the hidden danger identification is more than 50%, but less than 80%. Therefore, the application of background difference method needs further improvement. [ABSTRACT FROM AUTHOR]

This paper proposes an advanced expert collaborative filtering recommendation algorithm. Although ordinary expert system filtering algorithms have improved the recommendation accuracy of collaborative filtering technology to a certain extent, they have not screened the level of expertise of experts, and the credibility of experts varies. Therefore, this paper proposes an expert mining system based on signal fluctuations. The algorithm uses signal processing technology to filter the level of experts. This method introduces a kurtosis factor. Regarding the user's rating sequence as a random discrete signal, and then randomly sorting the user's ratings k times, the average kurtosis of the user is obtained. And take the kurtosis value as the credibility of expert users. Through experiments on multiple datasets including MovieLens, Jester, Booking-Crossings, and Last.fm, we have proved the advancement and reliability of our method. [ABSTRACT FROM AUTHOR]

Loop closure detection is a key component of visual simultaneous localization and mapping (VSLM), which can effectively reduce the cumulative error of the system and improve the accuracy of mapping. The current loop closure detection method using deep learning can obtain accurate scene descriptions, but it is difficult to cope with the challenge of scene changes. This paper obtains complementary feature maps by fusing the shallow and deep image features of the ResNet50 network, and we incorporate a multiscale channel attention mechanism and a spatial attention mechanism after each layer of the ResNet50 network. The model can effectively extract discriminative scene landmarks, suppress the effects of irrelevant local features on similarity and be more robust to the problem of scene change. The method in this paper has been tested on several publicly available datasets and compared with mainstream methods. The experimental results show that the proposed method significantly outperforms mainstream methods in terms of accuracy-recall performance. [ABSTRACT FROM AUTHOR]

The problem of programming with fuzzy coefficients and fuzzy variables is more general. This paper studies the quadratic programming problem whose parameters are all fuzzy numbers based on the A-PSO algorithm. Especially, the four operations of triangular fuzzy numbers are extended and an improved sorting method for triangular fuzzy numbers is proposed that takes into consideration the diverse membership of each point. Moreover, the exact solution steps of the fully fuzzy quadratic programming problem are given by the new method proposed in this paper. Numerical examples are submitted to compare and analyze the algorithm and results, which demonstrate the efficiency and effectiveness of the proposed method. Finally, the method is increased to solve all fuzzy nonlinear programming problems. [ABSTRACT FROM AUTHOR]

This paper proposes a novel approach to improving the security of transmitted text using a combination of image key cryptography and deepnets. The traditional methods of text encryption and decryption rely heavily on mathematical algorithms, which can be susceptible to attacks. In this paper, we introduce the concept of image key cryptography, where an image is used as the encryption key. By utilizing the complex patterns and structures present in images, the security of the encryption process is significantly enhanced. Additionally, we employ deepnets, a type of deep neural network, to further strengthen the encryption process and provide an additional layer of security. We evaluate the proposed approach through experiments and compare its performance with existing encryption methods. The results demonstrate that our method offers improved security and robustness against attacks, making it a promising solution for transmitting sensitive text data. [ABSTRACT FROM AUTHOR]

Data monitoring is an important foundation of modern science. In most cases, the monitoring data is time-series data, which has high application value. The deep learning algorithm has a strong nonlinear fitting capability, which enables the recognition of time series by capturing anomalous information in time series. At present, the research of time series recognition based on deep learning is especially important for data monitoring. Deep learning algorithms require a large amount of data for training. However, abnormal sample is a small sample in time series, which means the number of abnormal time series can seriously affect the accuracy of recognition algorithm because of class imbalance. In order to increase the number of abnormal sample, a data augmentation method called GANBATS (GAN-based Bi-LSTM and Attention for Time Series) is proposed. In GANBATS, Bi-LSTM is introduced to extract the timing features and then transfer features to the generator network of GANBATS.GANBATS also modifies the discriminator network by adding an attention mechanism to achieve global attention for time series. At the end of discriminator, GANBATS is adding averagepooling layer, which merges temporal features to boost the operational efficiency. In this paper, four time series datasets and five data augmentation algorithms are used for comparison experiments. The generated data are measured by PRD(Percent Root Mean Square Difference) and DTW(Dynamic Time Warping). The experimental results show that GANBATS reduces up to 26.22 in PRD metric and 9.45 in DTW metric. In addition, this paper uses different algorithms to reconstruct the datasets and compare them by classification accuracy. The classification accuracy is improved by 6.44%-12.96% on four time series datasets. [ABSTRACT FROM AUTHOR]

The remarkable advancement of quantum steganography offers enhanced security for quantum communications. However, there is a significant concern regarding the potential misuse of this technology. Moreover, the current research on identifying malicious quantum steganography is insufficient. To address this gap in steganalysis research, this paper proposes a specialized quantum steganalysis algorithm. This algorithm utilizes quantum machine learning techniques to detect steganography in general quantum secure communication schemes that are based on pure states. The algorithm presented in this paper consists of two main steps: data preprocessing and automatic discrimination. The data preprocessing step involves extracting and amplifying abnormal signals, followed by the automatic detection of suspicious quantum carriers through training on steganographic and non-steganographic data. The numerical results demonstrate that a larger disparity between the probability distributions of steganographic and non-steganographic data leads to a higher steganographic detection indicator, making the presence of steganography easier to detect. By selecting an appropriate threshold value, the steganography detection rate can exceed 90%. [ABSTRACT FROM AUTHOR]

Graphs are the most complex data structure that involves heavy mathematical computations. Various real-time applications use the graph at storage, processing, object characterization, and behavior specification stages. The connectivity analysis, coverage building, and routing are the critical applications of graph evaluation. Various associated applications need the exploration of a graph with a practical and real-time outcome. The processing of larger graphs is a big challenge for the researcher. In this paper, a hybrid graph-based computation optimization method is designed to optimize the performance of graph processing in multi-core processors. The BFS algorithm is applied over the multiple processors to optimize the functional response. The multithreaded-BFS is implemented to reduce the time of graph processing and computation. The proposed algorithm is implemented in the OpenMP environment. The experimentation is done on two-core and four-core processors. The experiment is conducted on a 100 to 1000-node network. The traversing and graph coloring algorithms are implemented for the analysis. The comparative analysis is conducted on single-core and multi-core processors with DFS and BFS-based algorithms. The analysis results identified that the proposed algorithm reduced the processing time effectively. [ABSTRACT FROM AUTHOR]

Electroencephalogram (EEG) technology is vital in art design decisions making and has become a prevalent research trend. However, With the temporal variability in EEG signals, there is a problem of low model prediction accuracy. Therefore, We propose an EEG signal recognition algorithm called the Time-Slicing and Deep Residual Network (TS-DRN). First, we present the subjects with the patterns of different styles of designs to capture their EEG signals. Second, we employ the time-slicing strategy to process the original signal, enhancing the number of training samples and reducing the sample features' dimensionality. Finally, we use the combined EEG feature maps as inputs to the deep residual network to obtain the classification results. Our experimental results demonstrate that this paper's EEG signal classification accuracy is 85.8%, demonstrating our method's effectiveness for EEG signal classification. [ABSTRACT FROM AUTHOR]

Because of the phenomenal expansion of Internet of Things (IoT) devices around the world, Wireless Sensor Networks (WSN) have become increasingly important among the technical community, and research in this area has been growing exponentially. Researchers have used a variety of WSN technologies to address issues such as processing power constraints, bandwidth-limited connections, delays and energy consumption outlines that arise with sensor networks. However, in terms of delay optimization, affordability and effective energy consumption, WSN is the most suitable and alluring technology. This paper uses an Enhanced Scheduling Algorithm (ESA) with a probabilistic approach called Random Classical Game Theory (RCGT) to reduce the delay in WSN. Retransmissions are minimized when ESA and RCGT are used, which improve WSN delay. The idea is to improve the scheduling algorithm by using RCGT to lengthen the lifespan of the entire network. It has been demonstrated that the improved technique outperforms the existing algorithms in terms of throughput, energy consumption, hop count, delay and lifespan ratio. [ABSTRACT FROM AUTHOR]

Edge computing is frequently employed in the Internet of Vehicles, although the computation and communication capabilities of roadside units with edge servers are limited. As a result, to perform distributed machine learning on resource-limited MEC systems, resources have to be allocated sensibly. This paper presents an Improved MADDPG algorithm to overcome the current IoV concerns of high delay and limited offloading utility. Firstly, we employ the MADDPG algorithm for task offloading. Secondly, the edge server aggregates the updated model and modifies the aggregation model parameters to achieve optimal policy learning. Finally, the new approach is contrasted with current reinforcement learning techniques. The simulation results show that compared with MADDPG and MAA2C algorithms, our algorithm improves offloading utility by 2% and 9%, and reduces delay by 29.6%. [ABSTRACT FROM AUTHOR]

Access points (APs) are used to define coordinates in an indoor positioning system with Wi-Fi. These systems utilize existing infrastructure and Wi-Fi APs to find out the exact location of a device based on its RSSI and MAC address. The accuracy of these devices usually depends on the number of APs located nearby and the environment in which they are deployed. Therefore, the ideal selection of these points increases the discernibility of the localization technique. The rapid development of metaheuristic algorithms in recent years has demonstrated their effectiveness in resolving challenging optimization issues. The primary research goal is to investigate how to enhance indoor localization accuracy with metaheuristic algorithms and to assess the efficacy of positioning using these methods. In this paper, we propose a novel optimization algorithm called the Improved Pathfinder Algorithm (IPFA) using metaheuristic hybridization, where our contribution is twofold. The IPFA's superiority in optimization is used to choose the important APs. Subsequently, to maintain the generality of the localization performance, we created a feature-based classification model for the chosen AP subsets. Two prominent benchmark datasets, UJIIndoorLoc and JUIndoorLoc, were used to test the proposed framework. The proposed Indoor Localization framework attained an accuracy of 98.26% with a mean absolute error (MAE) of approximately 0.79 m. The results demonstrate that the IPFA method is capable of accurately locating the position with minimal positioning errors. [ABSTRACT FROM AUTHOR]

In recent times, the use of autonomous mobile robots (AMRs) has increased in many industries. As more AMRs roam the same area, traffic management becomes essential to prevent congestion and deadlocks. In related work, traffic management is often achieved using sophisticated, centralised planning approaches, albeit this often suffers from scalability issues. This paper therefore explores an approach where multi-AMR traffic management is achieved with layered costmaps and a modified Dijkstra's algorithm. This keeps the global path planner in the individual AMRs, thus not suffering scalability issues. To achieve multi-AMR coordination, traffic lanes and restricted areas are added to the AMRs' global costmaps. Furthermore, the AMRs also use a modified Dijkstra's algorithm that supports implementation of traffic directions. A proof-of-concept solution is implemented in Robot Operating System 2 with Nav2 and Gazebo. The implemented solution was tested against a standard solution without any traffic management in three scenarios designed to provoke collisions. The results indicate that the implemented solution can prevent a set of collisions better than one without traffic management. [ABSTRACT FROM AUTHOR]

Ant Colony Optimization and Particle Swarm Optimization represent two widely used Swarm Intelligence (SI) optimization techniques. Information processing using Multiple-Valued Logic (MVL) is carried out using more than two discrete logic levels. In this paper, we compare two the SI-based algorithms in synthesizing MVL functions. A benchmark consisting of 50,000 randomly generated 2-variable 4-valued functions is used for assessing the performance of the algorithms using the benchmark. Simulation results show that the PSO outperforms the ACO technique in terms of the average number of product terms (PTs) needed. We also compare the results obtained using both ACO-MVL and PSO-MVL with those obtained using Espresso-MV logic minimizer. It is shown that on average, both of the SI-based techniques produced better results compared to those produced by Espresso-MV. We show that the SI-based techniques outperform the conventional direct-cover (DC) techniques in terms of the average number of product terms required. [ABSTRACT FROM AUTHOR]

Clustering algorithms are part of algorithms of unsupervised-learning that are commonly used in different fields. Two major impacts on the data clustering algorithm have been the rapid developments and creation of electronic data. This includes the view of how the big data is stored as well as how it is processed. A cluster has a high level of resemblance to the same cluster and a low level of resemblance to other clusters. Clustering algorithms are commonly used in all fields, such as retail, banking, development, etc.. Even though different methodologies are proposed with different scenarios, but none of the existing methodologies are proven to be a better approaches. Here, in our work we have adopted an improved Map- Reduce programming model to combine the Canopy clustering and K-means clustering algorithms to process the Microarray data with the available commodity hardware with an aim to achieve better performance. The results obtained from different scenarios shown that the proposed method was capable of improving computational speed significantly by increasing the nodes as required. In this research, this paper explored the efficiency by evaluating and implementing the proposed Improved k-means with Improved Map Reduce algorithm which runs on Hadoop Frame work using Microarray dataset along with different datasets. [ABSTRACT FROM AUTHOR]

Fire is one of the most common disasters for human beings. It is also one of the disasters that cameras can easily catch. In order to detect a series of building fires efficiently, a fire image detection algorithm based on YOLOv4 is proposed in this paper. This algorithm can realize the real-time fire warning by identifying all images in the video. The comparison of different evaluation results found that the YOLOv4 fire image detection algorithm using both optimization algorithms achieved higher AP and recall rates. [ABSTRACT FROM AUTHOR]

The Graph Coloring Problem is a well-known NP-hard problem. Over the years, numerous scholars have been pursuing efficient algorithms to obtain high-quality solutions. Nested Rollout Policy Adaptation (NRPA) is a Monte Carlo Tree Search algorithm for single-player games, and it has been proven effective and good in combinatorial optimization problems. In this paper, we use for the first time the NRPA algorithm combined with the destruction and reconstruction ideas of the Iterative Greedy algorithm to solve the Graph Coloring Problem. First, the basic principle of the NRPA algorithm is introduced. Then, NRPA is extended by using mixed sorting, destruction and reconstruction, and the Diversity-NRPA algorithm is proposed, which improves the diversity of the algorithm. Finally, Diversity-NRPA is applied to solve the Graph Coloring Problem by combining it with the knowledge of the graph theory field. We evaluate the performance of Diversity-NRPA on DIMACS, a well-known graph benchmark instance, and compare it with traditional graph coloring algorithms. The experimental results show that the Diversity-NRPA algorithm can achieve excellent performance in both solution quality and search efficiency in solving the Graph Coloring problem. [ABSTRACT FROM AUTHOR]

Session-based recommendation is a technique that leverages the user's interaction sequence within a brief period to generate personalized recommendations. Currently, traditional transformer-based methods lack the capability to mitigate noise node interference in session sequences, while approaches based on heterogeneous graphs face challenges in capturing long-term sequential dependencies effectively. To tackle these challenges, a heterogeneous graph-enhanced Transformer session-based recommendation method is proposed in this paper. The proposed method constructs a heterogeneous session graph and utilizes a self-attention layer enhanced by the shortest path matrix. This enables the capturing of item embeddings that contains crucial graph structure information. Moreover, the method incorporates adversarial training to prevent excessive reliance on local graph information and achieve a more balanced integration of local and global information. After evaluating experiments on three public datasets, the results clearly demonstrate a remarkable enhancement compared to other robust baseline models, thus providing strong evidence of the method's effectiveness. [ABSTRACT FROM AUTHOR]

Traditional recognition methods often lead to problems such as speaker information loss and reduced recognition rates. To address these problems, an Fca-Res2Net speaker recognition model incorporating a self-attentive mechanism is proposed in this paper. First, the model uses the modified mel-frequency cepstral coefficients (MFCCs) as the system feature input and combines the inverse mel-frequency cepstral coefficients (IMFCCs) with the MFCCs as the base input features to extract more representative speech spectral features. On this basis, the difference parameters △MFCC and △IMFCC are fused to fully extract the speech dynamic and static features in the high- and low-frequency bands. Second, frequency channel attention networks (FcaNets) are introduced on top of the baseline model (Res2Net: a new multiscale backbone architecture), and the residual module is used to fuse the shallow and deep speaker features to better obtain the different feature channel weights without increasing the number of parameters. In addition, to better introduce temporal information and capture long-span speech features, the self-attention mechanism is integrated to enhance the long-span modelling of speech features. Finally, the classification output results are identified. Experimental results show that the proposed model improves the recognition rate and robustness of speakers in long speech when compared with the current mainstream speaker recognition methods in the VoxCeleb dataset with sufficient data volume. [ABSTRACT FROM AUTHOR]

Due to the development of new technologies such as the Internet and cloud computing, high requirements have been placed on the storage and management of big data. At the same time, new applications in the cloud computing environment also pose new requirements for cloud storage systems, such as strong scalability and high concurrency. Currently, the existing nosql database system is based on cloud computing virtual resources, supporting dynamic addition and deletion of virtual nodes. Based on the study of phase space reconstruction, the necessity of considering traffic flow as a chaotic time series is analyzed. In addition, offline data migration methods based on load balancing are also studied. Firstly, a data migration model is proposed through analysis, and the factors that affect migration performance are analyzed. Based on this, optimization objectives for migration are proposed. Then, the system design of data migration is presented, and optimization research is conducted from two aspects around the migration optimization objectives: optimizing from the data source layer, and proposing the LBS method to convert data sources into distributed data sources, ensuring the balanced distribution of data and meeting the scalability requirements of the system. This paper applies cloud computing technology and phase space reconstruction to load balancing scheduling algorithms to promote their development. [ABSTRACT FROM AUTHOR]

Makkah has developed unique architectural vocabularies for centuries. The Roushan, Qalalib, Kharja, and Shwabir responded to topography, climate conditions, and socio-cultural aspects. However, demolishing heritage buildings to expand the Holy Mosque has led to the disappearance of many traditional architectural vocabularies. Then, the imposition of modern architectural elements by modernity increased a feeling of discontinuity with the past. In addition, globalization has branded Makkah as a city of skyscrapers and high-rise buildings. Megaprojects have emerged since Saudi Arabia announced its Vision 2030, necessitating creative architectural solutions. Although the literature on the architecture of Makkah introduced varied approaches to developing traditional architectural vocabularies, the results were far from anticipated. Most studies assumed that traditional elements should shape the future of architecture in Makkah. The field of architecture suggests analyzing physical forms in reality, while the philosophical attempt proposes exploring them in virtuality. Reality and virtuality must be dynamic in space as methods for innovation; this space should be detached from architecture to challenge physical norms and separated from philosophy to promote practicality. This paper maps the literature to evaluate the approaches that examine the architecture of Makkah. It suggests a third space, outside architecture, and philosophy, utilizing AI to generate Makkah's architectural elements. The aim is to employ technology, i.e., AI, not to document but to generate architectural vocabulary based on rising potentials and differentiations, which are the bases of innovation, hence establishing continuity with the past to shape the future. [ABSTRACT FROM AUTHOR]

In this paper, a brain-like navigation scheme based on fuzzy kernel C-means (FKCM) clustering assisted pyramid Lucas Kanade (LK) optical flow algorithm is developed to measure the position of vehicle. The Speed Cell and Place Cell in animals' brain are introduced to construct the brain-like navigation mechanism which involves the optical flow method and image template matching to imitate the cells above-mentioned separately. To eliminate the singular values during optical flow calculation, the output of pyramid LK algorithm is clustered by FKCM algorithm firstly. Then, the velocity is calculated and integrated to get the position of the vehicle, and the brain-like navigation scheme is introduced to correct the position measurement errors by eliminating the accumulated errors resulting from velocity integration. The prominent advantages of the presented method are: (i) a pure visual brain-like position measurement method based on the concept of speed cells and place cells is proposed, making visual navigation more accurate and intelligent; (ii) the FKCM algorithm is used to eliminate the singular value of the pyramid LK algorithm, which improves the calculated velocity accuracy. Also, experimental comparison with classical pyramid LK algorithm is given to illustrate the superiority of the proposed method in position measurement. • Analyzed impact of clustering algorithms on optical flow precision. • Achieved notable reduction in optical flow singular value. • Brain-like navigation minimizes velocity integral errors. [ABSTRACT FROM AUTHOR]