ppxscal/embedding_network huggingface dataset:
Network architecture and medium access control for deploying third generation (3G) wireless systems over CATV networks: Research Articles
Authors: Anwar A. Elfeitori, Hussein Alnuweiri
Venue: Wireless Communications Mobile Computing (2005)

We propose a novel and cost-effective approach for the deployment of third generation (3G) wireless systems over hybrid fiber coaxial (HFC) CATV networks. The main goal is to facilitate 3G deployment over the existing CATV plant and reduce the large cost required for building a dedicated last mile infrastructure for 3G access networks. Our proposal reduces the last mile cost by sharing the existing CATV network and using the standard equipment and protocols of data-over-cable systems interface specifications (DOCSIS). This allows rapid deployment of 3G wireless systems, facilitates convergence of wireless and wireline networks and paves the way towards all IP wireless networks. Enhancements to the DOCSIS medium access control (MAC) protocol must be implemented in order to support Quality of Service (QoS) guarantees for 3G data and signaling traffic. This paper presents the proposed 3G over CATV network architecture and DOCSIS medium access control (MAC) enhancements for enabling the support of QoS guarantees for 3G data and signaling traffic. The proposed MAC enhancements can reduce the access delay for delay-sensitive traffic by 30 to 40&percnt; over existing DOCSIS MAC without compromising QoS guarantees for other traffic classes, or the DOCSIS channel utilization. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The challenges of wireless and mobile technologies: the RFID encourages the mobile phone development
Authors: Taro Hori, Mitsuji Matsumoto
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

The progress of ICT has brought us numerous benefits, and the concept of ICT has continuously been extended from "network" to "global network," then to "ubiquitous network." The infrastructure of broadband environment such as ADSL or FTTH in Japan has been effectively developed. Likewise, mobile phones have become extremely popular and widely used. Ninety percent of all the mobile phones in Japan are browser phones, and they are contributing to forming a high-mobility society. In this paper, we would like to present possibilities of mobile terminals, especially mobile phones utilizing the RFID (Radio Frequency Identification) technology. The RFID technology has increased the capacities in memory, widened reading ranges, and accelerated processing speeds. Based on the premise of the RFID technology, we would like to discuss the challenges in operating wireless devices from the customers' perspectives.
A Statistical Field Model for Pedestrian Detection
Authors: Ying Wu, Ting Yu, Gang Hua
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper presents a new statistical model for detecting and tracking deformable objects such as pedestrians, where large shape variations induced by local shape deformation can not be well captured by global methods such as PCA. The proposed model employs a Boltzmann distribution to capture the prior of local deformation, and embeds it into a Markov network which can be learned from data. A mean field variational analysis of this model provides computationally efficient algorithms for computing the likelihood of image observations and facilitate fast model training. Based on that, effective detection and tracking algorithms for deformable objects are proposed and applied to pedestrian detection and tracking. The proposed method has several advantages. Firstly, it captures local deformation well and thus is robust to occlusions and clutter. In addition, it is computationally tractable. Moreover, it divides deformation into local deformation and global deformation, then conquers them by combining bottom-up and top-down methodologies. Extensive experiments demonstrate the effectiveness of the proposed model for deformable objects.
Interacting with trust in ambient intelligence
Authors: Jean-Marc Seigneur
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

This short paper presents the use of computational trust engines in ambient intelligent environments. Beyond the technical challenge of building trust-based security frameworks, our initial investigations and prototypes have shown that the human interfaces of these frameworks are also challenging and need to be studied.
Deterministic wavelet thresholding for maximum-error metrics
Authors: Minos Garofalakis, Amit Kumar
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Several studies have demonstrated the effectiveness of the wavelet, decomposition as a tool for reducing large amounts of data down to compact, wavelet synopses that can be used to obtain fast, accurate approximate answers to user queries. While conventional wavelet synopses are based on greedily minimizing the overall root-mean-squared (i.e., L2-norm) error in the data approximation, recent work has demonstrated that such synopses can suffer from important problems, including severe bias and wide variance in the quality of the data reconstruction, and lack of non-trivial guarantees for individual approximate answers. As a result, probabilistic thresholding schemes have been recently proposed as a means of building wavelet synopses that try to probabilistically control other approximation-error metrics, such as the maximum relative error in data-value reconstruction, which is arguably the most important for approximate query answers and meaningful error guarantees.One of the main open problems posed by this earlier work is whether it is possible to design efficient deterministic wavelet-thresholding algorithms for minimizing non-L2 error metrics that are relevant to approximate query processing systems, such as maximum relative or maximum absolute error. Obviously, such algorithms can guarantee better wavelet synopses and avoid the pitfalls of probabilistic techniques (e.g., "bad" coin-flip sequences) leading to poor solutions. In this paper, we address this problem and propose novel, computationally efficient schemes for deterministic wavelet thresholding with the objective of optimizing maximum-error metrics. We introduce an optimal low polynomial-time algorithm for one-dimensional wavelet thresholding--our algorithm is based on a new Dynamic-Programming (DP) formulation, and can be employed to minimize the maximum relative or absolute error in the data reconstruction. Unfortunately, directly extending our one-dimensional DP algorithm to multi-dimensional wavelets results in a super-exponential increase in time complexity with the data dimensionality. Thus, we also introduce novel, polynomial-time approximation schemes (with tunable approximation guarantees for the target maximum-error metric) for deterministic wavelet thresholding in multiple dimensions.
Replica placement in a pervasive environment
Authors: Julien Gossa, Jean-Marc Pierson, Lionel Brunie
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

This short paper proposes a replica placement and selection method adapted to pervasive environment. The described solution, based on Small Worlds and the k-server algorithm, is dynamic and flexible according to the mobility and unpredictability of users and networks.
Adapting Web Pages for Small-Screen Devices
Authors: Yu Chen, Xing Xie, Wei-Ying Ma, Hong-Jiang Zhang
Venue: IEEE Internet Computing (2005)

Most of the Web pages in existence today were designed for desktop PCs, which makes viewing them on mobile Web browsers extremely difficult. The authors developed new page-adaptation technique analyzes a Web page's structure and splits it into smaller, logically related units that can fit onto a mobile device's screen. The Web page can then be adapted to form a two-level hierarchy with a thumbnail representation at the top level for providing a global view and an index to a set of subpages at the bottom level for detailed information.
Optimal Mapping of a Parallel Application Processes onto Heterogeneous Platform
Authors: Alexey Kalinov, Sergey Klimov
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02 (2005)

The paper is devoted to analysis of a strategy of computation distribution on heterogeneous parallel systems. According to this strategy processes of parallel program are distributed over the processors according to their performances and data are distributed between processes evenly. The paper presents an algorithm that computes optimal number of the processes and their distribution over processors minimizing the execution time of an application. The processor performance is considered as a function of the number of processes running on the processor and the amount of the data processing by the processor.
Book reivew: Lisp Lore: A Guide to Programming the Lisp Machine by: Hank Bromley Kluwer (Academic Publishers)
Venue: Issue 100 (April 1987) (1987)

Having recently (over the past two years) become a user of a Lisp machine I had faced the task of becoming proficient on the machine without much outside help. The massive set of hard copy documentation has most of the answers, somewhere, but finding them without knowing the answer can be difficult. Worse, not knowing that easy methods exist for many operations, you never even look for them. The introductory material gets you started, byt the advanced techniques remain hidden in the manuals. This book started as a set of notes for an informal course given by the author at AT amp;T Bell Labs and grew into an interesting introduction to the Lisp Machine for someone who already knows Lisp fairly well. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Playing mastermind logically
Authors: Ehud Shapiro
Venue: Issue 85 (July 1983) (1983)

I was intriqued by Mahadeva Rao's paper in SIGART #82 on an algorithm for playing mastermind, and its Pascal implementation. In this note I suggest a simpler algorithm for playing mastermind, and describe a miniature Prolog implementation of it.
An autonomous tracked vehicle with omnidirectional sensing
Authors: R. David Hampton, David Nash, David Barlow, Robert Powell, Blace Albert, Stephen Young
Venue: Journal of Robotic Systems (2004)

Operation of an autonomous vehicle along a marked path, in an obstacle-laden environment, requires path detection, relative position detection and control, and obstacle detection and avoidance. The design solution of the team from the U.S. Military Academy is a tracked vehicle operating open-loop in response to position information from an omnidirectional mirror, and to obstacle-detection input from the mirror and from a scanning laser. The use of a tracked rather than a wheeled vehicle is the team's open-loop solution to the problem of wheeled-vehicle slippage on wet and sandy surfaces. The vehicleresponds to sensor information from (1) a digital camera-mounted parabolic omnidirectional mirror for visual inputs and (2) a scanning laser for detecting obstacles in relief. Raw sensor data is converted synchronously into a global virtual context, which places the vehicle's center at the origin of a 2-D Cartesian coordinate system. A four-phase process is used to convert the camera's inputs into the data structures needed to reason about the vehicle's position relative to the course. Development of the path plan proceeds incrementally, using a space-sweeping algorithm to identify safe paths along waypoints within the course boundaries. An attempt is made to minimize translation errors by favoring paths which exhibit fewer sharp turns. Integration of Intel's OpenCV computer vision library and the Independent JPEG Group's JPEG library allow for very good encapsulation of the low-level functions needed to do most of the image processing. Ada95 is the language of choice for the majority of the team-developed software, except where needed to interface to motors and sensors. Use of an object-oriented high-level language has been invaluable in leveraging the efforts of previous years' development activities, and for maximizing the ability to log or otherwise respond to anomalous behavior. &copy; 2004 Wiley Periodicals, Inc.
USC: MUC-4 test results and analysis
Authors: D. Moldovan, S. Cha, M. Chung, K. Hendrickson, J. Kim, S. Kowalski
Venue: Proceedings of the 4th conference on Message understanding (1992)

The University of Southern California is participating, for the first time, in the message understanding conferences. A team consisting of one faculty and five doctoral students started the work for MUC-4 in January 1992. This work is an extension of a project to build a massively parallel computer for natural language processing called Semantic Network Array Processor (SNAP).
Priority Auctions and Queue Disciplines That Depend on Processing Time
Authors: Thomas Kittsteiner, Benny Moldovanu
Venue: Management Science (2005)

We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a queue whose length is unobservable. We consider two bidding schemes that differ in the definition of bids (these may reflect either total payments or payments per unit of time) and in the timing of payments (before or after service). In both schemes, a customer obtains priority over all customers, waiting in the queue or arriving while he is waiting, who make lower bids. Our main results show how the convexity/concavity of the function expressing the costs of delay determines the queue discipline (i.e., shortest-processing-time-first (SPT), longest-processing-time-first (LPT)) arising in a bidding equilibrium.
T&uuml;SBL: a similarity-based chunk parser for robust syntactic processing
Authors: Sandra Kübler, Erhard W. Hinrichs
Venue: Proceedings of the first international conference on Human language technology research (2001)

Chunk parsing has focused on the recognition of partial constituent structures at the level of individual chunks. Little attention has been paid to the question of how such partial analyses can be combined into larger structures for complete utterances.The T&uuml;SBL parser extends current chunk parsing techniques by a tree-construction component that extends partial chunk parses to complete tree structures including recursive phrase structure as well as function-argument structure. T&uuml;SBL's tree construction algorithm relies on techniques from memory-based learning that allow similarity-based classification of a given input structure relative to a pre-stored set of tree instances from a fully annotated treebank.A quantitative evaluation of T&uuml;SBL has been conducted using a semi-automatically constructed treebank of German that consists of appr. 67,000 fully annotated sentences. The basic PARSEVAL measures were used although they were developed for parsers that have as their main goal a complete analysis that spans the entire input. This runs counter to the basic philosophy underlying T&uuml;SBL, which has as its main goal robustness of partially analyzed structures.
Methodology work is ontology work
Authors: Brian Marick
Venue: ACM SIGPLAN Notices (2004)

I argue that a successful switch from one methodology to another requires a switch from one ontology to another. Large-scale adoption of a new methodology means "infecting" people with new ideas about what sorts of things there are in the (software development) world and how those things hang together. The paper ends with some suggestions to methodology creators about how to design methodologies that encourage the needed "gestalt switch".
First direct implementation of a true random source on programmable hardware: Research Articles
Authors: S. Callegari, R. Rovatti, G. Setti
Venue: International Journal of Circuit Theory and Applications (2005)

True random sources are not implementable in digital hardware, so that many practical applications have historically relied on pseudo-random generators in order to avoid the potentially long prototyping times and the costs of dedicated analog design. However, pseudo-random sources have liabilities that make them hardly suitable for some tasks (notably security related ones). Previous attempts to conciliate security, cost-effectiveness, and rapid development included the exploitation of the analog accessory parts often present on programmable devices. In these designs some analog blocks are used for their side effects (noise amplification) rather than for their originally intended behaviour. Conversely, here we report a direct implementation of a true random source on programmable, low-cost, general-purpose hardware, where all blocks are used only for their nominal function. To the best of the authors' knowledge, this is the first proposal of this sort. The design exploits an FPAA, and is based on a non-linear system exhibiting chaotic behaviour. Measures confirm the correct operation, high throughput, and robustness of the system. Copyright &copy; 2005 John Wiley & Sons, Ltd.
A novel min-process checkpointing scheme for mobile computing systems
Authors: Guo-Hui Li, Hong-Ya Wang
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

In distributed computing systems, processes in different hosts take checkpoints to survive failures. For mobile computing systems, due to certain new characteristics such as mobility, low bandwidth, disconnection, low power consumption and limited memory, conventional distributed checkpointing schemes need to be reconsidered. In this paper, a novel min-process coordinated checkpointing algorithm that makes full use of the computation ability and power of mobile support stations is proposed. During normal computation message transmission, the checkpoint dependency information among mobile hosts is recorded in the corresponding mobile support stations. When a checkpointing procedure begins, the initiator concurrently informs relevant mobile hosts, which minimizes the identifying time. Moreover, compared with the existing coordinated checkpointing schemes, our algorithm blocks the minimum number of mobile support stations during the identifying procedure, which leads to the improvement of the system performance. In addition, the proposed algorithm is a min-process, domino-free checkpointing algorithm, which is especially desirable for mobile computing systems. Quantitative analysis and experimental simulation show that our algorithm outperforms other coordinated checkpointing schemes in terms of the identifying time and the number of blocked mobile support stations and then can provide a better system performance for mobile computing systems.
Event-Based Haptics and Acceleration Matching: Portraying and Assessing the Realism of Contact
Authors: Katherine J. Kuchenbecker, Jonathan Fiene, Gunter Niemeyer
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Contact in a typical haptic environment resembles the experience of tapping on soft foam, rather than on a hard object. Event-based, high-frequency transient forces must be superimposed with traditional proportional feedback to provide realistic haptic cues at impact. We have developed a new method for matching the accelerations experienced during real contact, inverting a dynamic model of the device to compute appropriate force feedback transients. We evaluated this haptic rendering paradigm by conducting a study in which users blindly rated the realism of tapping on a variety of virtually rendered surfaces as well as on three real objects. Event-based feedback significantly increased the realism of the virtual surfaces, and the acceleration matching strategy was rated similarly to a sample of real wood on a foam substrate. This work provides a new avenue for achieving realism of contact in haptic interactions.
The communication infrastructure of the MAPNET mobile-agent platform
Authors: Dilyana Staneva, Petya Gacheva
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper describes the communication infrastructure of the MAPNET platform: our .NET-based implementation of the general mobile agent-based model for organizing distributed computations. The paper highlights key design decisions. It discusses the functions of the MAPNET communication service and their current implementation, focusing on its security mechanisms based on cryptographic keys. Directions for future work are outlined.
Adaptive license plate image extraction
Authors: Vladimir Shapiro, Dimo Dimov, Stefan Bonchev, Veselin Velichkov, Georgi Gluhchev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper represents the automatic plate localization component of a Car License Plate Recognition system. The approach concerns stages of preprocessing, edge detection, filtering, detection of the plate's position, slope evaluation, and character segmentation and recognition. Single frame gray-level images are used as the only source of information. In the experiments Israeli and Bulgarian license plates were used, camera obtained at different daytime and whether conditions. The results derived have shown that the approach is robust to illumination, plate slope, scale, and is insensitive to plate's country peculiarities. These results could be also usable for other applications in the input-output transport systems, where automatic recognition of registration plates, shields, signs, etc., is often necessary.
High-Availability Algorithms for Distributed Stream Processing
Authors: Jeong-Hyon Hwang, Magdalena Balazinska, Alexander Rasin, Ugur Cetintemel, Michael Stonebraker, Stan Zdonik
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Stream-processing systems are designed to support an emerging class of applications that require sophisticated and timely processing of high-volume data streams, often originating in distributed environments. Unlike traditional data-processing applications that require precise recovery for correctness, many stream-processing applications can tolerate and benefit from weaker recovery guarantees. In this paper, we study various recovery guarantees and pertinent recovery techniques that can meet the correctness and performance requirements of stream-processing applications. We discuss the design and algorithmic challenges associated with the proposed recovery techniques and describe how each can provide different guarantees with proper combinations of redundant processing, checkpointing, and remote logging. Using analysis and simulations, we quantify the cost of our recovery guarantees and examine the performance and applicability of the recovery techniques. We also analyze how the knowledge of query network properties can help decrease the cost of high availability.