Contention free embedding of complete binary trees into 3D meshes in half and full-duplexed network models
We consider the problem of dimension-ordered embedding of complete binary trees into 3-dimensional meshes without link contention. In this paper, the embedding problems are studied under two different network models: half-duplexed networks and full-duplexed networks. Gibbons and Paterson showed that a complete binary tree T/sub p/ could be disjointedly embedded into a full-duplexed 2-dimensional mesh of optimum size without dimension-ordered routing. Using the dimension-ordered routing, the authors showed that T/sub p/ could be embedded into a 3-dimensional mesh of optimum size with link congestion two. This paper presents the dimension-ordered embedding algorithms of the complete binary trees into the wormhole routed 3-dimensional meshes without link contention achieving expansion of no larger than 1.125 of optimum in half-duplexed network model and optimum in full-duplexed network model.

title: Embedding of Complete Binary Trees into Meshes with Row-Column Routing
abstract: This paper considers the problem of embedding complete binary trees into meshes using the row-column routing and obtained the following results: a complete binary tree with 2/sup p/-1 nodes can be embedded (1) with link congestion one into a /sup 9///sub 8//spl radic/(2/sup p/)/spl times//sup 9///sub 8//spl radic/(2/sup p/) mesh when p is even and a /spl radic/(/sup 9///sub 8/2/sup p/)/spl times//spl radic/(/sup 9///sub 8/2/sup p/) mesh when p is odd, and (2) with link congestion two into a /spl radic/(2/sup p/)/spl times//spl radic/(2/sup p/) mesh when p is even, and a /spl radic/(2/sup p-1/)/spl times//spl radic/(2/sup p-1/) mesh when p is odd.

title: A multiple criteria model for the location-allocation problem
abstract: This study presents the application of integer goal programming to the facility location and products allocation problem with multiple, competing objectives. The proposed model describes the situation in which a firm evaluates six potential production plant location sites in four states that would serve four distribution centers. The model considers multiple objectives including several qualitative factors of location analysis and cost-related objectives have been considered in the model. The result of the model indicates that integer goal programming is one of the promising techniques which are applicable to the real-world location/allocation problems.

title: Intelligent Multimedia Service System Based on Context Awareness in Smart Home
abstract: According to the rapid change of a computing environment, it is coming an age of ubiquitous computing that we can make use of information service at any time and anywhere as the paradigm of digital convergence such as broadcasting, communication, and appliances. Consequently, Smart Home environment is constructed in the house. Various services such as security/automation, health monitoring, medical examination and treatment, entertainment, education, and e-business are realized at home. Both affective, systematic managements and services that correspond with the above environment are required inmultimedia services as well. In this paper, we propose a Intelligent Multimedia Service System(IMSS) based on context awareness in Smart Home which provides multimedia interoperability among incompatible multimedia play devices, intelligently processes context awareness information, transparent, and provides safe services.

title: Multi-scale line drawings from 3D meshes
abstract: We present a method to view-dependently control the size of shape features depicted in computer-generated line drawings of 3D meshes. Our method exhibits good temporal coherence during level of detail transitions, and is fast because the calculations are carried out entirely on the GPU. The strategy is to pre-compute, via a digital geometry processing technique, a sequence of filtered versions of the mesh that eliminate shape features at progressively larger scales. Each filtered mesh retains the original connectivity, providing a direct correspondence between meshes.At run-time, the meshes are loaded onto the graphics card and a vertex program interpolates curvatures and positions between corresponding vertices in adjacent meshes of the sequence. A fragment program then renders silhouettes and suggestive contours to produce a line drawing for which the size of depicted shape features follows a user-specified "target size". For example, we can depict fine shape features over nearby surfaces, and appropriately coarse-scaled features in more distant regions. More general level-of-detail policies could be implemented on top of our approach by letting the target size vary with scene attributes such as depth, image location, or annotations provided by the scene designer.

title: Selecting a routing strategy for your ad hoc network
abstract: In this paper we investigate the performance of routing strategies in ad hoc networks. An ad hoc network operates without a central entity or infrastructure, and is composed of highly mobile network hosts. In this environment, routes tend to be multihop and routing protocols are faced with host mobility and bandwidth constraints. In recent years, numerous routing protocols of different styles have been proposed. Traditional table-driven protocols (distance vector, link state), reactive on-demand protocols, and location-based protocols that use position information provided by GPS are the most commonly used strategies. Using PARSEC, we simulate protocols that represent these various routing strategies. The protocols are evaluated in different network scenarios. Relative strengths, weaknesses, and applicability to various situations of each routing protocol are studied and discussed.

title: Distributed Channel Monitoring for Wireless Bandwidth Aggregation
abstract: Aggregating low-speed WAN links into a higher-speed logical link promises to improve data-transfer rates to collaborating communities of wireless mobile multi-homed devices. Such bandwidth aggregation systems must adapt to link dynamics as the number of links and the channel conditions vary with time due to mobility, power dissipation, and channel interference. A monitoring architecture that accurately measures the link dynamics and promptly feeds this information to the system is vital to realize significant bandwidth aggregation performance gains. We present various architectural design alternatives for such a monitoring system, and evaluate them using simulation. We show that a properly-designed monitoring system can accurately measure and quickly respond to changes in communication link performance while minimizing the control overhead.