ppxscal/embedding_network huggingface dataset:
Do nintendo handhelds play nice?: An analysis of its wireless behavior
Authors: Adam C. Lusch, Adele V. Fleury, Surendar Chandra
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

Nintendo DS handheld game units are popular. They are capable of wireless game play using IEEE 802.11 networks. In this paper, we investigated the local Nintendo wireless game traffic and the effect of this game traffic on other wireless users. We analyzed the wireless traffic generated by up to six players for a number of different games. Our analysis showed that the local wireless traffic differed significantly from wide-area wireless traffic for the same games and hardware. The bit rates used made the small game packets appear large to higher speed networks that shared the wireless channel. Also, Nintendo used a point coordination function (PCF) to arbitrate channel access for local games. Ideally, the contention free slots provided by PCF can provide better quality of service for the game traffic. However, this added extra overhead for the coordination traffic, about 98% of polls for Pictochat produced no game data. Also, this PCF coordination packets were unaware of the coexistence of distributed coordination function (DCF) traffic from typical wireless access points; catastrophically interfering with the wireless traffic of other wireless LAN users.
Localization of the complex zeros of parametrized families of polynomials
Authors: Stéphane R. Louboutin
Venue: Journal of Symbolic Computation (2008)

Let P"n(x)=x^m+p"m"-"1(n)x^m^-^1+...+p"1(n)x+p"m(n) be a parametrized family of polynomials of a given degree with complex coefficients p"k(n) depending on a parameter n@?Z">="0. We use Rouche's theorem to obtain approximations to the complex roots of P"n(x). As an example, we obtain approximations to the complex roots of the quintic polynomials P"n(x)=x^5+nx^4-(2n+1)x^3+(n+2)x^2-2x+1 studied by A. M. Schopp.
My botnet is bigger than yours (maybe, better than yours): why size estimates remain challenging
Authors: Moheeb Abu Rajab, Jay Zarfoss, Fabian Monrose, Andreas Terzis
Venue: Proceedings of the first conference on First Workshop on Hot Topics in Understanding Botnets (2007)

As if fueled by its own fire, curiosity and speculation regarding botnet sizes abounds. Among researchers, in the press, and in the classroom--the questions regarding the widespread effect of botnets seem never-ending: what are they? how many are there? what are they used for? Yet, time and time again, one lingering question remains: how big are today's botnets? We hear widely diverging answers. In fact, some may argue, contradictory. The root cause for this confusion is that the term botnet size is currently poorly defined. We elucidate this issue by presenting different metrics for counting botnet membership and show that they lead to widely different size estimates for a large number of botnets we tracked. In particular, we show how several issues, including cloning, temporary migration, and hidden structures significantly increase the difficulty of determining botnet size with any accuracy. Taken as a whole, this paper calls into question speculations about botnet size, and more so, questions whether size really matters.
Quantum signature based on quantum one-way map and the stabilized quantum code
Authors: Ying Guo, Wenshan Cui, Yutao Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The reliable assignment of the messages to its originator and the integrality verification of the messages is an important issue in classic cryptography as well as quantum cryptography. To perform such kind of tasks, a quantum signature scheme is proposed by exploiting quantum one-way function. The employed quantum one-way function is generated by using quantum fingerprint and stabilizer quantum code.
Genetic and non-genetic operators in alecsys
Authors: Marco Dorigo
Venue: Evolutionary Computation (1993)

It is well known that standard learning classifier systems, when applied to many different domains, exhibit a number of problems: payoff oscillation, difficulty in regulating interplay between the reward system and the background genetic algorithm (GA), rule chains' instability, default hierarchies' instability, among others. ALECSYS is a parallel version of a standard learning classifier system (CS) and, as such, suffers from these same problems. In this paper we propose some innovative solutions to some of these problems. We introduce the following original features. Mutespec is a new genetic operator used to specialize potentially useful classifiers. Energy is a quantity introduced to measure global convergence to apply the genetic algorithm only when the system is close to a steady state. Dynamic adjustment of the classifiers set cardinality speeds up the performance phase of the algorithm. We present simulation results of experiments run in a simulated two-dimensional world in which a simple agent learns to follow a light source.
Personal Credit Scoring Model of Non-linear Combining Forecast Based on GP
Authors: Ming-hui Jiang, Xu-chuan Yuan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Aiming at low predictive accuracies of single models, this paper presents a combining forecast for personal credit scoring. Based on two single statistical models of linear regression and logistic regression, this paper constructed a non-linear combining forecast by genetic programming (GP) and used the constructed model for personal credit scoring. The application results indicate that the predictive accuracy of the non-linear combining forecast based on GP is higher than linear regression, logistic regression and the linear combining forecast based on least square method by 3.40%, 2.83% and 2.64% respectively. The non-linear combining forecast also gets a much lower type II error rate which is more significant for commercial banks to keep away from consumer credit risks.
Control of Navigable Panoramic Imagery with Information Furniture: Chair-Driven 2.5 with Automatic Window Dilation
Authors: Michael Cohen, Kunihiro Doi, Takayuki Hattori, Yorinobu Mine
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

We describe our experiments using a rolling swivel chair as a control/display platform for exploring multi-standpoint panoramic spaces, characterized not only by 360 scenes, but also modestly navigable photorealistic spaces, enabled by multinode QTVR movies. Two markers are attached to a prototype chair, one on each armrest. The markers' loca- tions are tracked by application of image processing tech- niques to the video stream captured by a ceiling cam, de- riving chair displacement and rotation. Using such chair- driven gestures, graphical windows egocentrically display- ing the panned and displaced panoramic scene can be dy- namically dilated in a GUI root window by active explo- ration.
A hidden Markov model-based approach for identifying timing differences in gene expression under different experimental factors
Authors: Takashi Yoneya, Hiroshi Mamitsuka
Venue: Bioinformatics (2007)

Motivation: Time series experiments of cDNA microarrays have been commonly used in various biological studies and conducted under a lot of experimental factors. A popular approach of time series microarray analysis is to compare one gene with another in their expression profiles, and clustering expression sequences is a typical example. On the other hand, a practically important issue in gene expression is to identify the general timing difference that is caused by experimental factors. This type of difference can be extracted by comparing a set of time series expression profiles under a factor with those under another factor, and so it would be difficult to tackle this issue by using only a current approach for time series microarray analysis. Results: We have developed a systematic method to capture the timing difference in gene expression under different experimental factors, based on hidden Markov models. Our model outputs a real-valued vector at each state and has a unique state transition diagram. The parameters of our model are trained from a given set of pairwise (generally multiplewise) expression sequences. We evaluated our model using synthetic as well as real microarray datasets. The results of our experiment indicate that our method worked favourably to identify the timing ordering under different experimental factors, such as that gene expression under heat shock tended to start earlier than that under oxidative stress. Contact: t-yoneya@kirin.co.jp Supplementary information: Supplementary data are available at Bioinformatics online.
Implementation of Content Analysis System for Recognition of Journals_ Table of Contents
Authors: Y.-B. Kwon, J. Park
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, we design the primary component, an automated segmentation method that extracts article titles, author names and page numbers from scanned image of a journal's table of contents. We expanded the method to five types of journal layout. An interactive tool was also developed with Visual C++ to help the user manage the segmentation results, and manually control the table analysis. Its performance was tested over a panel of seventy images, which gather the most common types of layout encountered
Workshop Report Computer Elements for the 80's
Authors: M. F. Slana
Venue: Computer (1979)

Chips and the systems they reside in are becoming increasingly complex, presenting challenges to device designers and manufacturers to produce devices that are both more reliable and more fault-tolerant.
Designing a secure reliable file system for sensor networks
Authors: Neerja Bhatnagar, Ethan L. Miller
Venue: Proceedings of the 2007 ACM workshop on Storage security and survivability (2007)

Wireless sensor networks are increasingly being used to monitor habitats, analyze traffic patterns, study troop movements, and gather data for reconnaissance and surveillance missions. Many wireless sensor networks require the protection of their data from unauthorized access and malicious tampering, motivating the need for a secure and reliable file system for sensor nodes. The file system presented in this paper encrypts data stored on sensor nodes' local storage in such a way that an intruder who compromises a sensor node cannot read it, and backs it up regularly on to its neighbor nodes. The file system utilizes algebraic signatures to detect data tampering.
Defending P2Ps from Overlay Flooding-based DDoS
Authors: Yunhao Liu, Xiaomei Liu, Chen Wang, Li Xiao
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

flooding-based search mechanism is often used in unstructured P2P systems. Although a flooding-based search mechanism is simple and easy to implement, it is vulnerable to overlay distributed denial-of-service (DDoS) attacks. Most previous security techniques protect networks from network-layer DDoS attacks, but cannot be applied to overlay DDoS attacks. Overlay flooding-based DDoS attacks can be more damaging in that a small number of messages are inherently propagated to consume a large amount of bandwidth and computation resources. We propose a distributed and scalable method, DD-POLICE, to detect malicious nodes in order to defend P2P systems from overlay flooding-based DDoS attacks. We show the effectiveness of DD-POLICE by comprehensive simulation studies. We believe that deploying DD-POLICE will make P2P systems more scalable and robust.
Analysis of Extendible Hashing
Authors: H. Mendelson
Venue: IEEE Transactions on Software Engineering (1982)

Extendible hashing is an attractive direct-access technique which has been introduced recently. It is characterized by a combination of database-size flexibility and fast direct access. This paper derives performance measures for extendible hashing, and considers their implecations on the physical database design. A complete characterization of the probability distribution of the directory size and depth is derived, and its implications on the design of the directory are studied. The expected input/output costs of various operations are derived, and the effects of varying physical design parameters on the expected average operating cost and on the expected volume are studied.
The CommUnity Workbench
Authors: Cristóvão Oliveira, Michel Wermelinger
Venue: Science of Computer Programming (2007)

CommUnity is a formal approach to Software Architecture with a strict separation of the computation, coordination, and distribution aspects. The approach is based on a parallel design language with state, which facilitates the specification of computations compared to the process calculi used by other formal approaches, and on category theory, which provides an intuitive yet precise graph-based semantics for the configuration of components and connectors. The CommUnity Workbench is being developed as a proof of concept of the CommUnity framework, providing a graphical integrated development environment to write components, draw configurations, and execute the resulting system.
Demand Forecasting for Companies with Many Branches, Low Sales Numbers per Product, and Non-Recurring Orderings
Authors: Sasha Kurz, Jorg Rambau
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

We propose the new Top-Dog-Index to quantify the his- toric deviation of the supply data of many small branches for a commodity group from sales data. On the one hand, the common parametric assumptions on the customer de- mand distribution in the literature could not at all be sup- ported in our real-world data set. On the other hand, a reasonably-looking non-parametric approach to estimate the demand distribution for the different branches directly from the sales distribution could only provide us with statis- tically weak and unreliable estimates for the future demand. Based on real-world sales data from our industry partner we provide evidence that our Top-Dog-Index is statistically robust. Using the Top-Dog-Index, we propose a heuristics to improve the branch-dependent proportion between sup- ply and demand. Our approach cannot estimate the branch- dependent demand directly. It can, however, classify the branches into a given number of clusters according to an historic oversupply or undersupply. This classification of branches can iteratively be used to adapt the branch distri- bution of supply and demand in the future.
The Synthesis of Multivalued Cellular Cascades and the Decomposability of Group Functions
Authors: O. Kolp
Venue: IEEE Transactions on Computers (1972)

This note is largely a generalization of the Elspas-Stone theory about the realization of group functions from Xm into H. In the paper of Elspas-Stone only the case X = {0,1} was treated, whereas we consider an arbitrary finite set X. We have shown that the most important results of [1] hold for this general case.
Adaptive out-of-band routing protocol auto-negotiation for mobile ad hoc networks
Authors: Oliver Battenfeld, Patrick Reinhardt, Bernd Freisleben
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

There is no universal approach for the routing problem in mobile ad hoc networks: Depending on mobility or data traffic patterns, resource constraints, environmental conditions or delivery requirements in terms of reliability, latencies or available bandwidth, protocol designs and optimizations focus on different aspects. Changes in the usage context have an effect on the suitability or efficiency of the utilized routing protocol, such that switching to another protocol intended to work in the altered environment might be desired. In this paper, we present a novel approach to automatically configure and adaptively switch between routing protocols at runtime by coordinating local preferences using a fault-tolerant distributed voting algorithm. It has been implemented as an extension to a routing software running on Linux and Unix-like systems.
An Embedded OCR Software Architecture for Enhancing Portability
Authors: S. Kim, J. Park, Y.-B. Kwon
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

A software architecture style for OCR to increase portability is presented. A hybrid style of four layers, combined with a pipe & filter and layer-type architecture is adopted to reduce the platform dependency keeping the cascading process stream of general OCR. The OCR process constructs a top layer to accomplish the main task. Data manager is separated as a different layer from the top layer, which handles input and knowledge data of the classifier. To provide a unified API, an interface layer is included. A neural network based general OCR source code is totally re-written on the foundation of the proposed style. As a result, confirmed a high portability rate over 99% of source code reuse without modification and performance sacrifices is achieved in the experiment.
Agglomerative Mechanism and Spatial Evolution of FDI
Authors: Yan-bo Zhang, Ya-jun Guo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Though all locations contain a certain production activities, only some of them can draw on FDI. FDI is more heaped up on space comparing with other modes of productiongathering together is the end-result of the great majority of overseas-funded enterprises. By building up an oligopoly output competition model consists of multinational enterprises and the host state enterprises, this paper analyzes the agglomerative mechanism of FDI from multinational enterprises to the host country; Moreover analyzes the spatial evolution patterns of FDI.
Pattern classes of permutations via bijections between linearly ordered sets
Authors: Sophie Huczynska, Nik Ruškuc
Venue: European Journal of Combinatorics (2008)

A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e. indecomposable as a union of proper subclasses, has a representation as the set of subpermutations of a bijection between two countable (or finite) linearly ordered sets A and B. Concentrating on the situation where A is arbitrary and B=N, we demonstrate how the order-theoretic properties of A determine the structure of X and we establish results about independence, contiguity and subrepresentations for classes admitting multiple representations of this form.
Constructing and integrating data-centric web applications: methods, tools, and techniques
Authors: Stefano Ceri, Ioana Manolescu
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

This tutorial deals with the construction of data-centric Web applications, focusing on the modelling of processes and on the integration with Web services. The tutorial describes the standards, methods, and tools that are commonly used for building these applications.
Sensitivity evaluation of TMR-hardened circuits to multiple SEUs induced by alpha particles in commercial SRAM-based FPGAs
Authors: A. Manuzzato, P. Rech, S. Gerardin, A. Paccagnella, L. Sterpone, M. Violante
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

We present an experimental analysis of the sensitivity of SRAM-based FPGAs to alpha particles. We study how the different resources inside the FPGA (LUTs, MUXs, PIPs, etc. ) are affected by alpha-induced SEUs, assessing the cross section for the configuration memory cells controlling each of them. We then show two case studies, a chain of FIR filters and a series of soft microcontrollers implemented in the FPGA, measuring the rate of functional interruptions during exposure to a constant flux of alpha particles. The designs are then hardened using triplication with a single final voter, with intermediate voters, and finally including also feedback voters. The robustness of each hardening solution is discussed, analyzing the trade-off between area and fault-tolerance as a function of the number of SEUs in the configuration memory. An analytical model to predict the cross section of a given design with and without hardening solutions is finally proposed, starting from the experimental data.
Solving the hazmat transport network design problem
Authors: Erhan Erkut, Fatma Gzara
Venue: Computers and Operations Research (2008)

In this paper, we consider the problem of network design for hazardous material transportation where the government designates a network, and the carriers choose the routes on the network. We model the problem as a bilevel network flow formulation and analyze the bilevel design problem by comparing it to three other decision scenarios. The bilevel model is difficult to solve and may be ill-posed. We propose a heuristic solution method that always finds a stable solution. The heuristic exploits the network flow structure at both levels to overcome the difficulty and instability of the bilevel integer programming model. Testing on real data shows that the linearization of the bilevel model fails to find stable solutions and that the heuristic finds lower risk networks in less time. Further testing on random instances shows that the heuristically designed networks achieve significant risk reduction over single-level models. The risk is very close to the least risk possible. However, this reduction in risk comes with a significant increase in cost. We extend the bilevel model to account for the cost/risk trade-off by including cost in the first-level objective. The biobjective-bilevel model is a rich decision-support tool that allows for the generation of many good solutions to the design problem.
Modeling and manipulating the structure of hierarchical schemas for the web
Authors: Theodore Dalamagas, Alexandra Meliou, Timos Sellis
Venue: Information Sciences: an International Journal (2008)

The Semantic Web is the next step of the current Web where information will become more machine-understandable to support effective data discovery and integration. Hierarchical schemas, either in the form of tree-like structures (e.g., DTDs, XML schemas), or in the form of hierarchies on a category/subcategory basis (e.g., thematic hierarchies of portal catalogs), play an important role in this task. They are used to enrich semantically the available information. Up to now, hierarchical schemas have been treated rather as sets of individual elements, acting as semantic guides for browsing or querying data. Under that view, queries like ''find the part of a portal catalog which is not present in another catalog'' can be answered only in a procedural way, specifying which nodes to select and how to get them. For this reason, we argue that hierarchical schemas should be treated as full-fledged objects so as to allow for their manipulation. This work proposes models and operators to manipulate the structural information of hierarchies, considering them as first-class citizens. First, we explore the algebraic properties of trees representing hierarchies, and define a lattice algebraic structure on them. Then, turning this structure into a boolean algebra, we present the operators S-union, S-intersection and S-difference to support structural manipulation of hierarchies. These operators have certain algebraic properties to provide clear semantics and assist the transformation, simplification and optimization of sequences of operations using laws similar to those of set theory. Also, we identify the conditions under which this framework is applicable. Finally, we demonstrate an application of our framework for manipulating hierarchical schemas on tree-like hierarchies encoded as RDF/s files.