The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The natural language semantic corpus construction is the key step to implement information exchange in the intelligent cloud-computing environment. This paper makes a detailed analysis of semantic corpus construction technologies, and proposes a new webpage de-duplication algorithm based on TF-IDF and word vector distance. Experimental results show accuracy and efficiency of the proposed method. Our...
Online Public Opinion Systems (OPOS) target at collecting, analyzing, summarizing and monitoring massive public opinions on the Internet in real time. Meanwhile, OPOS often have the ability to identify the key or sudden events, and thus notify related people immediately for rapid responses to these events. As part of this endeavor, this paper introduces the architecture and techniques of an OPOS that...
Multiple InSAR techniques are increasingly being developed for earth observation. However, among them, persistent scatterers-based InSAR (PSI) techniques fail to obtain enough measurement points (MPs) in rural mountainous area due to the lack of persistent scatterers (PSs), such as ma-made structures, rocks, and outcrops, etc. In this paper, Distributed Scatterers-based InSAR (DS-InSAR) algorithm,...
Covering arrays (CAs) are often used as test suites for combinatorial interaction testing to discover interaction faults of real-world systems. Most real-world systems involve constraints, so improving algorithms for covering array generation (CAG) with constraints is beneficial. Two popular methods for constrained CAG are greedy construction and meta-heuristic search. Recently, a meta-heuristic framework...
It is well-known that using floating-point numbers may inevitably result in inaccurate results and sometimes even cause serious software failures. Safety-critical software often has strict requirements on the upper bound of inaccuracy, and a crucial task in testing is to check whether significant inaccuracies may be produced. The main existing approach to the floating-point inaccuracy problem is...
Automatic bug fixing has become a promising direction for reducing manual effort in debugging. However, general approaches to automatic bug fixing may face some fundamental difficulties. In this paper, we argue that automatic fixing of specific types of bugs can be a useful complement. This paper reports our first attempt towards automatically fixing memory leaks in C programs. Our approach generates...
This paper introduces a set of self-correction strategies for improved oscillation modal analysis of ring down responses from synchrophasors in frequency domain analysis. It is shown that the modal estimates of frequency, damping ratio and mode shape using the improved frequency domain algorithms of the paper match well with other time-domain algorithms while preserving their inherent advantages of...
Under the cloud manufacturing environment, with the increasing number of manufacturing cloud services, one of the issues needs to be resolved is to find a manufacturing cloud service that meets users' demand. However, until now, there is not an outstanding manufacturing cloud discovery mechanism to help users to find the appropriate solution among numerous existing manufacturing cloud services. In...
Along with the rapid development of the Internet, especially the advent of cloud computing era, instance-intensive workflow applications will play an increasingly important role in people's daily life. Most of the existing scheduling algorithms are designed just for a single complex workflow instance. This paper takes cloud workflow as a research background, completely generalizes and describes the...
For academic scientists, it is not satisfy to meet their researches requirements only finding out the basic scientific research activities recent years. The future of research in this field, evolution of the hot spot and the research front of relevant fields has the same Ref. value for current field researching. To solve these problems, we use inspiration discovery method by mining and clustering...
This paper proposes a GMPLS survivability choice scheme based differentiated services. This algorithm which is based on three normal GMPLS survivability scheme models (namely Global Protection, Reverse Backup and Local Repair) chooses evaluation function to decide in advance most suitable restoration model for working path of each kind of traffic, then only employs it to calculate the backup path...
This paper presents a mixed simulation of a back propagation (BP) neural network algorithm with a digital and analog circuit. The analog circuit is designed to realize the main part of the neural network to speed the operation rate, which may solve one difficulty in neural network applications. Meanwhile, the digital circuit is employed for its advantages on storage and control ability to constitute...
AprioriAll and AprioriSome are very famous algorithms for mining sequential patterns, which are used to find motifs on a fixed min-support number. In this paper, we contribute a new algorithm that can find all motifs on any min-support numbers.
A parallel constructing-density-tree clustering algorithm based on data partitioning (PCAP) was presented. The PCAP automatically partitioned global data space into load-balanced subspaces, which were distributed to different processors to complete subspacespsila clustering. The clustering result of global data space was achieved by merging those strong-association clusters though checking the association-intensity...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.