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.
More and more users or applications showed high interest in obtaining moving object locations from a wireless sensor network. However, a moving object usually updates its location very frequently, and thus, a great number of messages for updating the locations in the wireless sensor networks are incurred. In this paper, we propose an index structure, called the gossip-enabled spatial index tree (GSI-tree),...
Various routing structures have been proposed for the data gathering in wireless sensor networks, which are supposed to be efficient in terms of energy consumption and delivery delay. Unfortunately, most of these structures assume not only a static and stable network environment but also the network-wide information such as global topology. These assumptions lead to intolerable overhead in the construction...
In this paper, we present the nutrition prescription model for meals. Moreover, we present the MOSGA and we analyze it regarding the solution of MOPs. Finally, we apply the MOSGA to solve the nutrition prescription problem with the aim of find the optimum tradeoff surface. In the experiment, we obtain optimized solutions using the MOSGA. The solutions, provided by the proposed algorithm for the nutrition...
Floorplanning is becoming more and more important in VLSI design flows, especially for system-on-chip (SoC) designs where IP blocks dominate standard cells. Moreover, in deep sub-micron technologies, where process variations can introduce extra signal skew, it is desirable to have floorplans with balanced net delays to increase the safety margins of the design. In this paper, we investigate the properties...
Mesh router (MR) placement is one of the fundamental issues that need to be carefully addressed to provide mesh clients with satisfactory performance in a wireless mesh network (WMN). This paper proposes a virtual force based MR placement algorithm (VFPlace) which is scalable and self- adaptive. Given a certain number of MRs, VFPlace targets to determine the positions of these MRs to maximize their...
Point of presence (PoP) level Internet maps are promising for tasks such as reasoning about the Internet evolution in time or Internet delay estimation. We thus suggest an efficient algorithm for generating PoP level Internet maps directly from the traceroute measurement results. The algorithm avoids the noisy process of interface aggregation to routers. The PoP level maps we obtain are annotated...
Real-time search algorithms are limited to constant-bounded search at each time step. We do not see much difference between standard search algorithms and good real-time search algorithms when problem sizes are small. However, having a good real-time search algorithm becomes important when problem sizes are large. In this paper we introduce a simple yet efficient algorithm, Spider search, which uses...
The analog placement algorithm Plantage, presented in this paper, generates placements for analog circuits with comprehensive placement constraints. Plantage is based on a hierarchically bounded enumeration of basic building blocks, using B*-trees. The practically relevant solution space is thereby enumerated quasi-complete. The sets of possible placements of the basic building blocks are represented...
In this paper we present how the atom interface can be used for browsing service registries and how this is applied in the case of an e-government services platform. Although e-government is a vibrant research domain, there is notably little work regarding HCI related issues. Our work shows the kind of problems that citizens face when using existing systems, and how new design approaches, like the...
Statistical properties of high-resolution overhead images representing different land use categories are analyzed using various local and global statistical image properties based on the shape of the power spectrum, image gradient distributions, edge co-occurrence, and inter-scale wavelet coefficient distributions. The analysis was performed on a database of high-resolution (1 meter) overhead images...
This paper presents a two-step dependency parser to parse Chinese deterministically. By dividing a sentence into two parts and parsing them separately, the error accumulation can be avoided effectively. Previous works on shift-reduce dependency parser may guarantee the greedy characteristic of deterministic parsing less. This paper improves on a kind of deterministic dependency parsing method to weaken...
Web page content extraction can be achieved by node-based and segmentation-based algorithms respectively on top of the document object model (DOM). However, the node-based algorithm often removes content embedded as anchor text; while the segmentation-based way can not distinguish irrelevant text from content text when they are divided into the same segment. The two kinds of algorithms don't keep...
The Oriented Bounding Box trees (OBB-trees) offer efficient means for real-time collision detection between geometric models. The efficiency of the OBB-tree in answering the queries depends mainly on the way the triangles are splitted and distributed to the child nodes. In this paper we examine four different partitioning methods for top-down construction of OBB-trees and compare their performance...
As the community health care plays an important role in improving the health care equality and efficiency nowadays, It is one of the targets of the health care reform to establish a well distributed geographical community health network in China. In this paper, taking Haidian District in Beijing City as an example, the CHCs locations as well as the service allocation problem is solved by using an...
The remarkable increase of web services raises the challenge of service discovery. In UDDI, the description of the services is based on syntax and the search does not effectively make use of the IO properties of the services. In order to overcome these limitations, some semantic match algorithms have been proposed. This paper analyzed the defects of the semantic match algorithm proposed by M. Paolucci...
The present methods for measuring concepts semantic similarity only focus on certain influencing factors, have poor convergence performances and canpsilat calculate accurately. This paper compares three kinds of ontology-based semantic similarity calculation models. On this basis, an improved algorithm that inherits the distance-based calculation model is proposed. In this approach, node depth, local...
This paper considers a location-optimization problem where the classical facility location model is recast in a stochastic environment with several risk factors that make travel time from facility site to customer site probabilistic. We present a Stochastically Travel Time Location Problem (STTLP), a more general set covering problem than classical set covering location problem. Given a discrete network...
MELEACH-L proposed in this paper as an expanded version of MELEACH makes the major functions of MELEACH applicable to large-scale WSNs whose dimension is much larger than the largest transmission radius of the sensor nodes. The channel assignment among neighbor clusters and the cooperation among cluster heads during data collection are two major difficulties in a large WSN. MELEACH-L solves the two...
Nearest neighbor is the basic method in instance-based learning, which is used to approach the real and discrete objective function. In order to enhance the learning speed in nearest neighbor, the optimization of KD tree algorithm was applied in the nearest neighbor method by building the index of the training set. Proper adjustments of the inserting order of the training set can bring the tree more...
For the reliable real time video transmission of overlay network, optimal multicast service nodes (MSNs) should be selected to build highly efficient hierarchical overlay multicast tree. In this paper, a MSNs selection algorithm based on immune evolution is proposed. MSNs are encoded by real-coded mechanism, and the K-medoids clustering distance is used to measure the similarity between MSN and other...
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.