ppxscal/embedding_network huggingface dataset:
Power constrained design optimization of analog circuits based on physical gm/ID characteristics
Authors: Alessandro Girardi, Sergio Bampi
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

This paper presents a transistor optimization methodology for low-power analog integrated CMOS circuits, relying on the physics-based gm/ID characteristics as a design optimization guide. Our custom layout tool LIT implements and uses the ACM MOS compact model in the optimization loop. The methodology is implemented for automation within LIT and exploits all design space through the simulated annealing optimization process, providing solutions close to optimum with a single technology-dependent curve and accurate expressions for transconductance and current valid in all operation regions. The compact model itself contributes to convergence and to optimized implementations, since it has analytic expressions which are continuous in all current regimes, including weak and moderate inversion. The advantage of constraining the optimization within a power budget is of great importance for low-power CMOS. As examples we show the optimization results obtained with LIT, resulting in significant power savings, for the design of a two-stage Miller operational amplifier.
Application of Reinforcement Learning in Development of a New Adaptive Intelligent Traffic Shaper
Authors: Iman Shames, Nima Najmaei, Mohammad Zamani, A. A. Safavi
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

In this paper, we have taken advantage of reinforcement learning to develop a new traffic shaper in order to obtain a reasonable utilization of bandwidth while preventing traffic overload in other part of the network and as a result, reducing total number of packet dropping in the whole network.. We used a modified version of Q-learning in which a combination of neural networks keeps the data of Q-table in order to make the operation faster while keeping the required storage as small as possible. This method shows satisfactory results in simulations from the aspects of keeping dropping probability low while injecting as many packets as possible into the network in order to utilize the free bandwidth as much as possible. On the other hand the results show that the system can perform in situations that are not originally designed to act in.
On whitespace and stability in physical synthesis
Authors: Saurabh N. Adya, Igor L. Markov, Paul G. Villarrubia
Venue: Integration, the VLSI Journal (2006)

In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible gate sizing, net buffering and detail placement require a certain amount of unused space in every region of the die. The need for "local" whitespace is further emphasized by temperature and power-density limits as well as the increasing use of buffered interconnect. Another requirement, the stability of placement results from run to run, is important to the convergence of physical synthesis loops. Indeed, logic re-synthesis targeting local congestion in a given placement or particular critical paths may be irrelevant for another placement produced by the same or a different layout tool.In this work we offer solutions to the above problems. We show how to tie the results of a placer to a previously existing placement, and yet leave room for optimization. In our experiments this technique produces placements with similar congestion maps. We also show how to trade off wirelength for routability by manipulating whitespace. Empirically, our techniques improve circuit delay of sparse layouts in conjunction with physical synthesis. Our proposed techniques can be implemented using existing commercial placement tools without source code modifications and with modest overhead. They can also be integrated directly into min-cut placers with negligible overhead. We consider in particular detail the problem of scaling existing IP blocks to increase their porosity. Indeed, the need for additional repeater insertion when migrating a block to a newer process node often implies re-optimizing the layout. Our techniques for achieving placement stability allow one to rescale an existing layout with different minimum local whitespace requirements. In contrast to current ECO techniques, our rescaling method is not restricted to small changes of the netlist and layout, but will attempt to keep the relative placements similar if that is possible.
Acoustic propagation considerations for underwater acoustic communications network development
Authors: James Preisig
Venue: Proceedings of the 1st ACM international workshop on Underwater networks (2006)

Underwater acoustic communications systems are significantly challenged by the acoustic propagation characteristics of the underwater environment. There are a wide range of physical processes that impact underwater acoustic communications and the relative importance of these processes are different in different environments. In this paper some relevant propagation phenomena are described in the context of how they impact the development and/or performance of underwater acoustic communications networks. The speed of sound and channel latency, absorption and spreading losses, waveguide effects and multipath, surface scattering, bubbles, and ambient noise are all briefly discussed.
Geospatial Anchoring of Encyclopedia Articles
Authors: Wolfgang Kienreich, Michael Granitzer, Mathias Lux
Venue: Proceedings of the conference on Information Visualization (2006)

An encyclopedia provides a written compendium of knowledge consisting of articles concisely and exhaustively covering topics of interest. Most general encyclopedias are structured in an alphabetical manner and favor keyword queries and link-based navigation as the primary form of access. On closer examination, many encyclopedia articles can directly or indirectly be associated with geospatial references. This publication explores ways of anchoring encyclopedia articles to geospatial references and presents a web-based 3D interface which allows navigation of the German Brockhaus Encyclopedia through a geospatial metaphor.
Making multimedia meeting records more meaningful
Authors: W. Geyer, H. Richter, G. D. Abowd
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Meetings contain a large amount of rich project information that is often not documented. Capturing audio and video of a meeting can provide a comprehensive meeting record. However, finding detailed information in that record can be challenging because there is no structural information other than time to help the user navigate. This paper surveys various ways of creating indices into meeting records and introduces the notion of creating indices based upon user interaction with domain-specific artifacts. As an example, we present a prototype system that uses general team artifacts to provide meaningful pointers into the meeting record.
Managing Policy Updates in Security-Typed Languages
Authors: Nikhil Swamy, Michael Hicks, Stephen Tse, Steve Zdancewic
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

This paper presents RX, a new security-typed programming language with features intended to make the management of information-flow policies more practical. Security labels in RX, in contrast to prior approaches, are defined in terms of owned roles, as found in the RT rolebased trust-management framework. Role-based security policies allow flexible delegation, and our language RX provides constructs through which programs can robustly update policies and react to policy updates dynamically. Our dynamic semantics use statically verified transactions to eliminate illegal information flows across updates, which we call transitive flows. Because policy updates can be observed through dynamic queries, policy updates can potentially reveal sensitive information. As such, RX considers policy statements themselves to be potentially confidential information and subject to information-flow metapolicies.
Usability benchmarking case study: media downloads via mobile phones in the US
Authors: Richard Martin, Scott Weiss
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

In spring 2004 Usable Products Company set to study the shopping, purchase, and assignment process for mobile media (wallpaper, ring tones and games for mobile phones) in the US market. A large scale (200 initial interviews followed by an additional 60) study covering 5 major US carriers and 13 handsets was conducted between 2004 and 2005 to benchmark the usability of mobile media purchase process. In this paper, we describe the goals, procedures, timeline, and results of this project with particular focus on what changes were necessary to move from a formative to a normative usability testing process.
Combined 2D/3D Face Recognition Using Log-Gabor Templates
Authors: Jamie Cook, Chris McCool, Vinod Chandran, Sridha Sridharan
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

The addition of Three Dimensional (3D) data has the potential to greatly improve the accuracy of Face Recognition Technologies by providing complementary information. In this paper a new method combining intensity and range images and providing insensitivity to expression variation based on Log-Gabor Templates is presented. By breaking a single image into 75 semi-independent observations the reliance of the algorithm upon any particular part of the face is relaxed allowing robustness in the presence of occulusions, distortions and facial expressions. Also presented is a new distance measure based on the Mahalanobis Cosine metric which has desirable discriminatory characteristics in both the 2D and 3D domains. Using the 3D database collected by University of Notre Dame for the Face Recognition Grand Challenge (FRGC), benchmarking results are presented demonstrating the performance of the proposed methods.
Biomathematics Oriented Machine Learning System for Reconstructing Temporal Profiles of Biological or Clinical Markers
Authors: Ronen Tal-Botzer, Nir Hadaya, Rachel S. Levy-Drummer, Ariel Feiglin, David H. Shalom, Avidan U. Neumann
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Time series reconstruction algorithms are widely used to create temporal profiles from data series. However, in many clinical fields, e.g., viral kinetics, the data is noisy and sparse, making it difficult to use standard algorithms. We developed PROFILASE, which combines advanced multi-objective genetic algorithm search with machine learning architecture to harvest experts' decision-making considerations. Furthermore, PROFILASE implements additional scoring considerations, more biological in nature, thus further exploits domain expertise. We tested our system against a standard bottom-up algorithm by reconstruction of time series sparsely sampled with noise from simulated profiles. PROFILASE obtained RMS distance 2.5 fold lower (P\le0.0001) than the standard algorithm, 93% correct identification rate of segment number and 88% correct profile classification rate (versus 68%). The additional considerations were found to have a significant effect on the success of reconstruction. Finally, PROFILASE was generalized to evaluate additional considerations from different fields, thus allowing better understanding of other diseases.
Eclecticism shrinks even small worlds
Authors: Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
Venue: Distributed Computing (2006)

We consider small world graphs as defined by Kleinberg (2000), i.e., graphs obtained from a d- dimensional mesh by adding links chosen at random according to the d-harmonic distribution. In these graphs, greedy routing performs in O (log2 n) expected number of steps. We introduce indirect-greedy routing. We show that giving O(log2 n) bits of topological awareness per node enables indirect-greedy routing to perform in O(log1+1/d n) expected number of steps in d-dimensional augmented meshes. We also show that, independently of the amount of topological awareness given to the nodes, indirect-greedy routing performs in Ω(log1+1/d n) expected number of steps. In particular, augmenting the topological awareness above this optimum of O(log2 n) bits would drastically decrease the performance of indirect-greedy routing.Our model demonstrates that the efficiency of indirect-greedy routing is sensitive to the "world's dimension," in the sense that high dimensional worlds enjoy faster greedy routing than low dimensional ones. This could not be observed in Kleinberg's routing. In addition to bringing new light to Milgram's experiment, our protocol presents several desirable properties. In particular, it is totally oblivious, i.e., there is no header modification along the path from the source to the target, and the routing decision depends only on the target, and on information stored locally at each node.
Prospects for a Kantian Machine
Authors: Thomas M. Powers
Venue: IEEE Intelligent Systems (2006)

Rule-based ethical theories like Kant's appear to be promising for machine ethics because of thecomputational structure of their judgments. Kant's categorical imperative is a procedure for mapping actionplans (maxims) onto traditional deontic categories--forbidden, permissible, obligatory--by a simpleconsistency test on the maxim. This test alone, however, would be trivial. We might enhance it by adding adeclarative set of "buttressing" rules. The ethical judgment is then an outcome of the consistency test, inlight of the supplied rules. While this kind of test can generate nontrivial results, it might do no morethan reflect the prejudices of the builder of the declarative set; the machine will "reason"straightforwardly, but not intelligently. A more promising (though speculative) option would be to build amachine with the power of nonmonotonic inference. But this option too faces formal challenges. The authordiscusses these challenges to a rule-based machine ethics, starting from a Kantian framework. This article is part of a special issue on Machine Ethics.
Sensitivity analysis of network reliability using monte carlo
Authors: G. Rubino
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We analyze the computation of sensitivities in network reliability analysis. The associated models are graphs whose components are weighted by probabilities (their reliabilities) and they are widely used, for instance, in the design of communication networks. The paper deals with the sensitivities of usual reliability network metrics, with respect to the reliabilities of the components. The importance of sensitivities in this context is discussed and it is shown how to efficiently estmate the vector of sensitivities using Monte Carlo procedures. A first result allows to evaluate sensitivities using the standard Monte Carlo approach. A second method is then presented to deal efficiently with the rare event case. The ideas presented here can be applied to other classes of reliability problems and/or methods.
An Automated Digital Sound Recording System: The Amphibulator
Authors: Mark E. Cambron, Richard G. Bowker
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Automated digital recording systems are important for studying and monitoring wildlife. Here we describe a new recording system, easily programmable and highly flexible, designed to control the Marantz Professional Solid State Recorder PMD 660. The system is currently being used to monitor the effects of global warming on populations of several species of amphibians in Spain and Portugal, to describe the acoustic landscape and bird populations in western Kentucky, and to study behavioral calls of midwife toads in central and northern Spain.
Realization of Low-Cost IMU/GPS Integrated Navigation System
Authors: Min Yu, Hang Guo, Weiguang Gao
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

The paper focuses on the IMU (Inertial Measurement Unit)/GPS (Global Position System) integrated navigation system data processing methods. Firstly, the IMU error equations in the earth fixed coordinates are introduced. Then, a fading Kalman filter is simply introduced and its shortcomings are analyzed. Further, an adaptive filter is applied in low-cost IMU/GPS integrated navigation system, in which the adaptive factor is constructed based on the predicted residuals. Finally, a practical example is given. The results have shown that the adaptive filter is valid and reliable when applied in IMU/GPS integrated navigation system.
Dynamic Adaptive Frequency Hopping for Mutually Interfering Wireless Personal Area Networks
Authors: Petar Popovski, Hiroyuki Yomo, Ramjee Prasad
Venue: IEEE Transactions on Mobile Computing (2006)

As the Wireless Personal Area Network (WPAN) gets utilized by more individuals, the interference that collocated WPANs cause to each other, termed self-interference, will be one of the major sources that degrade WPAN's communication performance. The conventional Adaptive Frequency Hopping (AFH) strategies avoid frequency-static interference by reducing the hopset, but this deteriorates the performance if there is also self-interference. In this paper, we propose Dynamic AFH (DAFH) mechanisms that are concurrently employed by collocated WPANs in order to avoid the self-interference. With DAFH, WPAN adaptively self-allocates a subset of frequency channels to be hopped, such as to minimize the experienced interference. The packet error rate is the only input to the proposed mechanisms, which enables DAFH to also avoid interference from frequency-static interferer. The optimization of the throughput should not be the sole target of the DAFH because WPAN operates in unlicensed spectrum and arbitrary adaptation of the FH pattern may be harmful to proximate non-WPAN devices. Therefore, we define and adopt an etiquette rule to characterize the behavior of the collocated WPANs with DAFH as a single collective entity that produces interference. The operation of DAFH is robust and adaptive to the dynamic changes in the environment and to the noise errors in the channel. Simulation results show that DAFH significantly increases the throughput of the WPANs in presence of both self-interference and frequency-static interference, while the WPANs employ best effort to minimize changes in the overall interference pattern.
A maximum likelihood approach to temporal factor analysis in state-space model
Authors: Yiu-ming Cheung
Venue: Signal Processing (2006)

Paper [L. Xu, Temporal BYY learning for state space approach, hidden Markov model and blind source separation, IEEE Trans. Signal Process. 48 (7) (2000) 2132-2144] has presented a temporal factor analysis (TFA) algorithm in state-space model through minimizing an approximate Kullback-divergence cost function. In this paper, we further study the TFA within the maximum-likelihood (ML) framework. Without using any approximation technique, we build a connection between TFA and a traditional filtering problem in control theory, through which a new adaptive TFA algorithm is proposed. This algorithm utilizes the Kalman filter to optimally estimate the states and its covariance matrix, meanwhile using gradient-based method to tune the other model parameters. Furthermore, without taking the measurement noise into account, we further propose a variant of the algorithm and analyze its solution properties accordingly. The numerical simulations have shown promising results.
Modeling and Performance Evaluation of 3G CDMA Networks with Beamforming
Authors: D. J. Shyy, Jin Yu, Yu-Dong Yao
Venue: Wireless Personal Communications: An International Journal (2006)

The second generation (2G) code-division multiple access (CDMA) IS-95A cellular network has been deployed for almost ten years. Although the system design rules and operating procedures for voice services are well established and understood, these rules and procedures need to be re-examined in light of several technology innovations. These innovations include the launch of third generation (3G) cdma2000 1× high-rate data services and the new research results in interference cancellation, antenna array and multiple-input multiple-output (MIMO) technologies.We have built a 3G cdma2000 1× cellular simulator, which simulates the physical layer using MATLAB and networking layers using OPNET Modeler, to investigate various design issues of cdma2000 1× networks. This paper explores the use of a simple beamforming model and investigates the effectiveness of deploying antenna array techniques in cdma2000 1× networks. The capacity improvement for CDMA networks using antenna array techniques is evaluated under different deployment scenarios (voice versus data services and various number of antenna elements). Based on the performance evaluation results it is proposed to utilize beamforming as one of the elements in quality of service (QOS) provisioning for data services and to couple antenna arrays with dynamic soft handoff threshold adjustment for further improvement in the system capacity.
Robust Visual Tracking Using Case-Based Reasoning with Confidence
Authors: Zhiwei Zhu, Wenhui Liao, Qiang Ji
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

The paper describes a simple but robust framework for visual object tracking in a video sequence. Compared with the existing tracking techniques, our proposed tracking technique has two significant contributions. First, a Case- Based Reasoning (CBR) paradigm is introduced to track the non-rigid object robustly under significant appearance changes without drifting away. Second, it can provide an accurate confidence measurement for each tracked object so that the tracking failures can be identified successfully. Specifically, under this framework, the appearance changes of the object being tracked can be adapted dynamically during tracking via an adaption mechanism of CBR. Hence, an accurate 2D tracking model can be maintained online for each image frame during tracking. Therefore, the proposed tracking technique possesses a self-recovery capability so that the object can be tracked robustly under significant appearance changes without error accumulation. Application was focused on the development of a real-time face tracking system. Via the proposed framework, the built real-time face tracker can track the human face robustly at 26 frames per second under various face orientations, significant facial expression and external illumination changes.
Status packet deprecation and store-forward routing in AUSNet
Authors: Matt Haag, Emmanuel Agu, Rick Komerska, Steven G. Chappell, Radim Bartovš
Venue: Proceedings of the 1st ACM international workshop on Underwater networks (2006)

AUSNet is a functional network of autonomous undersea vehicles. We present two novel algorithms to enhance AUSNet. In live in-water testing, a packet queueing problem in which stale status packets accummulated while AUVs were out of transmission range, was discovered. A replace-and-hold algorithm was designed to replace stale status packets. A store-and-forward feature using data shuttles between disjoint network partitions, is also proposed. Both algorithms were evaluated in a time-driven simulator. The replace-and-hold method showed bandwidth usage improvements of 48% for a typical AUV scenario and improved performance even when nodes remained connected. Multiple store-and-forward models were compared and showed varying levels of improvement.