ppxscal/embedding_network huggingface dataset:
Automating to-do lists for users: interpretation of to-dos for selecting and tasking agents
Authors: Yolanda Gil, Varun Ratnakar
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

To-do lists have been found to be the most popular personal information management tools, yet there is no automated system to interpret and act upon them when appropriate on behalf of the user. Automating to-do lists is challenging, not only because they are specified as free text but also because most items contain abbreviated tasks, many do not specify an action to be performed, and often refer to unrelated (personal) items. This paper presents our approach and an implemented system to process to-do list entries and map them to tasks that can be automated for the user by a set of agents. Since the format of to-do entries is not very amenable to natural language processing tools that can parse and create a structured interpretation, our approach is to exploit paraphrases of the target tasks that the agents can perform and that specify how the free-text maps to the task arguments. As users manually assign to-do to agents for automation, our system improves its performance by learning new paraphrases. We show an evaluation of our approach in a corpus of 2100 to-do entries collected from users of an office assistant multi-agent system.
Netroots: Online Progressives and the Transformation of American Politics
Authors: Matthew R. Kerbel
Venue:  (2009)

There is a big cohort of passionate, smart, politically savvy activists people who know how to organize, raise money, communicate and effectively utilize technology and new media who have come into politics within the last decade who feel like their strategies have been effective but their voices are not being heard. If these voices are ignored by the Democratic establishment, we could lose not only all the resources they bring to the Democratic Party, but could well lose the opening we have for a long-term Democratic majority. Mike Lux, Open Left, September 14, 2007, quoted in Chapter 1. The progressive netroots, fueled by bloggers writing on websites like the Daily Kos and working through online organizations like MoveOn, are on the verge of spearheading a revolution that may well define the coming political era. Still, their purpose, goals, and track record remain largely misunderstood. This book provides an understanding of the loosely affiliated groups that collectively call themselves the progressive netroots: who they are, what they hope to accomplish, what they ve done so far and how likely it is they will succeed in a plan so audacious it would result, if realized, in the transformation of America from a television-focused, center-right nation to an Internet-focused, center-left nation. Netroots weaves together a range of evidence and arguments to shatter conventional myths about this online movement. It explains why the left is better positioned than the right to take advantage of the decentralized nature of the Internet. As progressive candidates make uneven progress toward winning elections, the progressive netroots are working to drive media narratives and building real and virtual communities of activists that will contribute strongly to electoral success. Netroots documents the achievements of this emerging political force through an engaging analysis told with an eye toward history and in the bloggers own words. 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
Semantic roles for SMT: a hybrid two-pass model
Authors: Dekai Wu, Pascale Fung
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)

We present results on a novel hybrid semantic SMT model that incorporates the strengths of both semantic role labeling and phrase-based statistical machine translation. The approach avoids major complexity limitations via a two-pass architecture. The first pass is performed using a conventional phrase-based SMT model. The second pass is performed by a re-ordering strategy guided by shallow semantic parsers that produce both semantic frame and role labels. Evaluation on a Wall Street Journal newswire genre test set showed the hybrid model to yield an improvement of roughly half a point in BLEU score over a strong pure phrase-based SMT baseline -- to our knowledge, the first successful application of semantic role labeling to SMT.
On the Complexity of Matroid Isomorphism Problems
Authors: Raghavendra Rao B.V., Jayalal Sarma M.N.
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in $\Sigma_2^p$. In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is unlikely to be $\Sigma_2^p$-complete and is coNP-hard. We show that when the rank of the matroid is bounded by a constant, linear matroid isomorphism and matroid isomorphism are both polynomial time many-one equivalent to graph isomorphism.We give a polynomial time Turing reduction from graphic matroid isomorphism problem to the graph isomorphism problem. We then give a polynomial time many-one reduction from bounded rank matroid isomorphism problem to graphic matroid isomorphism, thus showing that all the above problems are polynomial time equivalent.Further, for linear and graphic matroids, we prove that the automorphism problem is polynomial time equivalent to the corresponding isomorphism problems. In addition, we give a polynomial time membership test algorithm for the automorphism group of a graphic matroid.
Head Tracking in First-Person Games: Interaction Using a Web-Camera
Authors: Torben Sko, Henry J. Gardner
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Recent advances in face-tracking technology have made it possible to recognize head movements using a commodity web-camera. This development has created exciting possibilities for enhancing player enjoyment during computer game play. In order to ascertain the real-world potential for head gestural input to First Person Shooter games, we have developed seven diverse interaction techniques and integrated these with a modern games engine. Evaluation of the techniques was carried out with four focus groups made up of expert games developers and experienced end-users. One of the techniques was further refined and subjected to a follow-up comparison test with promising results. A set of guidelines for the future development of head interaction techniques for computer games has been derived from the studies. All of the techniques have been built upon freely available software and open-sourced to encourage further research in this area.
E-Shopping Behavior and User-Web Interaction for Developing a Useful Green Website
Authors: Fei-Hui Huang, Ying-Lien Lee, Sheue-Ling Hwang
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

In recent years there has been an increasing respect for green issues. It has been addressed in various products/services as well. There is still no website to support green customers' decision process on electronic commerce (EC). The aim of this study is to understand user EC needs and expectations in order to elicit the design requirements of a useful interface. A questionnaire and an experiment were conducted to get users' green knowledge and to detect user external behaviors interacting with computer when e-shopping. The study is centered on electric green products, including computers, communication devices, and consumer electronics. The results are used to produce the online-shopping process flowchart and several suggestions for improving e-shopping. The suggestions including information search, information display, and web site features have been addressed. From this, further research will focus on the design of web sites supplying consumers with green product information.
A CA-Based Self-organizing Environment: A Configurable Adaptive Illumination Facility
Authors: Stefania Bandini, Andrea Bonomi, Giuseppe Vizzari, Vito Acconci
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

The term Ambient Intelligence refers to electronic environments that are sensitive and responsive to the presence of people; in this paper an example of ambient intelligence whose goal is to enhance the experience of pedestrians moving inside the related physical environment will be presented. In the described approach the environment itself is endowed with a set of sensors (to perceive humans or other physical entities such as dogs, bicycles, etc.), interacting with a set of actuators that choose their actions in an attempt improve the overall experience of these users; in particular, the introduced system realizes an adaptive illumination facility. The model for the interaction and action of sensors and actuators is a dissipative multilayered cellular automata, supporting a self-organization of the system as a response to the presence and movements of people inside it. The paper will introduce the model, as well as the results of simulations of its application in a concrete case study.
Design and Analyses of Efficient Chaotic Generators for Crypto-systems
Authors: Safwan El Assad, Hassan Noura, Ina Taralova
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

In this paper, we design and implement under Matlab/Simulink some efficient digital chaotic generators for data encryption/decryption process. Some of these generators (Logistic, PWLCM, Frey) are known, the others xcos(x), xexp[cos(x)], 2-D Tmap) are proposed. A number of designed generators contain cascaded layer to improve the statistical properties of the generated sequences. We introduce and demonstrate the importance of the perturbing orbit technique to avoid the dynamical degradation caused by the 2N-dimensional finite state space. This technique increases also the orbit cycle length. Finally, to quantify the security level of the proposed generators, we analyze their global dynamical properties using system and signal processing tools (Lyapunov exponents, bifurcation diagrams, distribution, pseudo phase space, auto¬correlation, cross correlation, NIST tests “National Institute of Standards and Technology “). Experimental and theoretical analyses show that the proposed generators have good cryptographic properties.
UMND1: unsupervised word sense disambiguation using contextual semantic relatedness
Authors: Siddharth Patwardhan, Satanjeev Banerjee, Ted Pedersen
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

In this paper we describe an unsupervised WordNet-based Word Sense Disambiguation system, which participated (as UMND1) in the SemEval-2007 Coarse-grained English Lexical Sample task. The system disambiguates a target word by using WordNet-based measures of semantic relatedness to find the sense of the word that is semantically most strongly related to the senses of the words in the context of the target word. We briefly describe this system, the configuration options used for the task, and present some analysis of the results.
Integration of Creativity into Website Design
Authors: Liang Zeng, Robert W. Proctor, Gavriel Salvendy
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

The desire to achieve a sound design of a product and its interaction with humans runs the gamut from the simplest hardware products to the most complex information technology systems. This paper proposes a conceptual framework highlighting the central role of creativity in ergonomic design of websites. The integration of creativity helps to achieve synergy of the three dimensions in ergonomic design: functionality, usability, and affectivity. A factor structure of website creativity is further discussed in terms of its relation to the ergonomic design framework. Suggestions for the realization of website creativity are provided, and future research directions are discussed.
SimCompany: An Educational Game Created through a Human-Work Interaction Design Approach
Authors: Pedro Campos, Ana Campos
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

We present a novel children's educational game, which was created through a human-work interaction design --- an emerging research field which advocates a better understanding of the relationship between work-domain based empirical studies and iterative design of prototypes and new technologies. We describe how "SimCompany", a game for teaching children about business management concepts, was created. SimCompany proved effective as a teaching tool about business management concepts, and initial evaluation showed a positive increase in students' rate of learning, compared to traditional teaching methods.
Extending BPMN with Submit/Response-Style User Interaction Modeling
Authors: Dagmar Auer, Verena Geist, Dirk Draheim
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Developing process-oriented enterprise systems not only asks for Business Process Management (BPM) but also for an appropriate user interface and data model. Current BPM and workflow technologies are neither integrated with user dialogs nor offer an appropriate data model. This paper describes a novel integrated framework for modeling process-oriented systems called Processes with User Interfaces and Data Modeling Integration (PUDI), which offers a solution to these shortcomings. For the projects described in this paper, we used the Business Process Modeling Notation (BPMN) for the processes, extensions to BPMN for submit/response-style user interaction, which is characteristic of form-based applications ranging from small Web applications to large ERP systems, and the Unified Modeling Language (UML) for the data model which defines both, the information and the message model. The paper discusses related work and describes real-world application scenarios which motivated our research on the proposed framework and illustrates its practical benefits.
Geometric consistency checking for local-descriptor based document retrieval
Authors: Eduardo Valle, David Picard, Matthieu Cord
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

In this paper, we evaluate different geometric consistency schemes, which can be used in tandem with an efficient architecture, based on voting and local descriptors, to retrieve multimedia documents. In many contexts the geometric consistency enforcement is essential to boost the retrieval performance. Our empirical results show however, that geometric consistency alone is unable to guarantee high-quality results in databases that contain too many non-discriminating descriptors.
Creating User Profiles from a Command-Line Interface: A Statistical Approach
Authors: José Antonio Iglesias, Agapito Ledezma, Araceli Sanchis
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Knowledge about computer users is very beneficial for assisting them, predicting their future actions or detecting masqueraders. In this paper, an approach for creating and recognizing automatically the behavior profile of a user from the commands (s)he types in a command-line interface, is presented.Specifically, in this research, a computer user behavior is represented as a sequence of UNIX commands. This sequence is transformed into a distribution of relevant subsequences in order to find out a profile that defines its behavior. Then, statistical methods are used for recognizing a user from the commands (s)he types. The experiment results, using 2 different sources of UNIX command data, show that a system based on our approach can efficiently recognize a UNIX user. In addition, a comparison with a HMM-base method is done.Because a user profile usually changes constantly, we also propose a method to keep up to date the created profiles using an age-based mechanism.
Dynamics of a Trusted Platform: A Building Block Approach, 1st edition
Authors: David Grawrock
Venue:  (2009)

Security threats are increasing in volume, diversity, and sophistication at the same time that high-value, sensitive data is more commonly being generated, used, and stored on standard business PCs. While the traditional focus of network protection has been on servers and network access devices, these PCs are typically lightly protected, coupled with the fact that a compromised PC may offer the means to obtain access to servers and other network assets, these characteristics have created an incentive for hackers to focus their efforts on client computing platforms. In Dynamics of a Trusted Platform David Grawrock has updated his highly popular Intel Safer Computing Initiative with new topics covering the latest developments in secure computing. The reader is introduced to the concept of Trusted Computing and the building block approach to designing security into PC platforms. The Intel(r) Trusted Execution Technology (Intel(r) TXT) is one of those building blocks that can be used to create a trusted platform by integrating new security features and capabilities into the processor, chipset, and other platform components. 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
Efficient multi-objective genetic algorithm for hardware-software partitioning in embedded system design: ENGA
Authors: M. Jagadeeswari, M. C. Bhuvaneswari
Venue: International Journal of Computer Applications in Technology (2009)

This paper presents a novel multi-objective evolutionary algorithm for hardware software partitioning of embedded systems. Customised genetic algorithms have been effectively used for solving complex optimisation problems (NP Hard) but are mainly applied to optimise a particular solution with respect to a single objective. Many real world problems in embedded systems have multiple objective functions like area, performance, power, latency, etc., which are to be maximised or minimised at the early stage of the design process. Hence multi-objective formulations are realistic models for many complex engineering optimisation problems. A multi-objective optimisation problem usually has a set of Pareto-optimal solutions, instead of one single optimal solution. A method is put forward for generating Pareto solutions using elitist non-dominated sorting genetic algorithm (ENGA) whose complexity is only O(MN&#178;), where M is the number of objectives and N is the population size. The algorithm is implemented using Visual C&#43;&#43; and the performance metrics for weighted-sum genetic algorithm (WSGA) and ENGA are compared. The results of extensive hardware&#47;software partitioning technique on numerous benchmarks are also presented which can be used practically at the early stage of the design process. From the simulation results ENGA (NSGA-II) was found to perform better than WSGA.
Web-Based Process Portals: Powering Business Process Management within Large Organisations
Authors: Robert Strobl, Thomas Mullner, Tobias Rausch
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

This paper elaborates the application areas of web-based process portals supporting the continuous business process management initiatives. Within the document specific examples are demonstrated where a web-based process portal can support the work of the different relevant stakeholders within an integrated business process management approach. As an example the ADONIS Process Portal is described with its provided functionality.
Breaking Anonymity by Learning a Unique Minimum Hitting Set
Authors: Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

Anonymity protocols are not secure unless the communication structure is not learnable even in the case that the entire network traffic can be monitored by an adversary. When the true communication structure is cloaked under anonymity sets, the adversary may disclose the peers of a certain user by waiting for the observations to contain a unique minimum hitting set. This approach has been called the hitting set attack in the literature. We give the first mathematical analysis on the number of observations required to learn a unique minimum hitting set. Because this attack involves solving an NP-hard problem in each round, we propose two new learning algorithms, both of which are very efficient computationally. The first one breaks anonymity by combining the most suspicious elements into a hitting set. Because this algorithm is not capable of verifying its hypothesis, it is imperative to estimate the required number of observations. On the other hand, the second one is able to prove its hypothesis correct, but needs more observations.
Designing Novel Image Search Interfaces by Understanding Unique Characteristics and Usage
Authors: Paul André, Edward Cutrell, Desney S. Tan, Greg Smith
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

In most major search engines, the interface for image search is the same as traditional Web search: a keyword query followed by a paginated, ranked list of results. Although many image search innovations have appeared in both the literature and on the Web, few have seen widespread use in practice. In this work, we explore the differences between image and general Web search to better support users' needs. First, we describe some unique characteristics of image search derived through informal interviews with researchers, designers, and managers responsible for building and deploying a major Web search engine. Then, we present results from a large scale analysis of image and Web search logs showing the differences in user behaviour. Grounded in these observations, we present design recommendations for an image search engine supportive of the unique experience of image search. We iterate on a number of designs, and describe a functional prototype that we built.
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
Authors: Farzad Hassanzadeh, David Rappaport
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

Let S denote a set of line segments in the plane. We say that a polygon P intersects S if every segment in S has a non-empty intersection with the interior or boundary of P. Currently, the best known algorithm finding a minimum perimeter polygon intersecting a set of line segments has a worst case exponential running time. It is also still unknown whether this problem is NP-hard. In this note we explore several approximation algorithms. We present efficient approximation algorithms that yield good empirical results, but can perform very poorly on pathological examples. We also present an O(n logn) algorithm with a guaranteed worst case performance bound that is at most ¿/2 times that of the optimum.