ppxscal/embedding_network huggingface dataset:
Research On Downlink Capacity For Broadband Wireless Access - VSFOFCDM
Authors: Wang Peng, Zhao Yu, Cao Dazhong
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Variable spreading factor-orthogonal frequency and code division multiplexing (VSF-OFCDM) is not only a CDMA network, but also the integration of MCCDMA, OFDM, VSF and time and frequency twodimensional spreading code. The complicated configuration is a challenge to traditional CDMA network planning-capacity planning. Detailed theory analysis of capacity is proposed and we develop expression of capacity for VSF-OFCDM in downlink from the viewpoint of multi-cell and isolated-cell environment. Through extremum of a multivariate function, which is proposed by Lagrange multipliers, we get the maximum capacity of voice and data in downlink, respectively. Simulation results show that in downlink, throughput performance of voice can achieve 38.9Mbit/s while the throughput performance of data can achieve 56.8Mbit/s from the viewpoint of multi-cell. In isolated-cell environment, throughput performance of the whole system can reach higher capacity because of none other-sell interference.
Message from the Program Committee Co-Chairs
Venue: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (2005)

mess-gen
A Speech-Centric Perspective for Human-Computer Interface: A Case Study
Authors: Li Deng, Dong Yu
Venue: Journal of VLSI Signal Processing Systems (2005)

Speech technology has been playing a central role in enhancing human-machine interactions, especially for small devices for which graphical user interface has obvious limitations. The speech-centric perspective for human-computer interface advanced in this paper derives from the view that speech is the only natural and expressive modality to enable people to access information from and to interact with any device. In this paper, we describe some recent work conducted at Microsoft Research, aimed at the development of enabling technologies for speech-centric multimodal human-computer interaction. In particular, we present a case study of a prototype system, called MapPointS, which is a speech-centric multimodal map-query application for North America. This prototype navigation system provides rich functionalities that allow users to obtain map-related information through speech, text, and pointing devices. Users can verbally query for state maps, city maps, directions, places, nearby businesses and other useful information within North America. They can also verbally control applications such as changing the map size and panning the map moving interactively through speech. In the current system, the results of the queries are presented back to users through graphical user interface. An overview and major components of the MapPointS system will be presented in detail first. This will be followed by software design engineering principles and considerations adopted in developing the MapPointS system, and by a description of some key robust speech processing technologies underlying general speech-centric human-computer interaction systems.
Why flow-completion time is the right metric for congestion control
Authors: Nandita Dukkipati, Nick McKeown
Venue: ACM SIGCOMM Computer Communication Review (2006)

Users typically want their flows to complete as quickly as possible. This makes Flow Completion Time (FCT) an im portant - arguably the most important - performance metric for the user. Yet research on congestion control focuses almost entirely on maximizing link throughput, utilization and fairness, which matter more to the operator than the user. In this paper we show that with typical Internet flow sizes, existing (TCP Reno) and newly proposed (XCP) congestion control algorithms make flows last much longer than necessary - often by one or two orders of magnitude. In contrast, we show how a new and practical algorithm - RCP (Rate Control Protocol) - enables flows to complete close to the minimum possible
Flexible Media Reflection for Collaborative Streaming Scenarios
Authors: Verena Kahmann, Jens Brandt, Lars Wolf
Venue: Proceedings of the 10th International Workshop on Web Content Caching and Distribution (2005)

In scenarios where recorded presentations are streamed to a group of clients, users prefer to control streaming on demand and to get content in an individually adapted fashion. IP multicast, the obvious solution for group streaming, cannot provide such a level of flexibility. End-system multicast approaches alleviate the need for multicast routing, but require more powerful clients and are more complex regarding to reconfiguration and inter-client synchronization. The dynamic reflector we propose supports the latter issues by grouping clients with the same play-time position into one reflector session. Individual play-time position changes can be performed by opening new so-called reflector sessions or dynamically switching between them. We provide measurements to show that the latency introduced by the use of a dynamic reflector is low compared to other solutions. Furthermore, we provide scalability enhancements in terms of more efficient network resource usage and delay reduction.
A New Reliable Routing Method Based on Probabilistic Forwarding in Wireless Sensor Network
Authors: Jing Wu, Li-jia Chen, Pu-liu Yan, Jian-guo Zhou, Hao Jiang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Probabilistic forwarding is one of the routing methods that neighbors are selected as the next hop according to probability. The probability calculation method is different for different forwarding methods. Our work is based on selective forwarding and the selective forwarding probability based on the node degree and link loss is presented to increase the reliability of selective forwarding. The effect of parameters on performance is reflected in the simulation results and the qualitative analysis is done based on regular square network. Trough the qualitative analysis, the calculation of forwarding probability is improved further.
A perceptual framework for the auditory display of scientific data
Authors: Stephen Barrass
Venue: ACM Transactions on Applied Perception (TAP) (2005)

A principal requirement of the auditory display of scientific data is an accurate portrayal of the information contained in the data. The characteristics of the display device can significantly affect the faithfulness of the data presentation. Human hearing is a complex nonlinear process and the intuitive comprehension of the display requires consideration of perceptual interactions and the natural connection between the data and the perception of the data. This chapter proposes a perceptual framework for observable and systematic specification and comprehension of sounds in a device-independent auditory display of scientific data. The framework consists of a perceptually scaled sound space and a display model that maps points from the perceptual space to a display device parameter space while preserving the interrelationships between them. The advantages of a perceptual space are described using the example of an established framework for applying perceptually uniform color models to scientific visualization. A perceptual sound space is defined and constructed by scaling a naturally ordered sound model derived from research studies in timbre perception. An auditory display is implemented on a Sun Sparc10 workstation using Csound and samples of musical instruments. The display model consists of an interpolated mapping from perceptual space to display space and a description of the display gamut that is the boundary in perceptual space between points that the display can realize and those that it cannot. The display gamut can be used to analyze the display, compare displays, and optimize data mapping sequences for the display. The concepts are illustrated by a graphic visualization of the gamut of the implemented display as a geometric shape in the perceptual sound space.
Tracking Cell Signals in Fluorescent Images
Authors: Victoria Gor, Michael Elowitz, Tigran Bacarian, Eric Mjolsness
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

In this paper we present the techniques for tracking cell signal in GFP (Green Fluorescent Protein) images of growing cell colonies. We use such tracking for both data extraction and dynamic modeling of intracellular processes. The techniques are based on optimization of energy functions, which simultaneously determines cell correspondences, while estimating the mapping functions. In addition to spatial mappings such as affine and Thin-Plate Spline mapping, the cell growth and cell division histories must be estimated as well. Different levels of joint optimization are discussed. The most unusual tracking feature addressed in this paper is the possibility of one-to-two correspondences caused by cell division. A novel extended softassign algorithm for solutions of one-to-many correspondences is detailed in this paper. The techniques are demonstrated on three sets of data: growing bacillus Subtillus and e-coli colonies and a developing plant shoot apical meristem. The techniques are currently used by biologists for data extraction and hypothesis formation.
Load Balancing Issues in Super-Peer-based Publish/Subscribe Digital Libraries
Authors: Ioannis T. Christou
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

We present a hyper-graph partitioning based approach to the problem of load-balancing in large-scale P2P-based digital libraries. In such libraries, in addition to publishing digital content, peer-clients may subscribe their intent to be notified whenever digital content matching appropriate meta-data keywords is published in the library (a.k.a. continuous queries or Selective Dissemination of Information), as well as perform more traditional point queries. The digital content, as well as the continuous queries, are partitioned among a number of blocks, and each super-peer server in the network is responsible for handling only one of these partitioned blocks. We present preliminary results showing that the hyper-graph partitioning approach scales well with the number of published documents or continuous queries, and with the size of the network. The results show that partitioning-based load balancing of the super-peers leads to significant improvements of the average response time for point or continuous queries, and much reduced storage requirements of the library metadata.
A GA-Based Timing-Driven Placement Technique
Authors: Masaya Yoshikawa, Hidekazu Terai
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Deep-Sub-Micron technology (DSM) of 0.18 micron and below enable the integration of logical circuits having more than 10 million gates. In such a DSM technology, timing constraint has become the dominant factor in the performance of VLSI. This paper discusses a novel timing driven placement technique through Genetic Algorithm. The proposed algorithm has a two-level hierarchical structure consisting of outline placement and detail placement. For selection control, new objective functions are introduced for improving interconnect delay, power consumption and chip area. Experimental result shows improvement of 5.8 % for interconnect delay, 0.1% for power consumption and 0.8% for chip area.
Annotating User-Viewed Objects for Wearable AR Systems
Authors: Ryuhei Tenmoku, Masayuki Kanbara, Naokazu Yokoya
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

By realizing augmented reality on wearable computers, it is possible to overlay annotations on the real world based on the user's current position and orientation. However, it is difficult for the user to understand links between annotations and real objects intuitively when the scene is complicated or many annotations are overlaid at the same time. This paper describes a view management method which emphasizes user-viewed real objects and their annotations using 3D models of the real scene. The proposed method high-lights the objects viewed by the user. In addition, when the viewed object is occluded by other real objects, the object is complemented by using an image, which is made from 3D models, on the overlaid image.
Unstructured, but Not Really
Authors: Charlene O'Hanlon
Venue: Queue (2005)

Mention the term semi-structured data and chances are you’ll be met with strong opinions from one of two camps: those who believe semi-structured data is nothing more than a fancy term for a data structure left unfinished, and others who firmly believe semi-structured data is the best way to describe data that doesn’t easily fit into the traditional database structure.
Probabilistically guided stereo vision for the navigation of mobile agents
Authors: Samuel P. Bromley
Venue:  (2005)

Reducing the computational and monetary costs associated with any given technology will always remain a worthwhile endeavour. To facilitate popular dissemination of depth-from-stereo computer vision, this thesis presents a probabilistically guided stereo vision algorithm that generates robust depth information at significant computational savings (relative to traditional approaches), while maintaining robustness for navigational tasks. A particle filter is used to preferentially guide computational focus to features in the scene that are deemed most navigationally relevant. The probability distribution maintained by the particles is used directly to select regions for computation. Peaks in the distribution represent the areas with the highest likelihood of navigational relevance, based on generic intuitive cues including proximity and velocity. The result is a fast, robust, small-footprint stereo vision algorithm suitable for navigation and requiring substantially less computer resources. It is believed that this reduced size can be readily and cheaply adopted not only for use in consumer products such as toys or hobby robotics, but also for uses in harsh environment robotic research, where the increased reliability of simpler processors is demanded. The probabilistically guided stereo algorithm is presented and evaluated herein in terms of accuracy, responsiveness to dynamic scenes, suitability for navigation, and computational efficiency. It is demonstrated that it remains robust to complex scenes and is well suited for a broad range of navigational tasks. Two applications of the algorithm are considered as proofs of concept: the autonomous navigation of a mobile robot platform; and within a navigation assistive device for blind and visually impaired persons. All results demonstrate tremendous potential for the probabilistically guided stereo algorithm within its domain of applicability. It provides a key for affordable, efficient, robust navigation of arbitrary scenes, using depth-from-stereo computer vision on commodity-class hardware, at video rates.
Strictly Nonblocking WDM Cross-connects
Authors: April Rasala, Gordon Wilfong
Venue: SIAM Journal on Computing (2005)

Using (WDM) technology, an optical network can route multiple signals simultaneously along a single optical fiber by encoding each signal on its own wavelength. If the network contains places where multiple fibers connect together and signals are allowed to be moved from any of the incoming fibers to any of the outgoing fibers, then the network is said to contain cross-connects. More precisely, a $k_1\,\times\,k_2$ WDM cross-connect has k1 input fibers and k2 output fibers. Each of the k1 input fibers supports the same n1 input wavelengths and each of the k2 output fibers supports the same n2 output wavelengths. Since a signal on input wavelength $\lambda$ can be routed from its input fiber to an output fiber such that it arrives on the output fiber using wavelength $\gamma$, where $\lambda \neq \gamma$, the cross-connect must be capable of performing wavelength conversion. Along any fiber in the cross-connect a device called a wavelength interchanger can be inserted to perform wavelength conversion. In other words if the path of a signal from an input fiber to an output fiber passes through a \wins, then the wavelength of the signal can be changed to any wavelength that is not already in use along the fiber leaving the wavelength interchanger. Given the high cost of \wisns, the overall cost of a \CC{k_1}{k_2} is minimized by reducing the number of \wis in the cross-connect. However, a desirable property for a cross-connect C is for C to always be able to provide a route (and wavelength conversion) for any valid demand from any pair of input and output fibers regardless of the routes of other demands currently routed in C. If C has this capability then it is said to be strictly nonblocking. For most of this paper we consider a demand to be a request for a connection from an input fiber to an output fiber such that the connection starts on a specified input wavelength and leaves the ç on a second specified wavelength. Using this demand model, we consider cross-connects for which $k_1$ is not necessarily equal to $k_2$ and the number $n_1$ of supported input wavelengths can differ from the number $n_2$ of supported output wavelengths. Without loss of generality we assume that $k_1 \leq k_2$ and present a family of \snob \CCns{k_1}{k_2}s that use \Opt \wisns. For the case when $k_1 = k_2=k$ and $n_1 = n_2$, we prove that this is optimal. For çs where $n_1$ is not necessarily equal to $n_2$, we show that if there is at most one wavelength interchanger on any path from an input fiber to an output fiber, \Opt \wis are optimal. Finally, we consider a more flexible demand model where $k_1 = k_2$ but the input and output wavelengths are not specified as part of the demand. We show that $2k-1$ \wis are still necessary for any \snob \CC{k}{k}.
RF CMOS Circuits for Ad-Hoc Networks and Wearable Computing
Authors: C. Siu, S. Kasnavi, K. Iniewski, F. Nabki
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

Wireless ad-hoc networks are gaining interest for medical, sensing, wearable computing and other applications. The industry is at a critical juncture now where the maturity of RF CMOS can enable these networks. All of these applications, if deployed successfully, will result in the proliferation of wireless devices like we have never seen before. The end result is that these devices will need to be very low cost, which fits in well with the CMOS paradigm. The challenge going forward is how to make CMOS RF circuits that consume ultra-low power in a compact form factor.
Rearrangeability of the Tandem Cascade of Banyan-type Networks
Authors: Xuesong Tan, Shuo-Yen Robert Li, Yuxiu Shen
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

The cascade of two 2^n × 2^n baseline networks in tandem and the cascade of two omega networks through a special interconnection pattern are known to be rearrangeable. These belong to the general problem: for what two banyan-type networks (i.e., bitpermuting unique-routing network) are their tandem cascade a rearrangeable network? We relate the problem to the trace and guide of banyan-type networks. When the guide of one 2^n × 2^n banyan-type network and the trace of the other are represented by the permutations y and t on integers 1 to n, respectively, rearrangeability of their tandem cascade is solely determined by yt^-1, which is said to be a tandem rearrangeable permutation when the tandem cascade is indeed rearrangeable. We identify a few tandem rearrangeable permutations, each implying the rearrangeability of the tandem cascade of a wide class of banyan-type networks.
A concurrent object coordination language: semantics and applications
Authors: Gordon Wayne O'Connell
Venue:  (2005)

The Timed Actor model is a concurrent coordination model which extends the basic Actor model of [1] by providing timers and facilities for atomic message processing with local checkpointing . The semantics of our Timed Actor model allows the specification of a timed actor language called COOL, and a virtual machine to accommodate our timed actor language. COOL is the basis of our approach for modelling and implementing distributed applications. COOL provides a high-level description language for specifying the interface, behaviour and coordination of actors. COOL allows a practitioner to specify the expected behaviour of actors by defining the performance and coordination properties of actors. These checkable properties are compilable into online monitors . At run-time monitored activity (observed behaviour) is logged in a format amenable to offline trace analysis. Our trace analyzer validates a COOL Specification by comparing observed to expected behaviour.
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
Authors: Raja Jothi, Balaji Raghavachari
Venue: ACM Transactions on Algorithms (TALG) (2005)

Given an undirected graph G = (V,E) with nonnegative costs on its edges, a root node r V, a set of demands D V with demand v D wishing to route w(v) units of flow (weight) to r, and a positive number k, the Capacitated Minimum Steiner Tree (CMStT) problem asks for a minimum Steiner tree, rooted at r, spanning the vertices in D * lcub;r rcub;, in which the sum of the vertex weights in every subtree connected to r is at most k. When D equals; V, this problem is known as the Capacitated Minimum Spanning Tree (CMST) problem. Both CMsT and CMST problems are NP-hard. In this article, we present approximation algorithms for these problems and several of their variants in network design. Our main results are the following: ---We present a (&sup3; &Aacute;ST + 2)-approximation algorithm for the CMStT problem, where &sup3; is the inverse Steiner ratio, and &Aacute;ST is the best achievable approximation ratio for the Steiner tree problem. Our ratio improves the current best ratio of 2&Aacute;ST + 2 for this problem. ---In particular, we obtain (&sup3; + 2)-approximation ratio for the CMST problem, which is an improvement over the current best ratio of 4 for this problem. For points in Euclidean and rectilinear planes, our result translates into ratios of 3.1548 and 3.5, respectively. ---For instances in the plane, under the Lp norm, with the vertices in D having uniform weights, we present a nontrivial (7/5&Aacute;ST + 3/2)-approximation algorithm for the CMStT problem. This translates into a ratio of 2.9 for the CMST problem with uniform vertex weights in the Lpmetric plane. Our ratio of 2.9 solves the long-standing open problem of obtaining any ratio better than 3 for this case. ---For the CMST problem, we show how to obtain a 2-approximation for graphs in metric spaces with unit vertex weights and k = 3,4. ---For the budgeted CMST problem, in which the weights of the subtrees connected to r could be up to &plusmn; k instead of k (&plusmn; e 1), we obtain a ratio of &sup3; plus; 2/&plusmn;.