ppxscal/embedding_network huggingface dataset:
Access network delay in networked games
Authors: Tom Jehaes, Danny De Vleeschauwer, Toon Coppens, Bart Van Doorselaer, Eva Deckers, W. Naudts, K. Spruyt, R. Smets
Venue: Proceedings of the 2nd workshop on Network and system support for games (2003)

The end-to-end delay (also referred to as latency) experienced by gaming users has a significant impact on the quality of online games. In this paper we concentrate on the delay introduced in access networks. This access network delay depends on the access technology used, the network load, the link rate configured on the access links (also referred to as the last mile link) and the size of the packets generated by the games. We characterize this access network delay by means of measurements. First, we focus on this delay in actually deployed access networks: dial-up, cable and Asymmetric Digital Subscriber Line (ADSL) access. In these access networks the access network delay shoots up as soon as the gaming user (or somebody else on the user's home network) saturates the user's last mile link with traffic generated by applications (e.g. web browser) other than the games. Therefore, we also characterize the access network delay in a laboratory set-up of a QoS-enabled ADSL network. In this set-up we show that it is possible to (logically) segregate the game traffic from the other traffic to such an extent that the game packets are not excessively delayed while at the same time a large part of the link capacity can be consumed by the other traffic.
CMOS VLSI Implementation of a Low-Power Logarithmic Converter
Authors: Khalid H. Abed, Raymond E. Siferd
Venue: IEEE Transactions on Computers (2003)

This paper presents a unique 32-bit binary-to-binary logarithm converter including its CMOS VLSI implementation. The converter is implemented using combinational logic only and it calculates a logarithm approximation in a single clock cycle. Unlike other complex logarithm correcting algorithms, three unique algorithms are developed and implemented with low-power and fast circuits that reduce the maximum percent errors that result from binary-to-binary logarithm conversion to 0.9299 percent, 0.4314 percent, and 0.1538 percent. Fast 4, 16, and 32-bit leading-one detector circuits are designed to obtain the leading-one position of an input binary word. A 32-word x 5-bit MOS ROM is used to provide 5-bit integers based on the corresponding leading-one position. Both converter area and speed have been considered in the design approach, resulting in the use of a very efficient 32-bit logarithmic shifter in the 32--bit logarithmic converter. The converter is implemented using 0.6\mu{\rm m} CMOS technology, and it requires 1,600\lambda\times 2,800\lambda of chip area. Simulations of the CMOS design for the 32-bit logarithmic converter, operating at {\rm V_{DD}} equal to 5 volts, run at 55 MHz, and the converter consumes 20 milliwatts.
Reconstructing discontinuous surfaces from a given gradient field using partial integrability
Authors: Bilge Karaçali, Wesley Snyder
Venue: Computer Vision and Image Understanding (2003)

This paper describes an adaptive surface reconstruction method from a given gradient field that allows discontinuities in the solution. We first formalize a vector space projection technique to reconstruct a surface with a uniformly integrable gradient field that corresponds to the minimum norm solution in the gradient space over discrete imaging settings. Next, we generalize this technique to reconstruct minimum norm solution surfaces with partially integrable gradient fields, where partial integrability is characterized adaptively from the given gradient field using multi-scale gradient space expansions. The simulations on synthesized and real data using block processing techniques indicate that the proposed method provides fast and reliable surface reconstruction through accurate characterization of embedded partial integrability in a given gradient field.
On the classification of dipaths in geometric models for concurrency
Authors: Martin Raussen
Venue: Mathematical Structures in Computer Science (2000)

This paper focusses on the determination of the dihomotopy classes of dipaths in cubical complexes, representing the essentially different computations in a given concurrent program due to different schedules. Several new notions have to be developed, for example, the domains of dependence (Definition 2.4), which are borrowed from relativity theory (Penrose 1972). However, it turns out that the algorithm determining deadlocks and unsafe regions described in Fajstrup et al. (1998a; 1998b) can be modified and applied to do the essential calculational work.
Special Issue: Topological representation and reasoning in design and manufacturing
Authors: Dan Braha
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

Topology deals with geometric properties which are dependent only upon the relative positions of the components of figures and not upon such concepts as length, size, and magnitude. Topology supports design and representation of mechanical devices, communication and transportation networks, topographic maps, and planning and controlling of complex activities. In addition, aspects of topology are closely related to symbolic logic, which forms the foundation of artificial intelligence. By approaching engineering design from this abstract point of view, it is possible to use topological methods to study collections of geometric objects or collections of entities that are of concern in design analysis or synthesis. The importance of topological representation and reasoning in analysis, design, and manufacturing is heightened by the contemporary view that stresses the need for conceptual design.
On the relationship between connectivity and component order connectivity
Authors: Lawrence William Kazmierczak
Venue:  (2003)

There are networks that can be modeled by simple graphs, where edges are perfectly reliable but nodes are subject to failure, e.g. hardwired computer systems. One measure of the &ldquo;vulnerability&rdquo; of the network is the connectivity of the graph. Another, somewhat related, vulnerability parameter is the component order connectivity, i.e. the smallest number of nodes that must fail in order to ensure that all remaining components have order less than some given threshold value. This dissertation is a study of how the two parameters are related. One major result gives a forbidden subgraph condition on the complement of a graph that ensures both parameters are simultaneously maximized over all graphs having the same number of nodes and edges. In addition, it is shown that every such maximizing graph has diameter at most two; generalizations of this result are also discussed. The above results are then applied to obtain constructions of the maximizing graphs. We conclude with realizability results pertaining to the aforementioned parameters.
Quantifiable architecting of dependable systems of embedded systems
Authors: Sheldon X. Liang, Valdis Berzins Luqi
Venue: ACM SIGSOFT Software Engineering Notes (2003)

Architecture is a critical aspect in the successful development and evolution of dependable systems of embedded systems (SoES). Quantifiably architecting such systems involves establishing consensus from the particular perspectives of quality attributes. Unfortunately, there are few established approaches for rapidly prototyping architecture to identify key architectural artifacts that carry quantifiable constraints throughout the software development processes. This paper presents a quantifiable architectural approach for dependable SoES using rapid prototyping. The approach provides a set of rules (patterns) governing system composition. With quantifiable constraints attached to compositional patterns, the approach also establishes mappings between perspective modeling of dependability acquisition, constraint attachment, and property monitoring. Finally, it provides a rationale for translating timing and synchronous constraints into monitored properties attached to the auto-generated quantifiable architectural framework as an architectural context for quantifiable assessment and architectural evolution. Thus these properties are effectively and practically computable for dynamic monitoring at runtime.
Long-time numerical computation of electromagnetic fields in the vicinity of a relativistic source
Authors: Igor Zagorodnov, Rolf Schuhmann, Thomas Weiland
Venue: Journal of Computational Physics (2003)

We propose an implicit scheme for the calculation of electromagnetic fields in the vicinity of short electron bunches moving in a transversally bounded domain, as it has place in particle accelerators. The scheme is able to accurately model curved boundaries and does not suffer from dispersion in direction of motion. It is based on splitting the discrete curl operator in its transversal and longitudinal parts. Unlike previous conformal schemes the new method has a second order convergence without the need to reduce the maximal stable time step of the conventional staircase approach. This feature allows the usage of a moving mesh easily. Several numerical examples are presented and the algorithm is compared to other approaches.
Memory-based human motion simulation
Authors: Woojin Park
Venue:  (2003)

Digital humans in CAD systems can facilitate product and workspace designs through timely virtual ergonomic analyses. Currently, digital humans lack the capability of faithfully simulating human motions and motor capabilities. Existing methods are limited in that they do not provide: (1) planning of different types of motions on a unified framework, (2) consideration of alternative movement techniques, and (3) automatic adoption of new motions. To overcome these limitations, this research proposes a new approach for human motion planning termed Memory-based Motion Simulation (MBMS). In this context, motion planning utilizes joint angle templates stored in memory as the roots for producing new motions while conserving the properties of natural motions. The MBMS system consists of a motion database, a root motion finder, a movement technique classifier, and a motion modification algorithm. Given an input simulation scenario, the root motion finder searches the database for motions likely to approximate the scenario within specified limits. The selected motions are called root motions. Root motions may represent a mixture of fundamentally different &lsquo;alternative movement techniques.&rsquo; To represent them, a Joint Contribution Vector (JCV) was developed to characterize a motion by quantifying the contributions of each joint motion to its movement goal achievement. Once characterized as JCVs, root motions can be grouped by statistical clustering to reveal alternative movement techniques. A motion modification algorithm alters root motions to meet given task requirements. The algorithm first identifies a root motion's underlying structure by resolving joint angle trajectories into sequences of motion primitives. This allows parameterization based on amplitude- and time-scaling for generalization of a root motion. An optimization scheme then modifies the root motion's joint motions according to new scenarios while maintaining the original structure, and minimizing changes in the angular velocity profiles and the terminal postures. Experimental testing was performed for validation. The MBMS was found to accurately predict various seated reaches and whole-body load transfer motions. The robustness of the JCV was demonstrated by its ability to distinguish lifting techniques and identify alternative movement techniques for whole-body motions. A case study demonstrated the utility of MBMS in improving the ergonomics of manual handling tasks.
Integrated Process and Knowledge Management for Product Definition, Development and Delivery
Authors: Shai Koenig
Venue: Proceedings of the IEEE International Conference on Software-Science, Technology & Engineering (2003)

This paper describes a software process improvementeffort involving the development and deployment ofDiME, a proprietary, integrated, collaborativeenvironment for managing product definition,development and delivery processes and information.DiME has been developed as a means to improve and re-engineerthe management of these processes and facilitatethe management of product development information.The paper describes the situation that led to the DiMEinitiative, the DiME system and its basic concepts,principles and capabilities, and its enterprise-widedeployment within Comverse. Although the project is stillevolving, interim lessons learned from its introductioninto the enterprise are presented and related work isdiscussed.
Foreword to special issue: The difference between concurrent and sequential computation &ndash; Including selected papers from: EXPRESS'00 &ndash; 7th International Workshop on Expressiveness in Concurrency
Authors: Luca Aceto, Giuseppe Longo, Björn Victor
Venue: Mathematical Structures in Computer Science (2003)

Computer Science has witnessed the emergence of a plethora of different logics, models and paradigms for the description of computation. Yet, the classic Church&ndash;Turing thesis may be seen as indicating that all general models of computation are equivalent. Alan Perlis referred to this as the &lsquo;Turing tarpit&rsquo;, and argued that some of the most crucial distinctions in computing methodology, such as sequential versus parallel, deterministic versus non-deterministic, local versus distributed disappear if all one sees in computation is pure symbol pushing. How can we express formally the difference between these models of computation?
Robust multilingual parsing using island grammars
Authors: Nikita Synytskyy, James R. Cordy, Thomas R. Dean
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

Any attempt at automated software analysis or modification must be preceded by a comprehension step, i.e. parsing. This task, while often considered straightforward, can in fact be very challenging for some source code. Files that make up web applications serve as an example of such difficult-to-parse artifacts, for two reasons. First, these files often contain several programming languages at once, sometimes with widely varying syntaxes, and intermingled at the statement level. Second, the code routinely contains syntax errors. Understanding such files calls for a robust parser that can handle multiple languages simultaneously.An approach to creating such a parser, based on the concept of island grammars, is presented here. Island grammars have been used in the past for robust parsing and lightweight analysis of software. Some of the features of these grammars make them uniquely fit for parsing multiple languages simultaneously.
Poster abstract: LEAP&mdash;efficient security mechanisms for large-scale distributed sensor networks
Authors: Sencun Zhu, Sanjeev Setia, Sushil Jajodia
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

In this paper, we describe LEAP (Localized Encryption and Authentication Protocol), a key management protocol for sensor networks that is designed to support in-network processing techniques such as passive participation. LEAP includes support for multiple symmetric keying mechanisms including individual keys, pairwise shared keys, cluster keys, and a group key. This design is based on the observation that different types of messages exchanged between sensor nodes have different security requirements, and a single keying mechanism is not suitable for meeting these different security requirements.
Ontology-driven peer profiling in peer-to-peer enabled semantic web
Authors: Olena Parkhomenko, Yugyung Lee, E. K. Park
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Peer-to-peer (P2P) systems and Semantic Web are two novel technologies that face a lot of shortcomings if considered as isolated paradigms. We present an approach that utilizes ontologies to set up a peer profile containing all the data, necessary for peer-to-peer interoperability. Using this profile can help eliminate some major issues persistent in current P2P networks, such as security, resource aggregation, group management. We also consider applications of peer profiling for Semantic Web built on P2P networks, such as an improved semantic search for resources, not explicitly published on the Web, but available in a P2P system. We develop the ontology-based peer profile in RDF format and demonstrate its manifold benefits for peer communication and knowledge discovery in both P2P networks and Semantic Web.
Robotic Manipulators State Observation Via One-Time Gain Switching
Authors: Elsayed M. Elbeheiry, Hoda A. Elmaraghy
Venue: Journal of Intelligent and Robotic Systems (2003)

High-gain Luenberger-like state observation would provide the best possible tracking error of nonlinear systems at the expense of higher transient variance and slower convergence to the real state. Conversely, low-gain Luenberger-like observation usually provides lower transient variance of the error system, but might lead to nonzero or nonconvergent steady tracking error. This paper presents new switching-gain observer designs that capitalize on the benefits of low-gain, high-gain, and sliding mode observations. Switching and non-switching observer designs are both considered. Since adaptive observers are often of complex structures and might be difficult to implement, a simpler adaptation form is presented using one-time switching between two predetermined solutions. A nonlinear coordinate transformation is applied to obtain a linear observable system with nonlinear perturbation terms characterized by a Lipschitz constant and/or a finite bound on the norm. Sufficient conditions are derived for the existence of sliding mode, asymptotic stability of the error system, and the independence of the reconstruction error system from the perturbation inputs during the sliding mode. The new observer designs are applied to flexible-joint manipulators in order to explore their performance capabilities. The switching-gain observer was shown to be a reasonable compromise that is easy to be implemented.
BIST Based Fault Diagnosis Using Ambiguous Test Set
Authors: Hiroshi Takahashi, Yasunori Tsugaoka, Hidekazu Ayano, Yuzo Takamatsu
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

We propose a method for diagnosing single stuck-at faults under Built-In Self-Test (BIST) environment. Under BIST environment, it is di.cult to determine which BIST vectors producederrors due to the high degree of test response compaction. Therefore the detecting test set that is determined in BIST session includes un-detecting tests. We call the detecting test set determined after BIST session an "ambiguous diagnostic test set". First, we propose a method for identifying candidate faults based on the ambiguous diagnostic test set. Moreover we propose a method for identifying candidate un-detecting tests that belong to the ambiguous diagnostic test set. Diagnosis by using more accurate diagnostic test set is able to improve the diagnostic ambiguity.
Health care fraud investigation using data mining
Authors: Miguel Artur Feldens
Venue: ACM SIGBIO Newsletter (1998)

Development of intelligent information systems applied to health care system in Brazil. Data mining is being used as a tool to provide high level information for hospital administration, as well as to discover regularities. These regularities are tools for the investigation of fraud in the public health care system.
Ranking Function Optimization for Effective Web Search by Genetic Programming: An Empirical Study
Authors: Weiguo Fan, Michael D. Gordon, Praveen Pathak, Wensi Xi, Edward A. Fox
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Web search engines have become indispensable in our daily life to help us find the information we need. Although search engines are very fast in search response time, their effectiveness in finding useful and relevant documents at the top of the search hit list needs to be improved. In this paper, we report our experience applying Genetic Programming (GP) to the ranking function discovery problem leveraging the structural information of HTML documents. Our empirical experiments using the web track data from recent TREC conferences show that we can discover better ranking functions than existing well-known ranking strategies from IR, such as Okapi, Pt.df. The performance is even comparable to those obtained by Support Vector Machine.
Test Access Mechanism Optimization, Test Scheduling, and Tester Data Volume Reduction for System-on-Chip
Authors: Vikram Iyengar, Krishnendu Chakrabarty, Erik Jan Marinissen
Venue: IEEE Transactions on Computers (2003)

Abstract--We describe an integrated framework for system-on-chip (SOC) test automation. Our framework is based on a new test access mechanism (TAM) architecture consisting of flexible-width test buses that can fork and merge between cores. Test wrapper and TAM cooptimization for this architecture is performed by representing core tests using rectangles and by employing a novel rectangle packing algorithm for test scheduling. Test scheduling is tightly integrated with TAM optimization and it incorporates precedence and power constraints in the test schedule, while allowing the SOC integrator to designate a group of tests as preemptable. Test preemption helps avoid hardware and power consumption conflicts, thereby leading to a more efficient test schedule. Finally, we study the relationship between TAM width and tester data volume to identify an effective TAM width for the SOC. We present experimental results on our test automation framework for four benchmark SOCs.
Performance Assessment of the Lead User Idea-Generation Process for New Product Development
Authors: Gary L. Lilien, Pamela D. Morrison, Kathleen Searls, Mary Sonnack, Eric von Hippel
Venue: Management Science (2002)

Traditional idea generation techniques based on customer input usually collect information on new product needs from a random or typical set of customers. The "lead user process" takes a different approach. It collects information about both needs and solutions from users at the leading edges of the target market, as well as from users in other markets that face similar problems in a more extreme form. This paper reports on a natural experiment conducted within the 3M Company on the effect of the lead user (LU) idea-generation process relative to more traditional methods. 3M is known for its innovation capabilities-- and we find that the LU process appears to improve upon those capabilities. Annual sales of LU product ideas generated by the average LU project at 3M are conservatively projected to be $146 million after five years--more than eight times higher than forecast sales for the average contemporaneously conducted "traditional" project. Each funded LU project is projected to create a new major product line for a 3M division. As a direct result, divisions funding LU project ideas are projecting their highest rate of major product line generation in the past 50 years.
Distributed Learning Environments
Authors: Maryam Alavi
Venue: Computer (2004)

DLEs must balance technology with student attributes and instructional strategies.