ppxscal/embedding_network huggingface dataset:
Wave like an Egyptian: accelerometer based gesture recognition for culture specific interactions
Authors: Matthias Rehm, Nikolaus Bee, Elisabeth André
Venue: Proceedings of the 22nd British HCI Group Annual Conference on HCI 2008: People and Computers XXII: Culture, Creativity, Interaction - Volume 1 (2008)

The user's behavior and his interpretation of interactions with others is influenced by his cultural background, which provides a number of heuristics or patterns of behavior and interpretation. This cultural influence on interaction has largely been neglected in HCI research due to two challenges: (i) grasping culture as a computational term and (ii) infering the user's cultural background by observable measures. In this paper, we describe how the Wiimote can be utilized to uncover the user's cultural background by analyzing his patterns of gestural expressivity in a model based on cultural dimensions. With this information at hand, the behavior of an interactive system can be adapted to culture-dependent patterns of interaction.
Upper bounds on the upper signed total domination number of graphs
Authors: Erfang Shan, T. C. E. Cheng
Venue: Discrete Applied Mathematics (2009)

Let G=(V,E) be a graph. A function f:V->{-1,+1} defined on the vertices of G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. A signed total dominating function f is minimal if there does not exist a signed total dominating function g, f
Performance Loss Model Based Forecasting Method of Robot Assembly Quality
Authors: Pengzhong Li, Weimin Zhang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

The changing tendency of robot performance varying with assembly error was analyzed. Based on performance tendency curve, performance loss function is given to reflect performance change led by assembly error. Robot performance loss is divided by three phases, and all terms meeting practical application of performance loss function were put forward. Calculating process of index of performance loss was given, establishing a performance loss model of robot. An approximate design and development process based on performance loss model was built. Finally, an example was given to demonstrate calculating procedure of loss model. Through index of performance loss, changing information of assembly quality impacted by assembly error is known clearly. The effect of uncertainty of robot assembly process on assembly quality and performance is known through assembly error.
Personal Computer Upgrades Demystified: The Laymans Guide to Upgrading Computer Components
Authors: William Ford
Venue:  (2007)

Born in northern Virginia, William Ford has had a relationship with computers since 1985. William worked as a computer sales associate and as a parts specialist in the early 1990s and later as a technician. He is currently a consultant and technical assistant to the Appomattox County Library. William went to school in Fairfax County, Virginia, and acquired training in computer sales and services from CompUSA and Best Buy. He is a self-taught computer technician and earned several certifications from Brainbench.com in 2001, including Windows administration and networking. Currently he runs an on-site computer repair service in Appomattox, Virginia. William has designed and built many computer systems including a model that was designed for long-time friend, Daniel, as a film and video editing system for professional filmmaking. Williams desire is to make technology easier to understand so everyone can take advantage of the technological advances of our age.
Tracing Whodunit
Authors: Orlena Gotel
Venue: Proceedings of the 2008 Third International Workshop on Multimedia and Enjoyable Requirements Engineering - Beyond Mere Descriptions and with More Fun and Games (2008)

"It was Olly by the water cooler on a post-it!" Being able to trace back to the source of a requirement is often crucial to gain clarification on the requirement and to support any subsequent change. The medium used to capture the requirement at its point of origin and its initial representational form can also convey information that is pertinent to understanding the trace record. However, preparing for the potential to retrieve such seemingly simple information on a project can be sidelined in the rush to engineer an end product, meaning that the ability to undertake pre-requirements traceability is lost. This paper suggests that a familiar whodunit game could be used to raise awareness of this important topic amongst students and practitioners, and be used for team building on projects. It is intended to seed a wider discussion on whether there is a place for a Requirements Engineering Compendium of Games. 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
Training One-class Support Vector Machines in the Primal Space
Authors: Lei Wang, Yong Yang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In this paper, we proposed a novel Newton-type solver for one-class support vector machines in the primal space directly. Firstly, utilizing reproducing property of kernel and Huber regression function, original constrained quadratic programming is transformed into approximate unconstrained one, which is continuous and twice differentiable. Then, we give a Newton-type training algorithm to solve it. Further analysis shows the computation complexity of our algorithm is identical with theoretical lower bound for solving one-class support vector machines. In the end, experiments on 9 UCI datasets are done to validate the affectivity of proposed algorithm, and when comparing with dual method (LIBSVM),its produces comparative testing accuracy, better training speed, and less support vectors.
Where third wave HCI meets HRI: report from a workshop on user-centred design of robots
Authors: Ylva Fernaeus, Sara Ljungblad, Mattias Jacobsson, Alex Taylor
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

In this report we discuss some of the challenges when applying a user-centred design approach in the field of human-robot interaction (HRI). The discussion is based on a one-day workshop at the NordiCHI'08 conference, investigating how methods, techniques and perspectives from the field of Human Computer Interaction (HCI) could contribute to and learn from recent developments in the area of HRI. Emphasis was put on topics that are infrequent in mainstream HCI such as machine movement, autonomy, anthropomorphism, physical interaction, environmental issues and issues concerned more generally with cultural notions of robots.
Long-Range Monsoon Rainfall Pattern Recognition and Prediction for the Subdivision 'EPMB' Chhattisgarh Using Deterministic and Probabilistic Neural Network
Authors: S. Karmakar, M. K. Kowar, P. Guhathakurta
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Attempts to predict long-range monsoon rainfall over the subdivision EPMB, Three layer perception feed forward back propagation deterministic and probabilistic artificial neural network models have been developed. 61 years data for 1945–2006 have been used, of which the first 51 years (1945–1995) of data are used for training the network and data for the period 1996–2006 are used independently for validation. We have found that the mean absolute deviation (% of mean) of the model is less than and half of the standard deviation (% of mean) in the independent period (1996-2006) of the subdivision in deterministic forecast. Correlation between actual and particular model predicted values are more than 0.8 for the districts and 0.7 for the whole subdivision in deterministic forecast. However performance of the model in probabilistic forecast is better evaluated over deterministic forecast. The models developed and their evaluations have been presented in this paper.
The Minimum Reload s-t Path/Trail/Walk Problems
Authors: Laurent Gourvès, Adria Lyra, Carlos Martinhon, Jérôme Monnot
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

This paper deals with problems on non-oriented edge-colored graphs. The aim is to find a route between two given vertices s and t. This route can be a walk, a trail or a path. Each time a vertex is crossed by a walk there is an associated non-negative reload cost r i,j , where i and j denote, respectively, the colors of successive edges in this walk. The goal is to find a route whose total reload cost is minimum. Polynomial algorithms and proofs of NP-hardness are given for particular cases: when the triangle inequality is satisfied or not, when reload costs are symmetric (i.e. r i,j = r j,i ) or asymmetric. We also investigate bounded degree graphs and planar graphs.
A novel reliable and energy-saving forwarding technique for wireless sensor networks
Authors: Giuseppe Campobello, Alessandro Leonardi, Sergio Palazzo
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

The main aim of this paper is to generalize and improve a recently proposed forwarding technique based on the Chinese Remainder Theorem (CRT). The proposed technique outperforms more traditional approaches in terms of both energy efficiency and fair distribution of energy consumption, and requires very few changes to the commonly used forwarding schemes for its implementation. In particular, in this paper it is shown how to apply the CRT-based forwarding method on a realistic wireless network where unreliable erasure channels are considered together with topological changes. Furthermore, an analytical model for the novel forwarding technique has been derived and the trade-off between reliability and energy saving has been investigated.
Math connections in computer science
Authors: Ralph Bravaco, Bo Kim, Michael B. Gousie, Linda Wilkens
Venue: Journal of Computing Sciences in Colleges (2009)

This panel will lead a discussion about the role and relevance of mathematics in undergraduate Computer Science education. We will explore the major question pertaining to math connections in computer science: "How can we make the math that C.S. students take more meaningful to their major?" The panelists will describe the approaches they have taken toward achieving this goal. Ralph Bravaco will discuss his experience integrating math and computer science via learning communities at Stonehill College. Michael Gousie will describe a new Foundations of Computing Theory course that has been added to the C.S. curriculum at Wheaton College. Bo Kim will discuss the two particularly difficult challenges of (1) teaching discrete math to students with a wide range of mathematical abilities, and (2) students' lack of enthusiasm for mathematics. Linda Wilkens will discuss strategic problems that are a consequence of recent trends in undergraduate enrollment including the rising numbers of undeclared students and the need to court students into the major.
Bio-inspired and gradient-based algorithms to train MLPs: The influence of diversity
Authors: Rodrigo Pasti, Leandro Nunes de Castro
Venue: Information Sciences: an International Journal (2009)

This paper has three main goals: (i) to employ two classes of algorithms: bio-inspired and gradient-based to train multi-layer perceptron (MLP) neural networks for pattern classification; (ii) to combine the trained neural networks into ensembles of classifiers; and (iii) to investigate the influence of diversity in the classification performance of individual and ensembles of classifiers. The optimization version of an artificial immune network, named opt-aiNet, particle swarm optimization (PSO) and an evolutionary algorithm (EA) are used as bio-inspired methods to train MLP networks. Besides, the standard backpropagation with momentum (BPM), a quasi-Newton method called DFP and a modified scaled-conjugate gradient (SCGM) are the gradient-based algorithms used to train MLP networks in this work. Comparisons among all the training methods are presented in terms of classification accuracy and diversity of the solutions found. The results obtained suggest that most bio-inspired algorithms deteriorate the diversity of solutions during the search, while immune-based methods, like opt-aiNet, and multiple initializations of standard gradient-based algorithms provide diverse solutions that result in good classification accuracy for the ensembles.
Situation-based shifts in consumer web site benefit importance: The joint role of cognition and affect
Authors: Sonja Wendel, Benedict G. C. Dellaert
Venue: Information and Management (2009)

We considered the reasons why customers who plan to use a web site require different benefits in different situations and investigated two ways by which the differences can occur. Apparently, relative benefit importance shifts due to changes in cognitive fit between each web site benefit and customers' situations, and, due to changes in their anticipated affective states in these situations customers' benefit focus also changes. Furthermore, the number of benefits that customers rated as important differed, depending on their anticipated affective state. Jointly the findings provided insight into how and why consumer benefit importance varied by situation.
A formal language and analysis tool for black box specifications
Authors: Gabriel J. Ferrer
Venue: Journal of Computing Sciences in Colleges (2009)

The black box specification, developed by Harlan Mills, addresses the problem of software errors that result from failing to properly specify a response for an input scenario. Each black box models how an artifact responds to a particular input from its environment. This response depends on both the current input and the entire history of interactions it has had with the environment. We have observed that students find the black box concept useful and comprehensible, but tedious and error-prone as well. In order to enhance the utility and accessibility of this technique, we have developed a formal specification language and analysis tool for black box specifications. The analysis tool verifies whether a black box is a well-formed specification. To this end, it ensures that a response is specified for every possible combination of inputs from the environment, that every condition is logically disjoint with every other condition in the specification, and that every condition in the specification matches at least one potential input scenario. We have evaluated the utility and performance of the tool with two different groups of undergraduate students.
An Efficient Scheme for Secure Communication in Large-Scale Wireless Sensor Networks
Authors: Zhong Su, Chuang Lin, Fengyuan Ren, Yixin Jiang, Xiaowen Chu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Secure Communication is the first prerequisite for many applications in wireless sensor networks and the random key pre-distribution (RKP) schemes are possibly the most practical approaches to support secure communication due to the resource constraints for sensor nodes. However, many previous RKP schemes can not simultaneously achieve good performance in term of network connectivity and resilience against sensor nodes compromise at the cost of low overheads. In this paper, we design RPKE, an efficient scheme for establishing secure communication links in wireless sensor networks. Our thorough analysis and simulation demonstrate that RPKE outperforms other existing RKP schemes from the perspective of connectivity and resilience.
Practical attacks against WEP and WPA
Authors: Erik Tews, Martin Beck
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

In this paper, we describe two attacks on IEEE 802.11 based wireless LANs. The first attack is an improved key recovery attack on WEP, which reduces the average number of packets an attacker has to intercept to recover the secret key. The second attack is (according to our knowledge) the first practical attack on WPA secured wireless networks, besides launching a dictionary attack when a weak pre-shared key (PSK) is used. The attack works if the network is using TKIP to encrypt the traffic. An attacker, who has about 12-15 minutes access to the network is then able to decrypt an ARP request or response and send 7 packets with custom content to network.
Gender differences in learning Flickr: a picture is worth a thousand words
Authors: Eric Zhi Feng Liu, Yu Fang Chang
Venue: WSEAS Transactions on Information Science and Applications (2009)

Networking environments such as BBS, discussion forums, websites, wiki, Flickr, and blogs have become increasingly popular. Currently, the term Web 2.0 is widely used. It indicates that users have become the focus of Internet usage; moreover, unlike one-way information delivery, users can now upload and download data freely and conveniently. Flickr is one of the Web 2.0 tools. By using Flickr, users can easily upload photos and also share them with others. Furthermore, users can interact with each other by annotating pictures. For instance, students share creative photos and express their thoughts to peers or others through Flickr. Therefore, we hope to formulate a Flickr course for teaching students how to use this tool. The students' prior knowledge was analyzed as the first step of the ADDIE model. On the basis of the data analysis, we began to design the Flickr course. The results suggested that most students were satisfied with this course and that they were confident about using Flickr without gender differences.
Overview of power amplifier linearization based on predistorsion techniques
Authors: E. Bertran, P. L. Gilabert, G. Montoro, J. Berenguer
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

An overview of digital predistortion techniques for microwave power amplifier linearization is here presented. Different predistortion approaches are considered, and both static and dynamic (memory effects) behavioral models are presented. Special focus is done to the most suitable solutions for facing the new challenge to linearize high-bandwidth amplifiers, as demands most of the new telecommunications standards and emergent technologies related with cognitive radio.
Skipping spare information in multimodal inputs during multimodal input fusion
Authors: Yong Sun, Yu Shi, Fang Chen, Vera Chung
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

In a multimodal interface, a user can use multiple modalities, such as speech, gesture, and eye gaze etc., to communicate with a system. As a critical component in a multimodal interface, multimodal input fusion explores the ways to effectively interpret the combined semantic interpretation of user's multimodal inputs. Although multimodal inputs may contain spare information, few multimodal input fusion approaches have tackled how to deal with spare information in multimodal inputs. This paper proposes a novel multimodal input fusion approach to flexibly skip spare information in multimodal inputs and derive semantic interpretation of them. The evaluation about the proposed approach confirms that the approach makes human-computer interaction more natural and smooth.
Overlapping Matrix Pattern Visualization: A Hypergraph Approach
Authors: Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dragan
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to best display these submatrices and their relationships? We find this problem can be converted to the hypergraph ordering problem, which generalizes the traditional minimal linear arrangement (or graph ordering) problem and then we are able to prove the NP-hardness of this problem. We propose a novel iterative algorithm which utilize the existing graph ordering algorithm to solve the optimal visualization problem. This algorithm can always converge to a local minimum. The detailed experimental evaluation using a set of publicly available transactional datasets demonstrates the effectiveness and efficiency of the proposed algorithm.
An efficient algorithm for learning to rank from preference graphs
Authors: Tapio Pahikkala, Evgeni Tsivtsivadze, Antti Airola, Jouni Järvinen, Jorma Boberg
Venue: Machine Learning (2009)

In this paper, we introduce a framework for regularized least-squares (RLS) type of ranking cost functions and we propose three such cost functions. Further, we propose a kernel-based preference learning algorithm, which we call RankRLS, for minimizing these functions. It is shown that RankRLS has many computational advantages compared to the ranking algorithms that are based on minimizing other types of costs, such as the hinge cost. In particular, we present efficient algorithms for training, parameter selection, multiple output learning, cross-validation, and large-scale learning. Circumstances under which these computational benefits make RankRLS preferable to RankSVM are considered. We evaluate RankRLS on four different types of ranking tasks using RankSVM and the standard RLS regression as the baselines. RankRLS outperforms the standard RLS regression and its performance is very similar to that of RankSVM, while RankRLS has several computational benefits over RankSVM.
Algorithmic systems biology
Authors: Corrado Priami
Venue: Communications of the ACM (2009)

The convergence of CS and biology will serve both disciplines, providing each with greater power and relevance.
RoboCup as a spectator sport: simulating emotional response in the four-legged league
Authors: Matthew Willis
Venue: Proceedings of the 5th Australasian Conference on Interactive Entertainment (2008)

This paper presents a model for simulating emotion and personality in the Four-Legged League of the RoboCup Competition. This paper argues that by introducing simulated emotional responses and state dynamics to the robots competing in the competition, they will provide a more life-like display for spectators of the sport. Further, by simulating Emotional Intelligence a team may gain a competitive edge over the competition. For the RoboCup competition to be successful at achieving its goal of creating a soccer team that will be competitive with the number one human soccer team by the year 2050, all facets of soccer competition need to be considered, including the simulation of human-like behaviour for the competitors. Emotion theory and expression are explored, and a model is presented based upon emotional states. The capabilities of the Aibo ERS-7 robots are then presented, with the capabilities of the robots expressing emotional states considered. The paper concludes with a discussion of the implementation of this model on the Aibo robots, and future areas of research.