ppxscal/embedding_network huggingface dataset:
Discovering frequent work procedures from resource connections
Authors: Jianqiang Shen, Erin Fitzhenry, Thomas G. Dietterich
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Intelligent desktop assistants could provide more help for users if they could learn models of the users' workflows. However, discovering desktop workflows is difficult because they unfold over extended periods of time (days or weeks) and they are interleaved with many other workflows because of user multi-tasking. This paper describes an approach to discovering desktop workflows based on rich instrumentation of information flow actions such as copy/paste, SaveAs, file copy, attach file to email message, and save attachment. These actions allow us to construct a graph whose nodes are files, email messages, and web pages and whose edges are these information flow actions. A class of workflows that we call work procedures can be discovered by applying graph mining algorithms to find frequent subgraphs. This paper describes an algorithm for mining frequent closed connected subgraphs and then describes the results of applying this method to data collected from a group of real users.
Classification tree modeling to identify severe and moderate vehicular injuries in young and middle-aged adults
Authors: Linda J. Scheetz, Juan Zhang, John Kolassa
Venue: Artificial Intelligence in Medicine (2009)

Objectives: Motor vehicle crashes are a leading cause of mortality and morbidity worldwide. Even though trauma centers provide the gold standard of care for motor vehicle crash patients with life- or limb-threatening injuries, many whose lives might be saved by trauma center care are treated instead at non-trauma center hospitals. Triage algorithms, designed to identify patients with life- or limb-threatening injuries who should be transported to a trauma center, lack appropriate sensitivity to many of these injuries. The challenge to the trauma community is differentiating patients with life- or limb-threatening injuries from those with less severe injuries at the crash scene so that the patients can be transported to the most appropriate level of care. The purpose of this study was to use crash scene data available to emergency responders to classify adults with moderate and severe injuries. These classifiers might be useful to guide triage decision making. Methods and material: Records of 74,626 adults, age 18-64 years, from the National Automotive Sampling System Crashworthiness Data Systems database were analyzed using classification and regression trees (CART) analysis. Both CART models (moderate injury and severe injury) included 13 predictor variables. The response variables were the targeted injury severity score cut points for moderate and severe injury. Two final classification trees were developed: one that classified occupants based on moderate injury and the other on severe injury. Misclassification costs were manipulated to achieve the best model fit for each tree. Results: The moderate injury classification tree had three splitters: police-estimated injury severity, restraint use, and number of persons injured. The severe injury classification tree had four splitters: police-estimated injury severity, manner of collision, number of persons injured in the crash, and age. Sensitivity and specificity of the classification trees were 93.70%, 77.53% (moderate) and 99.18%, 73.96% (severe), respectively. Conclusions: CART analysis can be used to classify injury severity using crash scene information that is available to emergency responders. This procedure offers an opportunity to examine alternative methods of identifying injury severity that might assist emergency responders to differentiate more accurately persons who should receive trauma center care from those who can be treated safely at a non-trauma center hospital.
Matchmaking for covariant hierarchies
Authors: Fabio Simeoni, David Lievens
Venue: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software (2009)

We describe a model of matchmaking suitable for the implementation of services, rather than for their discovery and composition. In the model, processing requirements are modelled by client requests and computational resources are software processors that compete for request processing as the covariant implementations of an open service interface. Matchmaking then relies on type analysis to rank processors against requests in support of a wide range of dispatch strategies. We relate the model to the autonomicity of service provision and briefly report on its deployment within a production-level infrastructure for scientific computing.
Applications of SIMD computers in signal processing
Authors: Laxmi N. Bhuyan, Dharma P. Agrawal
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper analyzes in detail how far the proposed Single Instruction Multiple Data (SIMD) computers with interconnection networks are applicable in the signal processing area. Decimation in the time radix-2 fast Fourier transform (FFT) algorithm is considered here for implementation in a multiprocessor system with shared bus and an SIMD computer with interconnection network. Results are derived for data allocation, interprocessor communication, approximate computation time, speedup, and cost effectiveness for an N-point FFT with any P available processors. Further generalization is obtained for a radix-r FFT algorithm. N X N point, two-dimensional discrete Fourier transform (DFT) implementation is also considered, with one or more rows of input matrix allocated to each processor. Various curves are plotted and a comparison in performance is carried out between a shared-bus multiprocessor and SIMD computer with interconnection network. It is shown that the latter gives much higher speedup for P > 16 and is more cost-effective even with the high cost of switches. N, P and r, considered here, are all powers of 2.
Comparison and evaluation of code clone detection techniques and tools: A qualitative approach
Authors: Chanchal K. Roy, James R. Cordy, Rainer Koschke
Venue: Science of Computer Programming (2009)

Over the last decade many techniques and tools for software clone detection have been proposed. In this paper, we provide a qualitative comparison and evaluation of the current state-of-the-art in clone detection techniques and tools, and organize the large amount of information into a coherent conceptual framework. We begin with background concepts, a generic clone detection process and an overall taxonomy of current techniques and tools. We then classify, compare and evaluate the techniques and tools in two different dimensions. First, we classify and compare approaches based on a number of facets, each of which has a set of (possibly overlapping) attributes. Second, we qualitatively evaluate the classified techniques and tools with respect to a taxonomy of editing scenarios designed to model the creation of Type-1, Type-2, Type-3 and Type-4 clones. Finally, we provide examples of how one might use the results of this study to choose the most appropriate clone detection tool or technique in the context of a particular set of goals and constraints. The primary contributions of this paper are: (1) a schema for classifying clone detection techniques and tools and a classification of current clone detectors based on this schema, and (2) a taxonomy of editing scenarios that produce different clone types and a qualitative evaluation of current clone detectors based on this taxonomy.
NetRiver, a computer network experiment system
Authors: Xu Mingwei, XU Ke, Cui Yong, Wu Jianping
Venue: Proceedings of the 1st ACM Summit on Computing Education in China on First ACM Summit on Computing Education in China (2008)

NetRiver, a computer network experimental system, includes three components, client, test server and management server. It has the following features: controllable network experimental environment for the entire protocol stack, integrated compiling environment supporting code editing, compiling, and debugging, visual protocol message capture and conduct analysis, multi-level experimental means, scalable script-based experiment description and implementation, automatic test based on coordination test method, and rich featured experiment management platform. NetRiver broadens the content of computer network experiment, enriches the experimental means and improves the efficiency of the experiment.
A real-time video watermarking system with buffer sharing for video-on-demand service
Authors: Ju Wang, Jonathan C. L. Liu, Mbonisi Masilela
Venue: Computers and Electrical Engineering (2009)

Real-time watermarking for streaming video (such as VOD service) requires significant amounts of computing resources. To address this issue, we present a scalable watermarking scheme integrated in a parallel MPEG-2 engine. A content-based block selection algorithm is proposed to efficiently embed the pseudo-random watermark signatures into DCT blocks. Our watermark scheme also provides a robust way to synchronize the watermarked video to the original source at detectors and is very resilient against cumulative and temporal attack. We optimize the parallel watermark engine to achieve real-time watermarking performance. We found that the system throughput could suffer significant degradation when processing high-level MPEG-2 video (such as HDTV) due to inefficient management of memory space. Therefore, we investigated an efficient buffer management scheme consisting of two methods: First we reduced the transmission buffer in slave nodes by frames sharing between frames in the Group-of-Picture (GOP) level. Then we further reduce the buffer space by a dynamic on-demand allocation on the slave side. By solving the memory-shortage bottleneck, the proposed system can support real-time watermarking for multiple high-resolution (up to 1404x960) video.
Optimization of interval type-2 fuzzy logic controllers for a perturbed autonomous wheeled mobile robot using genetic algorithms
Authors: Ricardo Martínez, Oscar Castillo, Luis T. Aguilar
Venue: Information Sciences: an International Journal (2009)

We describe a tracking controller for the dynamic model of a unicycle mobile robot by integrating a kinematic and a torque controller based on type-2 fuzzy logic theory and genetic algorithms. Computer simulations are presented confirming the performance of the tracking controller and its application to different navigation problems.
An experience of teaching for learning by observation: Remote-controlled experiments on electrical circuits
Authors: Siu Cheung Kong, Yau Yuen Yeung, Xian Qiu Wu
Venue: Computers Education (2009)

In order to facilitate senior primary school students in Hong Kong to engage in learning by observation of the phenomena related to electrical circuits, a design of a specific courseware system, of which the interactive human-machine interface was created with the use of an open-source software called the LabVNC, for conducting online remote-controlled experiments was developed in this study. The statistically significant results of a pre-test-post-test evaluation study showed that the LabVNC-based system has potential to promote students to learn the target topic under the approach of learning by observation. The assertion of the teacher on the pedagogical value of the remote-controlled experimentation and the enthusiasm of students in using the LabVNC-based system reveal the potential to integrate the use of the LabVNC-based system with the practice of scientific experiments. Based on the feedback from the teacher and students, the existing LabVNC-based system will be refined under the design-based research approach.
Selling multiple secrets to a single buyer
Authors: A. Martín del Rey, G. Rodríguez Sánchez
Venue: Information Sciences: an International Journal (2009)

This paper deals with the original work due to Brassard et al., in which an algorithm to sell only one secret to one buyer was introduced. It is based on the theory of quadratic residues modulo an integer number and Jacobi symbols. Unfortunately, this algorithm exhibits an important security drawback: the seller can disclose more than one secret to the buyer instead of only one. This problem was overcome by other sophisticated protocols. Although such problem has been satisfactorily tackled, the main goal of this work is to modify the original work (preserving its flavour) in order to securely disclose multiple secrets without the participation of more buyers but with a third trusted party.
Parallel view-dependent refinement of progressive meshes
Authors: Liang Hu, Pedro V. Sander, Hugues Hoppe
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

We present a scheme for view-dependent level-of-detail control that is implemented entirely on programmable graphics hardware. Our scheme selectively refines and coarsens an arbitrary triangle mesh at the granularity of individual vertices, to create meshes that are highly adapted to dynamic view parameters. Such fine-grain control has previously been demonstrated using sequential CPU algorithms. However, these algorithms involve pointer-based structures with intricate dependencies that cannot be handled efficiently within the restricted framework of GPU parallelism. We show that by introducing new data structures and dependency rules, one can realize fine-grain progressive mesh updates as a sequence of parallel streaming passes over the mesh elements. A major design challenge is that the GPU processes stream elements in isolation. The mesh update algorithm has time complexity proportional to the selectively refined mesh, and moreover can be amortized across several frames. The static data structure is remarkably compact, requiring only 57% more memory than an indexed triangle list. We demonstrate real-time exploration of complex models with normals and textures.
Exploiting a Vowel Based Approach for Acted Emotion Recognition
Authors: Fabien Ringeval, Mohamed Chetouani
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

This paper is dedicated to the description and the study of a new feature extraction approach for emotion recognition. Our contribution is based on the extraction and the characterization of phonemic units such as vowels and consonants, which are provided by a pseudo-phonetic speech segmentation phase combined with a vowel detector. The segmentation algorithm is evaluated on both emotional (Berlin) and non-emotional (TIMIT, NTIMIT) databases. Concerning the emotion recognition task, we propose to extract MFCC acoustic features from these pseudo-phonetic segments (vowels, consonants) and we compare this approach with traditional voice and unvoiced segments. The classification is achieved by the well-known k-nn classifier (k nearest neighbors) on the Berlin corpus.
On Supporting Mission-Critical Multimedia Applications
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Mission-critical multimedia applications such as advanced command and control are dynamic and criticality-driven. Taking into consideration of the application criticality as well as media quality-of-service (QoS) and timing requirements, we develop a multiresource management system that enables criticality-based resource preemption and QoS-based dynamic resource negotiation and adaptation. Our performance study indicates that our approximation solution is near optimal and that it outperforms a criticality-cognitive baseline algorithm. We also show that the dynamic QoS adjustment technique largely improves the quality of service for video streams. The criticality- and QoS-based multiresource management system is part of the Presto multimedia system environment prototyped at Honeywell for mission-critical applications. 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
Web Concordance of the Prakīrna-Prakāśa of Helārāja on the Jātisamuddeśa (3.1) of Vākyapadīya
Authors: Malhar Kulkarni, Chaitali Dangarikar
Venue: Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics (2008)

This article presents features of the web concordance in the form of KWIC (key word in context) index of the Prakīrna-Prakāśa of Helārāja (980 A.D.)on the Jātisamuddeśa of Vākyapadīya (450 A.D.), a seminal work in Indian grammatical tradition. Apart from the original text it also takes into account variant readings in the text. This searchable concordance will be useful for the philological study of the text.
Aspect-oriented multi-view modeling
Authors: Jörg Kienzle, Wisam Al Abed, Jacques Klein
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Multi-view modeling allows a developer to describe a software system from multiple points of view, e.g. structural and behavioral, using different modeling notations. Aspect-oriented modeling techniques have been proposed to address the scalability problem within individual modeling notations. This paper presents RAM, an aspect-oriented modeling approach that provides scalable multi-view modeling. RAM allows the modeler to define stand-alone reusable aspect models using 3 modeling notations. The aspect models support the modeling of structure (using UML class diagrams) and behavior (using UML state and sequence diagrams). RAM supports aspect dependency chains, which allows an aspect providing complex functionality to reuse the functionality provided by other aspects. The RAM weaver can create woven views of the composed model for debugging, simulation or code generation purpose, as well as perform consistency checks during the weaving and on the woven model to detect inconsistencies of the composition.
Symbolic Model Checking for Three Valued Logic
Authors: Jian Guo, Jungang Han
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Classical model checking can not be used to reason about system with uncertainty. We extend model checking in order to verify properties of a 3-valued system. A triple decision diagram (TDD) and its operations are given. Then states, transitional relations and label function of a system with a partial Kripke structure are implemented by TDDs. The algorithm of 3 valued symbolic model checking is presented. Finally potential applications in hardware and SoC are discussed.
Constructing the Simplest Possible Phylogenetic Network from Triplets
Authors: Leo Iersel, Steven Kelk
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

A phylogenetic network is a directed acyclic graph that visualises an evolutionary history containing so-called reticulations such as recombinations, hybridisations or lateral gene transfers. Here we consider the construction of a simplest possible phylogenetic network consistent with an input set T, where T contains at least one phylogenetic tree on three leaves (a triplet) for each combination of three taxa. To quantify the complexity of a network we consider both the total number of reticulations and the number of reticulations per biconnected component, called the level of the network. We give polynomial-time algorithms for constructing a level-1 respectively a level-2 network that contains a minimum number of reticulations and is consistent with T (if such a network exists). In addition, we show that if T is precisely equal to the set of triplets consistent with some network, then we can construct such a network, which minimises both the level and the total number of reticulations, in time O(|T| k + 1), if k is a fixed upper bound on the level.
A Real-Time Content Based Video Copy Detection System
Authors: Sid-Ahmed Berrani, Nicolas Gengembre
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

This paper presents a content-based video copy detection system which achieves an optimal trade-off between effectiveness and efficiency. This is the most important feature for industrial applications such as copyright enforcement and duplicate detection in large databases.
Improvement on Parallel AQPSO Using the Best Position
Authors: Yan Ma, Yang Liu, Deyun Yang, Yuping Chen
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Quantum-behaved Particle Swarm Optimization (QPSO) is a new Particle Swarm Optimization (PSO) algorithm. Compared with Standard PSO (SPSO), it guarantees that particles converge in global optimum point in probability and this algorithm has better performance and stability. This paper introduces an improved Adaptive QPSO algorithm, puts the parallelisms crude of AQPSO and high speed of computer together, and island model is introduced. Multi-swarm Parallel AQPSO (PAQPSO) Algorithm is reported. The algorithm employs the co-evolution model to avoid pre-maturity and improves global search performance. This approach is tested on several accredited benchmark functions and the experiment results show much advantage of PAQPSO to PSOs, and the running time is also decreased in linear.
How to build better models: applying agile techniques to simulation
Authors: James T. Sawyer, David M. Brann
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

For simulation practitioners, the common steps in a simulation modeling engagement are likely familiar: problem assessment, requirements specification, model building, verification, validation, and delivery of results. And for industrial engineers, it's a well-known adage that paying careful attention to process can help achieve better results. In this paper, we'll apply this philosophy to the process of model building as well. We'll consider model building within the framework of a software development exercise, and discuss how best practices from the broader software community can be applied for process improvement. In particular, we'll focus on the "Milestones Approach" to simulation development -- based on the popular "agile software" philosophy and our own experiences in real-world simulation consulting practice. We'll discuss how thinking agile can help minimize risk within the model-building process, and help create a better simulation for your customers.
A low noise and reliable CMOS I/O buffer for mixed low voltage applications
Authors: Hwang-Cherng Chow, You-Gang Chen
Venue: Proceedings of the 6th conference on Microelectronics, nanoelectronics, optoelectronics (2007)

In this paper the design of a high voltage tolerant and reliable CMOS I/O buffer is proposed without using thick-oxide devices. In this presented design for mixed low voltage interface applications, it uses a simpler structure and therefore the circuit has good gate-oxide reliability. In addition, it is free of dc leakage current. No additional pad for dual power supplies is required in the proposed circuit. The pull-up operation including both the rise-time and power-delay product is reduced about 20%. The simple structure leads to 50% area saving as compared to the existing prior art.