ppxscal/embedding_network huggingface dataset:
A Theoretical Development of the Optical Zeeman Effect
Authors: M. W. Evans
Venue:  (1990)

A theory of the optical Zeeman effect is developed in terms of the angular polarisability, **i", a fundamental property of both atoms and molecules. It is shown that **i" is negative to motion reversal T and parity inversion P, and forms an interaction hamiltonian with the T negative, P positive conjugate product pi(i) of a circularly polarised pump laser. This activates the T negative **i", which is the axial vector equivalent of the imaginary part of the atomic or molecular electronic polarisability, an antisymmetric polar tensor. The quantity pi(i) is proportional to the square of the electric field strength of the laser, and disappears if the latter is not circularly polarised. This distinguishes the optical Zeeman effect from the experimentally measured optical Autler Townes effect, which is mediated by the symmetric, T positive, real part of the dynamic electronic polarisability. The optical Zeeman effect is accompanied by circular birefringence and the bulk magnetisation of the inverse Faraday effect.
Kernel Structuring Using Time-Triggered Message-Triggered Objects for Real-Time Active DBMS in Layered Architecture
Authors: Chanho Ryu, Hyeok Han, Yongkeol Kim, Young-kuk Kim, Seongil Jin
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

Real-time active database systems are systems that need the logical consistency of computation results and the timing constraint the result was produced for the correctness of the system. Especially, real -time systems are generally highly interactive with their environment, reacting to stimuli in the environment. And a wealth of active database models has been proposed, and several major prototypes have been produced. However, no uniform method for specifying the rule and each manager of active database system in de sign has yet been proposed within the real -time research community: for an example, real -time object model.This paper presents an architecture of an real -time active database system using time -triggered message -triggered object with incorporating active functionality and real -time constraints into an active database kernel in layered architecture. Also this paper shows how real -time objects are designed to a manager as a module of active database and a rule in active database is represented as an object de signed to appropriate to real -time active database.
Visual Tracking of Self-Occluding Articulated Objects
Authors: James M. Rehg, Takeo Kanade
Venue:  (1994)

Computer sensing of hand and limb motion is an important problem for applications in human-computer interaction, virtual reality, and athletic performance measurement. We describe a framework for local tracking of self-occluding motion, in which parts of the mechanism obstruct each others visibility to the camera. Our approach uses a kinematic model to predict occlusion and windowed templates to track partially occluded objects. We analyze our model of self-occlusion, discuss the implementation of our algorithm, and give experimental results for 3D hand tracking under significant amounts of self-occlusion. These results extend the DigitEyes system for articulated tracking, which we have previously developed, to handle self-occluding motions.
A heavy-traffic theorem for the GI/G/1 queue with a Pareto-type service time distribution
Authors: J. W. Cohen
Venue:  (1997)

For the $GI/G/1$-queueing model with traffic load $a0, \quad 1> \nu 0, $$ $$ \int\limits_0^\infty t^\mu {\rm d} A(t) \nu , $$ that $(1-a)^{\frac{1}{\nu-1}} {\bf w}$ converges in distribution for $a \uparrow 1$. Here ${\bf w}$ is distributed as the stationary waiting time distribution. The L.S.-transform of the limiting distribution is derived and an asymptotic series for its tail probabilities is obtained. The theorem actually proved in the text concerns a slightly more general asymptotic behaviour of $1-B(t)$, $t \rightarrow \infty$, than mentioned above.
SPADE: A Tool for Performance and Reliability Evaluation
Authors: A R Sahner, S K Trivedi
Venue:  (1984)

A model for the stochastic analysis of directed acyclic graphs is developed. These graphs represent event-procedure networks where the distribution function associated with an event is assumed to be a variant of the phase-type distribution. Events may occur sequentially, probabilistically, or concurrently. The distribution function of the graph execution time is computed in a semi-symbolic form. Applications of the model for the evaluation of concurrent program execution time and to the reliability analysis of fault-tolerant systems are discussed.
Designing Portable Collaborative Networks
Venue: Queue (2003)

Peer-to-peer technology and wireless networking offer great potential for working together away from the desk—but they also introduce unique software and infrastructure challenges. The traditional idea of the work environment is anchored to a central location—the desk and office—where the resources needed for the job are located. Even in the many professions where the practitioners move among different field locations, such as professional consulting, health care, or resource exploration, the full set of information and technology resources has been available only in fixed locations where the workers “check in” periodically to integrate their field results back into the larger picture.
TraceGraph: Immediate Visual Location of Software Features
Authors: Kazimiras Lukoit, Norman Wilde, Scott Stowell, Tim Hennessey
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Software engineers often need to locate where particular features of a program are implemented in order to fix a bug or introduce an enhancement. This paper describes a tool called TraceGraph to support this task, particularly for large, long-running or interactive software. TraceGraph provides a simple visual display of the program's trace, which allows changes in execution to be easily distinguished. A software engineer can run the feature he or she is interested in, and immediately view how program execution varies. Case studies on two large systems show how TraceGraph may be applied to different kinds of traces. Displays similar to TraceGraph would be good candidates for inclusion in software monitoring or debugging systems.
Approximate Reasoning for Contextual Databases
Authors: Fabio Massacci
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Contextual reasoning has been proposed as a tool for solving the problem of generality in AI and for effectively handling huge knowledge bases, while approximate reasoning has been developed to overcome the computational barrier of classical deduction. This paper combines these approaches to provide an intuitive representation of knowledge and an effective deduction. Its semantics and a tableau calculus are presented. The key computational features are discussed.
Investigating Maintenance Processes in a Framework-Based Environment
Authors: V. R. Basili, F. Lanubile, F. Shull
Venue: Proceedings of the International Conference on Software Maintenance (1998)

The empirical study described in this paper focuses on the effectiveness of maintenance processes in an environment in which a repository of potential sources of reuse exists, e.g. a context in which applications are built using an object-oriented framework. Such a repository might contain current and previous releases of the system under maintenance, as well as other applications that are built on a similar structure or contain similar functionality. This paper presents an observational study of 15 student projects in a framework-based environment. We used a mix of qualitative and quantitative methods to identify and evaluate the effectiveness of the maintenance processes.
Term Weighting Approaches in Automatic Text Retrieval
Authors: Gerard Salton, Chris Buckley
Venue:  (1987)

The experimental evidence accumulated over the past 20 years indicates that textindexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend crucially on the choice of effective term weighting systems. This paper summarizes the insights gained in automatic term weighting, and provides baseline single term indexing models with which other more elaborate content analysis procedures can be compared.
Optimizing term vectors for efficient and robust filtering
Authors: David A. Evans, Jeffrey Bennett, David A. Hull
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

We describe an efficient, robust method for selecting and optimizing terms for a classification or filtering task. Terms are extracted from positive examples in training data based on several alternative term-selection algorithms, then combined additively after a simple term-score normalization step to produce a merged and ranked master term vector. The score threshold for the master vector is set via beta-gamma regulation over all the available training data. The process avoids para-meter calibrations and protracted training. It also results in compact profiles for run-time evaluation of test (new) documents. Results on TREC-2002 filtering-task datasets demonstrate substantial improvements over TREC-median results and rival both idealized IR-based results and optimized (and expensive) SVM-based classifiers in general effectiveness.
New Method for Calculation of the Exact End-to-end Distance Distributions for the Freely-rotating Chain
Authors: Jaroslaw Kostrowicki, Harold A. Scheraga
Venue:  (1994)

The following contains mathematical formulae and symbols that may become distorted in ASCII text format. We present an efficient method to calculate the exact end-to-end distance distribution for a freely rotating chain. The method is based on the recursive calculation of the probability density function P(rn) for a pair of distances between atoms 1 and n, and 1 and n-1, respectively. The probability density function P(rN) for the end-to-end distance is evaluated from the last pair function P(rN,rN-1) by a single integration. The cost of the method scales linearly with the chain length. The method is especially useful for intermediate length chains for which the gaussian approximation is far from reliable.
Simulation of Logic/IDDQ Tests for Resistive Shorts in Logic Circuits by Using Simplicial Approximation
Authors: Hung-Jen Lin, Linda Milor
Venue: Proceedings of the 1997 IEEE International Workshop on IDDQ Testing (IDDQ '97) (1997)

Logic circuits in the presence of resistive shorts often exhibit analog behavior which can be computationally expensive to simulate. This paper introduces a numerical method called simplicial approximation for its application to simulation of logic/IDDQ tests for resistive shorts. Example circuits with transistor gate-to-drain and gate-to-source shorts are used to demonstrate the feasibility of the method. The results, when compared to SPICE simulation, show a 95\% reduction in computational time at the price of less numerical accuracy, which is generally acceptable in this application.
A methodology to select the best material combinations and optimally design composite sandwich cylindrical shells for least mass
Authors: M. Walker, R. E. Smith
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

A methodology to select the best material combination and optimally design composite sandwich cylinders having fibre reinforced skins and low density cores for minimum mass is described. Sandwich constructions generally provide improved stiffness/mass ratios and more tailoring opportunities than monolithics, and thus greater chance of satisfying design constraints. The objective of the optimisation is to minimise the laminate mass by selecting the skin and core material combination, layer thicknesses and skin fibre angles optimally, subject to load and cost constraints. As the optimisation problem contains a number of continuous (ply angles and thicknesses) and discrete (material combinations) design variables, a sequential solution procedure is devised in which the optimal variables are computed in different stages. The procedure and its benefits are demonstrated using Graphite, Glass or Kevlar/Epoxy facings, and Balsa or PVC cores.
A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree
Authors: Hsueh Lu, R. Ravi
Venue:  (1996)

Given an undirected graph $G$, finding a spanning tree of $G$ with maximum number of leaves is not only NP-complete but also MAX~SNP-complete. The approximation ratio of the previously best known approximation algorithm for maximum leaf spanning tree is three. However, the high-order running time required by the previous algorithm makes it impractical. In this paper we give a new factor-three approximation algorithm for the same problem. The running time required by our algorithm is almost linear in the size of $G$. This improves the previous algorithm by a factor of $\tilde{\Omega}(mn^3)$, where $n$ is the number of nodes and $m$ is the number of edges.
A critical assessment of the Self-Interaction Corrected Local Density Functional method and its algorithmic implementation
Authors: S. Goedecker, C. J. Umrigar
Venue:  (1996)

We calculate the electronic structure of several atoms and small molecules by direct minimization of the Self-Interaction Corrected Local Density Approximation (SIC-LDA) functional. To do this we first derive an expression for the gradient of this functional under the constraint that the orbitals be orthogonal and show that previously given expressions do not correctly incorporate this constraint. In our atomic calculations the SIC-LDA yields total energies, ionization energies and charge densities that are superior to results obtained with the Local Density Approximation (LDA). However, for molecules SIC-LDA gives bond lengths and reaction energies that are inferior to those obtained from LDA. The nonlocal BLYP functional, which we include as a representative GGA functional, outperforms both LDA and SIC-LDA for all ground state properties we considered.
Dead Code Elimination Through Type Inference
Authors: Ozan Hafizogullari, Christoph Kreitz
Venue:  (1998)

We introduce a method to detect and eliminate dead code in typed functional programming languages. Our approach relies on a type system with simple subtypes for specifying dead code and a type inference algorithm for it. Through a careful seperation of the type system and the problem-specific assumptions we avoid \emph{ad hoc} rules in the type system. This, combined with the fact that our approach makes the flow information in a program explicit and is based on well-understood concepts makes our approach a good candidate for a general framework for program analysis. Our technique can be used in optimizing compilers, optimization of programs extracted from theorem provers, optimization of modular systems, and other areas of software engineering.
Utilization-Based Admission Control for Real-Time Applications
Authors: Dong Xuan, Riccardo Bettati, Jianer Chen, Wei Zhao, Chengzhi Li
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

In this paper, we present a methodology to use utilization-based admission control in guaranteed real-time communication in a scalable fashion. We make admission control scalable by using a configuration-time test to determine a safe utilization level of servers. Admission control at run-time then is reduced to simple utilization tests on the servers along the path of the new flow. Furthermore, we discuss how appropriate route selection improve utilization levels, design a safe route selection heuristic algorithm to achieve high utilization of resources, and derive two bounds on the maximum utilization level for given traffic in a network. We compare the results of our route selection heuristics with that of a shortest-path based algorithm, and find that our heuristics can achieve a much higher maximum utilization level than that of the shortest-path based algorithm.
Asynchronous Transfer of Video
Authors: Gunnar Karlsson
Venue:  (2001)

Video transfers across IP and ATM networks have received much research attention during the last ten years. Various video services are expected in the future, enabled by the rapid development in video coding and broadband network technology. This paper gives an introduction to the issues involved in asynchronous video transfers. Brief overviews of video coding, rate control, multiplexing, as well as delay, error and loss control are given.
Effective Graph Visualization Via Node Grouping
Authors: Janet M. Six, Ioannis G. Tollis
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

We discuss four methodologies for the application of node grouping in graph visualization. In addition, we introduce techniques for force-directed and orthogonal drawing which use node grouping information and have been shown in experiments to perform better than previous techniques. Not only do these techniques have significantly improved performance with respect to standard aesthetic measures, but they also attain qualitative improvement.
Theoretical Performance Bounds of a Probability of Bit Error Estimator Used in Digital Links Employing Binary Block Codes
Authors: K D. R. Jagath-Kumara
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

An on-line and direct estimator used for measuring the post-decoder error probability of communication links that employ both error control coding and modulation will be discussed. The estimator is solely dependent on the information available in the received signal and therefore, it does not require transmission of test patterns. The performance bounds are found using both theoretical analysis and computer simulations. A number of block codes will be considered for the analysis and it will be shown that the estimation accuracy is best once the link is overlaid with the shortest possible block code
Reliability prediction for component-based software architectures
Authors: Ralf H. Reussner, Heinz W. Schmidt, Iman H. Poernomo
Venue: Journal of Systems and Software (2003)

One of the motivations for specifying software architectures explicitly is the use of high level structural design information for improved control and prediction of software system quality attributes. In this paper, we present an approach for determining the reliability of component-based software architectures.Our method is based on rich architecture definition language (RADL) oriented towards modem industrial middleware platforms, such as Microsoft's. NET and Sun's EJB. Our methods involve parameterised contractual specifications based on state machines and thus permits efficient static analysis.We show how RADL allows software architects to predict component reliability through compositional analysis of usage profiles and of environment component reliability. We illustrate our approach with an e-commerce example and report about empirical measurements which confirm our analytical reliability prediction through monitoring in our reliability test-bed. Our evaluation confirms that prediction accuracy for software components necessitates modelling the behaviour of binary components and the dependency of provided services on required components. Fortunately, our measurements also show that an abstract protocol view of that behaviour is sufficient to predict reliability with high accuracy. The reliability of a component most strongly depends on its environment. Therefore, we advocate a reliability model parameterized by required component reliability in a deployment context.
Relocating XML Elements from Preprocessed to Unprocessed Code
Authors: Anthony Cox, Charles Clarke
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

Transformations performed on source code by a preprocessor complicate the accuratereporting of information extracted to support program comprehension. Differences between the file input to the preprocessor and the output seen by parser-based analyzers creates a need for techniques to back-locate extracted information. To correctly map analysis results back to the preprocessor input files requires a record of the substitutions performed by the preprocessor. This record takes the form of a list, for each character, of the directives responsible for the character's inclusion in the preprocessor's output. We have developed algorithms to utilize the substitution history for the start and end tags of an XML element to correctly place the element in the unprocessed source. The use of substitution histories ensures that element relocation produces well-formed XML.
Restructuring sequential Fortran code into a parallel/distributed application
Authors: C. T.H. Everaars, Farhad Arbab, Freek J. Burger
Venue:  (1996)

A workable approach for modernization of existing software into parallel/distributed applications is through coarse-grain restructuring. If, for instance, entire subroutines of legacy code can be plugged into the new structure, the investment required for the re-discovery of the details of what they do can be spared. The resulting renovated software can then take advantage of the improved performance offered by modern parallel/distributed computing environments, without rethinking or rewriting the bulk of their existing code. In this paper, we discuss one of our experiments using the new coordination language M size=-1<ANIFOLD>/font to restructure an existing sequential numerical application written in Fortran 77, into a parallel/distributed application.
Automatic Symbolic Verification of Embedded Systems
Authors: Rajeev Alur, Thomas A. Henzinger, Pei Ho
Venue:  (1995)

We present a model-checking procedure and its implementation for the automatic verification of embedded systems. The system components are described as Hybrid Automata---communicating machines with finite control and real-valued variables that represent continuous environment parameters such as time, pressure, and temperature. The system requirements are specified in a temporal logic with stop watches, and verified by symbolic fixpoint computation. The verification procedure---implemented in the Cornell Hybrid Technology Tool, HyTech---applies to hybrid automata whose continuous dynamics is governed by linear constraints on the variables and their derivatives. We illustrate the method and the tool by checking safety, liveness, time-bounded, and duration requirements of digital controllers, schedulers, and distributed algorithms.
Semi-rigid connections analysis in plane frames
Authors: G. A. Romanholo, R. Bertolino,  Jr., R. O. Rodrigues
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The cold-formed sections in structural design have been used in many constructions in civil engineering, therefore a more careful to analysis these structures is necessary. In the design and detail of these structures, many situations are considered by the constructor and designer. One of them is to consider the members of structures with several finites elements. The connection of the elements may be pinned or restrained. Although this consideration is simple to design it is not totally true. The connections of the elements have a semi-rigid behavior, and these connections strength can depend the actions on the structures. The considerations a semi-rigid behavior will present a more realistic structural analysis.