ppxscal/embedding_network huggingface dataset:
Flushing Policies for NVCache Enabled Hard Disks
Authors: Timothy Bisson, Scott A. Brandt
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

One of the goals of upcoming hybrid hard disks is to reduce power consumption by adding a small amount of non-volatile flash memory (NVCache) to the drive itself. By using the NVCache to satisfy writes while the rotating media is spun-down, hard disk power consumption can be decreased by lengthening low-power periods. However, the NVCache must eventually be flushed back to the rotating media in order to cache additional data. In this paper we explore two questions: when and how should NVCache content be flushed to rotating media in order to minimize the overhead of data synchronization. We show that by using traditional I/O mechanisms such as merging and reordering, combined with a "flush only when full" policy, flushing performance improves significantly.
Maximizing Throughput Multicast Routing forWireless Networks
Authors: Xiang-Yang Li, Yanwei Wu
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Multicast routing for wireless networks has been widely studied in the literature. In this paper, we design efficient algorithm for maximizing multicast throughput in wireless networks. We assume that we are given a set of wireless devices. All wireless devices are assumed to have the uniform (or quasiuniform) transmission ranges and have the uniform interference range (or quasi-uniform interference range). We further assume that each wireless node vi will have a capacity wi when no interference occurred during its transmission and it can transmit continuously. We present an efficient routing and node scheduling algorithms such that the achieved multicast capacity is within a constant factor of the optimum. Our theoretical throughput performance guarantees are proved under a various number interference models.
An Adaptive Resource Flowing Scheme amongst VMs in a VM-Based Utility Computing
Authors: Ying Song, Yuzhong Sun, Hui Wang, Xining Song
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In order to optimize the using of server resources which host different services such as web services, this paper describes an adaptive and dynamic resource flowing scheme amongst VMs in a VM-based utility computing environment called ADVM (Adaptive and Dynamic Virtual Machine). In our scheme, VMs adjust their resources (CPU and memory) adaptively to share the physical resources efficiently. ADVM provides an on-the-fly, transparent and lazy resource flowing amongst VMs over a single server. By using dynamic priority and the strategy of adjusting resources, no VM interferes with others even via contention for some resources. To demonstrate the elegance of our strategy, we present a prototype implementation of ADVM. The experimental results indicate that ADVM effectively enforce the system performance based on Xen.*
The myths and truths of wireless security
Authors: Alfred Loo
Venue: Communications of the ACM (2008)

Technology will never cure all wireless security ills. It will take a coordinated effort involving corporations, manufacturers, employers, and end users to fight the fight.
Very Fast Online Learning of Highly Non Linear Problems
Authors: Aggelos Chariatis
Venue: The Journal of Machine Learning Research (2007)

The experimental investigation on the efficient learning of highly non-linear problems by online training, using ordinary feed forward neural networks and stochastic gradient descent on the errors computed by back-propagation, gives evidence that the most crucial factors for efficient training are the hidden units' differentiation, the attenuation of the hidden units' interference and the selective attention on the parts of the problems where the approximation error remains high. In this report, we present global and local selective attention techniques and a new hybrid activation function that enables the hidden units to acquire individual receptive fields which may be global or local depending on the problem's local complexities. The presented techniques enable very efficient training on complex classification problems with embedded subproblems.
Visibility: a new metric for protocol design
Authors: Megan Wachs, Jung Il Choi, Jung Woo Lee, Kannan Srinivasan, Zhe Chen, Mayank Jain, Philip Levis
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

This paper proposes a new sensornet protocol design goal: visibility. Visibility into behaviors at the network level will simplify debugging and ease the development process. We argue that increasing visibility is the responsibility of the network protocols themselves, and not solely the responsibility of existing debugging tools. We describe a quantitative visibility metric to evaluate and compare protocols, where visibility is defined as the energy cost of diagnosing the cause of a behavior in a protocol. The design and evaluation of Pull Collection Protocol, a novel multi-hop collection protocol, is an example of how to design for visibility without sacrificing throughput or node-level fairness. We also describe our optimizations for an existing protocol, Deluge, to increase its visibility and efficiency.
An Energy Characterization Framework for Software-Based Embedded Systems
Authors: D. Lee
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

This paper proposes an energy characterization framework which helps designers in developing a fast and accurate energy model for a target processor-based system. We use a linear model for energy estimation and we find the coefficients of the model using linear programming (LP). We use our approach for estimating the energy consumption of two commercial microprocessors with their on-chip caches and an off-chip SDRAM. Experimental results demonstrate that the error of our technique is on an average 3% and worst case 16% compared to the gate-level estimation results. Once the model has been developed, the energy consumption of an application program can be estimated with the speed of 300,000 instructions per second
Fred Moses Sr. Programmer
Venue: Computer (1971)

The minicomputer's power to perform repetitive clerical tasks, monitor and control real-time processes, and perform scientific calculations has made it desirable in hospital systems. The minicomputer's inherent low cost has made it practical. Computer suppliers to the medical field are recognizing that they must collaborate with medical professionals to pinpoint well delimited problem areas. 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
Support Vector Regression and Radial Basis Function Neural Networks Applied to Semi-quantitative Prediction of Rhubarbs
Authors: Zhuoyong Zhang, Xiaofang Zhang, Peter de B. Harrington
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Methods for building near-infrared spectrometry (NIRS) calibration models and for predicting active constituents of rhubarb samples using principal components analysis (PCA) and support vector regression (SVR) were investigated. Principal component analysis was used to reduce the number of spectral variables. Radial basis function neural networks (RBFNNs), ridge regression RBFNNs (RRRBFNNs), and SVR were used to model and predict four classes of active constituents (anthraquinones, anthraquinone glucosides, stilbene glucosides, tannins and tannin derivatives) in rhubarb using the principal component scores of the first-derivative spectra. The results show that the prediction accuracy by SVR is better than the accuracy obtained from the RBFNNs and RRRBFNNs. Therefore, SVR is a promising method for semi-quantitative prediction of active constituents in Chinese herbal medicine.
Energy Efficient Cooperative Nodes Selection in Wireless Sensor Networks
Authors: Irfan Ahmed, Mugen Peng, Wenbo Wang
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

This paper presents an energy efficient selection of cooperative nodes with respect to their geographical location and the number of nodes participating in cooperative communications in wireless sensor networks. The cooperative communication in wireless sensor networks (WSN) gives us leverage to get the inherent advantages of its random node's locations and the direction of the data flow. Depending on the channel conditions and the transmission distance, the number of cooperative nodes is selected, that participate in an energy efficient transmission/reception. Simulation results show that increasing the cooperative receive diversity, decreases the energy consumption per bit in cooperative communications. It has also been shown that the network backbone capacity can be increased by controlled displacement of antennas at base station at the expense of energy per bit.
Database research opportunities in computer games
Authors: Walker White, Christoph Koch, Nitin Gupta, Johannes Gehrke, Alan Demers
Venue: ACM SIGMOD Record (2007)

In this paper, we outline several ways in which the database community can contribute to the development of technology for computer games. We outline the architecture of different types of computer games, and show how database technology plays a role in their design. From this, we identify several new research directions to improve the utilization of this technology in computer games.
An auction mechanism for allocating the bandwidth of networks to their users
Authors: Manos Dramitinos, George D. Stamoulis, Costas Courcoubetis
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

We present a mechanism for auctioning bandwidth on a network-wide basis to end users or ISPs that will utilize it for the same time period. This mechanism consists of a set of simultaneous multi-unit descending-price (i.e. Dutch) auctions, one per link of the network. The per unit prices of bandwidth at the various links are asymmetric, thus reflecting the asymmetry of demand for these links. A user can be instantly allocated bandwidth over a certain path, by simultaneously bidding for the quantity desired at all relevant auctions. This winner determination rule is complemented by a payment rule of the VCG (Vickrey-Clarke-Groves) type, which provides users with the incentive to bid truthfully, thus simplifying bidding. Also, the mechanism enables the auctioneer to use his prior information on market demand anticipated and its spreading among the various links in order to set effectively the auction's parameters. We argue that our mechanism attains nearly efficient allocation of the network's bandwidth (i.e. the resulting social welfare is close to the respective maximum for the quantity decided to be sold by the auctioneer), while it is simple, scalable and applicable to real networks, even for auctioning the capacity of links owned by multiple providers and then splitting the revenue among them. Alternatively, the mechanism offers the provider the opportunity to optimize his revenue, rather than the social welfare. Since our mechanism's computational complexity is low it can serve as a fast, practical, and near-optimal solution to a generally NP-hard optimization problem.
Hybrid Intelligent Suite for Decision Support
Authors: F. B. Lima Neto, F. R. S. Oliveira, D. F. Pacheco
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This work presents a suite of hybrid intelligent techniques helpful in decision making, the Hybrid Intelligent Decision Suite (HIDS). The system is composed of two complementary modules, one for forecasting new decision variables and the other, for searching among generated results of candidate decisions. Using this synergistic approach, HIDS is also suitable to obtain conditioning factors leading to desired decision, thus, overcoming some of the challenges posed by the `Inverse Problem'. To test this concept we have applied our approach on two distinct problems: (1) diagnosis of cardiologic diseases (of the proben-1 data-set) and (2) automobile feature selection (of UCI data-set). In the simulations carried out here, the HIDS comprised Artificial Neural Networks (ANNs) and Fuzzy Logic Controllers. Results proved that the ideas presented here can be effective to assemble tools which reduce uncertainty and improve quality in decision making about future scenarios.
Replay Detection Based on Semi-automatic Logo Template Sequence Extraction in Sports Video
Authors: Zhonghua Dang, Jun Du, Qingming Huang, Shuqiang Jiang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper proposes a novel approach to replay detection in sports video. The proposed method consists of efficient semi-automatic logo template sequence extraction and logo template sequence based replay detection. In the beginning, two video segments are marked manually. Then a logo template sequence extraction algorithm is adopted to extract logo template sequence automatically. Once the logo sequence is extracted, the sequence is used to locate the replay segments accurately by the template sequence matching method. The experiments are carried out on various types of sports videos. The experimental results show that our algorithm can extract logo template sequence accurately and detect replays effectively. Moreover, our algorithm is generic and easy to use.
Functional equations, constraints, definability of function classes, and functions of Boolean variables
Authors: Miguel Couceiro, Stephan Foldes
Venue: Acta Cybernetica (2007)

The paper deals with classes of functions of several variables defined on an arbitrary set A and taking values in a possibly different set B. Definability of function classes by functional equations is shown to be equivalent to definability by relational constraints, generalizing a fact established by Pippenger in the case A = B = {0,1}. Conditions for a class of functions to be definable by constraints of a particular type are given in terms of stability under certain functional compositions. This leads to a correspondence between functional equations with particular algebraic syntax and relational constraints with certain invariance properties with respect to clones of operations on a given set. When A = {0, 1} and B is a commutative ring, such B-valued functions of n variables are represented by multilinear polynomials in n indeterminates in B[X1,...,Xn]. Functional equations are given to describe classes of field-valued functions of a specified bounded degree. Classes of Boolean and pseudo-Boolean functions are covered as particular cases.
QoS Guaranteed Multi-Poll Access Scheme with Transmission Control over High Throughput Wireless LANs
Authors: Hiroaki Murata, Tomotaka Wada, Tadahiro Maekawa, Kouichi Mutsuura, Hiromi Okada
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Recently, we need high bit rate transmissions of the wireless LAN to access the internet at offices and houses. Multi-Poll access scheme has been proposed as an efficient access control scheme for these necessities. The scheme is a central control scheme using Polling system. In order to establish a high speed multimedia transmission, we need to integrate the required quality of services effectively. In this paper, we propose QoS (Quality of Service) guaranteed Multi-Poll access scheme for multimedia services in wireless LAN. We evaluate the transmission performances of the proposed scheme for effectiveness by computer simulations. We have clarified that the proposed scheme has the outstanding performances on the throughput, delay time, and frame drop rate comparing to the conventional scheme.
Probabilistic analysis of onion routing in a black-box model
Authors: Joan Feigenbaum, Aaron Johnson, Paul Syverson
Venue: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007)

We perform a probabilistic analysis of onion routing. The analysis is presented in a black-box model of anonymous communication that abstracts the essential properties of onion routing in the presence of an active adversary that controls a portion of the network and knows all a priori distributions on user choices of destination. Our results quantify how much the adversary can gain in identifying users by exploiting knowledge of their probabilistic behavior. In particular, we show that a user uâs anonymity is worst either when the other users always choose the destination u is least likely to visit or when the other users always choose the destination u chooses. This worst-case anonymity with an adversary that controls a fraction b of the routers is comparable to the bestcase anonymity against an adversary that controls a fraction pb.
Extracting Symbolic Rules from Trained Support Vector Machines Based on the Derivative Heuristic Information
Authors: Dexian Zhang, Zhixiao Yang, Yanfeng Fan, Ziqiang Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Support vector machines (SVMs) have demonstrated superior performance compared to other machine learning techniques, especially in classification problems. How to extract rules from trained SVMs has become an important preprocessing technique for data mining, pattern classification, and so on. In this paper, a new approach for symbolic rule extraction from trained SVMs is proposed. It includes the methods of the attribute selection, the division of attribute space, the rule expression, and so on. A new algorithm for rule extraction is given. The performance of the new approach is demonstrated by several computing cases. Experiment results show that the proposed approach can improve the validity of the extracted rules remarkably compared to other rule extracting approaches, especially for complicated classification problems.
Design and evaluation of a wireless decision-support system for heart rate variability study in haemodialysis follow-up procedures
Authors: José García, Jesús D. Trigo, Álvaro Alesanco, Pedro Serrano, Javier Mateo, Robert S. H. Istepanian
Venue: Computer Methods and Programs in Biomedicine (2007)

In this paper a new wireless decision-support system for haemodialysis patients using heart rate variability (HRV) is presented. The telemedicine system provides connectivity to three participant sites: the general practitioner or nurse at the point of care in the dialysis unit, the remote information and processing server and the cardiologist. At the clinical point of care, the nurse acquires the electrocardiogram (ECG) by using a tailored mobile telecardiology system as well as other relevant physiological information during the clinical procedure, and sends it to the information server. The received information is stored in a secure file server, linked to the patient database and the ECG signal is automatically analyzed by using advanced signal processing tools in the processing server, where a complete clinical results report is generated. The cardiologist can then be linked by means of a web browser to the information server to analyze these results for further clinical diagnosis support. The system has been applied to study HRV in patients undergoing haemodialysis. The clinical report consisted of trends for time- and frequency-domain HRV indexes and other supplementary information automatically calculated, which show the response of the electrical activity of the heart to the dialysis process and that can be helpful for the follow-up of these patients. The telecardiology framework has been successfully evaluated both by the patients and the hospital personnel showing a high compliance with the system. The design and implementation of the telecardiology system have followed the most recent advances in web technologies, biomedical information and storage standards and signal processing techniques. The presented system can be used as a telemedicine tool for clinical diagnosis support and could also be used in other clinical settings.
Energy optimization of multiprocessor systems on chip by voltage selection
Authors: Alexandru Andrei, Petru Eles, Zebo Peng, Marcus T. Schmitz, Bashir M. Al Hashimi
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Dynamic voltage selection and adaptive body biasing have been shown to reduce dynamic and leakage power consumption effectively. In this paper, we optimally solve the combined supply voltage and body bias selection problem for multiprocessor systems with imposed time constraints, explicitly taking into account the transition overheads implied by changing voltage levels. Both energy and time overheads are considered. The voltage selection technique achieves energy efficiency by simultaneously scaling the supply and body bias voltages in the case of processors and buses with repeaters, while energy efficiency on fat wires is achieved through dynamic voltage swing scaling. We investigate the continuous voltage selection as well as its discrete counterpart, and we prove strong NP-hardness in the discrete case. Furthermore, the continuous voltage selection problem is solved using nonlinear programming with polynomial time complexity, while for the discrete problem, we use mixed integer linear programming and a polynomial time heuristic. We propose an approach that combines voltage selection and processor shutdown in order to optimize the total energy.
Verification of Handwritten Signatures: an Overview
Authors: S. Impedovo, G. Pirlo
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In the Information and Communication Society personal verification is a crucial aspect. Among the different means for personal verification, handwritten signature plays a fundamental role since signature is the most diffuse means for personal verification in our daily life. In this paper a brief overview of the field of handwritten signature verification is presented and some of the most relevant perspectives are highlighted.
Special Feature: Microprogrammable Virtual Machines
Authors: J. D. Bagley
Venue: Computer (1976)

The introduction of computers which have user alterable microprograms presents users with both an opportunity and a problem. To take full advantage of the opportunity to tailor the architecture of the computer to the application domain, the problem of microprogram development and testing must be solved. The technique outlined here provides a tool which furnishes the microprogrammer with a virtual machine which is microprogrammable. The function provided is similar to that provided by a simulator, but the technique is more efficient and allows multiple microprograms to be executed concurrently with regular programs on a single real machine.
DATE 07 workshop on diagnostic services in NoCs
Authors: Erik Jan Marinissen, Axel Jantsch, Nicola Nicolici
Venue: IEEE Design Test (2007)

The Workshop on Diagnostic Services in Network-on-Chips, held during DATE 2007, focused on test, debugging, and online monitoring in NoCs. The main body of the workshop was formed by two sessions with full-length paper presentations and two lively poster sessions with a total of 28 posters. EPFL's Giovanni De Micheli gave the keynote address, and the workshop also featured a panel session led by Tensilica's Grant Martin and invited talks by Virage Logic's Yervant Zorian and NXP Semiconductors' Kees Goossens. The workshop produced electronic online proceedings, including papers, slides, and posters-totaling 420 pages.