ppxscal/embedding_network huggingface dataset:
The New Code Paradigm; The Artist Engineers Virtual Information Space and Virtual Experience
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper examines contemporary developments in 3D immersive art and experience as it is applied to information and spatial design. Attention is paid to historic forbears, particularly the ancient Greek art of memory, contemporary theorists, and current new media artists who are pushing code and application design to new limits. The role of the artist as ¿coder¿ and application engineer is specifically addressed. This paper anticipates specific concerns and possible technological developments in visualization and virtual spaces. As new media artists code; current boundaries between disciplines and sectors become blurred and new aesthetic judgments become pivotal. Additionally, current management and organizational structures are challenged to confront a world that increasingly visualizes and communicates in 3-D.As new media artists engage this new and dynamic paradigm the role, expectation and necessary skills of artists change. Correspondingly, computer languages and systems must be flexible, adaptable and multi-sensory. Experiential and aesthetic possibilities must also be addressed in the creation of future platforms and applications. A constellation of these concerns will be used to create immersive data and experiential structures that are increasingly intuitive, engaging, visceral and virtual
Spreadsheet visualisation to improve end-user understanding
Authors: Daniel Ballinger, Robert Biddle, James Noble
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

Spreadsheets are an extremely common form of end-user programming that have many applications, from calculating student marks to accounting for global multinationals. Ways of studying the structure of a spreadsheet itself are normally constrained to the tools provided in the spreadsheet software. This paper explores new ways to visualise spreadsheets in a manner that is independent of the program they were created in, explains the technology involved, and presents examples of the visualisations that can be produced. The techniques involved in reading the spreadsheets also facilitate larger scale analysis of spreadsheets for performing corpus analysis.
Improving Fault Coverage in System Tests
Authors: Janusz Sosnowski
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

The paper is devoted to the problem of self-testing in system environment (field diagnosis and maintenance at the end user). It discusses test process decomposition in the context of increasing hardware complexity and proliferation of embedded DFT and BIST circuitry in the commercial off the shelve VLSI chips (COTS). Test observability is improved with the use of various on-line monitoring mechanisms. To optimize test effectiveness we use special tools based on direct and indirect fault coverage analysis.
Subject switching algorithms for access control in federated databases
Authors: Jacqueline Yang, Duminda Wijesekera, Sushil Jajodia
Venue: Proceedings of the fifteenth annual working conference on Database and application security (2001)

Authentication in federated database systems present difficulties because the autonomously operated components may not know the identity of federation users. One proposed solution is subject switching, where the federation translates the federated users identity to that of an agreed upon component subject. This translation may be problematic, due to not having component subjects with the same accesses requested by federation users. Therefore, we propose using proximity measures between requested and provided accesses and present two policy neutral algorithms to find proximity minimizing matches between a federation subject and a collection of component subjects.
Sequence World: A Genetics Database in Virtual Reality
Authors: I. Rojdestvenski, F. Pettersson, D. Modjeska
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Proper information visualization has always been viewed as an important tool for research. Traditionally, however, it was regarded as only a tool, with information content and visualization analogous to an object and its representation, respectively. These days, visualization is increasingly seen as an integral part of information content, without which data collections may lose significant value. This paper is devoted to applying a new visualization scheme -SequenceWorld -to a genetics database. We view a collection of genetic sequences as a brow sable virtual world. Sequences cluster according to their homologies. Their relative position, color and shape codings offer direct visual perception of a significant amount of information, which would otherwise be available only via extensive analysis of numerical and textual data. We discuss the usability of Sequence World for completing traditional and novel genetic database search tasks, particularly since a holistic view of a complete genome has recently become possible.
Advantages of Differential Dynamic Programming Over Newton''s Method for Discrete-time Optimal Control Problems
Authors: Li Liao, Christine A. Shoemaker
Venue:  (1992)

Differential Dynamic Programming (DDP) and stagewise Newton''s method are both quadratically convergent algorithms for solving discrete time optimal control problems. Although these two algorithms share many theoretical similarities, they demonstrate significantly different numerical performance. In this paper, we will compare and analyze these two algorithms in detail and derive another quadratically convergent algorithm which is a combination of the DDP algorithm and Newton''s method. This new second-order algorithm plays a key role in the explanation of the numerical differences between the DDP algorithm and Newton''s method. The detailed algorithmic and structural differences for these three algorithms and their impact on numerical performance will be discussed and explored. Two test problems with various dimensions solved by these three algorithms will be presented. One nonlinear test problem demonstrates that the DDP algorithm can be as much as 28 times faster than the stagewise Newton''s method. The numerical comparsion indicates that the DDP algorithm is numerically superior to the stagewise Newton''s method.
A Decision Problem Involving Tournaments
Authors: Gregory L. Cherlin, Brenda J. Latka
Venue:  (1996)

A class of finite tournaments determined by a set of ``forbidden subtournaments'''' is well-quasi-ordered if and only if it contains no infinite antichain (a set of incomparable elements). It is not known if there is an algorithm which decides whether or not a class of finite tournaments determined by a finite set of forbidden subtournaments has this property. We prove a noneffective finiteness theorem bearing on the problem. We show that for each fixed $k$, there is a finite set of infinite antichains, $\Lambda_k$, with the following property: if any class defined by $k$ forbidden subtournaments contains an infinite antichain, then a cofinite subset of an element of $\Lambda_k$ must be such an antichain. By refining this analysis and using an earlier result giving an explicit algorithm for the case $k=1$, we show that there exists an algorithm which decides whether or not a class of finite tournaments determined by two forbidden subtournaments is well-quasi-ordered. footnote: This work was the result of the authors'' collaboration during the 95/96 Special Year on Logic and Algorithms.
Natural methods for robot task learning: instructive demonstrations, generalization and practice
Authors: Monica N. Nicolescu, Maja J. Mataric
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Among humans, teaching various tasks is a complex process which relies on multiple means for interaction and learning, both on the part of the teacher and of the learner. Used together, these modalities lead to effective teaching and learning approaches, respectively. In the robotics domain, task teaching has been mostly addressed by using only one or very few of these interactions. In this paper we present an approach for teaching robots that relies on the key features and the general approach people use when teaching each other: first give a demonstration, then allow the learner to refine the acquired capabilities by practicing under the teacher's supervision, involving a small number of trials. Depending on the quality of the learned task, the teacher may either demonstrate it again or provide specific feedback during the learner's practice trial for further refinement. Also, as people do during demonstrations, the teacher can provide simple instructions and informative cues, increasing the performance of learning. Thus, instructive demonstrations, generalization over multiple demonstrations and practice trials are essential features for a successful human-robot teaching approach. We implemented a system that enables all these capabilities and validated these concepts with a Pioneer 2DX mobile robot learning tasks from multiple demonstrations and teacher feedback.
Parallel Continuation-Based Global Optimization for Molecular Conformation and Protein Folding
Authors: Thomas F. Coleman, Zhijun Wu
Venue:  (1994)

This paper presents our recent work on developing parallel algorithms and software for solving the global minimization problem for molecular conformation, especially protein folding. Global minimization problems are difficult to solve when the objective functions have many local minimizers, such as the energy functions for protein folding. In our approach, to avoid directly minimizing a "difficult" function, a special integral transformation is introduced to transform the function into a class of gradually deformed, but "smoother" or "easier" functions. An optimization procedure is then applied to the new functions successively, to trace their solutions back to the original function. The method can be applied to a large class of nonlinear partially separable functions including energy functions for molecular conformation and protein folding. Mathematical theory for the method, as a special continuation approach to global optimization, is established. Algorithms with different solutions tracing strategies are developed. Different levels of parallelism are exploited for the implementation of the algorithms on massively parallel architectures. Keywords: global/local minimization, numerical continuation, parallel computation, protein folding
Set Constaints and Logic Programming
Authors: Dexter Kozen
Venue:  (1995)

Set constraints are inclusion relations between expressions denoting sets of ground terms over a randed alphabet. They are the main ingredient in set-based program analysis[3,4,12,13,17,20,21,22,26]. In this paper we describe a constraint logic programming language CLP(SC) over set constraints in the style of Jaffar and Lassez[15]. The language subsumes ordinary logic programs over an IIerbrand domain. We give an efficient unification algorithm and operational, declarative, and fixpoint semantics. We show how the language can be applied in set-based program analysis by deriving explicitly the monadic approximation of the collecting semantics of IIeintze and Jaffar[12,13]. 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
How to Prepare for the AP Computer Science Exam, 2 edition
Authors: Roselyn Teukolsky
Venue:  (2003)

:This new Java edition of the AP Computer Science manual presents four full-length AP Computer Science practice exams with questions answered and explained. Two are A exams, two are AB exams, and all four are modeled on the actual exam. A general subject review covers all topics tested on the exam, including Java language features; classes and objects; inheritance and polymorphism; program design and analysis; one- and two-dimensional arrays; recursion; linked lists; stacks, queues and priority queues; trees; collections; and sorting and searching. A final chapter describes the Marine Biology Simulation Case Study.
An Efficient Adaptive Search Algorithm for Scheduling Real-Time Traffic
Authors: Geoffrey G. Xie, Simon S. Lam
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

In a mobile computing environment, efficient allocation of wireless channels is consequential to the system performance. This paper presents a distributed channel allocation algorithm based on the concept of dynamic channel boundaries. Under this scheme, each mobile service station (MSS) is assigned a contiguous range of channels not overlapping with those of its neighbors. Channel boundaries between adjacent MSSs are dynamically adjustable through voluntary withdrawals. High efficiency is provided by two important features: early boundary expansion and need-based boundary redrawing. This algorithm imposes a low message volume on the fixed network, has short response times to connection requests and achieves high channel utilization under both evenly and unevenly distributed loads. Channel utilization is further improved if a MSS may borrow channels from its neighbors. Simulation results indicate this algorithm out-performs other distributed channel allocation algorithms.
Fault simulation in sequential multi-valued logic networks
Authors: R. Drechsler, M. Keim, B. Becker
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

In this paper we present a fault simulator for Sequential Multi-Valued Logic Networks (SMVLN). With this tool we investigate their random pattern testability (RPT). We discuss a unified approach for fault models in SMVLNs and show that it is possible to describe all static fault models with a global formalism. A large set of experimental results is given that demonstrates the efficiency of our approach. For the first time fault coverages for the Stuck-At Fault Model (SAFM) and Skew Fault Model (SKFM) for large sequential circuits are reported.
An economic production quantity inventory model involving fuzzy demand rate and fuzzy deterioration rate
Authors: Sujit Kumar De, P. K. Kundu A. Goswami
Venue: The Korean Journal of Computational Applied Mathematics (2003)

Generally, in deriving the solution of economic production quantity (EPQ) inventory model, we consider the demand rate and deterioration rate as constant quantity. But in case of real life problems, the demand rate and deterioration rate are not actually constant but slightly disturbed from their original crisp value. The motivation of this paper is to consider a more realistic EPQ inventory model with finite production rate, fuzzy demand rate and fuzzy deterioration rate. The effect of the loss in production quantity due to faulty/old machine have also been taken into consideration. The methodology to obtain the optimum value of the fuzzy total cost is derived and a numerical example is used to illustrate the computation procedure. A sensitivity analysis is also carried out to get the sensitiveness of the tolarance of different input parameters.
A Totally Ordered and Secure Multicast Protocol for Distributed Virtual Environment
Authors: Fumiaki Sato, Kunihiko Minamihata, Tadanori Mizuno
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Sharing a virtual space by many users, a Distributed Virtual Reality Environment (DVE) provides the high-level communication and cooperative design facilities. For the large scaled DVE in the wide area network, a reliable and efficient multicast protocol on the Internet is necessary. We have developed a reliable multicast protocol based on the sequence server and evaluated with simulation.From our simulation result, our protocol is more scalable than RMP (Reliable Multicast Protocol). However, the protocol has an obvious drawback that the ordering cost is centralized to the sequence server. Therefore, the scalability and extensibility is limited. Furthermore, security support is not provided. It is important matter for the reality of the DVE system. In this paper, we propose the method to distribute the workload to some servers to make the protocol scalable and extensile. From our simulation result, the message arrival time to members are extremely reduced. In addition, we propose the key distribution mechanism for the secure multicast communication.
Performance of various computers using standard linear equations software in a Fortran environment
Authors: Jack J. Dongarra
Venue: ACM SIGARCH Computer Architecture News (1983)

In this note we compare a number of different computer systems for solving dense systems of linear equations using the LINPACK software in a Fortran environment. There are about 50 computers compared, ranging from a Cray X-MP to the 68000 based systems such as the Apollo and SUN Workstations.
A Characterization of First-Order Definable Subsets on Classes of Finite Total Orders
Authors: A. J. Kfoury, M. Wymann-Boeni
Venue:  (1993)

Abstract We give an explicit and easy-to-verify characterization for subsets in finite total orders (infinitely many of them in general) to be definable by the same first-order formula over any class of finite total orders. From this characterization we derive immediately that Beth''s definability theorem does not hold in any class of finite total orders, as well as that McColm''s first conjecture is true for all classes of finite total orders. Another consequence is a natural 0-1 law for definable subsets on finite total orders expressed as a statement about the possible densities of first-order definable subsets.
Thurstonian-type representations for "same-different" discriminations: deterministic decisions and independent images
Authors: Ehtibar N. Dzhafarov
Venue: Journal of Mathematical Psychology (2003)

A discrimination probability function Φ(x, y) obtained in the "same-different" paradigm assigns to every ordered pair of stimuli (x, y) the probability with which they are judged to be different. This function is said to possess the regular minimality property if, for any stimulus pair (a, b), arg miny Φ(a,y) = b ↔ arg minx Φ(x,b) = a. That is, b is the point of subjective equality for a if and only if a is the point of subjective equality for b. If the value of Φ(a, b) across all such pairs (a, b) is not constant, the function is said to possess the nonconstant self-similarity property. A Thurstonian-type representation for Φ(x, y) (with independent images and deterministic decisions) is a model in which the two stimuli are mapped into two independent random variables P(x) and Q(y) taking on their values in some "perceptual" space; and the decision whether the two stimuli are different is determined by the realizations of the two random variables in a given trial. Thurstonian-type representations can also be called "random utility" ones, provided one imposes no a priori restrictions on the structure of the perceptual space, the distributions of P(x) and Q(y), or the decision rules used. It is shown that (A) any Φ(x, y) has a Thurstonian-type representation; but (B) if Φ(x, y) possesses the regular minimality and nonconstant self-similarity properties, it cannot have a "well-behaved" Thurstonian-type representation, in which the probability with which P(x), or Q(y), falls within a given subset of the perceptual space has appropriately defined bounded directional derivatives with respect to x (respectively, y). This regularity feature is likely to be found in most conceivable Thurstonian-type models constructed to fit empirical data.
Recognition and reconstruction of buildings from multiple aerial images
Authors: Christopher Jaynes, Edward Riseman, Allen Hanson
Venue: Computer Vision and Image Understanding (2003)

We present a model-based approach to the automatic detection and reconstruction of buildings from aerial imagery. Buildings are first segmented from the scene in an optical image followed by a reconstruction process that makes use of a corresponding digital elevation map (DEM). Initially, each segmented DEM region likely to contain a building rooftop is indexed into a database of parameterized surface models that represent different building shape classes such as peaked, flat, or curved roofs. Given a set of indexed models, each is fit to the elevation data using a robust iterative procedure that determines the precise position and shape of the building rooftop. The indexed model that converges to the data with the lowest residual fit error is then added to the scene by extruding the fit rooftop surfaces to a local ground plane.The approach is based on the observation that a significant amount of rooftop variation can be modeled as the union of a small set of parameterized models and their combinations. By first recognizing the rooftop as one of the several potential rooftop shapes and fitting only these surfaces, the technique remains robust while still capable of reconstructing a wide variety of building types. In contrast to earlier approaches that presuppose a particular class of rooftops to be reconstructed (e.g., flat roofs), the algorithm is capable of reconstructing a variety of building types including peaked, flat, multi-level flat, and curved surfaces. The approach is evaluated on two datasets. Recognition rates for the different building rooftop classes and reconstruction accuracy are reported.
Trends and patterns among online software pirates
Authors: Sameer Hinduja
Venue: Ethics and Information Technology (2003)

Computer crime on the Internet poses a significant threat to the well-being of businesses and individuals, and none are immune from the repercussions that can result. One type of this unethical and unlawful activity is online software piracy. In this work, the significance of piracy as a topic for academic inquiry is first presented, followed by a summary of the conflicting stances on this issue. Then, a review of scholarly literature previously conducted in this area is given to provide a backdrop for the current research. Univariate and bivariate findings from a quantitative study of students are used to demonstrate the incidence, scope, and associated correlates of Internet piracy in a university setting. Technological and ethical policy solutions that an institution might implement are suggested and discussed in conclusion.
ASP.Net Professional Secrets, 1 edition
Authors: Bill Evjen, Thiru Thangarathinam, Bill Hatfield, Doug Seven, Srinivasa Sivakumar
Venue:  (2003)

:ASP.NET is a revolutionary new programming framework that enables the rapid development of powerful Web applications and services. It provides the easiest and most scalable way to build, deploy, and run distributed Web apps that can target any browser or device.
An NC Approximation Algorithm for Optimal k -Edge Connectivity Augmentation
Authors: Weifa Liang, Brendan D. McKay
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Given an undirected graph G - (V; E0) with |V| = n, and a feasible weighted edge set E such that \mathis k-edge connected, the optimal k-edge connectivity augmentation problem is to find a subset \mathsuch that \mathis k- edge connected and the weighted sum of the edges in S is minimum, where k is a fixed integer. Since this problem is NP-complete for \math, in this paper we will focus on its approximation solution in the parallel environment. If G is (k - 1)-edge connected, the solution delivered by our NC approximation algorithm is within either twice the optimum if k is even, or 2t times the optimum otherwise, where \math. If G is \math- edge connected and \math, the solution delivered by our approximation algorithm is 2\mathtimes the optimum, where \mathis defined as follows: (i) if k and \mathare both odd or both even, then \math= \math; (ii) if k is even and \mathis odd, then \math= \math; (iii) otherwise, \math= \math.