ppxscal/embedding_network huggingface dataset:
Server-Level Power Control
Authors: Charles Lefurgy, Xiaorui Wang, Malcolm Ware
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

We present a technique that controls the peak power consumption of a high-density server by implementing a feedback controller that uses precise, system-level power measurement to periodically select the highest performance state while keeping the system within a fixed power constraint. A control theoretic methodology is applied to systematically design this control loop with analytic assurances of system stability and controller performance, despite unpredictable workloads and running environments. In a real server we are able to control power over a 1 second period to within 1 W. Additionally, we have observed that power over an 8 second period can be controlled to within 0.1 W. We believe that we are the first to demonstrate such precise control of power in a real server. Conventional servers respond to power supply constraint situations by using simple open-loop policies to set a safe performance level in order to limit peak power consumption. We show that closed-loop control can provide higher performance under these conditions and test this technique on an IBM BladeCenter HS20 server. Experimental results demonstrate that closed-loop control provides up to 82% higher application performance compared to open-loop control and up to 17% higher performance compared to a widely used ad-hoc technique.
Proposal for tactile sense presentation that combines electrical and mechanical stimulus
Authors: Shinobu Kuroki, Hiroyuki Kajimoto, Hideaki Nii, Naoki Kawakami, Susumu Tachi
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

This study proposes a combination of electrical and mechanical stimulation as a foundational method to realize a tactile display with a high temporal and spatial resolution. We further confirm the interaction between the electrical and mechanical stimulations. The interaction (1) lowers tactile threshold and (2) reduces the so-called "electrical" sensation. The results of this study may resolve certain practical difficulties with regard to electro-tactile displays.
SVDD-Based Pattern Denoising
Authors: Jooyoung Park, Daesung Kang, Jongho Kim, James T. Kwok, Ivor W. Tsang
Venue: Neural Computation (2007)

The support vector data description (SVDD) is one of the best-known one-class support vector learning methods, in which one tries the strategy of using balls defined on the feature space in order to distinguish a set of normal data from all other possible abnormal objects. The major concern of this letter is to extend the main idea of SVDD to pattern denoising. Combining the geodesic projection to the spherical decision boundary resulting from the SVDD, together with solving the preimage problem, we propose a new method for pattern denoising. We first solve SVDD for the training data and then for each noisy test pattern, obtain its denoised feature by moving its feature vector along the geodesic on the manifold to the nearest decision boundary of the SVDD ball. Finally we find the location of the denoised pattern by obtaining the pre-image of the denoised feature. The applicability of the proposed method is illustrated by a number of toy and real-world data sets.
Tcl extensions for network management applications
Authors: J. Schönwälder, H. Langendörfer
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

This paper presents extensions to the Tool Command Language (Tcl) that have been designed to implement network management applications. Using Tcl, we were able to make our network management applications highly extensible. Experience has shown that many useful applications can be written with a few lines of Tcl code. Site specific adaptations are possible at very low cost. We have used our extensions to implement smart network management agents that can receive and execute management scripts provided by other management stations or agents.
Multiple publication on a single research study: Does it pay? The influence of number of research articles on total citation counts in biomedicine
Authors: Lutz Bornmann, Hans-Dieter Daniel
Venue: Journal of the American Society for Information Science and Technology (2007)

Scientists may seek to report a single definable body of research in more than one publication, that is, in repeated reports of the same work or in fractional reports, in order to disseminate their research as widely as possible in the scientific community. Up to now, however, it has not been examined whether this strategy of &ldquo;multiple publication&rdquo; in fact leads to greater reception of the research. In the present study, we investigate the influence of number of articles reporting the results of a single study on reception in the scientific community (total citation counts of an article on a single study). Our data set consists of 96 applicants for a research fellowship from the Boehringer Ingelheim Fonds (BIF), an international foundation for the promotion of basic research in biomedicine. The applicants reported to us all articles that they had published within the framework of their doctoral research projects. On this single project, the applicants had published from 1 to 16 articles (M = 4; Mdn = 3). The results of a regression model with an interaction term show that the practice of multiple publication of research study results does in fact lead to greater reception of the research (higher total citation counts) in the scientific community. However, reception is dependent upon length of article: the longer the article, the more total citation counts increase with the number of articles. Thus, it pays for scientists to practice multiple publication of study results in the form of sizable reports. &copy; 2007 Wiley Periodicals, Inc.
Wavelet packet transforms for system-on-chip applications
Authors: S. Masud
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A methodology for the production of silicon cores for wavelet packet decomposition has been developed. The scheme utilizes efficient scalable architectures for both orthonormal and biorthgonal wavelet transforms. The cores produced from these architectures can be readily scaled for any wavelet function and are easily configurable for any subband structure. The cores are fully parameterized in terms of wavelet choice and appropriate wordlengths. Designs produced are portable across a range of silicon foundries as well as FPGA and PLD technologies. A number of exemplar implementations have been produced.
Using networked tools to enhance student success rates in large classes
Authors: E. Kashy
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

A two-year project to study and assess the use of technology to enhance student learning and performance is described. Preliminary results are encouraging and will serve to guide future direction of the project. The tools consist of an asynchronous learning network (ALN) for student assistance and of a networked software system to implement a computer-assisted personalized approach (CAPA) for assignments, quizzes, and examinations. The fraction of students performing well enough to achieve a grade of 2.5 or higher is our measure of success. The use of technology has permitted a reallocation of instructors' and teaching assistants' time, shifting it from repetitive jobs such as grading and record-keeping to tasks more directly related to student achievement. The prompt and accurate feedback which this technology provides can be used in large lecture courses in several ways to improve student success rates. Having information on students' performance and difficulties at an instructor's fingertips also provides an opportunity for problems to be addressed in a timely manner.
Secure object flow analysis for java card
Authors: Marc Éluard, Thomas Jensen
Venue: Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5 (2002)

The access control exercised by the Java Card firewall can be bypassed by the use of shareable objects. To help detecting unwanted access to objects, we propose a static analysis that calculates a safe approximation of the possible flow of objects between Java Card applets. The analysis deals with a subset of the Java Card byte-code focusing on aspects of the Java Card firewall, method invocation, field access, variable access, shareable objects and contexts. The technical vehicle for achieving this task is a new kind of constraints: quantified conditional constraints, that permits us to model precisely the effects of the Java Card firewall by only producing a constraint if the corresponding operation is authorized by the firewall.
Biologically inspired Self-Organized Blob Structures on Amorphous Computers
Authors: Moise Valvassori
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

In this paper, we present a biologically inspired selforganized implementation of the Blob structures on amorphous computers. Amorphous computers rely on asynchronous and spatially distributed processor sets where each processor broadcasts to communicate only with its local neighborhood. Blob machines are abstract parallel machines designed to exploit space. Our work-in-progress implementation relies on recruitment gradients to ensure the Blob consistency.
Distance-Based Segmentation: An Energy-Efficient Clustering Hierarchy for Wireless Microsensor Networks
Authors: N. Amini, M. Fazeli, S. G. Miremadi, M. T. Manzuri
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

This paper presents an energy-efficient communication protocol which distributes a uniform energy load to the sensors in a wireless microsensor network. This protocol, called Distance-Based Segmentation (DBS), is a clusterbased protocol that divides the entire network into equalarea segments and applies different clustering policies to each segment to reduce total energy dissipation and hence prolong the lifetime of the network. To evaluate the DBS protocol, a simulator was implemented using the MATLAB software. Simulation results show that the DBS can achieve as much as 16% reduction in total dissipated energy as compared with conventional protocols. In addition this protocol is able to distribute energy load more evenly among the sensors in the network, and hence yields up to 24% increase in the useful network lifetime. The DBS guarantees reliable and low-latency communications between sensor nodes by adding a mechanism to media access control (MAC) protocols.
Frequent Closed Sequence Mining without Candidate Maintenance
Authors: Jianyong Wang, Jiawei Han
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter leads to not only a more compact yet complete result set but also better efficiency. However, most of the previously developed closed pattern mining algorithms work under the candidate maintenance-and-test paradigm, which is inherently costly in both runtime and space usage when the support threshold is low or the patterns become long. In this paper, we present BIDE, an efficient algorithm for mining frequent closed sequences without candidate maintenance. It adopts a novel sequence closure checking scheme called BI-Directional Extension and prunes the search space more deeply compared to the previous algorithms by using the BackScan pruning method. A thorough performance study with both sparse and dense, real, and synthetic data sets has demonstrated that BIDE significantly outperforms the previous algorithm: It consumes an order(s) of magnitude less memory and can be more than an order of magnitude faster. It is also linearly scalable in terms of database size.
Congestion games with malicious players
Authors: Moshe Babaioff, Robert Kleinberg, Christos H. Papadimitriou
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

We study the equilibria of non-atomic congestion games in which there are two types of players: rational players, who seek to minimize their own delay, and malicious players, who seek to maximize the average delay experienced by the rational players. We study the existence of pure and mixed Nash equilibria for these games, and we seek to quantify the impact of the malicious players on the equilibrium. One counter intuitive phenomenon which we demonstrate is the "windfall of malice": paradoxically, when a myopically malicious player gains control of a fraction of the flow, a fraction of the players change from rational to malicious, the new equilibrium may be more favorable for the remaining rational players than the previous equilibrium.
The driven three body Coulomb problem
Authors: Javier Madroñero, Laurent Hilico, Benoît Grémaud, Dominique Delande, Andreas Buchleitner
Venue: Mathematical Structures in Computer Science (2007)

The three body Coulomb problem is one of the oldest unsolved problems of theoretical physics, and holds a variety of puzzling problems, on both the classical and quantum levels. It is of paradigmatic importance since it bears dynamical and spectral features that establish a link between single and many-particle dynamics, with the absolute minimum of ingredients. When additionally exposed to a time-periodic external perturbation, the effective dimension of the classical phase space as well as of Hilbert space increases dramatically. This gives rise to new phenomena, which stimulate research in such remote areas as mathematical physics, semiclassics and intense-field laser–matter interactions. In the present review, we illustrate how these different areas are interconnected by three interacting particles.
Dynamic range and visual perception
Authors: Greg Ward
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

Broadly speaking, the human visual system attempts to discount illumination so it can extract surface shapes and reflectance characteristics, independent of one's surroundings. This elucidates the purpose of vision, to quickly identify and categorize objects so the higher brain can seek opportunities and avoid obstacles and dangers that may be present. Low-level visual processing lies at the very root of survival, and is the product of hundreds of millions of years of animal evolution. It could be said that vision works to circumvent lighting.
Antenna array manifold: a simplified representation
Authors: A. Sleiman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The array manifold vector is one of the most important parameters of an array system. For a general non-linear array of sensors, (i.e. a two or three dimensional array geometry), the locus of the manifold vectors is a hypersurface embedded in a multidimensional complex space, with parameters of interest the azimuth and elevation angles. In this paper, a simplified representation of this complex hypersurface on a real two-dimensional plane is presented. This simplification/mapping, using concepts from differential geometry, maintains the main characteristics of the original array manifold surface and has the potential of providing new grounds for design and analysis of array systems. In this study, both planar and three-dimensional arrays of omnidirectional sensors are considered.
Enhancement of the computer experience in electric power engineering education at the University of Alaska, Fairbanks
Authors: J. Aspnes
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The University of Alaska Fairbanks (UAF) has recently acquired a commercial software product to complement power system analysis packages previously utilized in the UAF undergraduate power option, which include Power Technologies, Inc.'s (PTI) PSS/E/sup TM/ and ASPEN One-Liner/sup TM/. The most recent acquisition, also used heavily by Alaska's utilities, is Stoner Associates, Inc.'s Distribution Primary Analysis and Graphics (DPA/G)/sup TM/ software. This paper describes how the DPA/G software has extended the electric power program capabilities at UAF in the power distribution area. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Antiquity: exploiting a secure log for wide-area distributed storage
Authors: Hakim Weatherspoon, Patrick Eaton, Byung-Gon Chun, John Kubiatowicz
Venue: ACM SIGOPS Operating Systems Review (2007)

Antiquity is a wide-area distributed storage system designed to provide a simple storage service for applications like file systems and back-up. The design assumes that all servers eventually fail and attempts to maintain data despite those failures. Antiquity uses a secure log to maintain data integrity, replicates each log on multiple servers for durability, and uses dynamic Byzantine fault-tolerant quorum protocols to ensure consistency among replicas. We present Antiquity's design and an experimental evaluation with global and local testbeds. Antiquity has been running for over two months on 400+ PlanetLab servers storing nearly 20,000 logs totaling more than 84 GB of data. Despite constant server churn, all logs remain durable.
Metrics for Object-Oriented Design Focusing on Class Inheritance Metrics
Authors: Kadhim M. Breesam
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Object oriented design is becoming more popular in software development environment and object oriented design metrics are essential parts of software environment. Many new metrics are being proposed for object-oriented systems, but only few have been validated. The primary purpose of this paper is to analytically and empirically validate a set of metrics that can be used to measure the quality of an object-oriented design in terms of the using class inheritance (generalization and specialization). Analytical description for each metric is considered depending on the obtained results from the practical use of these metrics.
Fuzzy component based object detection
Authors: Raja Tanveer Iqbal, Costin Barbu, Fred Petry
Venue: International Journal of Approximate Reasoning (2007)

Component based object detection approaches have been shown to significantly improve object detection performance in adversities such as occlusion, variations in pose, in and out of plane rotation and poor illumination. Even the best object detectors are prone to errors when used in a global object detection scheme (one that uses the whole object as a single entity for detection purpose), due to these problems. We propose a fuzzy approach to object detection that treats an object as a set of constituent components rather than a single entity. The object detection task is completed in two steps. In the first step, candidates for respective components are selected based on their appearance match and handed over to the geometrical configuration classifier. The geometrical configuration classifier is a fuzzy inference engine that selects one candidate for each component such that each candidate is a reasonable match to the corresponding component in terms of appearance and also a good fit for the overall geometrical model. The detected object consists of candidates that are not necessarily the best in terms of appearance match or the closest to the geometrical model in terms of placement. The output is a set of candidates that is an optimal combination satisfying both criteria. We evaluate the technique on a well known face dataset and show that the technique results in detection of most faces in a scale-invariant manner. The technique has been shown to be robust to in-plane rotations and occlusion.
Acoustic and syntactical modeling in the ATROS system
Authors: D. Llorens
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Current speech technology allows us to build efficient speech recognition systems. However, model learning of knowledge sources in a speech recognition system is not a closed problem. In addition, lower demand of computational requirements are crucial to building real-time systems. ATROS is an automatic speech recognition system whose acoustic, lexical, and syntactical models can be learnt automatically from training data by using similar techniques. In this paper, an improved version of ATROS which can deal with large smoothed language models and with large vocabularies is presented. This version supports acoustic and syntactical models trained with advanced grammatical inference techniques. It also incorporates new data structures and improved search algorithms to reduce the computational requirements for decoding. The system has been tested on a Spanish task of queries to a geographical database (with a vocabulary of 1,208 words).
Flux: a language for programming high-performance servers
Authors: Brendan Burns, Kevin Grimaldi, Alexander Kostadinov, Emery D. Berger, Mark D. Corner
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

Programming high-performance server applications is challenging: it is both complicated and error-prone to write the concurrent code required to deliver high performance and scalability. Server performance bottlenecks are difficult to identify and correct. Finally, it is difficult to predict server performance prior to deployment. This paper presents Flux, a language that dramatically simplifies the construction of scalable high-performance server applications. Flux lets programmers compose off-the-shelf, sequential C or C++ functions into concurrent servers. Flux programs are type-checked and guaranteed to be deadlock-free. We have built a number of servers in Flux, including a web server with PHP support, an image-rendering server, a BitTorrent peer, and a game server. These Flux servers match or exceed the performance of their counterparts written entirely in C. By tracking hot paths through a running server, Flux simplifies the identification of performance bottlenecks. The Flux compiler also automatically generates discrete event simulators that accurately predict actual server performance under load and with different hardware resources.
Compilation Techniques for Optimizing Communication on Distributed-Memory Systems
Authors: Chun Gong, Rajiv Gupta, Rami Melhem
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Communication overhead can significantly impact the performance execution of programs on distributed-memory systems.