ppxscal/embedding_network huggingface dataset:
Dynamics of Firing Patterns in Evolvable Hierarchically Organized Neural Networks
Authors: Olga Chibirova, Javier Iglesias, Vladyslav Shaposhnyk, Alessandro E. Villa
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

A scalable hardware platform made of custom reconfigurable devices endowed with bio-inspired ontogenetic and epigenetic features is configured to run an artificial neural network with developmental and evolvable capabilities. The hardware architecture allows internetwork communication and this study analyzes the simulated activity of two hierarchically organized spiking neural networks. The main features were an initial developmental phase characterized by cell death (apoptosis driven by excessive firing rate), followed by spike timing dependent synaptic plasticity in presence of background noise. The emergence of precise firing sequences formed by recurrent patterns of spike intervals above chance levels suggested the build-up of a connectivity, out of initially randomly connected networks, able to sustain temporal information processing. The relative frequency of precise firing sequences was higher in the downstream network and their dynamics suggested the emergence of an unsupervised hierarchical activity-driven connectivity.
Match-Up Strategies for Job Shop Rescheduling
Authors: Patrick Moratori, Sanja Petrovic, Antonio Vázquez
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

We investigate the problem of integrating new rush orders into the current schedule of a real world job shop floor. Satisfactory rescheduling methods must keep stability of the shop, by introducing the fewest number of changes in the ordering of operations, while maintaining the same levels of the schedule performance criteria. This paper introduces a number of match-up strategies that modify only part of the schedule in order to accommodate new arriving jobs. These strategies are compared with the right-shift and the total-rescheduling methods, which are optimal regarding stability and performance, but ineffective for performance and stability, respectively. Statistical analysis indicates that the match-up strategies are comparable to right-shift for stability, and as good as total-rescheduling for performance.
Improved Control Acquisition Scheme for the IEEE 896 Futurebus
Authors: D. Taub
Venue: IEEE Micro (1987)

An added preemption facility clearly improves earlier schemes for implementing this backplane bus used with 32-bit microprocessors. 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
Efficient Algorithms for Video Association Mining
Authors: B. Sivaselvan, N. P. Gopalan
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

Video Association Mining(VAM) is the process of discovering associations in a given video. Two key phases of VAM are (i) Transformation and (ii) Frequent Temporal Pattern Mining. The transformation phase converts the original input video to an alternate transactional format, namely a cluster sequence. Frequent temporal pattern mining phase concerns the generation of patterns subject to the temporal distance and support thresholds. The paper addresses the issue of frequent temporal pattern mining and studies algorithms for the same. The existing Apriori based algorithm is compared with three other approaches highlighting the case specific situations suited by each.
Acceleration of Preconditioned Krylov Solvers for Bubbly Flow Problems
Authors: J. M. Tang, C. Vuik
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

We consider the linear system which arises from discretization of the pressure Poisson equation with Neumann boundary conditions, coming from bubbly flow problems. In literature, preconditioned Krylov iterative solvers are proposed, but these show slow convergence for relatively large and complex problems. We extend these traditional solvers with the so-called deflation technique, which accelerates the convergence substantially. Several numerical aspects are considered, like the singularity of the coefficient matrix and the varying density field at each time step. We demonstrate theoretically that the resulting deflation method accelerates the convergence of the iterative process. Thereafter, this is also demonstrated numerically for 3-D bubbly flow applications, both with respect to the number of iterations and the computational time.
Hopscotch Hashing
Authors: Maurice Herlihy, Nir Shavit, Moran Tzafrir
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

We present a new class of resizable sequential and concurrent hash map algorithms directed at both uni-processor and multicore machines. The new hopscotch algorithms are based on a novel hopscotch multi-phased probing and displacement technique that has the flavors of chaining, cuckoo hashing, and linear probing, all put together, yet avoids the limitations and overheads of these former approaches. The resulting algorithms provide tables with very low synchronization overheads and high cache hit ratios.In a series of benchmarks on a state-of-the-art 64-way Niagara II multicore machine, a concurrent version of hopscotch proves to be highly scalable, delivering in some cases 2 or even 3 times the throughput of today's most efficient concurrent hash algorithm, Lea's ConcurrentHashMap from java.concurr.util. Moreover, in tests on both Intel and Sun uni-processor machines, a sequential version of hopscotch consistently outperforms the most effective sequential hash table algorithms including cuckoo hashing and bounded linear probing.The most interesting feature of the new class of hopscotch algorithms is that they continue to deliver good performance when the hash table is more than 90% full, increasing their advantage over other algorithms as the table density grows.
A Hybrid Approach for XML Similarity
Authors: Joe Tekli, Richard Chbeir, Kokou Yetongnon
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

In the past few years, XML has been established as an effective means for information management, and has been widely exploited for complex data representation. Owing to an unparalleled increasing use of the XML standard, developing efficient techniques for comparing XML-based documents becomes essential in information retrieval (IR) research. Various algorithms for comparing hierarchically structured data, e.g. XML documents, have been proposed in the literature. However, to our knowledge, most of them focus exclusively on comparing documents based on structural features, overlooking the semantics involved. In this paper, we integrate IR semantic similarity assessment in an edit distance algorithm, seeking to amend similarity judgments when comparing XML-based documents. Our approach comprises of an original edit distance operation cost model, introducing semantic relatedness of XML element/attribute labels, in traditional edit distance computations. A prototype has been developed to evaluate our model's performance. Experiments yielded notable results.
A Model of communication technology education and its application in a primary school: take PHS phones as example
Authors: Rong-Jyue Fang, Hung-Jen Yang, Hua-Lin Tsaii, Chi-Jen Lee
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

This study intends to investigate PHS phone and its application in an elementary school. The interview process targeted on the projector who is an executor of the plan of PHS phones from an experimental elementary school located in Kaohsiung County, southern Taiwan. She joined all of digital experimental project and observed interaction between the parents and their own children in the specific elementary school. In the experimental period, the projector observed each parents using a PHS phone; through message transmission and mobile net communication, parents using PHS phones to discuss and share feelings with the teachers as well as other parents. The research summarized the projector's ideas and provided references opinion to instruction designers and mobile learning projectors to develop further innovative instruction.
A Bio-inspired Architecture of an Active Visual Search Model
Authors: Vassilis Cutsuridis
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

A novel brain inspired cognitive system architecture of an active visual search model is presented. The model is multi-modular consisting of spatial and object visual processing, attention, reinforcement learning, motor plan and motor execution modules. The novelty of the model lies on its decision making mechanisms. In contrast to previous models, decisions are made from the interplay of a winner-take-all mechanism in the spatial, object and motor salient maps between the resonated by top-down attention and bottom-up visual feature extraction and salient map formation selectively tuned by a reinforcement signal spatial, object and motor representations, and a reset mechanism due to inhibitory feedback input from the motor execution module to all other modules. The reset mechanism due to feedback inhibitory signals from the motor execution module to all other modules suppresses the last attended location from the saliency map and allows for the next gaze to be executed.
Study of the Wavelet Basis Selections
Authors: Hua Cui, Guoxiang Song
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

How to choose a wavelet basis for a given signal is always important and difficult in wavelet applications. In this paper, based on the fact that the Morlet has been conventionally selected to make wavelet analysis of LFM signals, some further research on the wavelet basis selection are done. Morlet is in fact not the best choice under all application conditions related to LFM signals processing, which is proved by both the theoretical analysis and the simulation results in this paper. So we should not choose a wavelet basis randomly, but weigh it synthetically.
Plan B: Using Files instead of Middleware Abstractions
Authors: Francisco J. Ballesteros, Enrique Soriano, Gorka Guardiola, Katia Leal
Venue: IEEE Pervasive Computing (2007)

The Plan B operating system combines the traditional file system interface with a sensible interface design for devices and services to improve machine interoperation and provide the new abstractions and services required by ubiquitous environments. The Plan B remote-file-system import mechanism lets the system adapt to environment changes and lets users customize the environment according to their needs. Researchers at the Universidad Rey Juan Carlos have used the system for more than a year, both for daily work and for implementing a smart space that includes machines running the Plan B, Plan 9, Windows, Symbian, and Linux operating systems.
Data Forest: A Collaborative Version
Authors: Ronan Jamieson, Adrian Haffegee, Priscilla Ramsamy, Vassil Alexandrov
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

As we increase our ability to produce and store ever larger amounts of data, it is becoming increasingly difficult to understand what the data is trying to tell us. Not all the data we are currently producing can easily fit into traditional visualization methods. This paper presents a new and novel visualization technique based on the concept of a Data Forest. Our Data Forest has been developed to be utilised by virtual reality (VR) systems. VR is a natural information medium. This approach can easily be adapted to be used in collaborative environments. A test application has been developed to demonstrate the concepts involved and a collaborative version tested.
Query Rewriting for Access Control on Semantic Web
Authors: Jian Li, William K. Cheung
Venue: Proceedings of the 5th VLDB workshop on Secure Data Management (2008)

Along with describing the web resources with ontology-based metadata to make them machine-understandable, one also needs to carefully protect Semantic Web data from unauthorized access. This paper presents a query rewriting mechanism for access control so as to avoid leakage of sensitive resources in the Semantic Web. We propose to specify the security policies for access restrictions on resources as views declared based on ontologies. Illustrated examples are presented in the paper for explaining the underlying concepts. In addition, bucket-based algorithms are proposed for supporting the query rewriting.
Founding Cryptography on Oblivious Transfer --- Efficiently
Authors: Yuval Ishai, Manoj Prabhakaran, Amit Sahai
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

We present a simple and efficient compiler for transforming secure multi-party computation (MPC) protocols that enjoy security only with an honest majority into MPC protocols that guarantee security with no honest majority, in the oblivious-transfer (OT) hybrid model. Our technique works by combining a secure protocol in the honest majority setting with a protocol achieving only security against semi-honest parties in the setting of no honest majority.Applying our compiler to variants of protocols from the literature, we get several applications for secure two-party computation and for MPC with no honest majority. These include: Constant-rate two-party computation in the OT-hybrid model. We obtain a statistically UC-secure two-party protocol in the OT-hybrid model that can evaluate a general circuit C of size s and depth d with a total communication complexity of O(s) + poly(k, d, log s) and O(d) rounds. The above result generalizes to a constant number of parties. Extending OTs in the malicious model. We obtain a computationally efficient protocol for generating many string OTs from few string OTs with only a constant amortized communication overhead compared to the total length of the string OTs. Black-box constructions for constant-round MPC with no honest majority. We obtain general computationally UC-secure MPC protocols in the OT-hybrid model that use only a constant number of rounds, and only make a black-box access to a pseudorandom generator. This gives the first constant-round protocols for three or more parties that only make a black-box use of cryptographic primitives (and avoid expensive zero-knowledge proofs).
Software Product Line Oriented Feature Map
Authors: Yiyuan Li, Jianwei Yin, Dongcai Shi, Ying Li, Jinxiang Dong
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

The core idea of software product line engineering is to develop a reusable infrastructure that supports the software development of a family of products. On the base of domain analysis, feature modeling identifies commonalities and variability of software products in terms of features to provide an acknowledged abstract to various stakeholders. The concept of feature map is proposed to perfect feature model. It supports customized feature dependencies and constraint expresses, provides the capability to navigate and locate the resource entities of features. Ontology is introduced as the representation basis for the meta-model of feature maps. By the means of selecting features to construct the reusable infrastructure, the components of feature implementation are rapidly located and assembled to produce a family of software products meeting certain dependencies and constraints.
Characteristics of information needs for television broadcasts of scholars and students in media studies
Authors: Brian Kirkegaard, Pia Borlund
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

This paper reports on an explorative study of information need characteristics in a television broadcast context. Nine in-depth interviews are conducted with scholars and students within the academic field of Media Studies, and we identify four characteristics. Firstly, broadcasts are needed as objects of analysis in empirical research. Secondly, the needs are related to three broadcast dimensions: 1) Transmission; 2) Archive; and 3) Reception. Thirdly, four fundamental types of information needs are verified in a television broadcast context: 1) Known item; 2) Factual data; 3) Known topic or content; and 4) Muddled topic or content. Fourthly, the interviewees' needs consist of four phases: 1) Getting an overview of transmitted broadcasts; 2) Identification of borderline exemplars; 3) Selection of specific programmes; and 4) Verification of facts. In this way, the present paper presents novel research on characteristics of information needs in a television broadcast context. This knowledge is imperative for the design and construction of future broadcast retrieval systems.
English Grammar Learning System Based on Knowledge Network of Fill-in-the-Blank Exercises
Authors: Takuya Goto, Tomoko Kojiri, Toyohide Watanabe, Takeshi Yamada, Tomoharu Iwata
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

To understand English grammar is essential to write/speak/ read English appropriately. Fill-in-the-blank exercise of English grammar is one of the popular types of exercises, which is introduced to check acquired/in-acquired grammatical knowledge by evaluating the word selected by a learner for each sentence. Since such exercise-based learning is effective to acquire practical knowledge, our objective is to construct English grammar learning system using fill-in-the-blank exercises. In order to make learners study with the exercises effectively, the system should grasp the grammatical knowledge that learners need to obtain and give series of appropriate exercises. In our system, the knowledge network, which represents relations among exercises according to the differences in their knowledge, is introduced. In the knowledge network, exercises are linked by the inclusive relation of their knowledge. Based on the acquired/in-acquired grammatical knowledge determined by the learner's answer, the system traverses knowledge network and poses the exercise which contains the knowledge that the learner needs to study.
Sound Design for Affective Interaction
Authors: Anna Dewitt, Roberto Bresin
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

Different design approaches contributed to what we see today as the prevalent design paradigm for Human Computer Interaction; though they have been mostly applied to the visual aspect of interaction. In this paper we presented a proposal for sound design strategies that can be used in applications involving affective interaction. For testing our approach we propose the sonification of the Affective Diary, a digital diary with focus on emotions, affects, and bodily experience of the user. We applied results from studies in music and emotion to sonic interaction design. This is one of the first attempts introducing different physics-based models for the real-time complete sonification of an interactive user interface in portable devices.
BioWarehouse: Relational Integration of Eleven Bioinformatics Databases and Formats
Authors: Peter D. Karp, Thomas J. Lee, Valerie Wagner
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

BioWarehouse is an open-source project for integrating bioinformatics databases within a relational database warehouse. It has two key features. A comprehensive database schema models many different bioinformatics datatypes. A set of loader tools permits loading of public bioinformatics databases, and of standard bioinformatics formats, into that database schema. Thus, multiple databases can be queried together within a single common schema. The supported databases are BioCyc, CMR, ENZYME, Eco2DBase, Genbank, Gene Ontology, KEGG, NCBI Taxonomy, and UniProt. The supported formats are BioPAX (protein interactions subset only) and MAGE-ML.
System-Level Design Space Exploration of Dynamic Reconfigurable Architectures
Authors: Kamana Sigdel, Mark Thompson, Andy D. Pimentel, Todor Stefanov, Koen Bertels
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

One of the major challenges of designing heterogeneous reconfigurable systems is to obtain the maximum system performance with efficient utilization of the reconfigurable logic resources. To accomplish this, it is essential to perform design space exploration (DSE) at the early design stages. System-level simulation is used to estimate the performance of the system and to make early decisions of various design parameters in order to obtain an optimal system that satisfies the given constraints. Towards this goal, in this paper, we develop a model, which can assist designers at the system-level DSE stage to explore the utilization of the reconfigurable resources and evaluate the relative impact of certain design choices. A case study of a real application shows that the model can be used to explore various design parameters by evaluating the system performance for different application-to-architecture mappings.
Early Electronic Computing Developments at IBM
Authors: Byron E. Phelps
Venue: IEEE Annals of the History of Computing (1980)

This article deals primarily with the early beginnings of electronic computer development within IBM. It starts with the 603 prototype (first operational in 1942) and goes on to cover the major IBM electronic developments up through the 701, including the 603, SSEC, 604, CPC, and tape processing machine. It also briefly outlines early work at RCA and at NCR, based on patents on file in the U.S. Patent Office and on the limited reports publicly available.
Characterizing Massively Multiplayer Online Games as Multi-Agent Systems
Authors: G. Aranda, C. Carrascosa, Vicente Botti
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

The number of players of Massively Multiplayer Online Games is increasing quite fast, and the mechanics of these virtual worlds are getting more and more complex. Due to the eminently distributed nature of these games and their growing necessity of modern AI techniques, it is time to introduce design methods that take advantage of the power of Multi-Agent Systems in order to face the challenges of designing a modern Multiplayer Online Game. In this work, an introductory step into the characterization of Multiplayer Online Games as Multi-Agent Systems is presented. It is based on using mechanisms and concepts derived from the agent theory, like Electronic Institutions and Agent Organizations, as foundations for building the game system and the virtual environments.