ppxscal/embedding_network huggingface dataset:
Null Subspace Analysis for Spectral Unmixing in Hyperspectral Remote Sensing
Authors: Wenfei Luo, Liang Zhong, Bing Zhang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Hyperspectral remote sensing is a new and fast growing remote sensing technology that is currently being investigated by researchers and scientists. A great challenge in hyperspectral image analysis is decomposing a mixed pixel into a collection of endmembers and their corresponding abundance fractions, namely spectral unmixing. This paper introduces null subspace to the process of spectral unmixing. Null subspace is the orthogonal complement space of the subspace spanned by some endmembers. Take advantage of null subspace, this paper presents a solution of obtaining the distance from a pixel to subspace in the null subspace form. By analysis on the null subspace, all endmembers in the hyperspectral image can be extracted by the maximal distance criterion and the abundance can be obtained by the way of distance proportion. In the experiment, it shows that null subspace provides a fast and effective way for spectral unmixing.
Concept Similarity and Related Categories in SearchSleuth
Authors: Frithjof Dau, Jon Ducrou, Peter Eklund
Venue: Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning (2008)

SearchSleuth is a program developed to experiment with the automated local analysis of Web search using formal concept analysis. SearchSleuth extends a standard search interface to include a conceptual neighborhood centered on a formal concept derived from the initial query. This neighborhood of the concept derived from the search terms is decorated with its upper and lower neighbors representing more general and specialized concepts respectively. In SearchSleuth, the notion of related categories --- which are themselves formal concepts --- is also introduced. This allows the retrieval focus to shift to a new formal concept called a sibling. This movement across the concept lattice needs to relate one formal concept to another in a principled way. This paper presents the issues concerning exploring and ordering the space of related categories.
Efficient E-Matching for SMT Solvers
Authors: Leonardo Moura, Nikolaj Bjørner
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrating theory reasoning. However, for numerous applications from program analysis and verification, the ground fragment is insufficient, as proof obligations often include quantifiers. A well known approach for quantifier reasoning uses a matching algorithm that works against an E-graph to instantiate quantified variables. This paper introduces algorithms that identify matches on E-graphs incrementally and efficiently. In particular, we introduce an index that works on E-graphs, called E-matching code trees that combine features of substitution and code trees, used in saturation based theorem provers. E-matching code trees allow performing matching against several patterns simultaneously. The code trees are combined with an additional index, called the inverted path index, which filters E-graph terms that may potentially match patterns when the E-graph is updated. Experimental results show substantial performance improvements over existing state-of-the-art SMT solvers.
Tail Asymptotics for Discrete Event Systems
Authors: Marc Lelarge
Venue: Discrete Event Dynamic Systems (2008)

In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of its performances. We concentrate on the logarithmic tail asymptotics of the stationary response time for a class of networks that admit a representation as (max,plus)-linear systems in a random medium. We are able to derive analytic results when the distribution of the holding times are light-tailed. We show that the lack of independence may lead in dimension bigger than one to non-trivial effects in the asymptotics of the sojourn time. We also study in detail a simple queueing network with multipath routing.
The role of spatial abilities and age in performance in an auditory computer navigation task
Authors: Richard Pak, Sara J. Czaja, Joseph Sharit, Wendy A. Rogers, Arthur D. Fisk
Venue: Computers in Human Behavior (2008)

Age-related differences in spatial ability have been suggested as a mediator of age-related differences in computer-based task performance. However, the vast majority of tasks studied have primarily used a visual display (e.g., graphical user interfaces). In the current study, the relationship between spatial ability and performance in a non-visual computer-based navigation task was examined in a sample of 196 participants ranging in age from 18 to 91. Participants called into a simulated interactive voice response system and carried out a variety of transactions. They also completed measures of attention, working memory, and spatial abilities. The results showed that age-related differences in spatial ability predicted a significant amount of variance in performance in the non-visual computer task, even after controlling for other abilities. Understanding the abilities that influence performance with technology may provide insight into the source of age-related performance differences in the successful use of technology.
A Fuzzy Comprehensive Clustering Method
Authors: Shuliang Wang, Xinzhou Wang
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

Fuzzy comprehensive evaluation cannot reasonably differentiate the close membership values, e.g. 0.70 and 0.69. When the results have to be decided on the basis of maximum fuzzy membership value, some related information among similar objects may be neglected. At the same time, supervised fuzzy clustering analysis selects the threshold according to subjective experience. But different users may give different thresholds, and different thresholds may further get different clustering results. Integrating both fuzzy comprehensive evaluation and fuzzy clustering analysis in a unified way, this paper proposes a fuzzy comprehensive clustering method based on the maximum remainder algorithms and maximum characteristics algorithms. First, the principle of fuzzy comprehensive clustering is given. Based on the membership matrix of fuzzy comprehensive evaluation, fuzzy similar matrix is generated. Then a fuzzy equivalent matrix is produced from the fuzzy similar matrix. According to the fuzzy equivalent matrix, fuzzy clustering is implemented via the maximum remainder algorithms on the basis of fuzzy confidence level. And the grades of the resulting clusters are computed by using the maximum characteristics algorithms. Finally, a case study is given on land grading in Nanning city, the results of which show the proposed fuzzy comprehensive clustering method is able to overcome the disadvantages of either fuzzy comprehensive evaluation or fuzzy clustering analysis.
Strategic betting for competitive agents
Authors: Liad Wagman, Vincent Conitzer
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

In many multiagent settings, each agent's goal is to come out ahead of the other agents on some metric, such as the currency obtained by the agent. In such settings, it is not appropriate for an agent to try to maximize its expected score on the metric; rather, the agent should maximize its expected probability of winning. In principle, given this objective, the game can be solved using game-theoretic techniques. However, most games of interest are far too large and complex to solve exactly. To get some intuition as to what an optimal strategy in such games should look like, we introduce a simplified game that captures some of their key aspects, and solve it (and several variants) exactly. Specifically, the basic game that we study is the following: each agent i chooses a lottery over nonnegative numbers whose expectation is equal to its budget bi. The agent with the highest realized outcome wins (and agents only care about winning). We show that there is a unique symmetric equilibrium when budgets are equal. We proceed to study and solve extensions, including settings where agents must obtain a minimum outcome to win; where agents choose their budgets (at a cost); and where budgets are private information.
Introduction to the ICCS 2007 Workshop on Dynamic Data Driven Applications Systems
Authors: Frederica Darema
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

This is the 5th International Workshop on Dynamic Data Driven Applications Systems (DDDAS), organized in conjunction with ICCS. The DDDAS concept entails the ability to dynamically incorporate data into an executing application simulation, and in reverse, the ability of applications to dynamically steer measurement processes. Such dynamic data inputs can be acquired in real-time on-line or they can be archival data. DDDAS is leading to new capabilities by improving applications modeling and systems management methods, augmenting the analysis and prediction capabilities of simulations, improving the efficiency of simulations and the effectiveness of measurement systems. The scope of the present workshop provides examples of research and technology advances enabled through DDDAS and driven by DDDAS. The papers presented in this workshop represent ongoing multidisciplinary research efforts by an international set of researchers from academe, industry, national and research laboratories.
Telling Time by Vibration
Authors: Sampo Töyssy, Jukka Raisamo, Roope Raisamo
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Touch is acknowledged as an important and often underutilized sense in human-computer interaction. In this study a method to present time with vibrotactile pulse sequences was developed and tested. The study answers two questions, namely how to communicate the time with vibrotactile signals only, and how can people understand the signals with and without training? Two experiments were conducted to reveal how accurately people can read time from simple sequences of vibration, and how training affects the recognition rate. It was found that the average recognition rate for untrained participants was 80% while a short training increased it to 88%. Generally, minute part in the vibrotactile sequence caused most errors both with and without practice compared to hour part.
Open Educational Topic Maps: A Text-Oriented Perspective
Authors: Lars Johnsen
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

This article makes the case for a text-oriented approach to the creation and presentation of open Topic Maps based information architectures for e-learning. More specifically, it argues that importance should be attached to the communicative aspects of such architectures, in particular consistency, cohesion and coherence. The article further suggests that one way of keeping this aim in focus is to work with standardized text modules as communication vehicles. To exemplify more concretely the role that standardized text might play, two specific sets of tools for modular text production are briefly discussed, namely CNXML and Structured Writing. Finally, it is demonstrated how a descriptive framework such as Rhetorical Structure Theory may be used to support the analysis, design and creation of communicative structures in open educational Topic Maps architectures.
New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
Authors: Helger Lipmaa
Venue: Proceedings of the 11th international conference on Information Security (2008)

We construct two simple families of two-message (n,1)-oblivious transfer protocols based on degree-t homomorphic cryptosystems with the communication of respectively 1 + ¿n/t¿ and 3 + ¿n/(t + 1)¿ ciphertexts. The construction of both families relies on efficient cryptocomputable conditional disclosure of secret protocols; the way this is done may be of independent interest. The currently most interesting case t = 2 can be based on the Boneh-Goh-Nissim cryptosystem. As an important application, we show how to reduce the communication of virtually any existing oblivious transfer protocols by proposing a new related communication-efficient generic transformation from computationally-private information retrieval protocols to oblivious transfer protocols.
Models of Computation: A Tribute to Ugo Montanari's Vision
Authors: Roberto Bruni, Vladimiro Sassone
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

Ugo's research activity in the area ofModels of Computation (MoC, for short) has been prominent, influential and broadly scoped. Ugo's trademark is that undefinable ability to understand and distill computational aspects into new models as if you were reading them out of some evident connection between well-know models: only, most often, that connection is really visible only after Ugo shows the way. Like experienced sailors have trusted compasses and sextants to help them find the best routes to harbour, Ugo relies on a bag of favourite tools which he has used along the years to deliver a variety of contributions to the MoC area. To mention just three (in alphabetic order): algebraic techniques, concurrency theory, and unification mechanisms.In this introductory contribution we would like to recall some of the influentialMoC models put forward by Ugo which cut across the three approaches. Before doing that, it is worth devoting some space to discuss the three aspects separately. Notably, the use of category theory is a pervasive common trait.
A Figure Image Processing System
Authors: Linlin Li, Shijian Lu, Chew Lim Tan
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

Patent document images maintained by the U.S. patent database have a specific format, in which figures and descriptions are separated into different pages. This makes it difficult for users to refer to a figure while reading the description or vice versa. The system introduced in this paper is to prepare these patent documents for a friendly browsing interface. The system is able to segment an imaged page with several figures into individual figures and extract caption and label information from the figure. After obtaining captions and labels, figures and the relevant description are linked together, and thus users could easily refer from a description to the figure or vice versa.
Training the Hidden Vector State Model from Un-annotated Corpus
Authors: Deyu Zhou, Yulan He, Chee Keong Kwoh
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Since most knowledge about protein-protein interactions still hides in biological publications, there is an increasing focus on automatically extracting information from the vast amount of biological literature. Existing approaches can be broadly categorized as rule-based or statistically-based. Rule-based approaches require heavy manual effort. On the other hand, statistically-based approaches require large-scale, richly annotated corpora in order to reliably estimate model parameters. This is normally difficult to obtain in practical applications. We have proposed a hidden vector state (HVS) model for protein-protein interactions extraction. The HVS model is an extension of the basic discrete Markov model in which context is encoded as a stack-oriented state vector. State transitions are factored into a stack shift operation similar to those of a push-down automaton followed by the push of a new preterminal category label. In this paper, we propose a novel approach based on the k-nearest-neighbors classifier to automatically train the HVS model from un-annotated data. Experimental results show the improved performance over the baseline system with the HVS model trained from a small amount of the annotated data.
Superatoms and their assemblies based on alkali and super-alkali motifs
Authors: P. Clayborne, N. O. Jones, A. C. Reber, J. U. Reveles, M. C. Qian, S. N. Khanna
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

It is shown that chosen stable clusters can mimic the chemical behavior of atoms in the periodic table and hence can be regarded as superatoms forming a third dimension of the periodic table. The review discusses the developments leading to the superatom concept and our recent studies on superhalogens and superalkalis. It is shown that molecules and assemblies with novel electronic and chemical features can be synthesized by assembling superhalogens with alkalis and superalkalis. The paper reviews these developments and presents a summary and future prospects.
Stator Resistance Tuning Based on a Neural Network in an Indirect Rotor Field Oriented Control System of an Induction Motor
Authors: Dinko Vukadinovic, Mateo Basic, Ljubomir Kulisic
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This paper presents an ANN-based (artificial neural network-based) method of stator resistance tuning in an IRFO (indirect rotor field oriented) control system of an induction motor. This method is based on the conventional two-layer ANN in which the rotor time constant is not a constant parameter and is identified using a model reference adaptive system (MRAS) - based procedure. During the training, rotor speed estimation of the induction motor is enabled. The difference between the actual and the estimated rotor speed is used as a signal for manual stator resistance tuning. Computer simulations and experimental results show the effectiveness of the described approach in a low rotor speed region.
How We Think of Computing Today
Authors: Jiří Wiedermann, Jan Leeuwen
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

Classical models of computation no longer fully correspond to the current notions of computing in modern systems. Even in the sciences, many natural systems are now viewed as systems that compute. Can one devise models of computation that capture the notion of computing as seen today and that could play the same role as Turing machines did for the classical case? We propose two models inspired from key mechanisms of current systems in both artificial and natural environments: evolving automata and interactive Turing machines with advice. The two models represent relevant adjustments in our apprehension of computing: the shift to potentially non-terminating interactive computations, the shift towards systems whose hardware and/or software can change over time, and the shift to computing systems that evolve in an unpredictable, non-uniform way. The two models are shown to be equivalent and both are provably computationally more powerful than the models covered by the old computing paradigm. The models also motivate the extension of classical complexity theory by non-uniform classes, using the computational resources that are natural to these models. Of course, the additional computational power of the models cannot in general be meaningfully exploited in concrete goal-oriented computations.
The EDSAC computer
Authors: M. V. Wilkes
Venue: Papers and discussions presented at the Dec. 10-12, 1951, joint AIEE-IRE computer conference: Review of electronic digital computers (1951)

The invitation to speak to this conference about the EDSAC was particularly welcome to me because the foundations of my knowledge of electronic computers were laid during a visit to Philadelphia in the summer of 1946 when I attended part of a course at the Moore School of Electrical Engineering. I began to sketch out the design for the EDSAC in Philadelphia immediately after the course, and when I got back to Cambridge I was joined by Mr. Renwick and experimental work was started. Most of the important design decisions were taken in the first half of 1947 and the machine did its first calculation in the summer of 1949. I would like you, therefore, when listening to what I have to say about the design of the EDSAC, to cast your minds back to the conditions existing in 1947 and to the state of development of the subject at that time.
An EDA compendium
Authors: Sachin Sapatnekar
Venue: IEEE Design Test (2005)

Reviewed in this issue The Electronic Design Automation Handbook, by Dirk Jansen (Kluwer Academic Publishers,2003, ISBN 1-402-07502-2, 244 pp., $148).
Neural Systems for Short-Term Forecasting of Electric Power Load
Authors: Michał Bąk, Andrzej Bielecki
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

In this paper a neural system for daily forecasting of electric power load in Poland is presented. Basing on the simplest neural architecture - a multi-layer perceptron - more and more complex system is built step by step. A committee rule-aided hierarchical system consisting of modular ANNs is obtained as a result. The forecasting mean absolute percentage error (MAPE) of the most effective system is about 1.1%.
Research on Speech Emotion Recognition System in E-Learning
Authors: Ken Chen, Guangxue Yue, Fei Yu, Yue Shen, Aiqing Zhu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Aiming at emotion deficiency in present E-Learning system, a lot of negative effects were analyzed and corresponding countermeasures were proposed. Basing on it, we combined affective computing with the traditional E-Learning system. The model of E-Learning system based on affective computing was constructed by using speech emotion, which took speech feature as input data. Our simulation experiment results showed that neural networks was effective in emotion recognition, and we achieve a recognition rate of approximately 50% when testing eight emotions .besides, other key techniques of realizing the system such as tracking the change of emotion state and adjusting teaching strategies were also introduced.
RF-DNA: Radio-Frequency Certificates of Authenticity
Authors: Gerald Dejean, Darko Kirovski
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

A certificate of authenticity (COA) is an inexpensive physical object that has a random and unique multidimensional structure S which is hard to near-exactly replicate. An inexpensive device should be able to scan object's physical "fingerprint," i.e., obtain a set of features in the form of a multidimensional signal x that pseudo-uniquely represents S. For a given "fingerprint" x and without access to S, it should be computationally difficult to construct an object of fixed dimensions with a "fingerprint" y which is at a bounded proximity from x according to a standardized distance metric. We introduce objects that behave as COAs in the electromagnetic field. The objective is to complement RFIDs so that they are physically, not only digitally, unique and hard to replicate. By enabling this feature, we introduce a tag whose information about the product can be read within a relative far-field, and also whose authenticity can be reliably verified within its near-field. In order to counterfeit a tag, the adversary faces two difficulties --- a computational and a manufacturing one. The computational difficulty stems from the hardness of solving linear inverse problems in the electromagnetic field. In order to create an actual tag, the adversary must also manufacture a multidimensional object with a specific three-dimensional topology, dielectric properties, and conductivity.