ppxscal/embedding_network huggingface dataset:
MANTIS OS: an embedded multithreaded operating system for wireless micro sensor platforms
Authors: Shah Bhatti, James Carlson, Hui Dai, Jing Deng, Jeff Rose, Anmol Sheth, Brian Shucker, Charles Gruenwald, Adam Torgerson, Richard Han
Venue: Mobile Networks and Applications (2005)

The MANTIS MultimodAl system for NeTworks of In-situ wireless Sensors provides a new multithreaded cross-platform embedded operating system for wireless sensor networks. As sensor networks accommodate increasingly complex tasks such as compression/aggregation and signal processing, preemptive multithreading in the MANTIS sensor OS (MOS) enables micro sensor nodes to natively interleave complex tasks with time-sensitive tasks, thereby mitigating the bounded buffer producer-consumer problem. To achieve memory efficiency, MOS is implemented in a lightweight RAM footprint that fits in less than 500 bytes of memory, including kernel, scheduler, and network stack. To achieve energy efficiency, the MOS power-efficient scheduler sleeps the microcontroller after all active threads have called the MOS sleep() function, reducing current consumption to the µA range. A key MOS design feature is flexibility in the form of cross-platform support and testing across PCs, PDAs, and different micro sensor platforms. Another key MOS design feature is support for remote management of in-situ sensors via dynamic reprogramming and remote login.
Coupling and self-stabilization
Authors: Laurent Fribourg, Stéphane Messika, Claudine Picaronny
Venue: Distributed Computing (2006)

A randomized self-stabilizing algorithm A is an algorithm that, whatever the initial configuration is, reaches a set L of legal configurations in finite time with probability 1. The proof of convergence towards L is generally done by exhibiting a potential function ϕ, which measures the "vertical" distance of any configuration to L, such that ϕ decreases with non-null probability at each step of A. We propose here a method, based on the notion of coupling, which makes use of a "horizontal" distance δ between any pair of configurations, such that δ decreases in expectation at each step of A. In contrast with classical methods, our coupling method does not require the knowledge of L. In addition to the proof of convergence, the method allows us to assess the convergence rate according to two different measures. Proofs produced by the method are often simpler or give better upper bounds than their classical counterparts, as examplified here on Herman's mutual exclusion and Iterated Prisoner's Dilemma algorithms in the case of cyclic graphs.
Digital RF
Authors: Roman Staszewski
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Something very special happened at the turn of the last century. It didn't get nearly as much news coverage as the millennium bug, but its impact will be experienced by most people on earth. In fact, it was a low key phenomenon that received attention only from few technologists. This phenomenon was the ability to reliably scale a CMOS transistor below a certain size, so it could digitally switch at RF frequency rate. This is when "Digital RF" was born. This opened new doors to how wireless communication could be implemented - reliably and expensively. The RF circuits finally entered the physics of Moore's Law. This is nothing short of a paradigm change of RF radio design, benefits of which will be enjoyed by billions of people worldwide instead of privileged millions. In this presentation, I will describe in the rationale behind this new paradigm. I will overview how Texas Instruments has manifested Digital RF in its Digital Radio Processor (DRP) technology.
A noise-robust stochastic gradient algorithm with an adaptive step-size suitable for mobile hands-free telephones
Authors: A. Hirano, A. Sugiyama
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

This paper proposes a new noise-robust adaptive FIR filtering algorithm with an adaptive step-size which takes non-stationarity of speech signals into account. The proposed algorithm controls the step-size based on the reference input signal power and the estimated noise power. Implementation of an acoustic echo canceller based on this algorithm using digital signal processors is also described. Computer simulation results using a real speech signal show that the proposed algorithm improves the ERLE (echo return loss enhancement) by more than 10 dB compared with conventional noise-robust adaptive-step algorithms. The implemented echo canceller achieves 25 dB of the ERLE, which agrees with the computer simulation results.
On evaluating request-distribution schemes for saving energy in server clusters
Authors: K. Rajamani, C. Lefurgy
Venue: Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (2003)

Power-performance optimization is a relatively new problem area particularly in the context of server clusters. Power-aware request distribution is a method of scheduling service requests among servers in a cluster so that energy consumption is minimized, while maintaining a particular level of performance. Energy efficiency is obtained by powering-down some servers when the desired quality of service can be met with fewer servers. We have found that it is critical to take into account the system and workload factors during both the design and the evaluation of such request distribution schemes. We identify the key system and workload factors that impact such policies and their effectiveness in saving energy. We measure a web cluster running an industry-standard commercial web workload to demonstrate that understanding this system-workload context is critical to performing valid evaluations and even for improving the energy-saving schemes.
Energy Efficiency of Intrusion Detection Systems in Wireless Sensor Networks
Authors: Piya Techateerawat, Andrew Jennings
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Security is a significant concern for many sensor network applications. Intrusion detection is one method of defending against attacks. However, standard intrusion detection is not suitable for sensor networks with limited battery power, memory and processing resources. This paper compares several approaches to intrusion detection in sensor networks. We investigate accuracy of detecting attacks, versus energy efficiency.
An empirical study on language model adaptation
Authors: Jianfeng Gao, Hisami Suzuki, Wei Yuan
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2006)

This article presents an empirical study of four techniques for adapting language models, including a maximum a posteriori (MAP) method and three discriminative training models, in the application of Japanese Kana-Kanji conversion. We compare the performance of these methods from various angles by adapting the baseline model to four adaptation domains. In particular, we attempt to interpret the results in terms of the character error rate (CER) by correlating them with the characteristics of the adaptation domain, measured by using the information-theoretic notion of cross entropy. We show that such a metric correlates well with the CER performance of the adaptation methods, and also show that the discriminative methods are not only superior to a MAP-based method in achieving larger CER reduction, but also in having fewer side effects and being more robust against the similarity between background and adaptation domains.
News
Authors: Brandi Ortega
Venue: IEEE Security and Privacy (2006)

Timely news briefs in security, privacy, and policy
A Hierarchical Fuzzy Classification of Online Customers
Authors: Nicolas Werro, Henrik Stormer, Andreas Meier
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

A key challenge for companies in the e-business era is to manage customer relationships as an asset. In today's global economy this task is getting, at the same time, more difficult and more important. In order to retain the potentially good customers and to improve their buying attitude this paper proposes a hierarchical fuzzy classification of online customers. A fuzzy classification, which is a combination of relational databases and fuzzy logic, allows customers to be classified in several classes at the same time and can therefore precisely determine the customers' value for an enterprise. This approach allows companies to improve the customer equity, to launch loyalty programs, to automate mass customization and to refine marketing campaigns in order to maximize the customers' value and, this way, the companies' profit.
Summarizing itemset patterns using probabilistic models
Authors: Chao Wang, Srinivasan Parthasarathy
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interpretation, particularly for problems where the resulting set of patterns are huge. In our approach items in the dataset are modeled as random variables. We then construct a Markov Random Fields (MRF) on these variables based on frequent itemsets and their occurrence statistics. The summarization proceeds in a level-wise iterative fashion. Occurrence statistics of itemsets at the lowest level are used to construct an initial MRF. Statistics of itemsets at the next level can then be inferred from the model. We use those patterns whose occurrence can not be accurately inferred from the model to augment the model in an iterative manner, repeating the procedure until all frequent itemsets can be modeled. The resulting MRF model affords a concise and useful representation of the original collection of itemsets. Extensive empirical study on real datasets show that the new approach can effectively summarize a large number of itemsets and typically significantly outperforms extant approaches.
Order of Movement in Decommitting from a Contract
Authors: Don Perugini, Don Gossink
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

There is increasing interest in automated agent negotiation and contracting in both commercial and military applications. Sandholm and Lesser [6, 7] proposed leveled commitment contracts allowing agents to decommit from contracts by paying a penalty. Further to this study we analyse the order of movement (decision) in contract decommitment. Intuitively one would expect that moving second is better. We show that this is not always the case. Agents may prefer to move first and not decommit in order to force the other agent to decommit and pay the penalty. Electing to move second may reveal information about an agent's type, altering its expected payoff and cause instability with the Nash Equilibrium presented. This may result in agents that prefer to move second or are indifferent to order to move first or second (or use a mixed strategy) respectively. If at least one agent must pay a large penalty (i.e. full commitment contract), both agents are indifferent to when they move.
Model Order Selection and Cue Combination for Image Segmentation
Authors: Andrew Rabinovich, Serge Belongie, Tilman Lange, Joachim M. Buhmann
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Model order selection and cue combination are both difficult open problems in the area of clustering. In this work we build upon stability-based approaches to develop a new method for automatic model order selection and cue combination with applications to visual grouping. Novel features of our approach include the ability to detect multiple stable clusterings (instead of only one), a simpler means of calculating stability that does not require training a classifier, and a new characterization of the space of stabilities for a continuum of segmentations that provides for an efficient sampling scheme. Our contribution is a framework for visual grouping that frees the user from the hassles of parameter tuning and model order selection: the input is an image, the output is a shortlist of segmentations.
Improving Data Transmission with Helping Nodes for Geographical Ad Hoc Routing
Authors: Shin-Hung Chung, Kuo-Feng Ssu, Chih-Hsun Chou, Hewijin Christine Jiau
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Ad hoc networks have been extensively deployed in recent years. In such networks, obtaining a high efficiency is difficult to achieve due to mobility. Many routing approaches have been proposed to improve the performance of ad hoc networks, including table-driven and demanddriven routing protocols. Table-driven algorithms, maintain routing paths even when they are not currently in use. Hence, such algorithms typically waste large amounts of memory in storing possibly redundant data routes. By contrast, demand-driven approaches maintain routes only for so long as they are required. In an alternative approach known as geographic routing, a source only needs to know the location of the destination node and its one-hop neighbors to make a forwarding decision. Consequently, the need to establish and maintain routes between nodes is avoided. Geographic routing provides a suitable solution for large-scale and dynamic networks, and reduces link failure problems during packet routing.
Ultra-soft magnetic films: micromagnetism and high frequency properties
Authors: N. G. Chechenin
Venue: Microelectronic Engineering (2005)

The wavelength and amplitude of the longitudinal oscillations of the transversal and longitudinal components of magnetization was obtained from the contrast ripple observed by the Lorentz TEM. The micromagnetic ripple is connected with the internal stray field in the film. The theory, based on Landau-Lifshitz equation, is developed, where the internal stray field is taken into account. The theory predicts that the micromagnetic ripple can broaden the ferromagnetic resonance (FMR) to lower range of the frequencies. For a certain range of the internal stray field a second bump at lower frequencies arrives, which shows up in some previously reported spectra.
Social Power as an Exchangeable Resource for Distributed Multi-Agent Systems
Authors: Don Hayes, Henry Hexmoor
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

An innovative model of structuring agent control based on the implicit concept of transferring a portion of social power upon a series of requests for delegation being offered. Existing models are examined and evaluated. We present the concept of social power as a resource that is exchanged within an agent group instead of a static power structure or one based on dynamic rank. Evely time an agent commands another agent, the power structure within the agent group is redistributed Providing intuitive validation, our simulation results for a single agent using our model of power generation and decay are explored.
Clinical Trials of a Wireless LAN Based Patient Monitoring System
Authors: Aoife Deery, Desmond Chambers, Denis Moriarty, Elizabeth Connolly, Gerard Lyons
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This paper describes the design, development and clinical trials completed on an ambulatory, wireless ECG / vital signs monitor, which was designed to work on standard wireless LAN networking systems (802.11b). It discusses the trials, results collected from two prototype sensor devices, the limitations of the system in place due to architecture and site location. Future works identified from the clinical trials completed will also be discussed.
Ontological aspects of the implementation of norms in agent-based electronic institutions
Authors: Davide Grossi, Huib Aldewereld, Javier Vázquez-Salceda, Frank Dignum
Venue: Computational Mathematical Organization Theory (2006)

In order to regulate different circumstances over an extensive period of time, norms in institutions are stated in a vague and often ambiguous manner, thereby abstracting from concrete aspects which become instead relevant for the actual functioning of the institutions. If agent-based electronic institutions, which adhere to a set of abstract requirements, are to be built, how can those requirements be translated into more concrete constraints, the impact of which can be described directly in the institution? We address this issue considering institutions as normative systems based on articulate ontologies of the agent domain they regulate. Ontologies, we hold, are used by institutions to relate the abstract concepts in which their norms are formulated, to their concrete application domain. In this view, different institutions can implement the same set of norms in different ways as far as they presuppose divergent ontologies of the concepts in which that set of norms is formulated. In this paper we analyse this phenomenon introducing a notion of contextual ontology. We will focus on the formal machinery necessary to characterise it as well.
To the stability of non-conservative systems in one degenerate case
Authors: S. A. Agafonov
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

We study stability of the mechanical systems subjected to dissipative, gyroscopic, potential and non-conservative positional forces. We start from consideration of non-stationary system under the action of all forces, which are listed above in the case when matrix of the gyroscopic forces is constant (degenerate case). By means of the construction of the Lyapunov function we obtain stability condition. Derived results extend the stability conditions of the stationary system [S.A. Agafonov, 2003]. The stability of non-conservative system in the absence of potential forces is examined and condition of asymptotic stability is obtained. We examine the influence of the linear dissipative forces on the stability of the circulatory system. The estimation of the limit value if these forces for the stable circulatory system to be asymptotically stable is obtained. We also consider circulatory system with two degrees of freedom under the action of non-linear dissipative forces. Original system is transformed to the normal form up to the third order. The internal resonance of the fourth order is considered as well. It is shown that the stable circulatory system becomes asymptotically stable. 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
Clustering pair-wise dissimilarity data into partially ordered sets
Authors: Jinze Liu, Qi Zhang, Wei Wang, Leonard McMillan, Jan Prins
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore this relationship in depth. In particular, we examine the space of ontologies that can be generated by pairwise dissimilarity matrices. We demonstrate that classical clustering algorithms, which take dissimilarity matrices as inputs, do not incorporate all available information. In fact, only special types of dissimilarity matrices can be exactly preserved by previous clustering methods. We model ontologies as a partially ordered set (poset) over the subset relation. In this paper, we propose a new clustering algorithm, that generates a partially ordered set of clusters from a dissimilarity matrix.
Enforcing a minimum-phase condition on an arbitrary one-dimensional signal with application to a two-dimensional phase retrieval problem
Authors: Wooshik Kim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

We consider the problem of making a minimum phase signal from an arbitrary one-dimensional signal by adding a point signal and its application to a two-dimensional phase retrieval problem. In particular, we show that a two-dimensional phase retrieval problem can be decomposed into several one-dimensional phase retrieval problems so that a M/spl times/N two-dimensional signal can be reconstructed from its Fourier transform magnitude by solving min. 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
Automatic Extraction of Bibliographic Information from Biomedical Online Journal Articles Using a String Matching Algorithm
Authors: Jongwoo Kim, Daniel X. Le, George R. Thoma
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

A system has been developed to extract bibliographic data (grant numbers and databank accession numbers) from online biomedical journal articles for the National Library of Medicine's MEDLINE.. database. Rule-based algorithms and a string matching algorithm are proposed to extract the bibliographic data from HTML-formatted articles. Experiments conducted with 411 medical articles from 73 journal issues show an accuracy exceeding 96%.
Error Correction On-Demand: A Low Power Register Transfer Level Concurrent Error Correction Technique
Authors: Han Liang, Piyush Mishra, Kaijie Wu
Venue: IEEE Transactions on Computers (2007)

Errors introduced by radiation-induced single event upset and single event latchup in very deep submicron (VDSM) ICs necessitate concurrent error detection (CED) and correction. Power consumed by circuits used for detecting and correcting errors becomes an extra burden on the tight power budget of VDSM ICs. The triple-modular redundancy-based fault tolerance technique, which is traditionally used for error detection and correction, incurs over 200 percent power overhead. In this paper, we propose register-transfer level low-power on-demand error correction techniques. Proposed techniques implement an original computation and a recomputation in datapath and compare the results from two computations to monitor the health of circuit. A mismatch in results indicates faulty computation and a second recomputation is triggered to rectify the error. The proposed techniques can detect and correct SEU induced transient errors and detect SEL induced permanent errors with as little as 12 percent power overhead.
A Unified Framework for Defect Data Analysis Using the MBR Technique
Authors: Venkata U. B. Challagulla, Farokh B. Bastani, I-Ling Yen
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Failures of mission-critical software systems can have catastrophic consequences and, hence, there is strong need for scientifically rigorous methods for assuring high system reliability. To reduce the V&V cost for achieving high confidence levels, quantitatively based software defect prediction techniques can be used to effectively estimate defects from prior data. Better prediction models facilitate better project planning and risk/cost estimation. Memory Based Reasoning (MBR) is one such classifier that quantitatively solves new cases by reusing knowledge gained from past experiences. However, it can have different configurations by varying its input parameters, giving potentially different predictions. To overcome this problem, we develop a framework that derives the optimal configuration of an MBR classifier for software defect data, by logical variation of its configuration parameters. We observe that this adaptive MBR technique provides a flexible and effective environment for accurate prediction of mission-critical software defect data.