ppxscal/embedding_network huggingface dataset:
One-to-all broadcasting scheme for arbitrary static interconnection networks with bursty background traffic: Research Articles
Authors: D. D. Kouvatsos, I. M. Mkwawa, I. Awan
Venue: Concurrency and Computation: Practice Experience (2004)

A novel one-to-all broadcasting scheme is proposed for arbitrary static interconnection networks with bursty background traffic having head-of-line priorities, complete buffer sharing and repetitive service blocking with random destination. The scheme facilitates inter-process communication amongst parallel computers and grid computing networks as well as asynchronous transfer mode space division architectures and it is applicable to a single-port mode of message passing communication. The scheme utilizes a queue-by-queue decomposition algorithm for arbitrary open queueing network models, based on the principle of maximum entropy, in conjunction with an information theoretic decomposition criterion and graph theoretic concepts. Evidence based on empirical studies indicates the suitability of the scheme for achieving an optimal one-to-all broadcasting cost. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Classification of Aorta Insufficiency and Stenosis Using Neuro-Fuzzy System
Authors: Necaattin Barzşçi, Ergün Topal, Fzrat Hardalaç, Īnan Güler
Venue: Journal of Medical Systems (2005)

Cardiac Doppler signals recorded from aorta valve of 60 patients were transferred to a personal computer by using a 16 bit sound card. The fast Fourier transform (FFT) method was applied to the recorded signal from each patient. Since FFT method inherently cannot offer a good spectral resolution at jet blood flows such as cardiac Doppler signals, it sometimes causes wrong interpretation. In order to do a good interpretation and rapid diagnosis, cardiac Doppler blood flow signals were statistically arranged and then classified using neuro-fuzzy system. The NEFCLASS model, which is used to create a fuzzy classification system from data, was used. The classification results show that neuro-fuzzy system offers best results in the case of diagnosis.
Combining stack caching with dynamic superinstructions
Authors: M. Anton Ertl, David Gregg
Venue: Proceedings of the 2004 workshop on Interpreters, virtual machines and emulators (2004)

Dynamic superinstructions eliminate most of the interpreter dispatch overhead. This results in a higher proportion of interpreter time spent in stack accesses (on a stack-based virtual machine). Stack caching reduces the stack access overhead. Each of these optimizations provides more speedup, if the other one is applied, too. Combining these optimizations also opens additional opportunities: we can insert stack state transitions without dispatch cost; this reduces the number of necessary VM instruction instances significantly. A shortest-path search can find the optimal sequence of state transitions and VM instructions. In this paper we describe an implementation of static stack caching employing these ideas. We also represent empirical results for our implementation, resulting in a speedup of up to 58% over a version that keeps one value in registers all the time.
Advances in Lee--Schetzen Method for Volterra Filter Identification
Authors: Simone Orcioni, Massimiliano Pirani, Claudio Turchetti
Venue: Multidimensional Systems and Signal Processing (2005)

This paper concerns the identification of nonlinear discrete causal systems that can be approximated with the Wiener--Volterra series. Some advances in the efficient use of Lee--Schetzen (L--S) method are presented, which make practical the estimate of long memory and high order models. Major problems in L--S method occur in the identification of diagonal kernel elements. Two approaches have been considered: approximation of gridded data, with interpolation or smoothing, and improved techniques for diagonal elements estimation. A comparison of diagonal elements estimated, with different methods has been shown with extended tests on fifth order Volterra systems.
Has VoIP Arrived?
Authors: Adam Stone
Venue: IEEE Internet Computing (2003)

In Sweden, apartment dwellers form associations to decide on major issues facing the community. Alan Duric's neighbors in his apartment block voted recently to start using broadband telephony instead of standard telephony. Many residents already have changed their first or second lines to the Voice over IP (VoIP) systems.
Standards Factor: GOOD NEWS FOR DRAFT SEEKERS
Authors: Pat Billingsley
Venue: ACM SIGCHI Bulletin (1992)

During the last two years, many Bulletin readers have asked me how they can obtain copies of the draft ISO (International Organization for Standardization) and IEC (International Electrotechnical Committee) standards I've mentioned in this column. I've been able to tell them that ANSI (the American National Standards Institute) sells copies of ISO and IEC standards that have been reached the Draft International Standard (DIS) or International Standard (IS) level of approval. But I've always added that drafts in the earlier stages of development, including Working Drafts (WDs) and Committee Drafts (CDs), are typically distributed only to the people or organizations that officially review them. I have one copy of most of the drafts I discuss but, as an independent consultant, I don't have the resources to produce and distribute additional copies. 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
Improving End-to-End Performance by Active Queue Management
Authors: Chin-Fu Ku, Sao-Jie Chen, Jan-Ming Ho, Ray-I Chang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Active queue management (AQM) schemes have motivated many researchers to investigate more effective methods to control network congestion. Most AQM schemes are evaluated by their designers on the basis of router-centric metrics, such as queuing delay, link utilization and packet drop ratio. These metrics are important to network operators but they may not reflect the quality of service delivered to end-users. In this paper we propose a method aimed to provide users with better services in terms of end-to-end delay and packet loss ratio. The method captures a significant traffic increase at an early stage and signals TCP sources to slow down. In this way, TCP can quickly adjust the transmission rate, and thereby prevent overloading the network. In addition to RED, another two prominent AQM schemes, namely, random early marking (REM) and Adaptive RED (ARED), are compared with the proposed method. Simulation results show that under various network loads and a range of network propagation delays, our method can achieve lower end-to-end delay and packet loss ratio, compared with all aforementioned schemes.
The d-deap: a fast and simple cache-aligned d-ary deap
Authors: Haejae Jung
Venue: Information Processing Letters (2005)

This paper presents a generalized and cache-aligned implicit version of the deap, called d-deap* that utilizes cache memory efficiently. The d-deap* is based on a tree structure that may be mapped into a cache-aligned array without padding. This results in a match between node indexes and array indexes as well as good cache utilization. Experimental results show that the d-deap* clearly outperforms the symmetric min-max heap and deap structures proposed earlier for double-ended priority queues.
Conversation protocols: a formalism for specification and verification of reactive electronic services
Authors: Xiang Fu, Tevfik Bultan, Jianwen Su
Venue: Theoretical Computer Science (2004)

This paper focuses on the realizability problem of a framework for modeling and specifying the global behaviors of reactive electronic services (e-services). In this framework, Web accessible programs (peers) communicate by asynchronous message passing, and a virtual global watcher silently listens to the network. The global behavior is characterized by a "conversation", which is the infinite sequence of messages observed by the watcher. We show that given a Büchi automaton specifying the desired set of conversations, called a "conversation protocol", it is possible to realize the protocol using a set of finite state peers if three realizability conditions are satisfied. In particular, the synthesized peers will conform to the protocol by generating only those conversations specified by the protocol. Our results enable a top-down verification strategy where (1) A conversation protocol is specified by a realizable Büchi automaton, (2) The properties of the protocol are verified on the Büchi automaton specification, and (3) The peer implementations are synthesized from the protocol via projection.
Stochastic Differential Games in a Non-Markovian Setting
Authors: Erhan Bayraktar, H. Vincent Poor
Venue: SIAM Journal on Control and Optimization (2005)

Stochastic differential games are considered in a non-Markovian setting. Typically, in stochastic differential games the modulating process of the diffusion equation describing the state flow is taken to be Markovian. Then Nash equilibria or other types of solutions such as Pareto equilibria are constructed using Hamilton--Jacobi--Bellman (HJB) equations. But in a non-Markovian setting the HJB method is not applicable. To examine the non-Markovian case, this paper considers the situation in which the modulating process is a fractional Brownian motion. Fractional noise calculus is used for such models to find the Nash equilibria explicitly. Although fractional Brownian motion is taken as the modulating process because of its versatility in modeling in the fields of finance and networks, the approach in this paper has the merit of being applicable to more general Gaussian stochastic differential games with only slight conceptual modifications. This work has applications in finance to stock price modeling which incorporates the effect of institutional investors, and to stochastic differential portfolio games in markets in which the stock prices follow diffusions modulated with fractional Brownian motion.
An Efficient Dynamic Power Management Policy on Sensor Network
Authors: Ren C. Luo, Liang Chao Tu, Ogst Chen
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

We design a "two-layered" dynamic power management strategy in our sensor node to reduce the power consumption. There are many factors such as the probability of event generation, the battery status, the coverage problem, and the communication situations in our consideration. In network communication, we propose an asynchronous awakening scheme so that each node is free to power on or off its components based on the observed event statistics, and make a trade-off between communication and power consumption. The deepest sleep state period is determined by taking account of the residual power. Combining with these methods, the lifetime of the sensor node can be extended as longer as possible without influencing the system performance.
Description of the LINK system used for MUC-4
Authors: Steven L. Lytinen, Sayan Bhattacharyya, Robert R. Burridge, Peter M. Hastings, Christian Huyck, Karen A. Lipinsky, Eric S. McDaniel, Karenann K. Terrell
Venue: Proceedings of the 4th conference on Message understanding (1992)

The University of Michigan's natural language processing system, called LINK, is a unification-based system which we have developed over the last four years. Prior to MUC-4, LINK had been used to extract information from free-form texts in two narrow application domains. One application corpus contained terse descriptions of symptoms displayed by malfunctioning automobiles, and the repairs which fixed them. The other corpus described sequences of activities to be performed on an assembly line. In empirical testing in these two domains, LINK correctly processed 70% of previously unseen descriptions. A template was counted as correct only if all of the fillers in the template were filled correctly. In addition, LINK generated incomplete (but not incorrect) templates for another 15% of the descriptions.
Performance of CDMA/PRMA as an Access Technique for Integrated Services in a UMTS High Altitude Platform System
Authors: N. Batsios, F. -N. Pavlidou
Venue: Wireless Personal Communications: An International Journal (2005)

High Altitude Platforms (HAPs) have gained a great interest in recent years. HAP systems will be global in nature but national in service provision. They will deliver IMT-2000 mobile and fixed wireless access using the proposed IMT-2000 terrestrial component radio transmission technologies and protocols. Under the above consideration, in this paper the performance of a MAC protocol based on the combination of the well-known Packet Reservation Multiple Access (PRMA) scheme with Code Division Multiple Access (CDMA) technologies in a Frequency Division Duplex (FDD) mode is studied, for a HAP operating at the 2 GHz frequency band at an altitude of 22 km. The impact of acknowledgement delay has been examined through computer simulations, along with the selection of suitable channel access functions (CAFs) to control the access of mobile users. Moreover the protocol performance is investigated in a cellular HAP environment and compared to that of a ground-based system. Finally, different traffic scenarios have been considered in order to investigate the access delay for non-real time traffic and the packet dropping performance for real time traffic.
Real-Time Soft-Finger Grasping of Physically Based Quasi-rigid Objects
Authors: Maurizio de Pascale, Gabriele Sarcuni, Domenico Prattichizzo
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper describes the implementation of a demo that will be shown at the conference site. The demo of"soft-finger grasping of physically based quasi-rigid objects" will provide solutions to grasp objects that are locally deformable and move according to rigid-body dynamics. This work summarizes the choices of the overall software architecture and the single algorithms used to run the simulation of "soft-finger grasping" in real time on high-end hardware. The soft-finger grasping is obtained extending a local model to include rotational friction while the local deformations are achieved through displacement fields directly on the GPU. Dynamics of the objects in the scene is simulated by a rigid body simulator which allows realistic interactions with other objects existing in the scene.
Vision Based Adaptive Traffic Signal Control System Development
Authors: Lawrence Y. Deng, Nick C. Tang, Dong-liang Lee, Chin Thin Wang, Ming Chih Lu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

The adaptive urban traffic signal control (TSC) system became a development trend of intelligent transportation system (ITS). We investigated the vision based surveillance and to keep sight of the unpredictable and hardly measurable disturbances may perturb the traffic flow. We integrated and performed the vision based methodologies that include the object segmentation, classify and tracking methodologies to know well the real time measurements in urban road. According to the real time traffic measurement, we derived the adaptive traffic signal control algorithm to settle the red-green switchings of traffic lights both in "go straight or turn right" and "turn left" situations". By comparing the experimental result obtained by original traffic signal control system which improves the traffic queuing situation, we confirm the efficiency of our vision based adaptive TSC approach.
Lattice Boltzmann open boundaries for hydrodynamic models
Authors: A. F. Bennett, J. R. Taylor, B. S. Chua
Venue: Journal of Computational Physics (2005)

The mixed initial-boundary value problem for the equations of nonhydrostatic fluid dynamics is mathematically well posed, but is physically and computationally ill posed. The ill-posedness is exacerbated by boundary data taken from integrations of hydrostatic flow equations. The difficulty is found both in fully compressible flow and in Boussinesq flow; the latter is emphasized here. The mixed problem for the Boltzmann equation is well posed in every respect. Inserting lattice Boltzmann kinetics between hydrostatic boundary data and nonhydrostatic dynamics resolves the physical and computational ill-posedness of the dynamics, by relaxing the boundary data to nonhydrostatic dynamical consistency. Simple numerical experiments with boundary data taken from exact and approximate analytical solutions demonstrate the effectiveness of the approach.
Teaching user interface prototyping
Authors: Charles E. Frank, David Naugler, Michael Traina
Venue: Journal of Computing Sciences in Colleges (2005)

User interface prototyping is a proven technique for evaluating design alternatives and for obtaining user feedback. It is heavily employed by software development organizations. However, it is often ignored in computer science education. This paper discusses how interface prototypes are used in industry and what research has shown concerning the effectiveness of such prototyping. It evaluates tools that can used to construct such prototypes and describes how prototyping can be taught in the computer science curriculum. We describe our experiences in teaching students to build interface prototypes and give recommendations based on these experiences.
Introduction to reversible computing: motivation, progress, and challenges
Authors: Michael P. Frank
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Reversible computing is motivated by the von Neumann-Landauer (VNL) principle, a theorem of modern physics telling us that ordinary irreversible logic operations (which destructively overwrite previous outputs) incur a fundamental minimum energy cost. Such operations typically dissipate roughly the logic signal energy, itself irreducible due to thermal noise. This fact threatens to end improvements in practical computer performance within the next few decades. However, computers based mainly on reversible logic operations can reuse a fraction of the signal energy that theoretically can approach arbitrarily near to 100% as the quality of the hardware is improved, reopening the door to arbitrarily high computer performance at a given level of power dissipation. In the 32 years since the theoretical possibility of this approach was first shown by Bennett, our understanding of how to design and engineer practical machines based on reversible logic has improved dramatically, but a number of significant research challenges remain, e.g., (1) the development of fast and cheap switching devices with adiabatic energy coefficients well below those of transistors, (2) and of clocking systems that are themselves of very high reversible quality; and (3) the design of highly-optimized reversible logic circuits and algorithms. Finally, the field faces an uphill social battle in overcoming the enormous inertia of the established semiconductor industry, with its extreme resistance to revolutionary change. A more evolutionary strategy that aims to introduce reversible computing concepts only very gradually might well turn out to be more successful. This talk explains these basic issues, to set the stage for the rest of the workshop, which aims to address them in more detail
Internet policy and diffusion in China, Malaysia and Singapore
Authors: Susan Xue
Venue: Journal of Information Science (2005)

The Internet has had a revolutionary impact on culture, communication and economic development around the world. In their efforts of using this powerful technology as a means for leapfrogging and bridging the gaps with developed nations, developing countries face challenges of poor telecommunications infrastructure and difficulties in utilizing the Internet's full potential and managing its information flow. By studying and comparing China, Malaysia and Singapore's practices, this article attempts to examine how a national Internet policy can address these challenges and realize the benefits the Internet offers, and to explore what lessons developing countries can draw from a comparative approach to policy analysis.
Guest Editors' Introduction: Internet Access to Scientific Data
Authors: David Korsemeyer, Craig W. Thompson
Venue: IEEE Internet Computing (2005)

The experimental and experiential nature of many sciences requires that researchers capture huge volumes of data for which they propose theories to explain or model the data. Simulations, queries, and data mining can generate very large derived data sets. The Internet and associated technologies (such as the Web and the Grid) have become the de facto medium for sharing raw data, analyzed information, and derived knowledge for many technical and scientific communities. Considerable research and commercial activity has focused on this area, but many unresolved issues remain. The articles in this theme section illustrate some of the work that is currently being done to help address some key challenges.
Polynomial time quantum algorithm for the computation of the unit group of a number field
Authors: Arthur Schmidt, Ulrich Vollmer
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute the unit group of finite extensions of Q. Execution time for fixed field degree over Q is polynomial in the discriminant of the field. Our algorithms generalize and improve upon Hallgren's work [9] for the one-dimensional case corresponding to real-quadratic fields.
Distributed power management protocols for multi-hop mobile ad hoc networks
Authors: Shih-Lin Wu, Pao-Chu Tseng, Zi-Tsan Chou
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2005)

The power management scheme in IEEE 802.11 protocol has three severe challenges: beacon contention, timing synchronization, and reliable neighbor maintenance. These challenges are more serious in large and dense multihop mobile ad hoc networks (MANETs). To overcome these challenges and improve the energy efficiency as well as network throughput, we propose three new power management protocols. Especially, our solutions offer the network designers full flexibility in trading energy, latency, and neighbor maintenance's accuracy versus each other by appropriately tuning system parameters. Analyses and simulations show that the proposed protocols attain both the better energy efficiency and throughput than existing protocols.
A Hybrid Analysis of an Optimization Approach for Cluster Applications
Authors: Ming Zhu, Wentong Cai, Bu-Sung Lee, Xudong Wu
Venue: The Journal of Supercomputing (2005)

Cluster/distributed computing has become a popular, cost-effective alternative to high-performance parallel computers. Many parallel programming languages and related programming models have become widely accepted on clusters. However, the high communication overhead is a major shortcoming of running parallel applications on cluster/distributed computing environments. To reduce the communication overhead and thus the completion time of a parallel application, this paper introduces and evaluates an efficient Key Message (KM) approach to support parallel computing on cluster computing environments. In this paper, we briefly present the model and algorithm, and then analytical and simulation methods are adopted to evaluate the performance of the algorithm. It demonstrates that when network background load increases or the computation to communication ratio decreases, the analysis results show better improvement on communication of a parallel application over the system which does not use the KM approach.