ppxscal/embedding_network huggingface dataset:
An adaptive approach to granular real-time anomaly detection
Authors: Chin-Tser Huang, Jeff Janies
Venue: EURASIP Journal on Advances in Signal Processing (2009)

Anomaly-based intrusion detection systems have the ability to detect novel attacks, but when applied in real-time detection, they face the challenges of producing many false alarms and failing to match with the high speed of modern networks due to their computationally demanding algorithms. In this paper, we present Fates, an anomaly-based NIDS designed to alleviate the two challenges. Fates views the monitored network as a collection of individual hosts instead of as a single autonomous entity and uses dynamic, individual threshold for each monitored host, such that it can differentiate between characteristics of individual hosts and can independently assess their threat to the network. Each packet to and from a monitored host is analyzed with an adaptive and efficient charging scheme that considers the packet type, number of occurrences, source, and destination. The resulting charge is applied to the individual hosts threat assessment, providing pinpointed analysis of anomalous activities. We use various datasets to validate Fates ability to distinguish scanning behavior from benign traffic in real time.
Multiple Client Processes in a Mobile Process Environment: Managing Ubiquitous Access of Mobile Devices within Multi-WAP-Environments in Hospitals
Authors: Andr Futter
Venue:  (2009)

While the coverage of area-wide wireless networks is becoming more and more common the number of mobile devices is also increasing. Thereby the possible field of application for wireless devices increases and provides new potentials to support their users in their everyday life. This also implicates the advancement of the underlying design and principles of communication of wireless devices within wireless networks. One of these communications technologies is Communicating Sequential Processes for Java (JCSP). In this book I adress the principles of JCSP in general and two extensions, namely JCSP.Net and JCSP.mobile, in particular. Thereby the already existing functionality of static client process loading will be investigated and as a result of this the functionality will be enhanced to cope with dynamic loading of multiple client processes. The result will then be evaluated by means of an exemplary implementation which in turn shall prove of its value. The importance of the JCSP package will therby be emphasised. 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
Deciding determinism of caterpillar expressions
Authors: Kai Salomaa, Sheng Yu, Jinfeng Zan
Venue: Theoretical Computer Science (2009)

Caterpillar expressions have been introduced by Bruggemann-Klein and Wood for applications in markup languages. Caterpillar expressions provide a convenient formalism for specifying the operation of tree-walking automata on unranked trees. Here we give a formal definition of determinism of caterpillar expressions that is based on the language of instruction sequences defined by the expression. We show that determinism of caterpillar expressions can be decided in polynomial time.
Learning SQL, 2nd edition
Authors: Alan Beaulieu
Venue:  (2009)

Updated for the latest database management systems -- including MySQL 6.0, Oracle 11g, and Microsoft's SQL Server 2008 -- this introductory guide will get you up and running with SQL quickly. Whether you need to write database applications, perform administrative tasks, or generate reports, Learning SQL, Second Edition, will help you easily master all the SQL fundamentals. Each chapter presents a self-contained lesson on a key SQL concept or technique, with numerous illustrations and annotated examples. Exercises at the end of each chapter let you practice the skills you learn. With this book, you will: Move quickly through SQL basics and learn several advanced features Use SQL data statements to generate, manipulate, and retrieve data Create database objects, such as tables, indexes, and constraints, using SQL schema statements Learn how data sets interact with queries, and understand the importance of subqueries Convert and manipulate data with SQL's built-in functions, and use conditional logic in data statements Knowledge of SQL is a must for interacting with data. With Learning SQL, you'll quickly learn how to put the power and flexibility of this language to work.
Selective phrase pair extraction for improved statistical machine translation
Authors: Luke S. Zettlemoyer, Robert C. Moore
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

Phrase-based statistical machine translation systems depend heavily on the knowledge represented in their phrase translation tables. However, the phrase pairs included in these tables are typically selected using simple heuristics that potentially leave much room for improvement. In this paper, we present a technique for selecting the phrase pairs to include in phrase translation tables based on their estimated quality according to a translation model. This method not only reduces the size of the phrase translation table, but also improves translation quality as measured by the BLEU metric.
Research on the Method of Destroying Classified Information Carriers
Authors: Yanmei Lv, Gefang Wang, Jiangsheng Sun, Dongqing Liu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

The application of classified information carriers in the army is more and more extensive, so how to destroy the out-of-date carriers effectively will concern the safety of the national defense undertaking. The main revealing channel of the classified information at present was analyzed at first in the text, the managing focal point and the destroying necessity for the classified information carriers were pointed out. Then, the destroying methods of the storage mediums were studied in detail. Through compare, the best destroying method was educed: the magnetic mediums can adopt the method that structuring the return circuit of RCL to emerge the twinkling strong magnetic field to achieve demagnetize destroying the medium; the non-magnetic medium can adopt the method of machinery crush to achieve destroying the medium.
K-Anonymity Based on Sensitive Tuples
Authors: Xinping Hu, Zhihui Sun, Yingjie Wu, Wenyu Hu, Jiancheng Dong
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

K-anonymity is one simple and efficient method to achieve sensitive data protected in data sharing application. The traditional k-anonymity techniques, however, have all tuples of publishing database involve in anonymity generalize which lead to reduce the precision of publishing table. This paper firstly proposes a Naïve Sensitive Tuple Anonymity Method. In this method only sensitive tuples are generalized, and the other tuples can be directly published. In order to improve the security of publish data, after the sensitive tuples were anonymized, we selected some proportion non-sensitive tuples anonymized and imported into corresponding sensitive tuple anonymity group, which can guarantee the density of the sensitive tuples satisfied with equal to 1/m in every anonymity group. Experiment results on the Adult Database show the proposed methods not only can improve the accuracy of the releasing data, but also can preserve privacy. The algorithm is effective and efficient.
v.morish'09: A Morphing-Based Singing Design Interface for Vocal Melodies
Authors: Masanori Morise, Masato Onishi, Hideki Kawahara, Haruhiro Katayose
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

This paper describes a singing design method based on morphing, the design and development of an intuitive interface to assist morphing-based singing design. The proposed interface has a function for real-time morphing, based on simple operation with a mouse, and an editor to control the singing features in detail. The user is able to enhance singing voices efficiently by using these two functions. In this paper, we discuss the requirement for an interface to assist in morphing-based singing design, and develope an interface to fulfill the requirement.
Risk Aversion through Fuzzy Numbers
Authors: Irina Georgescu
Venue: Proceedings of the 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (2008)

This paper is concerned with an approach of risk aversion by possibility theory. We introduce and study new possibilistic risk indicators. The main notions are the possibilistic risk premium and the possibilistic relative risk premium associated with a fuzzy number and a utility function. We also give formulae for computing them. They extend to possibility theory the classic notions of risk premium and relative risk premium. We show by an example how the main possibilistic risk indicators are computed using trapezoidal fuzzy numbers.
On Characteristics of Biorthogonal Vector-Valued Multivariate Wavelet Packets Associated with a Quantity Dilation Matrix
Authors: Shude Du, Deyou Yuan
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Wavelet analysis has been a widely applied one method for analyzing signal. In this work, the notion of vector-valued wavelet packets for space L^2(R^n)^s is proposed, which are generalizations of univariate wavelet packets. A constructive method for a class of biorthogonal vector-valued multivariate wavelet packets is formulated and their biorthogonality properties are discussed by virtue of matrix theory, and operator theory. Three biorthogonality formulas concerning these wavelet packets are provided. Furthermore, new Riesz bases of space L^2(R^n)^s from these wavelet packets are obtained.
Value-function approximations for partially observable Markov decision processes
Authors: Milos Hauskrecht
Venue: Journal of Artificial Intelligence Research (2000)

Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in which states of the system are observable only indirectly, via a set of imperfect or noisy observations. The modeling advantage of POMDPs, however, comes at a price -- exact methods for solving them are computationally very expensive and thus applicable in practice only to very simple problems. We focus on efficient approximation (heuristic) methods that attempt to alleviate the computational problem and trade off accuracy for speed. We have two objectives here. First, we survey various approximation methods, analyze their properties and relations and provide some new insights into their differences. Second, we present a number of new approximation methods and novel refinements of existing techniques. The theoretical results are supported by experiments on a problem from the agent navigation domain.
Research on Mapping Algorithm of UML Sequence Diagrams to Object Petri Nets
Authors: Guangyu Li, Shuzhen Yao
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

The paper firstly analyzes the basic structure of UML Sequence Diagram and gives the formal description of Object Petri Nets. For reuse, the formal description of reusable interaction is studied. Then the paper puts forward the mapping algorithm of UML Sequence Diagrams to Object Petri Nets, which ensures the accuracy, integrity and simplicity of the results by four steps, including abstraction, merging, synchronization and reduction, thus providing a good foundation for automatic verification.
Research upon Fault Diagnosis Expert System Based on Fuzzy Neural Network
Authors: Yang Kun, OuYang Guangyao, Ye Lina
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

The traditional Expert System has many shortcomings, for instance, its weak knowledge acquisition capability and empirical knowledge’s expression uncertainty. To solve these bottleneckproblems, Astrategy onfault diagnosis expert system which is based upon fuzzy theoryand ANN(ANN:artificial neural network) techniqueis put forward in this paper, as also its principle, construction, algorithm are allpresented. Its performance has been proved to be very excellent when used upon the diesel fuel system classifiedfaultdiagnosis.
Recommender systems: attack types and strategies
Authors: Michael P. O'Mahony, Neil J. Hurley, Guénolé C. M. Silvestre
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

In the research to date, the performance of recommender systems has been extensively evaluated across various dimensions. Increasingly, the issue of robustness against malicious attack is receiving attention from the research community. In previous work, we have shown that knowledge of certain domain statistics is sufficient to allow successful attacks to be mounted against recommender systems. In this paper, we examine the extent of domain knowledge that is actually required and find that, even when little such knowledge is known, it remains possible to mount successful attacks.
Syntactic Structural Kernels for Natural Language Interfaces to Databases
Authors: Alessandra Giordani, Alessandro Moschitti
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

A core problem in data mining is to retrieve data in a easy and human friendly way. Automatically translating natural language questions into SQL queries would allow for the design of effective and useful database systems from a user viewpoint. Interesting previous work has been focused on the use of machine learning algorithms for automatically mapping natural language (NL) questions to SQL queries.In this paper, we present many structural kernels and their combinations for inducing the relational semantics between pairs of NL questions and SQL queries. We measure the effectiveness of such kernels by using them in Support Vector Machines to select the queries that correctly answer to NL questions. Experimental results on two different datasets show that our approach is viable and that syntactic information under the form of pairs of syntactic tree fragments (from queries and questions) plays a major role in deriving the relational semantics between the two languages.
Web data retrieval: solving spatial range queries using k-nearest neighbor searches
Authors: Wan D. Bae, Shayma Alkobaisi, Seon Ho Kim, Sada Narayanappa, Cyrus Shahabi
Venue: Geoinformatica (2009)

As Geographic Information Systems (GIS) technologies have evolved, more and more GIS applications and geospatial data are available on the web. Spatial objects in a given query range can be retrieved using spatial range query ¿ one of the most widely used query types in GIS and spatial databases. However, it can be challenging to retrieve these data from various web applications where access to the data is only possible through restrictive web interfaces that support certain types of queries. A typical scenario is the existence of numerous business web sites that provide their branch locations through a limited "nearest location" web interface. For example, a chain restaurant's web site such as McDonalds can be queried to find some of the closest locations of its branches to the user's home address. However, even though the site has the location data of all restaurants in, for example, the state of California, it is difficult to retrieve the entire data set efficiently due to its restrictive web interface. Considering that k-Nearest Neighbor (k-NN) search is one of the most popular web interfaces in accessing spatial data on the web, this paper investigates the problem of retrieving geospatial data from the web for a given spatial range query using only k-NN searches. Based on the classification of k-NN interfaces on the web, we propose a set of range query algorithms to completely cover the rectangular shape of the query range (completeness) while minimizing the number of k-NN searches as possible (efficiency). We evaluated the efficiency of the proposed algorithms through statistical analysis and empirical experiments using both synthetic and real data sets.
Transforming Crisis Management: Field Studies on the Efforts to Migrate from System-Centric to Network-Centric Operations
Authors: Nitesh Bharosa, Bart Zanten, Marijn Janssen, Martijn Groenleer
Venue: Proceedings of the 8th International Conference on Electronic Government (2009)

Governments are searching for ways to improve information sharing between autonomous agencies. During crises, information demand and supply are often unbalanced, leading to situations in which relief workers are faced with incorrect, outdated or incomplete information. To address such challenges, network-centric operations (NCO), which involves information sharing with the socio-technical network as the central enabling mechanism, has been proposed. Yet, NCO is ill-understood and it is unclear whether the promised benefits can be realized in practice. In this paper we address the gap between the concept and reality of NCO. The necessary capabilities for NCO are identified using literature research and potential benefits are analyzed using field research. We found that NCO is not a silver bullet for overcoming the inherent problems of crisis management and could even reinforce existing problems. Our findings suggest that NCO is difficult to implement and needs to be complemented with capability development in the information and cognitive domain.
User Research and User Centered Design; Designing, Developing, and Commercializing Widget Service on Mobile Handset
Authors: Sung Moo Hong
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Mobile widget is a new paradigm for interactive idle screen service on mobile handset. Currently the standardization of widget is being discussed by W3C; Widget is globally accepted as a tiny web application. In Korea, however, mobile widget business is being expanded prior to that of web/PC widget though it has lots of issues to be solved: issues of usability, technology, and business model. In order to resolve these issues, user research and user centered design process were derived by KTF through the development of mobile widget. While using newly developed Widget, user can easily set and unset widgets by just pushing Widget key and change background images without changing one single widget. User can also personalize his/her widget adjusting its spot, size, opacity, theme, and color.
A Hybrid Agent Based and Differential Equation Model of Body Size Effects on Pathogen Replication and Immune System Response
Authors: Soumya Banerjee, Melanie E. Moses
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

Many emerging pathogens infect multiple host species [1], and multi-host pathogens may have very different dynamics in different host species [2]. This research addresses how pathogen replication rates and Immune System (IS) response times are constrained by host body size. An Ordinary Differential Equation (ODE) model is used to show that pathogen replication rates decline with host body size but IS response rates remain invariant with body size. An Agent-Based Model (ABM) is used to investigate two models of IS architecture that could explain scale invariance of IS response rates. A stage structured hybrid model is proposed that strikes a balance between the detailed representation of an ABM and computational tractability of an ODE, by using them in the initial and latter stages of an infection, respectively.
In vivo interactive visualization of&#x00a0;four-dimensional blood flow&#x00a0;patterns: Realtime assessment of volumetric phase contrast MRI
Authors: Bernhard Kainz, Ursula Reiter, Gert Reiter, Dieter Schmalstieg
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

In this paper we give an overview over a series of experiments to visualize and measure flow fields in the human vascular system with respect to their diagnostic capabilities. The experiments utilize a selection of GPU-based sparse and dense flow visualization algorithms to show the diagnostic opportunities for volumetric cardiovascular phase contrast magnetic resonance imaging data sets. Besides classical hardware accelerated particle and line-based approaches, an extensible tublet-based visualization, a four-dimensional volumetric line integral convolution and a new two-dimensional cutting plane tool for three-dimensional velocity data sets have been implemented. To evaluate the results, several hearts of human subjects have been investigated and a flow phantom was built to artificially simulate distinctive flow features. Our results demonstrate that we are able to provide an interactive tool for cardiovascular diagnostics with complementary hardware accelerated visualizations.
Reconstruction and simplification of high-quality multiple-region models from planar sections
Authors: R. H. Moore, G. S. Rohrer, S. Saigal
Venue: Engineering with Computers (2009)

This paper proposes an accurate and efficient process that reconstructs, smoothes, and simplifies large-scale, three-dimensional models with multiple regions from serial sections. Models are reconstructed using a generally classed marching tetrahedra method that is less complex than the recent generally classed marching cubes algorithms, yet still preserves interface conformability between the regions in the model. Surfaces are smoothed using a volume preserving Laplacian filter that also preserves the region interfaces and topologies. Models are simplified using an efficient and accurate quadric-based edge contraction scheme that maintains the interfaces between regions and preserves the topology of the model. The edge contraction process is constrained to produce surface meshes that have high-quality facet shapes. The process both reconstructs as well as simplifies these models on-the-fly in one pass so that huge models may be processed within limited computer memory. The process does not require the entire original model to fit in the memory at one time. Example results of multiple-region models from the fields of materials science and medicine are presented.
New polynomial classes for logic-based abduction
Authors: Bruno Zanuttini
Venue: Journal of Artificial Intelligence Research (2003)

We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of abduction problems.