ppxscal/embedding_network huggingface dataset:
Exploring Geometric Shapes with Touch
Authors: Thomas Pietrzak, Andrew Crossan, Stephen A. Brewster, Benoît Martin, Isabelle Pecci
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

We propose a new technique to help users to explore geometric shapes without vision. This technique is based on a guidance using directional cues with a pin array. This is an alternative to the usual technique that consists of raising the pins corresponding to dark pixels around the cursor. In this paper we compare the exploration of geometric shapes with our new technique in unimanual and bimanual conditions. The users made fewer errors in unimanual condition than in bimanual condition. However they did not explore the shapes more quickly and there was no difference in confidence in their answer.
Towards learning stochastic logic programs from proof-banks
Authors: Luc De Raedt, Kristian Kersting, Sunna Torge
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Stochastic logic programs combine ideas from probabilistic grammars with the expressive power of definite clause logic; as such they can be considered as an extension of probabilistic context-free grammars. Motivated by an analogy with learning tree-bank grammars, we study how to learn stochastic logic programs from proof-trees. Using proof-trees as examples imposes strong logical constraints on the structure of the target stochastic logic program. These constraints can be integrated in the least general generalization (lgg) operator, which is employed to traverse the search space. Our implementation employs a greedy search guided by the maximum likelihood principle and failure-adjusted maximization. We also report on a number of simple experiments that show the promise of the approach.
The Performance of the OFDM System's PAPR of Different Segmentation of PTS
Authors: Hongxia Wang, Xiuli Ma, Zhijing Zhang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Because the OFDM signal has higher Peak to Average Power Ratio (PAPR), the efficiency of Amplifier is badly influenced in Orthogonal Frequency Division Multiplexing (OFDM) system and caused signal distortion in-band. Therefore, reducing PAPR of OFDM signal is very important. The Partial Transmitted Sequences (PTS) method can effectively reduce PAPR of the OFDM signals, but the basic algorithm of PTS has higher computational complexity, the appropriate segmentation method can reduce the computational complexity. Based on analyzing the basic principles of adjacent segmentation, interleaved segmentation and pseudo-random segmentation, mainly analyses the adjacent segmentation’s different groups influenced the PAPR of OFDM system. Numerical results show that the adjacent segmentation’s different groups can reduce the PAPR of OFDM system effectively. and deduced the computational complexity of the algorithm.
Technology-Flat Research of Information Resource Amalgamation
Authors: Rigui Zhou
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

For the sake of effectively answering Public Emergency (PE) and adequately utilizing all kind of resources to reduce influence of disaster, this paper presents an architecture of technology-flat of information resource amalgamation. It can amalgamate the information resources and the share the resources. Therefore, both aims of decreasing the threaten of disasters and increasing the using rate of resource is achieved. 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
Reconstructing Data Perturbed by Random Projections When the Mixing Matrix Is Known
Authors: Yingpeng Sang, Hong Shen, Hui Tian
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

Random Projection ($\mathcal{RP}$) has drawn great interest from the research of privacy-preserving data mining due to its high efficiency and security. It was proposed in [27] where the original data set composed of m attributes, is multiplied with a mixing matrix of dimensions k×m (m > k) which is random and orthogonal on expectation, and then the k series of perturbed data are released for mining purposes. To our knowledge little work has been done from the view of the attacker, to reconstruct the original data to get some sensitive information, given the data perturbed by $\mathcal{RP}$ and some priori knowledge, e.g. the mixing matrix, the means and variances of the original data. In the case that the attributes of the original data are mutually independent and sparse, the reconstruction can be treated as a problem of Underdetermined Independent Component Analysis (UICA), but UICA has some permutation and scaling ambiguities. In this paper we propose a reconstruction framework based on UICA and also some techniques to reduce the ambiguities. The cases that the attributes of the original data are correlated and not sparse are also common in data mining. We also propose a reconstruction method for the typical case of Multivariate Gaussian Distribution, based on the method of Maximum A Posterior (MAP). Our experiments show that our reconstructions can achieve high recovery rates, and outperform the reconstructions based on Principle Component Analysis (PCA).
Towards Open Access Accessibility Everywhere: The ÆGIS Concept
Authors: Peter Korn, Evangelos Bekiaris, Maria Gemou
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

The current paper presents the concept of ÆGIS Integrating Project (Grant Agreement: 224348), which aims to embed support for accessibility into every aspect of ICT-including the pre-built user-interface components, developer's tools, software applications and the run-time environment, and via embeddable assistive technologies. ÆGIS is a 3,5 years project, aiming to constitute a breakthrough in the eInclusion area, through the development of an Open Accessibility Framework, upon which open source accessibility interfaces and applications for the users as well as accessibility toolkits for the developers will be built. Three mainstream markets are targeted, namely the desktop, rich Internet applications and mobile devices/applications market segments.
Recognising the predicate-argument structure of Tagalog
Authors: Meladel Mistica, Timothy Baldwin
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

This paper describes research on parsing Tagalog text for predicate-argument structure (PAS). We first outline the linguistic phenomenon and corpus annotation process, then detail a series of PAS parsing experiments.
Study on Simulation Technology of 3G Mobile Communication Network
Authors: Zhu Li-zhong, Yao Zheng-lin, Guo Hai-feng
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

The simulation technology of 3G mobile communication network is a very important part of network researching. It can increase researching efficiency and decrease developing cost of network. At first, in this paper, we have discussed producing method of some kinds of stochastic numbers, include heavy- tail distributing stochastic numbers, which often used in network simulation. We have also introduced structure of UMTS (Universal Mobile Telecommunication System). Finally, a 3G mobile communication network simulation model has been set up.
A simulation study of traffic efficiency improvement based on Car-to-X communication
Authors: Henrik Schumacher, Christian Priemer, Eric N. Slottke
Venue: Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking (2009)

There are several promising applications for car-to-x communication that aim at the improvement of traffic efficiency. With the increasing maturity of car-to-x communication systems, insights into the impacts of these applications on vehicular traffic are required. In this paper, we present a simulation study of traffic efficiency improvements that can be obtained by the utilization of a merging assistance application ahead of a freeway lane drop. Our investigations are based on the traffic simulation tool AIMSUN. We connect the traffic simulator with a simulation model that implements the merging assistance application as well as the message exchange between vehicles and a roadside unit. Simulation results show significant traffic efficiency improvements indicated by travel time reductions of up to 30% in dense traffic under ideal conditions.
Aiming for Efficiency by Detecting Structural Similarity
Authors: Judith Winter, Nikolay Jeliazkov, Gerold Kühne
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

When applying XML-Retrieval in a distributed setting, efficiency issues have to be considered, e.g. reducing the network traffic involved in an swering a given query. The new Efficiency Track of INEX gave us the opportu nity to explore the possibility of improving both effectiveness and efficiency by exploiting structural similarity. We ran some of the track's highly structured queries on our top-k search engine to analyze the impact of various structural similarity functions. We applied those functions first to the ranking and based on that to the query routing process. Our results indicate that detection of structural similarity can be used in order to re duce the amount of messages sent between distributed nodes and thus lead to more efficiency of the search.
Continuous Control Paradigms for Direct Brain Interfaces
Authors: Melody Moore Jackson, Rudolph Mappus, Evan Barba, Sadir Hussein, Girish Venkatesh, Chetna Shastry, Amichai Israeli
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Direct Brain Interfaces (DBIs) offer great possibilities for people with severe disabilities to communicate and control their environments. However, many DBI systems implement discrete selection, such as choosing a letter from an alphabet, which offers limited control over certain tasks. Continuous control is important for applications such as driving a wheelchair or drawing for creative expression. This paper describes two projects currently underway at the Georgia Tech BrainLab exploring continuous control interface paradigms for an EEG-based approach centered on responses from visual cortex, and functional near Infrared (fNIR) imaging of the language center of the brain.
A New Algorithm for Frequent Itemsets Mining Based on Apriori and FP-Tree
Authors: Qihua Lan, Defu Zhang, Bo Wu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Frequent item sets mining plays an important role in association rules mining. The apriori algorithm and the FP-growth algorithm are the most famous algorithms, existing frequent item sets mining algorithms are almost improved based on the two algorithms respectively and suffer from many problems when mining massive transctional datasets. In this paper, a new algorithm named APFT is proposed, it combines the Apriori algorithm and FP-tree structure which proposed in FP-growth algorithm. The advantage of APFT is that it dosen’t need to generate conditional pattern bases and sub- conditional pattern tree recursively. And the results of theexperiments show that it works faster than Apriori and almost as fast as FP-growth.
Structural properties of lexical systems: monolingual and multilingual perspectives
Authors: Alain Polguère
Venue: Proceedings of the Workshop on Multilingual Language Resources and Interoperability (2006)

We introduce a new type of lexical structure called lexical system, an interoperable model that can feed both monolingual and multilingual language resources. We begin with a formal characterization of lexical systems as "pure" directed graphs, solely made up of nodes corresponding to lexical entities and links. To illustrate our approach, we present data borrowed from a lexical system that has been generated from the French DiCo database. We later explain how the compilation of the original dictionary-like database into a net-like one has been made possible. Finally, we discuss the potential of the proposed lexical structure for designing multilingual lexical resources.
The effect of linguistic devices in information presentation messages on comprehension and recall
Authors: Martin I. Tietze, Andi Winterboer, Johanna D. Moore
Venue: Proceedings of the 12th European Workshop on Natural Language Generation (2009)

In this paper we examine the effect of linguistic devices on recall and comprehension in information presentation using both recall and eye-tracking data. In addition, the results were validated via an experiment using Amazon's Mechanical Turk micro-task environment.
ESSE: Learning Disability Classification System for Autism and Dyslexia
Authors: Nor'Ain Mohd Yusoff, Muhammad Hafiz Abdul Wahab, Mohamad Azrulnisyam Aziz, Fauzul Jalil Asha'Ari
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

This paper presents an Expert System for Special Education (ESSE) based on scenario in Malaysia. This system is developed through the process of knowledge-gaining which is gathered from various expertise in chosen domain. Realizing the limitation of traditional classification system that teachers adopted, we developed ESSE to automate a centralized decision making system. ESSE is also able to provide consistent answers for repetitive decisions, processes and tasks. Besides, teachers using this system hold and maintain significant level of information pertaining both learning disabilities, thus reduce amount of human errors. ESSE knowledge-based resulted from the knowledge engineering called Qualifiers and Choice. Both are gathered from the analysis of symptoms that are experienced by Autism and Dyslexia patients. Every type of disability is divided to several categories and sub-category to facilitate question's arrangement. This paper presents a review of Expert System for Special Education (ESSE), problems arises and the knowledge-based classification systems.
Adding redundant features for CRFs-based sentence sentiment classification
Authors: Jun Zhao, Kang Liu, Gen Wang
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

In this paper, we present a novel method based on CRF's in response to the two special characteristics of "contextual dependency" and "label redundancy" in sentence sentiment classification. We try to capture the contextual constraints on sentence sentiment using CRFs. Through introducing redundant labels into the original sentimental label set and organizing all labels into a hierarchy, our method can add redundant features into training for capturing the label redundancy. The experimental results prove that our method outperforms the traditional methods like NB, SVM, MaxEnt and standard chain CRFs. In comparison with the cascaded model, our method can effectively alleviate the error propagation among different layers and obtain better performance in each layer.
SPMTM: A Novel ScratchPad Memory Based Hybrid Nested Transactional Memory Framework
Authors: Degui Feng, Guanjun Jiang, Tiefei Zhang, Wei Hu, Tianzhou Chen, Mingteng Cao
Venue: Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies (2009)

Chip multiprocessor (CMP) has been the mainstream of processor design with the progress in semiconductor technology. It provides higher concurrency for the threads compared with the traditional single-core processor. Lock-based synchronization of multi-threads has been proved as an inefficient approach with high overhead. The previous works show that TM is an efficient solution to solve the synchronization of multi-threads. This paper presents SPMTM, a novel on-chip memory based nested TM framework. The on-chip memory used in this framework is not cache but scratchpad memory (SPM), which is software-controlled SRAM on chip. TM information will be stored in SPM to enhance the access speed and reduce the power consumption in SPMTM. Experimental results show that SPMTM can obtain average 16.3% performance improvement of the benchmarks compared with lock-based synchronization and with the increase in the number of processor core, the performance improvement is more significant.
Challenges in Constraint-Based Analysis of Hybrid Systems
Authors: Andreas Eggers, Natalia Kalinnik, Stefan Kupferschmid, Tino Teige
Venue: Recent Advances in Constraints: 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, Rome, Italy, June 18-20, 2008, Revised Selected Papers (2009)

In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such formulae, is aimed at bounded model checking of hybrid systems. In this paper, we identify challenges emerging from planned and ongoing work to enhance the iSAT algorithm. First, we propose an extension of iSAT to directly handle ordinary differential equations as constraints. Second, we outline the recently introduced generalization of the iSAT algorithm to deal with probabilistic hybrid systems and some open research issues in that context. Third, we present ideas on how to move from bounded to unbounded model checking by using the concept of interpolation. Finally, we discuss the adaption of some parallelization techniques to the iSAT case, which will hopefully lead to performance gains in the future. By presenting these open research questions, this paper aims at fostering discussions on these extensions of constraint solving.
On the Input Language of ASP Grounder Gringo
Authors: Martin Gebser, Roland Kaminski, Max Ostrowski, Torsten Schaub, Sven Thiele
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We report on recent advancements in the development of grounder Gringo for logic programs under answer set semantics. Like its relatives, DLV and Lparse, Gringo has in the meantime reached maturity and offers a rich modeling language to program developers. The attractiveness of Gringo is fostered by the fact that it significantly extends the input language of Lparse while supporting a compatible output format, recognized by many state-of-the-art ASP solvers.
Mobility emulator for DTN and MANET applications
Authors: Hayoung Yoon, JongWon Kim, Maximilian Ott, Thierry Rakotoarivelo
Venue: Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization (2009)

Repeatable experiments to study the performance or behavior of wireless mobile adhoc network (MANET) systems such as a delay (or disruption) tolerant network (DTN) are challenging tasks. One approach to do this is to build a realistic mobile testbed, on which the mobile devices and test applications or network protocols can be deployed. This testbed approach, however, often results in expensive management and setup costs. Therefore, most of algorithms and applications considering device mobility as a critical parameter have been tested using trace-based analysis and computer simulations. However, these evaluation methods are not sufficient to reflect various natures of mobile wireless networks. This paper presents the design and implementation of an On/Off-based mobility emulation method, which virtually migrates applications over a static-grid testbed to mimic the device mobility. This emulation method assists DTN and MANET developers to evaluate their work in repeatable ways on the lab-scale static-grid testbed. Through extensive experimental analysis and a case study using two different testbeds, we show that the proposed emulation method can successfully recreate important characteristics of mobility trace data, such as contact and inter-contact time distributions.
Experience Report on Using a Domain Model-Based Extractive Approach to Software Product Line Asset Development
Authors: Hyesun Lee, Hyunsik Choi, Kyo C. Kang, Dohyung Kim, Zino Lee
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

When we attempted to introduce an extractive approach to a company, we were faced with a challenging project situation where legacy applications did not have many commonalities among their implementations as they were developed independently by different teams without sharing a common code base. Although there were not many structural similarities, we expected to find similarities if we view them from the domain model perspective as they were in the same domain and were developed with the object-oriented paradigm. Therefore, we decided to place the domain model at the center of extraction and reengineering, thus developing a domain model-based extractive method. The method has been successfully applied to introduce software product line to a set-top box manufacturing company.
Stochastic stability of Markovian jumping Hopfield neural networks with constant and distributed delays
Authors: Hongyang Liu, Lin Zhao, Zexu Zhang, Yan Ou
Venue: Neurocomputing (2009)

This paper investigates the problem of stability analysis for Markovian jumping Hopfield neural networks (MJHNNs) with constant and distributed delays. Some new delay-dependent stochastic stability criteria are derived based on a novel Lyapunov-Krasovskii functional (LKF) approach. These new criteria based on the delay partitioning idea prove to be less conservative, since the conservatism could be notably reduced by thinning the delay partitioning. Numerical examples are provided to show the effectiveness and advantage of the proposed techniques.
Asymmetric Dominance- and Compromise Effects in the Financial Services Domain
Authors: Erich Christian Teppan, Alexander Felfernig
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Recommender systems help customers toidentify products which fulfill certain requirements.Many different approaches have been developed andwork well for different domains. What has been ignoredso far is the fact that psychological phenomena can resultin suboptimal decision taking on recommender resultpages. This paper presents a user study investigating theAsymmetric Dominance Effect and the CompromiseEffect in the domain of financial services. The empiricalfindings are compared with the calculations of the SimpleDominance Model which serves as a model foridentification and explanation of such effects.Furthermore, we show how to identify misleading effectson recommender result pages, and how to correctproduct perception such that the felt utility reflects theutility calculated by recommender systems.