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.
A considerable number of domains deal with large and complex volumes of temporal data. The management of these volumes, from capture, storage, search, transfer, analysis and visualization, still provides interesting challenges. One critical task is the efficient retrieval of data (raw data or intermediate results from analytic tools). Previous work proposed the TravelLight method which reduced the...
The article describes static and dynamic analysis techniques and its applicability in information security problems such as software protection against unauthorized research. The basic idea of the article is that techniques of dynamic and static analysis must be used in combination with each other to increase the effectiveness of binary code analysis. In the article authors make contributions in binary...
Modulo Ten Search is a searching algorithm for finding a particular value in a list by performing modulus Ten of the number . Here the list will be partitioned into ten list based on modulo ten of the number. It searches an item by first taking modulo ten values and finally it undergoes a linear search method. A positional notation is required, but because integers can represent strings of characters...
For the complex constraints and large set of input data, we analyze the expert-chosen algorithm and its physical characteristics like data storage, exchange and operation. Based on three different data structures, we study the performance and resource consumption of the algorithm. The experimental results show that the associative arrays are more suitable for the physical characteristics of the algorithm...
Frequent serial episodes within an event sequence describe the behavior of users or systems about the application. Existing mining algorithms calculate the frequency of an episode based on overlapping or non-minimal occurrences, which is prone to over-counting the support of long episodes or poorly characterizing the followed-by-closely relationship over event types. In addition, due to utilizing...
In light of the recent development of multimedia and networking technologies, an exponentially increasing amount of content is available via various public services. That is why content identification attracts a lot of attention. One possible technology for content identification is based on digital fingerprinting. When trying to establish information-theoretic limits in this application, usually...
In recent years, content identification based on digital fingerprinting attracts a lot of attention in different emerging applications. At the same time, the theoretical analysis of digital fingerprinting systems for finite length case remains an open issue. Additionally, privacy leaks caused by fingerprint storage, distribution and sharing in a public domain via third party outsourced services cause...
The dramatic drop in the prices of data collection and storage devices has not only enabled organisations to store almost every activity of their business processes, they can also retain every state of these activities as well. Availability of these masses of data also means that by implementing different data mining techniques we can yield more accurate and useful information to be used for important...
The Corporative Information System SICORP (from its Spanish name, Sistema de Información Corporativa) of Mexico's Federal Electricity Commission (CFE), is presented here. SICORP is a very large and important system because the electric power company CFE presently dominates all the electric energy market in Mexico. This paper describes how the Digital Dashboards, which present information in an ideal...
Providing semantic interoperability is a current challenge in the field of data integration. In healthcare environments, sharing information may be essential to ensure a good treatment to the patient. In addition, it is necessary to ensure the accuracy of the data that is being exchanged. In this paper we present the design and implementation of an ontology for the patient clinical evolution record,...
In this article we present a new approach for the classification of structured data using graphs. We suggest to solve the problem of complexity in measuring the distance between graphs by using a new graph signature. We present an extension of the vector representation based on pattern frequency, which integrates labeling information. In this paper, we compare the results achieved on public graph...
Mining unordered trees are very useful in domains like XML date, biological information, Web structure, etc. In this paper, we introduce an efficient algorithm UTMiner (unordered trees miner). As the trees are unordered, in order to avoid mining the same subtrees, an efficient unordered trees standardization is first introduced to transform the unordered trees into the standard subtrees. Then UTMiner...
To address the multiplicity and copyright issues on file sharing social networks, we propose a fast video copy detection algorithm using the suffix array data structure in this work. The proposed algorithm consists of two steps. In the first step, we extract robust features which are discriminative yet insensitive to various attacks. Specifically, we develop a compact one-dimensional signature based...
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness! This includes lower bounds for: (a) high-dimensional problems, where the goal is to show large space lower bounds; (b) constant-dimensional geometric problems, where the goal is to bound the query time for space O(n polylg...
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the lscr1 and lscr2 norms. By contrast, our understanding of the lscrinfin norm is now where it was (exactly) 10 years ago. In FOCSpsila98, Indyk proved the following unorthodox result: there is a data structure (in fact, a decision tree) of size O(nrho), for any...
Skyline computing has become a hot topic in the International since 2001. In data stream environment, previous works about Skyline computing only sought to maintain full space Skyline points or compute subspace Skyline points over sliding window. No one has considered the problem of computing constrained Skyline points over sliding window. For many real-word applications, however, users usually expect...
XML becomes widely used in Web applications and Database systems. XML also is an important medium in pervasive computing. While, XML data may contain incomplete information as its own characters which are tree type structure, different schemas in heterogeneous databases and non-standard operations of normal users. This incomplete information can bring some unexpected effectives in operations like...
Continuous top-k query over data stream is very important for several on-line applications, including network monitoring, communication, sensor networks and stock market trading, etc. In this paper, we propose an effective pruning technique, which minimizes the number of tuples that need to be stored and manipulated. Based on it, a cost-efficient method for continuous top-k processing over single...
Multi-core SoC created great opportunities to increase overall system performance while keeping the power in check but also created many design challenges that designers must now overcome. The challenge of doubling performance every two years used to drive superscalar design with more functional units running concurrently or deeper pipeline racing for highest frequency at the cost of higher power...
Induced subtrees mining is of important researching value in the fields of XML documents, bioinformatics, web log and so forth. In this paper, the two conceptions of subtree vector and pruning threshold are proposed, and an algorithm ITMSV (induced subtrees mining based on subtree vector) is presented to discover frequent induced subtrees quickly by taking full advantages of the features of subtree...
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.