ppxscal/embedding_network huggingface dataset:
Designing a Collaborative Visual Analytics Tool for Social and Technological Change Prediction
Authors: Pak Chung Wong, L. Ruby Leung, Ning Lu, Michael J. Scott, Patrick Mackey, Harlan Foote, James Correia Jr., Z. Todd Taylor, Jianhua Xu, Stephen D. Unwin, Antonio Sanfilippo
Venue: IEEE Computer Graphics and Applications (2009)

GreenOracle is a collaborative visual analytics tool for interactively modeling future social and technological changes. The development project involves an interdisciplinary team of scientists from atmospheric physics, electrical engineering, building engineering, social sciences, economics, public policy, and national security. The tool aims to predict global climate change's impact on US power grids and its implications for society and national security. These future scenarios provide critical assessments and information to help policymakers and stakeholders formulate a coherent, unified strategy toward shaping a safe, secure society. This article is part of a special issue on collaborative visualization.
Distinguishing between sketched scribble look alikes
Authors: Katie Dahmen, Tracy Hammond
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

In hand-sketched drawings, nearly identical strokes may have different meanings to a user. For instance, a scribble could signify either that a shape should be filled in or that it should be deleted. This work describes a method for determining user intention in drawing scribbles in the context of a pen-based computer sketch. Our study shows that given two strokes, a circle and a scribble, two features (bounding ratio and density) can quickly and effectively determine a user's intention.
Incremental dialogue processing in a micro-domain
Authors: Gabriel Skantze, David Schlangen
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

This paper describes a fully incremental dialogue system that can engage in dialogues in a simple domain, number dictation. Because it uses incremental speech recognition and prosodic analysis, the system can give rapid feedback as the user is speaking, with a very short latency of around 200ms. Because it uses incremental speech synthesis and self-monitoring, the system can react to feedback from the user as the system is speaking. A comparative evaluation shows that na&iuml;ve users preferred this system over a non-incremental version, and that it was perceived as more human-like.
High Clustering Coefficient of Computer Networks
Authors: Cai-Feng Du
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Due to the rapid development of network technology, the structure of computer network is increasingly complicated.The traditional random network model is difficult to haracterize the topology of current computer network.Complex network theory provides new view and thinking tostudy in this field. In this paper, we give a probabilisticmodel to examine the evolution of computer networks byrandom duplication processes of node degree as well as thepreferential choice mechanisms. The model is solved exactlyfor large network. We demonstrate that both the degreedistribution and the triangle distribution have stationaryproperties. When the size of the network tends to infinity,the degree distribution behaves as P(k) ∝ k−3 and theaverage clustering coefficient C is independent of the network size N. 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
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Authors: Nikos Leonardos, Michael Saks
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formula in propositional logic with the property that every variable appears exactly once. Such a formula can be represented by a tree, where the leaves correspond to variables, and the internal nodes are labeled by binary connectives. Under certain assumptions, this representation is unique. Thus, one can define the depth of a formula as the depth of the tree that represents it. The complexity of the evaluation of general read-once formulae, has attracted interest mainly in the decision tree model. In the communication complexity model, many interesting results deal with specific read-once formulae, such as DISJOINTNESS and TRIBES. In this paper we use information theory methods to prove lower bounds that hold for any read-once formula. Our lower bounds are of the form n(f)/c^{d(f)}, where n(f) is the number of variables and d(f) the depth of the formula, and they are optimal up to the constant c in the denominator.
A combination of hidden Markov model and fuzzy model for stock market forecasting
Authors: Md. Rafiul Hassan
Venue: Neurocomputing (2009)

This paper presents a novel combination of the hidden Markov model (HMM) and the fuzzy models for forecasting stock market data. In a previous study we used an HMM to identify similar data patterns from the historical data and then used a weighted average to generate a 'one-day-ahead' forecast. This paper uses a similar approach to identify data patterns by using the HMM and then uses fuzzy logic to obtain a forecast value. The HMM's log-likelihood for each of the input data vectors is used to partition the dataspace. Each of the divided dataspaces is then used to generate a fuzzy rule. The fuzzy model developed from this approach is tested on stock market data drawn from different sectors. Experimental results clearly show an improved forecasting accuracy compared to other forecasting models such as, ARIMA, artificial neural network (ANN) and another HMM-based forecasting model.
Detection Weak Period Signal Using Chaotic Oscillator
Authors: Qizhong Liu, Wanqing Song
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Some weak cycle singular signals are very important for condition monitoring, fault forecast and medicine diagnosis. However, the weak singular signals are often inundate into strong noises. A novel engineering method is proposed for detecting weak cycle signal in the strong signal by determining chaotic threshold of the Duffing-Holmes oscillator. First, a rough threshold value is calculated by local Lyapunov exponents with a step size 0.1. Second, the exact threshold value is calculated by the Duffing-Holmes system in terms of the law of the golden section. The advantage of the method will show not only lower computation cost, but also the weak cycle signal can be rigorously extracted from strong noise.
An IPv6 DNS Conformance Testing Framework
Authors: Xinchang Zhang, Wanming Luo, Xiaodong Li, Baoping Yan
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

The domain name system (DNS) is one of the most basic Internet infrastructures. Therefore, the IPv6 conformance testing is very necessary for accelerating the deployment of IPv6.This paper proposes a conformance testing framework for IPv6 DNS, in terms of the features of IPv6 DNS specifications. This framework employs the extended finite state machine (EFSM) model to describe the control and data flows of dynamic behaviors of IPv6 DNS, and configures the relevant variables and data files by a configuration module which can reduce the test cost.
A Study on Distribution of Medical Resources in City Downtown Hospitals Based on DEA Method
Authors: Guan Li, Liu Hui, Wu Songtao
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Data Envelopment Analysis (DEA) was for the first time put forward by A. Charnes, W.W. Cooper and E.Rhodes, the celebrated operation researchers, in 1978. With requirements for a very small quantity of indexes, easy researching methods and highly reliable results, DEA has been becoming more and more popular among experts from the fields of health economy and hospital administration. This paper is to make use of the DEA method to find out the distribution problems of medical resources in a city downtown hospital, according to the resulted total amount of health technical personnel, amount of working hospital beds, large-scale equipment ownership ratio, and other indexes relevant to the distribution efficiency of medical resources. This paper shall provide some references for the low-efficiency hospitals with excess inputs or low-level output.
Reactive planning in a motivated behavioral architecture
Authors: Éric Beaudry, Yannick Brosseau, Carle Côté, Clément Raïevsky, Dominic Létourneau, Froduald Kabanza, François Michaud
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

To operate in natural environmental settings, autonomous mobile robots need more than just the ability to navigate in the world, react to perceived situations or follow pre-determined strategies: they must be able to plan and to adapt those plans according to the robot's capabilities and the situations encountered. Navigation, simultaneous localization and mapping, perception, motivations, planning, etc., are capabilities that contribute to the decision-making processes of an autonomous robot. How can they be integrated while preserving their underlying principles, and not make the planner or other capabilities a central element on which everything else relies on? In this paper, we address this question with an architectural methodology that uses a planner along with other independent motivational sources to influence the selection of behavior-producing modules. Influences of the planner over other motivational sources are demonstrated in the context of the AAAI Challenge.
Research on Tension Control Strategy of Dry-Powder-Embedded Zinc-Air Battery Pole Manufacturing Line
Authors: Xiao Yanjun, Zhu Bo, Guan Yuming, Xiao Yanchun
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Continuous production process will be realized by dry-powder-embedded Zinc-air battery pole manufacturing line, which has important significance on the spread and application of Zinc-air. Tension is the most important factor of the electrode moulding quality. The force of current collector should be kept constant. Control performance of PID algorithm and fuzzy adaptive PID algorithm were researched. Based on MATLAB/ Simulink toolbox, they were compared. The results show that the fuzzy PID algorithm can adapt to various conditions, and provides better control performance for the line. Fuzzy PID algorithm was realized by graphical language LabVIEW.
Virtual context based services for multiplayer online games to facilitate community participation
Authors: Sonja Bergsträβer, Tomas Hildebrandt, Christoph Rensing, Ralf Steinmetz
Venue: Multimedia Tools and Applications (2009)

In the future of Massively Multiuser Online Gaming new improvements and innovations are needed. With demands of gamers for support and involvement, increasing new approaches are required in order to enhance community participation and increase the gaming experience. Using the concept of Virtual Context Based Services we have developed a novel approach to solve these challenges. Our concept enables information exchange game and genre independent by using the VCBS middleware. With the eXtensible game description language (xgdl) we propose a standardized way to describe the virtual context of a gamer. VCBS is an interface between games and other internet applications, which involves game communities and supports gamers.
Synchronizing automata preserving a chain of partial orders
Authors: M. V. Volkov
Venue: Theoretical Computer Science (2009)

We present a new class of automata which strictly contains the class of aperiodic automata and shares with the latter certain synchronization properties. In particular, every strongly connected automaton in this new class is synchronizing and has a synchronizing word of length @?n(n+1)6@? where n is the number of states of the automaton.
Pushing Predicates into Recursive SQL Common Table Expressions
Authors: Marta Burzańska, Krzysztof Stencel, Piotr Wiśniewski
Venue: Proceedings of the 13th East European Conference on Advances in Databases and Information Systems (2009)

A recursive SQL-1999 query consists of a recursive CTE (Common Table Expression) and a query which uses it. If such a recursive query is used in a context of a selection predicate, this predicate can possibly be pushed into the CTE thus limiting the breadth and/or depth of the recursive search. This can happen e.g. after the definition of a view containing recursive query has been expanded in place. In this paper we propose a method of pushing predicates and other query operators into a CTE. This allows executing the query with smaller temporary data structures, since query operators external w.r.t. the CTE can be computed on the fly together with the CTE. Our method is inspired on the deforestation (a.k.a. program fusion) successfully applied in functional programming languages.
A Matching Method Based on SVD for Image Retrieval
Authors: Jie-xian Zeng, Dong-ge Bi, Xiang Fu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Feature matching method is the key technology of image retrieval. A matching method based on SVD is proposed in this paper. Firstly, the feature matrix is constructed and the eigenvalue matrix is calculated based on SVD transformation．Then, the eigenvalue matrix is mapped into vector space，and similarity is measured by comparing the angle between vectors. Finally, the matching method is applied to image retrieval. Experimental results show that the proposed method is feasible and superior to the traditional distance matching method.
Recognizing stereotypical motor movements in the laboratory and classroom: a case study with children on the autism spectrum
Authors: Fahd Albinali, Matthew S. Goodwin, Stephen S. Intille
Venue: Proceedings of the 11th international conference on Ubiquitous computing (2009)

Individuals with Autism Spectrum Disorders (ASD) frequently engage in stereotyped and repetitive motor movements. Automatically detecting these movements in real-time using comfortable, miniature wireless sensors could advance autistic research and enable new intervention tools for the classroom that help children and their caregivers monitor and cope with this potentially problematic class of behavior. We present activity recognition results for stereotypical hand flapping and body rocking using data collected from six children with ASD repeatedly observed in both laboratory and classroom settings. In the classroom, an overall recognition accuracy of 88.6% (TP: 0.85; FP: 0.08) was achieved using three sensors. Challenges encountered when applying machine learning to this domain, as well as implications for the development of real-time classroom interventions and research tools, are discussed.
Tactical Access to Complex Technology through Interactive Communication (TACTIC)
Authors: Alexei Samoylov, Christopher Franklin, Susan Harkness Regli, Patrice Tremoulet, Kathleen Stibler, Peter Gerken
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

Tactical Access to Complex Technology through Interactive Communication (TACTIC) is a user interface prototype developed under a technology effort designed to provide personnel deployed in the field with access to resources that typically require intercession by stationary experts with extensive training and experience. We present rationale behind a computer system that judiciously and beneficially exposes expert knowledge to novices, outline the domains in which such a system is applicable and describe a prototype interface implementation in the domain of military expeditionary forces.
WebELS: A Content-Centered E-Learning Platform for Postgraduate Education in Engineering
Authors: Haruki Ueno, Zheng He, Jingxia Yue
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

This paper proposes a general purpose e-Learning platform WebELS to support higher education in engineering and science especially for PhD education. WebELS consists of three major modules, i.e., Learning for self-learning, Meeting for Internet-based on-line meeting, and Lecture for Internet-based distance lecture, as an "all-in-one" system. Using an easy-to-use authentication interface non-IT users can edit their own e-Learning contents on their personal computer as a series of slides from PPT, pdf, image and video data and upload to the WebELS server for e-Learning. Audio and cursor can be recorded onto each slide and be play-backed in a synchronized manner for helping understanding. WebELS is a Java-based server system and functioning in a low-speed Internet environment. The WebELS software is available as an open source system and is used in universities and industry in Japan and Asian countries.
Fully Redundant Decimal Arithmetic
Authors: Saeid Gorgin, Ghassem Jaberipur
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

Hardware implementation of all the basic radix-10 arithmetic operations is evolving as a new trend in the design and implementation of general purpose digital processors. Redundant representation of partial products and remainders is common in the multiplication and division hardware algorithms, respectively. Carry-free implementation of the more frequent add/subtract operations, with the byproduct of enhancing the speed of multiplication and division, is possible with redundant number representation. However, conversion of redundant results to conventional representations entails slow carry propagation that can be avoided if the results are kept in redundant format for later use as operands of other arithmetic operations. Given that redundant decimal representations, contrary to redundant binary, do not necessarily require extra storage, we are motivated to develop a framework for fully redundant decimal arithmetic, where all operands and results belong to the same redundant decimal number system and can be stored and later used as operands of further decimal operations. In this paper, we present a new faster decimal signed digit add/sub unit and show how it can be efficiently used in the design of decimal multipliers and dividers, where all operands and results are represented with the same redundant digit set [–7, 7].
AnalogySpace: reducing the dimensionality of common sense knowledge
Authors: Robert Speer, Catherine Havasi, Henry Lieberman
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

We are interested in the problem of reasoning over very large common sense knowledge bases. When such a knowledge base contains noisy and subjective data, it is important to have a method for making rough conclusions based on similarities and tendencies, rather than absolute truth. We present Analogy Space, which accomplishes this by forming the analogical closure of a semantic network through dimensionality reduction. It self-organizes concepts around dimensions that can be seen as making distinctions such as "good vs. bad" or "easy vs. hard", and generalizes its knowledge by judging where concepts lie along these dimensions. An evaluation demonstrates that users often agree with the predicted knowledge, and that its accuracy is an improvement over previous techniques.
Emerging marketsIsrael's technology industry as an economic growth engine
Authors: Orna Berry, Yigal Grayeff
Venue: Communications of the ACM (2009)

How government-industry collaboration can have far-reaching economic influences.
Robust Word Similarity Estimation Using Perturbation Kernels
Authors: Kevyn Collins-Thompson
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

We introduce perturbation kernels, a new class of similarity measure for information retrieval that casts word similarity in terms of multi-task learning. Perturbation kernels model uncertainty in the user's query by choosing a small number of variations in the relative weights of the query terms to build a more complete picture of the query context, which is then used to compute a form of expected distance between words. Our approach has a principled mathematical foundation, a simple analytical form, and makes few assumptions about the underlying retrieval model, making it easy to apply in a broad family of existing query expansion and model estimation algorithms.
Modelling Critical Infrastructures in Presence of Lack of Data with Simulated Annealing --- Like Algorithms
Authors: Vincenzo Fioriti, Silvia Ruzzante, Elisa Castorini, A. Pietro, Alberto Tofani
Venue: Proceedings of the 28th International Conference on Computer Safety, Reliability, and Security (2009)

We propose a method to analyze inter-dependencies of technological networks and infrastructures when dealing with few available data or missing data. We suggest a simple inclusive index for inter-dependencies and note that even introducing broad simplifications, it is not possible to provide enough information to whatever analysis framework. Hence we resort to a Simulated Annealing---like algorithm (SAFE) to calculate the most probable cascading failure scenarios following a given unfavourable event in the network, compatibly with the previously known data. SAFE gives an exact definition of the otherwise vague notion of criticality and individuates the "critical" links/nodes. Moreover, a uniform probability distribution is used to approximate the unknown or missing data in order to cope with the recent finding that Critical Infrastructures such as the power system exhibit the self-organizing criticality phenomenon. A toy example based on a real topology is given; SAFE proves to be a reasonably fast, accurate and computationally simple evaluation tool in presence of more than 50% missing data.
Acoustic Rendering of Data Tables Using Earcons and Prosody for Document Accessibility
Authors: Dimitris Spiliotopoulos, Panagiota Stavropoulou, Georgios Kouroupetroglou
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

Earlier works show that using a prosody specification that is derived from natural human spoken rendition, increases the naturalness and overall acceptance of speech synthesised complex visual structures by conveying to audio certain semantic information hidden in the visual structure. However, prosody alone, although exhibits significant improvement, cannot perform adequately in the cases of very large complex data tables browsed in a linear manner. This work reports on the use of earcons and spearcons combined with prosodically enriched aural rendition of simple and complex tables. Three spoken combinations earcons+prosody, spearcons+prosody, and prosody were evaluated in order to examine how the resulting acoustic output would improve the document-to-audio semantic correlation throughput from the visual modality. The results show that the use of non-speech sounds can further improve certain qualities, such as listening effort, a crucial parameter when vocalising any complex visual structure contained in a document.