Search

Web page classification is critical for information retrieval. Most web page classification methods have the following two faults: (1) need to analyze based on the overall web page and (2) do not pay enough attention to the existence of noise information inside the web page, which will thus decrease the efficiency and classification performance, especially when classifying the contaminated web page. To solve these problems, this paper proposes a denoising disposal algorithm. We choose the top-down method for hierarchical classification to improve the prediction efficiency. The experimental results demonstrate that our method is about 7 times faster than the full-page method and achieves good classification results in most categories. The precision of 7 parent categories is all above 88% and is 24% higher than the other meta tag-based method on average. [ABSTRACT FROM AUTHOR]

Traditional Chinese medicine (TCM) is a summary of the diagnosis and treatment experience formed by the working people in the long-term struggle against diseases, so it is very important to protect the intangible cultural heritage of TCM. How to extract valuable knowledge accurately and conveniently from the massive medical records of TCM is one of the important issues in the current research on the development of TCM. Due to the large amount of data of TCM medical records, many feature attributes, and diverse patterns, the existing classification technology has high computational complexity, low mining efficiency, and poor universality. Therefore, this paper proposed to quantify the medical records of TCM and obtained the main symptoms according to the improved hierarchical clustering feature selection algorithm. This paper also proposed a support vector machine (SVM) classification method using improved particle swarm algorithm to classify TCM information, which not only improves the efficiency and accuracy of TCM information classification but also discovers the potential dialectical and symptom patterns in diagnosis and treatment, so that the intangible cultural heritage protection of TCM can be developed sustainably. This paper showed that the information acquisition accuracy of the improved algorithm was very high. Before the improved algorithm was used, the accuracy of information mining for TCM was 67.90% at the highest and 65.53% at the lowest, but after using the improved algorithm, the accuracy rate of information mining for TCM was 88.02% at the highest and 82.45% at the lowest. It can be seen that using the improved algorithm to mine TCM information can quickly process effective information. [ABSTRACT FROM AUTHOR]

The maintenance and sharing of electronic medical records are one of the essential tasks in the medical treatment combination. Traditional cloud-based electronic medical record storage system is difficult to realize data security sharing. The tamper resistance and traceability of blockchain technology provide the possibility for the sharing of highly sensitive medical data. This paper proposes a safe sharing scheme of stroke electronic medical records based on the consortium blockchain. The scheme adopts the storage method of ciphertext of medical records stored in the cloud and index of medical records stored on the blockchain. The privacy protection mechanism proposed in this paper innovatively combines proxy reencryption and searchable encryption which supports patient pseudoidentity search. The mechanism could achieve controllable sharing of medical records and precise search. According to the organizational characteristics of the stroke medical treatment combination, this paper proposes an improved Practical Byzantine Fault Tolerance mechanism to reach a consensus between consensus nodes. Then, the proposed scheme is analyzed and evaluated from three aspects of medical record integrity, user privacy, and data security. The results show that the scheme can not only ensure the privacy of patient identity information and private key data but also resist the tampering and deletion attacks of internal and external malicious nodes on the medical record data. Therefore, the proposed scheme is conducive to the improvement of the timeliness of stroke treatment and the safe sharing of electronic medical records in stroke medical treatment combination. [ABSTRACT FROM AUTHOR]

At present, based on the background of the big data era, the operation of enterprises has a great impact, and relevance is a principle set to meet the needs of enterprise operation and management. In today's digital and network era, multimedia has become the main part of the Internet information transmission, and multidisciplinary art and science communion has promoted the development of the multimedia information retrieval. As a result, this paper examines the correlation of big data against the background of financial and multimedia information retrieval algorithms. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet, data information has begun to spread rapidly on the Internet, and the types and fields involved are becoming more and more diverse. With the deepening of internationalization, English information has also become a common entry for tourism. Relatively speaking, the translation of English documents is also on the agenda. The intricate literature information has put forward a more specialized and vertical demand for retrieval. Traditional retrieval systems usually use string matching algorithms to search, but this technology cannot perform semantic expansion of query conditions. In the case of "multiple words with one meaning" and "polysemy of one word," the retrieval accuracy of traditional retrieval systems decreases. In order to solve the previously mentioned problems, this study proposes semantic retrieval based on domain ontology technology. The purpose of semantic retrieval is to semantically expand the user's query conditions on the basis of accurately understanding the retrieval conditions. At the same time, with the help of the constructed domain ontology, it provides more accurate and comprehensive retrieval services for document retrieval. The experimental results of this study show that, for the clustering of the entire dataset, the number of ontology concepts in each article is 61% of that, before merging, which effectively reduces the complexity of the semantic network model. Therefore, the validity of the ontology concept merging algorithm proposed in this study is verified. [ABSTRACT FROM AUTHOR]

The construction and retrieval of indoor maps are important for indoor positioning and navigation. It is necessary to ensure a good user experience while meeting real-time requirements. Unlike outdoor maps, indoor space is limited, and the relationship between indoor objects is complex which would result in an uneven indoor data distribution and close relationship between the data. A data storage model based on the octree scene segmentation structure was proposed in this paper initially. The traditional octree structure data storage model has been improved so that the data could be backtracked. The proposed method will solve the problem of partition lines within the range of the object data and improve the overall storage efficiency. Moreover, a data retrieval algorithm based on octree storage structure was proposed. The algorithm adopts the idea of "searching for a point, points around the searched point are within the searching range." Combined with the octree neighbor retrieval methods, the closure constraints are added. Experimental results show that using the improved octree storage structure, the retrieval cost is 1/8 of R-tree. However, by using the neighbor retrieval, it improved the search efficiency by about 27% on average. After adding the closure constraint, the retrieval efficiency increases by 25% on average. [ABSTRACT FROM AUTHOR]

This paper briefly introduces the characteristics of content-based multimedia retrieval under the information background, analyzes the implementation process of these technologies in the multimedia archives retrieval system including video and image information of digital archives, and points out that the content-based multimedia retrieval technology is bound to be organically combined with the traditional text retrieval methods. The information retrieval technologies in the past can only comply with the specific requirements of customers. Due to their characteristics of universality, they can hardly meet the demands of different environments, various purposes, and different times at the same time yet. Researchers have put forward personalized retrieval of multimedia files based on the BP neural network computing. In this way, the interest model of customers can be analyzed based on the characteristics of the different classification areas of users. Subsequently, the corresponding calculations are carried out, and the model is updated accordingly. Through the experiments, it is verified that the probability model put forward in this paper is the optimal solution to express the interest of customers and its changes. [ABSTRACT FROM AUTHOR]

Methods of the electrocardiography (ECG) signal features extraction are required to detect heart abnormalities and different kinds of diseases. However, different artefacts and measurement noise often hinder providing accurate features extraction. One of the standard techniques developed for ECG signals employs linear prediction. Referring to the fact that prediction is not required for ECG signal processing, smoothing can be more efficient. In this paper, we employ the p-shift unbiased finite impulse response (UFIR) filter, which becomes smooth by p<0. We develop this filter to have an adaptive averaging horizon: optimal for slow ECG behaviours and minimal for fast excursions. It is shown that the adaptive UFIR algorithm developed in such a way provides better denoising and suboptimal features extraction in terms of the output signal-noise ratio (SNR). The algorithm is developed to detect durations and amplitudes of the P-wave, QRS-complex, and T-wave in the standard ECG signal map. Better performance of the algorithm designed is demonstrated in a comparison with the standard linear predictor, UFIR filter, and UFIR predictive filter based on real ECG data associated with normal heartbeats. [ABSTRACT FROM AUTHOR]

In this paper, we present a routing algorithm for a class of networks where a contemporaneous end-to-end path may not exist at the time of data transfer due to intermittent links. Several examples of such networks exist in the context of sensor networks, mobile ad hoc networks and delay tolerant networks. The proposed routing algorithms follow a priori routing similar to source routing. Link state changes are assumed to be known ahead of time, for instance, due to planned duty cycling resulting in scheduled connectivity. The basic idea behind the proposed routing algorithms is to modify the breadth first search (BFS) algorithm to take into account link state changes and find the quickest route between source and destination nodes. We introduce the idea of time-varying storage domains where all nodes connected for a length of time act as a single storage unit by sharing the aggregated storage capacity of the nodes. This will help situations where storage is a limited resource. We evaluate the routing algorithm with and without storage domain in an extensive simulation. The delay performance of the proposed algorithms is conceptually the same as flooding-based algorithms but without the penalty of multiple copies. More significantly, we show that the Quickest Storage Domain (Quickest SD) algorithm distributes the storage demand across many nodes in the network topology, enabling balanced load and higher network utilization. In fact, we show that for the same level of performance, we can actually cut the storage requirement in half using the Quickest SD algorithm. Copyright © 2009 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

With the exponential growth in the capacity of information generated and the emerging need for data to be stored for prolonged period of time, there emerges a need for a storage medium with high capacity, high storage density, and possibility to withstand extreme environmental conditions. DNA emerges as the prospective medium for data storage with its striking features. Diverse encoding models for reading and writing data onto DNA, codes for encrypting data which addresses issues of error generation, and approaches for developing codons and storage styles have been developed over the recent past. DNA has been identified as a potential medium for secret writing, which achieves the way towards DNA cryptography and stenography. DNA utilized as an organic memory device along with big data storage and analytics in DNA has paved the way towards DNA computing for solving computational problems. This paper critically analyzes the various methods used for encoding and encrypting data onto DNA while identifying the advantages and capability of every scheme to overcome the drawbacks identified priorly. Cryptography and stenography techniques have been analyzed in a critical approach while identifying the limitations of each method. This paper also identifies the advantages and limitations of DNA as a memory device and memory applications. [ABSTRACT FROM AUTHOR]

The traditional small and medium enterprise management system has a low efficiency of operation and management. A small and medium enterprise management system based on an edge algorithm is designed in this paper to address this problem. In the proposed algorithm, the management system is used for efficient information transmission and sharing. The system consists of a collaborative function layer, data service layer, basic environment layer, and application layer. The application layer realizes the storage and integration of enterprise information data through the regulation of the collaborative management center and realizes the privacy encryption protection of information based on the protection mechanism of edge computing. The information is transmitted to the data layer for classified storage through the network communication of the basic environment layer. The collaborative function layer takes the process management control engine combined with each service interface to complete the information retrieval of the data layer. It uses the algorithm based on the number of fusion common scoring users and information interest relationship to query and push information. The test results show that the system has good information query performance, pushing query information in one minute. The running function can meet the user needs and effectively achieve information privacy protection. [ABSTRACT FROM AUTHOR]

Digitizing medical information is an emerging trend that employs information and communication technology (ICT) to manage health records, diagnostic reports, and other medical data more effectively, in order to improve the overall quality of medical services. However, medical information is highly confidential and involves private information, even legitimate access to data raises privacy concerns. Medical records provide health information on an as-needed basis for diagnosis and treatment, and the information is also important for medical research and other health management applications. Traditional privacy risk management systems have focused on reducing reidentification risk, and they do not consider information loss. In addition, such systems cannot identify and isolate data that carries high risk of privacy violations. This paper proposes the Hiatus Tailor (HT) system, which ensures low re-identification risk for medical records, while providing more authenticated information to database users and identifying high-risk data in the database for better system management. The experimental results demonstrate that the HT system achieves much lower information loss than traditional risk management methods, with the same risk of reidentification. [ABSTRACT FROM AUTHOR]

Object-oriented platforms developed for the numerical solution of PDEs must combine flexibility and reusability, in order to ease the integration of new functionalities and algorithms. While designing similar frameworks, a built-in support for high performance should be provided and enforced transparently, especially in parallel simulations. The paper presents solutions developed to effectively tackle these and other more specific problems (data handling and storage, implementation of physical models and numerical methods) that have arisen in the development of COOLFluiD, an environment for PDE solvers. Particular attention is devoted to describe a data storage facility, highly suitable for both serial and parallel computing, and to discuss the application of two design patterns, Perspective and Method-Command-Strategy, that support extensibility and run-time flexibility in the implementation of physical models and generic numerical algorithms respectively. [ABSTRACT FROM AUTHOR]

The similarity-based retrieval of lung nodule computed tomography (CT) images is an important task in the computer-aided diagnosis of lung lesions. It can provide similar clinical cases for physicians and help them make reliable clinical diagnostic decisions. However, when handling large-scale lung images with a general-purpose computer, traditional image retrieval methods may not be efficient. In this paper, a new retrieval framework based on a hashing method for lung nodule CT images is proposed. This method can translate high-dimensional image features into a compact hash code, so the retrieval time and required memory space can be reduced greatly. Moreover, a pruning algorithm is presented to further improve the retrieval speed, and a pruning-based decision rule is presented to improve the retrieval precision. Finally, the proposed retrieval method is validated on 2,450 lung nodule CT images selected from the public Lung Image Database Consortium (LIDC) database. The experimental results show that the proposed pruning algorithm effectively reduces the retrieval time of lung nodule CT images and improves the retrieval precision. In addition, the retrieval framework is evaluated by differentiating benign and malignant nodules, and the classification accuracy can reach 86.62%, outperforming other commonly used classification methods. [ABSTRACT FROM AUTHOR]

With the rapid growth of biomedical literature, a large amount of knowledge about diseases, symptoms, and therapeutic substances hidden in the literature can be used for drug discovery and disease therapy. In this paper, we present a method of constructing two models for extracting the relations between the disease and symptom and symptom and therapeutic substance from biomedical texts, respectively. The former judges whether a disease causes a certain physiological phenomenon while the latter determines whether a substance relieves or eliminates a certain physiological phenomenon. These two kinds of relations can be further utilized to extract the relations between disease and therapeutic substance. In our method, first two training sets for extracting the relations between the disease-symptom and symptom-therapeutic substance are manually annotated and then two semisupervised learning algorithms, that is, Co-Training and Tri-Training, are applied to utilize the unlabeled data to boost the relation extraction performance. Experimental results show that exploiting the unlabeled data with both Co-Training and Tri-Training algorithms can enhance the performance effectively. [ABSTRACT FROM AUTHOR]

This paper describes the construction of a Cloud for Distributed Data Analysis (CDDA) based on the actor model. The design uses an approach to map the data mining algorithms on decomposed functional blocks, which are assigned to actors. Using actors allows users to move the computation closely towards the stored data. The process does not require loading data sets into the cloud and allows users to analyze confidential information locally. The results of experiments show that the efficiency of the proposed approach outperforms established solutions. [ABSTRACT FROM AUTHOR]

The exercise volume and exercise level can be quantitatively assessed by measuring and collecting athletes' health and exercise data. The protection of athletes' health information has lately become an important research topic due to a rise in sports activities. However, due to the nature of the data and the limits of protection models, protecting athlete health data is a complex undertaking. Machine learning and blockchain have caused worldwide technological innovation, and it is bound to bring deep modifications to the sports industry. The main purpose of blockchain is security, decentralization, traceability, and credibility of the athlete's health data protection and gathering system. To progress and increase the sports industry and methodically assess the physical fitness of sportspersons' health information, this study concentrates on the Machine Learning and Blockchain-based Athlete Health Information Protection System (MLB-AHIPS) proposed in the sports industry. The ML technique is utilized to clean and handle the information to comprehend the recognition and secure managing of the sportsperson's fitness information. The system uses attribute-based access control, which permits dynamic and fine-grained access to athlete health data, and then stores the health data in the blockchain, which can be secured and tamper-proof by expressing the respective smart contracts. The simulation outcomes illustrate that the suggested MLB-AHIPS attains a high accuracy ratio of 97.8%, security ratio of 98.3%, an efficiency ratio of 97.1%, scalability ratio of 98.9%, and data access rate of 97.2% compared to other existing approach. [ABSTRACT FROM AUTHOR]

The optical image encryption has attracted more and more researchers’ attention, and the various encryption schemes have been proposed. In existing optical cryptosystem, the phase functions or images are usually used as the encryption keys, and it is difficult that the traditional public-key algorithm (such as RSA, ECC, etc.) is used to complete large numerical key transfer. In this paper, we propose a key distribution scheme based on the phase retrieval algorithm and the RSA public-key algorithm, which solves the problem for the key distribution in optical image encryption system. Furthermore, we also propose a novel image encryption system based on the key distribution principle. In the system, the different keys can be used in every encryption process, which greatly improves the security of the system. [ABSTRACT FROM AUTHOR]

In order to provide users with more humanized and intelligent big data knowledge services, a research method of intelligent big information retrieval of Smart Library Based on graph neural network (GNN) algorithm is proposed. Through the key technical problems and solutions of information recommendation represented by graph neural network (GNN) algorithm, this method explores how the library can realize the management and value mining of big data knowledge services. The research shows that the intelligent information retrieval of Smart Library Based on graph neural network (GNN) algorithm is 80% higher than the previous general methods. Graph neural network is a more advantageous algorithm for node classification, link prediction, node clustering, or network visualization, which is of great help to improve the efficiency of information retrieval. [ABSTRACT FROM AUTHOR]

One of the most well-known methods for solving real-world and complex optimization problems is the gravitational search algorithm (GSA). The gravitational search technique suffers from a sluggish convergence rate and weak local search capabilities while solving complicated optimization problems. A unique hybrid population-based strategy is designed to tackle the problem by combining dynamic multiswarm particle swarm optimization with gravitational search algorithm (GSADMSPSO). In this manuscript, GSADMSPSO is used as novel training techniques for Feedforward Neural Networks (FNNs) in order to test the algorithm's efficiency in decreasing the issues of local minima trapping and existing evolutionary learning methods' poor convergence rate. A novel method GSADMSPSO distributes the primary population of masses into smaller subswarms, according to the proposed algorithm, and also stabilizes them by offering a new neighborhood plan. At this time, each agent (particle) increases its position and velocity by using the suggested algorithm's global search capability. The fundamental concept is to combine GSA's ability with DMSPSO's to improve the performance of a given algorithm's exploration and exploitation. The suggested algorithm's performance on a range of well-known benchmark test functions, GSA, and its variations is compared. The results of the experiments suggest that the proposed method outperforms the other variants in terms of convergence speed and avoiding local minima; FNNs are being trained. [ABSTRACT FROM AUTHOR]

The multi-mode matching has noteworthy transformations equated with the classical multi-mode matching algorithms. It is frequently used for the policy part of the TCP connection to connect the English characters. In this article, we analyzed the features of multi-mode similarity for audit information retrieval in a cluttered environment. The proposed model analyzed the performance theorem of a multi-mode matching algorithm for audit information retrieval. It also analyzed the shortcomings of existing multi-mode similarity systems and proposed a multi-mode algorithm based on the trail hash trie matching machine suitable for mixed Chinese and English environments. The algorithm converts the set of pattern strings into multiple finite automata and then builds a state driver using the set of pattern strings. The state driver is driven by the characters of the string to be matched in turn, and each finite automaton is driven by the state driver to achieve similar multimodal matching with mixed English and Chinese characters by allowing the insertion errors. The algorithm does not need to match every character and can make full use of the information of this unsuccessful match during the matching process and skip as many characters as possible by combining the improved text window mechanism. It can control the upper limit of allowed errors for each pattern string. The matching speed is independent of the number k of allowed insertion errors. The algorithm has comprehensive application projections in the fields of information auditing, database, and information retrieval, respectively. [ABSTRACT FROM AUTHOR]

In this paper we propose a novel visual method for protein model classification and retrieval. Different from the conventional methods, the key idea of the proposed method is to extract image features of proteins and measure the visual similarity between proteins. Firstly, themultiview images are captured by vertices and planes of a given octahedron surrounding the protein. Secondly, the local features are extracted from each image of the different views by the SURF algorithm and are vector quantized into visual words using a visual codebook. Finally, KLD is employed to calculate the similarity distance between two feature vectors. Experimental results show that the proposed method has encouraging performances for protein retrieval and categorization as shown in the comparison with other methods. [ABSTRACT FROM AUTHOR]

Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers' route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network. [ABSTRACT FROM AUTHOR]

Sensor networks are especially useful in catastrophic or disaster scenarios such as abysmal sea, floods, fires, or earthquakes where human participation may be too dangerous. Storage technologies take a critical position for WSNs in such scenarios since the sensor nodes may themselves fail unpredictably, resulting in the loss of valuable data. This paper focuses on fountain code-based data storage and recovery solutions for WSNs in disaster scenarios. A review on current technologies is given on challenges posed by disaster environments. Two information fusion-based distributed storage (IFDS) algorithms are proposed in the "few global knowledge" and "zero-configuration" paradigm, respectively. Correspondingly, a high-efficient retrieve algorithm is designed for general storage algorithms using Robust Soliton distribution. We observe that the successful decoding probability can be provisioned by properly selecting parameters-the ratio of number of source node and total nodes, and the storage capacity M in each node. [ABSTRACT FROM AUTHOR]

The identification of discriminative features from information-rich data with the goal of clinical diagnosis is crucial in the field of biomedical science. In this context, many machine-learning techniques have been widely applied and achieved remarkable results. However, disease, especially cancer, is often caused by a group of features with complex interactions. Unlike traditional feature selection methods, which only focused on finding single discriminative features, a multilayer feature subset selection method (MLFSSM), which employs randomized search and multilayer structure to select a discriminative subset, is proposed herein. In each level of this method, many feature subsets are generated to assure the diversity of the combinations, and the weights of features are evaluated on the performances of the subsets. The weight of a feature would increase if the feature is selected into more subsets with better performances compared with other features on the current layer. In this manner, the values of feature weights are revised layer-by-layer; the precision of feature weights is constantly improved; and better subsets are repeatedly constructed by the features with higher weights. Finally, the topmost feature subset of the last layer is returned. The experimental results based on five public gene datasets showed that the subsets selected by MLFSSM were more discriminative than the results by traditional feature methods including LVW (a feature subset method used the Las Vegas method for randomized search strategy), GAANN (a feature subset selection method based genetic algorithm (GA)), and support vector machine recursive feature elimination (SVM-RFE). Furthermore, MLFSSM showed higher classification performance than some state-of-the-art methods which selected feature pairs or groups, including top scoring pair (TSP), k-top scoring pairs (K-TSP), and relative simplicity-based direct classifier (RS-DC). [ABSTRACT FROM AUTHOR]

Summary [ABSTRACT FROM AUTHOR]

Algorithms for clustering Web search results have to be efficient and robust. Furthermore they must be able to cluster a data set without using any kind of a priori information, such as the required number of clusters. Clustering algorithms inspired by the behavior of real ants generally meet these requirements. In this article we propose a novel approach to ant-based clustering, based on fuzzy logic. We show that it improves existing approaches and illustrates how our algorithm can be applied to the problem of Web search results clustering. [ABSTRACT FROM AUTHOR]