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.
There are so many web data hidden behind so-called deep web and can only be accessed through query interfaces, and the data volume is increasing. We often need to fill forms over alternative interfaces in the same domain to select the best product or service, such as buying a book across various online book websites to choose the most affordable one. Integrating these web interfaces in the same domain...
This paper mainly focuses on the technical factors of the website targeted at shopping mall websites in Korea and China. There are a total of six technical factors, and we conducted an empirical study on how those six factors are different based on the shopping mall websites of two different countries. Statistical data for an empirical study targeted at undergraduate students in Korea and China, and...
Due to great advances in computing and Internet technologies, organizations have been enabled to collect and generate a large amount of data. Most of these organizations tend to analyze their data to discover new patterns. Usually, analyzing such amount of data requires huge computational power and storage facilities that may not be available to these organizations. Cloud computing offers the best...
Shared caches in chip multi-processors (CMPs) have important benefits such as accelerating inter-core communication, yet the inherent cache contention among multiple processes on such architectures can significantly degrade performance. To address this problem, cache partitioning has been studied based on the prediction of the cache miss rate curve (MRC) of the concurrently running programs. On-line...
Bibliographical information of scientific papers is of great value since the Science Citation Index is introduced to measure research impact. Most scientific documents available on the web are unstructured or semi-structured, and the automatic reference metadata extraction process becomes an important task. This paper describes a framework for automatic reference metadata extraction from scientific...
Most scientific documents on the web are unstructured or semi-structured, and the automatic document metadata extraction process becomes an important task. This paper describes a framework for automatic metadata extraction from scientific papers. Based on a spatial and visual knowledge principle, our system can extract title, authors and abstract from scientific papers. We utilize format information...
Many techniques have been developed to accelerate micro-architecture simulation since it is becoming increasingly urgent as the complexity of workloads and simulated processors increases. However, most of popular techniques need profiles or trial simulations to determine parameters before real simulations. When the number of dynamic instructions of workloads such as SPEC CPU2006 is huge, the profiles...
Range query in DHT based P2P network is a hot topic in recent researches. The hashing function in DHT protocols makes the data hard to keep their original order relationship. Hence range queries for such networks become difficult. This paper presents the design of Yarqs-a new schema to achieve range queries in DHT based P2P networks. By using the inherent characteristics of DHT based networks, Yarqs...
Due to homonyms, abbreviations, etc., name ambiguity is widely available in Web and e-document. For example, when integrating heterogeneous literature databases, because there are different name specifications, different authors may be thought of as the same author, and vice versa. Therefore, name ambiguity makes data robust even dirty and lowers the precision of information retrieval. In this paper,...
Accelerating micro-architecture simulation is becoming increasingly urgent as the complexity of workload and simulated processor increases. This paper presents a novel two-stage sampling (TSS) scheme to accelerate the sampling-based simulation. It firstly selects some large samples from a dynamic instruction stream as candidates of detail simulation and then samples some small groups from each selected...
This paper provides a new data fusion mechanism based on regulation and reliability to solve the data conflict problems of multi-source heterogeneous data fusion in traffic information engineering. This mechanism evaluates each data source on historical reliability and data source QoS (Quality of Service), and then gives its reliability result. Userspsila reliability on the data source is calculated...
This paper presents an Agent-based Timing-Sync Algorithm (ATSA) for sensor networks that aims at providing network-wide time synchronization in a sensor network. ATSA works in three steps as following. Firstly, the root time node is selected, and then a hierarchical structure is established in the network, finally, by using time-agent, a pair wise synchronization is performed along the edges of this...
Software simulation is the most important method for computer architects to evaluate the function and performance of their new designs. Due to the prohibitively long simulation time when running the full dynamic instruction streams of benchmarks on simulators in detailed simulation mode, many use sampling simulation to accelerate the simulation speed without sacrificing the accuracy greatly. However,...
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.