ppxscal/embedding_network huggingface dataset:
Feature Selection for Density Level-Sets
Authors: Marius Kloft, Shinichi Nakajima, Ulf Brefeld
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an efficient feature selection method for density level-set estimation where optimal kernel mixing coefficients and model parameters are determined simultaneously. Our approach generalizes one-class support vector machines and can be equivalently expressed as a semi-infinite linear program that can be solved with interleaved cutting plane algorithms. The experimental evaluation of the new method on network intrusion detection and object recognition tasks demonstrate that our approach not only attains competitive performance but also spares practitioners from a priori decisions on feature sets to be used.
Efficient statistical methods for evaluating trading agent performance
Authors: Eric Sodomka, John Collins, Maria Gini
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Market simulations, like their real-world counterparts, are typically domains of high complexity, high variability, and incomplete information. The performance of autonomous agents in these markets depends both upon the strategies of their opponents and on various market conditions, such as supply and demand. Because the space for possible strategies and market conditions is very large, empirical analysis in these domains becomes exceedingly difficult. Researchers who wish to evaluate their agents must run many test games across multiple opponent sets and market conditions to verify that agent performance has actually improved. Our approach is to improve the statistical power of market simulation experiments by controlling their complexity, thereby creating an environment more conducive to structured agent testing and analysis. We develop a tool that controls variability across games in one such market environment, the Trading Agent Competition for Supply Chain Management (TAC SCM), and demonstrate how it provides an efficient, systematic method for TAC SCM researchers to analyze agent performance.
A Hybrid Heuristic Algorithm for Forest Harvest Decision
Authors: Fadian Lu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

In this article, a hybrid heuristic algorithm based on Genetic Algorithm and Hooke and Jeeves is described for solving a complicated forest harvest decision problem, which involves optimization of thinning and final felling under price risk for a mixed species stand of spruce and pine. The strategy consists of two optimal stock level functions and one reservation price function; in which, there are ten variables that need to be optimized. The hybrid heuristic algorithm consists of two stages. At the first stage, a Genetic Algorithm is applied to generate initial candidate solutions. At the second stage, the Hooke and Jeeves is applied to find the optimal solutions using these initial solutions. As a benchmark, a pure Genetic algorithm, Hooke and Jeeves, and Powell search are also tested. Results show that the hybrid heuristic algorithm is the best one among all of the tested algorithms. The Genetic Algorithm ranks second, the Hooke and Jeeves the third and the Powell search is the worst.
Coal Mine Subsided Water Quality Assessment and Subsided Water Resource Comprehensive Utilization Analysis A Case of Subsided Water Area in Panyi Coal Mine
Authors: Liangji Xu, Yongmei Gao
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

In order to provide the theoretical basis for comprehensive utilization of coal mine subsided water resource in Huainan coal mine, 39 water sampling points in two typical subsided water areas of Panyi coal mine are chosen to monitor the water quality by sampling, the heavy metal elements of water body are analyzed and the fuzzy synthetic evaluation technique is used to analyze the water quality comprehensively. The results show that the water quality of well closed subsided water area in the west presents a decreasing tendency from the center of the water body to both banks, the water quality of the center profile is grade •; But the water quality of the subsided water area in the east that is connected with Nihe River is relatively poor and water qualities of all monitored profiles are all grade • or •. Due to the influence of polluting sources from mining industries, the pollution intensity of heavy metal elements in the east subsided water area is more serious than the west subsided water area. The subsided water areas of Panyi coalmine are polluted in different degree, but they can be comprehensively utilized if they are protected and corresponding treatment measures are adopted.
Distributed Intrusion Detection: Simulation and Evaluation of Two Methodologies
Authors: Mauro Migliardi, Valentina Resaz
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

- The proliferation of wideband connections while opening the market to a wealth of new web based applications has also provided a pervasive set of injection point for malicious network traffic. This fact has generated a new storm of network attacks that every day generates a non negligible amount of network traffic. Intrusion Detection Systems (IDS) aim at preventing the delivery of malicious traffic to targeted systems thus preventing damage at the end point of the attack, however they are positioned either on a single host or on very peripheral routers, thus they do not provide any help in reducing the amount of malicious traffic roaming the network. The sheer amount of traffic to be analyzed prevents any attempt to move intrusion detection to core routers, however Distributed Intrusion Detection Systems (DIDS) may provide a solution. In past works DIDS have been envisioned as cooperative clusters of traditional IDS, in this paper we present two novel methodologies that could allow distributing the computational load of intrusion detection on several nodes and a simulation tool that allows us to evaluate the impact of these methodologies on the nodes involved.
Case Study on Dynamic Evolution of Software Based on AOP
Authors: Zhixiang Zhang, Zhenxing Yao, Kong Jie
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Many software must be upgraded continuously and dynamically for the bugs and the needs of new function as well as the change of environment. Dynamic evolution to software contains the adding, modifying, deleting of software modules and the transferring of states from the old version to the new one. In this paper, we propose an AOP-based method that (1) views the evolution of modules as aspects, (2) uses static analysis to ensure the correctness of evolution, and (3) provides 3 sub-methods to handle addition, deletion and modification of classes. An example is implemented using JBOSS AOP, demonstrating correctness of the proposed method.
Gaining Assurance in a Voter-Verifiable Voting System
Authors: Eugenio Alberdi, Lorenzo Strigini, Kieran Leach, Peter Ryan, Philippe Palanque, Marco Winckler
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

The literature on e-voting systems has many examples of discussion of the correctness of the computer and communication algorithms of such systems, as well as discussions of their vulnerabilities. However, a gap in the literature concerns the practical need (before adoption of a specific e-voting system) for a complete case demonstrating that the system as a whole has sufficiently high probability of exhibiting the desired properties when in use in an actual election. This paper discusses the problem of producing such a case, with reference to a specific system: a version of the Prêt à Voter scheme for voter-verifiable e-voting. We show a possible organisation of a case in terms of four main requirements – accuracy, privacy, termination and ‘trustedness’– and show some of the detailed organisation that such a case should have, the diverse kinds of evidence that needs to be gathered and some of the interesting difficulties that arise.
PERFORMANCE EVALUATION OF URL ROUTING: FOR CONTENT DISTRIBUTION NETWORKS
Authors: Zornitza Prodanoff
Venue:  (2009)

Content Distribution Networks (CDNs) are a rapidly growing service on the Internet. CDNs distribute and co-locate content to be geographically close to the users (of the content). This content mirroring 1) reduces the load on the origin server, 2) reduces traffic on the Internet, and 3) improves response time to the users. For CDNs to be feasible, methods of routing of HTTP requests originating from users are needed. URL routers need routing tables similar to IP routing tables in IP routers. However, the methods used for IP routing cannot scale to URL routing. In URL routing the number of destination addresses (URLs) greatly exceeds the number of IP addresses. In addition, URLs are not stable - new ones are constantly created and old ones disappear. The large size of URLs, their very large number, and their dynamic nature makes URL routing a difficult problem. This is the problem that is addressed in this book. 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
A complete translation from SPARQL into efficient SQL
Authors: Brendan Elliott, En Cheng, Chimezie Thomas-Ogbuji, Z. Meral Ozsoyoglu
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

This paper presents a feature-complete translation from SPARQL, the proposed standard for RDF querying, into efficient SQL. We propose "SQL model"-based algorithms that implement each SPARQL algebra operator via SQL query augmentation, and generate a flat SQL statement for efficient processing by relational database query engines. SPARQL-to-SQL translation presented is feature-complete, since it applies to all SPARQL language features. Finally, we demonstrate the performance and scalability of our method by an extensive evaluation using recent SPARQL benchmark queries, and a benchmark dataset, as well as a real-world photo dataset.
On the Communication Complexity of Read-Once AC^0 Formulae
Authors: T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication complexity of the function f(x, y) = T(x \circ y) is \Omega(n/4^d) where (x \circ y) is defined so that the resulting tree also has alternating levels of AND and OR gates. For each bit of x \circ y, the operation \circ is either AND or OR depending on the gate in T to which it is an input. Using this, we show that for general AND-OR trees T with n inputs and depth d, the communication complexity of f (x \circ y) is n/2^{\O(d log d)}. These results generalize classical results on the communication complexity of set-disjointness [1], [2] (where T is an OR -gate) and recent results on the communication complexity of the TRIBES functions [3] (where T is a depth-2 read-once formula). Our techniques build on and extend the information complexity methodology [4], [5], [3] for proving lower bounds on randomized communication complexity. Our analysis for trees of depth d proceeds in two steps: (1) reduction to measuring the information complexity of binary depth-d trees, and (2) proving lower bounds on the information complexity of binary trees. In order to execute this program, we carefully construct input distributions under which both these steps can be carried out simultaneously. We believe the tools we develop will prove useful in further studies of information complexity in particular, and communication complexity in general.
Crawling Deep Web Using a New Set Covering Algorithm
Authors: Yan Wang, Jianguo Lu, Jessica Chen
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This can be modeled as a set covering problem which has been extensively studied. The conventional set covering algorithms, however, do not work well when applied to deep web crawling due to various special features of this application domain. Typically, most set covering algorithms assume the uniform distribution of the elements being covered, while for deep web crawling, neither the sizes of documents nor the document frequencies of the queries is distributed uniformly. Instead, they follow the power law distribution. Hence, we have developed a new set covering algorithm that targets at web crawling. Compared to our previous deep web crawling method that uses a straightforward greedy set covering algorithm, it introduces weights into the greedy strategy. Our experiment carried out on a variety of corpora shows that this new method consistently outperforms its un-weighted version.
Use of Nursing Management Minimum Data Set (NMMDS) for a Focused Information Retrieval
Authors: Josette Jones, Eric T. Newsom, Connie Delaney
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Evidence-based nursing (EBN) is central to the knowledge base for nursing practice, and evidence based interventions are considered as one of the best avenues to achieve maximum outcomes [1]. These interventions typically are implemented through the portals of nursing management forming the context for delivery of nursing practice [2]. Hence, understanding how to provide high quality nursing care efficiently and making management decisions based in evidence is of increasing importance. EBN management requires a research-driven approach for identifying patient, professional, and setting characteristics that affect the processes of care at micro and meso levels. Yet nurse managers cite lack of time and skills; limited access to search engines or poor understanding of research language and most importantly a paucity of management research articles as a barrier to EBN. This study explored the possibility of using the NMMDS to retrieve research related to nursing management.
Figure mining for biomedical research
Authors: Raul Rodriguez-Esteban, Ivan Iossifov
Venue: Bioinformatics (2009)

Motivation: Figures from biomedical articles contain valuable information difficult to reach without specialized tools. Currently, there is no search engine that can retrieve specific figure types. Results: This study describes a retrieval method that takes advantage of principles in image understanding, text mining and optical character recognition (OCR) to retrieve figure types defined conceptually. A search engine was developed to retrieve tables and figure types to aid computational and experimental research. Availability: http://iossifovlab.cshl.edu/figurome Contact: raul.rodriguez-esteban@pfizer.com
Multiresolution texture analysis for human oocyte cytoplasm description
Authors: Laura Caponetti, Giovanna Castellano, Vito Corsini, Gianluca Sforza
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

In this work we present an approach based on image texture analysis to obtain a description of oocyte cytoplasm which could aid the medical expert in the selection of oocytes to be used for assisted insemination. More specifically, we describe some characteristics such as different levels of uniformity and/or granularity in the oocyte cytoplasm, using multiresolution texture analysis applied to light microscope images. To this aim, we evaluate some statistical measures in the wavelet transform domain of image regions and classify them according to different levels of granularity. Preliminary experimental results on a collection of light microscope images of oocytes are reported to show the effectiveness of the proposed approach.
Rational interpolation to solutions of Riccati difference equations on elliptic lattices
Authors: Alphonse P. Magnus
Venue: Journal of Computational and Applied Mathematics (2009)

It is shown how to define difference equations on particular lattices {x"n}, n@?Z, where the x"ns are values of an elliptic function at a sequence of arguments in arithmetic progression (elliptic lattice). Solutions to special difference equations (elliptic Riccati equations) have remarkable simple (!) interpolatory continued fraction expansions.
Using handheld devices for mobile interaction with displays in home environments
Authors: Andreas Lorenz, Clara Fernandez De Castro, Enrico Rukzio
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

An increasing number of households are equipped with a large number of TV sets and more and more of them are large highresolution displays. Furthermore, we see the integration of web browsing and email functionalities in these devices, which are then often controlled via a wireless mouse and keyboard. The latter were rather designed for the usage on a desk, rather then by a person sitting on their sofa in a living room. Therefore, this paper investigates the usage of a PDA, as a replacement which can be used for controlling a remote cursor and for text input. The results of the experimental comparison of these input devices show, as expected, the superiority of mouse and keyboard (as the study participants were very experienced with them). Surprising results were the task completion time and usability satisfaction when using the mobile device. These results show the applicability of using a mobile device for controlling an application on a remote screen. Using a mobile device provides the advantages that every person can e.g. use their own mobile phone or that these devices can be used in multi-user scenarios.
Delay analysis for maximal scheduling with flow control in wireless networks with bursty traffic
Authors: Michael J. Neely
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

We consider the delay properties of one-hop networks with general interference constraints and multiple traffic streams with time-correlated arrivals. We first treat the case when arrivals are modulated by independent finite state Markov chains. We show that the well known maximal scheduling algorithm achieves average delay that grows at most logarithmically in the largest number of interferers at any link. Further, in the important special case when each Markov process has at most two states (such as bursty ON/OFF sources), we prove that average delay is independent of the number of nodes and links in the network, and hence is order-optimal. We provide tight delay bounds in terms of the individual auto-correlation parameters of the traffic sources. These are perhaps the first order-optimal delay results for controlled queueing networks that explicitly account for such statistical information. Our analysis treats cases both with and without flow control.
Selective attention model with spiking elements
Authors: David Chik, Roman Borisyuk, Yakov Kazanovich
Venue: Neural Networks (2009)

A new biologically plausible model of visual selective attention is developed based on synaptically coupled Hodgkin-Huxley neurons. The model is designed according to a two-layer architecture of excitatory and inhibitory connections which comprises two central neurons and a population of peripheral neurons. Two types of inhibition from the central neurons are present: fixed inhibition which is responsible for the formation of the attention focus, and short-term plastic inhibition which is responsible for the shift of attention. The regimes of synchronous dynamics associated with the development of the attentional focus are studied. In particular, the regime of partial synchronization between spiking activity of the central and peripheral neurons is interpreted as object selection to the focus of attention. It is shown that peripheral neurons with higher firing rates are selected preferentially by the attention system. The model correctly reproduces some observations concerning the mechanisms of attentional control, such as the coherence of spikes in the population of neurons included in the focus of attention, and the inhibition of neurons outside the focus of attention. Sequential selection of stimuli simultaneously present in the visual scene is demonstrated by the model in the frequency domain in both a formal example and a real image.
SIGACT news complexity theory column 64
Authors: Lane A. Hemaspaandra
Venue: ACM SIGACT News (2009)

Autoreducibility and mitoticity express weak forms of redundancy of information that a set might possess. We describe many results known about these concepts. Mitoticity always implies autoreducibility, but the converse holds in some situations and fails in others. Among the results we describe are that NP-complete sets are many-one autoreducible and that every many-one autoreducible set is many-one mitotic. In particular, every infinite NPcomplete set splits by a set in P into two disjoint, infinite NP-complete set.
Finite Satisfiability in Infinite-Valued Łukasiewicz Logic
Authors: Steven Schockaert, Jeroen Janssen, Dirk Vermeir, Martine Cock
Venue: Proceedings of the 3rd International Conference on Scalable Uncertainty Management (2009)

Although it is well-known that every satisfiable formula in Łukasiewicz' infinite-valued logic $\mathcal{L}_{\infty}$ can be satisfied in some finite-valued logic, practical methods for finding an appropriate number of truth degrees do currently not exist. As a first step towards efficient reasoning in $\mathcal{L}_{\infty}$, we propose a method to find a tight upper bound on this number which, in practice, often significantly improves the worst-case upper bound of Aguzzoli et al.
The Hierarchical Path-Selection Scheme Based on Multihoming NEMO
Authors: Long-Sheng Li, Gwo-Chuan Lee, Jhu-Shyuan Mei, Cing-Long Chen
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

The Network Mobility (NEMO) protocol allows a mobile network (MONET) to move around and maintains session connectivity of nodes in the MONET. In real world, the topology of the MONET may be very complex. To increase session reliability of the MONET, the concept of multihoming in NEMO is proposed. In the multihoming environment, the MONET has more than one path to connect to the Internet and these paths can be maintained simultaneously. But the loop routing problem may occur in such an environment. In this paper, we proposed a Hierarchical Path-Selection Scheme to prevent the loop routing problem. We add the nested level and ClusterHead ID information to Router Advertisement (RA) messages. The MONET doesn't form the loop routing and achieves fault-tolerant and load-balanced goal by the proposed scheme.