ppxscal/embedding_network huggingface dataset:
A Vision of the Future for the Air Force (and Perhaps the Whole DoD)
Authors: Thomas F. Saunders
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

The Air Force has enthusiastically endorsed, at its most senior levels, advanced thinking with regard to the application of information technology. Recently, the notion of a Joint Battlespace Infosphere (JBI) has emerged as an idea, extending beyond the bounds of the Air Force, which could have significant impact on both the operational procedures of the Air Force and on the technologies that support them. This paper discusses some, but not all, of the many issues that are involved in developing the JBI, and it provides a couple of pointers to research topics that would be beneficial towards furthering the JBI concept.
Improved Rotational Invariance for Statistical Inverse in Electrical Impedance Tomography
Authors: Jani Lahtinen, Tomas Martinsen, Jouko Lampinen
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

In the paper we show that rotational invariance can be improved in a neural network based EIT reconstruction approach by a suitably chosen permutation of the input data. The input space is partitioned to non-overlapping sectors, and the input signal is permuted so that it lies in one sector independent of the original rotation angle. We demonstrate the advantages of the method with computer simulations. The proposed approach yields better results in the inverse problem, and allows use of smaller networks with fewer training samples.
The syntax and semantics of timed $\mu CRL$
Authors: Jan F Groote
Venue:  (1997)

We define a specification language called `{\it timed $\mu CRL$}''. This language is designed to describe communicating processes employing data and time. Timed $\mCRL$ is the successor of $\mCRL$ \cite{GroPo94a}. It differs in two main aspects. It is possible to make explicit reference to time using a new `{\it at}'' operator; $p\at{t}$ is the process $p$ where the first action must take place at time $t$. Furthermore, a distinction has been made between constructors and functions in the datatypes. Care has been taken that every $\mu$CRL specification is also a correct timed $\mu$CRL specification with exactly the same meaning.
Towards a combinatorial auction protocol among experts and amateurs: the case of single-skilled experts
Authors: Takayuki Ito, Makoto Yokoo, Shigeo Matsubara
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Auctions have recently commanded a great deal of attention in the field of multi-agent systems. Correctly judging the quality of auctioned goods is often difficult for amateurs, in particular, on the Internet auctions. We have formalized such a situation so that Nature selects the quality of the auctioned good. Experts can observe Nature's selection (i.e., the quality of the good) correctly, while amateurs, including the auctioneer, cannot. In other words, the information on Nature's selection is asymmetric between experts and amateurs. In this situation, it is difficult to attain an efficient allocation, since experts have a clear advantage over amateurs, and they would not reveal their valuable information without some reward. Thus, we have succeeded in developing a single unit auction protocol in which truth telling is a dominant strategy for each expert. In this paper, we focus on a combinatorial auction protocol under asymmetric information on Nature's selection. Experts may have an interest in, and expert knowledge on, Nature's selection for several goods, i.e., experts are versatile. However, the case of versatile experts is very complicated. Thus, as a first step, we assume experts to have an interest in, and expert knowledge on, a single good. That is, experts are single-skilled. Under these assumptions, we develop an auction protocol in which the dominant strategy for experts is truth telling. Also, for amateurs, truth-telling is the best response when experts tell the truth. By making experts to elicit their information on the quality of the goods, the protocol can achieve a Pareto efficient allocation, if certain assumptions are satisfied.
Singular limit of a transmission problem for the parabolic phase-field model
Authors: Giulio Schimperna
Venue:  (1999)

A transmission problem describing the thermal interchange between two regions occupied by possibly different fluids, which may present phase transitions, is studied in the framework of the Caginalp-Fix phase field model. Dirichlet (or Neumann) and Cauchy conditions are required. A regular solution is obtained by means of approximation techniques for parabolic systems. Then, an asymptotic study of the problem is carried out as the time relaxation parameter for the phase field tends to 0 in one of the domains. It is also proved that the limit formulation admits a unique solution in a suitable weak sense. EMAIL:: schimper@dragon.ian.pv.cnr.it KEYWORDS:: Phase-field models, maximal monotone operators, transmission problems, parabolic PDEs
Data Coverage Testing of Programs for Container Classes
Authors: Ponrudee Netisopakul, Lee White, John Morris, Daniel Hoffman
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

For the testing of container classes and thealgorithms or programs that operate on the datain a container, these data have the property ofbeing homogeneous throughout the container.We have developed an approach for thissituation called data coverage testing, whereautomated test generation can systematicallygenerate increasing test data size. Given aprogram and a test model, it can be theoreticallyshown that there exists a sufficiently large testdata set size N, such that testing with a data setsize larger than N does not detect more faults. Anumber of experiments have been conductedusing a set of C++ STL programs, comparingdata coverage testing with two other testingstrategies: statement coverage and randomgeneration. These experiments validate thetheoretical analysis for data coverage,confirming the predicted sufficiently large N foreach program.Keywords: Data coverage testing, Automatedtesting, Testing of container classes.
Local Groups in Free Burnside Groupoids
Authors: Lago Alair Pereira do
Venue:  (2001)

The study of repeated sequences is the basis of the study of \fb{groups} and \fb{semigroups}, and a better knowledge on Burnside algebras can be very useful in the analysis of many properties of sequences containing repetitions. The main theorem announced here establishes an important connection between \fb{groups} and \fb{semigroups}. In order to establish this connection, we use interesting properties on graphs, categories, combinatorics on words to obtain the algebraic main theorem. Let $\grafo{G}$ be~a (possibly infinite) strongly connected graph and let $\T$ be a set of monoid identities such that any monoid satisfying $\T$ is also a group. Let $\cat{B}$ be~the free groupoid on $\grafo{G}$ satisfying $\T$. Then, the local groups $\local{B}{v}$, for $v\in \vertices{G}$, are all isomorphic to a free group satisfying $\T$. Furthermore, it is free over a generating set which can be effectively characterized and whose cardinality is the cyclomatic number of the graph $\grafo{G}$. 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
Ergodicity and mixing rate of one-dimensional cellular automata
Authors: Kihong Park
Venue:  (1996)

Abstract One-and two-dimensional cellular automata which are known to be fault-tolerant are very complex. On the other hand, only very simple cellular automata have actually been proven to lack fault-tolerance, i.e., to be mixing. The latter either have large noise probability $\eps$ or belong to the small family of two-state nearest-neighbor monotonic rules which includes local majority voting. For a certain simple automaton $L$ called the soldiers rule, this problem has intrigued researchers for the last two decades since $L$ is clearly more robust than local voting: in the absence of noise, $L$ eliminates any finite island of perturbation from an initial configuration of all 0''s or all 1''s. The same holds for a 4-state monotonic variant of $L$, $K$, called two-line voting. We will prove that the probabilistic cellular automata $K_\eps$ and $L_\eps$ asymptotically lose all information about their initial state when subject to small, strongly biased noise. The mixing property trivially implies that the systems are ergodic. The finite-time information-retaining quality of a mixing system can be represented by its relaxation time $\Relax(\cdot)$, which measures the time before the onset of significant information loss. This is known to grow as $(1/\eps)^c$ for noisy local voting. The impressive error-correction ability of $L$ has prompted some researchers to conjecture that $\Relax(L_\eps)=2^{c/\eps}$. We prove the tight bound $2^{c_1\log^2 1/\eps} > \Relax(L_\eps) > 2^{c_2\log^2 1/\eps}$ for a biased error model. The same holds for $K_\eps$. Moreover, the lower bound is independent of the bias assumption. The strong bias assumption makes it possible to apply sparsity/renormalization techniques, the main tools of our investigation, used earlier in the opposite context of proving fault-tolerance. 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
Automatic test generation for predicates
Authors: A. Paradkar, K. C. Tai, M. A. Vouk
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

We propose a new technique for automatic generation of test cases for predicates. Earlier we proposed an efficient and effective test generation strategy for Boolean expressions. We now extend this strategy to predicates. Our new strategy addresses a number of issues, including: analysis of dependencies between relational expressions in a predicate P; generation of test constraints for P based on the detection of Boolean and relational operator faults in P; and generation of actual tests according to the generated test constraints for P. We propose the use of constraint logic programming (CLP) to automate test data generation for a predicate. Furthermore, we propose an incremental approach to apply CLP techniques to solve a constraint system. Since our technique is specification-based, it can facilitate generation of expected outputs for actual tests.
Optimizing Processing of Query Subscription in an WDM Network Environment
Authors: Weifa Liang, Maria E. Orlowska
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

In this paper, we examine query subscription processing in a Wavelength-Division Multiplexing (WDM) network environment. The users (clients) launch their queries through the Internet to an information center, which consists of several servers. The information center then assigns proper servers to process the queries, and sends the query results back to the users.We first model the problem in terms of several optimization criteria such as query processing time required by the servers, the number of wavelengths used for the query result transmissions, and the other parameters contributing to the overall execution/transmission cost. We then present efficient heuristic algorithms to solve the problem.
Beginner's Final Cut Pro: Learn to Edit Digital Video
Authors: Michael Rubin
Venue:  (2002)

:With Final Cut Pro fast becoming the de facto standard for professional video editing, it's easy to believe the software is too "high-end" for beginners. But this isn't the caseFinal Cut Pro is the ideal tool for novices and students, if you have the right teacher. Enter Final Cut Pro for Beginners. Now, with no prior video knowledge, you can learn the language of editing in just a few hours and master the essential tools to edit like a professional. Whether you're an aspiring professional filmmaker or a weekend hobbyist looking to improve on your iMovie projects, the tutorials and information in this book will help you make the leap to sophisticated, "Hollywood"-style editing. Written in an approachable, friendly style by best-selling author and entertainment-industry veteran Michael Rubin, this real-world tutorial demystifies the process of using Final Cut Pro. Starting with the basics, like mastering control of frame-by-frame movement of video, the book methodically adds tools and builds complexity. The final chapter helps you make the transition from mastering the tools of Final Cut Pro to facing many of the real-world scenarios that beginners encounter as they use FCP with low/no-budget productions. Throughout the book, Michael shares invaluable tips based on his hard-won digital video experiences using Final Cut Pro and in the trenches of Hollywood and (the more frightening) family projects. When you're finished with the book, you'll be able to build effects tracks or add music and prepare your project for output to DVD. Final Cut Pro for Beginners includes acompanion DVD with more than 4GB of video clips you can use for illustration, hands-on exercises, and or your own experiments. With Final Cut Pro software and this tutorial to lead the way, you'll be fluent in no timeready to go wherever your movie-making interests lead.
Handheld Usability
Authors: Scott Weiss
Venue:  (2002)

:Handheld devices cannot be designed simply as copies of their desktop counterparts; they have smaller displays, trickier input mechanisms, less memory. reduced storage capacity, and less powerful operating systems. Understanding the specific challenges of technology on the move is the first step towards designing great products for handheld devices. Handheld Usability is a practical, hands-on guide to designing interfaces for handheld, electronic computing and communication devices, including e-mail, pagers, Personal Digital Assistants (PDAs) and mobile telephone handsets. Don't reinvent the wheel! The lack of standardization in interface design doesn't mean that you have to start from scratch every time. This 'plain English' guide will help you to plan your own usability tests as part of the design and development process, and let you learn from insights on design gained from real life experience. With so many handheld devices to choose from, usability can be a very powerful distinguishing factor. Well designed products mean happy users, and satisfied customers become loyal customers. With the help of Handheld Usability you can give the customer what they want, and get it right first time.
Deploying Virtual Private Networks with Microsoft Windows Server 2003 Technical Reference, 1 edition
Authors: Carl DaVault, Andrea Weiss, Linda Wells
Venue:  (2003)

:This is the essential reference for any IT professional working with virtual private networks (VPNs) over Windows .NET Server and Windows 2000 Server. Unlike other VPN books on the market, this one drills down and details all the components required for effective VPN solutions, while highlighting security aspects that pose the most critical challenges to IT professionals. Coverage includes implementation of remote client access, remote site connections, business partner extranets, and internal LAN-to-LAN security.
An Approach to Preserving Sufficient Correctness in Open Resource Coalitions
Authors: Orna Raz, Mary Shaw
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

Most software that most people use most of the time needs only moderate assurance of fitness for its intended purpose. Unlike high-assurance software, where the severe consequences of failure justify substantial investment in validation, everyday software is used in settings in which occasional degraded service or even failure is tolerable. Unlike high-assurance software, which has been the subject of extensive scrutiny, everyday software has received only meager attention concerning how good it must be, how to decide whether a system is sufficiently correct, or how to detect and remedy abnormalities. The need for such techniques is particularly strong for software that takes the form of open resource coalitions - loosely coupled aggregations of independent distributed resources. In this paper, we discuss the problem of determining fitness for purpose, introduce a model for detecting abnormal behavior, and describe some of the ways to deal with abnormalities when they are detected.
A POEtic architecture for bio-inspired hardware
Authors: Gianluca Tempesti, Daniel Roggen, Eduardo Sanchez, Yann Thoma, Richard Canham, Andy Tyrrell, Juan-Manuel Moreno
Venue: Proceedings of the eighth international conference on Artificial life (2002)

The implementation of bio-inspired systems in hardware has traditionally been more a matter of artistry than of method. The reasons are multiple, but one of the main problems has always been the lack of a universal platform, of a standardized architecture, and of a proper methodology for the implementation of such systems.The ideas presented in this article are the first results of a new research project, "Reconfigurable POEtic Tissue". The goal of the project is the development of a hardware platform capable of implementing systems inspired by all the three major axes (phylogenesis, ontogenesis, and epigenesis) of bio-inspiration in digital hardware.A novel cellular architecture, capable of exploiting the main features of the future POEtic tissue and compatible with a relatively automatic design methodology, is then presented.
A Burst-Level Priority Scheme for Bursty Traffic in ATM Networks
Authors: Jose Roberto Fernandez, Matt W. Mutka
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Statistical gain is achieved in asynchronous transfer mode (ATM) networks by making bursty connections share resources stochastically. When connections with different QOS requirements share the same resources, the highest QOS requirements would typically be the limiting factor in determining the admissible load at a link. This may lead to connections with low QOS requirements getting better service than they require, leading to an underutilization of the resources. To alleviate this problem, a burst-level priority scheme is proposed. In the proposal, burst of related cells are to be handled in the network on a burst-by-burst basis. Bandwidth is allocated to bursts on-the-fly according to their priorities. This proposal includes a two-level priority CAC scheme for controlling the burst-level blocking rates of independent heterogeneous on-off sources.
Digital divide or discursive design? On the emerging ethics of information space
Authors: Nick Couldry
Venue: Ethics and Information Technology (2003)

This article seeks to identify, theoretically, some broad ethical issues about the type of space which the Internet is becoming, issues which are closely linked to developing new agendas for empirical research into Internet use. It seeks to move away from the concept of `digital divide' which has dominated debate in this area while presuming a rather static notion of the space which the Internet is, or could become. Instead, it draws on deliberative democracy theory in general and John Dryzek's concept of `discursive design' in particular to formulate six types of issue (Convergence, Who Converges?, Deliberation, Public Action, Relations to the State, and Long-term Patterns of Practice) around which both empirical research and ethical debate can focus, and which taken together will help answer whether the Internet is, or can be, in part a `discursive design' which contributes to the conditions of democratic public life.
A framework for virtual enterprise operation management
Authors: Hongmei Gou, Biqing Huang, Wenhuang Liu, Xiu Li
Venue: Computers in Industry (2003)

This paper presents researches on operation management for virtual enterprises (VEs). A virtual enterprise is a temporary alliance of member enterprises (MEs) formed to exploit fast-changing opportunities. During the operation of a virtual enterprise, its constituent member enterprises, which are geographically distributed and organizationally independent, collaborate with each other to execute the whole business process (BP) of the virtual enterprise. With the aim of addressing business integration for virtual enterprises, this paper develops a framework for virtual enterprise operation management. From the viewpoint of business processes, carried out is integral research on business process modeling, analyzing, and managing for virtual enterprises. Both the distributed business process model and the model of the virtual enterprise itself are established. The former provides the functional basis of the virtual enterprise operation, while the latter provides its structural basis. Further, the two models are integrated through the loading from the distributed business process model to the virtual enterprise model. Through such model separation and integration, business process management for virtual enterprises is enacted and business integration for virtual enterprises is achieved.
breve: a 3D environment for the simulation of decentralized systems and artificial life
Authors: Jon Klein
Venue: Proceedings of the eighth international conference on Artificial life (2002)

BREVE is a 3D simulation environment designed for simulation of decentralized systems and artificial life. While breve is conceptually similar to existing packages such as Swarm and StarLogo, the implementation of BREVE-which simulates both continuous time and continuous 3D space-is quite different such that the environment is suited to a different class of simulations. BREVE includes an interpreted object oriented language; an OpenGL display engine; collision detection; as well as experimental support for articulated body physical simulation and collision resolution with static and dynamic friction. The ultimate goal of the system is to allow decentralized simulations to be implemented quickly and easily while providing a powerful framework to facilitate the construction of advanced artificial life simulations.
SPICE: an empiricist's perspective
Authors: K. E. Emam, D. R. Goldenson
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The SPICE project aims to deliver an international standard for software process assessment by the end of 1996. As part of this project there is an empirical trials phase whose purpose is to ascertain the effectiveness of the prospective SPICE standard. Two of the objectives of the trials phase are: (a) to determine the extent to which SPICE-conformant assessments are repeatable (i.e., reliability), and (b) to determine the extent to which SPICE-conformant assessments are really measuring best software process practices (i.e., validity). This paper introduces the theoretical foundations for evaluating the reliability and validity of measurement, suggests some empirical research methods for investigating them in SPICE, and discusses the constraints and limitations of these methods within the context of the SPICE project.