ppxscal/embedding_network huggingface dataset:
Improving Search Using a Fault-Tolerant Overlay in Unstructured P2P Systems
Authors: William Acosta, Surendar Chandra
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Gnutella overlays have evolved to use a two-tier topology. However, we observed that the new topology had only achieved modest improvements in search success rates. Also, the new two-tier topology had not reduced the message routing overhead and bandwidth consumption. In this work, we used local information at each node to construct an overlay, Makalu, that improved search performance and reduced bandwidth consumption. The overlay maximized the expansion from each node's neighborhood while minimizing the latency to its neighbors. We show that for a 100,000 node system, wild card searches using flooding successfully resolved most queries within four hops for object replications ratios as lows as 0.05% (50 randomly distributed copies) with less than 3% duplicate messages. Using attenuated bloom filters to route messages for exact identifier searches, we show that Makalu resolved most queries with less than ten messages for networks as large as 100,000 nodes. The performance of this search is comparable to that of structured P2P systems. Finally, using data from traffic traces of Gnutella in 2003 and 2006, we demonstrated search success rates that were up to five times more successful and required 75% less bandwidth on a Makalu overlay than on a modern Gnutella overlay.
CPR graphs and regular polytopes
Authors: Daniel Pellicer
Venue: European Journal of Combinatorics (2008)

This paper studies C-group permutation representation graphs, or for short, CPR graphs. C-groups are the groups of abstract regular polytopes. CPR graphs are shown to be a useful tool for studying such polytopes. We establish general properties of CPR graphs. Moreover, we illustrate their use by constructing regular polyhedra with alternating groups A"n as the automorphism groups.
A bipartite graph matching approach to generate optimal test sequences for protocol conformance testing
Authors: Jun Wang, Huaizhong Li, Jitian Xiao, C. Peng Lam
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Conformance testing using test sequences is the main means to ensure that a protocol implementation conforms to its specification. For systems which are specified by nondeterministic finite state machines, a commonly used technique to generate test sequences is the generalized Wp-method with reset which often yields long test sequences if no reliable reset function exists in the system. In this paper, we propose a bipartite graph matching approach to optimize test sequences generated using the generalized Wp-method for protocol conformance testing. Our approach significantly reduces the length of the test sequences required for conformance testing while maintaining the same fault detection capability.
The Parlay network API specification
Authors: M. J. Yates, I. Boyd
Venue: BT Technology Journal (2007)

New business opportunities have emerged for network operators to offer a new generation of interfaces directly to solution providers that expose information and control in various intelligent networks. The paper describes the commercial rationale and operational benefits of these application level interfaces. The Parlay Group has defined application programming interfaces (APIs) to expose network capabilities including wireline, mobile, IP QoS, and messaging to external enterprises. The Parlay Group and the API specification are described, together with an illustration of how the API could be used to create an enterprise workflow solution that integrates capabilities in different networks.
A Comparative Analysis of Operating Systems
Authors: L. Presser
Venue: Computer (1976)

During recent years the subject of operating systems has received much attention in the computer literature. This is not surprising, since operating systems are the backbone of computer systems, and our understanding of operating systems issues is closely tied to our comprehension of computer science in general. However, most of the available literature deals with theory or with specific implementations. Treatments providing a comparative discussion and analysis of commercial operating system designs are essentially nonexistent. And yet, there is much to be learned from such efforts. It is precisely this observation that motivated this special issue of Computer. 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
Utilizing an Executable Specification Language for an Information System
Authors: S. D. Urban
Venue: IEEE Transactions on Software Engineering (1985)

This paper describes an approach to software specification development with interpretation as applied to an information storage and retrieval system. Machine execution of software specifications is possible with both partial and complete specifications. A partial specification is interpreted using abstract execution. The Descartes specification language is utilized to describe a functional aspect of an existing information storage and retrieval system, namely, the MADAM (Multics Approach to Data Access and Management) system at the University of Southwestern Louisiana. Brief descriptions of both the Descartes language and the MADAM system precede the example specification. The paper concludes with a discussion of the expected results that this methodology could have on the pragmatic development and evolution of information systems.
Rising tide with blue plastic bag
Authors: Gaye Swinn
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

We have little trouble accrediting photography with the ability to produce a "true likeness" a credit that is seldom extended to painting or etching or sculpture. We endow the medium with an evidential quality that only gives way in the face of the most blatant amendment. The capturing metaphor that we adopt to describe, at least in part, the function of photography has the tendency to suggest a fleetingness to life, a vulnerability at the heart of human existence. Such a suggestion might be true enough but it is also and simultaneously overwhelmed by the volume of images that are assembled during the course of even the shortest life, such a volume ensuring only the most passing attention to its individual parts. "Each medium, independent of the content it mediates, has its own intrinsic effects which are its unique message." (McLuhan 1964) Photorealism, a sort of bastard child of photography, inherits some but not all of its characteristics and twists them into a new and unique shape of its own. "Evidence" becomes loaded with irony as photorealism challenging us to question our senses or our sense of humour. Photography's intrinsic effect of memorializing is mocked by photorealism as photorealism's own "intrinsic effects" deliver its unique message, for nothing but the imagination of the artist is "captured" by image making in virtual 3D even as the artist feigns "evidence" by virtue of the blood relationship with photography. With this medium the world appears as it never was but as it might have been or yet might be, the "unique message" of photorealism aptly communicating the uncertainty of post-human times.
A Structure-independent Approach for Fault Detection Hardware Implementations of the Advanced Encryption Standard
Authors: Mehran Mozaffari-Kermani, Arash Reyhani-Masoleh
Venue: Proceedings of the Workshop on Fault Diagnosis and Tolerance in Cryptography (2007)

The Advanced Encryption Standard, which is used extensively for secure communications, has been accepted recently as a symmetric cryptography standard. However, occurrence of the internal faults by intrusion of the attackers may cause confidential information leak to reveal the secret key. For this reason, several schemes for fault detection of the transformations and rounds in the encryption and decryption of the Advanced Encryption Standard are proposed. In this paper, we present a structure-independent fault detection scheme for the Advanced Encryption Standard. The proposed scheme is independent of the way Sbox (inverse S-box) is constructed and can be used for both encryption and decryption. It can be applied to both the S-boxes (and inverse S-boxes) using look-up tables as well as those utilizing logic gate implementations based on composite fields. We have obtained the formulations for the fault detection of the SubBytes (inverse SubBytes) using the relation between the input and output of the S-box (inverse S-box). Then, we have proposed and simulated a signature-based structure-independent fault detection scheme. Moreover, the FPGA implementations of the original and the proposed schemes as well as their overhead are presented.
Continuous dependence properties on solutions of backward stochastic differential equation
Authors: Fan Sheng-Jun
Venue: Journal of Applied Mathematics and Computing (2007)

The existence theorem and continuous dependence property in "L2" sense for solutions of backward stochastic differential equation (shortly BSDE) with Lipschitz coefficients were respectively established by Pardoux-Peng and Peng in [1,2], Mao and Cao generalized the Pardoux-Peng's existence and uniqueness theorem to BSDE with non-Lipschitz coefficients in [3,4]. The present paper generalizes the Peng's continuous dependence property in "L2" sense to BSDE with Mao and Cao's conditions. Furthermore, this paper investigates the continuous dependence property in "almost surely" sense for BSDE with Mao and Cao's conditions, based on the comparison with the classical mathematical expectation.
Delayed password disclosure
Authors: Markus Jakobsson, Steven Myers
Venue: Proceedings of the 2007 ACM workshop on Digital identity management (2007)

We present a new authentication protocol called Delayed Password Disclosure. Based on the traditional user name and password paradigm, the protocol's goal is aimed at reducing the effectiveness of phishing/spoofing attacks that are becoming increasingly problematic for Internet users. This is done by providing the user with dynamic feedback while password entry occurs. While this is a process that would normally be frowned upon by the cryptographic community, we argue that it may result in more effective security than that offered by currently proposed "cryptographically acceptable" alternatives. While the protocol cannot prevent partial disclosure of one's password to the phisher, it does provide a user with the tools necessary to recognizean on going phishing attack, and prevent the disclosure of his/her entire password, providing graceful security degradation.
Tree Realizations of Iterative Circuits
Authors: S. H. Unger
Venue: IEEE Transactions on Computers (1977)

It is shown how any combinational function that can be described by a flow table or equivalently is realizable in iterative form can be realized in tree form. The propagation delay is then proportional to the logarithm of n, the number of inputs, while the logic complexity is a linear function of n. These results are related to various implementations of high-speed binary adders and a proposed new high-speed adder circuit.
New Applications
Authors: D. A. Michalopoulos
Venue: Computer (1977)

How a military reconnaissance system concept has been adapted to produce engravings for printing textiles is perhaps one of the more unusual cases of technology transfer. Yet the Orchard Corporation of America, using the adapted systems, is having an impact on the textile industry. The Response System 200, built by an Israeli company called Sci-Tex, is enabling Orchard to slash by more than 50 percent the time it takes to produce printed fabric from artists' sketches.
Selective strictness and parametricity in structural operational semantics, inequationally
Authors: Janis Voigtländer, Patricia Johann
Venue: Theoretical Computer Science (2007)

Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., virtually for free. The formal background of such 'free theorems' is well developed for extensions of the Girard-Reynolds polymorphic lambda calculus by algebraic datatypes and general recursion, provided the resulting calculus is endowed with either a purely strict or a purely nonstrict semantics. But modern functional languages like Clean and Haskell, while using nonstrict evaluation by default, also provide means to enforce strict evaluation of subcomputations at will. The resulting selective strictness gives the advanced programmer explicit control over evaluation order, but is not without semantic consequences: it breaks standard parametricity results. This paper develops an operational semantics for a core calculus supporting all the language features emphasized above. Its main achievement is the characterization of observational approximation with respect to this operational semantics via a carefully constructed logical relation. This establishes the formal basis for new parametricity results, as illustrated by several example applications, including the first complete correctness proof for short cut fusion in the presence of selective strictness. The focus on observational approximation, rather than equivalence, allows a finer-grained analysis of computational behavior in the presence of selective strictness than would be possible with observational equivalence alone.
Ecologically Inspired Distributed Search in Unstructured Peer-to-Peer Networks
Authors: Li Sa, Yongsheng Ding
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Nowadays, the most popular peer-to-peer applications operate on unstructured networks. This paper describes our research effort to design and implement an agent based search algorithm that allows for searching in unstructured decentralized network. In this algorithm, we models autonomous adaptive agents after several ecological concepts and mechanisms. We focus on the problem of actively changing the topology of the P2P network by utilizing Schelling's segregation model to improve the efficiency of search.
Asynchronous Arbiters
Authors: W. W. Plummer
Venue: IEEE Transactions on Computers (1972)

When two or more processors attempt to simultaneously use a functional unit (memory, multiplier, etc.), an arbiter module must be employed to insure that processor requests are honored in sequence. The design of asynchronous arbiters is complicated because multiple input changes are allowed, and because inputs may change even if the circuit is not in a stable state. A practical arbiter and its implementation are presented. Implementation of various priority rules (linear, ring, mixed) is discussed, and building large arbiters with trees of two-user arbiters is considered.
Predicting consumer intentions to shop online: An empirical test of competing theories
Authors: Hsiu-Fen Lin
Venue: Electronic Commerce Research and Applications (2007)

The proliferation of commercial Web sites providing consumers with a new medium to purchase products and services has increased the importance of understanding the determinants of consumer intentions to shop online. This study compared the technology acceptance model and two variations of the theory of planned behavior to examine which model best helps to predict consumer intentions to shop online. Data were gathered from 297 Taiwanese customers of online bookstores, and structural equation modeling was used to compare the three models in terms of overall model fit, explanatory power and path significance. Decomposing the belief structures in the theory of planned behavior moderately increased explanatory power for behavioral intention. The results also indicate that the decomposed theory of planned behavior provides an improved method of predicting consumer intentions to shop online. Finally, the implications of this study are discussed.
Closing the Loop for Dynamic IP QoS Provisioning: A Case Study
Authors: Swati Sinha Deb, Alistair Munro
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper investigates an approach to enabling dynamic reactive quality-of-service (QoS) management for IP networks. We use the information collected from monitoring traffic flows combined with middleware for setting network element configurations to differentiate the service given to traffic. We report on experiences of implementing the QoS management system using XORP (eXtensible Open Router Platform) and Click, the open source software router. The performance evaluation in terms of packet loss, dynamic behaviour of QoS configuration and time to re-configure the XORP+Click router is presented.
Changing Output Quality for Thermal Management
Authors: Phillip H. Jones, James Moscola, Young H. Cho, John W. Lockwood
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

A growing number of embedded computing systems are used outside of environmentally controlled locations. In locations such as remote parts of deserts, deep ocean floors, and outer space, it is not only difficult to predict environmental effects on a system, they also allow very limited accessibility once a system is deployed. Therefore, it is often necessary for system parameters to be over provisioned to guarantee correct functionality under worst case environmental conditions. This often leads to an end system that is suboptimal for typical conditions.
A hybrid meshed multipath forwarding scheme in wireless ad hoc networks
Authors: Swades De, Chunming Qiao
Venue: Computer Communications (2007)

Flexibility and robustness are the two key features of multipath routing in multihop wireless networks. While robustness to node failures and link errors is important to achieve high end-to-end throughput, it is also important to judiciously use the routing flexibility to achieve a better traffic load distribution among the network nodes, so that the network lifetime can be extended. In this paper, we study point-to-point multipath forwarding strategies in relatively static but highly error-prone wireless sensor networks. We investigate a multipath forwarding scheme, called selective random forwarding (SRF), and compare its end-to-end throughput and traffic load distribution with respect to selective preferential forwarding (SPF) (or forwarding along primary/secondary routes). We first show that in node disjoint multipath routes SRF has a better overall performance. When considering meshed multipath routes [14], SRF offers a much better load balancing performance but a poorer throughput. Aiming at achieving a good performance trade-off in meshed multipath routes, we introduce a new hybrid packet forwarding scheme that takes the advantages of higher end-to-end throughput in SPF and more uniform load distribution in SRF. Our network performance studies show that while the hybrid approach always offers the throughput performance nearly as good as SPF, its improved load distribution performance becomes more significant with more inhomogeneous network activity. Our approach is guided by analytic intuition and verified by simulations.
Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities
Authors: Ming-Tsung Chen, B. M. T. Lin, Shian-Shyong Tseng
Venue: Journal of Network and Computer Applications (2008)

Because optical wavelength division multiplexing (WDM) networks are expected to be realized for building up backbone in the near future, multicasting in WDM networks needs to be addressed for various network applications. This paper studies an extended multicast routing and wavelength assignment (RWA) problem called multicast routing and wavelength assignment with delay constraint (MRWA-DC) that incorporates delay constraints in WDM networks having heterogeneous light splitting capabilities. The objective is to find a light-forest whose multicast cost, defined as a weighted combination of communication cost and wavelength consumption, is minimum. An integer linear programming (ILP) model is proposed to formulate and solve the problem. Experimental results show that using CPLEX to solve the ILP formulation can optimally deal with small-scale networks. Therefore, we develop a heuristic, near-k-shortest-path heuristic (NKSPH), to solve the problem in large-scale networks. Numerical results indicate that the proposed heuristic algorithm can produce approximate solutions of good quality in an acceptable time.
Query Answering in Relational Inductive Databases
Authors: Kittisak Kerdprasop, Nittaya Kerdprasop, Apichai Ritthongchailert
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Inductive databases can be viewed as a natural extension of traditional databases to contain not only persistent data but also the generalization of stored data, which are called patterns. The idea of inductive databases has been proposed originally as a support system for the knowledge discovery or data mining process. Many SQL-like languages have been designed and implemented to include mining operators in the SQL primitives. We percept the concept of inductive databases in a different angle. In stead of designing yet another inductive database system, we are looking for the deployment of an existing inductive query language and environment to support the database tasks. We focus on the task of query answering which has a high potential of being a beneficiary of the stored patterns in inductive databases. Our experimental results of query rewriting technique using induced patterns as a semantic knowledge confirm this advantage.
Portable Microcomputer Cross-Assembler in BASIC
Authors: S. W. Conley
Venue: Computer (1975)

With the tremendous number of microprocessors on the market today it is becoming increasingly hard to find cross assemblers that run on the particular in-house computer system or timesharing service available. Since most minicomputer systems and almost all timesharing systems have BASIC interpreters or compilers available, this seems to be the most reasonable language choice for writing cross assemblers. It also has a very good trace and debug facility, which is especially useful if you are writing medium-long programs, such as cross-assemblers. 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
Fault Handling in FPGAs and Microcontrollers in Safety-Critical Embedded Applications: A Comparative Survey
Authors: Falk Salewski, Adam Taylor
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Safety-critical systems nowadays include more and more embedded computer systems, based on different hardware platforms. These hardware platforms, reaching from microcontrollers to programmable logic devices, lead to fundamental differences in design. Major differences result from different hardware architectures and their robustness and reliability as well as from differences in the corresponding software design. This paper gives an overview on how these hardware platforms differ with respect to fault handling possibilities as fault avoidance and fault tolerance and the resulting influence on the safety of the overall system.