ppxscal/embedding_network huggingface dataset:
Design of a Power System Stabilizer Using a new Recurrent Neural Network
Authors: Chun-Jung Chen, Tien-Chi Chen
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

This paper presents a new two-layer recurrent neural network (RNN) for the power system stabilizer (PSS) design, which is called the recurrent neural network power system stabilizer (RNNPSS) in order to damp the oscillations of the power system. The RNNPSS consists of a recurrent neural network identifier (RNNI) and a recurrent neural network controller (RNNC). The RNN consists of an input layer and an output layer. Each neuron in the input layer is a recurrent one which is connected to oneself and other neurons, and then connected to the output layer. The simulation results demonstrate that the effectiveness of the proposed RNNPSS and reduce its sensitivity to system disturbances.
Differential Tracking based on Spatial-Appearance Model (SAM)
Authors: Ting Yu, Ying Wu
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

A fundamental issue in differential motion analysis is the compromise between the flexibility of the matching criterion for image regions and the ability of recovering the motion. Localized matching criteria, e.g., pixel-based SSD, may enable the recovery of all motion parameters, but it does not tolerate much appearance changes. On the other hand, global criteria, e.g., matching histograms, can accommodate dramatic appearance changes, but may be blind to some motion parameters, e.g., scaling and rotation. This paper presents a novel differential approach that integrates the advantages of both in a principled way based on a spatial-appearance model (SAM) that combines local appearances variations and global spatial structures. This model can capture a large variety of appearance variations that are attributed to the local non-rigidity. At the same time, this model enables efficient recovery of all motion parameters. A maximum likelihood matching criterion is defined and rigorous analytical results are obtained that lead to a closed form solution to motion tracking. Very encouraging results demonstrate the effectiveness and efficiency of the proposed method for tracking non-rigid objects that exhibit dramatic appearance deformations, large object scale changes and partial occlusions.
Cache implications of aggressively pipelined high performance microprocessors
Authors: T. J. Dysart, B. J. Moore, L. Schaelicke, P. M. Kogge
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

One of the major design decisions when developing a new microprocessor is determining the target pipeline depth and clock rate since both factors interact closely with one another. The optimal pipeline depth of a processor has been studied before, but the impact of the memory system on pipeline performance has received less attention. This study analyzes the affect of different level-1 cache designs across a range of pipeline depths to determine what role the memory system design plays in choosing a clock rate and pipeline depth for a microprocessor. The pipeline depths studied here range from those found in current processors to those predicted for future processors. For each pipeline depth a variety of level-1 cache sizes are simulated to explore the relationship between clock rate, pipeline depth, cache size and access latency. Results show that the larger caches afforded by shorter pipelines with slower clocks outperform longer pipelines with smaller caches and higher clock rates.
Security Considerations for SOA-Based Multimedia Applications
Authors: Andrew Roczniak, Alexandre Miege, Abdulmotaleb El Saddik
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Growing levels of digitalization and broadband access drives extremely fast progress in multimedia and networking technologies and allows consumers to create requirements at an accelerating rate. Producers' response is to emphasize the speed of delivery and upgradability of applications. Development of Web Services and Service-Oriented Architecture puts the emphasis on creation of specific services which then can be aggregated to achieve a particular goal. By substituting or adding new services, a particular application can be adapted faster to changing requirements. Any application thus composed must address security concerns, including security guarantees after a service substitution. Based on our framework for creating multimedia collaborative authoring applications from a set of standard services, we provide a security analysis of the resulting application and present a novel framework for ensuring uniform access control guarantees across different constituent services.
A backjumping technique for disjunctive logic programming
Authors: Francesco Ricca, Wolfgang Faber, Nicola Leone
Venue: AI Communications (2006)

In this work we present a backjumping technique for Disjunctive Logic Programming under the Stable Model Semantics (SDLP). It builds upon related techniques that had originally been introduced for constraint solving, which have been adapted to propositional satisfiability testing, and recently also to non-disjunctive logic programming under the stable model semantics (SLP) [1,2].We focus on backjumping without clause learning, providing a new theoretical framework for backjumping in SDLP, elaborating on and exploiting peculiarities of the disjunctive setting. We present a reason calculus and associated computations, which - compared to the traditional approaches - reduces the information to be stored, while fully preserving the correctness and the efficiency of the backjumping technique, handling specific aspects of disjunction in a benign way. We implemented the proposed technique in DLV, the state-of-the-art SDLP system.We have conducted several experiments on hard random and structured instances in order to assess the impact of backjumping. To this end, we have compared DLV in various versions: With and without the backjumping method described in this paper, in combination with two different heuristic functions. Our conclusion is that under any of the heuristic functions, DLV with backjumping is favourable to DLV without backjumping. DLV with backjumping performs particularly well on structured satisfiability and quantified boolean formula instances, where the search space and execution time are effectively cut.
Encoding uncertainty in the hippocampus
Authors: L. M. Harrison, A. Duggins, K. J. Friston
Venue: Neural Networks (2006)

The medial temporal lobe may play a critical role in binding successive events into memory while encoding contextual information in implicit and explicit memory tasks. Information theory provides a quantitative basis to model contextual information engendered by conditional dependence between, or conditional uncertainty about, consecutive events in a sequence. We show that information theoretic indices characterizing contextual dependence within a sequential reaction time task (SRTT) predict regional responses, measured by fMRI, in areas associated with sequence learning and navigation. Specifically, activity of a distributed paralimbic system, centered on the left hippocampus, correlated selectively with predictability as measured with mutual information. This is clear evidence that the brain is sensitive to the probabilistic context in which events are encountered. This is potentially important for theories about how the brain represents uncertainty and makes perceptual inferences, particularly those based on predictive coding and hierarchical Bayes.
Agreement-aware Semantic Management of Services
Authors: Qian Zhao, Yu Zhou, Mark Perry
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

Automation of versatile process management will aid greater efficiency and lower costs. It is widely expected that highly structured agreements should be executed and enforced automatically. In the progress of building an executable license agreement framework, we have noticed that diverse agreement processing and automation have commonalities leading us to propose a generic architecture that can provide various automated agreement services that leverage ontology, rule and agent technologies.
Synthesis of optimal feedback for nonlinear control systems
Authors: N. V. Balashevich
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

A method of online construction of an optimal feedback control of nonlinear systems with bang-bang optimal control is proposed. The realization of the algorithm of constructing a closed-loop solution is oriented on fast corrections of optimal open-loop control subject to small variations of initial state. To construct a solution to a nonlinear control problem, two procedures are elaborated. At first, piecewise linear approximations for initial nonlinearities of the system are introduced and an optimal control for the approximative problem is computed. Then the defining elements of this control are corrected with the use of asymptotic expansions.
Efficient Detection of Periodic Orbits in Chaotic Systems by Stabilizing Transformations
Authors: Jonathan J. Crofts, Ruslan L. Davidchack
Venue: SIAM Journal on Scientific Computing (2006)

An algorithm for detecting periodic orbits in chaotic systems [R. L. Davidchack and Y.-C. Lai, Phys. Rev. E (3), 60 (1999), pp. 6172-6175], which combines the set of stabilizing transformations proposed by Schmelcher and Diakonos [Phys. Rev. Lett., 78 (1997), pp. 4733-4736] with a modified semi-implicit Euler iterative scheme and seeding with periodic orbits of neighboring periods, has been shown to be highly efficient when applied to low-dimensional systems. The difficulty in applying the algorithm to higher-dimensional systems is mainly due to the fact that the number of the stabilizing transformations grows extremely fast with increasing system dimension. Here we analyze the properties of stabilizing transformations and propose an alternative approach for constructing a smaller set of transformations. The performance of the new approach is illustrated on the four-dimensional kicked double rotor map and the six-dimensional system of three coupled Hénon maps.
A Labeled Graph Approach to Analyze Organizational Performance
Authors: Mark Hoogendoorn, Jan Treur, Pinar Yolum
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Determining the performance of an organization is a must for both human and multi-agent organizations. The performance analysis enables organizations to uncover unexpected properties of organizations and allow them to reconsider their internal workings. To perform such an analysis, this paper represents organizations as labeled graphs that capture, not only the interactions of the entities, but also the characteristics of those interactions, such as their content, frequency, and so on through labels in the graph. Algebraic representation and manipulations of the labels enable analysis of a given organization. Hence, well-known phenomena, such as overloading of participants or asymmetric distribution of workload among participants can easily be detected. Finally, a case study is performed within the domain of incident management.
An empirical evaluation of chains of recurrences for array dependence testing
Authors: J. Birch, R.A. van Engelen, K.A. Gallivan, Y. Shou
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instances in the iteration space of a loop nest impose ordering constraints that must be preserved in order to produce valid optimized, vectorized, and parallelized loop nests. This paper evaluates a new approach for fast and accurate nonlinear array dependence testing using Chains of Recurrences (CRs). A flow-sensitive loop analysis algorithm is presented for constructing the CR forms of array index expressions. Unlike other approaches, the CR forms are directly integrated into a standard dependence test to solve nonlinear CR-based dependence equations. To study the coverage and performance of the proposed CR-based enhancements of a standard test, we chose the inexact Banerjee test. We implemented a new CR-based Banerjee test in the Polaris compiler and compared the results to the Omega test and Range test on a set of SPEC and LAPACK Benchmark programs. The experimental results suggest that a CR enhancement can dramatically increase the effectiveness of a dependence test without a significant cost increase. More surprisingly, the findings indicate that the enhanced test exceeds the capabilities of the Omega and Range tests for many nonlinear dependence relations detected in the PERFECT Club and LAPACK Benchmark programs.
Developing Scientific Applications Using Eclipse
Authors: Gregory R. Watson, Nathan A. DeBardeleben
Venue: Computing in Science and Engineering (2006)

A large number of tools are already available to aid in the development of parallel scientific applications, yet many developers are unaware they exist, do not have access to them, or find them too difficult to use. Unlike the wider software development community where the use of integrated development environments is best practice, parallel software development languishes with the lowest common denominator of command-line tools and Emacs style editors. By harnessing the power and flexibility of the phenomenally successful Eclipse framework, we have developed a platform for the integration of parallel tools that aims to provide a robust, portable, and scalable parallel development environment for the development of high performance scientific computing applications. Eclipse can be daunting for beginners, so we will provide a brief introduction to Eclipse and the Eclipse architecture, then show how Eclipse can be used to improve the development of scientific computing applications.
Variables Interaction for Mining Negative and Positive Quantitative Association Rules
Authors: Leila Nemmiche Alachaher, Sylvie Guillaume
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

This paper introduces an efficient method for mining both positive and negative quantitative association rules using a tabular pruning and regrouping strategy coordinated with an interestingness measure. This measure evaluates the impact of a new variable on the concerned association.
DPPC-RE: TCAM-Based Distributed Parallel Packet Classification with Range Encoding
Authors: Kai Zheng, Hao Che, Zhijun Wang Bin Liu
Venue: IEEE Transactions on Computers (2006)

Packet classification has been a critical data path function for many emerging networking applications. An interesting approach is the use of Ternary Content Addressable Memory (TCAM) to achieve deterministic, high-speed packet classification performance. However, apart from high cost and power consumption, due to slow growing clock rate for memory technology, in general, the traditional single TCAM-based solution has difficulty to keep up with fast growing line rates. Moreover, the TCAM storage efficiency is largely affected by the need to support rules with ranges or range matching. In this paper, a distributed TCAM scheme that exploits chip-level-parallelism is proposed to greatly improve the throughput performance. This scheme seamlessly integrates with a range encoding scheme which not only solves the range matching problem, but also ensures a balanced high throughput performance. A thorough theoretical worst-case analysis of throughput, processing delay, and power consumption, as well as the experimental results show that the proposed solution can achieve scalable throughput performance matching up to OC768 line rate or higher. The added TCAM storage overhead is found to be reasonably small for the five real-world classifiers studied.
A bivariate rational interpolation with a bi-quadratic denominator
Authors: Qi Duan, Huanling Zhang, Aikui Liu, Huaigu Li
Venue: Journal of Computational and Applied Mathematics (2006)

In this paper a new rational interpolation with a bi-quadratic denominator is developed to create a space surface using only values of the function being interpolated. The interpolation function has a simple and explicit rational mathematical representation. When the knots are equally spaced, the interpolating function can be expressed in matrix form, and this form has a symmetric property. The concept of integral weights coefficients of the interpolation is given, which describes the "weight" of the interpolation points in the local interpolating region.
Medical Image Noise Reduction Using Cellular Neural Networks
Authors: Te-Jen Su, Jyun-Wei Jhang
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, a novel method for designing templates of cellular neural networks to reduce the image noise is discussed. The discrete-time cellular neural network (DTCNN) combining with genetic algorithm (GA) is applied to image noise reducing. Based on GA method, the templates of CNN are optimized to diminish noise interference in polluted image. The demonstrated examples are presented to illustrate the better performance of the proposed methodology (GA-CNN).
Exploiting Operand Availability for Efficient Simultaneous Multithreading
Authors: Joseph J. Sharkey, Dmitry V. Ponomarev
Venue: IEEE Transactions on Computers (2007)

We propose several schemes to improve the scalability, reduce the complexity and delays, and increase the throughput of dynamic scheduling in SMT processors. Our first design is an adaptation of the recently proposed instruction packing to SMT. Instruction packing opportunistically packs two instructions (possibly from different threads), each with at most one nonready source operand at the time of dispatch, into the same issue queue entry. Our second design, termed 2OP_BLOCK, takes these ideas one step further and completely avoids the dispatching of the instructions with two nonready source operands. This technique has several advantages. First, it reduces the scheduling complexity (and the associated delays) as the logic needed to support the instructions with two nonready source operands is eliminated. More surprisingly, 2OP_BLOCK simultaneously improves the performance as the same issue queue entry may be reallocated multiple times to the instructions with at most one nonready source (which usually spends fewer cycles in the queue) as opposed to hogging the entry with an instruction which enters the queue with two nonready sources. For schedulers with the capacity to hold 64 instructions on a 4-way SMT, the 2OP_BLOCK design outperforms the traditional queue by 14 percent, on average, and at the same time results in a 10 percent reduction in the overall scheduling delay. We also present mechanisms to support speculative scheduling with 2OP_BLOCK and introduce the hybrid scheme that dynamically switches between 2OP_BLOCK and instruction packing modes depending on the workload characteristics, to achieve further performance gains.
Dissecting the Image of the Absolute Conic
Authors: Imran Junejo, Hassan Foroosh
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

In this paper, we revisit the role of the image of the absolute conic (IAC) in recovering the camera geometry. We derive new constraints on IAC that advance our understanding of its underlying building blocks. The new constraints are shown to be intrinsic to IAC, rather than exploiting the scene geometry or the prior knowledge on the camera. We provide geometric interpretations for these new intrinsic constraints, and show their relations to the invariant properties of the IAC. This in turn provides a better insight into the role that IAC plays in determining the camera internal geometry. Since the new constraints are invariant properties of the IAC, they can be used to reparameterize its elements. We show that such reparameterization would allow to recover a more general camera geometry from a single view, compared to existing methods. We apply the new constraints to single view calibration using vanishing points, investigate the error resilience, and compare our results to Liebowitz-Zisserman (1999).
Grid Enabling Data De-Duplication
Authors: Jim Austin, Aaron Turner, Sujeewa Alwis
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

A Grid based implementation of a system for finding duplicates in large databases is described. The solution is scalable to many nodes and does not suffer the problems found in other implementations that can result of loss of data and/or deadlock. The system may be applied to conventional de-duplication problems such as found in address management as well as more advanced problems such as banned image detection. The system uses the AURA pattern match methods implemented within a service oriented architecture. The approach builds on the PMS and PMC technology developed in the DAME eScience project.
Intellectual amplification through reflection and didactic change in distributed collaborative learning
Authors: Elsebeth K. Sorensen
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

The agreed educational expectation to Distributed CSCL is the establishment of flexible, collaborative and interactive learning processes of good quality (Kaye, 1994). Achieving peer interaction in distributed CSCL, however, has so far proven to be a mixed and ambiguous affair (Fjuk, 1998; Sorensen, 1997b & 1998).Within Distributed CSCL-research it is generally acknowledged, that new insights into the communicative learning conditions of the virtual environments, together with new didactic methods, have to be developed (Koschmann, 1996; Pea, 1994). Moreover, much research points to human interaction and communication as the key elements to unlocking the interactive learning potential of distributed CSCL (Dillenbourgh et al., 1995). In other words, we need more stringent analytical approaches, which relate the communicative qualities of the virtual context, to qualities of the learning process.This paper compares the problem of stimulating online interaction to the lack of understanding among designers and instructors of the specific dialogical conditions of virtual environments. It discusses, from the perspective of the learning principles of Gregory Bateson (1973), in what sense the specific dialogical conditions and qualities of virtual environments may support learning. It also deals with the challenge of how - under different dialogical conditions - to understand the need for didactic and instructional change in order to enhance interaction and intellectual amplification in asynchronous distributed CSCL.
Fault Detection Architectures for Field Multiplication Using Polynomial Bases
Authors: Arash Reyhani-Masoleh, M. Anwar Hasan
Venue: IEEE Transactions on Computers (2006)

In many cryptographic schemes, the most time consuming basic arithmetic operation is the finite field multiplication and its hardware implementation for bit parallel operation may require millions of logic gates. Some of these gates may become faulty in the field due to natural causes or malicious attacks, which may lead to the generation of erroneous outputs by the multiplier. In this paper, we propose new architectures to detect erroneous outputs caused by certain types of faults in bit-parallel and bit-serial polynomial basis multipliers over finite fields of characteristic two. In particular, parity prediction schemes are developed for detecting errors due to single and certain multiple stuck-at faults. Although the issue of detecting soft errors in registers is not considered, the proposed schemes have the advantage that they can be used with any irreducible binary polynomial chosen to define the finite field.