ppxscal/embedding_network huggingface dataset:
An Operational Profile for the Cartridge Support Software
Authors: Ken Chruscielski, Jeff Tian
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

This paper describes our experience and findings in constructing an operation profile for the Lockheed Martin Tactical Aircraft System's (LMTAS) Cartridge Support Software (CSS). The process is an adaptation of Musa's 5-step approach. The resulting operational profile was reviewed and evaluated by LMTAS's Software Product Manager, System Engineers, and Software Test Engineers. An account of the findings and conclusions from the independent review and evaluation is discussed. This operational profile allowed the LMTAS software engineering team to derive some clear insights about the usage rate of the CSS functions from the customer's perspective
Efficient parallel multiselection on hypercubes
Authors: Hong Shen
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

We study efficient parallel solutions to the problem of selecting r elements at specified ranks from a set of n arbitrary elements, known as multiselection, on a hypercube with p processors, p,r/spl les/n. We propose two parallel algorithms based on different approaches, where one requires processors to operate in the SIMD mode, and the other in the MIMD mode. Our SIMD algorithm runs in time O((log n log log n) min{r, log n}) when p=/spl Theta/(n), and O(n/sup /spl epsiv// min{r, (1-/spl epsiv/) log n}) when p=n/sup /spl epsiv// for any 0
Modeling Rate-Based Dynamic Cache Sharing for Distributed VOD Systems
Authors: B. Sonah, M. R. Ito
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

A distributed VOD system includes several VOD subsystems, each VOD sub-system consisting of an archive server (AS), a continuous media server (CMS) and a medata DB. A VOD sub-system employs an object replacement algorithm by which a video is selected to be replaced by a new video. Upon a miss, the VOD system must decide onto which CMS to load the new video.In this paper, we address this issue by modeling a dynamic approach of logically sharing the overall CMS cache space among the CMS's based on the current average arrival rate of requests at each VOD sub-system to achieve superior cache performance Our simulation results show that dynamic cache sharing is a means by which hit performance at the CMS's can be improved.
Knowledge Transactions of Heterogeneous Agents
Authors: Kazuyo Sato, Akira Namatame
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

We propose a new type of social interaction as knowledge transactions.Two agents consider to trade a set of heterogeneous knowledge on which they have different value judgments.We aggregate by their different value judgements with threshold.The knowledge transactions are formulated as symmetric coordination games.We investigate what types of knowledge will be successfully traded through the knowledge trading games.
A Comparison of Algorithms for Large Scale Mixed Complementarity Problems
Authors: Stephen C. Billups, Steven P. Dirkse, Michael C. Ferris
Venue:  (1995)

This paper provides a means for comparing various computer codes for solving large scale mixed complementarity problems. We discuss inadequacies in how algorithms are currently compared, and present a testing environment that partially solves these inadequacies. This testing environment consists of library of test problems, along with GAMS and MATLAB interfaces that allow these problems to be easily accessed. Eight different algorithm implementations for large scale mixed complementarity problems are briefly described and tested with default parameter settings using the new testing environment.
On multicasting ABR protocols for wireless ATM networks
Authors: W. M. Moh
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

The major challenges of designing multicast rate-control protocols for a combined wired/wireless network are the varying transmission characteristics (bandwidth, error, and propagation delay) of the wireless and wired media, and the different, possibly conflicting flow control requests from multiple receivers. To address these issues, in this paper we study multicasting rate-control ABR algorithms for a combined wired/wireless network with unreliable links and irregular network feedback. We propose a new ABR multicast extension algorithm that can readily extend any unicast ABR rate control scheme for multicast services. By formal analysis, we show that it is max-min fair, and that its maximum cell loss is less than or equal to that of an existing algorithm proposed by K.Y. Siu and H.Y. Tseng (1997). We also extend the definition of global feasibility to multicast flows, and propose a delayed-increase policy to ensure global feasibility. Both the waiting time of the delayed-increase policy, and the maximum cell loss in the absence of the policy are formally analyzed. The new algorithm requires a waiting time no longer than, and has a maximum cell loss less than or equal to, that of the existing algorithm. The significance of our approach is illustrated by the formal analysis, which allows us to design a new multicast extension algorithm that is max-min fair, results in a small cell-loss bound, and achieves global feasibility. The analytical method may also assist the design and analysis of other multicasting flow algorithms over ATM and wireless ATM, and other network protocols such as multicast IP and mobile IP.
TICSA Training Guide
Authors: Mike Chapple, Debra Littlejohn Shinder
Venue:  (2002)

:The TruSecure ICSA Certified Security Associate exam is an entry-level computer security certification aimed at individuals with 1 to 3 years of computer security experience. TICSA represents base level certification, and certifies system or network administrators responsible for security administration of systems or networks in an enterprise alongside their regular responsibilities.
On Estimating the Condition of Eigenvalues and Eigenvectors
Authors: Charles Van Loan
Venue:  (1986)

A method is developed for estimating the accuracy of computed eigenvalues and eigenvectors that are obtained via certain EISPACK subroutines. It does this at a cost of $O(n^{2})$ flops per eigenpair assuming that the eigenpair is known and assuming that the original matrix has been reduced to Hessenberg form. The heart of the technique involves estimating the smallest singular value of a certain nearly triangular submatrix. This is accomplished by some standard ``zero-chasing'''' with Hivens transformations and with a 2-norm version of the LINPACK condition estimator. An EISPACK compatible code has been developed and its performance is discussed. Suggestions for extending the current work to general invariant subspaces and to the generalized eigenvalue problem are given.
Local Existence to Frémond''s Model for Damaging in Elastic Materials
Authors: Elena Bonetti, Giulio Schimperna
Venue:  (2002)

We consider a dissipative model recently proposed by M. Frémond and describing the evolution of damage in elastic materials. The corresponding PDE''s system consists of an elliptic equation for the displacements with a degenerating elastic coefficient coupled with a variational dissipative inclusion governing the evolution of damage. We can prove a local in time existence result for an associated initial and boundary value problem, namely considering the evolution in some subinterval where the damage is not complete. The existence result is obtained by a truncation technique combined with suitable a priori estimates. Finally, we give an analogous local in time existence result in the case when the macroscopic equilibrium equation is of parabolic type, i.e., we introduce viscosity in the relation for macroscopic displacements.
A Geometric Approach to Error Detection and Recovery for Robot Motion Planning With Uncertainty
Authors: Bruce R Donald
Venue:  (1988)

Robots must plan and execute tasks in the presence of uncertainty. Uncertainty arises from sensing errors, control errors, and uncertainty in the geometric models of the environment and of the robot. The last, which we will call model uncertainty, has received little previous attention. In this paper we present a formal framework for computing motion strategies which are guaranteed to succeed in the presence of all three kinds of uncertainty. We show that it is effectively computable for some simple cases. The motion strategies we consider include sensor-based gross motions, compliant motions, and simple pushing motions. We show that model uncertainty can be represented by position uncertainty in a generalized configuration space. We describe the structure of this space, and how motion strategies may be planned in it. It is not always possible to find plans that are guaranteed to succeed. In the presence of model error, such plans may not even exist. For this reason we investigate Error Detection and Recovery (EDR) strategies. We characterize what such strategies are, and propose a formal framework for constructing them. Our theory represents what is perhaps the first systematic attack on the problem of error detection and recovery based on geometric and physical reasoning.
Some problems on factorizations with constraints in bipartite graphs
Authors: Guizhen Liu, Binhai Zhu
Venue: Discrete Applied Mathematics (2003)

Let G = (X, Y, E(G)) be a bipartite graph with vertex set V(G) = X ∪ Y and edge set E(G) and let g and f be two non-negative integer-valued functions defined on V(G) such that g(x) ≤ f(x) for each x ∈ V(G). A (g, f)-factor of G is a spanning subgraph F of G such that g(x) ≤ dF(x) ≤ f(x) for each x ∈ V(F); a (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. In this paper it is proved that every bipartite (mg + m - 1, mf - m + 1)-graph has (g, f)-factorizations randomly k-orthogonal to any given subgraph with km edges if k ≤ g(x) for any x ∈ V(G) and has a (g, f)-factorization k-orthogonal to any given subgraph with km edges if k - 1 ≤ g(x) for any x ∈ V(G) and that every bipartite (mg, m f)-graph has a (g, f)-factorization orthogonal to any given m-star if 0 ≤ g(x) ≤ f(x) for any x ∈ V(G). Furthermore, it is shown that there are polynomial algorithms for finding the desired factorizations and the results in this paper are in some sense best possible.
Multiplexing VBR Traffic Flows with Guaranteed Application-level QoS Using Statistical Rate Monotonic Scheduling
Authors: Alia Atlas, Azer Bestavros
Venue:  (1998)

Abstract Quality of Service (QoS) guarantees are required by an increasing number of applications to ensure a minimal level of fidelity in the delivery of application data units through the network. Application-level QoS does not necessarily follow from any transport-level QoS guarantees regarding the delivery of the individual cells (e.g. ATM cells) which comprise the application''s data units. The distinction between application-level and transport-level QoS guarantees is due primarily to the fragmentation that occurs when transmitting large application data units (e.g. IP packets, or video frames) using much smaller network cells, whereby the partial delivery of a data unit is useless; and, bandwidth spent to partially transmit the data unit is wasted. The data units transmitted by an application may vary in size while being constant in rate, which results in a variable bit rate (VBR) data flow. That data flow requires QoS guarantees. Statistical multiplexing is inadequate, because no guarantees can be made and no firewall property exists between different data flows. In this paper, we present a novel resource management paradigm for the maintenance of application-level QoS for VBR flows. Our paradigm is based on Statistical Rate Monotonic Scheduling (SRMS), in which (1) each application generates its variable-size data units at a fixed rate, (2) the partial delivery of data units is of no value to the application, and (3) the QoS guarantee extended to the application is the probability that an arbitrary data unit will be successfully transmitted through the network to/from the application.
Detection of software modules with high debug code churn in a very large legacy system
Authors: T. M. Khoshgoftaar, E. B. Allen, N. Goel, A. Nandi, J. McMullan
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Society has become so dependent on reliable telecommunications, that failures can risk loss of emergency service, business disruptions, or isolation from friends. Consequently, telecommunications software is required to have high reliability. Many previous studies define the classification fault prone in terms of fault counts. This study defines fault prone as exceeding a threshold of debug code churn, defined as the number of lines added or changed due to bug fixes. Previous studies have characterized reuse history with simple categories. This study quantified new functionality with lines of code. The paper analyzes two consecutive releases of a large legacy software system for telecommunications. We applied discriminant analysis to identify fault prone modules based on 16 static software product metrics and the amount of code changed during development. Modules from one release were used as a fit data set and modules from the subsequent release were used as a test data set. In contrast, comparable prior studies of legacy systems split the data to simulate two releases. We validated the model with a realistic simulation of utilization of the fitted model with the test data set. Model results could be used to give extra attention to fault prone modules and thus, reduce the risk of unexpected problems.
Distributed Sorting
Authors: H. P Hofstee, Alain J. Martin, Jan L. A. Van de Snepscheutt
Venue:  (1989)

No abstract available.
Secure composition of untrusted code: box &#x03C0;, wrappers, and causality types
Authors: Peter Sewell, Jan Vitek
Venue: Journal of Computer Security (2003)

Software systems are becoming heterogeneous: instead of a small number of large programs from well-established sources, a user's desktop may now consist of many smaller components that interact in intricate ways. Some components will be downloaded from the network from sources that are only partially trusted. A user would like to know that a number of security properties hold, e.g., that personal data is not leaked to the net, but it is typically infeasible to verify that such components are well-behaved. Instead, they must be executed in a secure environment that provides fine-grain control of the allowable interactions between them, and between components and other system resources.In this paper, we consider the problem of assembling concurrent software systems from untrusted or partially trusted off-the-shelf components, using wrapper programs to encapsulate components and enforce security policies. We introduce a model programming language, the box-π calculus, that supports composition of software components and the enforcement of information flow security policies. Several example wrappers are expressed using the calculus; we explore the delicate security properties they guarantee. We present a novel causal type system that statically captures the allowed flows between wrapped possibly-badly-typed components; we use it to prove that an example ordered pipeline wrapper enforces a causal flow property.
A hierarchical cost estimation tool
Authors: David Koonce, Robert Judd, Dusan Sormaz, Dale T. Masel
Venue: Computers in Industry (2003)

The estimation of the manufacturing cost of a part in all phases of the design stage is crucial to concurrent engineering. To better estimate the cost for a product, data must be available from both engineering systems and business systems. This paper presents a cost estimation system being developed to support design time cost estimation using the Federated Intelligent Product EnviRonment (FIPER), which is being developed as part of the National Institute of Standards and Technology (NIST) Advanced Technology Program (ATP). The FIPER research team is developing an architecture that interconnects design and analysis software tools in a peer level architecture to support multidisciplinary design optimization (MDO), design for six sigma (DFSS) and robust design.
TASK: from the specification to the implementation.
Authors: Xavier Talon, Christine Pierret-Golbreich
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper presents the TASK framework which is intended to cover the life cycle of a Knowledge-Based System. TASK provides (i) a conceptual language which enable an informal specification at the knowledge level, (ii) a formal language TFL which permits an unambiguous specification and (iii) an operational shell TASK^+ which allows an efficient execution even for bad structured problems. This paper presents the different languages, the links between them and emphasizes the implementation stage. We show how TASK proposes a nice compromise solution between efficiency and expressivity.
Variable-sample methods for stochastic optimization
Authors: Tito Homem-De-Mello
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2003)

In this article we discuss the application of a certain class of Monte Carlo methods to stochastic optimization problems. Particularly, we study variable-sample techniques, in which the objective function is replaced, at each iteration, by a sample average approximation. We first provide general results on the schedule of sample sizes, under which variable-sample methods yield consistent estimators as well as bounds on the estimation error. Because the convergence analysis is performed pathwisely, we are able to obtain our results in a flexible setting, which requires mild assumptions on the distributions and which includes the possibility of using different sampling distributions along the algorithm. We illustrate these ideas by studying a modification of the well-known pure random search method, adapting it to the variable-sample scheme, and show conditions for convergence of the algorithm. Implementation issues are discussed and numerical results are presented to illustrate the ideas.
Optimal Fault-Tolerant Routing in Hypercubes Using Extended Safety Vectors
Authors: Jie Wu, Feng Gao, Zhongcheng Li, Yinghua Min
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Reliable communication in cube-based multicomputers using the extended safety vector concept is studied in this paper. In our approach, each node in a cube-based multicomputer of dimension n is associated with an extended safety vector of n bits, which is an approximated measure of the number and distribution of faults in the neighborhood. In the extended safety vector model, each node knows fault information within distance-2 and fault information outside distance-2 is coded in a special way based on the coded information of its neighbors. The extended safety vector of each node can be easily calculated through n-1 rounds of information exchanges among neighboring nodes. Optimal unicasting between two nodes is guaranteed if the kth bit of the safety vector of the source node is one, where k is the Hamming distance between the source and destination nodes. In addition, the extended safety vector can be used as a navigation tool to direct a message to its destination through a minimal path. Simulation results show a significant improvement in terms of optimal routing capability in a hypercube with faulty links using the proposed model, compared with the one using the original safety vector model.
AI Bites Man?
Authors: Marc Donner
Venue: IEEE Security and Privacy (2003)

We know that science fiction has introduced several terms that are now commonplace in computer security, but is it a harbinger of privacy-threatening new technology or just harmless fantasy?
Random Polynomial Time is Equal to Semi-Random Polynomial Time
Authors: Umesh V. Vazirani, Vijay V. Vazirani
Venue:  (1988)

We prove that any one-sided error random polynomial time (RP) algorithm can be simulated with a semi-random source at no more than polynomial factor loss in efficiency. i.e. RP=SRP. This contrasts with the fact that a semi-random source is too weak to simulate fair coin flips [SV].
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 2 edition
Authors: Klaus Finkenzeller
Venue:  (2003)

:RFID (Radio Frequency Identification) is used in all areas of automatic data capture allowing contactless identification of objects using RF. With applications ranging from secure internet payment systems to industrial automation and access control, RFID technology solutions are receiving much attention in the research and development departments of large corporations. RFID is a major growth are in auto ID, allowing emergency vehicles to safely trip traffic signals, and providing the technology behind contactless smart cards, "autopiloting" cars, and production automation. Fully revised and updated to include all the latest information on industry standards and applications, this new edition provides a standard reference for people working with RFID technology. Expanded sections explain exactly how RFID systems work, and provide up-to-date information on the development of new tags such as the smart label. Updated coverage of RFID technologies, including electron data carrier architecture and common algorithms for anticollisionDetails the latest RFID applications, such as the smartlabel, e-commerce and the electronic purse, document tracking and e-ticketingDetailed appendix providing up-to-date information on relevant ISO standards and regulations, including descriptions of ISO 14443 for contactless ticketing and ISO 15693 covering the smartlabelA leading edge reference for this rapidly evolving technology, this text is of interest to practitioners in auto ID and IT designing RFID products and end-users of RFID technology, computer and electronics engineers in security system development and microchip designers, automation, industrial and transport engineers and materials handling specialists. Also a valuable resource for graduate level students in electronics and industrial engineering design.
Data Flow Coherence Criteria in ILP Tools
Authors: Smaranda Muresan, Tudor Muresan, Rodica Potolea
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

In this paper we present a new method that uses data-flow coherence criteria in definite logic program generation. We outline three main advantages of these criteria supported by our results: i) drastically pruning the search space (around 90%), ii) reducing the set of positive examples and reducing or even removing the need for the set of negative examples, and iii) allowing the induction of predicates that are difficult or even impossible to generate by other methods. Besides these criteria, the approach takes into consideration the program termination condition for recursive predicates. The paper outlines some theoretical issues and implementation aspects of our system for automatic logic program induction.
The wavelet X-ray transform
Authors: Rob A. Zuidwijk
Venue:  (1997)

Combined use of the X-ray (Radon) transform and the wavelet transform has proved to be useful in application areas such as diagnostic medicine and seismology. In the present paper, the wavelet X-ray transform is introduced. This transform performs one-dimensional wavelet transforms along lines in ${\oR}^n$, which are parameterized in the same fashion as for the X-ray transform. It is shown that the transform has the same convenient inversion properties as the wavelet transform. The reconstruction formula receives further attention in order to obtain usable discretizations of the transform. Finally, a connection between the wavelet X-ray transform and the filtered backprojection formula is discussed.