ppxscal/embedding_network huggingface dataset:
Spectrum Emitted by a Trapped Electron
Authors: Pietro Paolo Corso, Emilio Fiordilino, Gianfranco Orlando, Franco Persico
Venue: Open Systems Information Dynamics (2007)

We study the behaviour of a homonuclear molecule driven by an intense laser field. Newton's laws are used to describe the dynamics of nuclei while the quantal approach is reserved to the study of the electron. It is observed that the nuclei can oscillate or dissociate according to the degree of ionization of the molecule. In case of low ionization rate it is shown that great amount of information can be obtained by using the simplified approaches of fixed nuclei and of two-state approximation. Under suitable conditions the electron wave function spends a long time localized around one nucleus. The harmonic generation of the molecule is studied and seen to contain even harmonics.
Acme: a user interface for programmers
Authors: Rob Pike
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

A hybrid of window system, shell, and editor, Acme gives text-oriented applications a clean, expressive, and consistent style of interaction. Traditional window systems support interactive client programs and offer libraries of pre-defined operations such as pop-up menus and buttons to promote a consistent user interface among the clients. Acme instead provides its clients with a fixed user interface and simple conventions to encourage its uniform use. Clients access the facilities of Acme through a file system interface; Acme is in part a file server that exports device-like files that may be manipulated to access and control the contents of its windows. Written in a concurrent programming language, Acme is structured as a set of communicating processes that neatly subdivide the various aspects of its tasks: display management, input, file server, and so on. Acme attaches distinct functions to the three mouse buttons: the left selects text; the middle executes textual commands; and the right combines context search and file opening functions to integrate the various applications and files in the system. Acme works well enough to have developed a community that uses it exclusively. Although Acme discourages the traditional style of interaction based on typescript windows-- teletypes--its users find Acme's other services render typescripts obsolete.
Adaptive Business Protocol Support in Service Oriented B2B Collaborations
Authors: Adomas Svirskas, Justinas Bedzinskas, Bob Roberts, Ioannis Ignatiadis, Michael Wilson
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Service Oriented Architecture approach in general and the Web services technology in particular are becoming more and more important in modern networked organisations and Virtual Organisations (VO). However, it is not enough to have the business functionality of the partners packaged as (Web) services; there is also a need for business-aligned order of interaction between these services a.k.a. business protocols, which can also be reused. This paper discusses business protocol adaptivity aspects and suggests some ideas how to support the changes in the business protocols in implementations of the partners' services (end-points).
Frequency estimation, phase unwrapping and the nearest lattice point problem
Authors: I. V. L. Clarkson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In this paper, we examine the relationship between frequency estimation and phase unwrapping and a problem in algorithmic number theory known as the nearest lattice point problem. After briefly reviewing the theory of these three topics, we introduce an interpretation of the maximum likelihood frequency estimation problem as a nearest lattice point problem. We develop an algorithm based on this approach and present numerical results to compare its performance with other estimation techniques. We find that the algorithm has good powers of estimation. 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
The design and implementation of an IPv6/IPv4 network address and protocol translator
Authors: Marc E. Fiuczynski, Vincent K. Lam, Brian N. Bershad
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

IPv6 is a new version of the internetworking protocol designed to address the scalability and service shortcomings of the current standard, IPv4. Unfortunately, IPv4 and IPv6 are not directly compatible, so programs and systems designed to one standard can not communicate with those designed to the other. IPv4 systems, however, are ubiquitous and are not about to go away "over night" as the IPv6 systems are rolled in. Consequently, it is necessary to develop smooth transition mechanisms that enable applications to continue working while the network is being upgraded. In this paper we present the design and implementation of a transparent transition service that translates packet headers as they cross between IPv4 and IPv6 networks. While several such transition mechanisms have been proposed, ours is the first actual implementation. As a result, we are able to demonstrate and measure a working system, and report on the complexities involved in building and deploying such a system.
Fault Tolerance Connectors for Unreliable Web Services
Authors: Nicolas Salatge, Jean-Charles Fabre
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Web Services are commonly used to implement service oriented architectures/applications. Service-oriented applications are large-scale distributed applications, typically highly dynamic, by definition loosely coupled and often unstable due to the unreliability of Web Services, which can be moved, deleted, and are subject to various sources of failures. In this paper, we propose customizable fault-tolerance connectors to add fault-tolerance to unreliable Web Services, thus filling the gap between clients and Web Service providers. Connectors are designed by clients, providers or dependability experts using the original WSDL description of the service. These connectors insert detection actions (e.g. runtime assertions) and recovery mechanisms (based on various replications strategies). The connectors can use identical or equivalent available service replicas. The benefits of this approach are demonstrated experimentally.
A Maximum Likelihood Approach to Noise Estimation for Intensity Measurements in Biology
Authors: Frank Klawonn, Claudia Hundertmark, Lothar Jansch
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Often, measurement of biological components generates results, that are corrupted by noise. Noise can be caused by various factors like the detectors themselves, sample properties or also the process of data processing and appears independently from the applied technology. When measuring two identical samples it can be observed that similar signal intensities may have inherent but varying levels of noise and that the ratio of noise decreases with increasing signal intensities. In this paper a statistical approach is introduced to estimate the noise inherent in the measured data. Based on this estimation, it is possible to provide information about the reliability of a measured signal and whether the difference between intensities is mainly caused by noise or by biological relevant cellular alterations.
An Improved Fast Handover Algorithm Based on HMIPv6
Authors: Song Jian, Zhang Bao-jie, Sun Wei, Che Rong, Yu Yong
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

In the next generation Internet and cell networking, the mobility based on IPv6 is meant to be key technology and application. This paper analyses the Mobile IPv6 and existing improved Mobile IPv6, with the drawbacks showed. By study on Hierarchical Mobile IPv6 and the nodes' mobility and service characters, a new improved MAP choice scheme is proposed and the multicast mechanism is introduced to Macro/Micro mobility management. And by comparing the proposed algorithm with current HMIPv6, the excellent performance, for instance, less frequency of macro-mobility handover and more reliable communication, is showed at last.
Towards Learning Privacy Policies
Authors: Arosha K. Bandara, Alessandra Russo, Emil C. Lupu
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

With the proliferation of personal computing devices users are creating a variety of digitized personal information, from personal contact databases and multimedia content to context data such as location, activity and mood. Preventing unintended disclosure of such information is a key motivator for developing privacy management frameworks. It is equally critical that protecting privacy does not prevent users from completing essential tasks. For example, whilst a user does not generally make his location available, he may want to disclose it to the taxi company with which he has booked a journey. It is impractical for the user to always specify his preferences in advance and it is impossible to forecast every possible scenario. Furthermore, conflicts may arise due to apparently conflicting requirements or due to the diversity of situations encountered. Therefore there is a need to be able to learn privacy requirements from the user's behaviour and decisions and to be able to analyse privacy requirements for consistency. Otherwise the overhead of using the privacy management system could cause it to be disabled completely.
Adding syntax to dynamic programming for aligning comparable texts for the generation of paraphrases
Authors: Siwei Shen, Dragomir R. Radev, Agam Patel, Güneş Erkan
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Multiple sequence alignment techniques have recently gained popularity in the Natural Language community, especially for tasks such as machine translation, text generation, and paraphrase identification. Prior work falls into two categories, depending on the type of input used: (a) parallel corpora (e.g., multiple translations of the same text) or (b) comparable texts (non-parallel but on the same topic). So far, only techniques based on parallel texts have successfully used syntactic information to guide alignments. In this paper, we describe an algorithm for incorporating syntactic features in the alignment process for non-parallel texts with the goal of generating novel paraphrases of existing texts. Our method uses dynamic programming with alignment decision based on the local syntactic similarity between two sentences. Our results show that syntactic alignment outrivals syntax-free methods by 20% in both grammaticality and fidelity when computed over the novel sentences generated by alignment-induced finite state automata.
Experiments from optical engineering and robotics for a pre-engineering program
Authors: S. K. Ramesh
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Engineering is experiencing a period of dramatic change and growth in several areas. Demand for qualified professionals continues to grow. To meet this growing demand, we need to attract new students who are well prepared to study engineering. However, reports indicate a widening gap in the preparation of incoming students. To address this problem several universities and colleges around the USA have developed strong outreach programs and relevant curricula to attract students to study engineering. At CSUS, the authors have developed some simple experiments from optical engineering and robotics to increase student motivation and interest in engineering. The experiments have been successfully used in our freshman level "Introduction to Engineering" course that emphasizes problem solving and teamwork. Student feedback has been very positive and has led to broader partnerships with area high schools, and community colleges, under the auspices of the Sacramento Engineering and Technology Regional Consortium.
Generalizing Version Space Support Vector Machines for Non-Separable Data
Authors: E. N. Smirnov, I. G. Sprinkhuizen-Kuyper, N. I. Nikolaev
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Although version space support vector machines (VSSVMs) are a successful approach to reliable classification [6], they are restricted to separable data. This paper proposes generalized VSSVMs (GVSSVMs) applicable for separable and non-separable data. We show that GVSSVMs can outperform existing reliable-classification approaches.
Towards an evolutionary neural network for gait analysis
Authors: P. Mordaunt, A. M. S. Zalzala
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper presents initial investigations into an evolutionary neural network suitable for gait analysis of human motion. The approach here is to develop an intelligent black box that can take the physiological signals (EMG) and interpret them to give accurate information on the position and movement of the knee (gait). Two MLP networks are presented with weight evolving algorithms employing mutation and crossover separately. Simulation results show the evolutionary algorithms exhibiting particularly better ability to generalise solutions, which is an important aspect for the reliability of EMG/gait map generation.
Take Intelligent Risk and Optimize Decision Based on Time, Available Resources and Risk Tolerance Limits
Authors: Yue Yu, Shangping Ren, Kevin A. Kwiat
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

In real-time environment, data usually has a lifespan associated with it. The semantics and the importance of the data depend on the time when data is utilized. Hence, the process of getting a consensus data from a group of replicated units must not take longer time than the lifespan of the data. However, in real environment, every unit, faulty or non-faulty, may encounter delays when processing and sending their data which inevitably increases the time of acquiring a consensus. The latency for obtaining a valid data hence depends not only on the time when individual replicas make their votes, but also on the accuracy and credibility of the votes. Thus, a new metric, i.e. a credibility function, needs to be taken into account when evaluating expected time and deciding upon data replications. This paper presents analytical solutions for the expected time when dependable data can be obtained under different voting schemes. We show that if not all replicas are truthful, increasing replication does not reduce the time for obtaining valid results. When different types of resources are used to ensure the quality of the data, we show that the allocation of the resource plays an important role in satisfying both data availability and consistency constraints. We further demonstrate that that when point-based constraints may be intrinsically impossible to satisfy, a more general interval-based constraint can be used to obtain statistical solutions.
An architecture for generating semantics-aware signatures
Authors: Vinod Yegneswaran, Jonathon T. Giffin, Paul Barford, Somesh Jha
Venue: Proceedings of the 14th conference on USENIX Security Symposium - Volume 14 (2005)

Identifying new intrusions and developing effective signatures that detect them is essential for protecting computer networks. We present Nemean, a system for automatic generation of intrusion signatures from honeynet packet traces. Our architecture is distinguished by its emphasis on a modular design framework that encourages independent development and modification of system components and protocol semantics awareness which allows for construction of signatures that greatly reduce false alarms. The building blocks of our architecture include transport and service normalization, intrusion profile clustering and automata learning that generates connection and session aware signatures. We demonstrate the potential of Nemean's semantics-aware, resilient signatures through a prototype implementation. We use two datasets to evaluate the system: (i) a production dataset for false-alarm evaluation and (ii) a honeynet dataset for measuring detection rates. Signatures generated by Nemean for NetBIOS exploits had a 0% false-positive rate and a 0.04% false-negative rate.
Protocols for routing scalability and security in open networks
Authors: Michalis Faloutsos
Venue:  (2006)

An open network is a network that can be formed by anyone, and that anyone can join. Open networks exist today in minute scale, in the form of open Internet access points. It is our hope that our work will facilitate the creation of much larger open networks, both wired and wireless, where strangers are welcome to partake in, and contribute to, a network formed entirely by peers. Presented in this dissertation are network protocols aimed at facilitating the creation of open networks. Four different protocols are discussed, each addressing a different problem in open networks, including scalable routing, secure routing, the wormhole attack, and enforceable bandwidth allocation. The size of a typical open network is limited only by the technology used. Thus, scalability is an important aspect in maximizing the potential of such networks. Moreover, in an open network, no centralized authority exists to impose a physical network hierarchy. This has so far has been the dominant method of achieving routing scalability. We propose dynamic address routing (DART), the first routing protocol for mobile wireless networks to achieve an average routing table size of O(logN) where N is the number of nodes in the network.Routing security is another interesting challenge in open networks. In contrast with traditional networks, an open network must be able to welcome strangers, rather than keep them out. In a network full of strangers, routing must be done without relying on trust. We propose a routing protocol that is robust to all known attacks, as well as the first practical MAC-layer countermeasure to the powerful "wormhole" attack in wireless networks.Finally, in a bandwidth constrained network, proper allocation of resources becomes important. Most previous work on bandwidth allocation assumes that users will not greedily change their sending behavior to maximize throughput. This assumption may hold in a closed network, but in a network of strangers, we cannot assume that all strangers are good citizens. We propose Justice, a bandwidth allocation scheme which cannot be circumvented, yet offers network operators and users great flexibility in how they allocate available bandwidth.
Testing Duration Systems using an approximation method
Authors: Lotfi MAJDOUB, Riadh ROBBANA
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Testing is an important validation activity particularly for real-time systems. We are interested to testing duration systems which are an extension of real-time systems, we consider that the specification of duration systems is described by a Duration graphs. Duration graphs are an extension of timed graphs and are suitable for modeling the accumulated times spent by computations in the duration systems. In this paper, we present a testing method for duration systems. First, we use the approximation method extending the specification model to another called approximate model containing the digitization computations. Second, we demonstrate that it is possible to generate tests from the approximate model and we prove that all errors detected with the approximate model exist in the implementation. Then, we present a method for testing duration systems by using the approximate model
Motion-compensated frame rate conversion using an accelerated motion model
Authors: P. Csillag
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Frame rate conversion requires interpolation of image frames at time instances, where the original sequence has not been sampled. This can be done with high quality only by means of motion-compensated algorithms, therefore a knowledge of the motion present in the sequence is essential. This motion information has to be determined from the image sequence itself. Most motion estimation algorithms use only a simple motion model, and assume linear constant speed motion. Our contribution is the development of an algorithm for modeling and estimation of accelerated motion trajectories, based on a more general second order motion model, and its application to frame rate conversion. The parameters of the accelerated motion are determined from two consecutive motion fields, estimated from three consecutive image frames using a multiresolution pel-recursive Wiener-based motion estimation algorithm. The algorithm was successfully tested on artificial image sequences with synthetic motion as well as on natural real-life videophone and videoconferencing sequences.
LEARN++: an incremental learning algorithm for multilayer perceptron networks
Authors: R. Polikar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

We introduce a supervised learning algorithm that gives neural network classification algorithms the capability of learning incrementally from new data without forgetting what has been learned in earlier training sessions. Schapire's (1990) boosting algorithm, originally intended for improving the accuracy of weak learners, has been modified to be used in an incremental learning setting. The algorithm is based on generating a number of hypotheses using different distributions of the training data and combining these hypotheses using a weighted majority voting. This scheme allows the classifier previously trained with a training database, to learn from new data when the original data is no longer available, even when new classes are introduced. Initial results on incremental training of multilayer perceptron networks on synthetic as well as real-world data are presented in this paper.
More Semantics in QoS Matching
Authors: Ester Giallonardo, Eugenio Zimeo
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

The evolution of the Web towards a global computing environment is promoting new research efforts aimed at the formal characterization of Web Services QoS. Reasoning on QoS is a key to improve matching process during the discovery of desired services and a step towards the transformation of applications in collections of loosely coupled services virtually connected by semantic similarities. The paper presents the onQoS ontology, an openly available OWL ontology for QoS, and evaluates it in a QoS-aware matching environment. The ontology can be used to express functions of QoS metrics useful to improve the recall tied to the matching of a template request with target Web Services. To this end, the ontology introduces the concept of derivation in the matching process. This gives the possibility of matching a QoS template with published Web Services by deriving different QoS parameters when a one-to-one matching fails. The proposed matching algorithm utilizes a reasoner that exploits the ontology to avoid apparent mismatches. An experimental evaluation shows that exploiting QoS knowledge significantly improves matching recall without deteriorating precision.