ppxscal/embedding_network huggingface dataset:
Modeling a Store's Product Space as a Social Network
Authors: Troy Raeder, Nitesh V. Chawla
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

A market basket is a set of products that form a single retail transaction. This purchase data of products can shed important light on how product(s) might influence sales of other product(s).Departing from the standard approach of frequent itemset mining, we posit that purchase data can be modeled as a social network. One can then discover communities of products that are bought together, which can lead to expressive exploration and discovery of a larger influence zone of product(s). We develop a novel utility measure for communities of products and show, both financially and intuitively, that community detection provides a useful complement to association rules for market basket analysis. All our conclusions are validated on real store data.
Binary Tree for 1-Wire Technology in the ROM Search
Authors: Wu Zhuang, Gao Fang, Lu Yuan
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Single Bus (1-Wire) technology on the one hand, reduces the wiring complexity of multi-channel measure-control system, on the other hand, increases the difficulty of drive and control from 1-Wire networks to a 1-Wire device. In this paper, we introduce a method of ROM search in 1-Wire technology based on Binary tree, and give details of the search process. Finally, example verifies the accuracy and reliability of the algorithm.
Understanding and analyzing chat in CSCL as reading's work
Authors: Alan Zemel, Murat Cakir, Gerry Stahl
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Synchronous communication using text chat--often combined with a shared whiteboard--is increasingly used in CSCL. This form of interaction and learning in small online groups of students presents novel challenges, both for the participating students and for researchers studying their work. Chats differ from talk-in-interaction since the composition, posting and visual inspection of text and graphical objects by any given actor is not observable by the other participants. These structural constraints on the organization of interaction require that actors deploy alternative procedures for achieving what turn taking achieves in talk-in-interaction. This paper describes how communication is organized in text chat, where postings have to provide instructions on how they are to be read. This organization is contrasted with turn taking in face-to-face communication. The notion of "reading's work" provides a guiding thread, which is explicated.
Social Features in Online Communities for Healthcare Consumers --- A Review
Authors: Annie Y. Lau, Trevor M. Kwok
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

This review provides a snapshot of the literature in online communities for healthcare consumers. It summarizes the features commonly used by healthcare consumers in online communities: seeking and sharing personal experiences, opinions and answers, and exchanging social support. This review also identifies behaviors that are commonly practiced by healthcare consumers but are not readily supported in current online communities. These include collaborative healthcare decision-making, conducting social comparison, and lurking in online communities. This review concludes by emphasizing the importance of trust, privacy and safety when designing an online community for healthcare consumers, particularly in the age of Web 2.0.
Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop
Venue: European Chapter Meeting of the ACL (2009)

On behalf of the Programme Committee, we are pleased to present the proceedings of the Student Research Workshop held at the 12th Conference of the European Chapter of the Association for Computational Linguistics. Following the tradition of providing a forum for student researchers and the success of the previous workshops held in Bergen (1999), Toulouse (2001), Budapest (2003) and Trento (2006), a panel of senior researchers will take part in the presentation of the papers, providing detailed comments on the work of the authors. The Student Workshop will run as four parallel sessions, during which 11 papers will be presented. These high standard papers were carefully chosen from a total of 38 submissions coming from 18 countries.
Credulous resolution for answer set programming
Authors: Piero A. Bonatti, Enrico Pontelli, Tran Cao Son
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same spirit as traditional SLD-resolution. The proposed credulous resolution can be used in query-answering with nonground queries and with non-ground, and possibly infinite, programs. Soundness and completeness results for the resolution procedure are proved for large classes of logic programs. The resolution procedure is also extended to handle some traditional syntactic extensions used in Answer Set Programming, such as choice rules and constraints. The paper also describes an initial implementation of a system for credulous reasoning in Answer Set Programming.
Distributed Block-Dependent Watermarking Method for JPEG2000 Image Authentication
Authors: Shewen Sun, Zhaohong Li
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Two essential benefits, the resistance to the counterfeiting attack and the tamper localization accuracy, of the fragile watermarking methods are mutually restricted. In this paper, a novel distributed block-dependent watermarking method is proposed to gain both benefits by inserting the block watermark into other chosen blocks. Further, the proposed method can be easily implemented in the DWT domain for authenticating JPEG2000 images. Experimental results show that the method can resist the counterfeiting attack effectively as other block-dependent watermarking methods, while sustain the high localization accuracy as the block-independent watermarking method. It is also demonstrated that the proposed method can successfully authenticate the JPEG2000 images while recognize the malicious tampers, such as crop-and-replacement, deletion, and so on.
NIC-Assisted Cache-Efficient Receive Stack for Message Passing over Ethernet
Authors: Brice Goglin
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

High-speed networking in clusters usually relies on advanced hardware features in the NICs, such as zero-copy. Open-MX is a high-performance message passing stack designed for regular Ethernet hardware without such capabilities.We present the addition of multiqueue support in the Open-MX receive stack so that all incoming packets for the same process are treated on the same core. We then introduce the idea of binding the target end process near its dedicated receive queue. This model leads to a more cache-efficient receive stack for Open-MX. It also proves that very simple and stateless hardware features may have a significant impact on message passing performance over Ethernet.The implementation of this model in a firmware reveals that it may not be as efficient as some manually tuned micro-benchmarks. But our multiqueue receive stack generally performs better than the original single queue stack, especially on large communication patterns where multiple processes are involved and manual binding is difficult.
Wall-PIV as a Near Wall Flow Validation Tool for CFD: Application in a Pathologic Vessel Enlargement (Aneurysm)
Authors: L. Goubergrits, S. Weber, Ch. Petz, H-Ch. Hege, A. Spuler, J. Poethke, A. Berthe, U. Kertzscher
Venue: Journal of Visualization (2009)

Flow visualization of a near wall flow is of great importance in the field of biofluid mechanics in general and for studies of pathologic vessel enlargements (aneurysms) particularly. Wall shear stress (WSS) is one of the important hemodynamic parameters implicated in aneurysm growth and rupture. The WSS distributions in anatomically realistic vessel models are normally investigated by computational fluid dynamics (CFD). However, the results of CFD flow studies should be validated. The recently proposed Wall-PIV method was first applied in an enlarged transparent model of a cerebri anterior artery terminal aneurysm made of silicon rubber. This new method, called Wall-PIV, allows the investigation of a flow adjacent to transparent surfaces with two finite radii of curvature (vaulted walls). Using an optical method which allows the observation of particles up to a predefined depth enables the visualization solely of the boundary layer flow. This is accomplished by adding a specific molecular dye to the fluid which absorbs the monochromatic light used to illuminate the region of observation. The results of the Wall-PIV flow visualization were qualitatively compared with the results of the CFD flow simulation under steady flow conditions. The CFD study was performed using the program FLUENT&reg;. The results of the CFD simulation were visualized using the line integral convolution (LIC) method with a visualization tool from AMIRA&reg;. The comparison found a very good agreement between experimental and numerical results.
An Evaluation Model for Call Admission Control Scheme in CDMA System
Authors: Gao Yuehong, Zhang Xin, Jiang Yuming
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Call admission control (CAC) is a key factor in quality of service (QoS) provisioning for different services. In this paper, a Quasi-birth-and-death (QBD) process model is developed for the purpose of evaluating the CAC schemes of the cellular systems, where exist several types of traffics with different arrival rates. The CAC controller seeks to optimize the throughput and minimize the blocking probability. We obtain the theoretical expressions of several parameters that indicate the performance of the system, such as connection blocking probability, channel utilization, and normalized throughput, by analyzing the complete sharing CAC scheme. Simulations are implemented and the results show that the simulated outcomes coincide with the theoretical results got from the expressions. This verifies that the modeling is proper to evaluate the performance of CAC scheme.
Type-checking in formally non-typed systems
Authors: Dick Crouch, Tracy Holloway King
Venue: Software Engineering, Testing, and Quality Assurance for Natural Language Processing (2008)

Type checking defines and constrains system output and intermediate representations. We report on the advantages of introducing multiple levels of type checking in deep parsing systems, even with untyped formalisms.
On range of skill
Authors: Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

At AAAI'07, Zinkevich, Bowling and Burch introduced the Range of Skill measure of a two-player game and used it as a parameter in the analysis of the running time of an algorithm for finding approximate solutions to such games. They suggested that the Range of Skill of a typical natural game is a small number, but only gave heuristic arguments for this. In this paper, we provide the first methods for rigorously estimating the Range of Skill of a given game. We provide some general, asymptotic bounds that imply that the Range of Skill of a perfectly balanced game tree is almost exponential in its size (and doubly exponential in its depth). We also provide techniques that yield concrete bounds for unbalanced game trees and apply these to estimate the Range of Skill of Tic-Tac-Toe and Heads-Up Limit Texas Hold'em Poker. In particular, we show that the Range of Skill of Tic-Tac-Toe is more than 100,000.
Maintaining the Dominant Representatives on Data Streams
Authors: Wenlin He, Cuiping Li, Hong Chen
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

It is well known that traditional skyline query is very likely to return over many but less informative data points in the result, especially when the querying dataset is high-dimensional or anti-correlated. In data stream applications where large amounts of data are continuously generated, this problem becomes much more serious since the full skyline result cannot be obtained efficiently and analyzed easily. To cope with this difficulty, in this paper, we propose a new concept called Combinatorial Dominant relationship to abstract dominant representatives of stream data. Based on this concept, we propose three novel skyline queries, namely basic convex skyline query (BCSQ), dynamic convex skyline query (DCSQ), andreverse convex skyline query (RCSQ), combining the concepts of convex derived from geometry and the traditional skyline for the first time. These queries can adaptively abstract the contour of skyline points without specifying the size of result set in advance and promote information content of the query result. To efficiently process these queries and maintain their results, we design and analyze algorithms by exploiting a memory indexing structure called DCEL which is used to represent and store the arrangement of data in the sliding window. We convert the problems of points in the primal plane into those of lines in dual plane through dual transformation, which helps us avoid expensive full skyline computation and speeds up the candidate set selection. Finally, through extensive experiments with both real and synthetic datasets, we validate the representative capability of CSQs, as well as the performance of our proposed algorithms.
Predicting the Need to Perform Life-Saving Interventions in Trauma Patients by Using New Vital Signs and Artificial Neural Networks
Authors: Andriy I. Batchinsky, Jose Salinas, John A. Jones, Corina Necsoiu, Leopoldo C. Cancio
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Previous work in risk stratification of critically injured patients involved artificial neural networks (ANNs) of various configurations tuned to process traditional vital signs and demographical, clinical, and laboratory data obtained via direct contact with the patient. We now report "new vital signs" (NVSs) that are superior in distinguishing the injured and can be derived without hands-on patient contact. Data from 262 trauma patients are presented, in whom NVSs derived from electrocardiogram (EKG) analysis (heart-rate complexity and variability) were input into a commercially available ANN. The endpoint was performance of life-saving interventions (LSIs) such as intubation, cardiopulmonary resuscitation, chest-tube placement, needle chest decompression, and blood transfusion. We conclude that based on EKG-derived NVS alone, it is possible to accurately identify trauma patients who undergo LSIs. Our approach may permit development of a next-generation decision support system.
A measure of syntactic flexibility for automatically identifying multiword expressions in corpora
Authors: Colin Bannard
Venue: Proceedings of the Workshop on a Broader Perspective on Multiword Expressions (2007)

Natural languages contain many multi-word sequences that do not display the variety of syntactic processes we would expect given their phrase type, and consequently must be included in the lexicon as multiword units. This paper describes a method for identifying such items in corpora, focussing on English verb-noun combinations. In an evaluation using a set of dictionary-published MWEs we show that our method achieves greater accuracy than existing MWE extraction methods based on lexical association.
The importance of sub-utterance prosody in predicting level of certainty
Authors: Heather Pon-Barry, Stuart Shieber
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 an experiment aimed at understanding how to optimally use acoustic and prosodic information to predict a speaker's level of certainty. With a corpus of utterances where we can isolate a single word or phrase that is responsible for the speaker's level of certainty we use different sets of sub-utterance prosodic features to train models for predicting an utterance's perceived level of certainty. Our results suggest that using prosodic features of the word or phrase responsible for the level of certainty and of its surrounding context improves the prediction accuracy without increasing the total number of features when compared to using only features taken from the utterance as a whole.
Exact error bounds for the reconstruction processes using interpolating wavelets
Authors: S. Amat, M. Moncayo
Venue: Mathematics and Computers in Simulation (2009)

It is known that a multiresolution scheme without control on the infinity norm can produce numerical artifacts. This work is intended to provide explicit error bounds for the reconstruction process associated with the interpolating wavelets introduced by Donoho [D. Donoho, Interpolating Wavelet Transforms, Preprint, Department of Statistics, Stanford University, 1992]. The stability constants related to the interpolatory wavelets defined by the use of the Daubechies filters [I. Daubechies, Ten Lectures on Wavelets, SIAM, Philadelphia, 1992], also called the Deslaurier-Dubuc wavelets, are tabulated. Our study present two important facts: The first is that the obtained stability constants are much better approximated than those given by other approaches motivated by [S. Amat, J. Liandrat, On the stability of the PPH multiresolution algorithm, Appl. Comp. Harmon. Anal. 18 (2005) 198-206] and the second is that our analysis uses basic rules easily understood by a wide part of the scientific community interested in this kind of explicit numerical results.
Distributional measures of concept-distance: a task-oriented evaluation
Authors: Saif Mohammad, Graeme Hirst
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

We propose a framework to derive the distance between concepts from distributional measures of word co-occurrences. We use the categories in a published thesaurus as coarse-grained concepts, allowing all possible distance values to be stored in a concept--concept matrix roughly .01% the size of that created by existing measures. We show that the newly proposed concept-distance measures outperform traditional distributional word-distance measures in the tasks of (1) ranking word pairs in order of semantic distance, and (2) correcting real-word spelling errors. In the latter task, of all the WordNet-based measures, only that proposed by Jiang and Conrath outperforms the best distributional concept-distance measures.
Limit Set Reachability in Asynchronous Graph Dynamical Systems
Authors: V. S. Kumar, Matt Macauley, Henning S. Mortveit
Venue: Proceedings of the 3rd International Workshop on Reachability Problems (2009)

Using the framework of sequential dynamical systems (SDSs), a class of asynchronous graph dynamical systems, we show how the notions of reachability and stability can be negatively correlated. Specifically, we show that certain threshold SDSs exhibit update sequence instability: Over certain graph classes, there exist initial configurations from where exponentially many fixed points are reachable under different update sequences, i.e., the ¿-limit set has size ¿(2|V|). We establish this first for treewidth bounded graphs and then for random graphs in the G(n,p) model of Erdős-Rényi for a large range of p. We also show that this update sequence instability is not present in dense graphs, suggesting that sparsity and tree-like structure plays an important role in the stability of the system. These dynamical systems arise in applications such as functional gene annotation, where threshold SDSs are employed to predict gene functions through a fixed point computation, based on an initial state (prediction) and a nongeneric choice of update sequence. The results in this paper should be viewed as cautionary advice in the construction and application of such algorithms. This paper also provides a starting point for a study of update sequence stochastic SDSs.
Joint Coupling for Human Shoulder Complex
Authors: Jingzhou (James) Yang, Xuemei Feng, Joo H. Kim, Yujiang Xiang, Sudhakar Rajulu
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

In this paper, we present an inverse kinamtics method to determining human shoulder joint motion coupling relationship based on experimental data in the literature. The joint coupling relationship is available in the literature, but it is an Euler---angle-based relationship. This work focuses on transferring Euler-angle-based coupling equations into a relationship based on the Denavit-Hartenberg (DH) method. We use analytical inverse kinematics to achieve the transferring. Euler angles are obtained for static positions with intervals of 15 degrees, and the elevation angle of the arm varied between 0 and 120 degrees. For a specific posture, we can choose points on clavicle, scapula, and humerus and represent the end-effector positions based on Euler angles or DH method. For both systems, the end-effectors have the same Cartesian positions. Solving these equations related to end-effector positions yields DH joint angles for that posture. The new joint motion coupling relationship is obtained by polynomial and cosine fitting of the DH joint angles for all different postures.
Compressed Suffix Arrays for Massive Data
Authors: Jouni Sirén
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

We present a fast space-efficient algorithm for constructing compressed suffix arrays (CSA). The algorithm requires O(n logn) time in the worst case, and only O(n) bits of extra space in addition to the CSA. As the basic step, we describe an algorithm for merging two CSAs. We show that the construction algorithm can be parallelized in a symmetric multiprocessor system, and discuss the possibility of a distributed implementation. We also describe a parallel implementation of the algorithm, capable of indexing several gigabytes per hour.
"I Heard It on the Grapevine" --- Blogging, Facebook, YouTube, and Student Self-organization during a Faculty Strike
Authors: Emilie W. Gould
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

Before the web, a strike tended to be between two parties and the communication rules for such crises were clear: the employer funneled all messages through a single spokesperson to maintain control of its image while the union focused most of its efforts on maintaining the morale and commitment of its membership. The web enlarges the audiences for a strike and allows stakeholders to build coalitions against both sides.During a faculty strike at Acadia University in 2007, student stakeholders developed their own online channels of communication to respond to faculty and administration actions. While the professors walked the picket line and the administrators remained cloistered in University Hall, a lively discourse was taking place on the web in student blogs, facebook groups, and You-Tube.This reaction to this strike shows how new media can empower outsiders to make sense of events and organize themselves to put pressure on official social structures. In addition, it demonstrates the power of Millennial students to force others to take their views into account.