ppxscal/embedding_network huggingface dataset:
Causality quantification and its applications: structuring and modeling of multivariate time series
Authors: Takashi Shibuya, Tatsuya Harada, Yasuo Kuniyoshi
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Time series prediction is an important issue in a wide range of areas. There are various real world processes whose states vary continuously, and those processes may have influences on each other. If the past information of one process X improves the predictability of another process Y, X is said to have a causal influence on Y. In order to make good predictions, it is necessary to identify the appropriate causal relationships. In addition, the processes to be modeled may include symbolic data as well as numerical data. Therefore, it is important to deal with symbolic and numerical time series seamlessly when attempting to detect causality. In this paper, we propose a new method for quantifying the strength of the causal influence from one time series to another. The proposed method can represent the strength of causality as the number of bits, whether each of two time series is symbolic or numerical. The proposed method can quantify causality even from a small number of samples. In addition, we propose structuring and modeling methods for multivariate time series using causal relationships of two time series. Our structuring and modeling methods can also deal with data sets which include both types of time series. Experimental results demonstrate that our methods can perform well even if the number of samples is small.
The motion control of a mobile robot using multiobjective decision making
Authors: Earl B. Smith
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

This paper discusses the use of fuzzy logic based decision-making of autonomous robots in unstructured environments. We will introduce fuzzy multiobjective decision making within the context of the motion control of mobile robots. This process is comparable to human decision-making where one's initial assessment of the surroundings provides the basis for navigating in unstructured environments. Visual feedback enables one to deal with elements in the environment not for seen in the initial planning process. It is shown that the proposed approach offers a viable alternative to existing approaches in mobile robotics by providing a flexible architecture for addressing complexity of motion planning. The goal here is to develop a process and/or algorithm that will use decision-making in order to increase a robot's overall autonomy.
Robust Fingerprint Matching Using Spiral Partitioning Scheme
Authors: Zhixin Shi, Venu Govindaraju
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Fingerprint matching for low quality or partial fingerprint images is very challenging. It is mainly because the features such as minutia points can not be extracted reliably. In the case of partial fingerprint images captured using solid state sensors, enough number of minutia points may not be included. In this paper, we introduce a novel fingerprint representation that combines information from each extracted minutia with detected ridges in its neighborhood. The proposed algorithm first enhances a fingerprint image and generates a binary image. Then instead of using thinning-based algorithms, the ridges are extracted using a chaincode scheme, which retains the original thickness of the ridges and precise local orientations. The minutia points are detected by tracing the ridge lines. Finally the enriched local structural features are built for each minutia by a spiral coding using the ridge line orientations around the minutia. The new features are translation and rotational invariant. Each feature vector represents a minutia and its neighboring ridge structures. Matching of two fingerprints is performed by calculating the Euclidean distances between pairs of corresponding feature vectors. Preliminary experiments show that the proposed algorithm is effective.
Classification Visualization across Mapping on a Sphere
Authors: Veslava Osińska, Piotr Bała
Venue: Proceeding of the 2008 conference on New Trends in Multimedia and Network Information Systems (2008)

Existing classification schemes are visualized as hierarchical trees. Science data visualization requires a new method in information space modelling in order to reveal relations between class nodes. This paper describes a novel visualization concept of classification scheme using subject content metrics. We have mapped the document collection of Association for Computing Machinery (ACM) digital library to a sphere surface. To overcome the incorrectness of linear measures in indexes distances we calculated similarity matrix of themes and multidimensional scaling coordinates. The results show that space distances between class nodes accurately correspond with the thematic proximities. Documents mapped into a sphere surface were located according to the classification nodes and distributed uniformly. Proposed method to visualize classification scheme is proper to reach nonlinearity in subject content visualization. This property allows us to place close by more classification nodes. Symmetry of a sphere favours a new subclasses and sublevels of classification trees uniform visualization. This method may be useful in the visual analysis of Computer Science and Engineering domain development being grown instantly.
Real Time Machine Deduction and AGI
Authors: Peter G. Tripodes
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

Consistent with the ultimate goals of AGI, we can expect that deductive consequences of large and grammatically varied text bases would not be generated by sequential application of inference rules but would instead be recognized in a single massively parallel pattern matching operation on their semantic structures which executes near instantaneously. We describe an approach to realizing such a capability in graphical terms whereby semantic structures are depicted as certain graphical arrays, and deductive relationships are determined by requisite pattern connections within and among those arrays.
Query simplification: graceful degradation for join-order optimization
Authors: Thomas Neumann
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Join ordering is one of the most important, but also most challenging problems of query optimization. In general finding the optimal join order is NP-hard. Existing dynamic programming algorithms exhibit exponential runtime even for the restricted, but highly relevant class of star joins. Therefore, it is infeasible to find the optimal join order when the query includes a large number of joins. Existing approaches for large queries switch to greedy heuristics or randomized algorithms at some point, which can degrade query execution performance by orders of magnitude. We propose a new paradigm for optimizing large queries: when a query is too complex to be optimized exactly, we simplify the query's join graph until the optimization problem becomes tractable within a given time budget. During simplification, we apply safe simplifications before more risky ones. This way join ordering problems are solved optimally if possible, and gracefully degrade with increasing query complexity. This paper presents a general framework for query simplification and a strategy for directing the simplification process. Extensive experiments with different kinds of queries, different join-graph structures, and different cost functions indicate that query simplification is very robust and outperforms previous methods for join-order optimization.
The implementation of satellite images and associated digital image processing in addition to GIS modelling for urban mapping in Amman area, Jordan
Authors: Eyad H. R. Fadda, Maher Kakish, Tariq A. Al Azab
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2009)

Thematic maps and geo-spatial database are important tools that can be used for many purposes, such as mapping urban features, agricultural area and road network; they are also useful in urban planning and city planning. Many urban features were depicted from topographic maps and satellite digital images covering west of Amman area. GIS, remote sensing and associated digital image processing techniques have been applied on the satellite digital images in order to enhance the images. On screen digitizing techniques for both topographic and satellite images were applied to delineate Urban areas, agricultural areas, road networks. Several new maps for the western part of Amman area were produced from the topographic maps and satellite images (IKONOS 2002 and 2006). The resultant maps are: urban areas, road networks and agricultural area. The produced layers and their attributes were stored as geo-spatial database for west of Amman area using GIS technology by Arc GIS software. The produced maps and layers can be used for urban planning.
The Impulsive Control of Cluster Synchronization in Coupled Dynamical Networks
Authors: Yanhong Zhao, Yongqing Yang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

This paper investigates the cluster synchronization of the coupled dynamical networks via impulsive control. Synchronization criteria are obtained by using impulsive stability theory. All states of coupled dynamical networks split into different cluster. Numerical simulation on the chaotic Lorenz systems is given to demonstrate the effectiveness of theoretical results.
Approximation of infinitely differentiable multivariate functions is intractable
Authors: Erich Novak, Henryk Woniakowski
Venue: Journal of Complexity (2009)

We prove that L"~-approximation of C^~-functions defined on [0,1]^d is intractable and suffers from the curse of dimensionality. This is done by showing that the minimal number of linear functionals needed to obtain an algorithm with worst case error at most @e@?(0,1) is exponential in d. This holds despite the fact that the rate of convergence is infinite.
Peer-assisted On-demand Video Streaming with Selfish Peers
Authors: Niklas Carlsson, Derek L. Eager, Anirban Mahanti
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

Systems delivering stored video content using a peer-assisted approach are able to serve large numbers of concurrent requests by utilizing upload bandwidth from their clients to assist in delivery. In systems providing download service, BitTorrent-like protocols may be used in which "tit-for-tat" policies provide incentive for clients to contribute upload bandwidth. For on-demand streaming delivery, however, in which clients begin playback well before download is complete, all prior proposed protocols rely on peers at later video play points uploading data to peers at earlier play points that do not have data to share in return. This paper considers the problem of devising peer-assisted protocols for streaming systems that, similar to download systems, provide effective "tit-for-tat" incentives for clients to contribute upload bandwidth. We propose policies that provide such incentives, while also providing short start-up delays, and delivery of (almost) all video frames by their respective playback deadlines.
A Fast Logical-Morphological Method to Segment Scratch - Type Objects
Authors: Andreas Kuleschow, Christian Münzenmayer, Klaus Spinnler
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

In spite of the fast progress of computer technologies there are many tasks, which need accelerated software methods to obtain the results in real time. We propose one of such accelerated logical-morphological methods to detect scratch-type objects on noisy surfaces. The method is based on the principles of human vision and includes an adaptive multithresholding and logical-morphological operations for the fusion of the object's fragments.
Design of a Guided Web Mail System for Senior Citizens
Authors: Yurie Iribe, Kiichirou Sasaki, Mamoru Endo, Takami Yasuda, Shigeki Yokoi
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

In recent years a considerable number of studies have been conducted on the relationship between senior citizens and information technology. However, the “digital divide” with respect to age still exists. In this context, we have designed a user-friendly e-mail software for senior citizens on the basis of questionnaire results in an IT course that we executed in 2003. We propose a guided Web mail system that induces the sending and receiving of e-mail in one easy step and omits the more complex functions of e-mail. The system's interface is designed based on conventional paper letters to offer a Web mail system easy for senior citizens to understand and enjoy. Our system is actually designed as a rudimentary teaching tool that makes it easier for senior citizens to learn how to use e-mail software.
Analysis and simulation of continuous-time digital signal processors
Authors: Bob Schell, Yannis Tsividis
Venue: Signal Processing (2009)

Digital signal processors operating in continuous time are analyzed. We demonstrate, through analytical and simulation studies, that by operating without a sampling clock the in-band quantization error power is reduced compared to conventional discrete-time systems. We present an equivalence that facilitates the study of continuous-time digital signal processors and we explore in detail the case of single sinusoid inputs as well as inputs with a Gaussian distribution. The in-band quantization error power is shown to be lower by up to 25dB for an 8-bit system, compared to a classical, sampled one with the same resolution.
A Neuro-Fuzzy Based Approach for the Prediction of Quality of Reusable Software Components
Authors: Parvinder Singh Sandhu, Hardeep Singh
Venue: Proceeding of the 2005 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fourth SoMeT_W05 (2005)

The requirement to improve software productivity has promoted the research on software metric technology. There are metrics for identifying the quality of reusable components. These metrics if identified in the design phase or even in the coding phase can help us to reduce the rework by improving quality of reuse of the component and hence improve the productivity due to probabilistic increase in the reuse level. A suit of metrics can be used to obtain the reusability in the modules. And the reusability can be obtained with the help of Neuro-fuzzy based approach where neural network can learn new relationships with new input data, can be used to refine fuzzy rules to create fuzzy adaptive system. An algorithm has been proposed in which the inputs can be given to Neuro-fuzzy system in form of Cyclometric Complexity, Volume, Regularity, Reuse-Frequency & Coupling, and output can be obtained in terms of reusability.
Dynamic Backtracking for Distributed Constraint Optimization
Authors: Redouane Ezzahir, Christian Bessiere, Imade Benelallam, El Houssine Bouyakhf, Mustapha Belaissaoui
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering of agents. A distinctive feature of this algorithm is that it uses the concept of valued nogood. Combining lower bounds on inferred valued nogoods computed cooperatively helps pruning dynamically unfeasible sub-problems and speeds up the search. DyBop requires a polynomial space at each agent. Experiments show that DyBop has significantly better performance than other DCOP algorithms.
Estimating classification error rate: Repeated cross-validation, repeated hold-out and bootstrap
Authors: Ji-Hyun Kim
Venue: Computational Statistics Data Analysis (2009)

We consider the accuracy estimation of a classifier constructed on a given training sample. The naive resubstitution estimate is known to have a downward bias problem. The traditional approach to tackling this bias problem is cross-validation. The bootstrap is another way to bring down the high variability of cross-validation. But a direct comparison of the two estimators, cross-validation and bootstrap, is not fair because the latter estimator requires much heavier computation. We performed an empirical study to compare the .632+ bootstrap estimator with the repeated 10-fold cross-validation and the repeated one-third holdout estimator. All the estimators were set to require about the same amount of computation. In the simulation study, the repeated 10-fold cross-validation estimator was found to have better performance than the .632+ bootstrap estimator when the classifier is highly adaptive to the training sample. We have also found that the .632+ bootstrap estimator suffers from a bias problem for large samples as well as for small samples.
Equivalence of queries that are sensitive to multiplicities
Authors: Sara Cohen
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2009)

The query equivalence problem has been studied extensively for set-semantics and, more recently, for bag and bag-set semantics. However, SQL queries often combine set, bag and bag-set semantics. For example, an SQL query that returns a multiset of elements may call a subquery or view that returns a set of elements. Queries may access both relations that do not contain duplicates, as well as relations with duplicates. As another example, in SQL one can compute a multiset-union of queries, each of which returns a set of answers. This paper presents combined semantics, which formally models query evaluation combining set, bag and bag-set semantics. The equivalence problem for queries evaluated under combined semantics is studied. A sufficient condition for equivalence is presented. For several important common classes of queries necessary and sufficient conditions for equivalence are presented.
On2L: a framework for incremental ontology learning in spoken dialog systems
Authors: Berenike Loos
Venue: Proceedings of the 21st International Conference on computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop (2006)

An open-domain spoken dialog system has to deal with the challenge of lacking lexical as well as conceptual knowledge. As the real world is constantly changing, it is not possible to store all necessary knowledge beforehand. Therefore, this knowledge has to be acquired during the run time of the system, with the help of the out-of-vocabulary information of a speech recognizer. As every word can have various meanings depending on the context in which it is uttered, additional context information is taken into account, when searching for the meaning of such a word. In this paper, I will present the incremental ontology learning framework On2L. The defined tasks for the framework are: the hypernym extraction from Internet texts for unknown terms delivered by the speech recognizer; the mapping of those and their hypernyms into ontological concepts and instances; and the following integration of them into the system's ontology.
The design and evaluation of a virtual world-based learning environment: information security learning using Second Life
Authors: Angsana A. Techatassanasoontorn, Jungwoo Ryoo, Dongwon Lee, Taylor Davenport
Venue: Proceedings of the 4th International Conference on Design Science Research in Information Systems and Technology (2009)

This research proposes a design framework of a virtual world-based learning environment that integrates unique features of the virtual world technology with an instructional strategy. We then demonstrate the environment's usefulness and assess the effectiveness of our design framework in the context of information security learning using Second Life. Overall, the results strongly suggest that the virtual world-based learning environment enhances information security learning. In addition, our research shows that Learner traits have an important influence on learning outcomes through perceived enjoyment.
Resequencing analysis of stop-and-wait ARQ for parallel multichannel communications
Authors: Jun Li, Yiqiang Q. Zhao
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

In this paper, we consider a multichannel data communication system in which the stop-and-wait automatic-repeat-request protocol for parallel channels with an in-sequence delivery guarantee (MSW-ARQ-inS) is used for error control. We evaluate the resequencing delay and the resequencing buffer occupancy, respectively. Under the assumption that all channels have the same transmission rate but possibly different time-invariant error rates, we derive the probability generating function of the resequencing buffer occupancy and the probability mass function of the resequencing delay. Then, by assuming the Gilbert-Elliott model for each channel, we extend our analysis to time-varying channels. Through examples, we compute the probability mass functions of the resequencing buffer occupancy and the resequencing delay for time-invariant channels. From numerical and simulation results, we analyze trends in the mean resequencing buffer occupancy and the mean resequencing delay as functions of system parameters. We expect that the modeling technique and analytical approach used in this paper can be applied to the performance evaluation of other ARQ protocols (e.g., the selective-repeat ARQ) over multiple time-varying channels.
ERP evidence of tactile texture processing: Effects of roughness and movement
Authors: Soledad Ballesteros, Francisco Munoz, Manuel Sebastian, Beatriz Garcia, Jose Manuel Reales
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

Psychological and neurophysiological studies have investigated the peripheral neural mechanisms implicated in tactile roughness perception. However, the cortical mechanisms involved in roughness processing are not well understood. In the present study, we used behavioural data and event-related evoked potentials (ERPs) to investigate the extent to which two tactile stimuli varying in roughness (triangular gratings peak-to-peak spacing of 1.6 mm and 2.8 mm) and movement (the time available for tactile contact with the surface) modulate early stages of brain activation. Behavioral results showed that participants discriminate the two levels of roughness at the three velocities explored in the study but they were judged as equivalent in pleasantness. The ERP results showed a biphasic early-fast N1-P2 deflection. The N1 and P2 peaks to the smoother texture occur earlier than that of the rougher texture. Considering velocity, the N1 onset occurs later for the slowest velocity, followed by the intermediate velocity and earlier for the fastest velocity and the three velocities differ significantly. LORETA analysis showed that N1 and P2 components of surface roughness are both related to the activation produced in the somatosensory cortex and posterior cingulated respectively, suggesting that these areas might be involved in the sensory processing of roughness.