ppxscal/embedding_network huggingface dataset:
Event-related brain potentials suggest a late interaction of meter and syntax in the p600
Authors: Maren Schmidt-Kassow, Sonja A. Kotz
Venue: Journal of Cognitive Neuroscience (2009)

Many studies refer to the relevance of metric cues in speech segmentation during language acquisition and adult language processing. However, the on-line use (i.e., time-locking the unfolding of a sentence to EEG) of metric stress patterns that are manifested by the succession of stressed and unstressed syllables during auditory syntactic processing has not been investigated. This is surprising as both processes rely on abstract rules that allow the building up of expectancies of which element will occur next and at which point in time. Participants listened to metrically regular sentences that could either be correct, syntactically incorrect, metrically incorrect, or doubly incorrect. They either judged syntactic correctness or metric homogeneity in two different sessions. We provide first event-related potential evidence that the metric structure of a given language is processed in two stages as evidenced in a biphasic pattern of an early frontal negativity and a late posterior positivity. This pattern is comparable to the biphasic pattern reported in syntactic processing. However, metric cues are processed earlier than syntactic cues during the first stage (LAN), whereas both processes seem to interact at a later integrational stage (P600). The present results substantiate the important impact of metric cues during auditory syntactic language processing.
Strong Parallel Repetition Theorem for Free Projection Games
Authors: Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

The parallel repetition theorem states that for any two provers one round game with value at most 1 ¿ ¿ (for ¿< 1/2), the value of the game repeated n times in parallel is at most (1 ¿ ¿ 3)¿(n/logs) where s is the size of the answers set [Raz98],[Hol07]. For Projection Games the bound on the value of the game repeated n times in parallel was improved to (1 ¿ ¿ 2)¿(n) [Rao08] and was shown to be tight [Raz08]. In this paper we show that if the questions are taken according to a product distribution then the value of the repeated game is at most (1 ¿ ¿ 2)¿(n/logs) and if in addition the game is a Projection Game we obtain a strong parallel repetition theorem, i.e., a bound of (1 ¿ ¿)¿(n).
A Practical Coder of Fully Scalable Video over Error-Prone Network
Authors: Shuguang Su, Yueming Su
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

The paper is mainly devoted to explore practical scalable video coding technologies over error-prone wireless and mobile network with fluctuant bandwidth and various terminals. The new coder supports full scalability of spatial resolution, SNR quality and temporal in a flexible and simple method. Instead of common-used but complex MCTF-based scheme the new coder integrates smartly several optimized and improved technologies, i.e. so-called Hierarchical-B-Picture-Like, DWT, successive multi-level quantization, and SPIHT. The proposed coder can produce embedded bitstream satisfying various requirements of bandwidth, resolution and SNR of terminals over error-prone network. The experiments show that the proposed coder is practical and flexible and works well over error-prone network.
CodeSlinger: An Interactive Biomedical Ontology Browser
Authors: Jeffery L. Painter, Natalie L. Flowers
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

CodeSlinger is a highly interactive and semi-intelligent application designed to support the search and navigation of large biomedical coding schemes, thesauri, and ontologies. We discuss how CodeSlinger is used by epidemiologist/physicians in the creation of coding sets for data extraction and analysis, the exploratory nature of the application, and finally, the issues facing our knowledge-representation model and extension of the UMLS.
Abstract geometrical computation 3: black holes for classical and analog computing
Authors: Jérôme Durand-Lose
Venue: Natural Computing: an international journal (2009)

The so-called Black Hole model of computation involves a non Euclidean space-time where one device is infinitely "accelerated" on one world-line but can send some limited information to an observer working at "normal pace". The key stone is that after a finite duration, the observer has received the information or knows that no information was ever sent by the device which had an infinite time to complete its computation. This allows to decide semi-decidable problems and clearly falls out of classical computability. A setting in a continuous Euclidean space-time that mimics this is presented. Not only is Zeno effect possible but it is used to unleash the black hole power. Both discrete (classical) computation and analog computation (in the understanding of Blum, Shub and Smale) are considered. Moreover, using nested singularities (which are built), it is shown how to decide higher levels of the corresponding arithmetical hierarchies.
Modeling and Optimum Design of Pneumatic Gear Motor
Authors: Minglian Zhou, Jian Wen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The static characteristics model of the gear motor was established by both theoretical derivation and parameters calculation. The static model included torque， flow rate and efficiency were established by the idea of torque balance and flow rate balance based on gear theory and fluid dynamics. An optimum design was carried out for the highest efficiency. The optimum values of in the model which affect the motor efficiency were obtained, and the results were validated by experiments. The improved motor efficiency was increased by 21%, and the motor was used in pneumatic roof bolter successfully.
Algorithms for the Sample Mean of Graphs
Authors: Brijnesh J. Jain, Klaus Obermayer
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Measures of central tendency for graphs are important for protoype construction, frequent substructure mining, and multiple alignment of protein structures. This contribution proposes subgradient-based methods for determining a sample mean of graphs. We assess the performance of the proposed algorithms in a comparative empirical study. 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
Designing Inclusive Social Networks: A Participatory Approach
Authors: Leonelo Dell Almeida, Vânia Paula Almeida Neris, Leonardo Cunha Miranda, Elaine Cristina Hayashi, Maria Cecília Calani Baranauskas
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

The Brazilian society is characterized by vast differences with regard to socio-economics, culture as well as access to technology and knowledge. In this scenario, Information and Communication Technology, especially hypermedia systems, could benefit citizen, allowing access to knowledge, communication and collaboration. Current social networks systems were not conceived to address the challenges of an inclusive society. In this paper, we discuss some relevant design issues, elicited from a participatory approach, to the design of such systems. The exploratory design process starts with the elicitation of the different views among users, designers and developers, passes through design concepts definition and gets to a first approximation to a user interfaces design.
On cover-structure graphs
Authors: Henning Wunderlich
Venue: Discrete Applied Mathematics (2009)

Motivated by a problem in communication complexity, we study cover-structure graphs (cs-graphs), defined as intersection graphs of maximal monochromatic rectangles in a matrix. We show that not every graph is a cs-graph. Especially, squares and odd holes are not cs-graphs. It is natural to look at graphs (beautiful graphs) having the property that each induced subgraph is a cs-graph. They form a new class of Berge graphs. We make progress towards their characterization by showing that every square-free bipartite graph is beautiful, and that beautiful line graphs of square-free bipartite graphs are just Path-or-Even-Cycle-of-Cliques graphs.
A Riemannian Scalar Measure for Diffusion Tensor Images
Authors: Andrea Fuster, Laura Astola, Luc Florack
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

We study a well-known scalar quantity in differential geometry, the Ricci scalar, in the context of Diffusion Tensor Imaging (DTI). We explore the relation between the Ricci scalar and the two most popular scalar measures in DTI: Mean Diffusivity and Fractional Anisotropy. We discuss results of computing the Ricci scalar on synthetic as well as real DTI data. 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
Data Mining and Multi-agent Integration, 1st edition
Authors: Longbing Cao
Venue:  (2009)

This edited book reports on the state-of-the-art research and development progress in promoting the synergism of two cutting-edge technologies agents and data mining. The volume presents the methodologies, algorithms and systems that integrate these two technologies. The text highlights: basic concepts and techniques in agents-data mining interaction and integration techniques to build data mining systems from agent perspectives, and the advantages of this approach how to enhance agents capabilities through data mining efficient and effective ways to integrate agents and data mining techniques case studies demonstrating the mutual enhancement of the integration theoretical and applied problems arising at the cross boundary of multiagent, data mining and KDD technologies new problems, challenges, and their impact on the future trends in these areas and in information technology as a whole.
Designing Supply Chain KPIs for Upper-Level Management
Authors: Liu Ying, Xue Lijun, Su Wei
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Real-time supply chain performance dashboard is very important for successful supply chain management.Some key issues and solutions for establishing upper-level KPIs to reflecting supply chain operations is proposed in this paper.The most common-used KPIs, especially those related to organizations’ financial performance are specially illustrated for reference when implementing the dashboard through IT application.
The Wilson&#x2013;Cowan model, 36&#x00a0;years later
Authors: Alain Destexhe, Terrence J. Sejnowski
Venue: Biological Cybernetics (2009)

The Wilson&#x2013;Cowan model of interacting neurons (1973) is one of the most influential papers published in Biological Cybernetics (Kybernetik). This paper and a companion paper published in 1972 have been cited over 1000 times. Rather than focus on the microscopic properties of neurons, Wilson and Cowan analyzed the collective properties of large numbers of neurons using methods from statistical mechanics, based on the mean-field approach. New experimental techniques to measure neuronal activity at the level of large populations are now available to test these models, including optical recording of brain activity with intrinsic signals and voltage sensitive dyes, and new methods for analyzing EEG and MEG. These measurement techniques have revealed patterns of coherent activity that span centimetres of tissue in the cerebral cortex. Here the underlying ideas are reviewed in a historic context.
Language independent extractive summarization
Authors: Rada Mihalcea
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 4 (2005)

TextRank is a system for unsupervised extractive summarization that relies on an innovative application of iterative graph-based ranking algorithms to graphs encoding the cohesive structure of texts. An important characteristic of the system is that it does not rely on any language-specific knowledge resources or any manually constructed training data, and thus it is highly portable to new languages or domains.
On Subgroup Discovery in Numerical Domains
Authors: Henrik Grosskreutz, Stefan Rüping
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discovery algorithms have been presented in the past, they focus on databases with nominal attributes or make use of discretization to get rid of the numerical attributes. In this paper, we illustrate why the replacement of numerical attributes by nominal attributes can result in suboptimal results. Thereafter, we present a new subgroup discovery algorithm that prunes large parts of the search space by exploiting bounds between related numerical subgroup descriptions. The same algorithm can also be applied to ordinal attributes. In an experimental section, we show that the use of our new pruning scheme results in a huge performance gain when more that just a few split-points are considered for the numerical attributes.
Rule-Based Publish-Subscribe Mechanism for Real-time Applications
Authors: Xin Li, Zhiping Jia, Xinjie Lu, Haiyang Wang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

A Trusted Publish-Subscribe mechanism (TPS) has been developed for complex real-time applications by combining real-time database and reactive behavior. At first, a novel real-time object model is proposed which extends object-oriented data models by incorporating temporal consistency into objects. And then the Event-Condition-Action (ECA)rules with deadlines and values are defined with special emphasis on timing constraints. All transactions in TPS are classified into three types according to their features, and, their deadlines and priorities are discussed. In rule processing, a rule execution graph with couple modes and weights has been proposed in order to handle rules efficiently. Furthermore, to determine execution order of multiple rules triggered at the same time, a value-based conflict resolution is established on the highest value first principle. At last, the full-fledged structure of TPS server is implemented in detail.
Movement and Recovery Analysis of a Mouse-Replacement Interface for Users with Severe Disabilities
Authors: Caitlin Connor, Emily Yu, John Magee, Esra Cansizoglu, Samuel Epstein, Margrit Betke
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

The Camera Mouse is a mouse-replacement interface for users with movement impairments. It tracks a selected body feature, such as the nose, eyebrow or finger, through a web camera and translates the user's movements to movements of the mouse pointer. Occasionally, the Camera Mouse loses the feature being tracked, when the user moves quickly or out of frame, or when the feature is occluded from view of the web camera. A new system has been developed to recognize when the tracked feature has been lost and to locate and resume tracking of the originally selected feature. In order to better understand the directions of movement which are most and least comfortable for users with disabilities, a game interface was developed to test the accuracy and speed of users across different trajectories. The experiments revealed that trajectories most comfortable for a user with severe cerebral palsy were along diagonal axes.
On-board Spacewire Router for Space Mission
Authors: Chunjing Mao, Yong Guan, Jie Zhang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In order to satisfy the requirements of aerocraft’s multi-transmission in further development, the paper try a resolution about on-board Spacewire routing technology. Based on the network level analysis of Spacewire standard, we built the architecture of router with wormhole routing theory. A simulation model of router had been set to verify the design; meanwhile braking-problem from wormhole routing-blocking had been solved with BWR; then the design had been implement with FPGAs.
The Lovász Local Lemma and Satisfiability
Authors: Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl
Venue: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday (2009)

We consider boolean formulas in conjunctive normal form (CNF). If all clauses are large, it needs many clauses to obtain an unsatisfiable formula; moreover, these clauses have to interleave. We review quantitative results for the amount of interleaving required, many of which rely on the Lovász Local Lemma, a probabilistic lemma with many applications in combinatorics.In positive terms, we are interested in simple combinatorial conditions which guarantee for a CNF formula to be satisfiable. The criteria obtained are nontrivial in the sense that even though they are easy to check, it is by far not obvious how to compute a satisfying assignment efficiently in case the conditions are fulfilled; until recently, it was not known how to do so. It is also remarkable that while deciding satisfiability is trivial for formulas that satisfy the conditions, a slightest relaxation of the conditions leads us into the territory of NP-completeness.Several open problems remain, some of which we mention in the concluding section.
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Authors: S. Thomas McCormick, Satoru Fujishige
Venue: Mathematical Programming: Series A and B (2009)

Bisubmodular functions are a natural &#x201c;directed&#x201d;, or &#x201c;signed&#x201d;, extension of submodular functions with several applications. Recently Fujishige and Iwata showed how to extend the Iwata, Fleischer, and Fujishige (IFF) algorithm for submodular function minimization (SFM) to bisubmodular function minimization (BSFM). However, they were able to extend only the weakly polynomial version of IFF to BSFM. Here we investigate the difficulty that prevented them from also extending the strongly polynomial version of IFF to BSFM, and we show a way around the difficulty. This new method gives a somewhat simpler strongly polynomial SFM algorithm, as well as the first combinatorial strongly polynomial algorithm for BSFM. This further leads to extending Iwata&#x2019;s fully combinatorial version of IFF to BSFM.
Preliminary Findings from a Cross Cultural Usability Study on the Internationalization of User Interfaces
Authors: Joyram Chakraborty, Linda Hansen, Darren A. Denenberg, Anthony F. Norcio
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

This paper reports the findings from a second preliminary study concerning the Internationalization of User Interfaces. It is a follow up to an initial study conducted on American users [4]. Undergraduate Zambian subjects from the University of Zambia (UNZA) completed a web-based application to gauge their understanding of cultural variables commonly used in user interface development. In general, the findings indicate a distinct affinity towards culturally familiar attributes. The authors conclude that the use of culturally sensitive variables in development of user interfaces can have an affect on the acceptance of technologies.
Changing how people view changes on the web
Authors: Jaime Teevan, Susan T. Dumais, Daniel J. Liebling, Richard L. Hughes
Venue: Proceedings of the 22nd annual ACM symposium on User interface software and technology (2009)

The Web is a dynamic information environment. Web content changes regularly and people revisit Web pages frequently. But the tools used to access the Web, including browsers and search engines, do little to explicitly support these dynamics. In this paper we present DiffIE, a browser plug-in that makes content change explicit in a simple and lightweight manner. DiffIE caches the pages a person visits and highlights how those pages have changed when the person returns to them. We describe how we built a stable, reliable, and usable system, including how we created compact, privacy-preserving page representations to support fast difference detection. Via a longitudinal user study, we explore how DiffIE changed the way people dealt with changing content. We find that much of its benefit came not from exposing expected change, but rather from drawing attention to unexpected change and helping people build a richer understanding of the Web content they frequent.
How Users Perceive and Appraise Personalized Recommendations
Authors: Nicolas Jones, Pearl Pu, Li Chen
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Traditional websites have long relied on users revealing their preferences explicitly through direct manipulation interfaces. However recent recommender systems have gone as far as using implicit feedback indicators to understand users' interests. More than a decade after the emergence of recommender systems, the question whether users prefer them compared to stating their preferences explicitly, largely remains a subject of study. Even though some studies were found on users' acceptance and perceptions of this technology, these were general marketing-oriented surveys. In this paper we report an in-depth user study comparing Amazon's implicit book recommender with a baseline model of explicit search and browse. We address not only the question "do people accept recommender systems" but also how or under what circumstances they do and more importantly, what can still be improved.
Think Piece: The Purloined Mainframe: Hiding the History of Computing in Plain Sight
Authors: John Laprise
Venue: IEEE Annals of the History of Computing (2009)

The US federal government is immense. Executive branch departments are the size of large multinational corporations, with similar reach and power. Yet historians of computing looking at government have largely focused on elements in the Department of Defense not related to cryptography and NASA. Both of these organizations have a well-documented interest in computer technology. What about everyone else?
Greedy Algorithms withWeights for Construction of Partial Association Rules
Authors: Mikhail Ju. Moshkov, Marcin Piliszczu, Beata Zielosko
Venue: Fundamenta Informaticae (2009)

This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds on the minimal weight of partial association rules based on an information obtained during the greedy algorithm run.