ppxscal/embedding_network huggingface dataset:
The theory of uncertainty orientation: a mathematical reformulation
Authors: Richard M. Sorrentino, Michael Smithson, Gordon Hodson, Christopher J. R. Roney, A. Marie Walker
Venue: Journal of Mathematical Psychology (2003)

In this paper, we present a mathematical formulation derived from the theory of uncertainty orientation (In R.M. Sorrehtino, & E.T. Higgins (Eds.), the handbook of motivation and cognition: Foundations of social behaviour, Vol. 1 (pp. 379-403). New York: The Guilford press; The uncertain mind: Individual differences in facing the unknown. London: Erlbaum (UK), Taylor & Francis). This formulation integrates affective and informational influences on thought and action. It is a model of self-regulation where the need to maintain clarity and the need to attain clarity are considered as two independent informational tendencies. These informational tendencies are influenced by the degree of self-relevance and the amount of perceived situational uncertainty. In addition, they are multiplicative with affective approach and avoidance tendencies, leading to accentuation or inhibition of behaviours expressed in action. It is further demonstrated that when the nondominant action tendency is instigated, secondary source of motivation are expressed. This model not only accounts for past data, but also permits exploration using computer simulation. In addition, many new and testable hypotheses, including those related to affect and dynamical decision theory, are generated.
An Asymptotically Optimal Multi-Layered Decentralized Consensus Protocol with an Initiator
Authors: Zheng-Ru Lin, Ming-Syan Chen
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

A decentralized consensus protocol refers to a process for all nodes in a distributed system to collect the information/status every other node and reach a consensus among them. Two classes of decentralized consensus protocols have been studied before: the one without an initiator and the one with an initiator. While the one without an initiator has been well studied in the literature, it is noted that the prior protocols with an initiator mainly relied upon the one without an initiator and thus did not fully exploit the intrinsic properties of having an initiator. By exploiting the concept of multi-layered execution, we develop in this paper an efficient multi-layered decentralized consensus protocol for a distributed system with an initiator. By adapting itself to the number of nodes in the system, the proposed protocol can determine a proper layer for execution and reach the consensus in the minimal numbers of message steps while incurring a much smaller number of messages than required by prior works. It is shown that the decentralized consensus protocols developed in this paper for the case of having an initiator significantly outperforms prior schemes. Specifically, it is proved that (1) the ratio of the average number of messages incurred by the proposed algorithm to that by the prior method approaches zero as the number of nodes increases, and (2) the proposed algorithm is asymptotically optimal in the sense that the message number required by the proposed algorithm and that of the optimal one are asymptotically of the same complexity with respect to the number of nodes in the system, showing the very important advantage of the proposed algorithm.
A Hyperbolic Multilayer Perceptron
Authors: Sven Buchholz, Gerald Sommer
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

In this paper we present a novel MLP -type neural network based on hyperbolic numbers-the Hyperbolic Multilayer Perceptron (HMLP). The neurons of the HMLP compute 2D-hyperbolic orthogonal transformations as weight propagation functions. The HMLP can therefore be seen as the hyperbolic counterpart of the known Complex MLP. The HMLP is proven a universal approximator. Furthermore, a suitable Backpropagation algorithm for it is derived. It is shown by experiments, that the HMLP can learn tasks with underlying hyperbolic properties much more accurately and efficiently than a Complex MLP and an ordinary MLP.
Evolving social rationality for MAS using "tags"
Authors: David Hales, Bruce Edmonds
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Endowing agents with "social rationality" [10, 12, 11] can aid overall efficiency in tasks where cooperation is beneficial to system level performance. However it is difficult to maintain this beneficial effect in open and unpredictable systems. Such systems seem to require a "bespoke" (that is, a new) design for cooperation in each domain. Recent work in artificial life and biological sciences has identified novel "tag" mechanisms for the spontaneous self-organization of group level adaptations in populations of autonomous agents [2, 3, 13, 16]. We summarize these findings and identify a key application (in MAS) to which these mechanisms may be fruitfully applied. An intriguing aspect of these mechanisms is that (in certain circumstances) there is a negative scaling cost - that is, the more agents in a system the better and more quickly organized they become. Also, since the process is driven by individual (bounded) optimization, agents retain a high degree of autonomy but still evolve behaviors that are socially rational even in open systems. Initial results indicate that the harnessing of such a process in MAS may be a viable alternative to the engineering of specific cooperation mechanisms and group structures.
Lyapunov Exponents from Random Fibonacci Sequences to the Lorenz Equations
Authors: Divakar Viswanath
Venue:  (1998)

Ph.D. thesis. Please see inside document for an abstract.
Soft evaluation: a systemic approach for post implementation review
Authors: Ala Abu-Samaha
Venue: Critical reflections on information systems: a systemic approach (2003)

In this chapter, the author describes an alternative approach to evaluating Information Technology (IT) projects, which involves developing a holistic view of IT interventions. The main methodological problem in evaluating any intervention is to choose the right indicators for the measurement of success or lack of it. These indicators will obviously be linked to the aims but will also be relevant to the objectives chosen to achieve these aims. Acknowledging the difficulty of choosing appropriate measures of performance, the author proposes the use of Soft Evaluation. The approach used brings together formal work in evaluation with a qualitative process of investigation based on Soft Systems Methodology in order to allow us to make judgements about the outcomes of an implementation in a systemic manner and from a number of different viewpoints or perspectives.
A fast bypass algorithm for high-speed networks
Authors: I. Cidon, R. Rom, Y. Shavitt
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Suggests an algorithm that increases the reservation success probability for bursty traffic in high speed networks by adding flexibility to the construction of the routes. The algorithm is simple enough to be implemented by cheap hardware. It causes no additional delay to packets that use the original route, and a very small delay to the packets that are rerouted. In addition, the presented algorithm has a minimal communication overhead due to the local nature of its work. Two high-speed network models are considered: source routing and ATM.
The Design and Implementation of a Cooperative Program Development Environment
Authors: James E. Archer,  Jr.
Venue:  (1981)

COPE is a program development environment that provides a highly tolerant user interface specifically designed for novice users. The design and implementation of COPE has been the work of a group which includes the author, Richard Conway, Andrew Shore, and Leonard Silver. In presenting the results of the joint effort, attention has been given to balance the presentation of the author''s contribution and the overall context of the system. The author has been involved in all of the development and design phases of the system. The initial system design and architecture were developed jointly with Richard Conway and the sections presenting design, architecture, and user interface represent joint work. Later sections on particular issues (parsing, file system, etc.) are individual contributions.
Example-Based Frame Mapping for Heterogeneous Information Agents
Authors: Fumiaki Itoh, Takaya Ueda, Yuji Ikeda
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

Communication among heterogeneous information agents is often difficult because they often use different structures to express the same information. A common ontology could resolve this problem. However, it would be very difficult to build such an ontology for dynamic information spaces such as the WWW. Thus, automatic reconciliation of differences is necessary to permit multiagent communication within an open environment where new expressions tend to emerge in communication. We propose a technique that enables automatic mapping of equivalent slots in different frames.The proposed technique, Example-Based Frame Mapping (EBFM), generates hypotheses of equivalent slots, then selects a plausible hypothesis by comparing similarities within the examples inferred to express the same object. EBFM solves the essential problems that arise in frame mapping (e.g., synonyms and homonyms) by using only the available information without requiring any domain-specific heuristic knowledge, and can achieve more than 99% accuracy.
A scalable monitoring approach for service level agreements validation
Authors: Mun Choon Chan, Yow-Jian Lin, Xin Wang
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

In order to detect violations of end-to-end service level agreements (SLA) and to isolate trouble links and nodes based on a unified framework, managers of a service provider network need to gather quality of service (QoS) measurements from multiple nodes in the network. For a network carrying over thousands of flows with end-to-end SLAs, the information exchanged between network nodes and a central network management system (NMS) could be substantial. Moreover in situations where only, a small number of flows violate their respective SLAs, simple polling mechanisms can lead to huge unnecessary overhead in identifying these ill-behaved flows. We propose an algorithm called (ARM) (Aggregation and Refinement based Monitoring) to reduce the amount of information exchange. (ARM) uses a histogram-based dynamic QoS data aggregation/refinement technique at each network node and a reasoning engine at the NMS to minimized the amount of data exchange between network nodes and NMS. (ARM) not only reduces unnecessary reporting through selective refinement, it also performs well across a wide range of traffic loads. Our simulation results show that (ARM) is at least an order of magnitude more efficient than a simple polling scheme. It also outperforms two centralized highly optimized schemes that cannot be implemented in practice.
Efficient Computation of the Minimum Hausdorff Distance for Visual Recognition
Authors: William J. Rucklidge
Venue:  (1994)

We have developed a method, using the minimum Hausdorff distance, for visually locating an object in an image. This method is very reliable, and fast enough for real-world applications. A visual recognition system takes an image and a model of an object which may occur in that image; these images and models are composed of features (points, line segments, etc.). The system locates instances of the model in the image by determining transformations of the model which bring a large number of model features close to image features. One of the unique strengths of the Hausdorff distance is the reverse distance which reduces the frequency of erroneous matching between a model and a cluttered portion of the image. The Hausdorff distance is a measure defined between two point sets representing a model and an image. Its properties make it attractive for model-based recognition; one of these properties is that the Hausdorff distance is a metric. The minimum Hausdorff distance is used to find a transformation of the model which brings it into closest correspondence with the image. This can be done by searching over a space of allowable transformations. In some cases, the minimum Hausdorff distance is also a metric. The Hausdorff distance can be modified so that it is reliable even when the image contains multiple objects, noise, spurious features, and occlusions. We construct lower bounds which show that finding the exact transformation that minimises the Hausdorff distance may be quite expensive. We develop a rasterised approach to the search and a number of techniques which allow this search to be performed efficiently. The principal search technique used is transformation space subdivision. The space of transformations is searched in a tree-like fashion: a large region is examined as a unit, and if the results of this examination are good, it is subdivided and each of the subregions examined in turn; if the results are not good, then the region is discarded. We discuss some implementations of this approach, together with their applications to practical problems such as motion tracking and mobile robot navigation.
Scheduling Multiple Multicast for Heterogeneous Network of Workstations with Non-Blocking Message-Passing
Authors: Shih-Hsien Yeh, Jan-Jan Wu, Pangfeng Liu
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

This paper proposes efficient algorithms for implementing multicast in heterogeneous workstation/PC clusters. Multicast is an important operation in many scientific and industrial applications. Its efficient implementation on distributed-memory machines plays a critical role in the performance of distributed-memory parallel computing applications. Our work distinguishes itself between others in two aspects: (1) In contrast to the blocking communication model used by existing works, we model communication on heterogeneous clusters more accurately by a non-blocking model, and design multicast algorithms that can fully exploit the advantage of non-blocking communication, (2) While existing works only solve single-node multicast problem, we propose efficient algorithms for implementing general multi-node multicast (in which single-node multicast is a special case). Our simulation results demonstrate performance improvement of multicast by 20% to 160% compared to existing algorithms.
Introducing Treatments Into Test Procedures
Authors: W D Loveland
Venue:  (1986)

The problem of finding low-cost testing procedures to isolate a faulty, or diseased, object has been extensively studied. We enlarge the problem by allowing treatment of the faulty object before the identify of the object is completely known, a common occurrence in real life. The problem is formalized, a general well-known solution method is mentioned, and a limited subcase is explored, including presentation of exact (optimal) and approximate solution methods. We illustrate the complexity of the extended problem and why analogous results to the simpler binary testing problem is unlikely.
A Note on the Standard Strategy for Developing Loop Invariants and Loops
Authors: David Gries
Venue:  (1982)

The by-now-standard strategy for developing a loop invariant and loop was developed in [1] and explained [2]. Nevertheless, its use still poses problems for some. The purpose of this note is to provide further explanation. Two problems are solved that, without this further explanation, seem difficult.
Insight into Theorem Proving via Eye Movements
Authors: Eric Aaron, Michael Spivey
Venue:  (1999)

We are implementing an automated theorem proving system that will in part attempt to simulate human per-formance on calculational logic. To support this project, we recorded and analyzed people''s eye movements while they constructed calculational proofs. Our find-ings confirm some expected behaviors (based on strate-gies and principles taught to students) that previously may have seemed untestable, such as the influence of the form of the current proof step and of syntax in gen-eral on the moment-by-moment computations of the problem solver. The experiment also uncovered other interesting patterns, such as the seemingly inefficient but widely occurring tendency to attend to particular premises despite their not being used in the proof under consideration. Overall, we gained insights into real-time problem solving that directly apply to our automated system and could not have been gained merely by studying written proofs. Our findings also demonstrate that analyses of eye movements can improve our under-standing of the psychology of theorem proving.
Improving the Capacity of SDM
Authors: Gunnar Sjoedin
Venue:  (2001)

A more efficient way of reading the SDM memory is presented. This is accomplished by using implicit information, hitherto not utilized, to find the information-carrying units and thus removing unnecessary noise when reading the memory. 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
Intel Internet Exchange Architecture and Applications: A Practical Guide to Intel's Network Processors
Authors: Bill Carlson
Venue:  (2003)

:This invaluable developer resource provides an overview of Intel Internet Exchange Architecture (IXA), educates developers about Intel network processors, and provides an in-depth technical view of the standards required by hardware and software developers of next-generation OEM networking equipment. The text is well suited not only for hardware and software engineers but also for users outside the industry, such as management, sales, marketing, and support professionals. The architecture of a typical network core or edge is described to provide a context for the network processor architecture. This guide also explores the architecture of the Intel IXP2400 and Intel IXP2800 network processors and provides a detailed example of a DSLAM using the multiprotocol software framework.Author Biography: Bill Carlson is an Intel network processor specialist and a field applications engineer. He provides active applications support of the IXP1200 network processor from its inception to current third-generation versions. He lives in Murrieta, California.
A Parallel Architecture for High Speed Fractal Image Coding
Authors: Shinhaeng Lee, Hirotomo Aso
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

The main problem of fractal image compression is the long search time of the domain pool. For this reason, the dedicated ASIC architecture for fractal image coding is needed. In this paper, we propose an efficient parallel architecture for fractal image coding which is based on fixed-size full-search algorithm. One of the main features of this architecture is that it uses only local communication such that each processor has a range and a domain block which is shifted to the next processor. Another main feature is that it has very regular interconnections and data flow. Domain blocks are formed from the range blocks in processors and the encoding procedure is performed by the regular data flow of domain blocks into the other processors. Each processor performs the fast isometric transformations which are calculated by one full rotation around the center.
Pushdown timed automata: a binary reachability characterization and safety verification
Authors: Zhe Dang
Venue: Theoretical Computer Science (2003)

We consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augmented with a pushdown stack. A configuration of a PTA includes a state, dense clock values and a stack word. By using the pattern technique, we give a decidable characterization of the binary reachability (i.e., the set of all pairs of configurations such that one can reach the other) of a PTA. Since a timed automaton can be treated as a PTA without the pushdown stack, we can show that the binary reachability of a timed automaton is definable in the additive theory of reals and integers. The results can be used to verify a class of properties containing linear relations over both dense variables and unbounded discrete variables. The properties previously could not be verified using the classic region technique nor expressed by timed temporal logics for timed automata and CTL* for pushdown systems. The results are also extended to other generalizations of timed automata.
A Study on the Ternary Parallel Circuit Design with DCG Properties Based on the Matrix Equation
Authors: Gi-Noung Byun, Chol-U Lee, Seung-Yong Park, Heung-Soo Kim
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

An efficient algorithm is proposed for ternary parallel circuit design satisfied with the given DCG relation. The proposed algorithm in this paper uses the matrix equation that can be induced from the relation of each node. In contrast to the conventional method, it has merit for circuit design process. From given DCG specification, following the proposed algorithm in this paper, we can get the matrix equation easily. Then take the essential terms that satisfied with the DCG properties from the matrix equation. Using these terms, we can design the ternary parallel circuit. In addition, we can apply this algorithm to DCG with any natural number's length. This paper shows some design examples so that proves proposed algorithm's generalization, compatibility and verification in ternary parallel circuit design.
Visual Debugging of Assembly Language Programs
Authors: Mark Newsome, Cherri M. Pancake, Christopher Ward
Venue:  (1992)

Students learning computer organization and assembly language programming often have difficulty understanding the relationship between hardware functions and software instructions. This paper describes how a software tool can help students understand the organization and use the Motorola 68000 family of microprocessors. XSIM68K employs a graphical interface to enhance a traditional, "black box" computer simulator so that students can observe first-hand the effects of program execution on registers, memory elements, and I/O devices. It takes advantage of graphics technology to streamline user interaction, providing quick access to tool functions, eliminating typing and syntax errors, and making it unneccesary for students to memorize a separate tool control language. XSIM68K''s grahpical displays are updated continuously during program execution. This makes it easy to observe and access computer components simultaneously; it also reinforces visually the concept of system interaction. Multiple data representations and automatic format conversion facilities allow the student to choose the most appropriate format for data entry and display, which reduces confusion and eliminates conversion mistakes.