ppxscal/embedding_network huggingface dataset:
Trends in system safety: a European view?
Authors: John A. McDermid
Venue: Proceedings of the seventh Australian workshop conference on Safety critical systems and software 2002 - Volume 15 (2003)

This brief paper sets out some perceptions of trends in regulatory policy, public perception of safety, systems and software engineering which impact safety engineering practises. The paper takes a European perspective, but is largely a personal view. It should also be noted that many of the change drivers are of international scope.
Representation of uncertain belief using interval probability
Authors: P. H. Giang
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

In this paper, uncertain belief representation by using probability is investigated. The representation equivalence between interval probability suggested by D.D. Phan (1990) and convex set of probability distribution by H. Kyburg (1990) is proved. Probabilistic closures using classical and relevant consequence relations are defined and compared. Their agreement on a non-tautological fragment is proved.
Making Movies, Photos, Music and Dvds on Your MAC: Using Apple's Digital Hub, 1 edition
Authors: Jesse Feiler
Venue:  (2002)

:Enhance your life with an amazing array of Apple tools. This thorough treatment of four new and powerful technologies--iMovie, iPhoto, iTunes, and iDVD--provides solid explanations, useful examples, and plenty of helpful references. Cover basics of the digital hub, such as digital photography, connectivity, .Mac, and other Internet features, as well as printing and more. Integrate applications and automate workflows with AppleScript. Learn to burn and mix your own music library. Direct movies and create DVDs with the ease of a Hollywood pro. With this book, digital hub tool users can take full advantage of plug-and-play technologies, images and video, and the world-renowned Apple interface.
Core Servlets and JavaServer Pages (JSP), 2 edition
Authors: Marty Hall, Larry Brown
Venue:  (2003)

The J2EE(TM) Platform has become the technology of choice for developing professional e-commerce applications, interactive Web sites, and Web-enabled applications and services. Servlet and JSP(TM) technology is the foundation of this platform: it provides the link between Web clients and server-side applications. In this 2nd edition of the worldwide bestseller, the authors show you how to apply the latest servlet and JSP capabilities. Unlike other books that treat servlet or JSP technology in isolation, Core Servlets and JavaServer Pages provides a unified treatment, showing you when servlet technology is best, when the JSP approach is preferred, and when (and how) servlets and JSP should work together.Part I provides exhaustive coverage of the servlet 2.4 specification. It starts with server configuration, basic syntax, the servlet life cycle, and use of form data. It moves on to applying HTTP 1.1, cookies, and session tracking. Advanced topics include compressing Web content, incrementally updating results, dynamically generating images, and creating shopping carts.Part II gives an in-depth guide to JSP 2.0. It covers both the "classic" JSP scripting elements and the new JSP 2.0 expression language. It shows how to control the content type, designate error pages, include files, and integrate JavaBeans components. Advanced topics include sharing beans, generating Excel spreadsheets, and dealing with concurrency.Part III covers two key supporting technologies: HTML forms and database access with JDBC(TM). It explains every standard HTML input element and shows how to use appropriate JDBC drivers, perform database queries, process results, and perform updates. Advanced topics include parameterized queries, stored procedures, and transaction control.Design strategies include ways to integrate servlet and JSP technology, best practices for invoking Java code from JSP pages, plans for dealing with missing and malformed data, and application of the MVC architecture.Handy guides walk you through use of three popular servlet and JSP engines (Apache Tomcat, Macromedia JRun, and Caucho Resin) and some of the most widely used database systems (MySQL, Oracle9i, Microsoft Access).Volume 2 of this book covers advanced topics: filters, custom tag libraries, database connection pooling, Web application security, the JSP Standard Tag Library (JSTL), Apache Struts, JavaServer Faces (JSF), JAXB, and more. The same clear step-by-step explanations that made the first edition so popular Completely updated for the latest standards: servlets 2.4 and JSP 2.0 Hundreds of completely portable, fully documented,industrial-strength examplesDetailed treatment of Apache Tomcat, Macromedia JRun, and Caucho Resin Online access to all source code, available free for unrestricted use at the author's www.coreservlets.com web site.
Snap-Stabilizing PIF Algorithm in Arbitrary Networks
Authors: Alain Cournier, Ajoy K. Datta, Franck Petit, Vincent Villain
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

We present the first snap-stabilizing Propagation of Information with Feedback (PIF) protocol in arbitrary networks. A snap-stabilizing protocol, starting from any arbitrary initial system configuration, always behaves according to its specification. Our protocol is distributed, deterministic, and does not use a pre-constructed spanning tree.
How Many Disjoint 2--edge Paths Must a Cubic Graph Have?
Authors: Kelmans Alexander, Mubayi Dhruv
Venue:  (2000)

In this paper we show that every simple cubic graph on $n$ vertices has a list of at least n/4 disjoint 2-edge paths and that this bound is sharp. Our proof provides a polynomial time algorithm for finding such a list in a simple cubic graph. Keywords: packing, 2--edge path, cubic graph, polynomial time algorithm.
On the composition of intuitionistic fuzzy relations
Authors: Glad Deschrijver, Etienne E. Kerre
Venue: Fuzzy Sets and Systems (2003)

Fuzzy relations are able to model vagueness, in the sense that they provide the degree to which two objects are related to each other. However, they cannot model uncertainty: there is no means to attribute reliability information to the membership degrees. Intuitionistic fuzzy sets, as defined by Atanassov (Instuitionistic Fuzzy Sets, Physica-Verlag, Heidelberg, New York, 1999), give us a way to incorporate uncertainty in an additional degree. Intuitionistic fuzzy relations are intuitionistic fuzzy sets in a cartesian product of universes.One of the main concepts in relational calculus is the composition of two relations. Burillo and Bustince (Fuzzy Sets and Systems 78 (1996) 293; Soft Comput. 2 (1995) 5) have extended the sup-T composition of fuzzy relations to a composition of intuitionistic fuzzy relations. In this paper, we present an intuitionistic fuzzy version of the triangular compositions of Bandler and Kohout (in: P. Wang, S. Chang (Eds.), Theory and Application to Policy Analysis and Information Systems, Plenum Press, New York, 1980, p. 341) and the variants of these compositions given by De Baets and Kerre (Adv. Electron. Electron Phys. 89 (1994) 255). Some properties of these compositions are investigated: containment, convertibility, monotonicity, interaction with union and intersection.
Dynamic Email Organization via Relevance Categories
Authors: Kenrick Mock
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Many researchers have proposed classification systems that automatically classify email in order to reduce information overload. However, none of these systems are in use today. This paper examines some of the problems with classification technologies and proposes Relevance Categories as a method to avoid some of these problems. In particular, the dynamic nature of email categories, the cognitive overhead required training categories, and the high costs of classification errors are hurdles for many classification algorithms. Relevance Categories avoid some of these problems through their simplicity; they are merely relevance-ranked lists of email messages that are similar to a set of query messages. By displaying messages as the result of a dynamic query in lieu of fixed categories, we hypothesize that users will be less sensitive to errors using the Relevance Categories scheme than to errors using a fixed categorization scheme. To study the effectiveness of the Relevance Categories concept, we devised a performance metric for relevance ranking and used it to test an inverted index implementation on the Reuters-21578 test collection. The promising test results indicate the need for further work
Layered Analytic Performance Modelling of a Distributed Database System
Authors: Fahim Sheikh, Murray Woodside
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Very few analytic models have been reported for distributed database systems, perhaps because of complex relationships of the different kinds of resources in them. Layered Queueing Models seem to be a natural framework for these systems, capable of modeling all the different features which are important for performance (eg. devices, communications, multi-threaded processes, locking). To demonstrate the suitability of the layered framework a previous queueing study of the CARAT distributed testbed has been recast as a layered model. Whereas the queueing model bears no obvious resemblance to the database system, the layered model directly reflects its architecture. The layered model predictions have about the same accuracy as the queueing model.
LYS: A Solution for System on Chip (SoC) Production Cost and Time to Volume Reduction
Authors: Jean-Pierre HELIOT, Florent Parmentier, Marie-Pierre Baron
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

With the introduction of new generations of Systemson Chip (SoC) on 0.18 µm and 0.12µm technologies, theproduction cost and time to volume become more andmore critical, on top of best in class level of quality andreliability. The SoC approach - widely based on the usageof cell libraries or reusable IP blocks - brings extremecomplexity. Accurate knowledge and level of validationon silicon of each block of library/IP used within newchip becomes mandatory in order to secure first siliconsuccess.In this context, knowledge sharing between users ofthe same IP in different SoC plays a key role in costoptimisation & time to volume reduction.This paper describes the information system solutiondeveloped on 0.18µm technology, named LYS (LibraryYield System). LYS allows keeping track of the versionof library cells or reusable IP blocks used within eachSoC of a given technology. Each SoC project is analysedat different steps of its life cycle starting from productspecification up to silicon qualification. Block by blocksilicon results applied to SoC, and early warning systemlinking the different projects together, allow to optimiseand update in real time the content of each projects, and toperform the needed improvements.This methodology allows, before mask order, any newproject to be updated with appropriate library or IP blocksrevision in order to get rid of known silicon issuesdetected on previous projects.This solution is now fully implemented and in use on0.35µm, 0.25µm, 0.18µm, 0.12µm, and 90nmtechnologies.As far as we know, there is no equivalent solutionavailable & running in microelectronics companies.This solution (LYS) has already proven to bemandatory for all new technologies: the content (in termsof cell libraries and IP blocks) of more than 60% of the0.18µm products were optimised thanks to LYS. Theseoptimisations mainly covered library design robustnessand yield maximization. We can today estimate thatseveral months were saved in time to volume for the0.18µm production.
Group Communication Protocol for Multimedia Applications
Authors: Kenichi Shimamura, Katsuya Tanaka, Makoto Takizawa
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In distributed applications like teleconferences, a group of multiple processes are cooperating, where messages exchanged among the processes are required to be causally delivered. The processes are exchanging kinds of multimedia objects in addition to traditional text data. The multimedia objects are longer than traditional messages and are structured in part-of relations.In this paper, we discuss new types of causally precedent relations among multimedia objects transmitted in the network. We discuss a protocol to causally deliver multimedia objects in a group of processes. We also present the evaluation of the protocol.
LC-RTP (Loss Collection RTP): Reliability for Video Caching in the Internet
Authors: Michael Zink, Alex Jonas, Carsten Griwodz, Ralf Steinmetz
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

The increasing amount of audio-visual (AV) content that is offered by web sites leads to a network bandwidth and storage capacity problem. Caching is one of the techniques that can ease this problem. However, even in a caching system the distribution of data (i.e. the AV content) should be bandwidth-efficient. Furthermore, the delivery to the end-user must regard the restrictions implied by real-time data. This paper describes LC-RTP, an efficient and simple reliable multicast protocol that complies with RTP ([1]). Its deployment would require changes neither to the network infrastructure nor to existing end-user presentation software. It provides lossless transmission of AV content into cache servers and concurrently, lossy real-time delivery to end-users using multicast. It achieves reliability by retransmission. The traffic increase is minimal because the transmission of the AV content and any caching will take place while the end-user is served. Support for multicast in the distribution system ensures that all cache servers of a multicast group can cache an AV content while transmitting it to a consumer. Finally, we present the results of long distance file transmissions in order to show that LC-RTP performs well and meet the requirements for lossless transmission of AV content.
On-Line Handwriting Recognition with Support Vector Machines " A Kernel Approach
Authors: Claus Bahlmann, Bernard Haasdonk, Hans Burkhardt
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this contribution we describe a novel classification approach for on-line handwriting recognition. The technique combines dynamic time warping (DTW) and support vector machines (SVMs) by establishing a new SVM kernel. We call this kernel Gaussian DTW (GDTW) kernel. This kernel approach has a main advantage over common HMM techniques. It does not assume a model for the generative class conditional densities. Instead, it directlyaddresses the problem of discrimination by creating class boundaries and thus is less sensitive to modeling assumptions. By incorporating DTW in the kernel function, general classification problems with variable-sized sequential data can be handled. In this respect the proposed method can be straightforwardly applied to all classification problems, where DTW gives a reasonable distance measure, e.g. speech recognition or genome processing. We show experiments with this kernel approach on the UNIPEN handwriting data, achieving results comparable to an HMM-based technique.
FRESH: A Higher-Order Language with Unification and Multiple Results
Authors: Gert Smolka, Prakash Panangaden
Venue:  (1985)

This paper presents Fresh, a language that integrates logic programming features into higher-order functional programming. The language incorporates unification, multiple results and a collection construct. Many examples illustrate that these extensions of functional programming are useful. We define an operational semantics along the lines of Plotkin''s structural approach. The semantics is of intrinsic interest since it covers backtracking and the collection construct. To illustrate the conceptual similarities and differences between functional and logic programming, we begin with a purely functional core language and add first unification and then backtracking. With each addition we discuss the enhanced eloquence of the language and the concomitant modifications to the semantics.
Poaching and Distraction in Asynchronous Agent Activities
Authors: Mike H. Chia, Daniel E. Neiman, Victor R. Lesser
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

We investigate coordination issues in a distributed job-shop scheduling system in which agents schedule potentially contentious activities asynchronously in parallel. Agents in such a system will in general have a limited view of the global state of resources and must exchange appropriate state information with other agents in order to schedule effectively. However, even given perfect instantaneous knowledge of other agents' resource requirements, agents still may not be able to schedule effectively if they do not also model the possible future actions of other agents and the effects of their own actions. We formally describe two types of agent behaviors, poaching and distraction, arising from the asynchronous nature of distributed systems that decrease scheduling effectiveness, and we present experimental results from a distributed airport resource management system demonstrating a significant improvement in scheduling performance when coordination mechanisms are used to prevent such behaviors.
Optimal Primary-Backup Protocols
Authors: Navin Budhiraja, Keith Marzullo, Fred B. Schneider, Sam Toueg
Venue:  (1992)

We give primary-backup protocols for various models of failure. These protocols are optimal with respect to degree of replication, failover time, and response time to client requests.
Computing a Sparse Basis for the Null Space
Authors: John R. Gilbert, Michael T. Heath
Venue:  (1986)

We present algorithms for computing a sparse basis for the null space of a sparse underdetermined matrix. We describe several possible computational strategies, both combinatorial and noncombinatorial in nature, and we compare their effectiveness for several test problems.
Partial Database Replication using Epidemic Communication
Authors: JoAnne Holliday, Divyakant Agrawal, Amr El Abbadi
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Data replication in distributed databases has been investigated extensively with the hope that it will improve performance, reliability, and availability. However, the growth of the Internet has shown us that current replica management do not work well when the replicas are connected by an unreliable network, subject to congestion and dynamic topology changes. In this paper, we present a replica update protocol that handles an adaptive partial replication scheme on such a network.
A Comparison of Optimization Heuristics for the Data Mapping Problem
Authors: Nikos Chrisochoides, Nashat Mansour, Geoffrey Fox
Venue:  (1995)

In this paper we compare the performance of six heuristics with suboptimal solutions for the data mapping problem of two dimensional meshes that are used for the numerical solution of Partial Differential Equations (PDEs) on multicomputers. The data mapping heuristics are evaluated with respect to seven criteria covering load balancing, interprocessor communication, flexibility and ease of use for a class of single-phase iterative PDE solvers. Our evaluation suggests that the simple and fast block distribution heuristic can be as effective as the other five complex and computationally expensive algorithms.
The Effect of Nogood Learning in Distributed Constraint Satisfaction
Authors: Katsutoshi Hirayama, Makoto Yokoo
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constraint satisfaction algorithms and can efficiently make effective nogoods.We combine the method with the asynchronous weak-commitment search algorithm (AWC) and evaluate the performance of the resultant algorithm on distributed 3-coloring problems and distributed 3SAT problems. As a result, we found that the resolvent-based learning works well compared to previous learning methods for distributed constraint satisfaction algorithms. We also found that the AWC with the resolvent-based learning is able to find a solution with fewer cycles than the distributed breakout algorithm, which was known to be the most efficient algorithm (in terms of cycles) for solving distributed constraint satisfaction problems.
Combining Trust Region and Affine Scaling Linearly Constrained Nonconvex Minimization
Authors: T. F. Coleman, Yuying Li
Venue:  (1997)

An interior point method is proposed for a general nonlinear (nonconvex) minimization with linear inequality constraints. This method is a combination of the trust region idea for nonlinearity and affine scaling technique for constraints. Using this method, the original objective function is monotonically decreased. In the proposed approach, a Newton step is derived directly from the complementarity conditions. A trust region subproblem is formed which yields an approximate Newton step as its solution asymptotically. The objective function of the trust region subproblem is the quadratic approximation to the original objective function plus an augmented quadratic convex term. Similar to an augmented Lagrangian function, this augmentation adds positive curvature in the range space of the constraint normals. The global convergence is achieved by possibly using trust regions with different shapes. A reflection technique, which accelerates convergence, is described. Explicit sufficient decrease conditions are proposed. Computational results of a two-dimensional trust region implementation are reported for large-scale problems. Preliminary experiments suggest that this method can be effective; a relatively small number of function evaluations are required for some medium and large test problems.
A Primer for Program Composition Notation
Authors: K. M Chandy, Stephen Taylor
Venue:  (1990)

This primer describes a notation for program composition. Program composition is putting programs together to get larger ones. PCN (Program Composition Notation) is a programming language that allows programmers to compose programs so that composed programs execute efficiently on uniprocessors, distributed-memory multicomputers or shared-memory multiprocessors. (Revised December 12, 1990)