ppxscal/embedding_network huggingface dataset:
ZEN: A Directive-Based Language for Automatic Experiment Management of Distributed and Parallel Programs
Authors: Radu Prodan, Thomas Fahringer
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

So far there exists very little support to specify and to control execution of a large number of experiments on distributed and parallel architectures. This paper describes ZEN, a directive-based language for the specification of arbitrarily complex program executions by varying problem, system, or machine parameters for parallel and distributed applications. ZEN introduces directives to substitute strings and to insert assignment statements inside arbitrary files, such as program, input, script, or makefiles. The programmer thus can invoke experiments for arbitrary value ranges of any problem parameter, including program variables, file names, compiler options, target machines, machine sizes, scheduling strategies, data distributions, etc. The number of experiments can be controlled through ZEN constraintdirectives. Finally, the programmer may request a large set of performance metrics to be computed for any code region of interest. The scope of ZEN directives can be restrictedto arbitrary file or code regions. We have implemented a prototype tool for automatic experiment management that is based on ZEN. We will report results for performance analysisof an ocean simulation application and for parameter study of a computational finance code.
Determining Points of a Circular Region Reachable by Joints of a Robot Arm
Authors: John E. Hopcroft, Deborah A. Joseph, Sue H. Whitesides
Venue:  (1982)

An ``arm'''' is a sequence of links whose endpoints are connected consecutively by movable joints. The location of the first endpoint is fixed. This report gives a polynomial time algorithm for determining the regions that each joint can reach when the arm is restricted to a circular region of the plane.
ARCA API Specification Document
Authors: Alberto Catoni, Mario Loffredo, Giuseppe Romano, Oreste Signore
Venue:  (1996)

This report presents the API functions prototypes and the necessary datatypes to implement the communication between the ARCA Target and the OPAC. EMAIL:: O.Signore@cnuce.cnr.it
Java Pros: Java Experts Reveal the Tricks of the Trade for Java Programmers of All Levels
Venue:  (2003)

:Focusing on the theories behind using Java, creative ways to get the most out of it, and how to implement unique and inventive solutions, this collection of white papers from Java professionals leverages their experience in some of today's most innovative and important companies. These companies include BMC Software, BEA, Novell, and Perot Systems. A look into the minds of the world's best Java programmers and CTOs, this is critical reading for every executive, CTO, programmer, and techie interested in Java on a professional or personal level. 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
Concepts and Architecture of a Security-Centric Mobile Agent Server
Authors: Volker Roth, Mehrdad Jalali-Sohi
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Mobile software agents are software components that are able to move in a network. They are often considered as an attractive technology in electronic commerce applications. Although security concerns prevail. In this paper we describe the architecture and concepts of the SeMoA server--a runtime environment for Java-based mobile agents. Its architecture has a focus on security and easy extendability, and offers a framework for transparent content inspection of agents by means of filters. We implemented filters that handle agent signing and authentication as well as selective encryption of agent contents. Filters are applied transparently such that agents need not be aware of the security services provided by the server.
Algorithms, 1 edition
Authors: Richard Johnsonbaugh, Marcus Schaefer
Venue:  (2003)

:Filling the void left by other algorithms books, Algorithms and Data Structures provides an approach that emphasizes design techniques. The volume includes application of algorithms, examples, end-of-section exercises, end-of-chapter exercises, hints and solutions to selected exercises, figures and notes to help the reader master the design and analysis of algorithms. This volume covers data structures, searching techniques, divided-and-conquer sorting and selection, greedy algorithms, dynamic programming, text searching, computational algebra, P and NP and parallel algorithms. For those interested in a better understanding of algorithms.
Full Color Theorems for L(2,1)-Colorings
Authors: Fishburn Peter C., Roberts Fred S.
Venue:  (2000)

The span $\la (G)$ of a graph $G$ is the smallest $k$ for which $G$''s vertices can be $L(2,1)$-colored, i.e., colored with integers in $\{0,1, \ldots, k \}$ so that adjacent vertices'' colors differ by at least two, and colors of vertices at distance two differ. $G$ is full-colorable if some such coloring uses all colors in $\{0,1, \ldots, \la (G) \}$ and no others. We prove that all trees except stars are full-colorable. The connected graph $G$ with the smallest number of vertices exceeding $\la (G)$ that is not full-colorable is $C_6$. We describe an array of other connected graphs that are not full-colorable and go into detail on full-colorability of graphs of maximum degree four or less.
Generating contours on FEM/BEM higher-order surfaces using Java 3D textures
Authors: G. P. Nikishkov
Venue: Advances in Engineering Software (2003)

An efficient technique to visualize primary and secondary results for combined finite element method/boundary element method models as contours is presented. The technique is based on dividing higher-order surfaces into triangles and on using texture interpolation to produce contour plots. Since results of high accuracy with significant gradients can be obtained using sparse meshes of boundary elements and finite elements, special attention is devoted to element face subdivision. Subdivision density is defined on the basis of both face edge curvature and ranges of result fields over element faces. Java 3D API is employed for code development.
Matrix Behaviour, Unitary Reducibility, and Hadamard Products
Authors: D. Viswanath, L. N. Trefethen
Venue:  (1996)

The question investigated here is: if two matrices $A$ and $B$ in $\CNN$ have identical behaviour in a unitarily invariant norm $\norm{\cdot}$, \ie,\ $\norm{p(A)} = \norm{p(B)}$ for every polynomial $p$ with complex coefficients, what properties do $A$ and $B$ have in common? After a preliminary result about eigenvalues, it is shown with a mildly restrictive assumption that if $A$ is unitarily reducible, so is $B$. A theorem is proved about Hadamard products of the form $H\circ\invt{H}$, where $H$ is Hermitian positive definite. Finally, an example is produced where $A$ and $B$ have identical behaviour in the Frobenius norm, but are not related to each other in any simple way.
Emotion and sociable humanoid robots
Authors: Cynthia Breazeal
Venue: International Journal of Human-Computer Studies (2003)

This paper focuses on the role of emotion and expressive behavior in regulating social interaction between humans and expressive anthropomorphic robots, either in communicative or teaching scenarios. We present the scientific basis underlying our humanoid robot's emotion models and expressive behavior, and then show how these scientific viewpoints have been adapted to the current implementation. Our robot is also able to recognize affective intent through tone of voice, the implementation of which is inspired by the scientific findings of the developmental psycholinguistics community. We first evaluate the robot's expressive displays in isolation. Next, we evaluate the robot's overall emotive behavior (i.e. the coordination of the affective recognition system, the emotion and motivation systems, and the expression system) as it socially engages nave human subjects face-to-face.
False-Noise Analysis using Resolution Method
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

High-performance digital circuits are facing increasingly severe noise problems due to cross-coupled noise injection. Traditionally, noise analysis tools use the conservative assumption that all neighbors of a net can switch simultaneously, thereby producing the worst-case noise on a net. However, due to the logic correlations in the circuit, this worst-case noise may not be realizable, resulting in a so-called false noise failure. Since the problem has been shown to be NP-hard in general, exact solutions to this problem are not possible. In this paper, we therefore propose a new heuristic to eliminate false noise failures based on the resolution method. It is shown that multi-variable logic relations can be computed directly from a transistor level description. Based on these generated logic relations, a characteristic ROBDD for a signal net and its neighboring nets is constructed. This ROBDD is then used to determine the set of neighboring nets that result in the maximum realizable noise on the net. The proposed approach was implemented and tested on industrial circuits. The results demonstrate the effectiveness of the approach to eliminate false noise failures.
Anthill: A Framework for the Development of Agent-Based Peer-to-Peer Systems
Authors: Özalp Babaoglu, Hein Meling, Alberto Montresor
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Recent peer-to-peer (P2P) systems are characterized by decentralized control, large scale and extreme dynamism of their operating environment. As such, they can be seen as instances of complex adaptive systems (CAS) typically found in biological and social sciences. In this paper we describe Anthill, a framework to support the design, implementation and evaluation of P2P applications based on ideas such as multi-agent and evolutionary programming borrowed from CAS. An Anthill system consists of a dynamic network of peer nodes; societies of adaptive agents travel through this network, interacting with nodes and cooperating with other agents in order to solve complex problems. Anthill can be used to construct different classes of P2P services that exhibit resilience, adaptation and self-organization properties. We also describe preliminary experiences with Anthill in implementing a file sharing application.
A Framework for Environment Aware Mobile Applications
Authors: Girish Welling, B. R. Badrinath
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

In mobile computing, factors such as add-on hardware components and heterogeneous networks result in an environment of changing resource constraints. An application in such a constrained environment must react to these changes so that available resources are properly utilized. In this paper, we propose a framework to build environment aware applications. The architecture is based on an event delivery mechanism that decouples event detection from delivery, giving the flexibility and extensibility that is necessary in a mobile computing environment. Information associated with the event is delivered as part of the event notification, while delivery latency is reduced by clever thread scheduling. We demonstrate the utility of this framework by structuring an environment aware networking subsystem around a prototype implementation. The performance of this implementation is competitive with current event delivery mechanisms such as the Unix signal.
Multi-Valued Sub-Function Encoding in Functional Decomposition Based on Information Relationships Measures
Authors: Artur Chojnacki, Lech Józwiack
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

Functional decomposition is becoming increasingly popular, because it is more general than all other known logic synthesis approaches and it seems to be the most effective approach for LUT-based FPGAs, (C) PLDs and complex CMOS-gates. The multi-level functional decomposition can be seen as a recursive splitting of a given function, into two sub-functions: the predecessor (bound-set) function and successor function. Initially, the bound set function is a multi-valued (symbolic) function, where a certain value (symbol) is assigned to each particular input-cube compatibility class of the function being decomposed. To be implemented with binary logic, the multi-valued bound-set function must be expressed as a set of binary functions. This transformation is called the multi-valued sub-function encoding. It can be performed by the binary code assignment to each particular input-cube compatibility class. It determines the resulting binary predecessor and successor sub-functions and therefore influences the quality of the resulting circuit to a high degree. In this paper, a new method of the multi-valued sub-function encoding is presented. The method is based on the information relationship measures. Experimental results from the prototype CAD-tool that implements the method demonstrate that it is able to efficiently construct extremely effective circuits for symmetric functions. Results for asymmetric functions are also very good.
Congestion or corruption? A strategy for efficient wireless TCP sessions
Authors: J. A. Cobb, P. Agrawal
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

We present a new acknowledgment strategy to improve the performance of TCP sessions that originate or terminate in noisy wireless networks for mobile computers. This acknowledgment strategy allows the TCP source to distinguish between losses due to congestion and losses due to corruption. With this distinction, the source can reduce its sending rate when congestion occurs, and quickly retransmit when corruption occurs. Without this distinction, TCP throughput is shown to suffer significantly over a path with a large bandwidth-delay product. The strategy is also appropriate for dealing with losses due to hand-offs of a mobile computer from one wireless cell to another. Subject Terms: transport protocols; cellular radio; portable computers; telecommunication congestion control; internetworking; radio networks; delays; wireless TCP sessions; acknowledgment strategy; performance; noisy wireless networks; mobile computers; sending rate; corruption; TCP throughput; bandwidth-delay product; losses; hand-offs; wireless cell; internetworking
Providing Easier Access to Remote Objects in Client-Server Systems
Authors: Jonathan Aldrich, James Dooley, Scott Mandelsohn, Adam Rifkin
Venue:  (1997)

The Java Environment for Distributed Invocation (JEDI) is efficient, dynamic, and easier to use than alternative communication systems for distributed Java objects. Existing state-of-the-art mechanisms for remote method calls on Java objects, such as RMI, require users to perform a complicated series of steps. Furthermore, the compiled static interfaces these systems use limit their functionality. This paper presents the design and implementation of JEDI''s simpler approach utilizing dynamic proxies. We discuss a means of integrating JEDI with a publicly available CORBA ORB, followed by the tests used to ensure the robustness of the JEDI system. Comparing this system''s performance with that of other communication facilities such as UDP, TCP, and RMI demonstrates the efficiency of JEDI. A calendar-scheduling application illustrates the flexibility and usability tradeoffs of employing JEDI in distributed client-server applications.
A case study for the management of a set of spectrally analysed signals based on OODBMS
Authors: M. N. Dendrinos
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

The paper is a case study for the management of a set of synthetic harmonic and real-world sampled signals analysed by various spectral methods at some desired orders. An OODBMS schema was preferred to an alternative RDBMS, exploiting the specific advantages of the object oriented-approach (direct correspondence between real-world and database objects, inheritance, transparent modularity-extendability-encapsulation, etc.) An extended entity relationship (EER) model is presented, which is transformed to an OODBMS schema. This schema is illustrated in detail, comprising class definitions code for the method bodies, persistence through linkage to persistent mamed roots, certain object definition and an example of an SQL-type query, all of them developed in the language O2.
DNA-based algorithms for learning Boolean formulae
Authors: Yasubumi Sakakibara
Venue: Natural Computing: an international journal (2003)

We apply a DNA-based massively parallel exhaustive search to solving the computational learning problems of DNF (disjunctive normal form) Boolean formulae. Learning DNF formulae from examples is one of the most important open problems in computational learning theory and the problem of learning 3-term DNF formulae is known as intractable if RP &ne; NP. We propose new methods to encode any k-term DNF formula to a DNA strand, evaluate the encoded DNF formula for a truth-value assignment by using hybridization and primer extension with DNA polymerase, and find a consistent DNF formula with the given examples. By employing these methods, we show that the class of k-term DNF formulae (for any constant k) and the class of general DNF formulae are efficiently learnable on DNA computer.Second, in order for the DNA-based learning algorithm to be robust for errors in the data, we implement the weighted majority algorithm on DNA computers, called DNA-based majority algorithm via amplification (DNAMA), which take a strategy of ``amplifying'' the consistent (correct) DNA strands. We show a theoretical analysis for the mistake bound of the DNA-based majority algorithm via amplification, and imply that the amplification to ``double the volumes'' of the correct DNA strands in the test tube works well.
Hybrid Model Visualization in Requirements and Design: A Preliminary Investigation
Authors: Jeff Magee, Jeff Kramer, Bashar Nuseibeh, David Bush, Julia Sonander
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

This paper reports on a preliminary investigation into applying work on graphic animation of behavioral models to an air traffic control case studythe National Air Traffic Services (NATS) Short Term Conflict Alert (STCA) system that advises controllers of potential conflicts between aircraft in controlled airspace. Graphic animation permits a model to be visualized in the context of a problem domain. The paper describes how, in order to construct a satisfactory visualization, the finite state behavioral model of the STCA system is extended with Boolean functions over continuous variables to form a hybrid model. The rationale for constructing this hybrid model and its potential use in requirements and design are discussed.
Multivariate Polynomial Minimization and Its Application in Signal Processing
Authors: Liqun Qi, Kok Lay Teo
Venue: Journal of Global Optimization (2003)

We make a conjecture that the number of isolated local minimum points of a 2n-degree or (2n+1)-degree r-variable polynomial is not greater than nr when n &le; 2. We show that this conjecture is the minimal estimate, and is true in several cases. In particular, we show that a cubic polynomial of r variables may have at most one local minimum point though it may have 2r critical points. We then study the global minimization problem of an even-degree multivariate polynomial whose leading order coefficient tensor is positive definite. We call such a multivariate polynomial a normal multivariate polynomial. By giving a one-variable polynomial majored below a normal multivariate polynomial, we show the existence of a global minimum of a normal multivariate polynomial, and give an upper bound of the norm of the global minimum and a lower bound of the global minimization value. We show that the quartic multivariate polynomial arising from broad-band antenna array signal processing, is a normal polynomial, and give a computable upper bound of the norm of the global minimum and a computable lower bound of the global minimization value of this normal quartic multivariate polynomial. We give some sufficient and necessary conditions for an even order tensor to be positive definite. Several challenging questions remain open.
A personalised information retrieval tool
Authors: Innes Martin, Joemon M. Jose
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Industry professionals and everyday users of the Internet have long accepted that due to both the size and growth of this ubiquitous repository, new tools are needed to assist with the finding and extraction of very specific resources relevant to a user's task. Previously, this definition of relevance has been based on the extremely generic matching between resources and query terms, but recently the emphasis is shifting towards a more personalised model based on the relevance of a particular resource for one specific user. We introduce a prototype, \tt Fetch, which adopts this concept within an information-seeking environment specifically designed to provide users with the means to better describe a problem (s)he doesn't understand.
Tailoring and conformance testing of software processes: the ProcePT approach
Authors: D. Welzel, H.-L. Hausen, W. Schmidt
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

Activities to be performed and documents to be produced or modified are the basic elements of a software process. They are grouped according to aspects of development, quality assurance, configuration management or project management. Activities might be refined or generalized. Each resulting process can be tested separately or in context with all of the other processes, whether it is enactable and whether standard conformity is given. A protocol of the tailoring and conformance testing process is recorded in order to fulfill quality management requirements. As a consequence, model consistency as well as standard conformance (e.g. to ISO9000-3) can be shown. The tailoring and consistency and conformance testing of software processes are supported by the tool ProcePT implemented in Prolog. The entire process of tailoring and conformance testing is recorded and therefore conforms to duality management standard requirements.
A Compression Framework for Query Results
Authors: Zhiyuan Chen, Praveen Seshadri
Venue:  (1998)

Decision-support applications in emerging environments require that entire SQL query results be shipped to clients for further analysis and presentation. These clients may use low bandwidth connections (like modems) or have severe memory restrictions (like palmtops). Consequently, there is a need to compress the results of a query for efficient transfer and client-side storage. This paper explores a variety of techniques that address this issue. We model the problem as the choice of an appropriate compression plan and present a framework to model acceptable compression plans. The factors that influence this choice include schema information and statistics on stored tables. Importantly, we demonstrate that the query itself and its evaluation plan can provide semantic information that can be used to compress the result. We demonstrate that these techniques can result in 75% greater compression than standard compression tools like WinZip on queries adapted from the TPC-D benchmark. We identify two topics for future research: the choice of an optimal compression plan, and the integration of query result compression into the regular query evaluation plan.