ppxscal/embedding_network huggingface dataset:
Broad new OS research: challenges and opportunities
Authors: Galen C. Hunt, James R. Larus, David Tarditi, Ted Wobber
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

Contemporary software systems are beset by problems that create challenges and opportunities for broad new OS research. To illustrate, we describe five areas where broad OS research could significantly improve the current user experience. These areas are dependability, security, system configuration, system extension, and multi-processor programming. In each area we explore how contemporary systems fall short. Where we have thought of possible solutions, we offer directions for future research. To prove our point that opportunities for new OS research exist, we describe Singularity, a research project at Microsoft Research. Singularity is a new operating system designed to explore solutions to four of the challenges we have identified. Singularity incorporates three specific design decisions in order to increase system dependability and improve system security, configuration, and extension. These design decisions include the adoption of an abstract instruction set as part of the system binary interface, a unified extension architecture for both the OS and applications, and a first-class application abstraction.
Scope Design Implemented in a PCI Card
Authors: L. Mantilla, M. A. Vargas, S. Vergara
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

Currently are different commercial PCI cards that included instruments like scopes, function generator, pattern generator, and data acquisition card with digital ports. The main objective of this paper is design and built a measurement instrument basically an oscilloscope; our interest is development the hardware, firmware and the software.
Goromi-Web: browsing for unexpected information on the web
Authors: Goro GO Otsubo
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

In this paper, we describe an interface that provides information from the Internet, called Goromi-Web. Usually, a search function is used to browse information on the Internet. However, with a search function, the user obtains information that he knows to exist. With Goromi-Web, the user can literally browse information on the Internet, and sometimes can encounter unexpected information previously unknown to the user.
StackGhost: Hardware facilitated stack protection
Authors: Mike Frantzen, Mike Shuey
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

Conventional Security have relied on overwriting the saved return pointer on the stack to hijack the path of execution. Under Sun Microsystem's Sparc processor architecture, we were able to implement a kernel modification to transparently and automatically guard application's return pointers. Our implementation called Stack Ghost Open-BSD 2.8 acts as a ghost in the machine. Stack-Ghost advances exploit prevention in that it protects every application run on the system without their knowledge nor does it require their source or binary modification. We will document several of the methods devised to preserve the sanctity of the system and will explore the performance ramifications of Stack Ghost.
Tutorial T3: Low Power Design Techniques for Nanometer Design Processes - 65nm and Smaller
Authors: Subhomoy Chattopadhyay, Rakesh Patel
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Power has become one of the most important paradigms of design convergence for future microprocessor and ASIC/SOC designs. In this tutorial we present the importance of low power microprocessor/SOC design from the high level microarchitectural, RTL, gate level to transistor level design. We cover the conflicting goals of performance vs low power, routinely faced by designers today. Embedded microprocessor/SOC designs are particularly dictated by standby and max/thermal design power and battery life constraints and not performance/frequency alone. Designing with the power envelope is a standard challenge even for the high end server platforms. Performance/watt or MIPS/watt is the design metric of today that we focus on. We cover the main components of leakage power and how does the transistor design determines whether the extreme stringent battery life requirements determined by standby and average power are met. A short discussion of different process variants for various types of applications will also be discussed followed by an introduction of shadow latches and state retention techniques used by microprocessors and DSPs of today. Tradeoff between amount of state retained and the exit latency of the processor from deep sleep/standby states will be discussed.
Modeling and simulation alternatives for the design of networked embedded systems
Authors: E. Alessio, F. Fummi, D. Quaglia, M. Turolla
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper addresses the problem of modeling and simulating large set of heterogeneous networked embedded systems which cooperate to build cost-efficient, reliable, secure and scalable applications. The purpose of this task is an application-driven top-down design flow which starts from application requirements and then progressively decides the general architecture of the system and the type and structure of its HW, SW and network components. In the past, a considerable research effort has been done to create specific tools for each design domain ---software, hardware and network---, and to integrate them for data exchange between models and their joint simulation. However, the advantages and drawbacks of different combinations of tools in the various stages of the design flow have not been discussed. The paper describes and discusses how to combine different modeling tools to provide different modeling and simulation alternatives for the design of networked embedded systems devoted to complex distributed applications. The problem is faced both theoretically and practically with a real application derived from a European project.
Towards Privacy-Aware Handling of Authorizations
Authors: Wolfgang Dobmeier, Gunther Pernul
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

Privacy issues have hindered centralised authentication approaches from being adopted by a wide range of users. This also applies to authorizations which suffer from privacy problems when stored and processed centrally. We present first steps towards a framework of privacy-aware handling of authorizations. We split up the storage and the processing of access control policies in a user-centric approach. We illustrate our approach at the example of a security infrastructure scenario.
Toward the development of cognitive task difficulty metrics to support intelligence analysis research
Authors: F. L. Greitzer
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

Intelligence analysis is a cognitively complex task that is the subject of considerable research aimed at developing methods and tools to aid the analysis process. To support such research, it is necessary to characterize the difficulty or complexity of intelligence analysis tasks in order to facilitate assessments of the impact or effectiveness of tools that are being considered for deployment. A number of informal accounts of "What makes intelligence analysis hard" are available, but there has been no attempt to establish a more rigorous characterization with well-defined difficulty factors or dimensions. This paper takes an initial step in this direction by describing a set of proposed difficulty metrics based on cognitive principles.
Performance of UWB Systems with Suboptimal Receivers under IEEE 802.15.4a Industrial Environments
Authors: Huiling Gong, Hong Nie, Zhizhang (David) Chen
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

In this paper, under the IEEE 802.15.4a line-of-sight (LOS) and non-line-of-sight (NLOS) industrial multipath environments, the performances of the selective Rake receiver and the differential detection receiver are simulated for impulse radio ultra-wideband (UWB) systems. The simulation results reveal that in the LOS industrial environments the selective Rake receiver has better performance. In the NLOS industrial environments, the differential detection receiver is a more viable choice with the low pulse repeat rate when the inter-symbol interference (ISI) effect can be ignored; however, the selective Rake receiver is a better choice with the high pulse repeat rate when the ISI has to be taken into account.
Practical escape analyses: how good are they?
Authors: Kyungwoo Lee, Xing Fang, Samuel P. Midkiff
Venue: Proceedings of the 3rd international conference on Virtual execution environments (2007)

A key analysis developed for the compilation of parallel programs is thread escape analysis (hereafter referred to as escape analysis), which determines what objects are accessed in more than one thread, and which references within a program are references to such objects. Escape analysis has several important client optimizations: identifying objects on which races may exist, identifying locks that can be removed, identifying heap allocated objects referenced within a single thread, and compiling for strict memory models. While the effectiveness of individual escape analyses has been measured for different client optimizations, there has been no effort to compare the effectiveness of the different escape analyses over all the different clients. Nor has therebeen any attempt to develop a perfect escape analysis and measure how far from it the different escape analyses are. This paper presents a perfect escape analysis for specific runs of Java programs, which tracks all possibly escaping objects at runtime, and determines precisely which ones escape. It uses a caching technique to reduce the time and space needed for collecting access information by 8 times and 48 times, respectively, relative to not using the caching technique. We compare the perfect escape analysis results with the results from the practical escape analyses, using the four clients above or metrics that are significant for those clients. From this comparison we conclude that the relative precision of different escape analyses changes with different clients and that the most precise analysis for each client is "close enough" to the perfect analysis for three out of the four clients.
Neuro-Wavelet Classifier for Remote Sensing Image Classification
Authors: B. Uma Shankar, Saroj K. Meher, Ashish Ghosh
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

A neuro-wavelet supervised classifier is proposed for land cover classification of multispectral remote sensing images. Features extracted from the original pixels using wavelet transform (WT) are fed as input to a feed forward multi-layer perceptron (MLP). A set of wavelets from different groups have been used and it is found that biorthogonal3.3 wavelet performs better. The performance is evaluated on a set of remote sensing images using two quantitative indices (\beta index of homogeneity and Davies-Bouldin (DB) index for compactness and separability of classes).
Analysis of complex survey data using robust model-based and model-assisted methods
Authors: Partha Lahiri
Venue:  (2006)

Over the past few decades, major advances have taken place in both model-based and model-assisted approaches to inferences in finite population sampling. In the standard model-based approach, the finite population is assumed to be a realization from a superpopulation characterized by a probability distribution, and that the distribution of the sample is identical to that of the finite population. The model-based method could lead to a misleading inference if either assumption is violated. The model-assisted estimators typically are consistent or at least approximately unbiased with respect to the sampling design, and yet more efficient than the customary randomization-based estimators in the sense of achieving smaller variance with respect to the design if the assumed model is appropriate. Since both approaches rely on the assumed model, there is a need to achieve robustness with respect to the model selection. This is precisely the main theme of this dissertation. This study uses the well-known Box-Cox transformation on the dependent variable to generate certain robust model-based and model-assisted estimators of finite population totals. The robustness is achieved since the appropriate transformation on the dependent variable is determined by the data. Both Monte Carlo simulation study and real data analyses are conducted to illustrate the robustness properties of the proposed estimation method using two different ways: (i) design-based, and (ii) model-based, wherever appropriate. A few potential areas of future research within the context of transformations in linear regression models, as well as linear mixed models, for analysis of complex survey data are identified.
Regular expression generation through grammatical evolution
Authors: Ahmet Cetinkaya
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

This study investigates automatic regular expression generation using Grammatical Evolution. The software implementation is based on a subset of POSIX regular expression rules. For fitness calculation, a multiline text file is supplied. Lines which are required to match with generated regular expressions are specified beforehand. Fitness is evaluated according to the successful match results. Using this fitness evaluation strategy, preliminary tests have been performed on different files. Results indicate that the Grammatical Evolution approach to automatic generation of regular expressions is promising.
A quantitative analysis of evolvability for an evolutionary fuzzy logic controller
Authors: Seung-Ik Lee, Sung-Bae Cho
Venue: Integrated Computer-Aided Engineering (2003)

This paper presents a quantitative analysis of evolvability with evolutionary activity statistics in an evolutionary fuzzy system. In general, one can estimate the performance of an evolved fuzzy controller by its fitness. However, it is difficult to explain how its fitness or adaptability has been obtained. Evolutionary activity is used to measure the evolvability of fuzzy rules and explain why salient rules have higher evolvability. A genetic algorithm is used to construct a fuzzy logic controller for a mobile robot in simulation environments. The quantitative analysis shows that sufficient evolvability is maintained during the evolution and that it contributes to the construction of the optimal controller.
Fast speaker adaptation using a priori knowledge
Authors: R. Kuhn
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Previously, we presented a radically new class of fast adaptation techniques for speech recognition, based on prior knowledge of speaker variation. To obtain this prior knowledge, one applies a dimensionality reduction technique to T vectors of dimension D derived from T speaker-dependent (SD) models. This offline step yields T basis vectors, the eigenvoices. We constrain the model for new speaker S to be located in the space spanned by the first K eigenvoices. Speaker adaptation involves estimating K eigenvoice coefficients for the new speaker; typically, K is very small compared to original dimension D. Here, we review how to find the eigenvoices, give a maximum-likelihood estimator for the new speaker's eigenvoice coefficients, and summarize mean adaptation experiments carried out on the Isolet database. We present new results which assess the impact on performance of changes in training of the SD models. Finally, we interpret the first few eigenvoices obtained.
Efficient Mining of Closed Induced Ordered Subtrees in Tree-structured Databases
Authors: Tomonobu Ozaki, Takenao Ohkawa
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

In this paper, two new closed ordered subtree miners are given which are based on the breadth-first and depth-first/breadth-first enumeration strategy, respectively. Through the experiments with synthesized and real world data, we discuss the effects of the difference of the search strategies in mining closed induced ordered subtrees.
A functional articulatory dynamic model for speech production
Authors: L. J. Lee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Introduces a statistical speech production model. The model synthesizes natural speech by modeling some key dynamic properties of vocal articulators in a linear/nonlinear state-space framework. The goal-oriented movements of the articulators (tongue tip, tongue dorsum, upper lip, lower lip, and jaw) are described in a linear dynamic state equation. The resulting articulatory trajectories, combined with the effects of the velum and larynx, are nonlinearly mapped into the acoustic feature space (MFCCs). The key challenges in this model are the development of a nonlinear parameter estimation methodology, and the incorporation of appropriate prior assumptions to assert in the articulatory dynamic structure. Such a model can also be directly applied to speech recognition to better account for coarticulation and phonetic reduction phenomena with considerably fewer parameters than HMM based approaches.
From the Editor's Desk
Authors: David Alan Grier
Venue: IEEE Annals of the History of Computing (2007)

David Grier relates an anecdote from Burroughs Research Center in which the possibility of using a computer for less-than-honorable purposes becomes a lesson. He goes on to describe the issue's contents.
Leaky constant modulus algorithms: sensitivity of local minima
Authors: S. Lambotharan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We propose a new family of mixed constant modulus algorithms for the elimination of local minima associated with the fractionally spaced constant modulus algorithm in the presence of channel noise. A special case of this family is the leaky constant modulus algorithm (L-CMA). We show that L-CMA aims to minimise jointly the intersymbol interference (ISI) and the noise gain introduced by the equalizer. Moreover, we derive a suitable range of leakage factors for which all local minima due to large noise amplification are eliminated.
E-timed Workflow Nets
Authors: Ferucio Laurentiu Tiplea, Geanina Ionela Macovei
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

In this paper, E-Timed Workflow Nets are introduced, and a characterization of the soundness property for them is provided. This characterization is based on boundedness and liveness as for classical workflow nets. It is shown that the properties of boundedness and liveness for E-timed Petri nets can be reduced to the same properties for Petri nets with zero-tests on bounded places. As these two properties are decidable for Petri nets with zero-tests on bounded places, the soundness property for E-timed workflow nets is decidable.
A wireless sensor network for structural health monitoring: performance and experience
Authors: Jeongyeup Paek, K. Chintalapudi, R. Govindan
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

While sensor network research has made significant strides in the past few years, the literature has relatively few examples of papers that have evaluated and validated a complete experimental system. In this paper, we discuss our deployment experiences and evaluate the performance of a multi-hop wireless data acquisition system (called Wisden) for structural health monitoring (SHM) on a large seismic test structure used by civil engineers. Our experiments indicate that, with the latest sensor network hardware, Wisden can reliably deliver time-synchronized tri-axial structural vibration data reliably across multiple hops with low latencies for sampling rates up to 200 Hz. This performance was achieved by iteratively refining the system design using a series of test deployments. Our experiences suggested the need for careful onset detection in order to preserve the fidelity of the structure's frequency response. Furthermore, the high damping characteristics of large structures motivated an exploration of the processing, sampling, and communication limits of current platforms.
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
Authors: K. Shashi Prabh, Tarek F. Abdelzaher
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate time slots to the nodes of a network such that if the nodes transmit only during the allocated time slots, no collision occurs. For real-time applications, by ensuring deterministic channel access, transmission scheduling algorithms have the added significance of making guarantees on transmission latency possible. In this paper we present a distributed transmission scheduling algorithm for hexagonal wireless ad-hoc networks with a particular focus on Wireless Sensor Networks. Afforded by the techniques of ad-hoc networks topology control, hexagonal meshes enable trivial addressing and routing protocols. Our transmission scheduling algorithmconstructs network-wide conflictfree packet transmission schedule for hexagonal networks, where the overhead of schedule construction in terms of message exchanges is zero above and beyond that for topology control and other network control related functions. Furthermore, the schedule is optimal in the sense that the bottleneck node does not idle. We also present an implicit clock synchronization algorithm to facilitate scheduling. We derive the real time capacity of our scheduling algorithm. We present evaluations of our scheduling algorithm in the presence of topological irregularities using simulation.
A numerical method for two-dimensional Schrödinger equation using collocation and radial basis functions
Authors: Mehdi Dehghan, Ali Shokri
Venue: Computers Mathematics with Applications (2007)

In this paper, we propose a numerical scheme to solve the two-dimensional (2D) time-dependent Schrodinger equation using collocation points and approximating the solution using multiquadrics (MQ) and the Thin Plate Splines (TPS) Radial Basis Function (RBF). The scheme works in a similar fashion as finite-difference methods. The results of numerical experiments are presented, and are compared with analytical solutions to confirm the good accuracy of the presented scheme.