ppxscal/embedding_network huggingface dataset:
Neuroscientific implications for situated and embodied artificial intelligence
Authors: Keith L. Downing
Venue: Connection Science (2007)

While classic artificial intelligence systems still struggle to incorporate commonsense knowledge properly, situated and embodied artificial intelligence (SEAI) aims to build animats that acquire a common-sense understanding of the world via interactions between simulated brains, bodies and environments. Neuroscientists believe that much of this common sense involves predictive models for physical activities, but the transfer of sensorimotor skill knowledge to cognition is non-trivial, indicating that SEAI may meet a daunting challenge of its own. This paper considers the neurological bases for implicit procedural and explicit declarative common sense, and the possibilities for its transfer from the former to the latter. This helps assess the prospects for SEAI eventually to surpass GOFAI (good old-fashioned AI) in the quest for generally intelligent systems.
Abnormalities in Connectivity of Quantitative Electroencephalogram Background Activity in Asperger Disorders with Short Time Fourier Transform and Coherence Values
Authors: Hamid Behnam, Ali Sheikhani, Mohammad Reza Mohammadi, Maryam Noroozian, Pari ?Golabi
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Electroencephalography (EEG) is a powerful, inexpensive, and underutilized neurophysiology diagnostic tool. Since EEG signals contain a wealth of information about brain functions, there are many approaches in analyzing EEG signals with spectral techniques. We have used short time Fourier transform ‎‎(STFT) at 19 channel’s of EEG for 8 Asperger ‎disorders (6-11 years old) and 10 age matched control ‎subjects. The values were assessed with variance analysis. Results are shown that gamma band (34-44Hz) has 94.4% discriminate between two groups. Coherence measures at between 112 pairs of 19 channels EEG are shown there are abnormalities at ‎connectivity between in right temporal lobe and frontal lobe and connectivity between right temporal lobe with other lobes.
Measuring where it matters: Determining starting points for metrics collection
Authors: Joost Schalken, Hans van Vliet
Venue: Journal of Systems and Software (2008)

Defining useful metrics to measure the goals of a software organisation is difficult. Defining useful metrics to measure the causes of the (failure) to fulfil those organisational goals is even more difficult, as the diversity of potential causes makes their measurement illusive. In this article, we describe a method to select useful software metrics based on findings from qualitative research. In a case study, we apply this method to a previously conducted study of project post-mortem reviews to assess the validity of our prior claims. For this we collected data on 109 new software projects in the organisation in which we conducted the previous case study.
Towards practical software traceability
Authors: Hazeline U. Asun ion
Venue: Companion of the 30th international conference on Software engineering (2008)

The importance of software traceability to software development is recognized by researchers and practitioners; yet, current approaches fall short of providing effective traceability in practice. An analysis of reported difficulties with traceability reveals that interacting factors from the economic, technical, and social perspectives hinder traceability. Motivated by the multi-faceted traceability problem, we combine architecture-centric stakeholder-driven traceability with open hypermedia, and we use insights from e-Science to guide our approach. We highlight expected contributions and discuss evaluation plans. Finally, we distinguish our approach from related research and technologies.
Parallel algorithms for downdating the least squares estimator of the regression model
Authors: Petko I. Yanev, Erricos J. Kontoghiorghes
Venue: Parallel Computing (2008)

Computationally efficient parallel algorithms for downdating the least squares estimator of the ordinary linear regression are proposed. The algorithms, which are based on the QR decomposition, are block versions of sequential Givens strategies and efficiently exploit the triangular structure of the data matrices. The first strategy utilizes only part of the orthogonal matrix which is derived from the QR decomposition of the initial data matrix. The rest of the orthogonal matrix is not updated or explicitly computed. A modification of the parallel algorithm, which explicitly computes the whole orthogonal matrix in the downdated QR decomposition, is also considered. An efficient distribution of the matrices over the processors is proposed. Furthermore, the new algorithms do not require any inter-processor communication. The theoretical complexities are derived and experimental results are presented and analyzed. The parallel strategies are scalable and highly efficient for large scale downdating least squares problems. A new parallel block-hyperbolic downdating strategy is developed. The algorithm is rich in BLAS-3 computations, involves negligible duplicated computations and requires insignificant inter-processor communication. It is found to outperform the previous downdating strategies and to be highly efficient for large scale problems. The experimental results confirm the derived theoretical complexities.
A Divergence Analysis in Autonomous Systems Using Full-Mesh iBGP
Authors: Uli Bornhauser, Peter Martini
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

From a global point of view, the Internet consists of Autonomous Systems, exchanging reachability information by using BGP. In big ASs, the usage of scaling techniques as iBGP Route Reflection is necessary to reduce the information exchanged inside the system. However, as discussed in various studies, these techniques may lead to routing anomalies like suboptimal path selection, deflection, non-determinism, or oscillation. Especially an endless exchange of update messages and the resulting unstable behavior of the system, involved with oscillation, are extremely unwanted. Besides oscillation, also non-determinism may result in similar situations. In contrast to this, both non-determinism and oscillation were not observed in ASs using full-mesh iBGP. In this paper, it is proved that these routing anomalies cannot occur here. Understanding the conditions for the absence of these anomalies may be a first step to amalgamate the scalability advantages of iBGP Route Reflection and the stability of full-mesh iBGP.
On a 16° N chlorophyll plume along the east coast of India
Authors: S. K. Sasamal
Venue: International Journal of Remote Sensing (2007)

The plume rich with chlorophyll-a concentration (>0.3 mg/l) observed on 22 March 2003 along the 16° N in the western Bay of Bengal off the Krishna-Godavari river delta was studied. Relatively high sea surface temperature (>30° C) observed in the plume area indicated their origin in the coastal waters. The bloomy plume was found spreading 400 to 500 km offshore in the form of an offshore jet extending as far as 86° E in the Bay of Bengal. An offshore flow was observed with geostrophic velocity exceeding 50 cm/s with a cyclonic eddy on its north around 17° N, 82° E and an anti-cyclonic eddy around 14° N, 83° E to its south. The hydrographic data of the area were studied with the observations made by GTS data buoy indicated coastal upwelling. Similar plumes were also observed during the years 2004 and 2005.
Building Mashups by example
Authors: Rattapoom Tuchinda, Pedro Szekely, Craig A. Knoblock
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Creating a Mashup, a web application that integrates data from multiple web sources to provide a unique service, involves solving multiple problems, such as extracting data from multiple web sources, cleaning it, and combining it together. Existing work relies on a widget paradigm where users address those problems during a Mashup building process by selecting, customizing, and connecting widgets together. While these systems claim that their users do not have to write a single line of code, merely abstracting programming methods into widgets has several disadvantages. First, as the number of widgets increases to support more operations, locating the right widget for the task can be confusing and time consuming. Second, customizing and connecting these widgets usually requires users to understand programming concepts. In this paper, we present a Mashup building approach that (a) combines most problem areas in Mashup building into a unified interactive framework that requires no widgets, and (b) allows users with no programming background to easily create Mashups by example.
Flipping Coins In Many Pockets (Byzantine Agreement On Uniformly Random Values)
Authors: A. Z. Broder
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

It was recently shown by Michael Rabin that a sequence of random 0-1 values, prepared and distributed by a trusted "dealer," can be used to achieve Byzantine agreement in constant expected time in a network of processors. A natural question is whether it is possible to generate these values uniformly at random within the network. In this paper we present a cryptography based protocol for agreernent on a 0-1 randona value, if less than half of the processors are faulty. In fact the protocol allows uniform sampling from any finite set, and thus solves the problem of choosing a network leader uniformly at random. The protocol is usable both when all the communication is via "broadcast," in which case it needs three rounds of information exchange, and when each pair of processors communicate on a private line, in which case it needs 3t + 3 rounds, where t is the number of faulty proccssors. The protocol remains valid even if passive eavesdropping is allowed. On the other hand we show that no (probabilistic) protocol can achieve agreement on a fair coin in fewer phases then necessary for Byzantine agreement, and hence the "pre-dealt" nature of the random sequence required for Rabin's algorithm is crucial.
A window-based image processing system for intelligent transportation system
Authors: M. Y. Siyal
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Various researchers for a number of years have investigated traffic data collection and analysis. Many techniques have been proposed to speed up the operations and some intelligent approaches have been developed to compensate the effects of lighting, shadows and occlusions. To achieve real-time processing, it is necessary to reduce the amount of data to be processed, so the first question is to determine the suitable location for the key regions or windows. Previously, researchers have either used full frame processing approach, which requires more computing power and thus is not practical for real-time applications, or have used window based techniques, but defining of windows was done manually, which is not practical in real-world traffic applications. In this paper, an automatic approach is described to measure the size and location of windows required for this purpose. The results demonstrate that this method provides better results than the fixed window size.
Description and analysis of a bottom-up DFA minimization algorithm
Authors: Jorge Almeida, Marc Zeitoun
Venue: Information Processing Letters (2008)

We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongly connected DFA, the isomorphism problem for a set of strongly connected minimized DFAs, and the minimization of a connected DFA consisting in two strongly connected components, both of which are minimized. We apply this procedure to minimize, in linear time, automata whose nontrivial strongly connected components are cycles.
On a non-smooth version of Newton's method based on Hölderian assumptions
Authors: Ioannis K. Argyros
Venue: International Journal of Computer Mathematics (2007)

In this study we are concerned with the problem of approximating a locally unique solution of an operator equation in Banach space using Newton's method. The differentiability of the operator involved is not assumed, and we use Hölderian assumptions. We provide a semilocal convergence analysis based on a suitable point-based approximation. Our approach is justified by numerical examples where our results apply, whereas earlier ones cannot be applied in this way.
Note-taking, selecting, and choice: designing interfaces that encourage smaller selections
Authors: Aaron Bauer, Kenneth R. Koedinger
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Our research develops note-taking applications for educational environments. Previous studies found that while copy-pasting notes can be more efficient than typing, for some users it reduces attention and learning. This paper presents two studies aimed at designing and evaluating interfaces that encourage focusing. While we were able to produce interfaces that increased desirable behaviors and improved satisfaction, the new interfaces did not improve learning. We suggest design recommendations derived from these studies, and describe a "selecting-to-read" behavior we encountered, which has implications for the design of reading and note-taking applications.
Efficient algorithms for independent assignment on graphic and linear matroids
Authors: H. N. Gabow, Y. Xu
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Efficient algorithms are presented for the matroid intersection problem and generalizations. The algorithm for weighted intersection works by scaling the weights. The cardinality algorithm is a special case that takes advantage of greater structure. Efficiency of the algorithms is illustrated by several implementations. On graphic matroids the algorithms run close to the best bounds for trivial matroids (i.e. ordinary bipartite graph matching): O( square root nm log n) for cardinality intersection and O( square root nm log/sup 2/n log(nN)) for weighted intersection (n, m, and N denote the number of vertices, edges, and largest edge weight, respectively; weights are assumed integral). Efficient algorithms are also given for linear matroids. These include both algorithms that are practical and algorithms exploiting fast matrix multiplication.
Schema Versioning in Multi-temporal XML Databases
Authors: Zouhaier Brahmia, Rafik Bouaziz
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Schema evolution keeps only the current data and the schema version after applying schema changes. On the contrary, schema versioning creates new schema versions and preserves old schema versions and their corresponding data. Much research work has recently focused on the problem of schema evolution in XML databases, but less attention has been devoted to schema versioning in such databases. In this paper, we present an approach for schema versioning in multi-temporal XML databases. This approach is based on the XML Schema language for describing XML schema, and is database consistency-preserving.
Usage of porous Al2O3 layers for RH sensing
Authors: Veronika Tim&#x00e1;r-Horv&#x00e1;th, L&#x00e1;szl&#x00f3; Juh&#x00e1;sz, Andr&#x00e1;s Vass-V&#x00e1;rnai, Gergely Perlaky
Venue: Microsystem Technologies (2008)

Capacitive sensors prepared by microelectronic technology are based on dielectric property changes of thin films upon water vapor uptake, which depends on the surrounding media&#x2019;s relative humidity content. One of the dielectrics to be used is porous Al2O3, obtained by electrochemical oxidation of aluminum under anodic bias. In this paper a sensitive, fast and cheap capacitive sensor has been described and investigated.
An Industrial Case Study of Sticky Path-Delay Faults
Authors: I-De Huang, Yi-Shing Chang, Sandeep K. Gupta, Sreejit Chakravarty
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Sticky path-delay faults are path delay faults that are neither robustly nor non-robustly testable, but cannot be proven functionally unsensitizable. Better characterization of delay test quality requires a proper analysis of sticky path-delay faults. Furthermore, careful elimination of sticky path-delay faults contributes significantly to test development productivity and reduction of delay test cost.We present an industrial case study that shows the following. (a) On average, even after designers have removed false paths using automated tools and manual overrides, about 8% of path-delay faults with slack less than 10% of the clock period can be sticky. (b) Our approach, which extends a previously proposed technique, identifies a large subset of sticky path-delay faults that cannot cause functional failures and hence can be eliminated from further consideration. This significantly refines the delay test quality assessment and test development effort. (c) Our approach significantly reprioritizes (reorders) the remaining paths for test generation thereby improving the quality of the target path list.
Unsupervised Classification of Verb Noun Multi-Word Expression Tokens
Authors: Mona T. Diab, Madhav Krishna
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

We address the problem of classifying multiword expression tokens in running text. We focus our study on Verb-Noun Constructions (VNC) that vary in their idiomaticity depending on context. VNC tokens are classified as either idiomatic or literal. Our approach hinges upon the assumption that a literal VNC will have more in common with its component words than an idiomatic one. Commonality is measured by contextual overlap. To this end, we set out to explore different contextual variations and different similarity measures. We also identify a new data set OPAQUE that comprises only non-decomposable VNC expressions. Our approach yields state of the art performance with an overall accuracy of 77.56% on a TEST data set and 81.66% on the newly characterized data set OPAQUE.
Towards Requirements Engineering Practice for Professional End User Developers: A Case Study
Authors: Shamal Faily
Venue: Proceedings of the 2008 Requirements Engineering Education and Training (2008)

End-User Development has received a lot of attention in the research community. Despite the importance of Re- quirements Engineering in the software development life-cycle, comparatively little exists in the way of prescriptive advice or case studies on both Requirements Engineering and End-User Development. This paper argues that end-user developers can obtain practical benefit by adopting professional Requirements Engineering practices. We report on how these practices were fostered within a work- place environment and illustrate that evaluating the effec- tiveness of teaching such practices can lead to a better un- derstanding of the relationship between End-User Develop- ment and Software Engineering in general. 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
Analytic simplification of animated characters
Authors: Bruce Merry, Patrick Marais, James Gain
Venue: Proceedings of the 6th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa (2009)

Traditionally, levels of detail (LOD) for animated characters are computed from a single pose. Later techniques refined this approach by considering a set of sample poses and evaluating a more representative error metric. A recent approach to the character animation problem, animation space, provides a framework for measuring error analytically. The work presented here uses the animation-space framework to derive two new techniques to improve the quality of LOD approximations. Firstly, we use an animation-space distance metric within a progressive mesh-based LOD scheme, giving results that are reasonable across a range of poses, without requiring that the pose space be sampled. Secondly, we simplify individual vertices by reducing the number of bones that influence them, using a constrained least-squares optimisation. This influence simplification is combined with the progressive mesh to form a single stream of simplifications. Influence simplification reduces the geometric error by up to an order of magnitude, and allows models to be simplified further than is possible with only a progressive mesh. Quantitative (geometric error metrics) and qualititative (user perceptual) experiements confirm that these new extensions provide significant improvements in quality over traditional, na&iuml;ve simplification; and while there is naturally some impact on the speed of the off-line simplification process, it is not prohibitive.
Analysis of Automatic Stress Assignment in Slovene
Authors: Domen Marinčič Tea Tušar Matjaž Gams Tomaž Šef
Venue: Informatica (2009)

We tested the ability of humans and machines (data mining techniques) to assign stress to Slovene words. This is a challenging comparison for machines since humans accomplish the task outstandingly even on unknown words without any context. The goal of finding good machine-made models for stress assignment was set by applying new methods and by making use of a known theory about rules for stress assignment in Slovene. The upgraded data mining methods outperformed expert-defined rules on practically all subtasks, thus showing that data mining can more than compete with humans when constructing formal knowledge about stress assignment is concerned. Unfortunately, compared to humans directly, the data mining methods still failed to achieve as good results as humans on assigning stress to unknown words.
Towards Facial Gestures Generation by Speech Signal Analysis Using HUGE Architecture
Authors: Goranka Zoric, Karlo Smid, Igor S. Pandzic
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

In our current work we concentrate on finding correlation between speech signal and occurrence of facial gestures. Motivation behind this work is computer-generated human correspondent, ECA. In order to have a believable human representative it is important for an ECA to implement facial gestures in addition to verbal and emotional displays. Information needed for generation of facial gestures is extracted from speech prosody by analyzing natural speech in real-time. This work is based on the previously developed HUGE architecture for statistically-based facial gesturing and extends our previous work on automatic real-time lip sync.