ppxscal/embedding_network huggingface dataset:
Error Tolerance of DNA Self-Healing Assemblies by Puncturing
Authors: Masoud Hashempour, Zahra Mashreghian Arani, Fabrizio Lombardi
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Self-assembly is affected by high error rates due to incorrect tiles in nano-technology manufacturing. Tile sets that can heal (fully or partially) an erroneous assembly have been proposed. Self-healing requires growth to be restarted such that erroneous tiles can be removed and the correct tiles to bind to the aggregate. Punctures can be used for this purpose. The goal of this paper is to characterize an intentionally induced puncture (and its relevant properties) on an erroneous tile site in the assembly. This allows to propagate any newly generated error away from the source of growth (i.e. the seed tile), such that self-assembly can continue along specific directions. Different types of puncture are considered with respect to growth direction, error and aggregate types. Puncture resilience is analyzed using a new characterization metric; different tile sets are investigated in detail. Analytical and simulation results are provided.
A comparison of methods for the automatic identification of locations in wikipedia
Authors: Davide Buscaldi, Paolo Rosso
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

In this paper we compare two methods for the automatic identification of geographical articles in encyclopedic resources such as Wikipedia. The methods are a WordNet-based method that uses a set of keywords related to geographical places, and a multinomial Naïve Bayes classificator, trained over a randomly selected subset of the English Wikipedia. This task may be included into the broader task of Named Entity classification, a well-known problem in the field of Natural Language Processing. The experiments were carried out considering both the full text of the articles and only the definition of the entity being described in the article. The obtained results show that the information contained in the page templates and the category labels is more useful than the text of the articles.
Fully Adaptive Fault-Tolerant Routing Algorithm for Network-on-Chip Architectures
Authors: Timo Schonwald, Jochen Zimmermann, Oliver Bringmann, Wolfgang Rosenstiel
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In this paper, we present a novel fully adaptive and fault-tolerant routing algorithm for Network-on-Chips (NoCs) called Force-Directed Wormhole Routing (FDWR). The proposed routing algorithm is implemented in the switches of a TLM (Transaction Level Model) packet switching NoC using SystemC. Based on these switches, mesh, torus, and hypercube topologies for NoCs can be automatically generated. We show how the proposed algorithm distributes the traffic uniformly across the entire network to avoid overloaded links. Simulation results depict that the proposed routing algorithm is able to route packets even in the case of faulty links or switches in the NoC. Furthermore, it is shown that in the case of faulty switches the area around that switches is not overloaded and that the traffic is uniformly distributed across the entire network.
LSI Microprocessors and Microcomputers: A Bibliography Continued
Authors: A. R. Ward
Venue: Computer (1976)

Worldwide interest in LSI microprocessors and microcomputers has sparked a continuing growth of publications on all aspects of the subject. The bibliography below attempts to list most of the books, journal articles, conference papers, and technical reports in English and foreign languages, gathered since the publication of the compiler's bibliography on the same topic in Computer, July 1974. References from that bibliography are not repeated here. The cutoff date for inclusion in the list was October 15, 1975. Citations are grouped by year of publication, then listed alphabetically by author. Generally, one- or two-page "product features" are omitted, as are patents and specific device or system manuals.
Collaborative Computational Chemical Grid Based on CGSP
Authors: Ying Zhao, Xuelin Shi
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Chemical engineering involves the design and manufacturing of new chemical compounds and materials, the analysis of chemical reaction, the simulation of computational fluid dynamics (CFD), and so on. It is complex, time consuming, and expensive. To lower costs and improve efficiency, grid computing is increasingly employed in the chemical engineering. In this paper, we propose a collaborative grid framework for chemical engineering, Chemical Grid based on China Grid Support Platform (CGSP). It provides a grid computing environment for various chemical applications. This paper also describes the architecture of Chemical Grid platform and its security service based on Virtual Organization (VO). At last the applications of Chemical Grid are presented.
Application of Artificial Intelligence Technology in Asphalt Concrete Mixer Control System
Authors: Ming-shan Liu, Yuan Zhou
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Analysis the working process of the asphalt concrete mixer control system, this article introduces a new type of intelligent control system based on the fuzzy expert control technology. To minimize the control error caused by nonlinearity and long time delay in the working process, the advance technology of fuzzy control, expert system and digital signal processing are adopted in the control system. A linear filter required by the prediction was designed to perform the prediction of the temperature change history in the working process of the mixer. Based on it, the working process of asphalt concrete mixer could be controlled automatically and intelligently in real time. Test results showed that the accuracy of the control system has been improved greatly, and the asphalt concrete mixer works stably and reliability. Combining with the traditional control method, the centralized and intelligent control system is more effectively.
A two-level approach to choose the cost parameter in support vector machines
Authors: Yulin Dong, Zhonghang Xia, Zunquan Xia
Venue: Expert Systems with Applications: An International Journal (2008)

A new SVM model used to calculate the optimal value of cost parameter C for particular problems of linearity non-separability of data is presented in this paper. The new SVM model is formulated in the form of one of MPEC problems with an integer objective function. A lower bound, positive number, C"0 is required to provide for avoiding choosing a candidate set of C. Numerical experiments show that this model for choice of C is suitable for solving SVM problems.
A syntactic closures macro facility
Authors: Chris Hanson
Venue: ACM SIGPLAN Lisp Pointers (1991)

This document describes syntactic closures, a low-level macro facility for the Scheme programming language. The facility is an alternative to the low-level macro facility described in the Revised 4 Report on Scheme. This document is an addendum to that report.
An augmented CRTRL for complex-valued recurrent neural networks
Authors: Su Lee Goh, Danilo P. Mandic
Venue: Neural Networks (2007)

Real world processes with an ''intensity'' and ''direction'' component can be made complex by convenience of representation (vector fields, radar, sonar), and their processing directly in the field of complex numbers C is not only natural but is also becoming commonplace in modern applications. Yet, adaptive signal processing and machine learning algorithms suitable for the processing of such signals directly in C are only emerging. To this cause we introduce a second order statistical learning framework for a general class of nonlinear adaptive filters with feedback realized as recurrent neural networks (RNNs). For rigour, both the so-called proper- and improper-second order statistics of complex processes is taken into account, and the proposed augmented complex real-time recurrent learning (ACRTRL) algorithm for RNNs has been shown to be suitable for processing a wide range of both benchmark and real-world complex processes.
The Future of Integrated CAD/CAM Systems: The Boeing Perspective
Authors: W. Beeby
Venue: IEEE Computer Graphics and Applications (1982)

Starting with stand-alone CAD units introduced during the 747 Project, Boeing is developing a comprehensive system servicing all design and manufacturing functions. 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
Positive Solutions of m-point Conjugate Boundary Value Problems
Authors: Shuli Wang, Jianming Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In this paper, the conjugate boundary value problem -u"(t) = f(t, u(t)) for t \in¸ [0, 1] \ {\eta_1, \eta_2, \cdot \cdot \cdot , \eta_m-2} subject to u'(0) = u(1) = 0 and u'_+(\eta_i) - u'_(\eta_i) = \alpha_{i}u'(1) (i = 1, 2, \cdot \cdot \cdot ,m - 2), of the m-point boundary value problem -v"(t) = f(t, v(t)) subject to v(0) = 0 and v(1) = \Sigma _{i = 1}^{m - 2} \alpha _i v\left( {\eta _i } \right) is put forward and considered, where \eta_i \in (0, 1) with \eta_1 \le \eta_2 \le \cdot \cdot \cdot \le \eta_m-2, \alpha_i \in [0, 1) with 0 \le \Sigma _{i = 1}^{m - 2} \alpha_i \le 1, f \in C([0, 1] x [0,\infty), [0,\infty)). The problem is translated into Hammertein's integral equation with the use of Green's function. Then the existence of single and multiple positive solutions of the conjugate problem is shown under some conditions concerning the first eigenvalue of the relevant linear operator by means of fixed point index theory. Similar conclusions hold for some other m-point boundary value conditions.
Interoperability among Parallel DEVS Simulators and Models Implemented in Multiple Programming Languages
Authors: Thomas Wutzler, Hessam S. Sarjoughian
Venue: Simulation (2007)

FleXible yet efficient eXecution of heterogeneous simulations benefits from concepts and methods that can support distributed simulation eXecution and independent model development. To enable formal model specification with submodels implemented in multiple programming languages, we propose a novel approach called the Shared Abstract Model (SAM) approach, which supports simulation interoperability for the class of Parallel Discrete Event System Specification (DEVS) compliant simulation models. Using this approach, models written in multiple programming languages can be eXecuted together using alternative implementations of the Parallel DEVS abstract simulator. In this paper, we describe the SAM concept, detail its specification and eXemplify its implementation with two disparate DEVS-simulation engines. We demonstrate the simplicity of integrating simulation of component models written in the programming languages Java, C++ and Visual Basic. We describe a set of illustrative eXamples that are developed in an integrated DEVSJAVA and Adevs environment. Further, we stage simulation eXperiments to investigate the eXecution performance of the proposed approach and compare it with alternatives. We conclude that application domains, in which independently-developed heterogeneous component models consistent with the Parallel DEVS formalism, benefit from a rigorous foundation and are also interoperable across different simulation engines.
Private Peer-to-Peer Overlay for Real-Time Monitoring of a Deployed Internet-Scale Peer-to-Peer Overlay
Authors: Qi Zhang, Marco Piumatti, Sandeep K. Singhal
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Peer-to-peer system decentralization complicates performance monitoring-and real-time monitoring is particularly challenging. We discuss our experience with monitoring the Peer Name Resolution Protocol (PNRP), a peer-to-peer name resolution/routing protocol and overlay deployed over the Internet. We must collect accurate performance data without adding traffic overhead. Unfortunately, no central node has sufficient monitoring information, and scalability and privacy concerns make it impractical to collect reliable real-time data from active client nodes. Our method obtains information from lightweight nodes (Weather Stations) actively deployed on the P2P network and themselves forming a private P2P overlay. We monitor the overall performance of the PNRP protocol on the Internet and produce timely reports supporting network management, security alerting, and system maintenance.
Generalized processor sharing: Characterization of the admissible region and selection of optimal weights
Authors: P. Lieshout, M. Mandjes
Venue: Computers and Operations Research (2008)

We consider a two-class Generalized Processor Sharing (GPS) queueing system, in which each class has its specific traffic characteristics and quality-of-service (QoS) requirements. Traffic of both classes is assumed to be Gaussian (a versatile family of models that covers both long-range dependent and short-range dependent traffic). In this paper we address the question how to select the GPS weight values. To do so, we first characterize the admissible region of the system for fixed weights. Then we obtain the realizable region by taking the union of the admissible regions over all possible weight values. The results indicate that, under a broad variety of traffic characteristics and QoS requirements, nearly the entire realizable region can be obtained by strict priority scheduling disciplines. In addition, we indicate how the buffer thresholds, QoS requirements and the traffic characteristics of the two classes determine which class should get high priority.
Documents Distribution Strategy Based on Queuing Model and Chaotic Searching Algorithm in Web Server Cluster
Authors: Zhi Xiong, Chengcheng Guo
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

For a large website adopting web server cluster, how to organize and distribute web documents is a challenging problem. In this paper, we propose a strategy to distribute web documents in web server cluster, whose aim is to reduce system's average response time. The strategy uses queuing model to analyze cluster system, and translates the document distribution problem into a 0-1 integer programming problem. Aimed at such kind of 0-1 integer programming problem, we propose a chaotic searching algorithm to solve it. The chaotic searching algorithm lets many isolated chaotic variables search in their tracks, so the corresponding 0-1 distribution matrix built by these variables can experience every possible distribution, thereby it can find the global optimal solution in enough long time. Simulation tests show that the chaotic searching algorithm can find the global optimal solution.
Using Para-Virtualization as the Basis for a Federated PlanetLab Architecture
Authors: Chris Edwards, Aaron Harwood
Venue: Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing (2006)

The federation of islands of large scale distributed systems is a difficult problem, in part because of the variety of systems involved. We categorise solutions into either the systems integration or the virtualization approach. Using the virtualization approach, we enable a federated architecture for the PlanetLab Internet testbed. The current implementation of PlanetLab has a central management authority responsible for the maintenance of the system's nodes and creation of virtual machines for users. We propose two additional entities, which separate aspects of a node and site's management, allowing viable federation, called the Site Manager and Federation Authority. Building on the existing virtualization used by PlanetLab, the realisation of our proposal makes use of Xen, a para-virtualization system for x86 hardware. We present the uses of Xen domains, or virtual machines, as hosts for both PlanetLab nodes and slices. This additional layer of virtualization is the basis of our federation architecture.
Is Grover's Algorithm a Quantum Hidden Subgroup Algorithm?
Authors: Samuel J. Lomonaco,  Jr., Louis H. Kauffman
Venue: Quantum Information Processing (2007)

The arguments given in this paper suggest that Grover's and Shor's algorithms are more closely related than one might at first expect. Specifically, we show that Grover's algorithm can be viewed as a quantum algorithm which solves a non-abelian hidden subgroup problem (HSP). But we then go on to show that the standard non-abelian quantum hidden subgroup (QHS) algorithm can not find a solution to this particular HSP. This leaves open the question as to whether or not there is some modification of the standard non-abelian QHS algorithm which is equivalent to Grover's algorithm.
Unawareness, beliefs and games
Authors: Aviad Heifetz, Martin Meier, Burkhard C. Schipper
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

We define a generalized state-space model with interactive unawareness and probabilistic beliefs. Such models are desirable for many potential applications of asymmetric unawareness. We develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are extended naturally from lower to higher awareness levels and restricted from higher to lower awareness levels. We use our unawareness belief structure to show that the common prior assumption is too weak to rule out speculative trade in all states. Yet, we prove a generalized "No-trade" theorem according to which there can not be common certainty of strict preference to trade. Moreover, we show a generalization of the "No-agreeing-to-disagree" theorem.
Design Reuse of on/off-Chip Bus Bridge for Efficient Test Access to AMBA-based SoC
Authors: Jaehoon Song, Juhee Han, Dooyoung Kim, Hyunbean Yi, Sungju Park
Venue: Proceedings of the 16th Asian Test Symposium (2007)

This paper introduces an efficient test access mechanism for Advanced Microcontroller Bus Architecture (AMBA) based SoC to reduce the test application time while minimally adding a new test interface logic. Testable design technique is applied to an SoC with the Advanced High-performance Bus (AHB) and PCI bus bridge by maximally reusing the bridge functions. Testing time can be significantly reduced by increasing the test channels and by shortening the test control protocols. Experimental results show that area overhead and testing times in both functional and structural test modes are considerably reduced.
Analysis of Visual Motion by Biological and Computer Systems
Authors: S. Ullman
Venue: Computer (1981)

Computer processes in the analysis of visual motion are similar to those of biological systems. An alliance of psychology and computer science is necessary to understand them.
Finite sample effects of the fast ICA algorithm
Authors: Sergio Bermejo
Venue: Neurocomputing (2007)

Many algorithms for independent component analysis (ICA) and blind source separation (BSS) can be considered particular instances of a criterion based on the sum of two terms: C(Y), which expresses the decorrelation of the components and G(Y), which measures their non-Gaussianity. Within this framework, the popular FastICA algorithm can be regarded as a technique that keeps C(Y)=0 by first enforcing the whiteness of Y. Because of this constraint, the standard version of FastICA employs the sample-fourth moment as G(Y), instead of the sample-fourth cumulant. Our work analyzes some of the estimation errors introduced by the use of finite date sets in such a higher-order statistics (HOS) contrast and compares FastICA with an alternative version based on the sample-fourth cumulant, which is shown for different probability distributions having a lower variance in the generalization error in the case in which no whitening is performed, e.g. when orthonormal mixing of sources is present.
Perfect cryptography, S5 knowledge, and algorithmic knowledge
Authors: Sabina Petride, Riccardo Pucella
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

We propose a principled approach to model secrecy in multiagent systems, by defining a set of possible observations and providing agents with algorithms used to distinguish the possible states of the system. Our approach fits naturally within a knowledge-based account of secrecy. By adjusting both the kind of observations and the capabilities of the agents, we can capture in a natural way different forms of secrecy in the presence of perfect cryptography. In particular, we show how to model extraction secrecy. Our formalization suggests a unified definition of secrecy for cryptographic protocols and for systems that seek to prevent inadmissible flows of information.
Automatic target recognition using waveform diversity in radar sensor networks
Authors: Qilian Liang
Venue: Pattern Recognition Letters (2008)

In this paper, we perform a number of theoretical studies on constant frequency (CF) pulse waveform design and diversity in radar sensor networks (RSN): (1) the conditions for waveform co-existence, (2) interferences among waveforms in RSN, (3) waveform diversity combining in RSN. As an application example, we apply the waveform design and diversity to automatic target recognition (ATR) in RSN and propose maximum-likehood (ML)-ATR algorithms for non-fluctuating target as well as fluctuating target. Simulation results show that our waveform diversity-based ML-ATR algorithm performs much better than single-waveform ML-ATR algorithm for non-fluctuating targets or fluctuating targets. Conclusions are drawn based on our analysis and simulations.
Toward a Local Network Standard
Authors: Ware Myers
Venue: IEEE Micro (1982)

A standard with choices? Though some object to the notion, the proposed IEEE standardfor local networking reflects reality. Two general approaches are being standardized, each appropriate to certain applications.
AGRIF: Adaptive grid refinement in Fortran
Authors: Laurent Debreu, Christophe Vouland, Eric Blayo
Venue: Computers Geosciences (2008)

Adaptive grid refinement in Fortran (AGRIF) is a Fortran90 package for the integration of adaptive mesh refinement (AMR) features within existing finite difference codes. The package first provides model-independent Fortran90 procedures containing the different operations in an AMR process: time integration of grid hierarchy, clustering, interpolations, updates, etc. The package then creates the Fortran90 model-dependent part of the code based on an entry file written by the user. The basic idea of AGRIF is to make use of Fortran90 pointers to successively address the variables of the different grids of an AMR process. As pointers can be used exactly like other (static) variables in Fortran, most of the original code will remain unchanged.