ppxscal/embedding_network huggingface dataset:
Time-space tradeoffs for undirected graph traversal
Authors: P. Beame
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Time-space tradeoffs for traversing undirected graphs are proved. One of these tradeoffs is a quadratic lower bound on a deterministic model that closely matches the probabilistic upper bound of A.Z. Broder et al. (1989). The models used are variants of S.A. Cook and C.W. Rackoff's (1980) jumping automata for graphs. Some open problems are stated.
A workbench for information quality evaluation
Authors: Besiki Stvilia
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This paper describes the architecture of an Information Quality Evaluation Workbench for rapid design and operationalization of information quality assessment models.
An excluded minor theorem for the octahedron
Authors: John Maharry
Venue: Journal of Graph Theory (1999)

In this article it is shown that every 4-connected graph that does not contain a minor isomorphic to the octahedron is isomorphic to the square of an odd cycle. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 31: 95&ndash;100, 1999
Trading a mean-reverting asset: Buy low and sell high
Authors: Hanqin Zhang, Qing Zhang
Venue: Automatica (Journal of IFAC) (2008)

This paper is concerned with an optimal trading (buy and sell) rule. The underlying asset price is governed by a mean-reverting model. The objective is to buy and sell the asset so as to maximize the overall return. Slippage cost is imposed on each transaction. The associated HJB equations (quasi-variational inequalities) are used to characterize the value functions. It is shown that the solution to the original optimal stopping problem can be obtained by solving two quasi-algebraic equations. Sufficient conditions are given in the form of a verification theorem. A numerical example is reported to demonstrate the results.
Note on array-valued functions
Authors: Arjen Markus
Venue: ACM SIGPLAN Fortran Forum (2008)

One feature of Fortran that deserves more attention in my opinion is the use of array-valued functions. In particular this feature can be used to achieve a high-level programming style, much like what John Backus advocated in his ACM speech (Backus, 1978). Many of the intrinsic functions return arrays and Fortran's array operations are further examples, be it implicit.
A study of group support systems and the intergroup setting
Authors: John Lim, Xiaojia Guo
Venue: Decision Support Systems (2008)

In this study, we explore the supporting role of group support systems (GSS) in organizational workgroups that involve groups of distinct social identities. Intergroup processes become relevant and prevalent in such workgroups and trigger new issues. Anonymity is an important feature of GSS that concerns social influence in the intergroup setting. We report on the results of an experiment consisting of 20 workgroups. The enforcement of common fate and its impact on social influence are also examined. Our findings provide preliminary indication of the usefulness of GSS in the intergroup setting of organizational workgroups.
A hybrid genetic algorithm for the multi-depot vehicle routing problem
Authors: William Ho, George T. S. Ho, Ping Ji, Henry C. W. Lau
Venue: Engineering Applications of Artificial Intelligence (2008)

The distribution of finished products from depots to customers is a practical and challenging problem in logistics management. Better routing and scheduling decisions can result in higher level of customer satisfaction because more customers can be served in a shorter time. The distribution problem is generally formulated as the vehicle routing problem (VRP). Nevertheless, there is a rigid assumption that there is only one depot. In cases, for instance, where a logistics company has more than one depot, the VRP is not suitable. To resolve this limitation, this paper focuses on the VRP with multiple depots, or multi-depot VRP (MDVRP). The MDVRP is NP-hard, which means that an efficient algorithm for solving the problem to optimality is unavailable. To deal with the problem efficiently, two hybrid genetic algorithms (HGAs) are developed in this paper. The major difference between the HGAs is that the initial solutions are generated randomly in HGA1. The Clarke and Wright saving method and the nearest neighbor heuristic are incorporated into HGA2 for the initialization procedure. A computational study is carried out to compare the algorithms with different problem sizes. It is proved that the performance of HGA2 is superior to that of HGA1 in terms of the total delivery time.
Learning to Classify Threaten E-mail
Authors: Subramanian Appavu alias Balamurugan, Ramasamy Rajaram
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In this paper we study supervised classification of e-mails. We consider the task of Threaten E-mail Detection (i.e. email related to terrorism, fraud, etc.). In this supervised learning setting, we investigate the use of Datamining classifiers for automatic threaten e-mail detection. We show that Decision Tree is a good choice for this task asit runs fast on large and high dimensional databases, is easy to tune and is highly accurate, outperforming popular algorithms such as Support Vector Machines, Naive Bayes. In particular, we are interested in detecting fraudulent andpossibly criminal activities from such e-mails.
The Ultimate Drift Velocity in Two Dimensional Quantum Limit
Authors: Mohammad Taghi Ahmadi, Ismail Saad, Razali Ismail, Vijay K. Arora
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In a conventional MOSFET, carriers are confined in a direction normal to the channel, and free to move in two dimensions. It is, however, now with Nanotubes possible to make structures that confine carriers in two dimensions, so that they are free to move only in one direction. The nanowires and nanotubes are being considered as best candidates for high-speed applications because of the high mobility due to the suppression of the ionized impurity scattering especially at low temperatures. It is shown that the high mobility does not always lead to higher carrier velocity. Using the distribution function that takes into account the asymmetrical distribution of drifting electrons in an electric field is presented. This distribution function transforms the random motion of electrons into a streamlined one that gives the ultimate saturation velocity that is a function of temperature in nondegenrate regime and a function of carrier concentration in the degenerate regime The ultimate drift velocity is found to be appropriate thermal velocity for a given dimensionality for nondegenrately doped samples. However, the ultimate drift velocity is the appropriate average of the Fermi velocity for degenerately doped samples.
An Implicit Data Structure For The Dictionary Problem That Runs In Polylog Time
Authors: J. I. Munro
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

We introduce a data structure that requires only one pointer for every k data values and permits the operations search, insert and delete to be performed in 0 (k log n) time. This structure is used to develop another that requires no pointers and supports insert, delete and search in 0 (log2 n) time.
The Weber quantizer: perceptual coding for networked telepresence and teleaction
Authors: P. Hinterseer, J. Kammerl, E. Steinbach, S. Chaudhuri
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

We present a theoretical analysis of a perceptual coding approach for networked telepresence and teleaction. Our so called Weber quantizer is based on Weber's Law and can be used in haptic data communication to eliminate changes which can not be perceived by the human operator. The main advantage of the Weber quantizer is that it minimizes the number of samples or packets to be transmitted. Basic properties like the resulting sample rate and the MSE of the proposed Weber quantizer are derived analytically and proven correct by simulation for the case of a uniformly distributed input sequence. The contributions in this paper provide the basis for the analysis of more realistic signal models and constitute a first step towards the understanding of the relationship between the Weber quantizer, statistical error measures and actual human distortion perception.
The stability of the single population's system under environmental toxin pulse control
Authors: Xue Yakui, Wang Jianzhong, Jin Zhen
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

In this paper, we investigate a single population model in a polluted environment with impulsive toxicant input at fixed moment. We show that the population is extinct when the impulsive period is less than some critical value. Otherwise the population is permanent. We have drawn the universal law under this kind of situation. Finally we simulated the solution that we drawn in this paper, and witch verified exactness of the conclusion.
Scribbles to vectors: preparation of scribble drawings for CAD interpretation
Authors: A. Bartolo, K. P. Camilleri, S. G. Fabri, J. C. Borg, P. J. Farrugia
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

This paper describes the work carried out on off-line paper based scribbles such that they can be incorporated into a sketch-based interface without forcing designers to change their natural drawing habits. In this work, the scribbled drawings are converted into a vectorial format which can be recognized by a CAD system. This is achieved by using pattern analysis techniques, namely the Gabor filter to simplify the scribbled drawing. Vector line are then extracted from the resulting drawing by means of Kalman filtering.
Spectral clustering with inconsistent advice
Authors: Tom Coleman, James Saunderson, Anthony Wirth
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Clustering with advice (often known as constrained clustering) has been a recent focus of the data mining community. Success has been achieved incorporating advice into the k-means and spectral clustering frameworks. Although the theory community has explored inconsistent advice, it has not yet been incorporated into spectral clustering. Extending work of De Bie and Cristianini, we set out a framework for finding minimum normalised cuts, subject to inconsistent advice.
Assessing the displacement effects of the Internet
Authors: Paul S. N. Lee, Louis Leung
Venue: Telematics and Informatics (2008)

This study examines the ''medium-centric'' and ''user-centric'' approaches in investigating the displacement effects of the Internet. Results from a random sample survey support the ''medium-centric'' approach in displacement effect. The use of the Internet does displace traditional media use of television, newspapers, and radio. The Internet performs a substitutive rather than supplementary function. More important, the use of absolute time measures may lead one to draw the reverse conclusion, and the use of relative proportions of time based on people's total media time budget allows one to better examine the displacement effects of new media.
Adaptivity at every layer: a modular approach for evolving societies of learning autonomous systems
Authors: Willi Richert, Bernd Kleinjohann
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

We describe a developmental architecture that enables individual robots to fulfill tasks assigned to the robot society in a robust, decentralized manner. The architecture is meant to show emergent properties according to Organic Computing principles that are positive for the society's robustness and performance. This requires the architecture to feature those adaptation and learning processes that are not only selfishly useful for the individual robot, but also incorporate the robot society's actual needs at all layers.
Privacy/Analysis Tradeoffs in Sharing Anonymized Packet Traces: Single-Field Case
Authors: William Yurcik, Clay Woolam, Greg Hellings, Latifur Khan, Bhavani Thuraisingham
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Network data needs to be shared for distributed security analysis. Anonymization of network data for sharing sets up a fundamental tradeoff between privacy protection versus security analysis capability. This privacy/analysis tradeoff has been acknowledged by many researchers but this is the first paper to provide empirical measurements to characterize the privacy/analysis tradeoff for an enterprise dataset. Specifically we perform anonymization options on single-fields within network packet traces and then make measurements using intrusion detection system alarms as a proxy for security analysis capability. Our results show: (1) two fields have a zero sum tradeoff (more privacy lessens security analysis and vice versa) and (2) eight fields have a more complex tradeoff (that is not zero sum) in which both privacy and analysis can both be simultaneously accomplished.
V3Studio: A Component-Based Architecture Modeling Language
Authors: Diego Alonso, Cristina Vicente-Chicote, Olivier Barais
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

Component-Based Software Development (CBSD) has proven to obtain highly reusable, extensible and evolvable designs. This paper presents a Model-Driven Engineering approach to CBSD which revolves around the definition of the V3Studio component-based meta-model and a set of graphical modeling tools implemented to support it. V3Studio has been designed to model the structure and behavior of a wide variety of reactive systems by means of three complementary views, namely: one for describing the components of the architecture (structural view), and two for describing their behavior (coordination and algorithmic views). Dividing the V3Studio meta-model into these three loosely coupled views considerably simplifies the overall design process, allowing designers to reuse previously defined models. In order to show the feasibility and the benefits of the proposal, a simple but complete case study regarding the design of a vision guided robotic system will be presented.
Minimum node degree and κ-connectivity for key predistribution schemes and distributed sensor networks
Authors: Jiang Wu, Douglas R. Stinson
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

Connectivity is a desired property for distributed sensor networks (DSNs)secured by key predistribution schemes (KPSs). Previous research has studied whether a DSN is connected using the random graph model, but there has been no research on how strong the connectivity is. In this paper, we give results on the minimum node degree and κ-connectivity for DSNs secured by random KPSs and deterministic KPSs. As well, we use computer simulations to verify our results and validate the use of the random graph model in computing the connectivity of DSNs.
CODES: An Integrated Approach to Composable Modeling and Simulation
Authors: Yong Meng Teo, Claudia Szabo
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

In component-based simulation, models developed in different locations and for specific purposes can be selected and assembled in various combinations to meet diverse user requirements. This paper proposes CODES (COmposable Discrete-Event scalable Simulation), an approach to component-based modeling and simulation that supports model reuse across multiple application domains. A simulation component is viewed by the modeller as a black box with an in- and/or out-channel. The attributes and behavior of the component abstracted as a meta-component are described using COML (COmponent Markup Language), a markup language we propose for representing simulation components. The integrated approach, supported by a proposed COSMO (COmponent-oriented Simulation and Modeling Ontology) ontology, consists of four main steps. Component discovery returns a set of syntactically valid model components. Syntactic composability is determined by our proposed EBNF syntactic composition rules. Validation of semantic composability is performed using our proposed data and behavior alignment algorithms. The semantically valid simulation component is subsequently stored in a model repository for reuse. As proof of concept, we discuss a prototype implementation of the CODES frameworkusing queueing system as an application domain example.
Network Simplicity for Latency Insensitive Cores
Authors: Daniel Gebhardt, JunBok You, W. Scott Lee, Kenneth S. Stevens
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

In this paper we examine a latency insensitive network composed of very fast and simple circuits that connects SoC cores that are also latency insensitive, de-synchronized, or asynchronous. These types of cores provide native flow control that is compatible with this network, thus reducing adapter overhead and buffering needs by applying backpressure directly to the sending core. We show that under realistic traffic patterns our sample network meets performance requirements and uses less power compared to a similar design. This concept of a simplified network, along with latency insensitive cores lends itself well to meeting the needs of low-power interconnect components in future design processes.
Lymphocyte Tracking and Shape Changing Analysis
Authors: Chuanfeng Lv, Xing An, Juan Xiang, Zhiwen Liu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In recent years, with the rapid development of bio-medical techniques, incrementally scientists find that the study on human beings immune system is extremely important. It can facilitate the diagnosis and treatment of some deadly diseases like leukemia, cancer, AIDS and etc, as well as it is one of the critical factors to determine whether if the transplant operation is successful. The main function of immune system is to mark and eliminate the bacterium and fungus, lymphocyte is the most important immune cell. Therefore, potentially it is a direct and efficient method to estimate the patients immune system condition based on the lymphocyte shape changing analysis. In this paper, we address the problem of lymphocyte detection and tracking by the means of mathematic morphological and active contour techniques, pattern recognition method is utilized to analyze the detected lymphocyte image and ultimately achieve the aim of classification.
Generalized fuzzy hyperideals of hyperrings
Authors: Jianming Zhan, Bijan Davvaz, K. P. Shum
Venue: Computers Mathematics with Applications (2008)

The concept of quasi-coincidence of a fuzzy interval value with an interval valued fuzzy set is considered. In fact, this is a generalized concept of the quasi-coincidence of a fuzzy point with a fuzzy set. By using this new idea, the notion of interval valued (@a,@b)-fuzzy hyperideals in a hyperring is introduced and consequently, a generalization of a fuzzy hyperideal is defined. In this paper, we study the related properties of the fuzzy hyperideals and in particular, the interval valued (@?,@?@?q)-fuzzy hyperideals in a hyperring will be investigated. Moreover, we also consider the concept of implication-based interval valued fuzzy hyperideals in a hyperring. Some recent results obtained by B. Davvaz and J.M. Zhan on hyperstructures are extended and consolidated.
Safe Wireless Communication Solution for Driver Machine Interface for Train Control Systems
Authors: Jesper Grønbæk, Tatiana K. Madsen, Hans Peter Schwefel
Venue: Proceedings of the Third International Conference on Systems (2008)

This paper presents a design for safe wireless communication solution to be used for data transmission to and from a Driver Machine Interface that is a part of a train control system. Introduction of a wireless interface can significantly simplify the maintenance operations of a DMI since no physical detaching and cabling of the component is required. However, since wireless support is becoming a part of the DMI, it shall exhibits the same safety characteristics as DMI. It implies challenges in the design of the wireless communication protocol stack and requires a special purpose Safety Layer. The paper presents a proposed network architecture, together with the description of the protocols, where the special attention is on wireless security, session control and fault management.
An Application Layer Multicast for Collaborative Scenarios: The OMCAST Protocol
Authors: Gerard París, Marcel Arrufat, Pedro García López, Marc Sánchez-Artigas
Venue: Proceedings of the Seventh International Conference on Networking (2008)

New collaborative applications relying on a MANET need multicast to perform efficient group communication. Application Layer Multicast is seen as a good alternative to the traditional network layer routing protocols because of its flexibility and ease of deployment. However, existing application layer multicast protocols for MANETs are not designed for collaborative scenarios. In this paper, we present OMCAST, a new overlay multicast protocol for mobile ad hoc networks that is specifically targeted for collaborative scenarios. OMCAST benefits from the broadcast nature of the wireless medium in order to minimize network delay and congestion. Evaluation shows that OMCAST achieves better network performance than current message delivery approaches.
Live Forensic Analysis of a Compromised Linux System Using LECT (Linux Evidence Collection Tool)
Authors: Joonho Choi, Antonio Savoldi, Paolo Gubian, Seokhee Lee, Sangjin Lee
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

The Linux operating system has been used as a server system in plenty of business services worldwide. Nowadays, a lot of incident response approaches on such kind of platform have been established by many researchers active in the computer forensic discipline. Interestingly, many frameworks about how to deal with a live digital investigation on a Linux systems have been illustrated in the forensic literature. Conversely, as a matter of fact, there are not so many tools for approaching live forensic of a Linux system. Thus, we have developed and implemented a new framework to deal with a compromised Linux system in a digital forensic investigation. The resulting framework has been called LECT (Linux Evidence Collection Tool) ant aims to represent a significant contribution in the field of live forensic analysis of Linux based systems.
Long paths, long cycles, and their relative length
Authors: Akira Saito
Venue: Journal of Graph Theory (1999)

Let p(G) and c(G) be the order of a longest path and a longest cycle in a graph G, respectively. Let &sigma;3(G) = min{degG x + degG y + degG z : {:x, y, z} is an independent set of vertices of G}. Extending the result by Enomoto et al. (J Graph Th 20 (1995), 213225) on the difference p(G) - c(G), we prove that a 2-connected graph G of order n satisfies (1) p(G) - c(G) &le; 1 or p(G) &ge; &sigma;3(G) - 1, and (2) if &sigma;;3(G) &le; n, then p(G) - c(G) &le; n - &sigma;3(G) + 1 or p(G) &ge; &sigma;3(G). Then, using the above result, we give a new lower bound for p(G). This bound corresponds to the bound on c(G) given by Bauer et al. (Discrete Math 79 (1989-90), 5970). &copy; 1999 John Wiley Sons, Inc. J Graph Theory 30: 9199, 1999