ppxscal/embedding_network huggingface dataset:
Automated Spyware Collection and Analysis
Authors: Andreas Stamminger, Christopher Kruegel, Giovanni Vigna, Engin Kirda
Venue: Proceedings of the 12th International Conference on Information Security (2009)

Various online studies on the prevalence of spyware attest overwhelming numbers (up to 80%) of infected home computers. However, the term spyware is ambiguous and can refer to anything from plug-ins that display advertisements to software that records and leaks user input. To shed light on the true nature of the spyware problem, a recent measurement paper attempted to quantify the extent of spyware on the Internet. More precisely, the authors crawled the web and analyzed the executables that were downloaded. For this analysis, only a single anti-spyware tool was used. Unfortunately, this is a major shortcoming as the results from this single tool neither capture the actual amount of the threat, nor appropriately classify the functionality of suspicious executables in many cases.For our analysis, we developed a fully-automated infrastructure to collect and install executables from the web. We use three different techniques to analyze these programs: an online database of spyware-related identifiers, signature-based scanners, and a behavior-based malware detection technique. We present the results of a measurement study that lasted about ten months. During this time, we crawled over 15 million URLs and downloaded 35,853 executables. Almost half of the spyware samples we found were not recognized by the tool used in previous work. Moreover, a significant fraction of the analyzed programs (more than 80%) was incorrectly classified. This underlines that our measurement results are more comprehensive and precise than those of previous approaches, allowing us to draw a more accurate picture of the spyware threat.
Planning in models that combine memory with predictive representations of state
Authors: Michael R. James, Satinder Singh
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Models of dynamical systems based on predictive state representations (PSRs) use predictions of future observations as their representation of state. A main departure from traditional models such as partially observable Markov decision processes (POMDPs) is that the PSR-model state is composed entirely of observable quantities. PSRs have recently been extended to a class of models called memory-PSRs (mPSRs) that use both memory of past observations and predictions of future observations in their state representation. Thus, mPSRs preserve the PSR-property of the state being composed of observable quantities while potentially revealing structure in the dynamical system that is not exploited in PSRs. In this paper, we demonstrate that the structure captured by mPSRs can be exploited quite naturally for stochastic planning based on value-iteration algorithms. In particular, we adapt the incremental-pruning (IP) algorithm defined for planning in POMDPs to mPSRs. Our empirical results show that our modified IP on mPSRs outperforms, in most cases, IP on both PSRs and POMDPs.
Using vehicular networks to collect common traffic data
Authors: Mohammad Hadi Arbabi, Michele Weigle
Venue: Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking (2009)

State transportation departments are required to annually report various traffic statistics to the US government. Currently, this data is measured using older technologies that are susceptible to failure and are difficult to maintain and repair. In this paper, we propose using vehicular ad-hoc networks (VANETs) to measure this common traffic data. In addition to collecting information required for reporting purposes, VANET-based traffic monitoring can provide highly-desired metrics such as travel times, which cannot be directly measured using commonly used traffic monitoring approaches. We show that with 100% penetration rate, our methods can collect precise traffic data and that even with low penetration rates or low density traffic, we can collect high quality estimates of travel times, time mean speeds, and space mean speeds.
A Parallel Simulated Annealing Approach for Floorplanning in VLSI
Authors: Jyh-Perng Fang, Yang-Lang Chang, Chih-Chia Chen, Wen-Yew Liang, Tung-Ju Hsieh, Muhammad T. Satria, Chin-Chuan Han
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

One of the critical issues in floorplanning is to minimize area and/or wire length of a given design with millions of transistors while considering other factors which may influence the success of design flow or even manufacturing. To deal with the floorplan design with enormous amount of interconnections and design blocks, we adopt a parallel computing environment to increase the throughput of solution space searching. Also, we include the fractional factorial analysis to further reduce the time needed to search the acceptable solution. The experimental results indicate that our approach can obtain better space utility rate and it takes less time than the traditional method and parallel method do.
GOD-CS: A New Grid-Oriented Dissection Clustering Scheme for Large Databases
Authors: Cheng-Fa Tsai, Chien-Sheng Chiu
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Many recent clustering schemes have been applied in previous investigations to resolve the issues of high execution cost and low correction ratio in arbitrary shapes. Two conventional approaches that can solve one of these problems accurately are K-means and DBSCAN. However, DBSCAN is inefficient while K-means has poor accuracy. ANGEL and G-TREACLE have been proposed to improve current clustering tribulations, but require complicated procedures and numerous thresholds. This work presents a new clustering technique, called "GOD-CS", which employs grid-based clustering, neighborhood 8-square searching and tolerance rate to reduce these problems. Simulation results indicate that GOD-CS clusters large databases very quickly, while having almost identical or even better clustering performance in comparison to several existing well-known approaches with the original patterns in a simple procedure. Thus, GOD-CS performs well and is simple to implement.
Speeding Up Model Checking of Timed-Models by Combining Scenario Specialization and Live Component Analysis
Authors: Víctor Braberman, Diego Garbervestky, Nicolás Kicillof, Daniel Monteverde, Alfredo Olivero
Venue: Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems (2009)

The common practice for verifying properties described as event occurrence patterns is to translate them into observer state machines. The resulting observer is then composed with (the components of) the system under analysis in order to verify a reachability property. Live Component Analysis is a "cone of influence" abstraction technique aiming at mitigating state explosion by detecting, at each observer location, which components are actually relevant for model checking purposes. Interestingly enough, the more locations the observer has, the more precise the relevance analysis becomes. This work proposes the formal underpinnings of a method to safely leverage this fact when properties are stated as event patterns (scenarios). That is, we present a sound and complete method of property manipulation based on specializing and complementing scenarios. The application of this method is illustrated on two case studies of distributed real-time system designs, showing dramatic improvements in the verification phase, even in situations where verification of the original scenario was unfeasible.
Motion Stroke-A Tablet-Based Interface for Motion Design Tool Using Drawing
Authors: Haruki Kouda, Ichiroh Kanaya, Kosuke Sato
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Conventional animation tools provide users with complicated operations which require them to adjust too much variables to design a virtual model's 3D motion. In the proposed system, "Motion Stroke", users can control these variables only by their 2D drawings on a tablet surface. The proposed interface allows users to create new motions through a trial-and-error process which is nature in drawing of a picture on a paper. It offers a familiar form for designing of a virtual object's motion. We conducted several evaluations and confirmed that the proposed system allows users to explore their desired motions flexibly.
Matrix Factorization Techniques for Recommender Systems
Authors: Yehuda Koren, Robert Bell, Chris Volinsky
Venue: Computer (2009)

As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest-neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels.
Discovering interesting holes in data
Authors: Bing Liu, Liang-Ping Ku, Wynne Hsu
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Current machine learning and discovery techniques focus on discovering rules or regularities that exist in data. An important aspect of the research that has been ignored in the past is the learning or discovering of interesting holes in the database. If we view each case in the database as a point in a it-dimensional space, then a hole is simply a region in the space that contains no data point. Clearly, not every hole is interesting. Some holes are obvious because it is known that certain value combinations are not possible. Some holes exist because there are insufficient cases in the database. However, in some situations, empty regions do carry important information. For instance, they could warn us about some missing value combinations that are either not known before or are unexpected. Knowing these missing value combinations may lead to significant discoveries. In this paper, we propose an algorithm to discover holes in databases.
Semantic transparency in user assistance systems
Authors: Andrea E. Kohlhase, Michael Kohlhase
Venue: Proceedings of the 27th ACM international conference on Design of communication (2009)

In this paper we analyze the problem of "situating explanations" in user assistance systems. We introduce semantic transparency as a user interface property that enables giving appropriate help. We explicate this notion in document player applications found in office suites, for example. Moreover, we show how semantic transparency can be strengthened when the underlying software is complemented by a semantic ally system. The approach consists in illustrating existing software semantically. We present some semantic extensions of office applications as examples. We also describe how the semantic transparency approach allows the exploitation of new interactions for user assistance systems.
The determinants and expression of computer-related anger
Authors: John P. Charlton
Venue: Computers in Human Behavior (2009)

Studies of everyday computer-related anger are rare. To shed more light upon this anecdotally common phenomenon, retrospective self-report questionnaires were used to elicit closed-ended and open-ended responses from 126 members of the general public and students in northern England who supplied psychological and behavioral data connected with a single recently experienced occurrence of computer-related anger. Inter alia, findings show verbal and physical aggression towards equipment to be common in bouts of computer anger, and physical aggression to be associated with greater negative affect prior to incidents but not with stress-related factors. However, stress-related factors and negative affect predicted variance in anger intensity over and above cognitive appraisal variables. It is concluded that computer anger is likely to be a source of stress for a small but significant number of people, that computers' non-sentience leads to physical disinhibition, but that evidence that the expression of computer anger in social environments is inhibited by fear of people's negative evaluations is weak. Further conclusions include the observations that anger is likely to be more intense when theoretically relevant cognitive appraisals are made, a person is in an irritable mood and when physiological arousal is elevated because of ongoing events.
Modeling and Simulation of Road Traffic System in Container Terminal
Authors: Li Li, Xiaodong Wang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Modeling and simulation of container terminal logistics system is rapidly developed and widely applied. This paper describes the modeling and simulation of the road traffic system that is often overlooked, where the references about simulation and modeling, the modeling methods, effectual software, some definite problems are given. This study contributes to reduce the difference between the simulation and reality system and increase the capacity and efficiency of container terminal logistics system.
Conceptual play spaces and the quest atlantis project
Authors: Sasha Barab, Adam Ingram-Goble, Melissa Gresalfi, Anna Arici, Sinem Siyahhan, Tyler Dodge, Ken Hay
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

In this presentation we overview our theory and design work around conceptual play spaces. Conceptual play is a state of engagement that involves (a) projection into the role of a character who, (b) engaged in a partly fantastical problem context, (c) must apply conceptual understandings to make sense of and, ultimately, transform the context. Additionally, a conceptual play space designed to support learning should (d) provide opportunities to examine one's participation in terms of the impact it had on the immersive context. Four core presentations will be offered, each demonstrating how the notion of conceptual play has been taken up in particular curricular instantiations through the platform of Quest Atlantis. Quest Atlantis is a learning and teaching project that uses a 3D multi-user environment to immerse children, ages 9-12, in educational tasks.
Privately querying location-based services with SybilQuery
Authors: Pravin Shankar, Vinod Ganapathy, Liviu Iftode
Venue: Proceedings of the 11th international conference on Ubiquitous computing (2009)

To usefully query a location-based service, a mobile device must typically present its own location in its query to the server. This may not be acceptable to clients that wish to protect the privacy of their location. This paper presents the design and implementation of SybilQuery, a fully decentralized and autonomous k-anonymization-based scheme to privately query location-based services. SybilQuery is a client-side tool that generates k-1 Sybil queries for each query by the client. The location-based server is presented with a set of k queries and is unable to distinguish between the client's query and the Sybil queries, thereby achieving k-anonymity. We tested our implementation of SybilQuery on real mobility traces of approximately 500 cabs in the San Francisco Bay area. Our experiments show that SybilQuery can efficiently generate Sybil queries and that these queries are indistinguishable from real queries.
Fully-Automated White Matter Hyperintensity Detection with Anatomical Prior Knowledge and without FLAIR
Authors: Christopher Schwarz, Evan Fletcher, Charles Decarli, Owen Carmichael
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

This paper presents a method for detection of cerebral white matter hyperintensities (WMH) based on run-time PD-, T1-, and T2-weighted structural magnetic resonance (MR) images of the brain along with labeled training examples. Unlike most prior approaches, the method is able to reliably detect WMHs in elderly brains in the absence of fluid-attenuated (FLAIR) images. Its success is due to the learning of probabilistic models of WMH spatial distribution and neighborhood dependencies from ground-truth examples of FLAIR-based WMH detections. These models are combined with a probabilistic model of the PD, T1, and T2 intensities of WMHs in a Markov Random Field (MRF) framework that provides the machinery for inferring the positions of WMHs in novel test images. The method is shown to accurately detect WMHs in a set of 114 elderly subjects from an academic dementia clinic. Experiments show that standard off-the-shelf MRF training and inference methods provide robust results, and that increasing the complexity of neighborhood dependency models does not necessarily help performance. The method is also shown to perform well when training and test data are drawn from distinct scanners and subject pools.
Large scale computational science on federated international grids: The role of switched optical networks
Authors: P. V. Coveney, G. Giupponi, S. Jha, S. Manos, J. MacLaren, S. M. Pickles, R. S. Saksena, T. Soddemann, J. L. Suter, M. Thyveetil, S. J. Zasada
Venue: Future Generation Computer Systems (2010)

The provision of high performance compute and data resources on a grid has often been the primary concern of grid resource providers, with the network links used to connect them only a secondary matter. Certain large scale distributed scientific simulations, especially ones which involve cross-site runs or interactive visualisation and steering capabilities, often require high quality of service, high bandwidth, low latency network interconnects between resources. In this paper, we describe three applications which require access to such network infrastructure, together with the middleware and policies needed to make them possible.
Reliable Greedy Forwarding in Obstacle-Aware Wireless Sensor Networks
Authors: Ming-Tsung Hsu, Frank Yeong-Sung Lin, Yue-Shan Chang, Tong-Ying Juang
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

We present Obstacle-aware Virtual Circuit geographic Routing (OVCR), a novel routing mechanism for obstacle-aware wireless sensor networks that uses the obstacle-free path computed by the sink to make the greedy forwarding of geographic routing dependable. OVCR discovers obstacle-free paths by the powerful sink as obstacles are detected. To bypass obstacles, the information of obstacle-free paths is forwarded to sensors close to obstacles for finding virtual circuits in a distributed manner. A virtual circuit containing a sequence of relay positions (temporary destinations) is used for obstacle-free data packet forwarding. Data packets can then be forwarded greedily, either by the location of the destination, or the relay position. Simulation results show that OVCR is more dependable since the success rate of packet forwarding is raised and more efficient since the hop count is reduced.
Incrementality in deterministic dependency parsing
Authors: Joakim Nivre
Venue: Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together (2004)

Deterministic dependency parsing is a robust and efficient approach to syntactic parsing of unrestricted natural language text. In this paper, we analyze its potential for incremental processing and conclude that strict incrementality is not achievable within this framework. However, we also show that it is possible to minimize the number of structures that require non-incremental processing by choosing an optimal parsing algorithm. This claim is substantiated with experimental evidence showing that the algorithm achieves incremental parsing for 68.9% of the input when tested on a random sample of Swedish text. When restricted to sentences that are accepted by the parser, the degree of incrementality increases to 87.9%.
The Characterization of a Class of Orthogonal Multiple Vector-valued Compactly Supported Wavelet Packets with Five-scale
Authors: Yuxi Quan, Lieya Yan
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

Since 1986, Wavelet analysis has become a popular subject in scientific research. It has been a powerful tool for exploring and solvingmany complicated problems in natural science and engineering computation. In this article, the multiple vector-valued wavelet packetsare defined and investigated.A procedure for constructing the multiple vector-valued waveletpackets is presented. The properties of multiple vector-valued wavelet packets are discussed by using integral transformation and operator theory. Finally, new orthogonal bases of L^2(R,C^{u\times u}) is constructed from the orthogonal multiple vector-valued wavelet packets.
A Domain-Specific Framework for Automated Construction and Verification of Railway Control Systems
Authors: Anne E. Haxthausen
Venue: Proceedings of the 28th International Conference on Computer Safety, Reliability, and Security (2009)

The development of modern railway and tramway control systems represents a considerable challenge to both systems and software engineers: The goal to increase the traffic throughput while at the same time increasing the availability and reliability of railway operations leads to a demand for more elaborate safety mechanisms in order to keep the risk at the same low level that has been established for European railways until today. The challenge is further increased by the demand for shorter time-to-market periods and higher competition among suppliers of the railway domain; both factors resulting in a demand for a higher degree of automation for the development verification, validation and test phases of projects, without impairing the thoroughness of safety-related quality measures and certification activities. Motivated by these considerations, this presentation describes an approach for automated construction and verification of railway control systems.
Dynamic memory management
Authors: Richard Jones
Venue: Proceedings of the 2007 International Lisp Conference (2007)

Garbage collection (GC) is a key component of almost all modern programming languages. The advent of conventional object-oriented languages supported by managed run-times (e.g. Java, C# and even Managed C++) has brought GC into the mainstream and, as memory manager performance is critical for many large applications, brought GC to the attention of programmers outside its traditional functional programming language community. In this talk, I shall start by reviewing how GC got to where it is today, why it is desirable, what performance you might reasonably expect and I shall outline the directions in which GC research is moving. In particular, I'll look at some of the challenges facing modern GC, in contexts ranging from GC for high-performance, multiprocessor systems to GC for real-time systems and limited devices, from better integrating with its operating environment to supporting specific applications. I shall speculate wildly on future directions for research.
A discriminative latent variable chinese segmenter with hybrid word/character information
Authors: Xu Sun, Yaozhong Zhang, Takuya Matsuzaki, Yoshimasa Tsuruoka, Jun'ichi Tsujii
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

Conventional approaches to Chinese word segmentation treat the problem as a character-based tagging task. Recently, semi-Markov models have been applied to the problem, incorporating features based on complete words. In this paper, we propose an alternative, a latent variable model, which uses hybrid information based on both word sequences and character sequences. We argue that the use of latent variables can help capture long range dependencies and improve the recall on segmenting long words, e.g., named-entities. Experimental results show that this is indeed the case. With this improvement, evaluations on the data of the second SIGHAN CWS bakeoff show that our system is competitive with the best ones in the literature.