ppxscal/embedding_network huggingface dataset:
The Next Generation of Monitoring and Control Systems Using Synchronized Sampling Technology and Multifunctional IEDs
Authors: Mladen Kezunovic
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper discusses implementation of the next generation solution for power system control and monitoring. The new design is based on the use of synchronized sampling technology and multifunctional Intelligent Electronic Designs (IEDs). The advantages of such systems are discussed pointing out new benefits to be gained by different users.. The new solution enables full use of field recorded IED data by various utility groups such as protection engineers, dispatchers, maintenance crews, asset managers, and independent system operators. The deployment strategy and examples of initial steps are presented making reference to the specific on-going project aimed at field deployment of the solution.
Wireless Sensor Network Applications in Urban Telehealth
Authors: Patricia A. Morreale
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Advances in wireless sensor network management have potential applications in urban telehealth. Telehealth is the delivery of health related services and information via telecommunications technologies. Previous efforts on telemedicine management have focused on medical care for rural populations, however urban communities will benefit significantly from advances in wireless network design and management. Within the domain of occupational and physical therapy, known as telerehabilitation, expected active benefits to urban communities include greater adherence to rehabilitation protocol due to ease of use and removal of the travel requirement for multiple weekly trips to clinical site and clinical appointments. Additionally, passive benefits are envisioned to include monitoring of the environment, such as balconies, interior and hallway spaces for detection of road and urban pollutants, including cigarette, exhaust, and cleaning products. The integration of active and passive sensing would provide a more complete picture of the therapy client's living environment and the therapy practice within that environment. This information can be provided by the proposed wireless sensor network application.
Avoiding distortions due to speech coding and transmission errors in GSM ASR tasks
Authors: A. Gallardo-Antolin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We have extended our previous research on a new approach to automatic speech recognition (ASR) in the GSM environment. Instead of recognizing from the decoded speech signal, our system works from the digital speech representation used by the GSM encoder. We have compared the performance of a conventional system and the one we propose on a speaker independent, isolated-digit ASR task. For the half and full-rate GSM codecs, from our results, we conclude that the proposed approach is much more effective in coping with the coding distortion and transmission errors. Furthermore, in clean speech conditions, our approach does not impoverish the recognition performance, even recognizing from GSM digital speech, in comparison with a conventional system working on unencoded speech.
Gippy: Campus GIS Information System Supported by P2P
Authors: Fengyuan Xu, Zhiyi Fang, Xiao Han
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Geographical Information System (GIS) integrates operation and synthesis analysis of multi-factor information, satisfying the demand of high efficiency and visual performance in human computer Interaction, whereas Peer-to-Peer (P2P) technology assigns and utilizes network resources flexibly, making information exchange more dynamic and real-time with participants' autonomy to certain extent. Therefore, by the thought of uniting information processing merits of GIS and P2P, a design method of new information service system - Gippy - is introduced to keep pace with information exchange demands among dispersed governance regions, especially as universities. It is discussed in this paper that Gippy's key achieving technologies including its applications as well as architecture characteristics. We also points out new value-added functions adopted by Gippy, and give a research on feasibility of optimizing and extending.
Integration of speech and vision using mutual information
Authors: D. Roy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

We are developing a system which learns words from co-occurring spoken and visual input. The goal is to automatically segment continuous speech at word boundaries without a lexicon, and to form visual categories which correspond to spoken words. Mutual information is used to integrate acoustic and visual distance metrics in order to extract an audio-visual lexicon from raw input. We report results of experiments with a corpus of infant-directed speech and images.
Efficient test-based model generation for legacy reactive systems
Authors: T. Margaria, O. Niese, H. Raffelt, B. Steffen
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

We present the effects of using an efficient algorithm for behavior-based model synthesis which is specifically tailored to reactive (legacy) system behaviors. Conceptual backbone is the classical automata learning procedure L*, which we adapt according to the considered application profile. The resulting learning procedure L*Meal , which directly synthesizes generalized Mealy automata from behavioral observations gathered via an automated test environment, drastically outperforms the classical learning algorithm for deterministic finite automata. Thus it marks a milestone towards opening industrial legacy systems to model-based test suite enhancement, test coverage analysis, and online testing.
Security Verification Techniques Applied to PatchLink COTS Software
Authors: David P. Gilliam, John D. Powell, Matt Bishop, Chris Andrew, Sameer Jog
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Verification of the security of software artifacts is a challenging task. An integrated approach that combines verification techniques can increase the confidence in the security of software artifacts. Such an approach has been developed by the Jet Propulsion Laboratory (JPL) and the University of California at Davis (UC Davis). Two security verification instruments were developed and then piloted on PatchLink's UNIX Agent, a Commercial- Off-The-Shelf (COTS) software product, to assess the value of the instruments and the approach. The two instruments are the Flexible Modeling Framework (FMF) -- a model-based verification instrument (JPL), and a Property-Based Tester (UC Davis). Security properties were formally specified for the COTS artifact and then verified using these instruments. The results were then reviewed to determine the effectiveness of the approach and the security of the COTS product.
DiSTiL: a transformation library for data structures
Authors: Yannis Smaragdakis, Don Batory
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

DiSTiL is a software generator that implements a declarative domain-specific language (DSL) for container data structures. DiSTiL is a representative of a new approach to domain-specific language implementation. Instead of being the usual one-of-a-kind stand-alone compiler, DiSTiL is an extension library for the Intentional Programming (IP) transformation system (currently under development by Microsoft Research). DiSTiL relies on several reusable, general-purpose infrastructure tools offered by IP that substantially simplify DSL implementation.
Interference mitigation in spread spectrum using discrete evolutionary and Hough transforms
Authors: R. Suleesathira
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Jammer excision enhances the interference immunity in direct sequence spread spectrum (DSSS) communications. We propose an instantaneous frequency (IF) estimation method for a jammer composed of chirps, that uses evolutionary spectrum and Hough transform. The estimation requires no parametric representation of the IF and provides a correction by means of dechirping and low-pass filtering. Synthesis of the multicomponent jammer and its excision from the received signal is made possible with excellent results. Localized processing, linearization of the IF estimate, recursive correction, and no problems due to cross-terms in the time-frequency distribution or in the matching of parametric models make the proposed procedure efficient and practical. The performance of the IF estimation and its application in DSSS communications are illustrated.
Characterization and modeling of silicon integrated spiral inductors for high-frequency applications
Authors: Tonio Biondi, Angelo Scuderi, Egidio Ragonese, Giuseppe Palmisano
Venue: Analog Integrated Circuits and Signal Processing (2007)

This paper presents the characterization and modeling of 0.3- to 0.8-nH radial patterned ground shield circular inductors fabricated in a silicon bipolar technology for RF applications. An extensive validation of measurement accuracy is first addressed taking into account both calibration and de-embedding issues. A novel five-step de-embedding technique is also proposed to improve the accuracy of small inductor measurements. The accuracy of de-embedded experimental data in the range 0.3-0.8 nH is demonstrated by comparing the measured low-frequency inductance with electromagnetic simulations of a large set of inductors. Based on both electromagnetic simulations and experimental measurements, the well-known current sheet expression for circular spirals is revised and modified to improve its accuracy at lower inductance values. The proposed expression is also extended to inductors with polygonal geometries showing significant improvements with respect to the state-of-the-art. Finally, the original and modified expressions are employed in a lumped scalable model for silicon spiral inductors. Comparisons with measured data revealed that the modified expression allows error reductions as large as 20% with respect to the original one, on both inductance and quality factor simulations.
Simulation of Image Enhancement Techniques Using Matlab
Authors: Atul Bansal, Rochak Bajpai, J. P. Saini
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This paper emphasis on the importance of simulation techniques in the field of Digital Image Processing. Simulations are carried out for implementation of various basic Image enhancement techniques on MatLAB in spatial domain as well as the frequency domain. Through this simulation, it is concluded that the frequency domain analysis is easier to implement as compared to spatial domain and also it is concluded that one can understand the complex procedures of Image Processing provided he/she is able to analyze the results and compare it with the theoretical results mentioned in various books.
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
Authors: Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks (VANETs), etc. To deal with such networks researchers have suggested to use controlled replication or "spraying" methods that can reduce the overhead of flooding-based schemes by distributing a small number of copies to only a few relays. These relays then "look" for the destination in parallel as they move into the network. Although such schemes can perform well in scenarios with high mobility (e.g. VANETs), they struggle in situations were mobility is slow and correlated in space and/or time. To route messages efficiently in such networks, we propose a scheme that also distributes a small number of copies to few relays. However, each relay can then forward its copy further using a single-copy utility-based scheme, instead of naively waiting to deliver it to the destination itself. This scheme exploits all the advantages of controlled replication, but is also able to identify appropriate forwarding opportunities that could deliver the message faster. Simulation results for traditional mobility models, as well as for a more realistic "community-based" model, indicate that our scheme can reduce the delay of existing spraying techniques up to 20 times in some scenarios.
First-Order and Temporal Logics for Nested Words
Authors: Rajeev Alur, Marcelo Arenas, Pablo Barcelo, Kousha Etessami, Neil Immerman, Leonid Libkin
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure of parse trees and other tree-structured data, such as XML. We provide new temporal logics for finite and infinite nested words, which are natural extensions of LTL, and prove that these logics are first-order expressively-complete. One of them is based on adding a "within" modality, evaluating a formula on a subword, to a logic CaRet previously studied in the context of verifying properties of recursive state machines. The other logic is based on the notion of a summary path that combines the linear and nesting structures. For that logic, both model-checking and satisfiability are shown to be EXPTIME-complete. Finally, we prove that first-order logic over nested words has the three-variable property, and we present a temporal logic for nested words which is complete for the twovariable fragment of first-order.
Applying Digital Evolution to the Development of Self-Adaptive ULS System
Authors: Philip K. McKinley, Betty H. C. Cheng, Charles A. Ofria
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

A key characteristic for ultra-large scale (ULS) softwareintensive systems is the need to adapt at run time in response to changing environmental conditions. Given the scale, complexity, and heterogeneity of ULS elements, innovative, but rigorous software engineering techniques are needed to address the development and the evolution of these systems. The developer of self-adaptive ULS systems must anticipate how and when the software will need to adapt in the future, codify this behavior in decision-making components to govern the adaptation, and ensure that system integrity is not compromised during adaptations. We contend that the full potential of dynamically adaptive software systems cannot be realized without environments that enable the developer to actively explore the "adaptation space" of the system during the early stages of design. We propose an approach to this problem that leverages and extends digital evolution techniques. By mapping models of adaptive software programs into digital organisms and studying traces of their evolution, the developer can gain critical insight into software decision making, software assurance, and the software infrastructure needed to support desired adaptations.
SU8 resist plasma etching and its optimisation
Authors: Guodong Hong, A. S. Holmes, M. E. Heaton
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The thick photoresist SU8, by virtue of its good mechanical durability, water impermeability and dielectric properties on polymerisation, is widely used as a resin for making high aspect ratio, functional MEMS device structures and packaging parts. However, the difficulty associated with removal, stripping or repatterning of the polymerised SU8 remains a serious issue. This paper presents a novel process, based on O/sub 2//SF/sub 6/ plasma etching, for patterning or removal of fully cross-linked SU8. The Taguchi methodology is used to optimise the O/sub 2//SF/sub 6/ mix for a high etch rate and low under cut.
A feature-based subband coding scheme
Authors: J. R. Casas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

A feature-based subband coding scheme is presented. It is intended for the coding of the texture component of a two-component image model. The primary component contains the strong edges, individually described by their amplitudes and positions. A morphological interpolation technique, presented by Casas, Salembier and Torres (see IEEE International Conference on Image Processing, vol.I, p.526-9, 1995), reconstructs the smooth areas of the image from the coded transitions. The residual texture component is coded by subband decomposition. Information about the edge structure, available from the primary component, is used for texture coding by employing adaptive quantizers and bit allocations over arbitrarily shaped regions. This feature-based subband coding technique produces subjective improvements over conventional subband schemes. The enhanced rendition of the strong edges is especially noticeable at very-low bit-rates. The coding of the primary component, based on morphological tools, is also more efficient and of lower complexity than in previously reported schemes for two-component image coding models.
Random coding bound for the second moment of multidimensional lattices
Authors: B. D. Kudryashov, K. V. Yurkov
Venue: Problems of Information Transmission (2007)

Efficiency of lattice quantization depends on the parameter of a lattice called the normalized second moment of the Voronoi polyhedron. We apply random-coding methods to study lattices generated by q-ary linear codes. We prove that in this class there are lattices with the normalized second moment close to the theoretically attainable limit.
Constructing Robust Good Lattice Rules for Computational Finance
Authors: Xiaoqun Wang
Venue: SIAM Journal on Scientific Computing (2007)

The valuation of many financial derivatives leads to high-dimensional integrals. The constructions of robust or universal good lattice rules for financial applications are both important and challenging. An important common feature of the integrands in computational finance is that they can often be well approximated by a sum of low-dimensional functions, i.e., functions that depend on only a small number of variables (usually just two variables). For numerical integration of such functions the quality of the low-order (i.e., low-dimensional) projections of the node set is crucial. In this paper we propose methods to construct good lattice points with &ldquo;optimal&rdquo; low-order projections. The quality of a point set is measured by a new measure called elementary order-$\ell$ discrepancy, which measures the quality of all order-$\ell$ projections and is more informative than usual measures. Two constructions, namely the Korobov and the component-by-component constructions, are studied such that the low-order projections are optimized. Numerical experiments demonstrate that even in high dimensions it is possible to construct new good lattice points with order-$2$ projections that are better than those of the Sobol&rsquo; points and random points and with higher-order projections that are no worse (while the Sobol&rsquo; points lost the advantage over random points in order-$2$ projections on the average). The new lattice rules have the potential to improve upon the accuracy for favorable functions, while doing no harm for unfavorable ones. Their applications for pricing path-dependent options and American options (based on the least-square Monte Carlo method) are studied and their high efficiency is demonstrated. A nice surprise revealed is the robustness property of such lattice rules: the good projection property and the suitability for a large range of problems. The potential possibility and limitations of good lattice points in achieving good quality of moderate- and high-order projections is investigated. The reason why classical lattice rules may not be efficient for high-dimensional finance problems is also discussed.
A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
Authors: Jin-Bao Jian, You-Fang Zeng, Chun-Ming Tang
Venue: Computers Mathematics with Applications (2007)

In this work, combining the properties of the generalized super-memory gradient projection methods with the ideas of the strongly sub-feasible directions methods, we present a new algorithm with strong convergence for nonlinear inequality constrained optimization. At each iteration, the proposed algorithm can sufficiently use the information of the previous t steps' iterations to generate a new iterative point. Particularly, the intervals of parameters in the super-memory gradient projection direction are adjustable. The main properties of the new algorithm are described as follows: (i) the improving super-memory gradient projection direction is a combination of the generalized gradient projection and the t steps' super-memory gradients, which include both the previous t steps' search directions and gradients; moreover, only the gradients associated with a generalized active constrained set are dealt with rather than the gradients of all constraints; (ii) the initial point can be chosen arbitrarily, and at each iteration, the number of the functions satisfying the inequality constraints is nondecreasing. Especially, once a feasible iteration is obtained, then the subsequent iterations are also feasible; (iii) under suitable assumptions, it possesses global and strong convergence. Finally, some preliminary numerical results show that the proposed algorithm is promising.
Guest Editors' Introduction: special issue on ACM VRCIA 2006: Editorials
Authors: Hanqiu Sun, Enhua Wu, George Baciu
Venue: Computer Animation and Virtual Worlds (2007)

No Abstract.
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
Authors: Jose Duato
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Deadlock avoidance is a key issue in wormhole networks. A first approach [8] consists of removing the cyclic dependencies between channels. Although this is a necessary and sufficient condition for deadlock-free deterministic routing, it is only a sufficient condition for deadlock-free adaptive routing. A more powerful approach [12] only requires the absence of cyclic dependencies on a connected channel subset. The remaining channels can be used in almost any way. In this paper, we propose a necessary and sufficient condition for deadlock-free adaptive routing. This condition is the key for the design of maximally adaptive routing algorithms with minimum restrictions. Some examples are given, showing the application of the new theory. In particular, we propose a partially adaptive routing algorithm for k-ary n-cubes which doubles the throughput without increasing the hardware complexity significantly.