ppxscal/embedding_network huggingface dataset:
Low-overhead circuit synthesis for temperature adaptation using dynamic voltage scheduling
Authors: Swaroop Ghosh, Swarup Bhunia, Kaushik Roy
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Increasing power density causes die overheating due to limited cooling capacity of the package. Conventional thermal management techniques e.g. logic shutdown, clock gating, frequency scaling, simultaneous voltage-frequency tuning etc. increase the design complexity and/or degrade the performance significantly. In this paper, we propose a novel design technique, which makes a circuit amenable to temperature adaptation using dynamic voltage scheduling (DVS). It is accomplished by a synthesis technique that (a) isolates and predicts the set of paths that may become critical under variations, (b) ensures they are activated rarely, and (c) tolerates possible delay failures (at reduced voltage) in these paths by adaptive clock stretching. This allows us to schedule a lower supply voltage during increased temperature without requiring frequency tuning. Simulation results on an example pipeline show that proposed design yields similar temperature reduction as conventional design with only 11% performance penalty and 14% area overhead. The conventional pipeline design, on contrary, leads to 50% performance degradation due to reduced operating frequency.
Approximating total flow time on parallel machines
Authors: Stefano Leonardi, Danny Raz
Venue: Journal of Computer and System Sciences (2007)

We consider the problem of optimizing the total flow time of a stream of jobs that are released over time in a multiprocessor setting. This problem is NP-hard even when there are only two machines and preemption is allowed. Although the total (or average) flow time is widely accepted as a good measurement of the overall quality of service, no approximation algorithms were known for this basic scheduling problem. This paper contains two main results. We first prove that when preemption is allowed, Shortest Remaining Processing Time (SRPT) is an O(log(min{nm,P})) approximation algorithm for the total flow time, where n is the number of jobs, m is the number of machines, and P is the ratio between the maximum and the minimum processing time of a job. We also provide an @W(log(nm+P)) lower bound on the (worst case) competitive ratio of any randomized algorithm for the on-line problem in which jobs are known at their release times. Thus, we show that up to a constant factor SRPT is an optimal on-line algorithm. Our second main result addresses the non-preemptive case. We present a general technique that allows to transform any preemptive solution into a non-preemptive solution at the expense of an O(nm) factor in the approximation ratio of the total flow time. Combining this technique with our previous result yields an O(nmlognm) approximation algorithm for this case. We also show an @W(n^1^3^-^@e) lower bound on the approximability of this problem (assuming P
Designing SMS applications for public transport service system in Singapore
Authors: Szu-Lin Su, H. K. Garg
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Short Message Service (SMS) in wireless systems provides the capability of limited-size data messages to subscriber's cellular phone. And the development of value added services based upon the GSM standard is becoming increasingly important to both network operators and the subscribers to such networks. This paper outlines a wireless service system capable of providing real time information of the public transport service system in Singapore. The system allows a subscriber to the service to receive travel information on demand. primarily by means of short messages delivered to their GSM mobile phone. Most importantly. this system integrates bus and mass rapid transit information together in contrast to the existing SMS service on bus guide by SingTel, a leading telecom company in Singapore where it only provides bus information. The system also provides bus arrival information that allows a subscriber to acquire the arrival times of bus services at a bus stop. In addition, a subscriber is able to flag a bus through SMS while on the way to the bus stop and while a subscriber is reaching a particular bus stop, he/she will be alerted through SMS by the system. In this paper, a working prototype is designed to realise all possible factors of the system.
The virtual processor: fast, architecture-neutral dynamic code generation
Authors: Ian Piumarta
Venue: Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3 (2004)

Tools supporting dynamic code generation tend too be low-level (leaving much work to the client application) or too intimately related with the language/system in which they are used (making them unsuitable for casual reuse). Applications or virtual machines wanting to benefit from runtime code generation are therefore forced to implement much of the compilation chain for themselves even when they make use of the available tools. The VPU is an fast, high-level code generation utility that performs most of the complex tasks related to code generation, including register allocation, and which produces good-quality C ABI-compliant native code. In the simplest cases, adding VPU-based runtime code generation to an application requires just a few lines of additional code--and for a typical virtual machine, VPU-based just-in-time compilation requires only a few lines of code per virtual instruction.
Hardware/Firmware Verification of Graphic IP
Authors: Kamdem Romain
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

This paper describes methods and simulation techniques used to verify the functional correctness of a Flexible Video Processing Engine IP1. The verification environment relies on co-simulation of the RTL IP under-design with Functional Building Blocks2, developed using SystemC constructs. We try here to assess a number of problems encountered during the verification of complex IPs such as flexibility of functions, simulation speed and performance.
Longitudinal Study of Mobile Technology Adoption: Evolution at Work
Authors: Elaine Lawence, Michael Er
Venue: Proceedings of the First International Conference on the Digital Society (2007)

Workplaces are changing as new technologies are introduced in an effort to improve efficiency and increase business turnover. Although there has been an explosion of mobile technologies and devices in recent time, very few in situ studies of the adoption of these technologies have been undertaken. This paper reports on the results of a longitudinal case study of a business over a six year period as a knowledge worker shifted from Australia to the USA and then to England. It outlines how the company moved from paper based systems to an online system and finally to a mobile commerce system. The authors have used Mobile Informatics to analyze the use of mobile devices in particular settings and low end disruption theory to assist in the interpretation of the data.
Examining Glacier Mass Balances with a Hierarchical Modeling Approach
Authors: Uma S. Bhatt, Jing Zhang, Craig S. Lingle, Lisa M. Phillips, Wendell V. Tangborn
Venue: Computing in Science and Engineering (2007)

The results of simulating past and future mass balances suggest that the Bering Glacier will lose significant ice mass and that the Hubbard Glacier will grow more slowly in the near future than in the recent past.
Can a shape analysis work at run-time?
Authors: Jeff Bogda, Ambuj Singh
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

A shape analysis is a whole-program analysis that can identify run-time objects that do not need to be placed in the global heap and do not require any locking. Previous research has shown that these two optimizations can speed up some applications significantly. Unfortunately, since a shape analysis--like any whole-program analysis--requires a priori knowledge of the complete call graph, it has not been implemented in a JVM, which essentially builds the call graph as a program executes. In this paper, we adapt an efficient shape analysis to be incremental so that it can analyze an executing program. We investigate trade-offs regarding three approaches to performing the analysis inside a JVM and report results on a number of applications. Our measurements suggest that such an analysis may be viable if it uses results of previous executions and if it delays the initial analysis until the end of the first execution.
Robust Pose Estimation and Recognition Using Non-Gaussian Modeling of Appearance Subspaces
Authors: Torbjorn Vik
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We present an original appearance model that generalizes the usual Gaussian visual subspace model to non-Gaussian and nonparametric distributions. It can be useful for the modeling and recognition of images under difficult conditions such as large occlusions and cluttered backgrounds. Inference under the model is efficiently solved using the mean shift algorithm.
Smart headphones: enhancing auditory awareness through robust speech detection and source localization
Authors: S. Basu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We describe a method for enhancing auditory awareness by selectively passing speech sounds in the environment to the user. We develop a robust far-field speech detection algorithm for noisy environments and a source localization algorithm for flexible arrays. We then combine these methods to give a user control over the spatial regions from which speech will be passed through. Using this technique, we have implemented a "smart headphones" system in which a user can be listening to music over headphones and hear speech from specified directions mixed in. We show our preliminary results on the algorithms and describe initial user feedback about the system.
Make least privilege a right (not a privilege)
Authors: Maxwell Krohn, Petros Efstathopoulos, Cliff Frey, Frans Kaashoek, Eddie Kohler, David Mazières, Robert Morris, Michelle Osborne, Steve VanDeBogart, David Ziegler
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

Though system security would benefit if programmers routinely followed the principle of least privilege [24], the interfaces exposed by operating systems often stand in the way. We investigate why modern OSes thwart secure programming practices and propose solutions.
The technical, process, and business considerations for engineering design
Authors: L. Polizzotto
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

The Worcester Polytechnic Institute Electrical and Computer Engineering Department has added a new course, titled ECE Design, EE 2799. This course focuses on teaching students the process steps associated with designing new products, as well as the business implications of the decisions they make. During the course students not only learn about the business of engineering, but they also must apply the concepts of the class to the design and implementation of a working product prototype. As a consequence of the teaching approach, the course explicitly requires students to utilize material learned in other courses in order to successfully complete their project. By offering this course early in the sophomore year, students are able to clearly see the relationships between courses and can identify and correct deficiencies in their academic background. In addition, the fundamentals learned prepare the students to tackle their senior major qualifying project (MQP), thus enhancing their capstone design experience.
Search, replication and grouping for unstructured p2p networks
Authors: Nicholas Roussopoulos
Venue:  (2006)

In my dissertation, I present a suite of protocols that assist in efficient content location and distribution in unstructured Peer-to-Peer overlays. The basis of these schemes is their ability to learn from past interactions, increasing their performance with time. Peer-to-Peer (P2P) networks are gaining increasing attention from both the scientific and the large Internet user community. Popular applications utilizing this new technology offer many attractive features to a growing number of users. P2P systems have two basic functions: Content search and dissemination. Search (or lookup) protocols define how participants locate remotely maintained resources. In data dissemination, users transmit or receive content from single or multiple sites in the network. P2P applications traditionally operate under purely decentralized and highly dynamic environments. Unstructured systems represent a particularly interesting class of P2P networks. Peers form an overlay in an ad-hoc manner, without any guarantees relative to lookup performance or content availability. Resources are locally maintained, while participants have limited knowledge, usually confined to their immediate neighborhood in the overlay. My work aims at providing effective and bandwidth-efficient searching and data sharing. A suite of algorithms which provide peers in unstructured P2P overlays with the state necessary in order to efficiently locate, disseminate and replicate objects is presented. The Adaptive Probabilistic Search (APS) scheme utilizes directed walkers to forward queries on a hop-by-hop basis. Peers store success probabilities for each of their neighbors in order to efficiently route towards object holders. AGNO performs implicit grouping of peers according to the demand incentive and utilizes state maintained by APS in order to route messages from content holders towards interested peers, without requiring any subscription process. Finally, the Adaptive Probabilistic REplication (APRE) scheme expands on the state that AGNO builds in order to replicate content inside query intensive areas according to demand.
Haptic Models of an Automotive Turn-Signal Switch: Identification and Playback Results
Authors: Mark B. Colton, John M. Hollerbach
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Creating accurate haptic models of physical devices is critical to improving the realism and immersiveness of virtual environments. This paper addresses the problem of modeling the feel of an automotive turnsignal switch, a prototypical device chosen for its strongly nonlinear dynamic behavior. Parameters of a position- and direction-dependent nonlinear impedance model are estimated from experimental data using a modified version of the exponentiallyweighted least-squares (EWLS) algorithm. The method is then validated through playback experiments in which subjects rate the realism of the resulting models.
Towards a Theoretical Model for Software Growth
Authors: Israel Herraiz, Jesus M. Gonzalez-Barahona, Gregorio Robles
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

Software growth (and more broadly, software evolution) is usually considered in terms of size or complexity of source code. However in different studies, usually different metrics are used, which make it difficult to compare approaches and results. In addition, not all metrics are equally easy to cal- culate for a given source code, which leads to the ques- tion of which one is the easiest to calculate without losing too much information. To address both issues, in this pa- per present a comprehensive study, based on the analysis of about 700,000 C source code files, calculating several size and complexity metrics for all of them. For this sample, we have found double Pareto statistical distributions for all metrics considered, and a high correlation between any two of them. This would imply that any model addressing soft- ware growth should produce this Pareto distributions, and that analysis based on any of the considered metrics should show a similar pattern, provided the sample of files consid- ered is large enough.
Phighting the Phisher: Using Web Bugs and Honeytokens to Investigate the Source of Phishing Attacks
Authors: Craig M. McRae, Rayford B. Vaughn
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper presents a summary of research findings for a new reacitve phishing investigative technique using web bugs and honeytokens. Phishing has become a rampant problem in today's society and has cost financial institutions millions of dollars per year. Today's reactive techniques against phishing usually involve methods that simply minimize the damage rather than attempting to actually track down a phisher. Our research objective is to track down a phisher to the IP address of the phisher's workstation rather than innocent machines used as intermediaries. By using web bugs and honeytokens on the fake web site forms the phisher presents, one can log accesses to the honeytokens by the phisher when the attacker views the results of the forms. Research results to date are presented in this paper.
Mobility management in hybrid ad-hoc networks and the Internet environment: Research Articles
Authors: M. K. Denko
Venue: Concurrency and Computation: Practice Experience (2007)

The integration of mobile ad-hoc networks (MANETs) with the Internet provides flexible and multi-hop communication capability in hybrid wired and wireless networks. Existing architectures for integrating these networks use Mobile IP and ad-hoc routing protocols with fixed gateways. In this paper, we propose a mobility management scheme based on a mobile gateways (MGs) architecture. We designed a buffering mechanism for micro- and macro-mobility management in hybrid networks. The performance of mobility management with optimized handover (MM-OH), optimized handover with prediction (MM-OHP) and forced handover (MM-FH) are evaluated using simulation. Our simulation results show that a buffering mechanism coupled with the hybrid gateway discovery results in a higher packet delivery ratio for MM-OH and MM-OHP compared with the MM-FH scheme. The MM-OHP scheme has a lower number of handovers compared with the MM-OH scheme. Moreover, the simulation experiments reveal that the speed of the MG has a relatively higher impact on performance than the speed of mobile nodes. Copyright &copy; 2007 John Wiley & Sons, Ltd.
On the Efficiency and Cost of Introducing QoS in BitTorrent
Authors: Nazareno Andrade, Jaindson Santana, Francisco Brasileiro, Walfredo Cirne
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

BitTorrent is currently a de facto standard for scalable content-distribution. However, its peer-to-peer model for resource allocation does not provide high availability and its performance depends on best-effort contributions given by peers. This has motivated several content-providers to use a hybrid model in which they operate a superpeer in order to attain a higher quality of service. In this paper, we use BitTorrent traces and analytical modelling to inves- tigate the cost incurred by such an entity in relation to the benefits it can provide to the system.
Gate-level modelling and verification of asynchronous circuits using CSPM and FDR
Authors: Mark B. Josephs
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

FDR (Failures-Divergences Refinement) is a tool for verifying properties of processes expressed in a machinereadable dialect of CSP (CSPM). This paper shows how to model asynchronous logic blocks as processes in CSPM and how to verify them using FDR: processes abstract away from the speed of the blocks; multi-way synchronization facilitates the modelling of isochronic forks; receptiveness is formalised as an assertion for FDR to check; process transformations allow one to model transmission lines and handshaking ports. A process parameterised by a Boolean function suffices to model any complex gate; another such process models N-way mutual exclusion. The approach is illustrated on a variety of asynchronous circuits drawn from the literature.
Efficient algorithms and architectures for turbo and ldpc based systems
Authors: Chaitali Chakrabarti
Venue:  (2006)

Channel codes based on iterative decoding such as Turbo codes and low density parity check (LDPC) codes have performance that is close to the Shannon limit. The superior performance of these codes, however, comes with an increase in implementation complexity, decoding latency, and memory overhead. The work presented in this dissertation addresses several issues in the efficient hardware (VLSI and DSP processor based) implementation of Turbo and LDPC coders. In the design of high throughput Turbo decoders, multiple windows are processed simultaneously by using the sliding window (SW) approach. An optimal memory sub-banking scheme that supports the SW approach is presented. Next, energy-scalable Turbo code decoding algorithms for a Space-Time coded system are derived. The algorithms are evaluated in terms of BER performance and energy consumption. This enables us to select the appropriate algorithm based on different energy and quality requirement. A high throughput architecture for the LDPC decoder is also presented. The throughput is doubled by designing circulant matrix based LDPC code that has more than one shifted identity matrix in the sub-matrices. Finally, a general design flow for the architecture-aware LDPC code/decoder co-design is proposed. The architectural features of a DSP processor based software define radio (SDR) platform are formally characterized and turned into constraints in the code design stage. Two case studies are conducted, namely, interconnection-aware code design and memory-traffic aware code design. The results show that in both cases, the architecture-aware code can be decoded with much higher efficiency in the target architecture compared with the random generated counterpart without performance loss.
Acquiring and Revising Preferences in a Critique-Based Mobile Recommender System
Authors: Francesco Ricci, Quang Nhat Nguyen
Venue: IEEE Intelligent Systems (2007)

Personalized product recommendations, generated by e-commerce recommender systems, can provide helpful information and decision support when users are overwhelmed by product alternatives. Although many successful Web-based recommender systems have been deployed, only a few have been designed for mobile users. Researchers at the Free University of Bozen-Bolzano created a critique-based recommendation methodology and applied it to the acquisition and revision of user preferences in a mobile recommender system. The approach has been implemented in a system that helps on-the-go travelers select their desired travel products. Results from user evaluations validated the system's functionality and usability. This article is part of a special issue on Recommender Systems.
Grid-enabled evolutionary algorithm application in the mechanical optimization problems
Authors: Wacław Ku
Venue: Engineering Applications of Artificial Intelligence (2007)

The application of evolutionary algorithms to the optimization problems is presented in the paper. The Alchemi grid framework is used during computations. The fitness function is evaluated by using finite-element method. The numerical examples and speedup measurements for a different number of processors are shown.