ppxscal/embedding_network huggingface dataset:
Clean Slate Design of Internet for Supporting Service-Oriented Computing and Applications
Authors: David H. C. Du
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

The Internet today was designed four decades ago. The scale of the Internet has grown to enormously large. With the rapid technology advancement, we now have cheap and small devices with high computing power and large storage capacity. These devices are designed to improve our daily life by monitoring our environment, collecting critical data, and executing special instructions. These devices have gradually become an essential part of our future Internet. Unprecedented amount of data are collected by these devices. How to manage and look for the desired information becomes a great challenge. At the same time, many emerging applications like service-oriented, security and real-time applications demand much better support than the current Internet can offer. To meet these challenges, NSF research funding directions for NeTS (Networking Research Cluster) and Cyber Trust Program have been adjusted. NSF also starts a major effort, called GENI (Global Environment for Networking Innovations) to resign the Internet from scratch. GENI consists of two major components: an experimental facility and a research program called FIND (Future Internet Design). We will discuss the current status of GENI, research funding directions of NOSS (Networks Of Sensor Systems) and FIND. At the University of Minnesota we are developing an intelligent storage approach that taking advantage of the technology advancement by migrating several key features from file systems and the layers above into storage devices. The research issues and potential benefits of this approach will also be briefly discussed. This serves as one of the examples of rethinking the required framework and architecture of the future Internet.
Mobile Systems from a Validation Perspective: a Case Study
Authors: Helene Waeselynck, Zoltan Micskei, Minh Duc Nguyen, Nicolas Riviere
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

Advances in wireless networking have yielded the development of mobile applications. However, sound technology to specify, design and validate such applications is still to be investigated. In order to exemplify some of the challenges that are raised, this paper reports on a case study: a group membership protocol for ad hoc networks. The protocol has been analyzed by reviewing the specification and the code, and then by testing the implementation. The outcomes provides us with hints for research direction.
Natural Search Queries for Consumer-Oriented Databases.
Authors: Marek Lipczak, Evangelos Milios
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Search in consumer-oriented databases is becoming increasingly important, as the computer becomes a commonly used tool. Such databases are at the heart of e-mail managers, flight booking, and other e-commerce systems. Key problems associated with such searches are the structure and interface of the search query. The traditional solution for these problems involves the use of a separate text field for each element of the query structure. However, the requirement to support ever increasing numbers of inexperienced users, who require an efficient and user-friendly interface, is not met by the traditional solution. We present Natural Search Queries (NSQ), a simple and intuitive approach to the search of structured information. Our solution combines the ideas of natural language database interfaces and operator based search; queries, in simplified and intuitive natural language, are entered into a single text field. It is a front-end search interface oriented towards the common user. Our aim is to allow as much freedom in formulating queries as possible, while interpreting such queries as accurately as possible, to automatically extract the elements of the query structure. In our project, we address the problem of e-mail databases, but the results may be applicable to other databases oriented towards consumer users. The paper introduces the grammar of Natural Search Queries and probabilistic methods for recognizing the query structure (i.e., parsing, and Hidden Markov Model). In addition, we demonstrate a complete implementation of a system for processing NSQs and presenting retrieved messages. A specific subproblem that was addressed is the deterministic recognition of natural date constraints. Tests show promising results in processing a broad range of Natural Search Queries.
Analysis of Si-body thickness variation for a new 40 nm gate length bFDSOI
Authors: Jyi-Tsong Lin, Yi-Chuen Eng, Tai-Yi Lee, Kao-Cheng Lin
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In this work, a novel fully depleted silicon-oninsulator MOSFET with block oxide (bFDSOI) is proposed to investigate the influence of Si-body thickness on the characteristics of the device. Based on the two-dimensional (2-D) simulation results, the proposed structure exhibits better ultra-short-channel behavior such as reduced drain-induced barrier lowering (DIBL) and better subthreshold swing when compared with that of a conventional ultra-thin body (UTB) SOI structure. Furthermore, thanks to the presence of thick Si-body, the bFDSOI FET also shows reduced thermal effects that can help to improve the device reliability.
Quadratic invariants and multi-symplecticity of partitioned Runge-Kutta methods for Hamiltonian PDEs
Authors: Yajuan Sun
Venue: Numerische Mathematik (2007)

In this paper, we study the preservation of quadratic conservation laws of Runge-Kutta methods and partitioned Runge-Kutta methods for Hamiltonian PDEs and establish the relation between multi-symplecticity of Runge-Kutta method and its quadratic conservation laws. For Schr&#x00f6;dinger equations and Dirac equations, it reveals that multi-symplectic Runge-Kutta methods applied to equations with appropriate boundary conditions can preserve the global norm conservation and the global charge conservation, respectively.
Algorithms for reliable peer-to-peer networks
Authors: Andrew T. Campbell
Venue:  (2006)

This thesis addresses the problem of the lack of reliability in peer-to-peer networks, and proposes a number of algorithms that can provide reliability guarantees to peer-to-peer applications. Note that reliability in a peer-to-peer networking context is different from TCP type reliability. We define a reliable peer-to-peer as a network that is resilient to changes such as network dynamics, and can offer participating peers increased performance when possible. We make the following contributions to area of peer-to-peer reliability: (1) we propose an algorithm that creates resilient low-diameter topologies that guarantee an upper bound on delays among nodes; (2) we study parallel downloads in peer-to-peer networks and how they affect nodes by looking at their utilities and the overall performance of the network; and (3) we investigate network metrics relevant to peer-to-peer networks and their estimation using incomplete information. While we focus on latency and hop count as drivers for improving the performance of the peers, the proposed approach is more generally applicable to other network-wide metrics (e.g., bandwidth, loss). Our research methodology encompasses simulations and analytical analysis to understand the behavior and properties of the proposed systems, and substantial experimentation, as practical proof of concept of our ideas, using the PlanetLab platform. The common overarching theme of the thesis is the design of new resilient network algorithms capable of offering high-performance to peers and their applications. As more and more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of topologies have emerged over the last several years, all of which have various strengths and weaknesses. For example, the popular structured peer-to-peer topologies based on Distributed Hash Tables (DHTs) offer applications assured performance, but are not resilient to attacks and major disruptions that are likely in the overlay. In contrast, unstructured topologies where nodes create random connections among themselves on-the-fly, are resilient to attacks but can not offer performance assurances because they often create overlays with large diameters, making some nodes practically unreachable. In our first contribution, we propose Phenix, an algorithm for building resilient low-diameter peer-to-peer topologies that can resist different types of organized and targeted malicious behavior. (Abstract shortened by UMI.)
A novel concept of phase-compensated continuous-time filters
Authors: Jacek Piskorowski, Roman Kaszynski
Venue: Analog Integrated Circuits and Signal Processing (2007)

In this paper, we will address the question of how to design a continuous-time filter that provides both a constant delay and a maximally flat magnitude response over the desired frequency band, and at the same time ensures the transient of the designed filter as short as possible. The paper presents a theoretical concept of time-varying Butterworth filters with compensated group delay response. Using the compensated Butterworth filter, we introduce time-varying parameters to its structure for the purpose of the minimization of the transient that was lengthened because of the process of the compensation. Results verifying the effectiveness of the proposed approach are presented and compared to the traditional filters. This paper is an updated and extended version of Piskorowski, J. (2006). Analog Integrated Circuits and Signal Processing, 47, (2):233---241.
Knit: component composition for systems software
Authors: Alastair Reid, Matthew Flatt, Leigh Stoller, Jay Lepreau, Eric Eide
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

Knit is a new component definition and linking language for systems code. Knit helps make C code more understandable and reusable by third parties, helps eliminate much of the performance overhead of componentization, detects subtle errors in component composition that cannot be caught with normal component type systems, and provides a foundation for developing future analyses over C-based components, such as cross-component optimization. The language is especially designed for use with component kits, where standard linking tools provide inadequate support for component configuration. In particular, we developed Knit for use with the OSKit, a large collection of components for building low-level systems. However, Knit is not OSKit-specific, and we have implemented parts of the Click modular router in terms of Knit components to illustrate the expressiveness and flexibility of our language. This paper provides an overview of the Knit language and its applications.
Systematic generation of glass-box test cases for functional logic programs
Authors: Sebastian Fischer, Herbert Kuchen
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

We employ the narrowing-based execution mechanism of the functional logic programming language Curry in order to automatically generate a system of test cases for glass-box testing of Curry programs. The test cases for a given function are computed by narrowing a call to that function with initially uninstantiated arguments. The generated test cases are produced w.r.t. a selected code-coverage criterion such as control-flow coverage. Besides an adaption of the notion of control-flow coverage to functional (logic) programming, we present a novel coverage criterion for this programming paradigm. A particular difficulty of the adaption is the handling of laziness.
Visual understanding environment
Authors: Anoop Kumar
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

The Visual Understanding Environment (VUE) project at Tufts' Academic Technology department aims at providing faculty and students with tools to successfully integrate digital resources into their teaching and learning. VUE not only provides a visual environment for structuring, presenting, and sharing digital information but also viewing digital resources along with their metadata. The demonstration will showcase the federated search capabilities of VUE that enable users to search across multiple digital repositories. We will also present concept maps created using digital objects from repositories.
Porting legacy engineering applications onto distributed NT systems
Authors: N. K. Allsopp, T. P. Cooper, P. Ftakas, P. C. Macey
Venue: Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3 (1999)

In this paper we present our experiences developing two distributed computing applications on NT. In both examples a legacy application is ported from Unix to NT and is then further developed to be a distributed application within the NT environment. We shall present two different approaches to managing the remote execution of tasks. One is a port of a serial vibroacoustic analysis code called PAFEC VibroAcoustic and the other is the parallelisation of the non-linear analysis modules of the LUSAS FE analysis package. We shall show in these two projects that it is technically possible to carry out scientific computing on a distributed NT resource.
Partial-result-reuse architecture and its design technique for morphological operations
Authors: Shao-Yi Chien
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper proposes a new cost-effective architecture for mathematical morphology named partial-result-reuse (PRR) architecture. For many real-time applications of mathematical morphology, the hardware implementation is necessary; however, the hardware cost of most existing morphology architectures is too high when dealing with large structuring elements. With the partial-result-reuse concept and self-affinity property of general structuring elements, the proposed architecture is more cost-effective and more general than the existing morphology architectures. It can deal with morphological operations with arbitrary structuring elements and can be used for other semi-group operations, and only 2[log/sub 2/n] comparators are needed for n/spl times/n structuring elements. Simulation shows that this architecture can dramatically reduce the hardware cost of morphological operations with all kinds of structuring elements.
Simple continuous media storage server on real-time mach
Authors: Hiroshi Tezuka, Tatsuo Nakajima
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

This paper presents the design and implementation of a simple continuous media storage server: CRAS on Real-Time Mach. CRAS is a specially optimized storage system for retrieving multiple continuous media streams such as audio and video from a disk at constant rates for small scale distributed multimedia systems. Many previous continuous media storage servers have focussed on high throughput for supporting as many video sessions as possible. However, these servers are too big and complicated for playback applications that retrieve continuous media data from the local disks of personal computers. Also, there are many continuous media systems requiring small continuous media storage servers that can be shared by a small number of applications. To reduce hardware costs, the servers should run on less powerful computers. This means that the previous big and complicated servers are not appropriate for such small scale environments. We show that our simple continuous media server for small scale systems can guarantee the retrieval of continuous media data at a constant rate, and provide high throughput even though it is compact and simple.
Activity Pre-Scheduling in Grid Workflows
Authors: G. Tretola, E. Zimeo
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Grid Computing is becoming a prominent field of interest for distributed systems. The capability to support resource sharing between different organizations and the high level of performance are noteworthy features. However, to define, deploy and execute Grid Applications require significant design effort and complex resource coordination, which can be alleviated by using Workflow management systems. This technology is more and more adopted in distributed systems and Grids since it ensures easiness and flexibility at design-time and performance and dynamicity at run-time. This paper gives a contribution to performance improvements of workflow by presenting a technique to exploit fine-grained concurrency at run-time. The technique is implemented in a workflow enactment service that dynamically optimizes process execution limiting the design effort of application developers.
Statistical models for topic identification using phoneme substrings
Authors: J. H. Wright, M. J. Carey, E. S. Parris
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Phoneme substrings that are recurrent within training data are detected and logged using dynamic programming procedures. The resulting keystrings (cluster centroids) are awarded a usefulness rating based on smoothed occurrence probabilities in wanted and unwanted data. The rankings of the keystrings by usefulness measured on training, development test and final test data for three language-pairs from the OGI multi-language corpus are highly consistent, showing that language-specific features are being found. Statistical measures of local association also suggest that keystring occurrences can be correlated in a manner similar to that of keywords for a particular topic. With improved recognition accuracy it should be possible to exploit this information in order to enhance performance in topic identification.
The Rules of Time on NTFS File System
Authors: K. P. Chow, Frank Y. W. Law, Michael Y. K. Kwan, Pierre K. Y. Lai
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

With the rapid development and popularity of IT technology, criminals and mischievous computer users are given avenues to commit crimes and malicious activities. As forensic science has long been used to resolve legal disputes regarding different branches of science, computer forensics is developed naturally in the aspects of computer crimes or misbehaviors. In computer forensics, temporal analysis plays a significant role in the reconstruction of events or crimes. Indeed, temporal analysis is one of the attractive areas in computer forensics that caused a large number of researches and studies. It is the purpose of this paper to focus on temporal analysis on NTFS file system and to project intuitional rules on the behavioral characteristics of related digital files.
Efficient ML training of CDHMM parameters based on prior evolution, posterior intervention and feedback
Authors: Qiang Hue
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

We present an efficient maximum likelihood (ML) training procedure for Gaussian mixture continuous density hidden Markov model (CDHMM) parameters. This procedure is proposed using the concept of approximate prior evolution, posterior intervention and feedback (PEPIF). In a series of experiments for training CDHMMs for a continuous Mandarin Chinese speech recognition task, the new PEPIF procedure achieves a 4-fold speed-up in terms of user CPU time over that of the Baum-Welch algorithm in producing models of given likelihood or recognition accuracy.
Embedded Tutorial: IC Test Cost Benchmarking
Authors: Klaus Luther
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

Driven by the increasing complexity of integrated circuits the pressure on test cost reduction increases exponentially as productivity on chip level progresses according to Moore's Law.
An approach of lateral RF MEMS switch for high performance
Authors: M. Tang, A. Agarwal, J. Li, Q. X. Zhang, P. Win
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

This paper presents a novel type of lateral series microwave switch on a silicon-on-insulator (SOI) substrate with a coplanar waveguide (CPW) configuration. It is built with a cantilever beam at the side of the gap of the microwave t-line and laterally driven by electrostatic force. The mechanical structures are made of single-crystal-silicon and fabricated by deep reactive ion etch (DRIE) technology. Evaporated aluminum serves as contact material. The fabrication process only needs one mask. The measured result shows up to 26.5 GHz the isolation of the switch is over 18 dB. The threshold voltage is about 12 volts.
The effect of focused attention on audio-visual quality perception with applications in multi-modal codec design
Authors: A. Rimell
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Understanding the perceptual processes involved in cross-modal interaction is necessary for multi-modal codec design and automatic multimedia quality prediction systems. By using a multi-modal codec, the auditory and visual streams are considered to be a single entity, thus resulting in an improved performance for a given system bandwidth. This paper describes an experiment which examines the effect on focus of attention on quality prediction. It shows that, if attending a certain modality (auditory or visual), one's ability to detect errors in the other modality is impaired compared to the case when one is attending equally to both modalities.
Automated Ensemble Extraction and Analysis of Acoustic Data Streams
Authors: Eric P. Kasten, Philip K. McKinley, Stuart H. Gage
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

This paper addresses the design and use of distributed pipelines for automated processing of sensor data streams. In particular, we focus on the detection and extraction of meaningful sequences, called ensembles, from acoustic data streamed from natural areas. Our goal is automated detection and identification of various species of birds. Although this target application is relatively specific, the process employed is general and can be extended to other problem domains such as security systems and military reconnaissance.
Outcomes-based assessment for comprehensive curriculum development in mechatronics
Authors: E. Carlson
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The paper describes a comprehensive assessment plan that was carried out as part of an NSF-funded effort to integrate principles of mechatronics throughout the Mechanical and Electrical Engineering curricula at the University of Detroit Mercy. The project team consists of faculty members from three departments: Electrical and Computer Engineering, Mechanical Engineering, and Education. The focus of the article is a description of how the assessment results have been used to refine one curricular component of the project: the senior-level course in mechatronics. We present an overview of the project, a summary of the assessment framework, initial results of the formative assessment of the mechatronics course, and an evolving model of outcome based curriculum development.