ppxscal/embedding_network huggingface dataset:
Efficient and scalable compiler-directed energy optimization for realtime applications
Authors: Po-Kuan Huang, Soheil Ghiasi
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

We present a compilation technique that targets realtime applications running on embedded processors with combined dynamic voltage scaling (DVS) and adaptive body biasing (ABB) capabilities. Considering the delay and energy penalty of switching between operating modes of the processor, our compiler judiciously inserts mode switch instructions in selected locations of the code and generates executable binary that is guaranteed to meet the deadline constraint. More importantly, our algorithm runs very fast and comes reasonably close to the theoretical limit of energy optimization using DVS+ABB. At 65 nm technology, we improve the energy dissipation of the generated code by an average of 11.4% under deadline constraints. While our technique's improvement in energy dissipation over conventional DVS is marginal (3%) at 130nm, the average improvement continues to grow to 4.7%, 8.8% and 15.4% for 90nm, 65nm and 45nm technology nodes, respectively. Compared to a recent ILP-based competitor, we improve the runtime by more than three orders of magnitude, while producing improved results.
Efficient numerical algorithms for surface formulations of mathematical models for biomolecule analysis and design
Authors: Jacob K. White, Bruce Tidor
Venue:  (2006)

This thesis presents a set of numerical techniques that extend and improve computational modeling approaches for biomolecule analysis and design. The presented research focuses on surface formulations of modeling problems related to the estimation of the energetic cost to transfer a biomolecule from the gas phase to aqueous solution. The thesis discusses four contributions to modeling biomolecular interactions. First, the thesis presents an approach to allow accurate discretization of the most prevalent mathematical definitions of the biomolecule-solvent interface; also presented are a number of accurate techniques for numerically integrating possibly singular functions over the discretized surfaces. Such techniques are essential for solving surface formulations numerically. The second part of the thesis presents a fast multiscale numerical algorithm, FFTSVD, that efficiently solves large boundary-element method problems in biomolecule electrostatics. The algorithm synthesizes elements of other popular fast algorithms to achieve excellent efficiency and flexibility. The third thesis component describes an integral-equation formulation and boundary-element method implementation for biomolecule electrostatic analysis. The formulation and implementation allow the solution of complicated molecular topologies and physical models. Furthermore, by applying the methods developed in the first half of the thesis, the implementation can deliver superior accuracy for competitive performance. Finally, the thesis describes a highly efficient numerical method for calculating a biomolecular charge distribution that minimizes the free energy change of binding to another molecule. The approach, which represents a novel PDE-constrained methodology, builds on well-developed physical theory. Computational results illustrate not only the method's improved performance but also its application to realistic biomolecule problems. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
State of the art review of the existing soft computing based approaches to trust and reputation computation
Authors: Farookh Khadeer Hussain, Elizabeth Chang, Omar Khadeer Hussain
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

In this paper we present a state of the art review of the soft computing based approaches for trust and reputation computation. We divide the soft computing based approaches for trust and reputation computation into five different classes. Each of the five different classes is discussed in this paper.
Performance analysis of two approaches to closed loop system identification via cyclic spectral analysis
Authors: C. Tontiruttananon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The problem of closed loop system identification given noisy time-domain input-output measurements is considered. It is assumed that the various disturbances affecting the system are zero-mean stationary whereas the closed loop system operates under an external cyclostationary input which is not measured. Noisy measurements of the (direct) input and output of the plant are assumed to be available. The closed loop system must be stable but it is allowed to be unstable in the open loop. Tontiruttananon and Tugnait (1998) proposed two identification algorithms using cyclic-spectral analysis asymptotic performance analysis of the previously proposed parameter estimators. Computer simulation examples are presented in support of the analysis.
Introducing linux file services into a windows NT network: a pilot program
Authors: Richard R. Morgan
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

This paper is a report on a pilot program to implement Linux and Samba as a file server in a telecommunications company of about 5,000 people. The intent of the pilot program was to demonstrate the feasibility and cost-effectiveness of using Linux servers in the enterprise, as well as to illustrate the seamless integration with Windows NT desktop clients that Samba can provide. We will review the computing environment, the reasons for certain choices in hardware and software, as well as the steps in the implementation process.
Adaptive control of virtualized resources in utility computing environments
Authors: Pradeep Padala, Kang G. Shin, Xiaoyun Zhu, Mustafa Uysal, Zhikui Wang, Sharad Singhal, Arif Merchant, Kenneth Salem
Venue: ACM SIGOPS Operating Systems Review (2007)

Data centers are often under-utilized due to over-provisioning as well as time-varying resource demands of typical enterprise applications. One approach to increase resource utilization is to consolidate applications in a shared infrastructure using virtualization. Meeting application-level quality of service (QoS) goals becomes a challenge in a consolidated environment as application resource needs differ. Furthermore, for multi-tier applications, the amount of resources needed to achieve their QoS goals might be different at each tier and may also depend on availability of resources in other tiers. In this paper, we develop an adaptive resource control system that dynamically adjusts the resource shares to individual tiers in order to meet application-level QoS goals while achieving high resource utilization in the data center. Our control system is developed using classical control theory, and we used a black-box system modeling approach to overcome the absence of first principle models for complex enterprise applications and systems. To evaluate our controllers, we built a testbed simulating a virtual data center using Xen virtual machines. We experimented with two multi-tier applications in this virtual data center: a two-tier implementation of RUBiS, an online auction site, and a two-tier Java implementation of TPC-W. Our results indicate that the proposed control system is able to maintain high resource utilization and meets QoS goals in spite of varying resource demands from the applications.
Information and higher things in life: Addressing the pleasurable and the profound in information science
Authors: Jarkko Kari, Jenna Hartel
Venue: Journal of the American Society for Information Science and Technology (2007)

The article discusses lower and higher contexts for information phenomena, and argues that there is clearly a need for a more concerted research effort in the latter sphere. The discipline of information science has traditionally favored lower contexts&mdash;like everyday life and problem solving&mdash;that are neutral or even negative by nature. In contrast, the neglected higher things in life are pleasurable or profound phenomena, experiences, or activities that transcend the daily grind. A literature sample of the scarce information research related to higher things indicates that beyond the spotlight of mainstream research, information processes often seem different and there may be significant dimensions of information phenomena that have been overlooked. Therefore, the article outlines a contextual research area in information studies to address higher things from the perspective of information. It is concluded that optimal functioning requires bringing the lower and higher sides to balance in information science. This would offer a rare chance to promote holism and interdisciplinarity in the field, and to make the discipline more relevant to the human being. &copy; 2007 Wiley Periodicals, Inc.
A comparison of usability between voting methods
Authors: Kristen K. Greene, Michael D. Byrne, Sarah P. Everett
Venue: Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop (2006)

In order to know if new electronic voting systems truly represent a gain in usability, it is necessary to have information about the usability of more traditional voting methods. The usability of three different voting methods was evaluated using the metrics recommended by the National Institute of Standards and Technology: efficiency, effectiveness, and satisfaction. Participants voted with two different types of paper-based ballots (one open-response ballot and one bubble ballot) and one mechanical lever machine. No significant differences in voting completion times or error rates were found between voting methods. However, large differences in satisfaction ratings indicated that participants were most satisfied with the bubble ballot and least satisfied with the lever machine. These data are an important step in addressing the need for baseline usability measures for existing voting systems.
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
Authors: Zeev Dvir, Amir Shpilka
Venue: SIAM Journal on Computing (2006)

In this work we study two, seemingly unrelated, notions. Locally decodable codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of the codeword. Polynomial identity testing (PIT) is one of the fundamental problems of algebraic complexity: we are given a circuit computing a multivariate polynomial and we have to determine whether the polynomial is identically zero. We improve known results on LDCs and on polynomial identity testing and show a relation between the two notions. In particular we obtain the following results: (1) We show that if $E: \mathbb{F}^n \mapsto \mathbb{F}^m$ is a linear LDC with two queries, then $m = \exp(\Omega(n))$. Previously this was known only for fields of size $\ll 2^n$ [O. Goldreich &etal;, Comput. Complexity, 15 (2006), pp. 263-296]. (2) We show that from every depth 3 arithmetic circuit ($\Sigma\Pi\Sigma$ circuit), ${\cal C}$, with a bounded (constant) top fan-in that computes the zero polynomial, one can construct an LDC. More formally, assume that ${\cal C}$ is minimal (no subset of the multiplication gates sums to zero) and simple (no linear function appears in all the multiplication gates). Denote by $d$ the degree of the polynomial computed by ${\cal C}$ and by $r$ the rank of the linear functions appearing in ${\cal C}$. Then we can construct a linear LDC with two queries that encodes messages of length $r/{\operatorname{polylog}(d)}$ by codewords of length $O(d)$. (3) We prove a structural theorem for $\Sigma\Pi\Sigma$ circuits, with a bounded top fan-in, that compute the zero polynomial. In particular we show that if such a circuit is simple, minimal, and of polynomial size, then its rank, $r$, is only polylogarithmic in the number of variables (a priori it could have been linear). (4) We give new PIT algorithms for $\Sigma\Pi\Sigma$ circuits with a bounded top fan-in: (a) a deterministic algorithm that runs in quasipolynomial time, and (b) a randomized algorithm that runs in polynomial time and uses only a polylogarithmic number of random bits. Moreover, when the circuit is multilinear, our deterministic algorithm runs in polynomial time. Previously deterministic subexponential time algorithms for PIT in bounded depth circuits were known only for depth 2 circuits (in the black box model) [D. Grigoriev, M. Karpinski, and M. F. Singer, SIAM J. Comput., 19 (1990), pp. 1059-1063; M. Ben-Or and P. Tiwari, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1988, pp. 301-309; A. R. Klivans and D. Spielman, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, ACM Press, New York, 2001, pp. 216-223]. In particular, for the special case of depth 3 circuits with three multiplication gates our result resolves an open question asked by Klivans and Spielman.
Finite dimensional algorithms for the hidden Markov model multi-armed bandit problem
Authors: V. Krishnamurthy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

The multi-arm bandit problem is widely used in scheduling of traffic in broadband networks, manufacturing systems and robotics. This paper presents a finite dimensional optimal solution to the multi-arm bandit problem for hidden Markov models. The key to solving any multi-arm bandit problem is to compute the Gittins (1979, 1989) index. In this paper a finite dimensional algorithm is presented which exactly computes the Gittins index. Suboptimal algorithms for computing the Gittins index are also presented and experimentally shown to perform almost as well as the optimal method. Finally an application of the algorithms to tracking multiple targets with a single intelligent sensor is presented.
Revisiting the Open Plan: Ceilings and Furniture as Display Surfaces for Building Information
Authors: Mark Meagher, Jeffrey Huang, David Gerber
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

First developed by the architectural avante-garde in the early 20th century, the idea of the open plan was the result of a desire for greater transparency and flexibility in the design of interior environments. Essential to the functioning of the open plan in these early projects is the subtle articulation of differences between one part of the open interior and another. Later co-opted as an efficient means of achieving maximum density in office environments, the open plan as commonly practiced in the latter half of the 20th century resulted in undifferentiated, homogeneous settings that failed to realize the original intentions of this architectural idea. Embedded information technology offers an opportunity to support the differentiation and legibility of the open plan by sensing and displaying aspects of the building's environmental conditions and patterns of use. We introduce two ongoing projects as examples of building interfaces that enhance the transparency of information in the building, using surfaces embedded in the building to reveal invisible attributes of the interior that can be used by inhabitants to better understand their environment.
An asynchronous neighbor discovery algorithm for wireless sensor networks
Authors: Steven A. Borbash, Anthony Ephremides, Michael J. McGlynn
Venue: Ad Hoc Networks (2007)

We consider the problem of determining, in a distributed, asynchronous and scalable manner, what nodes are ''neighbors'' in a wireless network. Neighbor discovery is an important enabler of network connectivity and energy conservation. An asynchronous, probabilistic neighbor discovery algorithm is presented that permits each node in the network to develop a list of its neighbors, which may be incomplete. The algorithm is analyzed and parameter settings are derived which maximize the fraction of neighbors discovered in a fixed running time. A companion distributed algorithm is also described which allows all the nodes in the network to execute that neighbor discovery algorithm without the need to agree on a common start time.
"Do Like Me", "Do Like This": Creating Animations by Teaching a Virtual Human
Authors: Marc Salvati, Jeong Seung Zoo, Naoki Hashimoto, Makoto Sato
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

In this paper, we propose a new animation creation process, based on the teacher-student concept. You are the teacher and want to teach someone a performance. First you show the student how to perform an action, you tell him "do like me". Then you correct his posture by moving with hands his arms, his torso, feet position and so forth by saying to him "do like this". To show the virtual human a motion, the user use motion capture. He may check easily the result in a human scale immersive environment. Then he finds the part of the motion he wants to correct. He edits the motion with his hands like in the real world using a two-handed haptic device. Thus the user can perform motion editing in an intuitive and natural way, and achieve both actor performance and animator task in a unified environment.
Approximation Modeling for the Online Performance Management of Distributed Computing Systems
Authors: Dara Kusic, Nagarajan Kandasamy, Guofei Jiang
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

This paper develops a hierarchical control framework to solve performance management problems in distributed computing systems. To reduce the control overhead, concepts from approximation theory are used in the construction of the dynamical models that predict system behavior, and in the solution of the associated control equations themselves. Using a dynamic resource provisioning problem as a case study, we show that a computing system managed by the proposed control framework using approximation models realizes profit gains that are, in the best case, within 1% of a controller using an exact parametric model of the system.
Perceived Service Quality in a University Web Portal: Revising the E-Qual Instrument
Authors: Mary Tate, Joerg Evermann, Beverley Hope, Stuart Barnes
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Online service quality is a much-studied concept. Despite this, dimensions that make up service quality, and the items used to measure those dimensions have proven unstable. It is widely suggested that service quality measurement scales need to be instantiated differently in different business domains. In addition, the nature of online services is continually changing. Universities have been at the forefront of this change, with university websites increasingly acting as a portal for a wide range of on-line transactions for a wide range of stakeholders. In this work-in-progress, qualitative study, we conduct focus groups with a range of stakeholders in university web portals with a view to adapting the e-qual instrument for use in a university web portal environment. We find support for a new service quality dimension, and for additional items in existing scales. We conclude by proposing a revised instrument that can form the basis for a more extensive quantitative study.
Training Initiative for New Software/Enterprise Architects: An Ontological Approach
Authors: Anabel Fraga, Juan Llorens
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

In this paper, we describe the importance of new Software/Enterprise architects in the discipline of Software Architecture and Enterprise Architecture. Both are often idealized as super heroes with a lot of qualities that are very infrequent in contemporary people. The Enterprise/Software Architect role could be assumed by a group of people able to manage the qualities for the role. In any case, even a group or a single person must be educated in the discipline by training courses, new methodologies of learning, or traditional university studies. In order to improve the process of becoming a new architect we propose a methodology based on ontological structures and reinforcement learning.
Analysis, and optimization of a CMOS vertical thermal actuator
Authors: A. Mohamed, H. Elsimary, M. Ismail
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

An Electro-thermally and vertically driven MEMS actuator is analytically and practically examined which is based on the asymmetrical thermal expansion of the microstructure with the different shape of its beam. Analytical results are presented and compared with results obtained from finite element modeling (FEM). In previous work we introduced the use of such thermal actuator in micropositioning application to drive a variable capacitor as a part of an RF circuit. In this paper, issues related to the optimal design of the microstructure of the actuator are presented with its effect on the performance of the system, which lead to an improved design.
Statistical QoS Guarantee and Energy-Efficiency in Web Server Clusters
Authors: Luciano Bertini, J. C. B. Leite, Daniel Mosse
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

In this paper we study the soft real-time web cluster architecture needed to support e-commerce and related applications. Our testbed is based on an industry standard, which defines a set of web interactions and database transactions with their deadlines, for generating real workload and bench-marking e-commerce applications. In these soft real-time systems, the quality of service (QoS) is usually defined as the fraction of requests that meet the deadlines. When this QoS is measured directly, regardless of whether the request missed the deadline by an epsilon amount of time or by a large difference, the result is always the same. For this reason, only counting the number of missed requests in a period avoids the observation of the real state of the system. Our contributions are theoretical propositions of how to control the QoS, not measuring the QoS directly, but based on the probability distribution of the tardiness in the completion time of the requests. We call this new QoS metric Tardiness Quantile Metric (TQM). The proposed method provides fine-grained control over the QoS so that we can make a closer examination of the relation between QoS and energy efficiency. We validate the theoretical results showing experiments in a multi-tiered e-commerce web cluster implemented using only open-source software solutions.