ppxscal/embedding_network huggingface dataset:
An Efficient Clustering Protocol with Reduced Energy and Latency for Wireless Sensor Networks
Authors: A. Allirani, M. Suganthi
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

The applications in wireless networks deem data gathering as an essential process that intends to increase the lifetime of the network by utilizing energy efficient techniques. Correspondingly, the energy efficiency and network lifetime in wireless sensor network can be enhanced by implementing an efficient technique, Clustering. This paper intends to minimize the energy and latency through efficient clustering protocol (ECP) architecture. In wireless micro-sensor networks, ECP architecture aims at achieving low energy dissipation and latency provided that application specific quality is not sacrificed. The ECP utilizes (i) randomized, adaptive, self - configuring cluster formation (ii) localized control for data transfers and (iii) application - specific data processing, for instance data aggregation or compression to achieve the goal. The cluster formation algorithm produces good clusters as the result by allowing each node to make autonomous decisions. The simulation results demonstrate that this algorithm also reduces overhead to the protocol by reducing the energy and latency for cluster formation.
Efficient MaxCount and threshold operators of moving objects
Authors: Scot Anderson, Peter Revesz
Venue: Geoinformatica (2009)

Calculating operators of continuously moving objects presents some unique challenges, especially when the operators involve aggregation or the concept of congestion, which happens when the number of moving objects in a changing or dynamic query space exceeds some threshold value. This paper presents the following six d-dimensional moving object operators: (1) MaxCount (or MinCount), which finds the Maximum (or Minimum) number of moving objects simultaneously present in the dynamic query space at any time during the query time interval. (2) CountRange, which finds a count of point objects whose trajectories intersect the dynamic query space during the query time interval. (3) ThresholdRange, which finds the set of time intervals during which the dynamic query space is congested. (4) ThresholdSum, which finds the total length of all the time intervals during which the dynamic query space is congested. (5) ThresholdCount, which finds the number of disjoint time intervals during which the dynamic query space is congested. And (6) ThresholdAverage, which finds the average length of time of all the time intervals when the dynamic query space is congested. For these operators separate algorithms are given to find only estimate or only precise values. Experimental results from more than 7,500 queries indicate that the estimation algorithms produce fast, efficient results with error under 5%.
Hyper-minimisation Made Efficient
Authors: Paweł Gawrychowski, Artur Jeż
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

We consider a problem of hyper-minimisation of an automaton [2,3]: given a DFA M we want to compute a smallest automaton N such that the language L(M) ΔL(N) is finite, where Δ denotes the symmetric difference. We improve the previously known $\mathcal O (|\Sigma|n^2)$ solution by giving an expected $\mathcal O (|\delta|\log n)$ time algorithm for this problem, where |¿| is the size of the (potentially partial) transition function. We also give a slightly slower deterministic $\mathcal O(|\delta|\log^2 n)$ version of the algorithm.Then we introduce a similar problem of k-minimisation: for an automaton M and number k we want to find a smallest automaton N such that L(M) ΔL(N) ¿ Σ< k , i.e. the languages they recognize differ only on words of length less than k. We characterise such minimal automata and give algorithm with a similar complexity for this problem.
Intercultural Usability Surveys: Do People Always Tell "The Truth"?
Authors: Emilie W. Gould
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

Researchers have identified many ways that culture affects usability methods --- interviews, moderated tests, think-aloud protocols, and card sorts. This paper reviews some of that literature and discusses a project investigating the effect of culture on usability surveys.
DR: Divided Ring Leader Election Algorithm
Authors: Mehdi Vojdani, Yaser Taj
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

Extending distributed system require new strategy for management and maintenance. For managing distributed system we need one leader like other process in system. Problem is when leader like other process crashed. For solving these problems like these researchers has proposed a number of local based strategies that is each region try to do its work by itself and the results will be gathered in a distributed manner. Leader election is the process of determining a process as the manager of some task distributed among several processes (computers). We suppose like network topologies our distributed system topologies are token and star. We proposed new schemes and discussed about some aspects of them. We proposed divided algorithm in ring topology and we try to reduce latency in the broad networks optionally. Our algorithm reduces the latency against messages but a bit because latency is more important than number of messages. At the end we see how using of n in Divided (n).
Correction grammars for error handling in a speech dialog system
Authors: Hirohiko Sagawa, Teruko Mitamura, Eric Nyberg
Venue: Proceedings of HLT-NAACL 2004: Short Papers on XX (2004)

Speech recognition errors are inevitable in a speech dialog system. This paper presents an error handling method based on correction grammars which recognize the correction utterances which follow a recognition error. Correction grammars are dynamically created from existing grammars and a set of correction templates. We also describe a prototype dialog system which incorporates this error handling method, and provide empirical evidence that this method can improve dialog success rate and reduce the number of dialog turns required for error recovery.
On the Notion of "An Information Need"
Authors: Eduard Hoenkamp
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

`Information need' is a notion in IR that is ubiquitous, important, and intuitively clear. So far, surprisingly, the term seems to have defied formal definition. Of course, IR can continue to prosper without a formalization of `information need'. Yet when a field gets more mature there comes a time that frequently used notions should be formalized to make them susceptible of scrutiny. For IR such formalization should (1) be independent of a particular query language or document model, (2) allow that users formulate a need for information that may be unavailable or even nonexistent, and (3) allow that users try to circumscribe the very information they do not possess. To this end, the paper uses lattice theory to define a `formal information need', which, we argue, coincides with the intuitive notion precisely when a user's need for information can actually be filled.
Crossmedia Systems Constructed around Human Activities: A Field Study and Implications for Design
Authors: Katarina Segerståhl
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Many interactive systems today span across a range of interoperable IT artifacts, forming crossmedia systems. They aim at providing pervasive and synergistic support for human activities. This paper reports a three-month-long qualitative field study exploring the use of a crossmedia fitness system to support physical training. The main concern is how the system --- through the configuration of its components --- supports the primary activity. Users' primary motivation, elaborateness of their activities, internalization or externalization of their actions and their perceived threshold toward using distinct IT artifacts determined the utilization of the system and each of its components. Compositional aspects of the system, such as its hierarchical structure, distribution of functionality and functional modularity influenced its ability to support different ways of training. The article contributes by shedding light on aspects that influence the synergistic use of IT artifacts and by proposing implications for designing crossmedia systems.
Flow Policy Awareness for Distributed Mobile Code
Authors: Ana Almeida Matos
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

In the context of global computing, information flow security must deal with the decentralized nature of security policies. This issue is particularly challenging when programs are given the flexibility to perform declassifying instructions. We point out potential unwanted behaviors that can arise in a context where such programs can migrate between computation domains with different security policies. We propose programming language techniques for tackling such unwanted behaviors, and prove soundness of those techniques at the global computation level.
Implicit affinity networks and social capital
Authors: M. Smith, C. Giraud-Carrier, N. Purser
Venue: Information Technology and Management (2009)

Social networks are typically constructed based on explicit and well-defined relationships among individuals. In this paper, we describe another class of social networks, known as implicit affinity networks, where links are implicit in the patterns of natural affinities among individuals. An effective mathematical formulation of social capital based on implicit and explicit connections is given. Results with two Web communities, one focused on people's interests and one focused on people's blogs, exhibit rich dynamics and show interesting patterns of community evolution.
Affective interaction: How emotional agents affect users
Authors: Russell Beale, Chris Creed
Venue: International Journal of Human-Computer Studies (2009)

Embodied agents have received large amounts of interest in recent years. They are often equipped with the ability to express emotion, but without understanding the impact this can have on the user. Given the amount of research studies that are utilising agent technology with affective capabilities, now is an important time to review the influence of synthetic agent emotion on user attitudes, perceptions and behaviour. We therefore present a structured overview of the research into emotional simulation in agents, providing a summary of the main studies, re-formulating appropriate results in terms of the emotional effects demonstrated, and an in-depth analysis illustrating the similarities and inconsistencies between different experiments across a variety of different domains. We highlight important lessons, future areas for research, and provide a set of guidelines for conducting further research.
Using AI for olympic equestrian event preparation
Authors: Andy Hon Wai Chun
Venue: Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3 (2008)

This paper describes our experience in using modern Web 2.0 architecture, lightweight Python frameworks, and rapid prototyping to create an AI rostering and workforce management system to help prepare for the 2008 Beijing Olympic Equestrian Events, which will be held in Hong Kong. As part of the 2008 Olympics preparation, a scaled down "test" event - "The Good Luck Beijing - HKSAR 10th Anniversary Cup" was held in August 2007 as a dressed rehearsal for the Olympics Equestrian Events. To schedule and manage all the volunteers and staffs of this event, a Web-based AI "Workforce Management System" (WMS) was created. By leveraging on our existing Web-based application framework and AI platform, we were able to complete the entire AI project under very tight time constraints and helped Hong Kong successfully pass the readiness requirements of the International Olympic Committee. This paper focuses on our experience with using AI to support the Good Luck Beijing equestrian games. It describes the AI development approach we took as well as the AI architecture for the HR-XML compliant rostering system.
Tactical language and culture training systems: using artificial intelligence to teach foreign languages and cultures
Authors: W. Lewis Johnson, Andre Valente
Venue: Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3 (2008)

The Tactical Language and Culture Training System (TLCTS) helps people quickly acquire communicative skills in foreign languages and cultures. More than 20,000 learners worldwide have used TLCTS courses. TLCTS utilizes artificial intelligence technologies in multiple ways: during the authoring process, and at run time to process learner speech, interpret learner actions, control the response of non-player characters, and evaluate and assess learner performance and proficiency. This paper describes the architecture of TLCTS and the artificial intelligence technologies that it employs, and presents results from multiple evaluation studies that demonstrate the benefits of learning foreign language and culture using this approach.
Non-linear Filter Response Distributions of Natural Colour Images
Authors: Alexander Balinsky, Nassir Mohammad
Venue: Computational Color Imaging: Second International Workshop, CCIW 2009, Saint-Etienne, France, March 26-27, 2009. Revised Selected Papers (2009)

We observe a non-Gaussian heavy tailed distribution for the non-linear filter 1$$ \label{Filter} \gamma(U)(\mathbf r) = U(\bold r) - \sum_{ \mathbf s \in N(\mathbf r)} w{(Y)_{\mathbf r \mathbf s}} U(\mathbf s), $$applied to the chromacity channel 'U' (and equivalently to 'V') on individual natural colour images in the colour space YUV. We fit a Generalised Gaussian Distribution (GGD) to the histogram of the filter response, and observe the shape parameter (¿) to lie within the range 0 < ¿< 2, but rarely ¿> 1.
OptAssign-A web-based tool for assigning students to groups
Authors: David Meyer
Venue: Computers Education (2009)

A frequent task in educational settings is to assign students to groups based on stated preferences for some projects or topics. This paper introduces a web-based tool supporting both the work flow of collecting student data and the group formation. The latter is based on finding optimal solutions to suitable mathematical assignment problems, allowing for a number of constraints regarding size and structure of the groups. Evaluation results show advantages compared to manual procedures in terms of time savings for lecturers, and higher fairness and correctness as perceived by students.
Eating our own dog food: DSLs for generative and transformational engineering
Authors: James R. Cordy
Venue: Proceedings of the eighth international conference on Generative programming and component engineering (2009)

Languages and systems to support generative and transformational solutions have been around a long time. Systems such as XVCL, DMS, ASF+SDF, Stratego and TXL have proven mature, efficient and effective in a wide range of applications. Even so, adoption remains a serious issue - almost all successful production applications of these systems in practice either involve help from the original authors or years of experience to get rolling. While work on accessibility is active, with efforts such as ETXL, Stratego XT, Rascal and Colm, the fundamental big step remains - it's not obvious how to apply a general purpose transformational system to any given generation or transformation problem, and the real power is in the paradigms of use, not the languages themselves. In this talk I will propose an agenda for addressing this problem by taking our own advice - designing and implementing domain specific languages (DSLs) for specific generative, transformational and analysis problem domains. We widely advise end users of the need for DSLs for their kinds of problems - why not for our kinds? And we use our tools for implementing their DSLs - why not our own? I will outline a general method for using transformational techniques to implement transformational and generative DSLs, and review applications of the method to implementing example text-based DSLs for model-based code generation and static code analysis. Finally, I will outline some first steps in implementing model transformation DSLs using the same idea - retaining the maturity and efficiency of our existing tools while bringing them to the masses by "eating our own dogfood".
Using emotion to gain rapport in a spoken dialog system
Authors: Jaime C. Acosta
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Student Research Workshop and Doctoral Consortium (2009)

This paper describes research on automatically building rapport. This is done by adapting responses in a spoken dialog system to users' emotions as inferred from nonverbal voice properties. Emotions and their acoustic correlates will be extracted from a persuasive dialog corpus and will be used to implement an emotionally intelligent dialog system; one that can recognize emotion, choose an optimal strategy for gaining rapport, and render a response that contains appropriate emotion, both lexically and auditory. In order to determine the value of emotion modeling for gaining rapport in a spoken dialog system, the final implementation will be evaluated using different configurations through a user study.
Cooperative exploration in the electronic marketplace
Authors: David Sarne, Sarit Kraus
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

In this paper we study search strategies of agents that represent buyer agents' coalitions in electronic marketplaces. The representative agents operate in environments where numerous potential complex opportunities can be found. Each opportunity is associated with several different terms and conditions thus differing from other opportunities by its value for the coalition. Given a search cost, the goal of the representative agent is to find the best set of opportunities which fulfills the coalition's demands with the maximum overall utility, to be divided among the coalition members. Given the option of side-payments, this strategy will always be preferred by all coalition members (thus no conflict of interests), regardless of the coalition's payoff division protocol. We analyze the incentive to form such coalitions and extract the optimal search strategy for their representative agents, with a distinction between operating in B2C and C2C markets. Based on our findings we suggest efficient algorithms to be used by the representative agents for calculating a strategy that maximizes their expected utilities. A computational-based example is given, illustrating the achieved performance as a function of the coalition's members' heterogeneity level.
A Framework of Multimedia E-Learning Design for Engineering Training
Authors: Daniela Borissova, Ivan Mustakerov
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

The paper presents a new framework approach for design and development of an interactive multimedia e-learning system for engineering training. The main goal of the paper is to encourage low cost developing of effective and customized e-learning systems for engineering training by using popular and inexpensive software tools. The proposed framework is a generalization of the authors' experience gained in developing of a pneumoautomatics e-training system. It can be used for developing of Web-based on-line or off-line e-learning systems for students or specialists customized training. The proposed framework is illustrated by some screen snapshots and descriptions of operational algorithms. The software realization of the pneumoautomatics example is done by means of HTML and JavaScript languages and was tested and used for students training.
Research on the Shaping Approach for Non-cylinder Piston Turning
Authors: Shu-tong Xie, Yin-biao Guo, Qing-quan Yang, Lu-shuang Chen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

To satisfy the manufacturing of pistons with complex profile and high accuracy demand, the shaping approach of non-cylinder piston surface with CNC turning is studied in this paper. Piston surface is divided into three characteristics of middle-convex, ellipse, and varying ellipse. And three corresponding processing algorithms are proposed. By using the algorithms, lots of micro elliptic cylinders are generated, and the piston surface is approached by organizing them together. Furthermore, the surface errors produced by the algorithms are analyzed, and error formulas are also deduced. Based on these, we develop the data processing software for piston surface, providing control data of the cutter for piston machining.
Cluster Based Partition for Multi-dimensional Range Query in DAS Model
Authors: Wang Jieping, Du Xiaoyong
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Database-as-a-Service (DAS) is an emerging database management paradigm wherein querying on encrypted data directly is a performance critical problem, to which partition based index is an effective solution. For multi-dimensional range query, generating partition on each dimension would increase information leakage to a large extent, while previous multi-dimensional partition would cause large efficiency loss, especially when the data distribution is sparse. To achieve guaranteed security with much less efficiency loss, in this paper we propose cluster based multi-dimensional partition (CBMP). First, CBMP decompose the whole space into clusters, which only cover non-empty area. To get better clustering effect, a new cluster criteria based on full neighbor is proposed. Second, since optimal secure partition is NP-hard, several heuristic based algorithms including distance based and Hilbert based are proposed. Experiments on real dataset and synthetic dataset show that distance based algorithm could achieve approximately least efficiency loss.
Redistributing time-based rights between consumer devices for content sharing in DRM system
Authors: Sangho Lee, Jong Kim, Sung Je Hong
Venue: International Journal of Information Security (2009)

Device-based digital rights management (DRM) systems tightly bind rights for content to a device. However, it can decrease the consumers&#x2019; convenience because it disturbs consumers who want to use the already purchased content with their other devices freely. Previous research into solving this problem still have burdens such as restricting the number of devices that a consumer can use and requiring a special device that manages content sharing. In this paper, we propose a new rights sharing scheme which does not restrict the number of devices that a consumer can use and does not require a specialized device. In our scheme, the right to use content is represented as the right to use the content for a certain amount of time. Consumers can use the content with any of their devices by redistributing the usage amount of time between devices. The redistribution process only requires local synchronization among participating devices. To prevent illegal content sharing and to detect illegally increased content usage time, the amount of time that a consumer can have is limited and the rights for each unit of time has a unique number to prevent illegal duplications. We present data structures and protocols, analyze security properties of our scheme, compare our scheme with related work, and evaluate our scheme through implementation.