ppxscal/embedding_network huggingface dataset:
Hierarchical Modeling and Simulation of Large Analog Circuits
Authors: Sheldon X. -D. Tan, Zhenyu Qi, Hang Li
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper proposes a new hierarchical circuit modeling and simulation technique in s-domain for linear analog circuits. The new algorithm can perform circuit complexity reduction by deriving the exact or approximate admittances in rational form in the reduced circuit matrix and deriving the circuit characteristics for very large linear analog and interconnect circuits. We characterize some theoretical results regarding the conditions on the generations of cancelingterms during the general hierarchical circuit analysis and propose an explicit de-cancellation scheme to remove canceling terms based on a new hierarchical symbolic analysis framework. The resulting algorithm can be used for modeling and simulation of linear analog and interconnect circuits in both frequency and time domain.
Minimax Multiresolution Scalar Quantization
Authors: Nima Sarshar, Xiaolin Wu
Venue: Proceedings of the Conference on Data Compression (2004)

We consider the problem of design and analysis of optimal L\infty (minmax)multi-resolution scalar quantizers (MRSQ). The overall multi-resolution L\infty distortion of an MRSQ is defined to be a weighted sum of L\infty distortions over all refinement levels of the MRSQ. The weight for a refinement level usually denotes the probability that the MRSQ will operate at that level (rate). An interesting relation of the problemto the design of optimal binary prefix codes under a code cell contiguity constraint is established. Lower bounds for the overall multi-resolution L\infty distortion are derived based on this relation. Provably optimal as well as fast, near optimal algorithms arealso developed for practically interesting scenarios. Furthermore, the performancepenalty incurred by making a scalable quantizer embedded (progressively refinable)is analyzed. It is shown that constraining the quantizers to be embedded would on average increase the L\infty quantization error by at least 44%.
Does One Standard Promote Faster Growth? An Econometric Analysis of the International Diffusion of Wireless Technology
Authors: Robert J. Kauffman, Angsana A. Techatassanasoontorn
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

International diffusion of wireless telecommunication and mobile e-commerce has increased since the height of the Internet economy, however, there are a number of different managerial,technological and interpretative issues that still require a more careful look by Marketing Science and Information Systems researchers. In this research, we put forward a new theoretical perspective to enable policy makers to better understand states of digital wireless phone diffusion and factors that affect their diffusion rates. We use a modified Bass model and a coupled-hazard survival model to test the effects of country environmental factors, digital and analog wireless phone industry environmental factors, and technology policy factors on the speed of diffusion. The results show that multiple standards and high prices slow down the digital wireless phone diffusion process from the Introduction state to the Partial Diffusion state. Competition in both analog and digital wireless phone industry also shapes the growth of digital wireless phone diffusion. In addition, different practices of technology policies influence the digital wireless phone diffusion speed especially during the take-off.
Session summary: new core language features
Authors: Joyce L. Tokar, Brian Dobbing
Venue: Proceedings of the 12th international workshop on Real-time Ada (2003)

The first session in the 12th International Real-Time Ada Workshop was a summary of the new core language features that are proposed for the Amendment to Ada that is scheduled for 2005.
Measuring the Utilization of Collaboration Technology for Knowledge Development and Exchange in Virtual Communities
Authors: Malte Geib, Christian Braun, Lutz Kolbe, Walter Brenner
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

The success of a virtual community depends chiefly on the community members' utilization of the community system that supports it. It is therefore essential that the functions of the system meet the members' requirements. The objective of this paper is to identify usage patterns in virtual community systems focused on learning and knowledge exchange in order to derive recommendations for the design of virtual community systems. We therefore analyze two specific professionally-oriented virtual communities focusing on learning and knowledge exchange by indepth case studies.The first one is a learning network consisting of participants of a post-graduate study program. The second one is an expert network consisting of academic researchers and employees of several major European financial services companies. For each of these two communities, we describe the community's initial situation, its special characteristics, its objectives, its members and different application areas regarding a supporting community system. Thereafter, we identify the requirements that the community system needs to fulfill to satisfy the members' needs. Based on these requirements, the different functions of the system that should meet these requirements, are presented. For each community, we measured the utilization of the functions implemented in the community systems using a web log analysis tool.Reflecting the measurement results on the case descriptions and the members' requirements, we drew conclusions on how members use a virtual community system: Most importantly, functions that support structured user processes with clear user requirements are preferably used. Moreover, personal information on community members is frequently viewed. On the other hand, most synchronous and asynchronous communication functions are rarely used and community users make few own contributions to discussions. Finally, functions that implement potentially redundant functions, for example group calendars or link collections, are rarely used.
Reinforcing reachable routes
Authors: Srinidhi Varadarajan, Naren Ramakrishnan, Muthukumar Thirunavukkarasu
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

This paper studies the evaluation of routing algorithms from the perspective of reachability routing, where the goal is to determine all paths between a sender and a receiver. Reachability routing is becoming relevant with the changing dynamics of the Internet and the emergence of low-bandwidth wireless/ad hoc networks. We make the case for reinforcement learning as the framework of choice to realize reachability routing, within the confines of the current Internet infrastructure. The setting of the reinforcement learning problem offers several advantages, including loop resolution, multi-path forwarding capability, cost-sensitive routing, and minimizing state overhead, while maintaining the incremental spirit of current backbone routing algorithms. We identify research issues in reinforcement learning applied to the reachability routing problem to achieve a fluid and robust backbone routing framework. This paper also presents the design, implementation and evaluation of a new reachability routing algorithm that uses a model-based approach to achieve cost-sensitive multi-path forwarding; performance assessment of the algorithm in various troublesome topologies shows consistently superior performance over classical reinforcement learning algorithms. The paper is targeted toward practitioners seeking to implement a reachability routing algorithm.
Suggestions about a specification technique
Authors: B. D. Chaudhary, H. V. Sahasrabuddhe
Venue: ACM SIGPLAN Notices (1978)

In this note, we suggest some modifications in a specification technique of abstract data structures. These modifications will enhance its power to specify the delayed effects, exception handling strategy and any other computational properties.
A Semantic Matching Method for Clustering Traders in B2B Systems
Authors: Ricardo Ferraz Tomaz, Sofiane Labidi, Bernardo Wanghon
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

This Work is part of the ICS (Intelligent Commerce System) project whose aim is to design and implement an effective Intelligent B2B Commerce System. This paper presents a practical application on Semantic Web and Web Services concepts where a matching procedure to associate potential buyers and suppliers in a B2B system is shown and the use of patterns and tools in the development of Semantic Web's structure is proposed as an alternative for its implementation.
The internet spatial spreadsheet: enabling remote visualization of dynamic spatial data and ongoing query results over a network
Authors: Glenn S. Iwerks, Hanan Samet
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

Moving object databases store and process data for objects that change location frequently. Materialized views maintained over time must be updated to reflect changes due to the motion of objects in their environment. To visualize view query results, displays must be updated to reflect the change. In this paper we present the Internet Spatial Spreadsheet (ISS) as a means to organize, query, and visualize changing spatial data in a network environment such as the Internet.The goal of the ISS is to keep client visualizations of query results up to date with the server state. This is accomplished by pushing the minimal set of spatial data needed for rendering query results on the client. Incremental changes to query results are subsequently transmitted to the client as the database is updated to keep the visualization current. Additional constraints in the network environment such as firewall limitations are also considered.
Enabling Autonomic Compositions in Grid Environments
Authors: Manish Agarwal, Manish Parashar
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

In this paper we present the design, prototype implementationand operation of the Accord Composition Engine(ACE) that enables the dynamic and autonomic compositionof Grid services. ACE builds on the Open Grid Services Architecture(OGSA) and autonomically synthesizes compositionplans, when possible, from an available pool of servicesbased on dynamically defined objectives and constraints.The key contribution is a dynamic composition model basedon relational algebra and graph theory.
Parallel molecular dynamics simulation of Lennard-Jones liquids on a small Beowulf cluster
Authors: T. E. Karakasidis, A. B. Liakopoulos, N. S. Cholevas
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In the present paper we present results concerning the performance of a parallel Molecular Dynamics simulation of a Lennard-Jones liquid on a PC cluster consisting of four Pentium III processors running under Linux and using the MPI protocol. The methodology for the parallelization was the atom decomposition method in which each processor is assigned to deal with a given group of atoms. We examined the program performance for system sizes 102 to 105 atoms and number of processors varying from 1 to 4. The influence of the communication methods between processors was also examined. It was found that even such a small cluster can be a very useful and cost-effective solution for the realization of MD simulations of small Lennard-Jones liquid systems for real times up to 1 µs within a reasonable computation time.
Structured programming: a minor part of software engineering
Authors: David Lorge Parnas
Venue: Information Processing Letters (2003)

Software Engineering is discussed as a branch of Engineering specialising in software intensive products. The process of developing good software is discussed and it is argued that writing programs, though obviously an essential step in the process, is only a small part of Software Engineering.
Reachability and Controllability of Discrete-Time Systems under Control Actions Bounded in Magnitude and Norm
Authors: A. N. Sirotin, A. M. Formal'skii
Venue: Automation and Remote Control (2003)

Control systems described by linear difference equations are studied, assuming that control actions are bounded both in magnitude (geometrically) and norm (integrally). The states in the phase space to which a system can be transferred from the origin and the states from which a system can be transferred to the origin are studied. Examples are given.
Energy-efficient collision-free medium access control for wireless sensor networks
Authors: Venkatesh Rajendran, Katia Obraczka, J. J. Garcia-Luna-Aceves
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

The traffic-adaptive medium access protocol (TRAMA) is introduced for energy-efficient collision-free channel access in wireless sensor networks. TRAMA reduces energy consumption by ensuring that unicast, multicast, and broadcast transmissions have no collisions, and by allowing nodes to switch to a low-power, idle state whenever they are not transmitting or receiving. TRAMA assumes that time is slotted and uses a distributed election scheme based on information about the traffic at each node to determine which node can transmit at a particular time slot. TRAMA avoids the assignment of time slots to nodes with no traffic to send, and also allows nodes to determine when they can become idle and not listen to the channel using traffic information. TRAMA is shown to be fair and correct, in that no idle node is an intended receiver and no receiver suffers collisions. The performance of TRAMA is evaluated through extensive simulations using both synthetic- as well as sensor-network scenarios. The results indicate that TRAMA outperforms contention-based protocols (e.g., CSMA, 802.11 and S-MAC) as well as scheduling-based protocols (e.g., NAMA) with significant energy savings.
Analyzing and Relating Bug Report Data for Feature Tracking
Authors: Michael Fischer, Martin Pinzger, Harald Gall
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Gaining higher level evolutionary information aboutlarge software systems is a key in validating past and adjustingfuture development processes. In this paper, we analyzethe proximity of software features based on modificationand problem report data that capture the system's evolutionhistory. Features are instrumented and tracked, therelationships of modification and problem reports to thesefeatures are established, and the tracked features are visualizedto illustrate their otherwise hidden dependencies.Our approach uncovers these hidden relationships betweenfeatures via problem report analysis and presents them ineasy-to-evaluate visual form. Particular feature dependenciesthen can be selected to assess the feature evolution byzooming in into an arbitrary level of detail. Such visualizationof interwoven features, therefore, can indicate locationsof design erosion in the architectural evolution of asoftware system. Our approach has been validated usingthe large open source software project of Mozilla and itsbug reporting system Bugzilla.
Tractable models of natural language semantics for recognizing spoken directions
Authors: William Edward Schuler
Venue:  (2003)

The development of speaker-independent mixed-initiative spoken language interfaces, in which users not only answer questions but also ask questions and give instructions, is currently limited by the performance of language models based largely on word co-occurrences. Even under ideal circumstances, with large application-specific corpora on which to train, conventional language models are not sufficiently predictive to correctly analyze a wide variety of inputs from a wide variety of speakers, such as might be encountered in a general-purpose interface for directing robots, office assistants, or other agents with complex capabilities. This thesis explores the use of statistical models of language conditioned on the meanings or denotations of input utterances in the context of an interface's underlying application environment or world model, as an extension to the &lsquo;semantic grammars&rsquo; used in existing spoken language interfaces (which rely on co-occurrences among words or word classes). Since there are an exponential number of possible parse tree analyses attributable to any string of words, and many possible word strings attributable to any utterance, this use of model-theoretic interpretation must involve some kind of sharing of partial results between competing analyses if interpretation is to be performed on large numbers of possible analyses in a practical interactive application. This thesis presents a formal result that model-theoretic semantic interpretation can be factored (cut into well-behaved partial results) and shared (re-used between possible analyses) in polynomial time, in much the same way that simple syntactic structure is factored into context-free rules and shared in standard dynamic programming parsing algorithms. This polynomial bound holds even for analyses containing non-immediate variable scopings (including intra-sentential anaphora and quantifier raising) and generalized quantifiers, which are traditionally analyzed to have second-order (exponential) denotations. The thesis also presents the practical result that this approach does indeed yield a statistically significant improvement in accuracy in analyzing a corpus of spoken directions to 3-D animated agents.
In and out of the sound studio
Authors: Andra McCartney
Venue: Organised Sound (2003)

This article reports on the first phase of a four-year, multi-university Canadian research project called &lsquo;In and Out of the Studio&rsquo;. The intention of this project is to study the experiences and working practices of women sound producers in Canada, and to produce a multimedia computer installation and set of articles about their ideas, approaches and philosophies. We are studying gender issues that affect the work of these women in areas as diverse as film sound recording and post-production, sound engineering, radio art, performance art, experimental music, audio documentary production, and web sound. This is a wide range of disciplines, with their associated professional formations. What links the experiences of these diverse cultural workers is their focus on organising sound, and their gender. The first phase of the research focuses on formations: the following phase will concentrate on working practices through a discussion and analysis of specific recent works produced by the participants. The second part of this article explores the working processes of Hildegard Westerkamp in her composition of Gently Penetrating Beneath the Sounding Surfaces of Another Place (1997), through an interview with Westerkamp conducted in 1997. This interview will be used as a model for the in-depth studio interviews in the present study.
C49 defect influence on the C49-C54 transition
Authors: F. La Via, F. Mammoliti, M. G. Grimaldi
Venue: Microelectronic Engineering (2003)

The C49-C54 transformation has been studied in TiSi2 thin films having different concentration of defects. The defect concentration in the C49 phase has been varied using different thermal processes in the 460-540 °C temperature range; in fact, the defect concentration decreases with increasing the temperature and/or the duration of the thermal process as attested by the large variation of the silicide residual resistivity at 4 K. The kinetics of the transformation at 650 °C has been followed by in situ resistivity measurements and, for each sample, the transition time decreases as the defect concentration in the metastable phase decreases.
Assessment and pruning of hierarchical model based clustering
Authors: Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mixture of Gaussians, and to estimate the parameters of the component densities, the mixing fractions, and the number of components from the data. The number of distinct groups in the data is then taken to be the number of mixture components, and the observations are partitioned into clusters (estimates of the groups) using Bayes' rule. If the groups are well separated and look Gaussian, then the resulting clusters will indeed tend to be "distinct" in the most common sense of the word - contiguous, densely populated areas of feature space, separated by contiguous, relatively empty regions. If the groups are not Gaussian, however, this correspondence may break down; an isolated group with a non-elliptical distribution, for example, may be modeled by not one, but several mixture components, and the corresponding clusters will no longer be well separated. We present methods for assessing the degree of separation between the components of a mixture model and between the corresponding clusters. We also propose a new clustering method that can be regarded as a hybrid between model-based and nonparametric clustering. The hybrid clustering algorithm prunes the cluster tree generated by hierarchical model-based clustering. Starting with the tree corresponding to the mixture model chosen by the Bayesian Information Criterion, it progressively merges clusters that do not appear to correspond to different modes of the data density.
Using Open Source Software in Product Development: A Primer
Authors: Michel Ruffin, Christof Ebert
Venue: IEEE Software (2004)

There are important legal aspects involved in using open source software in commercial products. Here are answers to common questions on how to handle these issues to mitigate risks.
Determination of the topology of a directed network
Authors: Darin Goldstein
Venue: Information Processing Letters (2003)

We consider strongly-connected, directed networks of identical synchronous, finite-state processors with in- and outdegree uniformly bounded by a network constant. Via a straightforward extension of Ostrovsky and Wilkerson's Backwards Communication Algorithm [Proc. 14th Annual Symp. on Principles of Distributed Computing, 1995], we exhibit a protocol which solves the Global Topology Determination Problem, the problem of having a root processor map the global topology of a network of unknown size and topology, with running time O(ND) where N represents the number of processors and D represents the diameter of the network. A simple counting argument suffices to show that the Global Topology Determination Problem has time-complexity Ω(N log N) which makes the protocol presented asymptotically time-optimal for many large networks.