ppxscal/embedding_network huggingface dataset:
Pattern Recognition Using Hybrid Optimization for a Robot Controlled by Human Thoughts
Authors: Yan Guozheng, Yang Banghua, Chen Shuo, Yan Rongguo
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

A robot system controlled by human thoughts is introduced in this paper. Aiming at the recognition problem of electroencephalogram (EEG) signals in the system, we present a novel pattern recognition method. The method combines the genetic algorithm (GA) with the support vector machine (SVM). It includes two techniques. One is that the feature selection and model parameters of the SVM are optimized synchronously, which constitutes a hybrid optimization. The other is that the hybrid optimization is realized by using the GA. The method is used to classify three types of EEG signals in the system. The experiment results show that this method can yield significantly higher classification accuracy than ones obtained with individual optimizations.
Understanding the Collective Design Process by Analyzing Intermediary Objects
Authors: Hassina El-Kechai, Christophe Choquet
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The objective of this paper focuses on a study of a collective design process of scenarios describing pedagogical situations. Our aim is to show, in the framework of a project named AEB (Apprenticeship Electronic Booklet ) how the design process analysis can be driven by the intermediary objects produced and mobilized in such a process. In particular, we show how the analysis of these intermediary objects give us comprehension elements of the contents and organization of collective design activities. This will allow us to propose conceptual and technical tools to facilitate and support the design process adopted by the designers.
Proactive security for mobile messaging networks
Authors: Abhijit Bose, Kang G. Shin
Venue: Proceedings of the 5th ACM workshop on Wireless security (2006)

The interoperability of IM (Instant Messaging) and SMS (Short Messaging Service) networks allows users to seamlessly use a variety of computing devices from desktops to cellular phones and mobile handhelds. However, this increasing convergence has also attracted the attention of malicious software writers. In the past few years, the number of malicious codes that target messaging networks, primarily IM and SMS, has been increasing exponentially. Large message volume and number of users in these networks renders manual mitigation of malicious software nearly impossible. This paper proposes automated and proactive security models to protect messaging networks from mobile worms and viruses. First, we present an algorithm for automated identification of the most vulnerable clients in the presence of a malicious attack, based on interactions among the clients. The simplicity of our approach enables easy integration in most client-server messaging systems. Next, we describe a proactive containment framework that applies two commonly-used mechanisms---rate-limiting and quarantine---to the dynamically-generated list of vulnerable clients in a messaging network whenever a worm or virus attack is suspected. Finally, we evaluate the effectiveness of proactive security in a cellular network using data from a large real-life SMS customer network, and compare it against other existing approaches. Most messaging networks can implement our proposed framework without any major modification of their existing infrastructure.
A Candidate Fault Model for AspectJ Pointcuts
Authors: Jon S. Baekken, Roger T. Alexander
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

We present a candidate fault model for pointcuts in AspectJ programs. The fault model identifies faults that we believe are likely to occur when writing pointcuts in the AspectJ language. Categories of fault types are identified, and each individual fault type is described an categorized. We argue that a fault model that focuses on the unique constructs of the AspectJ language is needed for the systematic and effective testing of AspectJ programs. Our pointcut fault model is a first step towards such a model.
The discrete Green Theorem and some applications in discrete geometry
Authors: S. Brlek, G. Labelle, A. Lacasse
Venue: Theoretical Computer Science (2005)

The discrete version of Green's Theorem and bivariate difference calculus provide a general and unifying framework for the description and generation of incremental algorithms. It may be used to compute various statistics about regions bounded by a finite and closed polygonal path. More specifically, we illustrate its use for designing algorithms computing many statistics about polyominoes, regions whose boundary is encoded by four letter words: area, coordinates of the center of gravity, moment of inertia, set characteristic function, the intersection with a given set of pixels, hook-lengths, higher order moments and also q-statistics for projections.
TextGrid and eHumanities
Authors: Peter Gietz, Andreas Aschenbrenner, Stefan Budenbender, Fotis Jannidis, Marc W. Kuster, Christoph Ludwig, Wolfgang Pempe, Thorsten Vitt, Werner Wegstein, Andrea Zielinski
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

TextGrid is a new Grid project in the framework of the German D-Grid initiative, with the aim to deploy Grid technologies for humanities scholars working on historical (German) texts. Its two roots, humanities computing and eScience (Grid computing used by research together with modern communication technologies), are the basis for TextGrid to provide pioneer work in eHumanities. After summarizing Humanities Computing and modern network technologies, community expectations in the fields of philological edition and other application areas are set forth, from which functional requirements such as modularity, distribution, etc. are distilled. The first version of the TextGrid architecture was designed in accordance with these requirements, and focuses on openness by standard conformance and encapsulation. It provides storage Grid services via a pure Web Services interface to dedicated Web Services tools for different aspects of text processing, analysis and retrieval. This platform aims to provide easily usable tools for scholars, but also specifies interfaces for external program developers to add functionality.
Lifelong Competence Development: Towards a Common Metadata Model for Competencies Description - The Case Study of Europass Language Passport
Authors: Pythagoras Karampiperis, Demetrios Sampson, Demetrios Fytros
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Competence-based approaches in the field of formal or non-formal education and training are becoming more common and appear to offer the opportunity to develop programmes that meet needs of learners, trainers and potential employers. To support the provision of competence-based learning services, it is necessary to maintain a record of an individual's competences in a persistent and standard way. In this paper, we investigate the problem of defining a common metadata model for the description of competencies based on the application of the current state-of-the-art specification (namely, the IMS RDCEO) in describing competencies, in a real case study, that is, the EuroPass Language Passport. To this end, we identify four open issues on the description capabilities of the IMS RDCEO specification, and propose possible extensions to its information model, demonstrating their application in practice.
Learning Temporal Sequence Model from Partially Labeled Data
Authors: Yifan Shi, Aaron Bobick, Irfan Essa
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Graphical models are often used to represent and recognize activities. Purely unsupervised methods (such as HMMs) can be trained automatically but yield models whose internal structure - the nodes - are difficult to interpret semantically. Manually constructed networks typically have nodes corresponding to sub-events, but the programming and training of these networks is tedious and requires extensive domain expertise. In this paper, we propose a semi-supervised approach in which a manually structured, Propagation Network (a form of a DBN) is initialized from a small amount of fully annotated data, and then refined by an EM-based learning method in an unsupervised fashion. During node refinement (the M step) a boosting-based algorithm is employed to train the evidence detectors of individual nodes. Experiments on a variety of data types - vision and inertial measurements - in several tasks demonstrate the ability to learn from as little as one fully annotated example accompanied by a small number of positive but non-annotated training examples. The system is applied to both recognition and anomaly detection tasks.
Good advice for type-directed programming aspect-oriented programming and extensible generic functions
Authors: Geoffrey Washburn, Stephanie Weirich
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming (2006)

Type-directed programming is an important idiom for software design. In type-directed programming the behavior of programs is guided by the type structure of data. It makes it possible to implement many sorts of operations, such as serialization,traversals, and queries,only once and without needing to continually revise their implementations as new data types are defined.Type-directed programming is the basis for recent research into "scrapping" tedious boilerplate code that arises in functional programming with algebraic data types. This research has primarily focused on writing type-directed functions that are closed to extension. However, Lämmel and Peyton Jones recently developed a technique for writing openly extensible type-directed functions in Haskell by making clever use of type classes. Unfortunately, this technique has a number of limitations such as the inability to write specialized cases for existential or nested data types and function types becoming too constrained to be used as first-class functions.We present an alternate approach to writing openly extensible type-directed functions by using the aspect-oriented programming features provided by the language AspectML. Our solution not only avoids the limitations present in Lämmel and Peyton Jones's technique, but also allows type-directed functions to be extended at any time with cases for types that were not even known at compiletime. This capability is critical to writing programs that make use of dynamic loading or runtime type generativity.
Checking Integrity Constraints - How it Differs in Centralized, Distributed and Parallel Databases
Authors: Hamidah Ibrahim
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

An important aim of a database system is to guarantee database consistency, which means that the data contained in a database is both accurate and valid. Integrity constraints represent knowledge about data with which a database must be consistent. The process of checking constraints to ensure that update operations or transactions which alter the database will preserve its consistency has proved to be extremely difficult to implement, particularly in distributed and parallel databases. In distributed databases the aim of the constraint checking is to reduce the amount of data needing to be accessed, the number of sites involved and the amount of data transferred across the network. In parallel databases the focus is on the total execution time taken in checking the constraints. This paper highlights the differences between centralized, distributed and parallel databases with respect to constraint checking.
Design of Novel Reversible Carry Look-Ahead BCD Subtractor
Authors: Himanshu Thapliyal, Sumedha K. Gupta
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

IEEE 754r is the ongoing revision to the IEEE 754 floating point standard. A major enhancement to the standard is the addition of decimal format, thus the design of BCD arithmetic units is likely to get significant attention. Firstly, this paper introduces a novel carry look-ahead BCD adder and then builds a novel carry look-ahead BCD subtractor based on it. Secondly, it introduces the reversible logic implementation of the proposed carry look-ahead BCD subtractor. We have tried to design the reversible logic implementation of the BCD Subtractor optimal in terms of number of reversible gates used and garbage outputs produced. Thus, the proposed work will be of significant value as the technologies mature.
K-means clustering versus validation measures: a data distribution perspective
Authors: Hui Xiong, Junjie Wu, Jian Chen
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation is needed to reveal whether and how the data distributions can have the impact on the performance of K-means clustering. Indeed, in this paper, we revisit the K-means clustering problem by answering three questions. First, how the "true" cluster sizes can make impact on the performance of K-means clustering? Second, is the entropy an algorithm-independent validation measure for K-means clustering? Finally, what is the distribution of the clustering results by K-means? To that end, we first illustrate that K-means tends to generate the clusters with the relatively uniform distribution on the cluster sizes. In addition, we show that the entropy measure, an external clustering validation measure, has the favorite on the clustering algorithms which tend to reduce high variation on the cluster sizes. Finally, our experimental results indicate that K-means tends to produce the clusters in which the variation of the cluster sizes, as measured by the Coefficient of Variation(CV), is in a specific range, approximately from 0.3 to 1.0.
Optimization of Nested XQuery Expressions with Orderby Clauses
Authors: Song Wang, Elke A. Rundensteiner, Murali Mani
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

XQuery, the defacto XML query language, is a functional language with operational semantics, which precludes the direct application of classical query optimization techniques. The features of XQuery, such as nested expressions and ordered semantics, further aggravate this situation. The appropriate extension of existing optimization techniques to XQuery processing hence represents an important and non-trivial task. We propose an algebraic rewriting technique of nested XQuery expressions containing explicit orderby clauses. Unlike prior work, this technique enables the optimization of nested XQuery expressions not only with set but also with ordered sequence semantics. Our technique is based on two steps. First, we perform algebraic query unnesting. Second, we apply query minimization techniques that exploit pairwise XPath set containment after pulling up ordersensitive operations. We illustrate how our proposed technique is able to not only successfully tackle the XQuery logical optimization problem solved in the NEXT framework, but in addition to also to correctly support ordered semantics. We have implemented the proposed optimization techniques on top of the XAT algebraic framework in our RainbowCore project. We show the performance gain achievable by our approach using an experimental study with the RainbowCore engine.
Effectiveness of simple memory models for performance prediction
Authors: I. Chihaia, T. Gross
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

Many situations call for an estimation of the execution time of applications, e.g., during design or evaluation of computer systems. In this paper we focus on large applications where the execution times heavily depend on the performance of the memory system. Since such applications are computationally expensive, direct simulation is not an option and an analytical model is called for. This paper addresses this problem by developing and evaluating two simple analytical models. These models focus on an application's interaction with the memory system. Applications are characterized by their memory access types. A regular application has continuous and stride memory accesses. An irregular application has three memory access types: continuous accesses, accesses within the same L1/L2 cache line, and random accesses. The analytical models are combined with results from micro-benchmarking or with appropriate performance estimates of memory accesses to predict application performance, either on real or future machines. We apply these models to executions of CHARMM (Chemistry at HARvard Molecular Mechanics) - a scientific application written in FORTRAN, SMV (Symbolic Model Verifier) - coded in C++. For all three applications, the approaches described here produce results with 5% accuracy on average (compared to the effective run-time measured on a real SPARC system).
Comment on "realization of series and parallel R-L and C-D impedances using single differential voltage current conveyor"
Authors: Erkan Yuce
Venue: Analog Integrated Circuits and Signal Processing (2006)

The comment is related to the recently published paper given in [1] dealing with the implementation of series and parallel R-L and C-D impedances using a single differential voltage current conveyor (DVCC). Nevertheless, straightforward analysis of the circuit in Fig. 3(b) of [1] and also given in Fig. 1 shows that it has a problem because it makes its input voltage V in = 0. Therefore, it can not realize parallel (---L)---(---R) simulator as claimed in [1].Alternatively, a circuit given in Fig. 2 for realizing parallel (---L)---(---R) simulator employing a single minus-type DVCC (DVCC---) and a minimum number of passive components is proposed. The introduced circuit employs a grounded capacitor, and requires no critical component matching constraints thus it is suitable for fully integrated circuit technology. If plus-type DVCC (DVCC+) is replaced instead of the DVCC---, this proposed simulator can realize parallel (L)---(R) simulator. Fig. 1 The circuit proposed in Fig. 3(b) of [1] Fig. 2 Presented circuit for realizing parallel (+L)---(+R) and parallel (L)---(R) simulators depending on the type of the DVCC
High performance silicon MEMS for niche market applications
Authors: Andrès E. Lagos
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

Three major business areas constitute the bulk of the Company's activities: inertial sensors, MEMS for optical & non-optical applications, foundry services. Continuous improvement of device performance linked to novel developments open the way to new niche MEMS markets. Devices responding to harsh environment requirements is a serious consideration when designing new products. Main features of selected devices are discussed and market prospects are presented.
An fMRI Study on the Time-Limited Role of the Medial Temporal Lobe in Long-Term Topographical Autobiographic Memory
Authors: Kazuhisa Niki, Jing Luo
Venue: Journal of Cognitive Neuroscience (2002)

The time-limited role of the medial temporal lobe (MTL) in human long-term memory is well known. However, there is still no direct neuroimaging evidence to confirm it. In this fMRI study, nine subjects were scanned while asked to recall the places they visited more than seven years ago (remote memories); and the places they visited recently (recent memories). We observed robust and dominant MTL activity peaking in the left parahippocampal gyrus when recent memories were contrasted with remote memories. This result provided direct evidence for the time-limited role of the MTL in long-term topographical autobiographic memory. Further analysis revealed that this MTL activity was not due to the fact that the retrieval of recent memories was accompanied by more details. When detailed recent memories were contrasted with detailed remote memories, there was still MTL activity peaking in the left parahippocampal gyrus. The effects of details in remote memories are also discussed.
A Combined Memory Compression And Hierarchical Motion Estimation Architecture For Video Encoding In Embedded Systems
Authors: Roberto R. Osorio, Javier D. Bruguera
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

In this paper a new technique is presented that combines memory compression in video encoders with fast and efficient motion estimation (ME). This technique is mainly oriented to embedded systems, which demand simple and power aware algorithms. Video encoding needs increasing amounts of memory for storing reference pictures. Memory compression allows reducing the footprint of the application, lowering the total implementation cost. In this paper, we combine memory compression and hierarchical ME so that the overhead associated to implement both techniques is shared. Thus, a net gain in processing speed is obtained, while reducing costs and power consumption.
u38: A Framework for Database-Supported Enterprise Document-Retrieval
Authors: Christoph Mangold, Holger Schwarz, Bernhard Mitschang
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

In enterprises, information is encoded in documents and databases. Logically, the information in both worlds is tightly connected, however, on the system level there is usu- ally a large gap. In this paper, we propose a framework that improves document retrieval by exploiting available enter- prise databases. In particular, we use database information to model the context of documents and incorporate this con- text in our search framework. We present our framework architecture, its components and its major interfaces. The framework can be configured and enhanced at well-defined points and, hence, can easily be customized to other do- mains. We furthermore evaluate its core components. Our experiments show that the context-aware approach signifi- cantly improves the quality of search results.
SAHA: A Self-Adaptive Hierarchical Allocation Strategy for Heterogeneous Grid Environments
Authors: Zhaobin Liu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The allocation of data and I/O operations into nodes in a data Grid environment is a critical issue. Especially, the Grid nodes may have either different performance or different capacity in heterogeneous circumstance. If the system undergoes changes (for example, due to the insertions or removals of disks from Grid nodes), it may be necessary to redistribute the data object with a low time and space complexity. Previous techniques mainly focus on handling these requirements only in part. For instance, some standard hashing and heuristic schedules can be used to decrease the data replacement time, but they usually do not adapt well to a change in the capabilities (both the capacity and performance of Grid nodes). In this paper, we presented a novel self-adaptive hierarchical allocation (called SAHA) based on nodes capacity to satisfy the load balancing. Furthermore, we illustrated the performance evaluation of our placement strategies while we allowed the various test conditions to be changed.