ppxscal/embedding_network huggingface dataset:
Understanding email use: predicting action on a message
Authors: Laura A. Dabbish, Robert E. Kraut, Susan Fussell, Sara Kiesler
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Email consumes significant time and attention in the workplace. We conducted an organizational survey to understand how and why people attend to incoming email messages. We examined people's ratings of message importance and the actions they took on specific email messages, based on message characteristics and characteristics of receivers and senders. Respondents kept half of their new messages in the inbox and replied to about a third of them. They rated messages as important if they were about work and required action. Importance, in turn, had a modest impact on whether people replied to their incoming messages and whether they saved them. The results indicate that factors other than message importance (e.g., their social nature) also determine how people handle email. Overall, email usage reflects attentional differences due both to personal propensities and to work demands and relationships.
Review of "Artificial Intelligence: Tools, Techniques, and Applications by Marc Eisenstat and Tim O'Shea", Harper and Row, Publishers, Inc., New York, NY.
Authors: Keith Price
Venue: Issue 87 (January 1984) (1984)

Artificial Intelligence: Tools, Techniques, and Applications edited by Eisenstat and O'Shea is derived from an AISB seminar on Al. The book is intended for use in an advanced Al course or for an in depth study of general Al. The title refers to the three major sections of the book. Tools include Prolog (both an introduction and an advanced chapter) and LISP (introduction and advanced topics). The Techniques section covers some general topics, a review of Cognitive Science and natural language, and specialized methods relating to robotics. It also includes a chapter on how to get a Ph.D. in Al. The final section, Applications, covers various areas of applied Al. I will first give an overview of the contents of the book, then present a brief evaluation of the book.
SAWAN: A Survivable Architecture for Wireless LANs
Authors: Mohit Virendra, Shambhu Upadhyaya, Vivek Kumar, Vishal Anand
Venue: Proceedings of the Third IEEE International Workshop on Information Assurance (2005)

This paper1 describes survivability schemes against Access Point (AP) failures in Wireless LANs. It particularly aims for resiliency and survivability against multistage attacks where the adversary is successful in compromising the AP, and then targets the survived but more vulnerable network. This is true in real life where the adversary knows that survivability is a design consideration built into the network. It then performs a multistage targeted attack that is aimed at compromising the survived network that may have vulnerabilities. We first present a unique Infrastructure for an Ad-hoc Migration Scheme (IAMS) where the nodes under a failed AP form an ad-hoc network and reconnect to the network using available neighboring APs. We then present a scheme for isolating and removing any malicious nodes from the ad-hoc network routes in a transparent manner once the malicious nodes have been identified. This will minimize the chances of further attacks in the survived network, and the removal is done in a distributed fashion without the nodes exchanging any information between them. We report the results of our simulations performed using the network simulation tool GloMoSim.
Finding errors automatically in semantically tagged dialogues
Authors: John Aberdeen, Christine Doran, Laurie Damianos, Samuel Bayer, Lynette Hirschman
Venue: Proceedings of the first international conference on Human language technology research (2001)

We describe a novel method for detecting errors in task-based human-computer (HC) dialogues by automatically deriving them from semantic tags. We examined 27 HC dialogues from the DARPA Communicator air travel domain, comparing user inputs to system responses to look for slot value discrepancies, both automatically and manually. For the automatic method, we labeled the dialogues with semantic tags corresponding to "slots" that would be filled in "frames" in the course of the travel task. We then applied an automatic algorithm to detect errors in the dialogues. The same dialogues were also manually tagged (by a different annotator) to label errors directly. An analysis of the results of the two tagging methods indicates that it may be possible to detect errors automatically in this way, but our method needs further work to reduce the number of false errors detected. Finally, we present a discussion of the differing results from the two tagging methods.
3D Articulated Motion Estimation from Images
Authors: Xiaoyun Zhang, Yuncai Liu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper presents a new method of motion analysis of articulated objects from feature point correspondences over monocular perspective images without imposing any constraints on motion. The 3D joint positions of an articulated object are estimated within a scale factor using the connection relationship of two links over two or three images. Then, twists and exponential maps are employed to represent the motion of each link. Finally, constraints from image point correspondences are developed to estimate the motion. In the algorithm, the characteristic of articulated motion, i.e., motion correlation among links, is applied to decrease the complexity of the problem and improve the robustness. A point pattern matching algorithm for articulated objects is also discussed in this paper. Simulations and experiments on real images show the correctness and efficiency of the algorithms.
HANA: a novel spatial parallel manipulator with one rotational and two translational degrees of freedom
Authors: Xin-Jun Liu, Xiaoqiang Tang, Jinsong Wang
Venue: Robotica (2005)

This paper concerns the proposal and analysis of HANA, a novel spatial parallel manipulator with over constraint. The parallel manipulator consists of a base plate, a movable platform, and three connecting legs. The moving platform has three degrees of freedom (DoFs), which are two degrees of translational freedom and one degree of rotational freedom, with respect to the base plate. The new parallel manipulator is very interesting for the reason of a lack of singularity in its workspace, single-DoF joint architecture and high rotational capability of its moving platform. The inverse and forward kinematics problems are described in closed-forms. The velocity equation of the new parallel manipulator is given. Three kinds of singularities are presented. The workspace for the manipulator is analyzed systematically. Especially, the index to evaluate the rotational capability of the manipulator is defined and discussed in detail. The proposed manipulator has a wide application in the fields of industrial robots, simulators, micro-motion manipulators, and parallel kinematics machines.
Single-Parameter Blackjack Betting Systems Inspired by Scatter Search
Authors: Ron Coleman
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

This paper develops a new idea, traces, which speeds up the search for candidate Blackjack betting systems by >400X.We then use traces to enable a new application of scatter search, which identifies alternative betting systems that are statiscally identical to the best profressional ones and exceed others in mean betting returns in a study of 21 systems.
Access-controlled resource discovery in pervasive networks: Research Articles
Authors: Sanjay Raman, Dwaine Clarke, Matt Burnside, Srinivas Devadas, Ronald Rivest
Venue: Concurrency and Computation: Practice Experience (2004)

Networks of the future will be characterized by a variety of computational devices that display a level of dynamism not seen in traditional wired networks. Because of the dynamic nature of these networks, resource discovery is one of the fundamental problems that must be solved. While resource discovery systems are not a novel concept, securing these systems in an efficient and scalable way is challenging. This paper describes the design and implementation of an architecture for access-controlled resource discovery. This system achieves this goal by integrating access control with the Intentional Naming System (INS), a resource discovery and service location system. The integration is scalable, efficient, and fits well within a proxy-based security framework designed for dynamic networks. We provide performance experiments that show how our solution outperforms existing schemes. The result is a system that provides secure, access-controlled resource discovery that can scale to large numbers of resources and users. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Tina: an improbable 3-pin microcontroller
Authors: Paul Frenger
Venue: ACM SIGPLAN Notices (2005)

The twenty-first century is rapidly becoming the age of nanotechnology. Everything seems to be getting smaller these days, especially in the electronic and scientific fields. The fuel-efficient Mazda Miata and Toyota MR2 have become the city commuter's must-have vehicles. The bulky boom-box has been replaced by the more socially responsible Apple iPod, with its miniscule rotating hard disk drive. The familiar 5-inch CD is being replaced by 3-inch versions, with smaller ones on the horizon. The playing-card sized (86 by 54 mm) PCMCIA storage device has been supplanted by fingernail-sized (10 by 15 mm) TransFlash memory cards [1]. This miniaturizing effect feeds upon itself as smaller products require even smaller components of every description, fueling the demand for yet tinier devices.
Differences in Dynamic Brand Competition Across Markets: An Empirical Analysis
Authors: Jean-Pierre Dubé, Puneet Manchanda
Venue: Marketing Science (2005)

We investigate differences in the dynamics of marketing decisions across geographic markets empirically. We begin with a linear-quadratic game involving forward-looking firms competing on prices and advertising. Based on the corresponding Markov perfect equilibrium, we propose estimable econometric equations for demand and marketing policy. Our model allows us to measure empirically the strategic response of competitors along with economic measures such as firm profitability. We use a rich dataset that combines sales, marketing mix, factor cost, and advertising cost data for eighteen geographic markets in the frozen entrÃ©e category.We find that larger markets tend to be less price-sensitive and more profitable than smaller markets. We also find evidence of positive carryover of own advertising on own demand. In terms of consumer substitution patterns, we find that the role of advertising (in our data) seems to be more category-building (complementary) than share-stealing (competitive). The complementary role is stronger in larger markets. On the supply side, we find that firms make smaller adjustments to own advertising as goodwill goes up. Consistent with cross-advertising effects on demand, firms make smaller (larger) adjustments to advertising in response to competitive goodwill in the less competitive larger (in the more competitive smaller) markets. Finally, we find that consumer welfare decreases (increases) in larger (smaller) markets when firms move to a zero-advertising regime.
Weighted hypertree decompositions and optimal query plans
Authors: Francesco Scarcello, Gianluigi Greco, Nicola Leone
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Hypertree width [22, 25] is a measure of the degree of cyclicity of hypergraphs. A number of relevant problems from different areas, e.g., the evaluation of conjunctive queries in database theory or the constraint satisfaction in AI, are tractable when their underlying hypergraphs have bounded hypertree width. However, in practical contexts like the evaluation of database queries, we have more information besides the structure of queries. For instance, we know the number of tuples in relations, the selectivity of attributes and so on. In fact, all commercial query-optimizers are based on quantitative methods and do not care about structural properties.In this paper, we define the notion of weighted hypertree decomposition, in order to combine structural decomposition methods with quantitative approaches. Weighted hypertree decompositions are equipped with cost functions, that can be used for modelling many situations where we have further information on the given problem, besides its hypergraph representation. We analyze the complexity of computing the hypertree decompositions having the smallest weights, called minimal hypertree decompositions. We show that, in many cases, adding weights we loose tractability. However, we prove that, under some - not very severe - restrictions on the allowed cost functions and on the target hypertrees, optimal weighted hypertree decompositions can be computed in polynomial time. For some easier hypertree weighting functions, this problem is also highly parallelizable. Then, we provide a cost function that models query evaluation costs and show how to exploit weighted hypertree decompositions for determining (logical) query plans for answering conjunctive queries. Finally, we present the results of an experimental comparison of this query optimization technique with the query optimization of a commercial DBMS. These preliminary results are very promising, as for some large queries (with many joins) our hybrid technique clearly outperforms the commercial optimizer.
Evidence for suppressed short-channel effects in deep submicron dual-material gate (DMG) partially depleted SOI MOSFETs - A two-dimensional analytical approach
Authors: M. Jagadesh Kumar, G. Venkateshwar Reddy
Venue: Microelectronic Engineering (2004)

Short-channel effects in a dual-material gate partially depleted (DMG-PD) silicon-on-insulator (SOI) MOSFET are studied by developing a 2-D analytical model for the surface potential variation along the channel. The model includes the calculation of the surface potential, electric field along the channel and threshold voltage using the minimum surface potential. The model takes into account the effects of body doping concentration, gate oxide, buried oxide and silicon film thickness, lengths of the gate metals and their work functions, applied drain and substrate biases. It is seen that short channel effects in this structure are suppressed because of the perceivable step in the surface potential profile, which screens the drain potential. It is also seen that the model predicts a threshold voltage roll-up as the channel length is reduced. The results predicted by the model are compared with those obtained by two-dimensional simulation to verify the accuracy of the proposed analytical model.
Solving the Hub location problem in telecommunication network design: A local search approach
Venue: Networks (2004)

This article deals with a Hub Location Problem arising in Telecommunication Network Design. The considered network presents two different kinds of nodes: access nodes, that represent source and destination of traffic demands but cannot be directly connected, and transit nodes, that have no own traffic demand but collect traffic from access nodes and route it through the network. Transit nodes are supposed to be fully connected. Given a set of access nodes and a set of potential locations for the transit nodes, the problem is to decide number and positions of the transit nodes to guarantee that all access nodes are allocated to a transit node, satisfying capacity constraints. The goal is to minimize the total cost of the network, which is the sum of connection costs and nodes fixed costs. The problem is a Hub Location Problem, which is known to be NP-hard. A local search approach is proposed, and different metaheuristic algorithms, such as tabu search, iterated local search and random multistart, have been developed, based on such local search. &lsqb;A preliminary procedure has been developed in a research project joint with Telecom Italia &lpar;Turin Research & Innovation Laboratories&rpar; and a patent application has been filed to cover this issue.&rsqb; &copy; 2004 Wiley Periodicals, Inc. NETWOEKS, Vol. 44&lpar;2&rpar;, 94&ndash;105 2004
Coopéera: analysis of a collaborative platform usage
Authors: Jean-Charles Hautecouverture
Venue: Proceedings of the 15th French-speaking conference on human-computer interaction on 15eme Conference Francophone sur l'Interaction Homme-Machine (2003)

Our studies treat about computer science environment and offer to users, in this case children of the primary school, a method of particular cooperation in order to realise common projects. Our mission in this project is to report how children use the tool. Our interest is particularly focused on the factors that facilitate or block the process of the appropriation of this tool. So we analyse the interactions between the children. These interactions are mediated by using a platform. We argue that the properties of the artefact take an essential role in the appropriation of the tool, but the historiccultural inscription is also a deciding factor in the process.
A Measure of Deformability of Shapes, with Applications to Human Motion Analysis
Authors: Amit K. Roy-Chowdhury
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In this paper we develop a theory for characterizing how deformable a shape is. We define a term called "deformability index" for shapes. The deformability index is computed from the tracked positions of a sequence of deformable shapes, using a scaled orthographic camera projection model. Our method assumes that a deformable shape sequence can be represented by a linear combination of basis shapes, where the weights assigned to each basis shape changes with time. The tracked points obtained from the shape sequence is transformed to a 3D shape space. Using statistical models to separate out the "true" deformations from those induced by noise in the trajectories, the dimension of this shape space is estimated using spectral analysis methods. The dimension of this shape space determines the number of basis shapes needed to represent the shape sequence, which, in turn, determines the deformability index. Rigid 3D transformations of the shape are taken into account in estimating the deformability index; however, the method does not require estimation of 3D structure or motion. Experimental results are shown using motion capture data as well as real imagery of different human activities. The results show that the deformability index is in accordance with our intuitive judgement and corroborates certain hypotheses in human movement analysis studies.
Seascape and volcano: visualizing online discussions using timeless motion
Authors: Francis Lam, Judith Donath
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Motion is the strongest visual appeal to attention [2], yet it is rarely used in the visualization of large-scale quantitative information. Motion is complex; it can vary across numerous dimensions, each of which is potentially an information-bearing element in the visualization. Which dimensions are used and how the data is mapped onto them are the key questions in using motion effectively. In this paper we present two interfaces that use motion as the primary visual element for representing data. These interfaces, Seascape and Volcano, use periodic animation loops to represent key social interaction features in online discussions. We propose that motion may be particularly well suited for representing data about behavior and actions, creating visualizations that intuitively depict different levels and types of activity. In this paper we describe the interfaces we have built and present the results of preliminary user studies.
Sketching mesh deformations
Authors: Youngihn Kho, Michael Garland
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

Techniques for interactive deformation of unstructured polygon meshes are of fundamental importance to a host of applications. Most traditional approaches to this problem have emphasized precise control over the deformation being made. However, they are often cumbersome and unintuitive for non-expert users.In this paper, we present an interactive system for deforming unstructured polygon meshes that is very easy to use. The user interacts with the system by sketching curves in the image plane. A single stroke can define a free-form skeleton and the region of the model to be deformed. By sketching the desired deformation of this reference curve, the user can implicitly and intuitively control the deformation of an entire region of the surface. At the same time, the reference curve also provides a basis for controlling additional parameters, such as twist and scaling. We demonstrate that our system can be used to interactively edit a variety of unstructured mesh models with very little effort. We also show that our formulation of the deformation provides a natural way to interpolate between character poses, allowing generation of simple key framed animations.
A Memory-Effective Routing Strategy for Regular Interconnection Networks
Authors: M. E. Gomez, P. Lopez, J. Duato
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Massively parallel computing systems have been or are being built with thousands of nodes. In such systems, high-performance interconnection networks are crucial to achieve the maximum performance. Routing is one of the most important design issues of interconnection networks. Routing strategies can be mainly classified as source and distributed routing.Source routing has been used in some networks because routers are very simple. On the other hand, distributed routing allows more flexibility, but the routers are more complex. Distributed routing can be implemented by a fixed hardware specific to a routing function on a given topology, or by using forwarding tables that are very flexible but suffer from a lack of scalability. In this paper, we propose a distributed routing strategy for commercial switches, Flexible Interval Routing, that is scalable for the most widely used regular topologies (tori and meshes) because it is not based on tables. At the same time, the strategy is easy to reconfigure to deal with changes in the topology or in the routing algorithm for a given topology, being able to implement the most commonly-used routing algorithms in regular topologies.
Architectural choices for video-on-demand systems
Authors: Anwar Al Hamra, Ernst W. Biersack, Guillaume Urvoy-Keller
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

Cost-effectiveness is of foremost importance for large scale VoD systems. We assume a VoD system where each video is split into two parts, the prefix and the suffix. We consider two new architectures: One architecture where the clients are equipped with set-top boxes that allow to store locally the prefix part of some/all popular videos and second architecture where the suffix is transmitted via satellite.For each architecture, we develop a cost model to compute the delivery cost of videos. We show that these architectures are efficient and significantly reduce the system cost in many scenarios: (i) By more than 45% with set-top boxes at the client side, (ii) By more than 80% for satellite transmission of the suffix.