ppxscal/embedding_network huggingface dataset:
Decoding Syllables from Human fMRI Activity
Authors: Yohei Otaka, Rieko Osu, Mitsuo Kawato, Meigen Liu, Satoshi Murata, Yukiyasu Kamitani
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Language plays essential roles in human cognition and social communication, and therefore technology of reading out speech using non-invasively measured brain activity will have both scientific and clinical merits. Here, we examined whether it is possible to decode each syllable from human fMRI activity. Four healthy subjects participated in the experiments. In a decoding session, the subjects repeatedly uttered a syllable presented on a screen at 3Hz for a 12-s block. Nine different syllables are presented in a single experimental run which was repeated 8 times. We also specified the voxels which showed articulation-related activities by utterance of all the syllables in Japanese phonology in a conventional task-rest sequence. Then, we used either all of these voxels or a part of these voxels that exist in anatomically specified ROIs (M1, cerebellum) during decoding sessions as data samples for training and testing a decoder (linear support vector machine) that classifies brain activity patterns for different syllables. To evaluate decoding performance, we performed cross-validation by testing the sample of one decoding session using a decoder trained with the samples of the remaining sessions. As a result, syllables were correctly decoded at above-chance levels. The results suggest the possibility of using non-invasively measured brain activity to read out the intended speech of disabled patients in speech motor control.
A Selection Method of ETF's Credit Risk Evaluation Indicators
Authors: Ying Zhang, Zongfang Zhou, Yong Shi
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

This work applied data analysis method of attribute reduction to the credit risk evaluation indicators selection of the emerging technical firms (ETF), and constructed the ETF's credit risk evaluation indicators system. Furthermore, the utilization the distinct matrix method was carried out the confirmation to the reduction result. Finally the 7 ETF's data was used to carry out the analysis in the western of China by attribute reduction and their core attribute was obtained.
Convergence radius and guaranteed error bound for the Volterra series expansion of finite dimensional quadratic systems
Authors: Thomas Helie, Beatrice Laroche
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

In this paper, the Volterra series decomposition of a class of quadratic, time invariant single-input finite dimensional systems is considered. These systems are represented using Volterra series. The convergence of the series towards a weak solution is proven. An explicit and computable lower bound of the radius of convergence is obtained. Moreover, guaranteed error bounds in L∞(R+) are given for the truncated series. These results are illustrated on numerical simulations performed on academic examples.
Identification in sensor networks
Authors: Constantin Volosencu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

In the last years sensor networks have proved their huge viability in the real world, even if their resources in terms of energy, memory, computational power and bandwidth are strictly limited. One of the important problems related to the usage of wireless sensor networks in harsh environments is the identification of the states of the physical variables in the field, based on the measurements provided by the sensors. The sensor networks allow the usage of the multivariable estimation techniques in distributed systems. The paper presents a short survey of some characteristics of the sensor networks, distributed parameters systems and identification techniques. An examples of application of modeling of distributed systems in sensor networks and identification based on multivariable identification with auto-regression and neural network is presented.
Model-Integrated Development of Cyber-Physical Systems
Authors: Gabor Karsai, Janos Sztipanovits
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

Cyber-physical systems represent a new class of systems that integrate physics with computation. Their correct design is frequently of great importance as they are applied in safety- or business-critical contexts. This paper introduces a model-integrated development approach that addresses the development needs of such systems through the pervasive use of models. A complete model-based view is proposed that covers all aspects of the hardware and software components, as well as their interactions. Early experiments and work in progress are also reported.
Classic and Quantum Error Correcting Codes
Authors: Santos González, Consuelo Martínez, Alejandro P. Nicolás
Venue: Proceedings of the 2nd international Castle meeting on Coding Theory and Applications (2008)

Algebraic methods play an important role in coding theory. For instance, there are many connections between codes and groups. In this paper we will present two results that show different applications of algebraic methods in coding theory. One of them refers to the classical context and another one to the quantum error correcting theory. These results can be found in [5] and [13] respectively, where proofs and more details can be found.
Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions
Authors: Mihai Oltean, Oana Muntean
Venue: Proceedings of the 1st international workshop on Optical SuperComputing (2008)

In this paper we summarize the existing principles for building unconventional computing devices that involve delayed signals for encoding solutions to NP-complete problems. We are interested in the following aspects: the properties of the signal, the operations performed within the devices, some components required for the physical implementation, precision required for correctly reading the solution and the decrease in the signal's strength. Six problems have been solved so far by using the above enumerated principles: Hamiltonian path, travelling salesman, bounded and unbounded subset sum, Diophantine equations and exact cover. For the hardware implementation several types of signals can be used: light, electric power, sound, electro-magnetic etc.
Modelling Organ Deformation Using Mass-Springs and Tensional Integrity
Authors: Pierre-Frédéric Villard, Wesley Bourne, Fernando Bello
Venue: Proceedings of the 4th international symposium on Biomedical Simulation (2008)

In this paper we propose a new framework for deformation modelling based on a combined mass spring and tensional integrity method. The synergy between balanced tension and compression components offered by the tensegrity model helps the deforming organ retain its shape more consistently. We chose the diaphragm as our test object given its heterogeneous composition (muscle and tendon) and its importance in radiotherapy and other interventional procedures. Diaphragm motion can significantly influence surrounding organs such as lungs and liver. Our system permits the control of simulated diaphragm motion and deformation by at least two independent parameters.
Multimedia adaptation in ubiquitous environments: benefits of structured multimedia documents
Authors: Pablo Cesar, Ishan Vaishnavi, Ralf Kernchen, Stefan Meissner, Cristian Hesselman, Matthieu Boussard, Antonietta Spedalieri, Dick C.A. Bulterman, Bo Gao
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

This paper demonstrates the advantages of using structured multimedia documents for session management and media distribution in ubiquitous environments. We show how document manipulations can be used to perform powerful operations such as content to context adaptation and presentation continuity. When consuming media in ubiquitous environments, where the set of devices surrounding a user may change, dynamic media adaptation and session transfer become primary requirements. This paper presents a working system, based on a representative scenario, in which multimedia content is distributed and adapted to a movable user to best suit his/her contextual situation. The implemented scenario includes the following scenes: content selection using a personal mobile phone, content distribution to the most suitable device according to the user's context, and presentation continuity when the user moves to another location. This paper introduces the underlying document manipulations that turn the scenario into a working system.
Discrimination of Concurrent Vibrotactile Stimuli
Authors: Eric Groen, Marjolaine Oosterbeek, Alexander Toet, Ignace Hooge
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

We investigated the detection of vibrotactile targets against a background of concurrent non-targets, presented by eight tactors equally distributed in a horizontal band around the torso. Stimuli consisted of temporal activation patterns. Single targets (T) were presented among two to seven non-targets (N). The similarity between targets and non-targets was varied between low and high. For target-present trials the response times increased with set size, indicating a serial discrimination process. For target-absent trials the response times did not vary with the number of stimulus items, indicating a parallel discrimination process. The results showed no effect of T-N similarity. The results suggest that tactile search is not comparable to visual search.
Unfolding Abstract Datatypes
Authors: Jeremy Gibbons
Venue: Proceedings of the 9th international conference on Mathematics of Program Construction (2008)

We argue that abstract datatypes -- with public interfaces hiding private implementations -- represent a form of codata rather than ordinary data, and hence that proof methods for corecursive programs are the appropriate techniques to use for reasoning with them. In particular, we show that the universal properties of unfold operators are perfectly suited for the task. We illustrate with solutions to two problems the solution to a problem in the recent literature.
Integrated approach to real-time biosurveillance in a federated data source environment
Authors: Shamir N. Mukhi
Venue:  (2007)

Health surveillance can be viewed as an ongoing collection, analysis, interpretation and dissemination of health related data for use in design, development, deployment, and evaluation of a given health system in multiple spheres (ex: animal, human, environment). As we move into a sophisticated technologically advanced era, there is a need for cost-effective and efficient health surveillance methods and systems that will rapidly identify potential bioterrorism attacks and infectious disease outbreaks. The main objective of such methods and systems would be to reduce the impact of an outbreak by enabling appropriate officials to detect it quickly and implement timely and appropriate interventions. Identifying an outbreak and/or potential bioterrorism attack days to weeks earlier than traditional surveillance methods would potentially result in a reduction in morbidity, mortality, and outbreak associated economic consequences. Proposed here are methods for achieving an integrated health surveillance system. Specifically, the research looks at a framework that would enable a user and/or a system to interpret the anomaly detection results generated via multiple aberration detection algorithms with some indication of confidence. Ideally, a framework takes into account the relationships between algorithms and produces an unbiased confidence measure for identification of start of an outbreak. Keywords. Health, disease surveillance, outbreak, bioterrorism, federated sources, aberration detection, syndromic, infectious disease. 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 Query Expansion Algorithm Based on Phrases Semantic Similarity
Authors: Yongli Liu, Chao Li, Pin Zhang, Zhang Xiong
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

During the indexing process of traditional search engine, web pages become a list of terms, but single term cannot represent the rich content of web pages, which makes information retrieval methods mainly based on terms matching often result in depressed precision. This paper proposes a novel query expansion technique that has phrases as its expansion unit. Phrases typically have a higher information content and a smaller degree of ambiguity than their constituent words, and therefore represent the concepts expressed in text more accurately than single terms. This method extracts key phrases from original results, and calculates the semantic similarity between the query phrase and each phrase extracted using the semantic similarity algorithm based on WordNet, and then expands the query with the most similar phrases to search again. Experimental results show that the proposed algorithm can provide more precision than the traditional query expansion methods.
Data Protection in Memory Using Byte Reordering
Authors: Hyun Jun Jang, Dae Won Hwang, Eul Gyu Im
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

With the explosive uses of Internet, personal information can be exposed to attackers through various attacks. API hooking based mechanisms or virtual machine based mechanisms are proposed to protect personal data stored in the memory. But these mechanisms require another application program and attackers can get around by developing their own device drivers.We propose a new memory reorganizing mechanism to protect memory. In our proposed mechanism, a user can define his or her own data types and can store data using his or her own data types so that data formats stored in actual memory have different forms.
Improving the Efficiency of Counting Defects by Learning RBF Nets with MAD Loss
Authors: Ewaryst Rafajłowicz
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The method of using a lateral histogram for evaluating the number of holes (e.g., defects) from images is known to be fast but rather inaccurate. Our aim is to propose a method of improving its performance by learning, but keeping the speed of the original method. This task is accomplished by considering a multiclass pattern recognition problem with linearly ordered labels and a loss function, which measures absolute deviations of decisions from true classes.
The rhetoric of interactive art works
Authors: Serge Bouchardon
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

In this contribution, I identify rhetorical figures that are specific to interactive writing: figures of manipulation (meaning gestual manipulation). It's a category on its own, along with figures of diction, construction, meaning and thought. In many computer art works, the artists use the figures of manipulation to introduce a loss of grasp. What is emphasized in such figures is the coupling action/behavior, which could be considered as a basic unit in interactive writing. This coupling can be conceived independently from the medias it relies on. Thus, an a-media approach seems relevant when attempting to define an art of rhetoric in interactive writing.
Facility Location Problems: A Parameterized View
Authors: Michael Fellows, Henning Fernau
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, from the viewpoints of approximation, heuristics, linear programming, etc. We add a new facet by initiating the study of some of these problems from a parametric point of view. Moreover, we exhibit some less obvious applications of these algorithms in the processing of semistructured documents and in computational biology.
Coordination of autonomous underwater vehicles for acoustic image acquisition
Authors: Indraneel S. Kulkarni, Dario Pompili
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

Underwater Acoustic Sensor Networks (UW-ASNs) consist of stationary sensors or Autonomous Underwater Vehicles (AUVs) like propeller-driven vehicles and gliders that are equipped with sensors for performing collaborative monitoring tasks. In this paper, a task optimization framework for image acquisition using a fleet of underwater gliders and AUVs is proposed. The objective of the framework is to form the best possible team and to find the optimal trajectory to reach the selected target object. In this paper, the use of a team of underwater gliders and AUVs for acquiring still images of underwater objects is envisaged. Research specific to this area has been limited. Hence, a framework based on energy minimization for a team of gliders to complete the mission in given time bound is proposed. Further, performance of propeller-driven AUVs and gliders is compared to prove the energy efficiency of the gliders over AUVs for missions with large time bound.
A Verification Approach for System-Level Concurrent Programs
Authors: Matthias Daum, Jan Dörrenbächer, Mareike Schmidt, Burkhart Wolff
Venue: Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments (2008)

Though the verification of operating systems is an active research field, a verification method is still missing that provides both, the proximity to practically used programming languages such as C and a realistic model of concurrency, i.e. a model that copes with the granularity of atomic operations actually used in a target machine.Our approach serves as the foundation for the verification of concurrent programs in C0 --- a C fragment enriched by kernel communication primitives --- in a Hoare-Logic. C0 is compiled by a verified compiler into assembly code representing a cooperative concurrent transition system. For the latter, it is shown that it can actually be executed in a true concurrent way reflecting the C0 semantics.
An Overcomplete ICA Algorithm by InfoMax and InfoMin
Authors: Yoshitatsu Matsuda, Kazunori Yamaguchi
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

It is known that the number of the edge detectors significantly exceeds that of input signals in the visual system of the brains. This phenomenon has been often regarded as overcomplete independent component analysis (ICA) and some generative models have been proposed. Though the models are effective, they need to assume some ad-hoc prior probabilistic models. Recently, the InfoMin principle was proposed as a comprehensive framework with minimal prior assumptions for explaining the information processing in the brains and its usefulness has been verified in the classic non-overcomplete cases. In this paper, we propose a new ICA contrast function for overcomplete cases, which is deductively derived from the the InfoMin and InfoMax principles without any prior models. Besides, we construct an efficient fixed-point algorithm for optimizing it by an approximate Newton's method. Numerical experiments verify the effectiveness of the proposed method.
Vehicles dynamic control, using fuzzy logic
Authors: Marian Petrescu, Gheorghe Livint, Dumitru Lucache
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

This paper presents a fuzzy control structure for an autonomous vehicle steering system. The vehicle nonlinear mathematical model is replaced by some local linear systems that are defined around of the given operation points, and the reunion of the linear models determines a Takagi Sugeno fuzzy model. A state negative feedback has been used for every local linear system and a Takagi-Sugeno type controller has been synthesized for a set of local linear models. Finally, the behavior of the vehicle dynamic control with the Takagi-Sugeno controller has been analyzed by simulation in Matlab environment by changing the stiffness coefficients.
Learning to Detect Adverse Traffic Events from Noisily Labeled Data
Authors: Tomáš Šingliar, Miloš Hauskrecht
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Many deployed traffic incident detection systems use algorithms that require significant manual tuning. We seek machine learning incident detection solutions that reduce the need for manual adjustments by taking advantage of massive databases of traffic sensor network measurements. First, we show that a rather straightforward supervised learner based on the SVM model outperforms a fixed detection model used by state-of-the-art traffic incident detectors. Second, we seek further improvements of learning performance by correcting misaligned incident times in the training data. The misalignment is due to an imperfect incident logging procedure. We propose a label realignment model based on a dynamic Bayesian network to re-estimate the correct position (time) of the incident in the data. Training on the automatically realigned data consistently leads to improved detection performance in the low false positive region.
Divide and conquer: false-name manipulations in weighted voting games
Authors: Yoram Bachrach, Edith Elkind
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

In this paper, we study false-name manipulations in weighted voting games. Weighted voting is a well-known model of cooperation among agents in decision-making domains. In such games, each of the players has a weight, and a coalition of players wins the game if its total weight exceeds a certain quota. While a player's ability to influence the outcome of the game is related to its weight, it is not always directly proportional to it. This observation has led to the concept of a power index, which is a measure of an agent's "real power" in this domain. One prominent power index is the Shapley--Shubik index, which has been widely used to analyze political power. This index is equal to the Shapley value of the player in the game. If an agent can alter the game so that his Shapley--Shubik index increases, this will mean that he has gained power in the game. Moreover, the Shapley value is often used to distribute the gains of the grand coalition. In this case, this alteration will also increase the agent's payoffs. One way in which an agent can change the game (and hence his payoffs) is by distributing his weight among several false identities. We call this behavior a false-name manipulation. We show that such manipulations can indeed increase an agent's power, as determined by the Shapley-Shubik power index, or his payoffs, as given by the Shapley value. We provide upper and lower bounds on the effects of such manipulations. We then study this issue from the computational perspective, and show that checking whether a beneficial split exists is NP-hard. We also discuss efficient algorithms for restricted cases of this problem, as well as randomized algorithms for the general case.