Search

Achieving community immunity against the coronavirus disease 2019 (COVID-19) depends on vaccinating the largest number of people within a specific period while taking all precautionary measures. To address this problem, this paper presents a smart parking system that will help the health crisis management committee to vaccinate the largest number of people with the minimum period of time while ensuring that all precautionary measures are followed, through a set of algorithms. These algorithms seek to ensure a uniform distribution of persons in parking. This paper proposes a novel complex system for smart parking and nine algorithms to address the NP-hard problem. The experimental results demonstrate the performance of the proposed algorithms in terms of gap and time. Applying these algorithms to smart cities to ensure precautionary measures against COVID-19 can help fight against this pandemic. [ABSTRACT FROM AUTHOR]

This paper uses big data technology to extract the electromechanical fault characteristics of metro vehicles and analyze the current situation under different fault conditions to ensure the operation quality and safety of metro operations. It also establishes a simulation model to simulate the current waveform of metro vehicles under different fault conditions and analyze the fault phenomenon. The simulation test results show that: (1) The current waveform of a single transistor with the hard fault is compared with the simulated current waveform under a normal state. The upper part of the A phase current waveform is lost when T1 fails. When T2 fails, the current waveform in the lower half of the C phase current is lost. When T3 fails, the upper half of the B phase current waveform is lost. (2) The current waveform in the hard fault's upper and lower bridge arms will have phase loss. In the T25 fault, the C phase current is completely lost. In the T14 fault, the phase A current waveform is completely lost. In the T36 fault, the phase B current is completely lost. (3) The current waveform of a single transistor with a soft fault is complete, but the overall current amplitude is reduced. When a T1 fails, the A phase current tends to rise first and then fall. Compared to normal, the amplitude of the current decreases, and the peak decreases slightly. (4) The current values of phase B and phase C of the two transistors on the same bridge above and below the soft fault are mostly the same. The phase A current output value decreases in both the positive and negative half cycles. This paper aims to improve the monitoring ability of the monitoring system of electromechanical equipment of metro vehicles, which plays a specific role in maintaining the safety of subway operations and improving the quality of subway operations. [ABSTRACT FROM AUTHOR]

The quality of the data in core electronic registers has constantly decreased as a result of numerous errors that were made and inconsistencies in the data in these databases due to the growing number of databases created with the intention of providing electronic services for public administration and the lack of the data harmonization or interoperability between these databases. Evaluating and improving the quality of data by matching and linking records from multiple data sources becomes exceedingly difficult due to the incredibly large volume of data in these numerous data sources with different data architectures and no unique field to create interconnection among them. Different algorithms are developed to treat these issues and our focus will be on algorithms that handle large amounts of data, such as Levenshtein distance (LV) algorithm and Damerau-Levenshtein distance (DL) algorithm. In order to analyze and evaluate the effectiveness and quality of data using the mentioned algorithms and making improvements to these algorithms, through this paper we will conduct experiments on large data sets with more than one million records. [ABSTRACT FROM AUTHOR]

Collecting and analyzing data from all devices to improve the efficiency of business processes is an important task of Industrial Internet of Things (IIoT). In the age of data explosion, extensive text data generated by the IIoT have given birth to a variety of text representation methods. The task of text representation is to convert the natural language to a form that computer can understand with retaining the original semantics. However, these methods are difficult to effectively extract the semantic features among words and distinguish polysemy in natural language. Combining the advantages of convolutional neural network (CNN) and variational autoencoder (VAE), this paper proposes an intelligent CNN-VAE text representation algorithm as an advanced learning method for social big data within next-generation IIoT, which help users identify the information collected by sensors and perform further processing. This method employs the convolution layer to capture the local features of the context and uses the variational technique to reconstruct feature space to make it conform to the normal distribution. In addition, the improved word2vec model based on topical word embedding (TWE) is utilized to add topical information to word vectors to distinguish polysemy. This paper takes the social big data as an example to illustrate the way of the proposed algorithm applied in the next-generation IIoT and utilizes Cnews dataset to verify the performance of proposed method with four evaluating metrics (i.e., recall, accuracy, precision, and F1-score). Experimental results indicate that the proposed method outperforms word2vec-avg and CNN-AE in K-nearest neighbor (KNN), random forest (RF), and support vector machine (SVM) classifiers and distinguishes polysemy effectively. [ABSTRACT FROM AUTHOR]

The paper addresses the challenge of transmitting a big number of files stored in a data center (DC), encrypting them by compilers, and sending them through a network at an acceptable time. Face to the big number of files, only one compiler may not be sufficient to encrypt data in an acceptable time. In this paper, we consider the problem of several compilers and the objective is to find an algorithm that can give an efficient schedule for the given files to be compiled by the compilers. The main objective of the work is to minimize the gap in the total size of assigned files between compilers. This minimization ensures the fair distribution of files to different compilers. This problem is considered to be a very hard problem. This paper presents two research axes. The first axis is related to architecture. We propose a novel pre-compiler architecture in this context. The second axis is algorithmic development. We develop six algorithms to solve the problem, in this context. These algorithms are based on the dispatching rules method, decomposition method, and an iterative approach. These algorithms give approximate solutions for the studied problem. An experimental result is implemented to show the performance of algorithms. Several indicators are used to measure the performance of the proposed algorithms. In addition, five classes are proposed to test the algorithms with a total of 2350 instances. A comparison between the proposed algorithms is presented in different tables discussed to show the performance of each algorithm. The result showed that the best algorithm is the Iterative-mixed Smallest-Longest-Heuristic (ISL) with a percentage equal to 97.7% and an average running time equal to 0.148 s. All other algorithms did not exceed 22% as a percentage. The best algorithm excluding ISL is Iterative-mixed Longest-Smallest Heuristic (ILS) with a percentage equal to 21,4% and an average running time equal to 0.150 s. [ABSTRACT FROM AUTHOR]

This paper analyses the phenomenology and epistemology of chatbots such as ChatGPT and Bard. The computational architecture underpinning these chatbots are large language models (LLMs), which are generative artificial intelligence (AI) systems trained on a massive dataset of text extracted from the Web. We conceptualise these LLMs as multifunctional computational cognitive artifacts, used for various cognitive tasks such as translating, summarizing, answering questions, information-seeking, and much more. Phenomenologically, LLMs can be experienced as a "quasi-other"; when that happens, users anthropomorphise them. For most users, current LLMs are black boxes, i.e., for the most part, they lack data transparency and algorithmic transparency. They can, however, be phenomenologically and informationally transparent, in which case there is an interactional flow. Anthropomorphising and interactional flow can, in some users, create an attitude of (unwarranted) trust towards the output LLMs generate. We conclude this paper by drawing on the epistemology of trust and testimony to examine the epistemic implications of these dimensions. Whilst LLMs generally generate accurate responses, we observe two epistemic pitfalls. Ideally, users should be able to match the level of trust that they place in LLMs to the degree that LLMs are trustworthy. However, both their data and algorithmic opacity and their phenomenological and informational transparency can make it difficult for users to calibrate their trust correctly. The effects of these limitations are twofold: users may adopt unwarranted attitudes of trust towards the outputs of LLMs (which is particularly problematic when LLMs hallucinate), and the trustworthiness of LLMs may be undermined. [ABSTRACT FROM AUTHOR]

Since demand forecasting is the first step in managing and operating a tourism business, its accuracy is very important to tourism businesses. In order to address NN's drawbacks, such as local optimization, slow convergence, and large sample sizes, this paper organically combines the PSO and NN models and builds a PSO-NN-based tourism demand forecasting model. The tourism demand forecasting indexes, the choice of NN forecasting models, the modelling process, and the implementation methods are first analysed and studied along with the fundamental theories and forecasting techniques of PSO and NN. In order to increase the precision of the prediction model, the PSO algorithm is also used to optimise the weights and thresholds of the NN. The final section of the paper compares the performance of the model developed in this paper with the most widely used model for forecasting tourism demand. According to the experimental findings, this model's prediction accuracy can reach 95.81 percent, or about 10.09 percent higher than the prediction accuracy of the conventional NN model. There are some practical implications to this research. Applying the optimization model to the forecast of tourism demand is doable and practical. [ABSTRACT FROM AUTHOR]

With the rapid development of AI and big data mining technologies, computerized medical decision-making has become increasingly prominent. The aim of high-utility pattern mining (HUPM) is to discover meaningful patterns in medical databases that contribute to maximizing the utility from the perspective of diagnosis. However, HUPM pays less attention to the interpretability and explainability of these patterns in medical decision-making scenarios. This paper proposes a novel algorithm called the Improved fuzzy high-utility pattern mining (IF-HUPM) to address this problem. First, the paper applies a fuzzy preprocessing method to divide the fuzzy intervals of a medical quantitative data set, which enhances the fuzziness and interpretability of the data. Next, in the process of IF-HUPM, both fuzzy tree and list structures are employed to calculate fuzzy high-utility values. By combining the characteristics of the one-stage and two-stage algorithms of HUPM, an adaptive-phase Fuzzy HUPM hybrid frame is proposed. The experimental results demonstrate that the proposed IF-HUPM algorithm enhances both accuracy and efficiency and the mining process requires less time and space on average. [ABSTRACT FROM AUTHOR]

In order to explore potential value of explosively growing data in thermal power unit, this paper proposes a big data mining method based on Hadoop-based Spark cluster-computing framework and algorithms. Firstly, positive and negative balance methods are used to accurately obtain actual net coal consumption, and maximum information coefficient method is used to select all parameters related to optimization objectives. Then, Spark-based Mini-Batch K-means algorithm and Elbow method are constructed to divide whole operating modes. After that, all data are discretized and mapped to corresponding intervals by using Spark-based Elbow method and Mini-Batch K-means algorithm. Finally, Spark-based parallel FP-growth algorithm is used to deeply mine the potential relationships and laws. To verify the proposed method, a 350-MW thermal power unit is taken as a study case. The important conclusions are as follows: (1) the proposed Spark-based Mini-Batch K-means algorithm reduces the calculation time by 57.11% compared with Mini-Batch K-means algorithm, and 85.61% calculation time compared with K-means algorithm. The proposed Spark-based FP-growth algorithm reduces computational time by 32.8% compared with FP-growth algorithm. (2) Strong association rules of whole operating modes are mined, and operating optimization guidance schemes for important parameters are obtained. Take operating mode 1 as an example: if the optimal result can be reasonably applied, it can save 2.942 g coal per kilowatt hour. (3) Besides, we have found out some other potential relationships among parameters, which have important reference value for on-site operators to analyze economy of the thermal power unit. [ABSTRACT FROM AUTHOR]

As science and technology progress and develop rapidly in this day and age, various industry applications have changed the data in a new way, and the explosive growth of data has made traditional data mining unable to perform the current data mining work. The aim of this paper is to study the aggregation digging of big data based around flocking automation algorithms under circumstances of cloud. There is a fuzzy-mean aggregation arrangement with mixed frog leaping in this paper. Through simulation analysis of different clustering algorithms, hybrid frog-hopping and as well as the merging arrangement introduced in this paper, it is concluded that the merging algorithm achieves an improvement of up to 90% accuracy on the iritual membrane dataset. It was demonstrated that the arrangement provides effective agglomerations. When the number of iterations is 500, the fitness value of the algorithm on Dataset 1 is 1.59 × 104, and its convergence speed is faster than the other algorithms. [ABSTRACT FROM AUTHOR]

This paper introduces a novel formulation of the clustering problem, namely, the minimum sum-of-squares clustering of infinitely tall data (MSSC-ITD), and presents HPClust, an innovative set of hybrid parallel approaches for its effective solution. By utilizing modern high-performance computing techniques, HPClust enhances key clustering metrics: effectiveness, computational efficiency, and scalability. In contrast to vanilla data parallelism, which only accelerates processing time through the MapReduce framework, our approach unlocks superior performance by leveraging the multi-strategy competitive–cooperative parallelism and intricate properties of the objective function landscape. Unlike other available algorithms that struggle to scale, our algorithm is inherently parallel in nature, improving solution quality through increased scalability and parallelism and outperforming even advanced algorithms designed for small- and medium-sized datasets. Our evaluation of HPClust, featuring four parallel strategies, demonstrates its superiority over traditional and cutting-edge methods by offering better performance in the key metrics. These results also show that parallel processing not only enhances the clustering efficiency, but the accuracy as well. Additionally, we explore the balance between computational efficiency and clustering quality, providing insights into optimal parallel strategies based on dataset specifics and resource availability. This research advances our understanding of parallelism in clustering algorithms, demonstrating that a judicious hybridization of advanced parallel approaches yields optimal results for MSSC-ITD. Experiments on the synthetic data further confirm HPClust's exceptional scalability and robustness to noise. [ABSTRACT FROM AUTHOR]

The novelty of this paper is in determining and using hyperparameters to improve the Extended Isolation Forest (EIF) algorithm, a relatively new algorithm, to detect malicious activities in network traffic. The EIF algorithm is a variation of the Isolation Forest algorithm, known for its efficacy in detecting anomalies in high-dimensional data. Our research assesses the performance of the EIF model on a newly created dataset composed of Zeek Connection Logs, UWF-ZeekDataFall22. To handle the enormous volume of data involved in this research, the Hadoop Distributed File System (HDFS) is employed for efficient and fault-tolerant storage, and the Apache Spark framework, a powerful open-source Big Data analytics platform, is utilized for machine learning (ML) tasks. The best results for the EIF algorithm came from the 0-extension level. We received an accuracy of 82.3% for the Resource Development tactic, 82.21% for the Reconnaissance tactic, and 78.3% for the Discovery tactic. [ABSTRACT FROM AUTHOR]

Sensors are the main components in Cyber-Physical Systems (CPS), which transmit large amounts of physical values and big data to computing platforms for processing. On the other hand, the embedded processors (as edge devices in fog computing) spend most of their time reading the sensor signals as compared with computing time. The impact of sensors on the performance of fog computing is very great, thus, the enhancement of the reading time of sensors will positively affect the performance of fog computing, and solves the CPS challenges such as delay, timed precision, temporal behavior, energy, and cost. In this paper, we propose an algorithm based on the 1st derivative of the sensor signal to generate an adaptive sampling frequency. The proposed algorithm uses an adaptive frequency to capture the sudden and rapid change in sensor signal in the steady state. Finally, we realize and tested it using the Ptolemy II Modeling Environment. [ABSTRACT FROM AUTHOR]

Algorithm is the core category and basic methods of the digital age, and advanced technologies such as big data, artificial intelligence, and blockchain all need to rely on various algorithm designs or take the algorithm as the underlying principle. However, due to the characteristics of algorithm design, application, and technology itself, there are also hidden worries such as algorithm black-box, algorithm discrimination, and difficulty in accountability in the operation process to varying degrees. This paper summarizes these problems into three aspects: unexplainable, self-reinforcing and autonomous. Facing the opportunities and risks generated by the application of the algorithm in national governance, while actively promoting the development of algorithm technology to continuously promote the modernization process of national governance, it is also necessary to increase the governance of the algorithm. The practice has proved that enhancing the interpretability of algorithm, optimizing algorithm design, and adopting legal regulatory algorithm are the basic approaches to effective regulatory algorithm in the era of intelligent governance. [ABSTRACT FROM AUTHOR]

The pedestrian detection model has a high requirement on the quality of the dataset. Concerning this problem, this paper uses data cleaning technology to improve the quality of the dataset, so as to improve the performance of the pedestrian detection model. The dataset used in this paper is obtained from subway stations in Beijing and Nanjing. The data images' quality is subject to motion blur, uneven illumination, and other noisy factors. Therefore, data cleaning is very important for this paper. The data cleaning process in this paper is divided into two parts: detection and correction. First, the whole dataset goes through blur detection, and the severely blurred images are filtered as the difficult samples. Then, the image is sent to DeblurGAN for deblur processing. 2D gamma function adaptive illumination correction algorithm is used to correct the subway pedestrian image. Then, the processed data is sent to the pedestrian detection model. Under different data cleaning datasets, through the analysis of the detection results, it is proved that the data cleaning process significantly improves the detection model's performance. [ABSTRACT FROM AUTHOR]

The ItemCF algorithm is currently the most widely used recommendation algorithm in commercial applications. In the early days of recommender systems, most recommendation algorithms were run on a single machine rather than in parallel. This approach, coupled with the rapid growth of massive user behavior data in the current big data era, has led to a bottleneck in improving the execution efficiency of recommender systems. With the vigorous development of distributed technology, distributed ItemCF algorithms have become a research hotspot. Hadoop is a very popular distributed system infrastructure. MapReduce, which provides massive data computing, and Hive, a data warehousing tool, are the two core components of Hadoop, each with its own advantages and applicable scenarios. Scholars have already utilized MapReduce and Hive for the parallelization of the ItemCF algorithm. However, these pieces of literature make use of either MapReduce or Hive alone without fully leveraging the strengths of both. As a result, it has been difficult for parallel ItemCF recommendation algorithms to feature both simple and efficient implementation and high running efficiency. To address this issue, we proposed a distributed ItemCF recommendation algorithm based on the combination of MapReduce and Hive and named it HiMRItemCF. This algorithm divided ItemCF into six steps: deduplication, obtaining the preference matrixes of all users, obtaining the co-occurrence matrixes of all items, multiplying the two matrices to generate a three-dimensional matrix, aggregating the data of the three-dimensional matrix to obtain the recommendation scores of all users for all items, and sorting the scores in descending order, with Hive being used to carry out steps 1 and 6, and MapReduce for the other four steps involving more complex calculations and operations. The Hive jobs and MapReduce jobs are linked through Hive's external tables. After implementing the proposed algorithm using Java and running the program on three publicly available user shopping behavior datasets, we found that compared to algorithms that only use MapReduce jobs, the program implementing the proposed algorithm has fewer lines of source code, lower cyclomatic complexity and Halstead complexity, and can achieve a higher speedup ratio and parallel computing efficiency when processing all datasets. These experimental results indicate that the parallel and distributed ItemCF algorithm proposed in this paper, which combines MapReduce and Hive, has both the advantages of concise and easy-to-understand code as well as high time efficiency. [ABSTRACT FROM AUTHOR]

With the macroeconomy entering a new normal, many new problems are exposed in all walks of life, and the risk of default in the financial sector is also being exposed at an accelerated pace. In the context of big data, internet finance, as an important part of the financial market, also faces many risks in the process of its rapid development. Reasonable, scientific, and effective prediction and prevention of financial default risk have become a key link in the process of risk management practice in the financial industry. Based on the powerful prediction function of the neural network, this paper combined neural network and chaos theory to construct a chaotic RBF neural network. It was applied to financial default risk prediction, which made the prediction accuracy and efficiency higher. The chaotic neural network solves the shortcomings of unstable prediction in the basic neural network and can comprehensively and accurately predict the financial default risk, so as to take measures to prevent risks. The experimental results of this paper show that the accuracy rate of the chaotic RBF neural network reaches 95%, while the accuracy rates of the BP neural network and the RBF neural network are 67% and 78%, respectively. Although the prediction accuracy of these two methods is also high, it is still not as high as the chaotic RBF neural network. Therefore, it is very meaningful to choose the chaotic RBF neural network to predict financial default risk in this paper. [ABSTRACT FROM AUTHOR]

The location planning of relief distribution centres (DCs) is crucial in humanitarian logistics as it directly influences the disaster response and service to the affected victims. In light of the critical role of facility location in humanitarian logistics planning, the study proposes a two-stage relief distribution location problem. The first stage of the model determines the minimum number of relief DCs, and the second stage find the optimal location of these DCs to minimize the total cost. To address a more realistic situation, restrictions are imposed on the coverage area and capacity of each DCs. In addition, for optimally solving this complex NP-hard problem, a novel two-phase algorithm with exploration and exploitation phase is developed in the paper. The first phase of the algorithm i.e., exploration phase identifies a near-optimal solution while the second phase i.e. exploitation phase enhances the solution quality through a close circular proximity investigation. Furthermore, the comparative analysis of the proposed algorithm with other well-known algorithms such as genetic algorithm, pattern search, fmincon, multistart and hybrid heuristics is also reported and computationally tested from small to large data sets. The results reveal that the proposed two-phase algorithm is more efficient and effective when compared to the conventional metaheuristic methods. [ABSTRACT FROM AUTHOR]

Triangle enumeration is a foundation brick for solving harder graph problems related to social networks, the Internet and transportation, to name a few applications. This problem is well studied in the theory literature, but remains an open problem with big data. In this paper, we defend the idea of solving triangle enumeration with SQL queries evaluating the steps of a new adaptive algorithm with linear speedup. Such SQL approach provides scalability beyond RAM limits, automatic parallel processing and more importantly: linear speedup as more machines are added. We present theory results and experimental validation showing our solution works well with large graphs analyzed on a parallel cluster with many machines, producing a balanced workload even with highly skewed degree vertices. We consider two types of distributed systems: (1) a parallel DBMS that evaluates SQL queries, and (2) a parallel HPC cluster calling the MPI library (called via Python). Extensive benchmark experiments with large graphs show our SQL solution offers many advantages over MPI and competing graph analytic systems. [ABSTRACT FROM AUTHOR]

With the improvement of people's economic level, people pay more attention to financial investment. At present, the financial industry provides customers with a variety of investment services, but it has always been unable to provide targeted services for customers. Based on this, this paper studies the optimization of intelligent financial technology core technology based on collaborative filtering algorithm in the big data environment. On the basis of a simple analysis of the application of financial core technology and the research status of collaborative filtering algorithm, this paper constructs an application model of intelligent financial collaborative filtering algorithm. In view of the shortcomings of collaborative filtering algorithm, it uses user-based clustering algorithm to improve the collaborative filtering algorithm. According to the frequency of customers' access to financial products, the attention model is established and simulated. The results show that the collaborative filtering optimization algorithm used in this paper can reduce the absolute error of recommendation and improve the accuracy. [ABSTRACT FROM AUTHOR]

Accurate recommendation of tourist attractions is conducive to improving users' travel efficiency and tourism experience. However, the choice of tourism feature factors and the difference of recommendation algorithm will affect the accuracy of scenic spot recommendation. Aiming at the problems of sparse data, insufficient tourism factors, and low recommendation accuracy in the existing tourism recommendation research, this paper puts forward a scenic spot recommendation method based on microblog data and machine learning by using the characteristics of personalized expression and strong current situation of microblog data and the intelligent prediction function of machine learning, so as to realize accurate and personalized scenic spot recommendation. This paper extracts rich tourism characteristic factors. Typical tourism recommendation algorithms choose tourism characteristic factors from scenic spots, tourists, and other aspects, without considering the travel time, tourism season, and other contextual information of tourists' destination, which can help understand users' tourism preferences from different angles. Aiming at the problem of sparse data and cold start of collaborative filtering recommendation algorithm, this paper introduces deep learning algorithm and combines the proposed multifeature tourism factors to build dynamic scenic spot prediction models (random forest preferred attraction prediction (RFPAP) and neural networks preferred attraction prediction (NNPAP)). The experimental results show that RFPAP and NNPAP methods can overcome the problem of data sparsity and achieve 89.61% and 89.51% accuracy, respectively. RFPAP method is better than NNPAP method and has stronger generalization ability. [ABSTRACT FROM AUTHOR]

In the era of big data, text as an information reserve database is very important, in all walks of life. From humanities research to government decision-making, from precision medicine to quantitative finance, from customer management to marketing, massive text, as one of the most important information carriers, plays an important role everywhere. The text data generated in these practical problems of humanities research, financial industry, marketing, and other fields often has obvious domain characteristics, often containing the professional vocabulary and unique language patterns in these fields and often accompanied by a variety of "noise." Dealing with such texts is a great challenge for the current technical conditions, especially for Chinese texts. A clustering algorithm provides a better solution for text big data information processing. Clustering algorithm is the main body of cluster analysis, K-means algorithm with its implementation principle is simple, low time complexity is widely used in the field of cluster analysis, but its K value needs to be preset, initial clustering center random selection into local optimal solution, other clustering algorithm, such as mean drift clustering, K-means clustering in mining text big data. In view of the problems of the above algorithm, this paper first extracts and analyzes the text big data and then does experiments with the clustering algorithm. Experimental conclusion: by analyzing large-scale text data limited to large-scale and simple data set, the traditional K-means algorithm has low efficiency and reduced accuracy, and the K-means algorithm is susceptible to the influence of initial center and abnormal data. According to the above problems, the K-means cluster analysis algorithm for data sets with large data volumes is analyzed and improved to improve its execution efficiency and accuracy on data sets with large data volume set. Mean shift clustering can be regarded as making many random centers move towards the direction of maximum density gradually, that is, moving their mean centroid continuously according to the probability density of data and finally obtaining multiple maximum density centers. It can also be said that mean shift clustering is a kernel density estimation algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a dynamic segmentation and weighted comprehensive matching algorithm based on neural networks for cross-media piano performance audio recognition and retrieval. The 3D convolutional neural network process is separated to compress the network parameters and improve the computational speed. Skip connection and layer-wise learning rate solve the problem that the separated network is challenging to train. The piano performance audio recognition is facilitated by shuffle operation. In pattern recognition, music retrieval algorithms are gaining more and more attention due to their ease of implementation and efficiency. However, the problems of imprecise dynamic note segmentation and inconsistent matching templates directly affect the accuracy of the MIR algorithm. We propose a dynamic threshold-based segmentation and weighted comprehensive matching algorithm to solve these problems. The amplitude difference step is dynamically set, and the notes are segmented according to the changing threshold to improve the accuracy of note segmentation. A standard score frequency is used to transform the pitch template to achieve input normalization to enhance the accuracy of matching. Direct matching and DTW matching are fused to improve the adaptability and robustness of the algorithm. Finally, the effectiveness of the method is experimentally demonstrated. This paper implements the data collection and processing, audio recognition, and retrieval algorithm for cross-media piano performance big data through three main modules: the collection, processing, and storage module of cross-media piano performance big data, the building module of audio recognition of cross-media piano performance big data, and the dynamic precision module of cross-media piano performance big data. [ABSTRACT FROM AUTHOR]

This study focuses on the load balancing of the transactions in the blockchain. The problem is how to assign these transactions to the blocks. The objective is to guarantee a load balancing of the workload in the time of blocks. The proposed problem is an NP-hard one. To face the hardness of the studied problem, the challenge is to develop algorithms that solve the problem approximately. Finding an approximate solution is a real challenge. In this paper, nine algorithms are proposed. These algorithms are based on the dispatching-rules method, randomization approach, clustering algorithms, and iterative method. The proposed algorithms return approximate solutions in a remarkable time. In addition, in this paper, a novel architecture composed of blocks is proposed. This architecture adds the component "Balancer". This component is responsible to call the best-proposed algorithm and solve the scheduling problem in a polynomial time. In addition, the proposed work helps users to solve the problem of big data concurrency. These algorithms are coded and compared. The performance of these algorithms is tested over three classes of instances. These classes are generated based on uniform distribution. The total number of instances tested is 1350. The average gap, execution time, and the percentage of the best-reached value are used as metrics to measure the performance of the proposed algorithms. Experimental results show the performance of these algorithms and a comparison between them is discussed. The experimental results show that the best algorithm is best-mi-transactions iterative multi-choice with 93.9% in an average running time of 0.003 s. [ABSTRACT FROM AUTHOR]

In this paper, we consider the development of algorithms for the automatic detection of buried threats using ground penetrating radar (GPR) measurements. GPR is one of the most studied and successful modalities for automatic buried threat detection (BTD), and a large variety of BTD algorithms have been proposed for it. Despite this, large-scale comparisons of GPR-based BTD algorithms are rare in the literature. In this paper, we report the results of a multi-institutional effort to develop advanced BTD algorithms for a real-world GPR BTD system. The effort involved five institutions with substantial experience with the development of GPR-based BTD algorithms. In this paper, we report the technical details of the advanced algorithms submitted by each institution, representing their latest technical advances, and many state-of-the-art GPR-based BTD algorithms. We also report the results of evaluating the algorithms from each institution on the large experimental data set used for development. The experimental data set comprised 120 000 m2 of GPR data using surface area, from 13 different lanes across two U.S. test sites. The data were collected using a vehicle-mounted GPR system, the variants of which have supplied data for numerous publications. Using these results, we identify the most successful and common processing strategies among the submitted algorithms, and make recommendations for GPR-based BTD algorithm design. [ABSTRACT FROM AUTHOR]

The growing data have brought tremendous pressure for query processing and storage, so there are many studies that focus on using GPU to accelerate join operation, which is one of the most important operations in modern database systems. However, existing GPU acceleration join operation researches are not very suitable for the join operation on big data. Based on this, this paper speeds up nested loop join, hash join and theta join, combining Hadoop with GPU, which is also the first to use GPU to accelerate theta join. At the same time, after the data pre-filtering and pre-processing, using MapReduce and HDFS in Hadoop proposed in this paper, the larger data table can be handled, compared to existing GPU acceleration methods. Also with MapReduce in Hadoop, the algorithm proposed in this paper can estimate the number of results more accurately and allocate the appropriate storage space without unnecessary costs, making it more efficient. Experimental results show that comparing with GPU-based approach without Hadoop, our approach increases the speed by 1.5–2 times, and comparing with the Hadoop-based approaches without GPU, our approach increases the speed by 1.3–2 times. [ABSTRACT FROM AUTHOR]

NoSQL databases have moved from theoretical solutions to exceed relational databases limits to a practical and indisputable application for storing and manipulation big data. In term of variety, NoSQL databases store heterogeneous data without being obliged to respect a predefined schema such as the case of relational and object-relational databases. Those solutions, also surpass the traditional databases in storage capacity; we consider MongoDB for example, which is a document-oriented database capable of storing unlimited number of documents with a maximal size of 32TB depending on the machine that runs the database and also the operating system. Also, in term of velocity, many researches compared the execution time of different transactions and proved that NoSQL databases are the perfect solution for real-time applications. This paper presents an algorithm to store data modeled by graphs as NoSQL documents, the purpose of this study is to exploit the high amount of data stored in SQL databases and to make such data usable by recent clustering algorithms and other data science tools. This study links relational data to document datastores by defining an effective algorithm for reading relational data, modelling those data as graphs and storing those data as NoSQL documents. [ABSTRACT FROM AUTHOR]

The development of the network economy has brought a great impact on the society. In the process of online transactions, if the transaction risks are not prevented and improved in time, it will directly affect the normal development of the social economy. Therefore, it is necessary to synchronize transaction subjects and objects, and at the same time control transaction risks, and promote the rapid development of e-commerce, which is an important problem to be solved urgently in current online transactions. This paper first summarizes the characteristics and risk performance of new transactions and identifies and controls them according to their characteristics and different risk characteristics. The cybercriminal industry uses illegal means to seek benefits in online transactions. The continuous improvement of big data technology and data mining technology makes it possible to identify transaction risks in the consumption process. In particular, the research and identification of black industries can not only ensure the normal operation of merchants and reduce the loss of economic interests of merchants but also make the transaction experience of natural users smoother. Based on the existing consumption data, this paper adopts the Boosting-SVM model to identify natural users and black-produced users in the transaction process. The results show that the model achieves good recognition results. The overall prediction accuracy of the model is over 95%, the identification accuracy rate of high-risk transactions is over 98%, and other indicators are also over 96%. Compared with other risk identification, the overall accuracy of the algorithm is increased by 1%, and the risk identification accuracy is increased by more than 8%. Generally speaking, the method in this paper provides technical support to related industries to a certain extent. [ABSTRACT FROM AUTHOR]

Many big data applications produce a massive amount of high-dimensional, real-time, and evolving streaming data. Clustering such data streams with both effectiveness and efficiency are critical for these applications. Although there are well-known data stream clustering algorithms that are based on the popular online-offline framework, these algorithms still face some major challenges. Several critical questions are still not answer satisfactorily: How to perform dimensionality reduction effectively and efficiently in the online dynamic environment? How to enable the clustering algorithm to achieve complete real-time online processing? How to make algorithm parameters learn in a self-supervised or self-adaptive manner to cope with high-speed evolving streams? In this paper, we focus on tackling these challenges by proposing a fully online data stream clustering algorithm (called ESA-Stream) that can learn parameters online dynamically in a self-adaptive manner, speedup dimensionality reduction, and cluster data streams effectively and efficiently in an online and dynamic environment. Experiments on a wide range of synthetic and real-world data streams show that ESA-Stream outperforms state-of-the-art baselines considerably in both effectiveness and efficiency. [ABSTRACT FROM AUTHOR]

In view of the problem that the transient fault data in low-voltage area is easily affected by objective noise because of the large number of redundant mapping values and external interference, this paper proposes an algorithm for transient fault data management in low-voltage area based on overall situation power big data. This paper divides the global large data of transient fault in low-voltage station into line loss data and other data, and applies the big data mining algorithm to analyze the abnormal situation of voltage, current and instrument, to standardize the transient fault data in low-voltage station and filter the adaptive optimization, to ensure the attribute function dependence and reference constraint goal of data aggregation and to complete the transient fault data management in low-voltage station. The test results show that, the range of the value mapping is always between 0 and 1, which significantly alleviates the influence degree of low-voltage transient fault data affected by noise, improves the data access speed, and ensures the effectiveness of low-voltage transient fault detection. [ABSTRACT FROM AUTHOR]

Data-driven business models arise in different social and industrial sectors, while new sensors and devices are breaking down the barriers for disruptive ideas and digitally transforming established solutions. This paper aims at providing insights about emerging topics in the data economy that are related to companies' innovation potential. The paper uses text mining supported by systematic literature review to automatize the extraction and analysis of beneficial insights for both scientists and practitioners that would not be possible by a manual literature review. By doing so, we were able to analyze 860 scientific publications resulting in an overview of the research field of data economy and innovation. Nine clusters and their key topics are identified, analyzed as well as visualized, as we uncover research streams in the paper. [ABSTRACT FROM AUTHOR]

At present, big data related technologies are developing rapidly, and major companies provide big data analysis services. However, the big data analysis system formed by the combination method cannot sense each other and lacks cooperation, resulting in a certain amount of waste of resources in the big data analysis system. In order to find the key technology of the data analysis system and conduct in-depth analysis of the media data, this paper proposes a scheduling algorithm based on artificial intelligence (AI) to implement task scheduling and logical data block migration. By analyzing the experimental results, we know that the performance of LAS (Logistic-Block Affinity Scheduler) is improved by 23.97%, 16.11%, and 10.56%, respectively, compared with the other three algorithms. Based on real new media data, this article analyzes the content of media data and user behavior in depth through big data analysis methods. Compared with other methods, the algorithm model in this paper optimizes the accuracy of hot topic extraction, which has important implications for media data mining. In addition, the analysis results of the emotional characteristics, audience characteristics, and hot topic communication characteristics obtained by the research also have practical value. This method improves the recall rate and F value by 5% and 4.7%, respectively, and the overall F value of emotional judgment is about 88.9%. [ABSTRACT FROM AUTHOR]

In the era of big data, unsupervised learning algorithms such as clustering are particularly prominent. In recent years, there have been significant advancements in clustering algorithm research. The Clustering by Density Peaks algorithm is known as Clustering by Fast Search and Find of Density Peaks (density peak clustering). This clustering algorithm, proposed in Science in 2014, automatically finds cluster centers. It is simple, efficient, does not require iterative computation, and is suitable for large-scale and high-dimensional data. However, DPC and most of its refinements have several drawbacks. The method primarily considers the overall structure of the data, often resulting in the oversight of many clusters. The choice of truncation distance affects the calculation of local density values, and varying dataset sizes may necessitate different computational methods, impacting the quality of clustering results. In addition, the initial assignment of labels can cause a 'chain reaction', i.e., if one data point is incorrectly labeled, it may lead to more subsequent data points being incorrectly labeled. In this paper, we propose an improved density peak clustering method, DPC-MS, which uses the mean-shift algorithm to find local density extremes, making the accuracy of the algorithm independent of the parameter dc. After finding the local density extreme points, the allocation strategy of the DPC algorithm is employed to assign the remaining points to appropriate local density extreme points, forming the final clusters. The robustness of this method in handling uncertain dataset sizes adds some application value, and several experiments were conducted on synthetic and real datasets to evaluate the performance of the proposed method. The results show that the proposed method outperforms some of the more recent methods in most cases. [ABSTRACT FROM AUTHOR]

A schedule-based system is a system that operates on or contains within a schedule of events and breaks at particular time intervals. Entities within the system show presence or absence in these events by entering or exiting the locations of the events. Given radio frequency identification (RFID) data from a schedule-based system, what can we learn about the system (the events and entities) through data mining? Which data mining methods can be applied so that one can obtain rich actionable insights regarding the system and the domain? The research goal of this paper is to answer these posed research questions, through the development of a framework that systematically produces actionable insights for a given schedule-based system. We show that through integrating appropriate data mining methodologies as a unified framework, one can obtain many insights from even a very simple RFID dataset, which contains only very few fields. The developed framework is general, and is applicable to any schedule-based system, as long as it operates under certain basic assumptions. The types of insights are also general, and are formulated in this paper in the most abstract way. The applicability of the developed framework is illustrated through a case study, where real world data from a schedule-based system is analyzed using the introduced framework. Insights obtained include the profiling of entities and events, the interactions between entity and events, and the relations between events. [ABSTRACT FROM AUTHOR]

With the continuous improvement of scientific and technological level, big data analysis technology has been vigorously promoted in substations. Though the big data technology can be real-time insight into the status of substation operation and inspection, how to improve the efficiency of substation inspection is still a hot topic at present. Based on this, this article through the perspective of path planning are studied, in particular, through simulation experiment to determine transformer substation inspection robot path planning algorithm system before and after the end of the work, inspection path planning system in substations by way of test results, from the results, the substation inspection robot can better avoid obstacles and complete the final inspection work along the optimal inspection path. [ABSTRACT FROM AUTHOR]

In this paper, the fuzzy comprehensive evaluation model based on the bat algorithm quantifies the qualitative evaluation effectively and provides a feasible and convenient English teaching quality evaluation system by combining quantitative evaluation with objective index data. Firstly, the English teaching quality evaluation model is constructed based on the fuzzy comprehensive evaluation analysis method and the weight values of each factor are calculated; secondly, the three types of data in the model are processed separately. This includes standardizing the data of objective indicators such as students' course grades and weakening the influence of course difficulty on this indicator. The fuzzy comprehensive evaluation model based on the bat algorithm quantifies the qualitative evaluation to make the calculated comprehensive evaluation of English teaching quality more comprehensive and objective; then the comprehensive calculation of English teaching quality evaluation is completed, and the English teaching quality evaluation model is constructed by extracting keywords based on the qualitative evaluation; finally, a runnable English teaching quality evaluation system is designed and implemented. A fuzzy comprehensive evaluation algorithm based on improved bat algorithm optimization is proposed. The algorithm uses the improved fuzzy comprehensive evaluation algorithm to optimize the initial clustering centers and adopts a new objective function to guide the clustering process, thus improving the clustering quality of the fuzzy comprehensive evaluation algorithm. Comparative analysis through models shows that the improved algorithm improves the clustering accuracy to a certain extent when compared with the traditional fuzzy comprehensive evaluation clustering algorithm for analysis. The bat algorithm is one of the stochastic global optimization models. It can take advantage of the group, integrate global search and local search, and achieve rapid convergence. Therefore, it plays an important role in optimizing the evaluation of English teaching quality. This study enriches the theoretical study of English teaching quality evaluation to a certain extent and can play a role in strengthening and improving English teaching quality evaluation at the present stage. [ABSTRACT FROM AUTHOR]

Big data analytics involve a systematic approach to find hidden patterns to help the organization grow from large volume and variety of data. In recent years big data analytics is widely used in the agricultural domain to improve yield. Viticulture (the cultivation of grapes) is one of the most lucrative farming in India. It is a subdivision of horticulture and is the study of wine growing. The demand for Indian Wine is increasing at about 27% each year since the 21st century and thus more and more ways are being developed to improve the quality and quantity of the wine products. In this paper, we focus on a specific agricultural practice as viticulture. Weather forecasting and disease detection are the two main research areas in precision viticulture. Leaf disease detection as a part of plant pathology is the key research area in this paper. It can be applied on vineyards of India where farmers are bereft of the latest technologies. Proposed system architecture comprises four modules: Data collection, data preprocessing, classification and visualization. Database module involves grape leaf dataset, consists of healthy images combined with disease leaves such as Black measles, Black rot, and Leaf blight. Models have been implemented on Apache Hadoop using map reduce programming framework. It applies feature extraction to extract various features of the live images and classification algorithm with reduced computational complexity. Gray Level Co-occurrence Matrix (GLCM) followed by K-Nearest Neighborhood (KNN) algorithm. The system also recommends the necessary steps and remedies that the viticulturists can take to assure that the grapes can be salvaged at the right time and in the right manner based on classification results. The overall system will help Indian viticulturists to improve the harvesting process. Accuracy of the model is 82%, and it can be increased as a future work by including deep learning with time-series grape leaf images. [ABSTRACT FROM AUTHOR]

The growing popularity of big data analysis and cloud computing has created new big data management standards. Sometimes, programmers may interact with a number of heterogeneous data stores depending on the information they are responsible for: SQL and NoSQL data stores. Interacting with heterogeneous data models via numerous APIs and query languages imposes challenging tasks on multi-data processing developers. Indeed, complex queries concerning homogenous data structures cannot currently be performed in a declarative manner when found in single data storage applications and therefore require additional development efforts. Many models were presented in order to address complex queries Via multistore applications. Some of these models implemented a complex unified and fast model, while others' efficiency is not good enough to solve this type of complex database queries. This paper provides an automated, fast and easy unified architecture to solve simple and complex SQL and NoSQL queries over heterogeneous data stores (CQNS). This proposed framework can be used in cloud environments or for any big data application to automatically help developers to manage basic and complicated database queries. CQNS consists of three layers: matching selector layer, processing layer, and query execution layer. The matching selector layer is the heart of this architecture in which five of the user queries are examined if they are matched with another five queries stored in a single engine stored in the architecture library. This is achieved through a proposed algorithm that directs the query to the right SQL or NoSQL database engine. Furthermore, CQNS deal with many NoSQL Databases like MongoDB, Cassandra, Riak, CouchDB, and NOE4J databases. This paper presents a spark framework that can handle both SQL and NoSQL Databases. Four scenarios' benchmarks datasets are used to evaluate the proposed CQNS for querying different NoSQL Databases in terms of optimization process performance and query execution time. The results show that, the CQNS achieves best latency and throughput in less time among the compared systems. [ABSTRACT FROM AUTHOR]

Text event mining, as an indispensable method of text mining processing, has attracted the extensive attention of researchers. A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper, i.e. UKGE-MS. Specifically, UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information, and solves the problems of traditional unsupervised feature selection methods, which only focus on selecting features from a global perspective and ignoring the impact of local connection of samples. Firstly, considering the influence of local information of samples in feature correlation evaluation, a feature clustering algorithm based on average neighborhood mutual information is proposed, and the feature clusters with certain event correlation are obtained; Secondly, an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation, so as to enhance the generalization ability of the selected feature items. Finally, the events knowledge graph is constructed by means of sparse representation and l1 norm. Extensive experiments are carried out on five real datasets and synthetic datasets, and the UKGE-MS are compared with five corresponding algorithms. The experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection, and has some advantages over other methods in text event recognition and discovery. [ABSTRACT FROM AUTHOR]

Tiled maps are one of the key GIS technologies used in the development and construction of WebGIS in the era of big data; there is an urgent need for high-performance tile map services hosted on big data GIS platforms. To address the current inefficiency of massive tile map data management and access, this paper proposes a massive tile map data access model that utilizes the jump consistent hash algorithm. Via the uniformity and consistency of a certain seed of a pseudo-random function, the algorithm can generate a storage slot for each tile data efficiently. By recording the slot information in the head of a row key, a uniform distribution of the tiles on the physical cluster nodes is achieved. This effectively solves the problem of hotspotting caused by the monotonicity of tile row keys in the data access process, thereby maximizing the random-access performance of a big data platform and greatly improving concurrent database access. Experiments show that this model can significantly improve the efficiency of tile map data access by more than 39% compared to a direct storage method, thereby confirming the model's advantages in accessing massive tile map data on a big data GIS platform. [ABSTRACT FROM AUTHOR]

In this paper, we propose and experimentally assess an innovative framework for scaling posterior distributions over different-curation datasets, based on Bayesian-Neural-Networks (BNN). Another innovation of our proposed study consists in enhancing the accuracy of the Bayesian classifier via intelligent sampling algorithms. The proposed methodology is relevant in emerging applicative settings, such as provenance detection and analysis and cybercrime. Our contributions are complemented by a comprehensive experimental evaluation and analysis over both static and dynamic image datasets. Derived results confirm the successful application of our proposed methodology to emerging big data analytics settings. [ABSTRACT FROM AUTHOR]

Mobile video communication and Internet of Things are playing a more and more important role in our daily life. Mobile Edge Computing (MEC), as the essential network architecture for the Internet, can significantly improve the quality of video streaming applications. The mobile devices transferring video flow are often exposed to hostile environment, where they would be damaged by different attackers. Accordingly, Mobile Edge Computing Network is often vulnerable under disruptions, against either natural disasters or human intentional attacks. Therefore, research on secure hub location in MEC, which could obviously enhance the robustness of the network, is highly invaluable. At present, most of the attacks encountered by edge nodes in MEC in the IoT are random attacks or random failures. According to network science, scale-free networks are more robust than the other types of network under the random failures. In this paper, an optimization algorithm is proposed to reorganize the structure of the network according to the amount of information transmitted between edge nodes. BA networks are more robust under random attacks, while WS networks behave better under human intentional attacks. Therefore, we change the structure of the network accordingly, when the attack type is different. Besides, in the MEC networks for mobile video communication, the capacity of each device and the size of the video data influence the structure significantly. The algorithm sufficiently takes the capability of edge nodes and the amount of the information between them into consideration. In robustness test, we set the number of network nodes to be 200 and 500 and increase the attack scale from 0% to 100% to observe the behaviours of the size of the giant component and the robustness calculated for each attack method. Evaluation results show that the proposed algorithm can significantly improve the robustness of the MEC networks and has good potential to be applied in real-world MEC systems. [ABSTRACT FROM AUTHOR]

At present, many budget companies have realized high-level computerized accounting and have high-speed and advanced database management systems. In order to adapt to the growth of budget entity informatization, the financial department must improve its own financial budget level. Introduce information technology, and develop corresponding financial budget software to better perform its own financial calculation function. This paper explores and analyzes the full collaborative matching algorithm of enabling big data financial budget and builds a financial big data financial budget platform through offline and online data collection. Combined with the matching algorithm and linear regression prediction algorithm in data analysis, the financial data is analyzed in depth. Finally, the PSO-SA algorithm runs 10 rounds on the datasets with matching scales d = 10 and 30, respectively. It is found that the fluctuation is large when d = 10 and relatively stable when d = 30. When d = 10 , the maximum value is 7.2354, and the minimum value is 6.9969. When d = 10 , the maximum value is 26.6403, and the minimum value is 23.9599. It can be concluded that when d = 0 , PSO-SA can obtain a relatively good matching scheme, but it is easy to fall into a local optimal solution. The superposition effect of "data + computing power + algorithm + scenario" can help enterprises make better decisions. Embed complex analysis into daily management and trading scenarios to build a financial empowerment platform. Make the increasingly complex work more automated and intelligent, and improve financial efficiency. [ABSTRACT FROM AUTHOR]

In big data analysis, conventional clustering algorithms have limitations to deal with nonlinear spatial datasets, e.g., low accuracy and high computation cost. Aiming at these problems, this paper proposed a new DBSCAN extension algorithm for online clustering, which consists of three layers, considering DBSCAN, granular computing (GrC), and fuzzy rule-based modeling. Firstly, making use of DBSCAN algorithms' advantages at extracting structural information, spatial data are clustered via DBSCAN into structural clusters, which are subsequently described by structural information granules (IG) via GrC. Secondly, based on the structural IGs, a series of granular models are constructed in the medium space, and utilized to form fuzzy rules to guide clustering on spatial data. Finally, with the help of structural IGs and granular rules, a rule-based modeling method is constructed in the output space for online clustering. Experiments on a synthetic toy dataset and a typical spatial dataset are implemented in this paper. Numerical results validate the feasibility to the proposed method in online spatial data clustering. Moreover, comparative studies with conventional methods and existing DBSCAN variants demonstrate the superiorities of the proposed method, as well as accuracy improvement and computation overhead reduction. [ABSTRACT FROM AUTHOR]

In this paper, the clustering algorithm of big data fuzzy K-means is used to research and analyze the teaching management system. Since the values of the indicator variables of bad units are usually significantly different in smooth areas and discontinuous areas, we cluster the indicators of local areas through K-means clustering, so that only good units or bad units are included in each class. The server is deployed on the campus and is networked with the teaching computers of each classroom. Teachers log in to the class rate management system before or during class, log in to their respective users, select the corresponding class, and make corresponding attendance records according to the attendance of students in the class. The system automatically counts the number of expected arrivals, attendance, late arrivals, leave requests, and absenteeism for the class. Teachers can also fill in information feedback for this class: a list of absenteeism, classroom discipline, student learning status, teaching suggestions, and teaching testimonials. The development environment built by this system is a combination of PHP + MYSQL, which reasonably planned according to the overall needs. The development mode adopts the top-down model, which runs through the whole process from system development to testing to application. The most used floating point number encoding is the decimal floating point number encoding. The relationship of each module of the virtual reality teaching management system is sorted out, the overall framework of the virtual reality teaching management system is established, and the design of the business flow diagram of the management system is completed. This paper also uses Oracle database technology to further explain the design process of designing the system database. Finally, combined with the system design and implementation, the system test is completed from two aspects: system function test and performance test. [ABSTRACT FROM AUTHOR]

The classical solution to an underdetermined system of linear equations mainly has two opposite directions, which lead to either a large l2-norm sparse solution or a non-sparse minimum l2-norm solution. In this paper, we systematically show that by modifying the well-known basic matching pursuit algorithm originally proposed to identify the sparse solution, an alternative solution between the two classical ones could be obtained. The modified algorithm, termed as random matching pursuit (RMP), is then used to create a novel image watermarking framework. Compared to conventional systems, the security is substantially improved by the use of random over-complete dictionaries and the order parameter of RMP. Capacity can also be increased thanks to the transform with over-complete dictionaries that could expand signal dimension. Meanwhile, imperceptibility and robustness properties of the proposed design framework are not compromised. The classical spread spectrum and improved spread spectrum techniques are applied to the proposed framework for practical implementations. The novelty and effectiveness of the proposed systems are supported by rigorous performance analysis and experimental results using an image data set. This paper reveals the potential of using over-complete dictionaries in multimedia watermarking systems, which theoretically leads to the exploration of alternative candidates among the infinite solutions to underdetermined linear systems other than minimum l2-norm and sparse ones. [ABSTRACT FROM AUTHOR]

This paper argues that the Value Sensitive Design (VSD) methodology provides a principled approach to embedding common values into AI systems both early and throughout the design process. To do so, it draws on an important case study: the evidence and final report of the UK Select Committee on Artificial Intelligence. This empirical investigation shows that the different and often disparate stakeholder groups that are implicated in AI design and use share some common values that can be used to further strengthen design coordination efforts. VSD is shown to be both able to distill these common values as well as provide a framework for stakeholder coordination. [ABSTRACT FROM AUTHOR]

This research paper presents an innovative approach to gradient descent known as "Sample Gradient Descent". This method is a modification of the conventional batch gradient descent algorithm, which is often associated with space and time complexity issues. The proposed approach involves the selection of a representative sample of data, which is subsequently subjected to batch gradient descent. The selection of this sample is a crucial task, as it must accurately represent the entire dataset. To achieve this, the study employs the use of Principle Component Analysis (PCA), which is applied to the training data, with a condition that only those rows and columns of data that explain 90% of the overall variance are retained. This approach results in a convex loss function, where a global minimum can be readily attained. Our results indicate that the proposed method offers faster convergence rates, with reduced computation times, when compared to the conventional batch gradient descent algorithm. These findings demonstrate the potential utility of the "Sample Gradient Descent" technique in various domains, ranging from machine learning to optimization problems. In our experiments, both approaches were run for 30 epochs, with each epoch taking approximately 3.41 s. Notably, our "Sample Gradient Descent" approach exhibited remarkable performance, converging in just 8 epochs, while the conventional batch gradient descent algorithm required 20 epochs to achieve convergence. This substantial difference in convergence rates, along with reduced computation times, highlights the superior efficiency of our proposed method. These findings underscore the potential utility of the "Sample Gradient Descent" technique across diverse domains, ranging from machine learning to optimization problems. The significant improvements in convergence rates and computation times make our algorithm particularly appealing to practitioners and researchers seeking enhanced efficiency in gradient descent optimization. [ABSTRACT FROM AUTHOR]

The Italian Government planned to invest €15 billion of European funds on National Health Service digitalization and primary care enhancement. The critical burden brought by the pandemic upon hospital care mean these investments could no longer be delayed, considering the extraordinary backlogs of many treatments and the ordinary gaps of fragmented long-term care, in Italy and abroad. National guidelines have been published to standardize interventions across the Italian regions, and telemedicine is frequently mentioned as a key innovation to achieve both goals. The professional resources needed to run the facilities introduced in primary care are defined with great precision, but no details are given on how digitalization and remote care technologies must be implemented in this context. Building on this policy case, this paper focuses on what contribution digitalization and telemedicine can offer to specific primary care innovations, drawing from implemented technology-driven policies which may support the effective stratification, prevention and management of chronic patient needs, including anticipatory healthcare, population health management, adjusted clinical groups, chronic care management, quality and outcomes frameworks, patient-reported outcomes and patient-reported experience. All these policies can benefit significantly from digitalization and remote care technology, provided that some risks and limitations are considered by design. [ABSTRACT FROM AUTHOR]

With the advancement of science and technology as well as the continual improvement of big data analysis technology, the accuracy of traditional data information classification has declined, making it impossible to assess English ability effectively. A competency evaluation model for college English teaching vacancies is built using this information and the big data architecture. The ability of the big data information model is evaluated and feature information of ability constraints is extracted using the predefined constraint parameter index analysis model. Simultaneously, the K-means clustering algorithm is used to cluster and integrate a series of index parameters of English ability using big data, and the English teaching resource allocation plan is completed in accordance with this, allowing for the scientific evaluation of English teaching ability. The results of the studies show that the clustering method utilized in the context of big data can aid in the evaluation of English competence. In the experiment, four test cycles of English teaching skills were set up, and the effectiveness of the English evaluation techniques described in this paper and two classical cluster evaluation methods were compared and tested. The research shows that using the method described in this paper to evaluate English teaching skills can significantly improve the full utilization of data. [ABSTRACT FROM AUTHOR]