ppxscal/embedding_network huggingface dataset:
Neural-network-based fault location estimator for transmission line protection
Authors: Héctor J. Altuve, Oscar L. Chacón, Ernesto Vázquez, Daniel Posadas, Edgar N. Sánchez
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

A classical task in the protection of transmission lines against short circuits is the estimation of the electrical distance to the fault and its comparison against a given threshold to determine whether the line is faulted or not. This paper presents a novel neural network approach to this problem, as a step towards the design of a neural protective relay. Two different alternatives are proposed and evaluated in the paper, which resemble the amplitude and phase signal comparison principles currently used in analog protective relays. Obtained results confirm that neural network technology can successfully be used to estimate the fault location for transmission line protection.
A service-oriented methodology supporting automatic synthesis and verification of component behavior model
Authors: Pengcheng Zhang, Yu Zhou, Bixin Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

It is very difficult to construct correct component behavior models for distributed, reactive system. The concept of service makes us revisit the method of how to construct component behavior models. On the contrary, current descriptions of service are mainly based on syntax. Because service lacks of a systematic semantic description, it is hard to develop service with high quality and reliability. In this paper we combine the ideas of service and component; propose a new methodology supporting automatic synthesis and verification of component behavior model. This method uses traditional scenario-based synthesis technique to synthesize each role behavior model of service, and verifies desired properties of role by model checking, then synthesizes component behavior model by composing all roles participated in different services, and verifies liveness properties of component by compositional reasoning thus avoids searching the whole state space of component.
Voronoi-based K nearest neighbor search for spatial network databases
Authors: Mohammad Kolahdouzan, Cyrus Shahabi
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between objects depend on their network connectivity and it is computationally expensive to compute the distances (e.g., shortest paths) between objects. In this paper, we propose a novel approach to efficiently and accurately evaluate KNN queries in spatial network databases using first order Voronoi diagram. This approach is based on partitioning a large network to small Voronoi regions, and then pre-computing distances both within and across the regions. By localizing the precomputation within the regions, we save on both storage and computation and by performing across-the-network computation for only the border points of the neighboring regions, we avoid global pre-computation between every node-pair. Our empirical experiments with several real-world data sets show that our proposed solution outperforms approaches that are based on on-line distance computation by up to one order of magnitude, and provides a factor of four improvement in the selectivity of the filter step as compared to the index-based approaches.
Theories of Program Testing and the Application of Revealing Subdomains
Authors: E. J. Weyuker
Venue: IEEE Transactions on Software Engineering (1980)

The theory of test data selection proposed by Goodenough and Gerhart is examined. In order to extend and refine this theory, the concepts of a revealing test criterion and a revealing subdomain are proposed. These notions are then used to provide a basis for constructing program tests.
Call admission and handoff control in multi-tier cellular networks: algorithms and analysis
Authors: Vijoy Pandey, Dipak Ghosal, Biswanath Mukherjee, Xiaoxin Wu
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, we investigate a call-admission and handoff-control framework for multi-tier cellular networks. We first propose and compare Call-Admission Control (CAC) algorithms based on the cell-dwelling time, by studying their impact on the handoff-call dropping and new-call blocking probabilities and the channel partitioning between the two tiers. Our results show that a simple, cell-dwelling-time-insensitive algorithm performs better under various mixes of user mobilities and call types. Moreover, there is an optimal channel partition of the overall spectrum between the tiers which minimizes the dropping and blocking probabilities for the two different CAC algorithms studied in this paper. Once the call is admitted into the network, we propose and compare various handoff- queuing strategies to reduce the call dropping probability. We show that implementing a queuing framework in one of the tiers (especially the upper, i.e., macrocellular, tier), results in a significant reduction in the dropping probability.
Strategic planning of preparedness budgets for wildland fire management
Authors: G. Parija, T. Kumar, H. Xi, D. Keller
Venue: IBM Journal of Research and Development (2007)

As part of the prototyping effort for the preparedness module (PM) of the Fire Program Analysis (FPA) system that IBM developed for five U.S. federal agencies, we designed and implemented an optimization model for determining budgets necessary for managing wildland fires during the initial response period. For a given budget, the model uses a mixed-integer linear optimization approach to maximize the number of acres managed ('i.e., land protected from fire damage as a result of the initial response). The model is solved iteratively to establish a function that maps best achievable effectiveness, in terms of acres managed, at different budget levels. To handle the computationally prohibitive size of the resulting model instances, we devised a heuristic-based solution approach, and we reformulated the client's original model by switching to a continuous time domain and introducing piecewise-linearized functions. As a result, we not only built a tractable model, but also succeeded in delivering a performance speedup of more than 150 fold. We also conducted validation experiments for certain assumptions in the model to assess their impact on the solution quality.
Flexible string matching against large databases in practice
Authors: Nick Koudas, Amit Marathe, Divesh Srivastava
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Data Cleaning is an important process that has been at the center of research interest in recent years. Poor data quality is the result of a variety of reasons, including data entry errors and multiple conventions for recording database fields, and has a significant impact on a variety of business issues. Hence, there is a pressing need for technologies that enable flexible (fuzzy) matching of string information in a database. Cosine similarity with tf-idf is a well-established metric for comparing text, and recent proposals have adapted this similarity measure for flexibly matching a query string with values in a single attribute of a relation. In deploying tf-idf based flexible string matching against real AT&T databases, we observed that this technique needed to be enhanced in many ways. First, along the functionality dimension, where there was a need to flexibly match along multiple string-valued attributes, and also take advantage of known semantic equivalences. Second, we identified various performance enhancements to speed up the matching process, potentially trading off a small degree of accuracy for substantial performance gains. In this paper, we report on our techniques and experience in dealing with flexible string matching against real AT&T databases.
A Novel EDA Tool for VLSI Test Vectors Management
Authors: Walid Ibrahim
Venue: Journal of Electronic Testing: Theory and Applications (2007)

In today's semiconductor industry, where time-to-profit is a critical factor to remain competitive, missing the tight market window might have serious implications including the risk of product cancellation. This places severe pressure on every aspect related to the design and the verification of semiconductor chips to get the design ready for manufacturing in the shortest time possible. To avoid the need for costly corrective steps and silicon re-spins during post-silicon verification, thorough pre-silicon verification is essential to catch any design fault and estimate the design overall reliability before the design is manufactured. This paper presents a novel EDA tool that helps the verification team improve the verification process in several ways. It can be used to generate useful statistics regarding the complexity and the coverage of the created test vectors. Experimental results prove that the verification team can successfully use the proposed tool to set their target coverage and intelligently select the set of test vectors that achieves that target using the minimum number of computing cycles.
Beating of the oscillations in the magnetocapacitance of a MODFET with Rasba spin-orbit interaction
Authors: G. S. Kliros, P. C. Divari
Venue: Microelectronics Journal (2007)

The effect of Rasba spin-orbit interaction (SOI) on the magnetocapacitance of the 2DEG in a MODFET is investigated. We present calculations on the density of states (DOS) of the 2DEG in a MODFET under the influence of both Rasba SOI and weak two-dimensional periodic modulation. Adopting a Gaussian broadening of magnetic-field-dependent width, we present a simple expression for the DOS, valid for the relevant weak magnetic fields and modulation strengths. In the presence of Rasba SOI and for weak potential modulation strengths, a typical beating pattern of the magnetocapacitance oscillations is observed in the low magnetic filed range. A simple relation that predicts the positions of nodes in the beating patterns is obtained. The interplay between the SOI and the periodic potential modulation is discussed.
Robust Invariant Descriptor for Symbol-Based Image Recognition and Retrieval
Authors: Alexander Wong, William Bishop
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper presents a robust invariant descriptor for symbol-based image recognition and retrieval. A modified Hough-based Transform is used to extract parameter space information (i.e., position data and angular data) from a symbol image to derive an invariant descriptor. The proposed descriptor provides a compact representation of a symbol image that can be evaluated efficiently. The extracted descriptor is highly robust against geometric transformations such as translation, rotation, reflection, and scaling, and image degradation. A series of experiments were conducted using a set of architectural and engineering symbols subjected to geometric transformations and image degradation. The experimental results clearly show that the proposed descriptor can be used effectively for symbol recognition and retrieval.
Filtering, Robust Filtering, Polishing: Techniques for Addressing Quality in Software Data
Authors: Gernot Liebchen, Bheki Twala, Martin Shepperd, Michelle Cartwright, Mark Stephens
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

OBJECTIVE: Data quality is an important aspect of empirical analysis. This paper compares three noise handling methods to assess the benefit of identifying and either filtering or editing problematic instances. METHOD: We compare a "do nothing' strategy with (i) filtering, (ii) robust filtering and (iii) filtering followed by polishing. A problem is that it is not possible to determine whether an instance contains noise unless it has implausible values. Since we cannot determine the true overall noise level we use implausible values as a proxy measure. In addition to the ability to identify implausible values, we use another proxy measure, the ability to fit a classification tree to the data. The interpretation is low misclassification rates imply low noise levels. RESULTS: We found that all three of our data quality techniques improve upon the "do nothing' strategy, also that the filtering and polishing was the most effective technique for dealing with noise since we eliminated the fewest data and had the lowest misclassification rates. Unfortunately the polishing process introduces new implausible values. CONCLUSIONS: We believe consideration of data quality is an important aspect of empirical software engineering. We have shown that for one large and complex real world data set automated techniques can help isolate noisy instances and potentially polish the values to produce better quality data for the analyst. However this work is at a preliminary stage and it assumes that the proxy measures of quality are appropriate.
Micro-Architectural Cryptanalysis
Authors: Onur Aciicmez, Jean-Pierre Seifert, Cetin Kaya Koc
Venue: IEEE Security and Privacy (2007)

This installment of Crypto Corner looks at some specific new side channels that are enabled by the very sophisticated ingredients of modern microprocessor architectures.
Biomimetic Centering for Undulatory Robots
Authors: Michael Sfakiotakis, Dimitris P. Tsakiris
Venue: International Journal of Robotics Research (2007)

Substantial work exists in the robotics literature on the mechanical design, modeling, gait generation and implementation of undulatory robotic prototypes. However, there appears to have been relatively limited work on closing the control loop for such robotic locomotors using sensory information from on-board exteroceptive sensors, in order to realize more complex undulatory behaviors. In this paper we consider a biologically inspired sensor-based &#x201C;centering&#x201D; behavior for undulatory robots traversing corridor-like environments. Such behaviors have been observed and studied in bees, and robotic analogs were originally developed for non-holonomic mobile robots. Adaptation to the significantly more complex dynamics of undulatory locomotors highlights a number of issues related to the use of sensors (possibly distributed over the elongated body of the mechanism) for the generation of reactive undulatory behaviors and also related to biomimetic neuromuscular control and to the formation control of multi-undulatory swarms. These issues are explored in simulation by means of computational tools specifically geared towards undulatory locomotion in robotics and biology. Moreover, a series of undulatory robotic prototypes has been developed, which are able to propel themselves on a variety of hard and granular substrates, by means of both head-to-tail (&#x201C;eel-like&#x201D;) and tail-to-head (&#x201C;polychaete-like&#x201D;) undulatory waves. The undulatory centering behavior is demonstrated experimentally in several layouts of corridor-like environments using these robotic prototypes equipped with infrared distance sensors.
Development of a collaborative platform for art education: from pedagogy to technology
Authors: Colin B. Price
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

We report on the development of a Java-based application devised to support collaborative learning of Art concepts and ideas over the Internet. Starting from an examination of the pedagogy of both Art education and collaborative learning we propose principles which are useful for the design and construction of a "lightweight" software application which supports interactive Art learning in groups. This application makes "dynamics" of an artwork explicit, and supports group interaction with simple messaging and "chat" facilities. This application may be used to facilitate learning and teaching of Art, but also as a research tool to investigate the learning of Art and also the development and dynamics of collaborating groups. Evaluation of a pilot study of the use of our system with a group of 20 school children is presented.
Micros, A Distributed Operating System for Micronet, A Reconfigurable Network Computer
Authors: L. D. Wittle
Venue: IEEE Transactions on Computers (1980)

MICROS is the distributed operating system for the MICRONET network computer. MICRONET is a reconfigurable and extensible network of 16 loosely coupled LSI-11 microcomputer nodes, connected by packet-switching interfaces to pairs of high-speed shared communication buses. MICROS simultaneously supports many users, each running multicomputer parallel programs. MICROS is intended for control of network computers of thousands of nodes.
An Angle-Based Crossover Tabu Search for the Traveling Salesman Problem
Authors: Ning Yang, Ping Li, Baisha Mei
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

An improved tabu search -- crossover tabu search (CTS), with the angle-based idea of the sweep heuristic to confirm neighborhood, is presented, which is applied for solving a well-known combinatorial optimization problem-the traveling salesman problem (TSP). The key strategies of the CTS are intensification strategy and diversification strategy. Intensification strategies, based on modifying choice rules to encourage move combinations, are used to enhance the efficiency of local search. Diversifications strategies are designed to drive the search into new regions, i.e., exploit the new search spaces. The CTS implement the crossover operator of the genetic algorithm (GA) as the diversification strategy, and the strategy of selecting elite solutions as the intensification strategy. CTS, standard TS, standard TS with intensification strategy and CTS with the angel-based idea of sweep heuristic are used to solve the same TSP problems which come from the library of TSP instances TSPLIB and other three TSP instances of Fogel's path. The results showed the angle-based CTS has better performances than other algorithms.
A Binary Decision Diagram to discover low threshold support frequent itemsets
Authors: Wassim Ayadi, Khedija Arour
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent itemsets is computationally the most expensive step in association rule discovery and therefore it has grasped significant research focus [1]. Discovery of frequently occurring subsets of items, called itemsets, is the core of many data mining methods. Most of the previous studies adopt Apriorilike algorithms, whom iteratively generate candidate itemsets and check their occurrence frequencies in the database. These approaches suffer from serious costs of repeated passes over the analyzed database. In this paper, we propose a new BDD-based (Binary Decision Diagram) data structure called TREESUPBDD. The TREESUPBDD extends the idea claimed by the authors of FP-TREE [9] and ITL-Tree [5] structures, aiming to improve storage compression and to allow frequent pattern mining without an explicit candidate itemset generation step. To address this problem, we propose a novel method, called TREESUPBDDMINE, for reducing database activity of frequent itemset discovery algorithms. The idea of TREESUPBDD-MINE consists in using a Binary Decision Diagram and a tree for representing both database and frequent itemsets. The proposed method requires one scan over the source database : to create the associated tree and BDD and check discovered itemset supports. The originality of our work stands on the fact that the proposed algorithm extracts the frequent itemsets directly from the TREESUPBDD. Carried out experiments showed very encouraged results. Its performance improvements have been shown in a series of our experiments. We extend the binary decision diagram structure to store transaction groups and propose a new method to discover frequents itemsets. To study the trade-offs in the new representation of transactions in binary decision diagram, we compare the performance of our algorithm with the fastest Apriori [2] implementation algorithm and the latest extension of FP-Growth [15]. We have tested all the algorithms using different benchmark datasets. The performance study shows that the new algorithm significantly reduces the processing time for mining frequent itemsets from dense datasets that contain relatively long patterns and for low threshold. We discuss the performance results in detail and also the strengths and limitations of our algorithm.
Computer-Integrated Manufacturing of Surfaces Using Octree Encoding
Authors: K. Yamaguchi, T. Kunii, David Rogers, Steven Satterfield, Francisco Rodriguez
Venue: IEEE Computer Graphics and Applications (1984)

This preliminary report presents an algorithm for automatically generating from an octree description the data that a computerized numerical control milling machine requires to manufacture a part.
Robust Stability of Uncertain Cellular Neural Networks with Time-Varying Delays
Authors: Lianqing Su, Zhifeng Gao, Jiqing Qiu, Peng Shi
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, we investigate the problem of global robust asymptotical stability of cellular neural networks with time-varying delays and parameter uncertainties. The parameter uncertainties are assumed to be bounded, the activation functions are supposed to be bounded and globally Lipschitz continuous. Based on the Lyapunov-Krasovskii functional approach, a new delay-dependent stability criteria is presented in terms of linear matrix inequalities (LMIs). The stability criteria can be easily checked by using recently developed algorithms in solving LMIs. Finally, a numerical example is given to illustrate the effectiveness and less conservativeness of our proposed method.
A Hybrid Multiple-Access Protocol for Data and Voice-Packet Over Local Area Networks
Authors: M. Rios
Venue: IEEE Transactions on Computers (1985)

This correspondence presents HYMAP, a hybrid multiple access protocol for local area networks. The protocol combines features of both CSMA/CD and a collision-free protocol. Control is transferred from one protocol to the other according to state information sensed on the channel. The performance of HYMAP is evaluated by computer simulation for both data and voice packets. It compares favorably to other well-known multiple-access protocols. The number of packet-voice terminals that can be supported by HYMAP is higher than that obtained by using other protocols. Statistical analysis of the simulation results is also given.