ppxscal/embedding_network huggingface dataset:
Designing Nanoscale Logic Circuits Based on Markov Random Fields
Authors: K. Nepal, R. I. Bahar, J. Mundy, W. R. Patterson, A. Zaslavsky
Venue: Journal of Electronic Testing: Theory and Applications (2007)

As devices and operating voltages are scaled down, future circuits will be plagued by higher soft error rates, reduced noise margins and defective devices. A key challenge for the future is retaining high reliability in the presence of faulty devices and noise. Probabilistic computing offers one possible approach. In this paper we describe our approach for mapping circuits onto CMOS using principles of probabilistic computation. In particular, we demonstrate how Markov random field elements may be built in CMOS and used to design combinational circuits running at ultra low supply voltages. We show that with our new design strategy, circuits can operate in highly noisy conditions and provide superior noise immunity, at reduced power dissipation. If extended to more complex circuits, our approach could lead to a paradigm shift in computing architecture without abandoning the dominant silicon CMOS technology.
Hierarchical Bayes approach to adapting delta- and delta-delta cepstra
Authors: A. C. Surendran
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In most adaptation schemes, when a limited amount of data is available, the estimation errors affect the feature coefficients which have a small dynamic range i.e. delta and delta-delta coefficients. On the other hand, adapting only the cepstral coefficients compromises the performance when large amounts of data are available. In this paper we present a novel approach to solving this problem based on hierarchical Bayesian adaptation. First the delta parameters are cast as transformations of the cepstra. Then the cepstra are adapted using Bayesian techniques. The parameters of posterior distribution of the cepstra are transformed to get the hyperparameters of the delta coefficients which are then adapted. In this paper, the solution is presented in the framework of Bayesian predictive adaptation, but the approach is general, hence it can be applied in any other adaptation framework. Preliminary results are presented that demonstrate the effectiveness of the new method.
Creating and Validating Embedded Assertion Statecharts
Authors: Doron Drusinsky, Man-Tak Shing, Kadir Alpaslan Demir
Venue: IEEE Distributed Systems Online (2007)

Integrating formal assertions into the modeling, implementation, and testing of statechart-based designs can enhance a rapid system prototyping system's robustness by providing runtime monitoring and recovery from assertion failures. An iterative process for developing and verifying statechart prototype models augmented with statechart assertions using the StateRover tool lets system designers write formal specifications using statechart assertions. It also enables them to use JUnit-based simulation to validate statechart assertions and to test statechart prototype models augmented with statechart assertions. A case study using a safety-critical computer assisted resuscitation algorithm software prototype for a casualty intravenous fluid infusion pump illustrates the process.
A Survey of B2B Methodologies and Technologies: From Business Models towards Deployment Artifacts
Authors: Jurgen Dorn, Christoph Grun, Hannes Werthner, Marco Zapletal
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In recent years business-to-business (B2B) ecommerce has been subject to major rethinking. A paradigm shift from document centric file-based interchange of business information to process-centric and service-based information exchange can be observed. On a business level, a lot of work has been done to capture business models and collaborative business processes of an enterprise. On a technical level, the focus in software development is moving towards service-oriented architectures (SOA). These transitions on both levels promise a market entry at lower costs and an easier adjustment to changing market conditions. Hence, an overwhelming quantity of specifications and approaches emerged in the past targeting the area of B2B - these are partly competing and overlapping. In this paper, we provide a survey of the most promising ones at both levels and classify them using the Open-edi reference model standardized by ISO. Furthermore, we discuss how individual specifications on different levels fit together - starting from business models via business processes to artifacts ready for deployment.
On the duality of optimal DMT systems and biorthogonal subband coders
Authors: Yuan-Pei Lin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The discrete multitone modulation (DMT) systems have been widely used in various applications. The DMT system can be considered as a dual of a subband coder, obtained by using the synthesis bank as the transmitter and analysis bank as the receiver. In designing optimal subband coders, the objective is to minimize output quantization noise, whereas in the problem of designing optimal DMT system, the objective function to be minimized is the transmitted power. We show that the design of optimal DMT systems can be formulated as a hypothetical design problem of optimal subband coders. The solution of optimal DMT system can be obtained using existing design methods for optimal biorthogonal subband coders.
Transmission Times in Buffed Full-Crossbar Communication Networks with Cyclic Arbitration
Authors: A. J. Field, P. G. Harrison
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

In this paper we consider the distribution of message transmission times in buffered full cross bar interconnection networks with cyclic arbitration in which the input buffers are serviced in a 'round robin' fashion. The system is modelled as an open queue ing network in which the queues appear at the net work outputs and with the cyclic arbiter being mod elled by queue jumping. We obtain the Laplace Trans form of the transmission time by deriving a condi tional Laplace Transform and solving by the use of a generating function. The density function is then enumerated by numerical inversion and compared with similar results from a simulation model. The analysis is then extended to general service times by modelling each output as a LCFS queue with a suitably modified arrival rate. In the special case of exponential service times, this model is less versatile than the previous one since it only works in the case where the jump probability is fixed. In this case, however, it is shown to produce the same result as the original.
The Year that Was ... and Yet to Be
Authors: Norman Chonacky
Venue: Computing in Science and Engineering (2007)

The editor in chief rings in the new year by describing the various changes he's implemented for 2007, including adding new department editors, changing department titles, and starting a new horizontal track to cover the International Polar Year.
Working with patterns in large multivariate datasets - Karnaugh-Veitch-Maps revisited
Authors: Thorsten May
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

We present an interactive visualization method for the multivariate analysis of large and complex datasets, based on the layout of Karnaugh-Veitch-diagrams. Working on data categories, we additionally provide an interactive partitioning of value ranges of ordinal types. Multivariate dependencies manifest on the map in characteristic color patterns. These patterns are representations of subsets of the data or attributes which embody significant information. While the task of the user is to identify visual patterns of particular interest to him by clicking on the map, the software identifies a minimal representation of the corresponding subset and gives a visual feedback. Hence, user and machine cooperate on the basis of a strong visual coupling in short iterative cycles. During this process the trade-off between the accuracy and simplicity of a representation, which is crucial for any type of the building of analytical models, can be found in an effective way.
An analytically derived cooling schedule for simulated annealing
Authors: Yanfang Shen, Seksan Kiatsupaibul, Zelda B. Zabinsky, Robert L. Smith
Venue: Journal of Global Optimization (2007)

We present an analytically derived cooling schedule for a simulated annealing algorithm applicable to both continuous and discrete global optimization problems. An adaptive search algorithm is used to model an idealized version of simulated annealing which is viewed as consisting of a series of Boltzmann distributed sample points. Our choice of cooling schedule ensures linearity in the expected number of sample points needed to become arbitrarily close to a global optimum.
Rapid and accurate latch characterization via direct Newton solution of setup/hold times
Authors: Shweta Srivastava, Jaijeet Roychowdhury
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Characterizing setup/hold times of latches and registers, a crucial component for achieving timing closure of large digital designs, typically occupies months of computation in industries such as Intel and IBM. We present a novel approach to speed up latch characterization by formulating the setup/hold time problem as a scalar nonlinear equation h(&tau;) = 0 derived using state-transition functions, and then solving this equation by Newton-Raphson (NR). The local quadratic convergence of NR results in rapid improvements in accuracy at every iteration, thereby significantly reducing the computation needed for accurate determination of setup/hold times. We validate the fast convergence and computational advantage of the new method on transmission gate and C2MOS latch/register structures, obtaining speedups of 4-10 &times; over the current standard of binary search.
A Routing Metric for Load-Balancing in Wireless Mesh Networks
Authors: Liang Ma, Mieso K. Denko
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This paper proposes a routing metric known as Weighted Cumulative Expected Transmission Time with Load Balancing (WCETT-LB) for wireless mesh networks. WCETTT-LB enhances the basic Weighted Cumulative Expected Transmission Time (WCETT) by incorporating load balancing into the routing metric. Unlike other existing schemes proposed for load balancing for wireless mesh networks, WCETT-LB implements load balancing at mesh routers. WCETT-LB provides a congestion aware routing and traffic splitting mechanism to achieve global load balancing in the network. The preliminary qualitative and quantitative analyses show the significance of the proposed scheme.
Fuzzy clustering in parallel universes
Authors: Bernd Wiswedel, Michael R. Berthold
Venue: International Journal of Approximate Reasoning (2007)

We present an extension of the fuzzy c-Means algorithm, which operates simultaneously on different feature spaces-so-called parallel universes-and also incorporates noise detection. The method assigns membership values of patterns to different universes, which are then adopted throughout the training. This leads to better clustering results since patterns not contributing to clustering in a universe are (completely or partially) ignored. The method also uses an auxiliary universe to capture patterns that do not contribute to any of the clusters in the real universes and therefore are likely to represent noise. The outcome of the algorithm is clusters distributed over different parallel universes, each modeling a particular, potentially overlapping subset of the data and a set of patterns detected as noise. One potential target application of the proposed method is biological data analysis where different descriptors for molecules are available but none of them by itself shows global satisfactory prediction results.
Connectivity in Sensor Networks
Authors: Patrick Vincent, Murali Tummala, John McEachen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We analyze the probability that an arbitrarily selected sensor node in a sensor network is connected to a specified number, m, of other sensor nodes; i.e., that a communication path exists between a selected node and at least m other nodes. Specifically, we consider the following problem: If given a collection of sensor nodes, each with a communication radius r, that are to be uniformly distributed over an area of size A, how many nodes must be deployed to assure that any node is connected to at least m other nodes with a specified probability? Alternatively, if we deploy a fixed number of nodes over a region, what is the probability that a selected node will have m neighbors? Such questions are particularly pertinent for unattended sensor networks that perform cooperative operations requiring the participation of at least m nodes.
CSR+-tree: Cache-conscious Indexing for High-dimensional Similarity Search
Authors: Junfeng Dong, Xiaohui Yu
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

In this paper, we propose a novel index structure, the CSR+-tree, to support efficient high-dimensional similarity search in main memory. We introduce Quantized Bounding Spheres (QBSs) that approximate Bounding Spheres (BSs) or data points. We analyze the respective pros and cons of both QBSs and the previously proposed Quantized Bounding Rectangles (QBRs), and take the best of both worlds by carefully incorporating both of them into the CSR+-tree. We further propose a novel distance computation scheme that eliminates the need for decompressing QBSs or QBRs, which results in significant cost savings. We present an extensive experimental evaluation and analysis of the CSR+-tree, and compare its performance against that of other representative indexes in the literature. Our results show that the CSR+- tree consistently outperforms other index structures.
Distributed Tests: An ARMY Perspective
Authors: Kenneth G., Ken Yetzer, Mike Stokes, Ashok Krishnamurthy, Alan Chalker
Venue: Proceedings of the HPCMP Users Group Conference (2006)

At the heart of Network Centric Warfare is the ability for all assets on the battlefield to communicate and coordinate their actions. Therefore, as these systems are being developed they must be tested and evaluated together along with other assets in a networked environment. The key requirement to conducting this type of Test and Evaluation (i.e., distributed testing) is having the necessary expertise to combine networking, security, high performance computing (HPC), and simulation experience as needed. The Army began preparation for testing in a distributed environment more than a decade ago when the Army Test and Evaluation Command created the Virtual Proving Ground. An outgrowth of this technology investment was a series of increasingly complex distributed test events or exercises whose purpose was to provide technology integration points and demonstrate and document the capabilities and methodologies for conducting distributed testing. The experience gained in performing these exercises over the past ten years, raises important questions regarding interoperability of network-centric assets, performance of spatially separated systems (especially those involving Hardware-in-the-Loop (HWIL) assets) and high bandwidth requirements such as video and audio streaming feeds. This paper seeks to expound on a few of these issues as observed from the most recent tests as observed from the US Army Redstone Technical Test Center (RTTC). The latest exercise, Distributed Test Event 5 (DTE-5), occurred in August/September of 2005.
Discovering accurate interclass test dependences
Authors: Weilei Zhang, Barbara G. Ryder
Venue: Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2007)

Knowledge of interclass test dependences is crucial to decide class test order, facilitating the design of an efficient integration test plan. In order to discover precise interclass test dependences, we proposed a semantic-based definition and designed a safe approximation algorithm to calculate the dependence according to the given definition. The algorithm propagates semantic dependences at method-level granularity and is parameterized by the precision of the corresponding program analysis. We have experimented with nine benchmarks and showed that the algorithm is rather accurate in that it discovers dependence cycles precisely in 6 out of 9 benchmarks (as evaluated by human inspection). The algorithm uncovers additional opportunities for concurrent testing in each of the benchmarks, with an on average expected 52.5% time savings over the ORD-based definition.
A digital family calendar in the home: lessons from field trials of LINC
Authors: Carman Neustaedter, A. J. Bernheim Brush, Saul Greenberg
Venue: Proceedings of Graphics Interface 2007 (2007)

Digital family calendars have the potential to help families coordinate, yet they must be designed to easily fit within existing routines or they will simply not be used. To understand the critical factors affecting digital family calendar design, we extended LINC, an inkable family calendar to include ubiquitous access, and then conducted a month-long field study with four families. Adoption and use of LINC during the study demonstrated that LINC successfully supported the families' existing calendaring routines without disrupting existing successful social practices. Families also valued the additional features enabled by LINC. For example, several primary schedulers felt that ubiquitous access positively increased involvement by additional family members in the calendaring routine. The field trials also revealed some unexpected findings, including the importance of mobility---both within and outside the home---for the Tablet PC running LINC.
RWAR: A Resilient Window-consistent Asynchronous Replication Protocol
Authors: Yanlong Wang, Zhanhuai Li, Wei Lin
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Asynchronous replication protocol is playing an increasingly important role in the design of a remote disaster-tolerance system. A resilient windowconsistent asynchronous replication protocol (RWAR) is presented in this paper. RWAR increases the synchronous feature of asynchronous replication protocol by setting replication space-windows. This can achieve widow-consistency and decrease the risk of the inconsistency between the primary and backup systems. Simultaneously, RWAR dynamically adjusts the size of every space-window by setting checkpoints behind space-windows and calculating the system bandwidth-utility. This can strengthen the resiliency and flexibility of every space-window and ensure the replication performance of the primary system. It's proved with experiments that RWAR affords trade-off between data consistency and replication performance. It is helpful to construct a practical replication-based disaster-tolerance system.
Assurance of System Consistency During Independent Creation of UML Diagrams
Authors: Lukasz Fryz, Leszek Kotulski
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Graph transformations are a very intuitive formalism used in visualization, modelling of distributed systems or in support its allocation. The formal description the modelling process (both UML diagram and the trace of designer decisions) complicate its structure; we should be able support both parallel activity of local graph transformation systems and their cooperation for the assurance of the systems consistency. In the paper, the concept of conjugated graphs is introduced for this purpose. Next, the implementation of this concept with the help of aedNLC graph grammar is presented.
Improving the accuracy of ultrasound-based localisation systems
Authors: Hubert Piontek, Matthias Seyffer, Jörg Kaiser
Venue: Personal and Ubiquitous Computing (2007)

We present an improvement to ultrasound-based indoor location systems like Cricket (Priyantha et al. The Cricket location-support system, 2000). By encoding and modulating the ultrasound pulses, we are able to achieve greater accuracy in distance measurements. Besides improving the distance measurements, we improve the position update rate by synchronising the active beacons. We also propose a method that could further improve the update rate by superimposing encoded ultrasound pulses. Further, an experimental evaluation of our improvements is presented.
Volume entropy, weighted girths and stable balls on graphs
Authors: Florent Balacheff
Venue: Journal of Graph Theory (2007)

We prove new isoperimetric inequalities on graphs involving quantities linked with concepts from differential geometry. First, we bound from above the product of the volume entropy (defined as the log of the exponential growth rate of the universal cover) and the girth of weighted graphs in terms of their cyclomatic number. In a second part, we study a natural polyhedron associated to a weighted graph: the stable ball. In particular, we relate the volume of this polyhedron, the weight of the graph and its cyclomatic number. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 291&ndash;305, 2007
A low-complexity radar for human tracking
Authors: Hao Ling
Venue:  (2006)

Human detection and tracking have become the key necessities in security and surveillance systems, especially with the growth of terrorism threats and incidents worldwide. A low-cost, low-complexity radar for tracking multiple moving humans in indoor surveillance applications is investigated in this research. The basic concept is to employ two-element receiving array to obtain the bearing of the targets. Conventional bearing detection requires the use of an antenna array with multiple elements. In this dissertation, the use of only two elements in the receiver array for bearing tracking is investigated. The concept entails resolving the Doppler frequencies of the returned signals from the moving targets, and then measuring the phase difference at each Doppler frequency component to calculate the bearing of the targets. The concept is extended by employing an additional element for vertical scanning. This extension enables the system to provide two-dimensional bearing tracking of multiple movers in the azimuth and elevation planes. A possible application of frontal-imaging of human is also investigated. Given the fact that body parts in a moving human may give rise to different Doppler returns, their bearing information may be extracted and correlated to construct a frontal image of human. Since the frontal view of human may offer more information than the conventional top-down view (down-range), it can potentially be used for target classification purposes. The concept is extended further by incorporating two frequencies to obtain the target range information. The Doppler separation among the moving targets are again exploited and pre-filtered before measuring the phase difference to arrive at the range information of the targets. The final extension of the basic concept turns the system into a low-cost, low-complexity, three-dimensional radar for human tracking. Simulations are performed to demonstrate the concept and to assess the system performance bounds. A simplified model of human-gait is developed and used in the simulations to represent realistic factors such as micro-Doppler returns of body parts. An experimental system is designed and constructed to test the concept. Measurement results of human subjects in various indoor and outdoor environments are presented, including through-wall scenarios.