ppxscal/embedding_network huggingface dataset:
The architecture at the end of the quantum tunnel
Authors: Tzvetan Spassov Metodi
Venue:  (2007)

Quantum computing is an emerging field that offers revolutionary and exciting new ways to process, store, and transport information. Moreover, realizing large-scale quantum systems requires advances in science and engineering that are now very close to reality. Such systems will need many classical and quantum parts that must fit together into one architecture, in which each component plays an integral role over the course of an application execution. Therefore, it is important that we draw upon the experiences gained from traditional architectures, to develop a model for a large-scale quantum system that provides the methodology necessary for the many different components to work together. In this thesis, I describe the design of the Quantum Logic Array (QLA) architecture, which tackles critical scalability issues such as the cost of error correction and distributing data over large-distances. To accurately model the performance of the QLA architecture&mdash;the ion-trap technology is used since every component necessary for universal quantum computation has been demonstrated in the laboratory. However, due to its design approach for maximizing parallelism, the QLA system suffers from large area overhead. To combat the area problem, I describe an architecture that uses the concept of hardware specialization employed in traditional architectures. The new architecture is based on the QLA model, but is divided into separately optimized quantum memory hierarchy and logic specific regions. The result is a scalable system design that exploits the available parallelism to balance both quantum and classical resources, while both reducing the area of the chip and increasing its performance.
A Logic Description on Different Negation Relation in Knowledge
Authors: Zhenghua Pan
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In this paper, we propose that negation relation in knowledge ought to differentiate contradictory negation and opposite negation. Based on this cognition, we (1) discovered a character of knowledge: if pair of knowledge with opposite negation relation are fuzzy knowledge, then must exist fuzzy medium object (new knowledge) between them; contrarily, if there is a fuzzy medium object between the two knowledge with opposite negation relation, then them must be fuzzy knowledge; (2) five kinds of contradictory negation and opposite relations (CDC, CFC, ODC, OFC and ROM) in the distinct knowledge and fuzzy knowledge, and formalization definition were confirmed; (3) studied these different negation relations using the medium predicate logic MF and the infinite valued semantic model ¿ of MF, and obtained the conditions of processing these different negation relations. 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
Mereotopological assembly joint information representation for collaborative product design
Authors: Kyoung-Yun Kim, Hyungjeong Yang, Dong-Won Kim
Venue: Robotics and Computer-Integrated Manufacturing (2008)

In this paper we discuss an ontology-based representation method for differentiating assembly joints in collaborative and intelligent product design. As design becomes increasingly knowledge-intensive, intelligent, and collaborative, the need becomes more critical for computational frameworks that enable product development by effectively supporting the formal representation, capture, retrieval, and reuse of product knowledge. Joints are a key aspect of assembly models that are often ambiguous when model sharing takes place. Although various joints may have similar geometries and topologies, the physical implications of the selected joining processes may vary significantly. It is possible to attach notes and annotations to geometric entities in order to distinguish joints; however, such textual information does not readily prepare the model for downstream activities, such as simulation and analysis. As an illustration, analysts must read and interpret the annotations in order to develop the appropriate boundary conditions. In this work, we present an assembly design ontology that explicitly represents assembly constraints, including joining constraints, and infers any remaining implicit ones. By relating concepts through ontology technology rather than just defining data syntax, assembly and joining concepts can be captured in their entirety or extended as necessary. By using the knowledge captured by the ontology, similar looking joints can be differentiated. For this research, we used a mereotopology, which is a region-based theory for parts, and the Semantic Web Rule Language (SWRL) to represent the difference of joints and to define assembly design terms and their relationships. We also used SWRL so that the joining rules can be reasoned to differentiate assembly joints. Finally, by using an ontology, various geometrically and topologically similar joints are successfully differentiated in a standard and machine-interpretable manner.
Computable Models of the Law and ICT: State of the Art and Trends in European Research
Authors: Giovanni Sartor, Pompeu Casanovas, Núria Casellas, Rossella Rubino
Venue: Computable Models of the Law: Languages, Dialogues, Games, Ontologies (2008)

This volume is devoted to the presentation of several research contributions from some significant European research projects in the domain of legal technologies. In this domain European research has been particularly active in the last years, often achieving global leadership. This is due to the commitment of individual researchers, research centers and universities, but also to the support of the European Union that in various research programs has devoted a significant attention (and some relevant financing) to legal technologies, considering them a decisive aspect of E-government and a crucial resource for the development of the information society.
BioTools: A Biosignal Toolbox for Composers and Performers
Authors: Miguel Angel Pérez, R. Benjamin Knapp
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

In this paper, we present the current state of BioTools, an ongoing project to implement a modular hardware and software toolbox for composers and performers, which allows fast deployment of biosignal monitoring and measuring systems for musical applications. We discuss the motivations for this work and additionally three examples are shown of how this set of tools and the compositional strategies were used in the pieces Díamair for choir and physiological sensors, Out of Time, a project in which BioTools was used to record and analyse biosignals for their later use to inspire and aid in composition, and Carne, an improvisational piece that uses BioTools modules as the control interface.
Manycores in the Future
Authors: Robert Schreiber
Venue: Proceedings of the 3rd international conference on High Performance Computing and Communications (2007)

The change from single core to multicore processors is expected to continue, taking us to manycore chips (64 processors) and beyond. Cores are more numerous, but not faster. They also may be less reliable. Chip-level parallelism raises important questions about architecture, software, algorithms, and applications. I'll consider the directions in which the architecture may be headed, and look at the impact on parallel programming and scientific computing.
Domain knowledge query conversation bots in instant messaging (IM)
Authors: Ong Sing Goh, Chun Che Fung, Arnold Depickere
Venue: Knowledge-Based Systems (2008)

In this paper, we examine the use of knowledge query technology as applied to conversation bots in the instant messaging environment. Hence, we designed an artificial intelligent conversation robot or bots called Artificial Intelligence Natural language Identity (hereafter, AINI) to mimic human conversation. Our goal is to introduce a Domain Matrix Knowledge Model and an Automated Knowledge Extraction Agent (AKEA) to create AINI's knowledge bases, and in turn provide intelligent query mechanisms. We report an evaluation on the collection and analysis of a corpus containing over 3280 utterances in a series of real instant messages exchanged between the AINI conversation bot and 65 online ''buddies''. About 1721 utterances were produced by AINI, 88.03% were from open-domain knowledge, 2.15% from domain-specific knowledge base and 9.82% were inappropriate and amusing responses. These results show that domain knowledge plays significant roles in conversations between two or more human users and in human-machine conversation.
Profiting from Business Process Outsourcing
Authors: Siva Namasivayam
Venue: IT Professional (2004)

Labor cost arbitrage (profiting from skilled-labor wage discrepancies) and process modules (automation of best practices) can make business process outsourcing profitable. 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
A Hybrid Method of Noise Robust Speech Recognition Based on Fractional Spectral Subtraction and Perceptual Linear Preditive
Authors: Zhen-li Wang, Zhi-qiang Bai
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

By combining Fractional Spectral Subtraction (FSS) with Perceptual Linear Predictive (PLP), a hybrid method of noise robustness speech recognition isinvestigated in this paper. This method uses FSS for noisy speech to reduce noise components in the fractional Fourier domain. According to the results ofcomputing Itakura distance and Mean Square Error (MSE), an approximate optimal fractional order is then obtained by comparing the difference betweenthem. Perceptual Linear Predictive Cepstral Coefficients (PLPCC) is finally computed for the enhanced speech in terms of the above obtained order.It is shown that this hybrid method performs better compared with conventional spectral subtraction and PLPCC for digits speech recognition experiments. Moreover, this method denotes good noise robustness when noise levels increases.
A Critical Analysis and Improvement of AACS Drive-Host Authentication
Authors: Jiayuan Sui, Douglas R. Stinson
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

This paper presents a critical analysis of the AACS drive-host authentication scheme. A few weaknesses are identified which could lead to various attacks on the scheme. In particular, we observe that the scheme is susceptible to unknown key-share and man-in-the-middle attacks. Modifications of the scheme are suggested in order to provide better security. A proof of security of the modified scheme is also presented. The modified scheme achieves better efficiency than the original scheme.
Genetic algorithm for the training time assignment problem of core laboratories
Authors: Hui-Fan Tsai, Tung-Shou Chen, Rong-Chang Chen, Jung-Chang Chen
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

In this study, we use genetic algorithm (GA) as a tool for analyzing the training time assignment problem. The problem is concerned with the allocation of the available time of a core laboratory with high-precision and valuable equipment, which needs a teacher or a professional to provide appropriate training, to students of a medical technology related department. Students are asked to select from a list of possible training time and to indicate their preferred choices in advance. As expected, some of the more popular available time has become 'over-subscribed' and the assignment becomes a complicated problem. Results from this study show that by employing GA, the complex problem can be well solved and better allocations can be generated.
An empathic virtual dialog agent to improve human-machine interaction
Authors: Magalie Ochs, Catherine Pelachaud, David Sadek
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Recent research has shown that virtual agents expressing empathic emotions toward users have the potentiality to enhance human-machine interaction. To identify under which circumstances a virtual agent should express empathic emotions, we have analyzed real human-machine dialog situations that have led users to express emotion. The results of this empirical study have been combined with theoretical descriptions of emotions to construct a model of empathic emotions. Based on this model, a module of emotions has been implemented as a plug-in for JSA agents. It determines the empathic emotions (their types and intensity) of such agents in real time. It has been used to develop a demonstrator where users can interact with an empathic dialog agent to obtain information on their emails. An evaluation of this agent has enabled us to both validate the proposed model of empathic emotions and highlight the positive user's perception of the virtual agent.
A Novel Immune Based Approach for Detection of Windows PE Virus
Authors: Yu Zhang, Tao Li, Jia Sun, Renchao Qin
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Generic computer virus detection is the absolute need of the hour as most commercial antivirus products fail to detect unknown and new Windows PE viruses. Motivated by the success of immune-based techniques in intrusion detection systems, recent research in detecting computer viruses is directed towards devising efficient non-signature-based techniques. We observe that each Windows PE virus whether or not it is encrypted must have a relocation module to relocate its variables or constants in the infected programs. Due to its unique characteristic, the virus relocation module can be extracted as an antibody in the immune systems to detect the specific antigens. In this paper, we presented a novel Windows PE virus detection approach that draws inspiration from artificial immune system and the structure of the relocation module of the virus. The structure of Windows PE virus is sufficiently analyzed. The dynamic evolution of self and nonself, the presentation of the antigen, and the generation of the antibody are proposed. The experiment is conducted and its results indicate that this approach not only has relatively higher detection rate of unknown Windows PE virus than the earlier known methods, but also has better capability of self-adaptive and self-learning.
Positive periodic solutions of functional differential equations with impulses and a parameter
Authors: Yongkun Li, Xuanlong Fan, Lili Zhao
Venue: Computers Mathematics with Applications (2008)

By applying the well-known Leggett-Williams multiple fixed point theorem, this paper investigates the existence of multiple positive periodic solutions of functional differential equations with impulses and a parameter.
On Computation and Communication with Small Bias
Authors: Harry Buhrman
Venue: Proceedings of the 4th international symposium on Stochastic Algorithms: Foundations and Applications (2007)

Many models in theoretical computer science allow for computations or representations where the answer is only slightly biased in the right direction. The best-known of these is the complexity class PP, for "probabilistic polynomial time". A language is in PP if there is a randomized polynomial-time Turing machine whose acceptance probability is greater than 1/2 if, and only if, its input is in the language.Most computational complexity classes have an analogous class in communication complexity. The class PP in fact has two, a version with weakly restricted bias called PPcc, and a version with unrestricted bias called UPPcc. Ever since their introduction by Babai, Frankl, and Simon in 1986, it has been open whether these classes are the same. We show that PPcc is strictly included in UPPcc. Our proof combines a query complexity separation due to Beigel with a technique of Razborov that translates the acceptance probability of quantum protocols to polynomials. We will discuss some complexity theoretical consequences of this separation. This presentation is bases on joined work with Nikolay Vereshchagin and Ronald de Wolf.
Service Composition in Holonic Multiagent Systems: Model-Driven Choreography and Orchestration
Authors: Christian Hahn, Klaus Fischer
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

Services provide a universal basis for the integration of business processes that are distributed among entities, both within an organization and across organizational borders. Service-oriented Architectures (SOA) include service composition, management and monitoring, billing and security. This paper presents a model-driven approach to design interoperable holonic multiagent systems in a SOA. Thereby, we mainly concentrate on providing a foundation for how to define the composition of services in holonic multiagent systems and discuss how this integragtion could be done in a MDD manner.
Visual Exploration of Frequent Itemsets and Association Rules
Authors: Li Yang
Venue: Visual Data Mining: Theory, Techniques and Tools for Visual Analytics (2008)

Frequent itemsets and association rules are defined on the powerset of a set of items and reflect the many-to-many relationships among the items. They bring technical challenges to information visualization which in general lacks effective visual technique to describe many-to-many relationships. This paper describes an approach for visualizing frequent itemsets and association rules by a novel use of parallel coordinates. An association rule is visualized by connecting its items, one on each parallel coordinate, with polynomial curves. In the presence of item taxonomy, an item taxonomy tree is displayed as coordinate and can be expanded or shrunk by user interaction. This interaction introduces a border in the generalized itemset lattice, which separates displayable itemsets from non-displayable ones. Only those frequent itemsets on the border are displayed. This approach can be generalized to the visualization of general monotone Boolean functions on lattice structure. Its usefulness is demonstrated through examples.
DIVA: An Automatic Music Arrangement Technique Based on Impression of Images
Authors: Kisa Ohyama, Takayuki Itoh
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

This poster reports our first approach for automatic music arrangement based on the impression of input images. Given a digital image and keywords of objects shot in the image, the technique selects a rhythm pattern associated from the keywords and color distribution of the image. As a preprocessing, the technique first provides sample colors, images, and keywords to users, and then collects the feedback of selection of rhythm patterns associated from them. The technique then leads equations to calculate the association of rhythm pattern from arbitrary input images. Finally, the technique automatically calculates the association scores of all prepared rhythm patterns from the images, and provides music arranged applying the associated rhythm pattern.
Sound for A-Life Agents
Authors: Melanie Baljko, John Kamevaar, Nell Tenhaaf
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

The artwork Swell (2003), by Tenhaaf with sound by Kamevaar, has a pod-like amorphous shape and affords the feeling to people that they are dealing with an entity. It has been dubbed by some interactants as a "baby" robot, despite the fact that it has no moving parts and only one ultrasonic distance sensor for detecting its environment (and thus is not robotic). But it has "baby talk" suitable for a machine: sound as pure signal, that could have no other origin than electronic signal flow itself. Interactants set off electronically-manipulated microphone feedback sounds when proximal to Swell - sounds that become louder and more intense when the interactant moves away and softer as she or he comes closer. The generated sounds are layered: several sounds playing at once generate the assault of noise, whereas a single sound is almost melodic. Through its sound, Swell both commands its space and directs people's movements; it is thereby perceived as having the potential to mature into a more autonomous entity. The idea of the work is not to elicit beliefs that one is seeing life emerging artificially, but rather to elicit a willingness to talk to this entity.
How Who Should Practice: Using Learning Decomposition to Evaluate the Efficacy of Different Types of Practice for Different Types of Students
Authors: Joseph E. Beck, Jack Mostow
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

A basic question of instruction is how much students will actually learn from it. This paper presents an approach called learning decomposition, whichdetermines the relative efficacy of different types of learning opportunities. This approach is a generalization of learning curve analysis, and uses non-linear regression to determine how to weight different types of practice opportunities relative to each other. We analyze 346 students reading 6.9 million words and show that different types of practice differ reliably in how efficiently students acquire the skill of reading words quickly and accurately. Specifically, massed practice is generally not effective for helping students learn words, and rereading the same stories is not as effective as reading a variety of stories. However, we were able to analyze data for individual student's learning and use bottom-up processing to detect small subgroups of students who did benefit from rereading (11 students) and from massed practice (5 students). The existence of these has two implications: 1) one size fits all instruction is adequate for perhaps 95% of the student population using computer tutors, but as a community we can do better and 2) the ITS community is well poised to study what type of instruction is optimal for the individual.
Issues in the Design of an Environment to Support the Learning of Mathematical Generalisation
Authors: Darren Pearce, Manolis Mavrikis, Eirini Geraniou, Sergio Gutiérrez
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

Expressing generality, recognising and analysing patterns and articulating structure is a complex task and one that is invariably problematic for students. Nonetheless, very few systems exist that support learners explicitly in the process of mathematical generalisation. We have addressed this by developing a novel environment that supports users in their reasoning and problem-solving of generalisation tasks. We have followed a stakeholder-centred design process, integrating feedback and reflections from twenty-four children, five teachers and a variety of other stakeholders. This paper focuses on several inter-related design issues that have been informed by this iterative process and demonstrates how the system can be used for a typical generalisation task to foster an appreciation of generality and indeed algebra.