ppxscal/embedding_network huggingface dataset:
Subsampling techniques and the Jackknife methodology in the estimation of the extremal index
Authors: M. Ivette Gomes, Andreia Hall, M. Cristina Miranda
Venue: Computational Statistics Data Analysis (2008)

For a sequence of independent, identically distributed random variables any limiting point process for the time normalized exceedances of high levels is a Poisson process. However, for stationary dependent sequences, under general local and asymptotic dependence restrictions, any limiting point process for the time normalized exceedances of high levels is a compound Poisson process, i.e., there is a clustering of high exceedances, where the underlying Poisson points represent cluster positions, and the multiplicities correspond to the cluster sizes. For such classes of stationary sequences there exists the extremal index@q, 0=0 for ''almost all'' cases of interest. The estimation of the extremal index through the use of the Generalized Jackknife methodology, possibly together with the use of subsampling techniques, is performed. Case studies in the fields of environment and finance will illustrate the performance of the new extremal index estimator comparatively to the classical one.
Understanding changes in mental workload during execution of goal-directed tasks and its application for interruption management
Authors: Brian P. Bailey, Shamsi T. Iqbal
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

Notifications can have reduced interruption cost if delivered at moments of lower mental workload during task execution. Cognitive theorists have speculated that these moments occur at subtask boundaries. In this article, we empirically test this speculation by examining how workload changes during execution of goal-directed tasks, focusing on regions between adjacent chunks within the tasks, that is, the subtask boundaries. In a controlled experiment, users performed several interactive tasks while their pupil dilation, a reliable measure of workload, was continuously measured using an eye tracking system. The workload data was extracted from the pupil data, precisely aligned to the corresponding task models, and analyzed. Our principal findings include (i) workload changes throughout the execution of goal-directed tasks; (ii) workload exhibits transient decreases at subtask boundaries relative to the preceding subtasks; (iii) the amount of decrease tends to be greater at boundaries corresponding to the completion of larger chunks of the task; and (iv) different types of subtasks induce different amounts of workload. We situate these findings within resource theories of attention and discuss important implications for interruption management systems.
Dynamic Group Signature with Forward Security and Its Application
Authors: Xuanwu Zhou, Xiaoyuan Yang, Ping Wei, Yupu Hu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Analyses were made on the security threats and weakness of present group signature schemes, and a dynamic group signature with forward security based on elliptic curves cryptosystem was presented. The identity blinding process and probabilistic encryption algorithm of the scheme enable the signature group to be dynamic without changing the group public key and private keys of all the group members. The scheme avoids the direct relationship between signature complexity and group scale, prevents coalition attack and generalized signature forgery. If a signature is successfully attacked or the anonymity tracing protocol is executed, other group signatures generated by the same member earlier and signatures generated by other members are still secure and anonymous, so the group signature scheme proves to be forward secure. Further detailed analyses also justify its brevity, security, high efficiency, and thus considerable improvement on system overheads regarding software and hardware application.
Tracking and Motion Analysis of Impact Fragments
Authors: Naoto Miura, Hirohide Demura, Naru Hirata, Noriaki Asada
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Automation for the motion analysis of fragments has been requested in a field of collision and destruction experiments. While extracting and tracking of targeted fragments have been analyzed manually in a sequence of images and movie, we substituted arrangements of 2DCDP (two dimensional continuous dynamic programming) for that manual works. Four large fragments in test data were succeeded in handling and measuring velocities and sizes of them. We also introduced a new method to prepare better reference images for every frames by a combination of 2DCDP and affine transformation. These labor- saving procedures are effective in analysis of objects in movies.
An Engineering Approach to Software Test Data Design
Authors: S. T. Redwine
Venue: IEEE Transactions on Software Engineering (1983)

A systematic approach to test data design is presented based on both practical translation of theory and organization of professional lore. The approach is organized around five domains and achieving coverage (exercise) of them by the test data. The domains are processing functions, input, output, interaction among functions, and the code itself. Checklists are used to generate data for processing functions. Separate checklists have been constructed for eight common business data processing functions such as editing, updating, sorting, and reporting. Checklists or specific concrete directions also exist for input, output, interaction, and code coverage. Two global heuristics concerning all test data are also used. A limited discussion on documenting test input data, expected results, and actual results is included.
Visually Interpreting the Motion of Objects in Space
Authors: J. A. Webb
Venue: Computer (1981)

The human visual system's ability to extract three-dimensional structure from a two-dimensional source is the key to automatic interpretation of structure from motion.
Design of fuzzy gain-scheduled robust controllers using Kharitonov's extremal gain margin theorem
Authors: S. G. Tzafestas, G. G. Rigatos, G. A. Vagelatos
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

In this paper a novel fuzzy gain-scheduler is applied to linear plants the transfer functions of which consist of interval polynomials. The gain-scheduler performs an incremental tuning of the controller parameters employing a sliding-mode fuzzy control algorithm. The allowed ranges of variation of the controller gains are determined by using Kharitonov's Extremal Gain Margin Theorem. Sufficient conditions for the asymptotic stability of the closed-loop system are given. The validity of the method is verified via simulation tests.
A Novel Method for Moving Object Detection in Foggy Day
Authors: Gong Chen, Heqin Zhou, Jiefeng Yan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Intelligent visual surveillance system can work normally under clear weather. But under bad weather, especially in foggy days, it can not detect moving objects accurately due to low scene visibility. Our research aims to resolve this problem. This paper presents a novel method for moving object detection in foggy days. Firstly, surveillance video under foggy weather is defogged, leveraging a physics-based image restoration approach. Secondly, we exploit a novel background maintenance algorithm based on the Unscented Kalman Filter(UKF) to subtract the background from the defogged video. Finally, moving objects are segmented by background differencing. Evaluations are performed to verify the effectiveness and practicality of this approach. Experimental results show that our method can be applied in real time surveillance systems.
A Note on Rotation Matrices
Authors: Jay Fillmore
Venue: IEEE Computer Graphics and Applications (1984)

Properly establishing the relation between linear algebra and geometry makes it easier to obtain the three-by-three orthogonal matrix that describes a specified rotation. 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
On Routing in Distributed Hash Tables
Authors: Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le Boudec, Karl Aberer
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allow order-preserving hash functions that lead to a skewed peer distribution in the identifier space. Good solutions for group A have been known for many years. However, DHTs in group A are limited to use randomized hashing and therefore, queries over whole identifier ranges thus do not scale. Group B can handle such queries easily. However, it is more difficult to connect the peers such that the resulting topology provides efficient routing, small routing tables, and balanced routing load. We present an elegant new solution to construct an efficient DHT for group B. Our main idea is to decouple the identifier space from the routing topology. In consequence, our DHT allows arbitrarily skewed peer distributions in the identifier space and does not require the overhead of sampling. Furthermore, the table construction is cheap and does not require active replacement of lost routing entries. To evaluate the performance of routing cost and table construction under high churn, we built an efficient simulator. Using the right data structures, we can easily process the state of over one million peers in RAM.
Sentence Similarity based on Dynamic Time Warping
Authors: Xiaoying Liu, Yiming Zhou, Ruoshi Zheng
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper investigates the problem of the similarity measure between very short text of sentence length, which can be used in a variety of applications that involve text knowledge representation and discovery. A novel method to calculate sentence similarity is proposed, which takes into account the semantic information, word order and the contribution of different parts of speech in a sentence. The experiment result on the set of selected sentence pairs shows that our method greatly outperforms other previously reported methods.
Improving Mobile Core Network Security with Honeynets
Authors: Christos K. Dimitriadis
Venue: IEEE Security and Privacy (2007)

Despite improved security, core network vulnerabilities continue to threaten third-generation (3G) mobile systems. This article offers a security assessment conducted in the packet-switched domain of a mobile operator's infrastructure. A honeynet architecture could help address 3G security.
Building a CISCO-feel linux router to enable students learn and configure dynamic routing protocols
Authors: Dongqing Yuan, Jiling Zhong
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Routing is an important concept in networking. Many commercial routers are available, but they can be expensive, not affordable to many schools. The alternative is to turn a Linux machine into a fully functional router. The Zebra suite of routing daemons makes this possible. In this paper, we give detailed instructions on how to design the network topology, set up the network, install and run the Linux router, and how to configure dynamic routing protocols such as RIPv1. By following the steps described in the paper, students will be able to gain real world experience with configuring dynamic routing protocols, and watch how routers exchange routing updates and build routing tables dynamically.
Specification-based Testing Method Using Testing Flow Graphs
Authors: Ryan Voigt, Kareem Fazal, Hassan Reza
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

As the most formalizable UML diagram, statecharts make a natural basis for specification based test generation. In this paper we discuss a specification-based testing method that extends specification-based testing method known as Testing Flow Graphs (TFG). Our extended TFG method allows test sequences to be generated that also meet full predicate coverage. To show the effectiveness and efficiency of our approach relative to the original work, we carried out an empirical evaluation using mutation analysis.
A Method of Using Cluster Analysis to Study Statistical Dependence in Multivariate Data
Authors: W. J. Borucki
Venue: IEEE Transactions on Computers (1975)

A technique is presented that uses both cluster analysis and a Monte Carlo significance test of clusters to discover associations between variables in multidimensional data. The method is applied to an example of a noisy function in three-dimensional space, to a sample from a mixture of three bivariate normal distributions, and to the well-known Fisher's Iris data.
Building a Lexical Sports Ontology for Chinese IE Using Reusable Strategy
Authors: Tianfang Yao, Hans Uszkoreit
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper, we propose a strategy to construct a lexical ontology used for Chinese named entities (NEs) and NE relations (NERs) identification. The lexical information from HowNet (reusable information) and semantic constraints (added information) are semi- automatically integrated into our lexical ontology. In the ontology, addition to the relationships of the concepts in the taxonomy, the non-taxonomic relationships between the concepts have been also built through semantic constraints. The testing results for Chinese named entity and relation identification system have shown that the total average F-measure for six types of NEs and fourteen types of NERs is 83.08% and 70.46% respectively. Therefore, this lexical ontology used for Chinese NE and NER identification is reasonable and effective.
Transparent Rate Mode Bilateral Teleoperation Control
Authors: Farid Mobasser, Keyvan Hashtrudi-Zaad
Venue: International Journal of Robotics Research (2008)

Transparent teleoperation under rate mode has proven to be difficult in terms of stability, performance and implementation. This is mainly due to the need for an exchange of derivative and integral of measured positions and forces which make transparent rate mode controllers prone to noise and abrupt contact force changes. Moreover, the performance of controllers declines in the presence of communication delays. This paper proposes two control architectures based on the use of local force feedback (LFF) and environment impedance reflection (EIR). The LFF controllers eliminate a force channel while preserving transparency under ideal conditions. In the EIR controller, the identified impedance of the environment is employed in the master controller to predict the slave position and contact force derivatives. The stability robustness and performance of these controllers are evaluated and compared to those of a benchmark controller under different operational conditions, such as noise and delay, using analytical methods and experimental results.
Early Experiences in Managing Inter-Site Storage Area Networks Using Secure Web Services
Authors: Ben Kobler, Fritz McCall, Mike Van Opstal, Hoot Thompson, Kirk Hunter
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

The NASA Goddard Space Flight Center and the University of Maryland Institute for Advanced Computer Studies have deployed a pilot system for managing distributed IP-Based Storage Area Networks of dynamically allocated SAN extensions in the Advanced Virtual Engine Test Cell (AVETEC) Data Intensive Computing Environment (DICE). The system implements the framework for managing intersite storage area networks using Grid and Web Services technologies presented at MSST06. It includes several new components including a basic registry and a java-based command line interface. The test-bed provides some early experiences with the reliability, usability, and security of the system, as well as some performance testing of the web services.
Quantile Linear Algorithm for Robust Binarization of Digitalized Letters
Authors: M. Ramirez, E. Tapia, M. Block, R. Rojas
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

We describe a threshold-based local algorithm for im- age binarization. The main idea is to compute a transition energy using pixel value differences taken from a neighbor- hood around the pixel of interest. By filtering the pixels with low positive and negative energy, we keep two subsets in the neighborhood, corresponding to higher positive and nega- tive energy values. The binarization threshold is calculated using a statistical model of the high energy pixels. Experi- ments show that this new approach is faster and better than current state-of-the-art algorithms.
Availability-aware provisioning strategies for differentiated protection services in wavelength-convertible WDM mesh networks
Authors: Jing Zhang, Keyao Zhu, Hui Zang, Norman S. Matloff, Biswanath Mukherjee
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

In an optical WDM mesh network, different protection schemes (such as dedicated or shared protection) can be used to improve the service availability against network failures. However, in order to satisfy a connection's service-availability requirement in a cost-effective and resource-efficient manner, we need a systematic mechanism to select a proper protection scheme for each connection request while provisioning the connection. In this paper, we propose to use connection availability as a metric to provide differentiated protection services in a wavelength-convertible WDM mesh network. We develop a mathematical model to analyze the availabilities of connections with different protection modes (i.e., unprotected, dedicated protected, or shared protected). In the shared-protection case, we investigate how a connection's availability is affected by backup resource sharing. The sharing might cause backup resource contention between several connections when multiple simultaneous (or overlapping) failures occur in the network. Using a continuous-time Markov model, we derive the conditional probability for a connection to acquire backup resources in the presence of backup resource contention. Through this model, we show how the availability of a shared-protected connection can be quantitatively computed. Based on the analytical model, we develop provisioning strategies for a given set of connection demands in which an appropriate, possibly different, level of protection is provided to each connection according to its predefined availability requirement, e.g., 0.999, 0.997. We propose integer linear programming (ILP) and heuristic approaches to provision the connections cost effectively while satisfying the connections' availability requirements. The effectiveness of our provisioning approaches is demonstrated through numerical examples. The proposed provisioning strategies inherently facilitate the service differentiation in optical WDM mesh networks.
Test Controller Synthesis Constrained by Circuit Testability Analysis
Authors: Richard Ruzicka, Josef Strnadel
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In the paper, a method for test controller synthesis based on testability analysis results is presented. The proposed method enables to create a Finite State Machine with output, which can control all enable, address and clock inputs of elements in the circuit during the test application process. Proposed testability analysis method is efficient for RT level pipelined data-path circuit. Close coupling of testability analysis and test controller synthesis saves the test cost in terms of area overhead, test time and fault coverage. All processes are described formally.
Electronic Replacements for Head-per-Track Drums or Disks
Authors: A. V. Pohm
Venue: Computer (1976)

Recently, three types of memories have been proposed as possible main memory extensions and replacements for head per track disks or drums; these are CCD, bubble, and BEAMOS memories.1,2,3The extent to which these memories come into widespread use will depend on such factors as cost, performance, reliability, maintainability and profitability. In this paper, potential areas of application for these memories are examined and some of the conditions which must be met for the memories to be economically attractive are determined for systems employing both a single job stream and multiprogrammed job streams.
Life-Cycle Cost Analysis of Instruction-Set Architecture Standardization for Military Computer Systems
Authors: H. S. Stone
Venue: Computer (1979)

Standardizing on a single efficient computer architecture can save the military billions of dollars over the next couple decades. The challenge is finding that single best candidate. An econometric model shows how.
Intelligent system monitoring on large clusters
Authors: Jimeng Sun, Evan Hoke, John D. Strunk, Gregory R. Ganger, Christos Faloutsos
Venue: Proceedings of the 3rd workshop on Data management for sensor networks: in conjunction with VLDB 2006 (2006)

Modern data centers have a large number of components that must be monitored, including servers, switches/routers, and environmental control systems. This paper describes InteMon, a prototype monitoring and mining system for data centers. It uses the SNMP protocol to monitor a new data center at Carnegie Mellon. It stores the monitoring data in a MySQL database, allowing visualization of the time-series data using a JSP web-based frontend interface for system administrators. What sets InteMon apart from other cluster monitoring systems is its ability to automatically analyze correlations in the monitoring data in real time and alert administrators of potential anomalies. It uses efficient, state of the art stream mining methods to report broken correlations among input streams. It also uses these methods to intelligently compress historical data and avoid the need for administrators to configure threshold-based monitoring bands.
A Generic Mean Field Convergence Result for Systems of Interacting Objects
Authors: Jean-Yves Le Boudec, David McDonald, Jochen Mundinger
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

We consider a model for interacting objects, where the evolution of each object is given by a finite state Markov chain, whose transition matrix depends on the present and the past of the distribution of states of all objects. This is a general model of wide applicability; we mention as examples: TCP connections, HTTP flows, robot swarms, reputation systems. We show that when the number of objects is large, the occupancy measure of the system converges to a deterministic dynamical system (the "mean field") with dimension the number of states of an individual object. We also prove a fast simulation result, which allows to simulate the evolution of a few particular objects imbedded in a large system. We illustrate how this can be used to model the determination of reputation in large populations, with various liar strategies.