ppxscal/embedding_network huggingface dataset:
Passive Interconnect Macromodeling Via Balanced Truncation of Linear Systems in Descriptor Form
Authors: Boyuan Yan
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In this paper, we present a novel passive model order reduction (MOR) method via projection-based truncated balanced realization method, PriTBR, for large RLC interconnect circuits. Different from existing passive truncated balanced realization (TBR) methods where numerically expensive Lur'e or algebraic Riccati (ARE's) equations are solved, the new method performs balanced truncation on linear system in descriptor form by solving generalized Lyapunov equations. Passivity preservation is achieved by congruence transformation instead of simple truncations. For the first time, passive model order reduction is achieved by combining Lyapunov equation based TBR method with congruence transformation. Compared with existing passive TBR, the new technique has the same accuracy and is numerically reliable, less expensive. In addition to passivity-preserving, it can be easily extended to preserve structure information inherent to RLC circuits, like block structure, reciprocity and sparsity. PriTBR can be applied as a second MOR stage combined with Krylov-subspace methods to generate a nearly optimal reduced model from a large scale interconnect circuit while passivity, structure, and reciprocity are preserved at the same time. Experimental results demonstrate the effectiveness of the proposed method and show PriTBR and its structure-preserving version, SP-PriTBR, are superior to existing passive TBR and Krylov-subspace based moment-matching methods.
Fuzzy linear regression model based on fuzzy scalar product
Authors: Hsien-Chung Wu
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

The new concept and method of imposing imprecise (fuzzy) input and output data upon the conventional linear regression model is proposed in this paper. We introduce the fuzzy scalar (inner) product to formulate the fuzzy linear regression model. In order to invoke the conventional approach of linear regression analysis for real-valued data, we transact the &#x03b1;-level linear regression models of the fuzzy linear regression model. We construct the membership functions of fuzzy least squares estimators via the form of &#x201c;Resolution Identity&#x201d; which is a well-known formula in fuzzy sets theory. In order to obtain the membership value of any given least squares estimate taken from the fuzzy least squares estimator, we transform the original problem into the optimization problems. We also provide two computational procedures to solve the optimization problems.
Feedback linearization of nonlinear systems using fuzzy logic
Authors: S. Jagannathan, F. L. Lewis
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

The objective of this paper is to achieve tracking control of a class of unknown nonlinear dynamical systems using a fuzzy logic controller (FLC). A repeatable design algorithm and stability proof is examined for an adaptive fuzzy logic controller that uses basis vectors based on the fuzzy system, unlike most standard adaptive control approaches which use basis vectors depending on the unknown plant (e.g. a tediously computed &ldquo;regression matrix&rdquo;). A &epsilon;-modification approach to adapt the fuzzy system parameters is investigated. With mild assumptions on the state-feedback linearizable nonlinear systems, using this adaptive fuzzy logic controller the uniform ultimate boundedness of the closed-loop signals is presented and that the controller achieves tracking. In fact, the fuzzy system designed is a model-free universal fuzzy controller that can be applied for any system in the given class of systems.
Identifying fault-prone files using static analysis alerts through singular value decomposition
Authors: Mark Sherriff, Sarah Smith Heckman, Mike Lake, Laurie Williams
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Static analysis tools tend to generate more alerts than a development team can reasonably examine without some form of guidance. In this paper, we propose a technique for leveraging field failures and historical change records to determine which sets of alerts are often associated with a field failure using singular value decomposition. We performed a case study on six major components of an industrial software system at IBM over six builds spanning eighteen months of development. Our technique identified fourteen alert types that comprised sets of alerts that could identify, on average, 45% of future fault-prone files and up to 65% in some instances.
Bounds on the Number of Pseudothreshold Functions
Authors: C. R. Baugh
Venue: IEEE Transactions on Computers (1971)

Upper and lower bounds are derived for the number of pseudothreshold functions of n variables. (Pseudothershold logic is a generalization of threshold logic.) It is shown that a lower bound on the number of pseudothreshold functions P(n) of exactly n variables realized by zero-free structures is The number of pseudothreshold functions Q(n) of n variables realized by nontrivial structures is bounded by It is also proven that is a lower bound on the number of positive functions of exactly n variables.
Reducing Photon-Mapping Bandwidth by Query Reordering
Authors: Joshua Steinhurst Greg Coombe Anselmo Lastra
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Photon mapping places an enormous burden on the memory hierarchy. Rendering a 512×512 image of a simple scene can require more than 196GB of raw bandwidth to the photon map data structure. This bandwidth is a major obstacle to real time photon mapping. This paper investigates two approaches for reducing the required bandwidth: 1) reordering the kNN searches; and 2) cache conscious data structures. Using a Hilbert curve reordering, we demonstrate an experimental lower bound of 15MB of bandwidth for the same scene. Unfortunately, this improvement of four orders of magnitude requires a prohibitive amount of intermediate storage. We introduce two novel cost-effective algorithms that reduce the bandwidth by one order of magnitude. Scenes of different complexities are shown to exhibit similar reductions in bandwidth. We explain why the choice of data structure does not achieve similar reductions. We also examine the interaction of query reordering with two photon map acceleration techniques, importance sampling and the irradiance cache. Query reordering exploits the additional coherence that arises from the use of importance sampling in scenes with glossy surfaces. Irradiance caching also benefits from query reordering, even when complex surface geometry reduces the effectiveness of the irradiance cache.
Optimum Multiresolution Fusion Scheme for CT/MR Images Based on Region Feature
Authors: Shu Wang, Hengshan Wang, Gang Xiao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The fusion technology of multi-modality biomedical images is important for clinic diagnoses. For structure of bone can only be clearly display on CT, while normal and pathological soft tissue are better visualized by MR. An optimum multiresolution fusion scheme for CT/MR images based on region feature was proposed. The low frequency band of the image multiresolution representation is segmented into important regions, in which the soft tissue information from MR image was emphasized and fused with rule1. Otherwise the line feature of CT was defined as second important regions and fused with rule 2. Each feature of the regions is used to determine the region's degree of membership in the multiresolution representation, and then to achieve multiresolution representation of the fusion result. Furthermore, the high frequency information was fused with rule3. The final image fusion result can be obtained by using the inverse multiresolution transform. A new optimum fusion scheme combines information from different modalities based on quality performance for fused images after decomposition. Root mean squared error and edge preservation are used to adjust the fusion rule and achieve the optimum weight. Experiments showed that the proposed image fusion method can have better performance than existing image fusion methods.
Fuzzy Influence Diagrams: An Approach to Customer Satisfaction Measurement
Authors: Na An, Jinlan Liu, Yin Bai
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper proposes a contribution on the application of fuzzy influence diagrams (FID) to the measurement of customer satisfaction. While structural equation modeling has been extensively used for this purpose and is still highly useful, FID outperforms it in solving the problems of nonlinearity, validity and causality. The paper describes algorithm of FID and takes emporiums customer satisfaction measurement as an example. This is the first time FID has been used for customer satisfaction measurement, and the results have been quite encouraging.
Simplifld Alfu-N2merik FOnetiks (Sanf)
Authors: R. Sanford
Venue: IEEE Transactions on Software Engineering (1981)

A simplified alpha-numeric phonetic alphabet is proposed. It uses digits, standard keyboard symbols, and upper-and lowercase letters to give a computer-compatible unambiguous single-character phonetic writing of English. Such a phonetic spelling, in conjunction with a pronouncing dictionary giving standardized pronunciation of English words in this phonetic alphabet, together with appropriate computer compilers and speech synthesizers and recognition systems, would facilitate man-machine oral communication and expand the use of talking and listening computers. This phonetic text is considerably shorter than standard English, can be written on any typewriter or computer terminal, and is easily learned in a short time. Rules and characteristics of this language are given, and it is compared to other phonetic alphabets.
An Approach to Build Accessible Grid Service
Authors: Yin Jie, Wang Yue-Xuan, Wu Cheng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Grid service is stateful and transient web service, which can be invoked by clients, and is considered to be the mainstream of future internet. An approach to build grid services is provided as follows, a directed graph model of grid services is developed by first create several service providers and directed edges among every two of them, then increase the number of service providers and random connections among them, when size of service network grows, new providers are no longer randomly connected to previous providers but choose those with high incoming degree. This approach differs from previous methods of building small world complex networks in its imitation of real world situations. This approach is analyzed through simulation and has features of complex networks such as small world and scale free. Accessibility of grid services building through this approach is analyzed when service providers dynamically exit grid system and stop to provide their services.
Detection of traumatic brain injuries using fuzzy logic algorithm
Authors: Inan Güler, Ayşe Tunca, Eyyüp Gülbandilar
Venue: Expert Systems with Applications: An International Journal (2008)

The aim of this study was to develop a diagnostic system for detecting the severity of traumatic brain injuries using fuzzy logic. Twenty-six traumatic brain injury patients in different age and gender were taken in the study. Electroencephalography, Trauma and Glasgow coma scores were used for evaluating the system. The results were compared with the findings of neurologists. We found a significant relationship between the findings of neurologists and systems output for normal, mild and severe electroencephalography tracing data. Getting this system in routine use will facilitate to make a rapid decision for the degree of trauma with electroencephalography.
A novel TCP with dynamic Burst-Contention Loss notification over OBS networks
Authors: Basem Shihada, Pin-Han Ho
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

In this paper, a novel congestion control scheme with dynamic Burst-Contention Loss notifications in Optical Burst Switching (OBS) networks is proposed. The proposed scheme, called TCP-BCL, aims to handle various OBS bursty conditions that negatively affect TCP throughput performance and fairness. The basic design principle of the scheme is to tune the congestion control parameters @a and @b such that the congestion window sizes in the corresponding TCP senders can be adjusted with an explicit notification from the OBS edge node. The performance impact on TCP in terms of burst dropping due to random contention, which is also known as false congestion detection is considered and investigated. An analytical model is developed and further verified through extensive simulation.
Mind-modulated music in the mind attention interface
Authors: Ben Swift, James Sheridan, Yang Zhen, Henry J. Gardner
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

A recent study of electroencephalogram (EEG) activity associated with musical cognition has suggested a correlate for the amount of active musical processing taking place in the brains of musicians. Using a version of this measure, we have built a new brain computer interface which harnesses the "natural" brain activity of musicians to mold and modulate music as it is being composed and played. This computer music instrument is part of a system, the Mind Attention Interface, which provides an interface to a virtual reality theatre using measures of a participant's EEG, eye-gaze and head position. The theatre itself, and its spatialised sound system, closes a feedback loop through the mind of the participant.
A modular triple characterization of circuit signatures
Authors: Lori Koban
Venue: European Journal of Combinatorics (2008)

We study the modular triples of circuits of a matroid and use them to characterize four types of circuit signatures, three of which are known (weak orientations, orientations, and ternary signatures) and one of which is new (lifting signatures). Lifting signatures allow us to specify a linear class of circuits in a matroid, and thereby the lift of the matroid, by labeling the elements from a group in the manner of Dowling and Kelly.
Dynamic observers&mdash;a neural net approach
Authors: M. S. Ahmed, S. H. Riyaz
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

Design of static observers employing neural network has already appeared in the literature. In this paper neural networks are exploited to design nonlinear dynamic observers for estimating the states of a nonlinear system. A number of schemes using Multi-layered Feed-forward Neural Network (MFNN) are presented. In the first approach, the neural network is used to approximate the nonlinear Kalman gain of the observer. Two different training schemes are proposed in this structure. Full and reduced order observer schemes based on a more direct approach are then considered. These schemes utilize the neural nets to assume the nonlinear dynamic mapping from the system input and output in order to obtain the estimated states. The network training for all the schemes is based on a gradient algorithm that uses the recently proposed Block Partial Derivatives (BPD). Simulation results are presented to validate the usefulness of the proposed schemes.
Fast Bridging Fault Diagnosis using Logic Information
Authors: A. Rousset, A. Bosio, P. Girard, C. Landrault, S. Pravossoudovitch, A. Virazel
Venue: Proceedings of the 16th Asian Test Symposium (2007)

In this paper, we present a diagnosis methodology targeting the whole set of bridging faults leading to either static or dynamic faulty behavior. The adopted diagnosis algorithm resorts only to logic information provided by the tester without requiring a detailed description of the fault models. It is based on an Effect-Cause analysis providing a ranked list of suspects always including the root cause of the observed error. Experimental results on benchmarks ISCAS'89 and ITC'99 show the efficiency of the proposed solution in terms of diagnosis resolution and required computational time.
Incremental Classification with Generalized Eigenvalues
Authors: Claudio Cifarelli, Mario R. Guarracino, Onur Seref, Salvatore Cuciniello, Panos M. Pardalos
Venue: Journal of Classification (2007)

Supervised learning techniques are widely accepted methods to analyze data for scientific and real world problems. Most of these problems require fast and continuous acquisition of data, which are to be used in training the learning system. Therefore, maintaining such systems updated may become cumbersome. Various techniques have been devised in the field of machine learning to solve this problem. In this study, we propose an algorithm to reduce the training data to a substantially small subset of the original training data to train a generalized eigenvalue classifier. The proposed method provides a constructive way to understand the influence of new training data on an existing classification function. We show through numerical experiments that this technique prevents the overfitting problem of the earlier generalized eigenvalue classifiers, while promising a comparable performance in classification with respect to the state-of-the-art classification methods.
BDDC methods for discontinuous Galerkin discretization of elliptic problems
Authors: Maksymilian Dryja, Juan Galvis, Marcus Sarkis
Venue: Journal of Complexity (2007)

A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization, balancing domain decomposition with constraints (BDDC) algorithms are designed and analyzed as an additive Schwarz method (ASM). The coarse and local problems are defined using special partitions of unity and edge constraints. Under certain assumptions on the coefficients and the mesh sizes across @?@W"i, where the @W"i are disjoint subregions of the original region @W, a condition number estimate C(1+max"ilog(H"i/h"i))^2 is established with C independent of h"i, H"i and the jumps of the coefficients. The algorithms are well suited for parallel computations and can be straightforwardly extended to the 3-D problems. Results of numerical tests are included which confirm the theoretical results and the necessity of the imposed assumptions.
A Friendly Introduction to VoIP
Authors: Arturo Ortiz-Tapia
Venue: IEEE Distributed Systems Online (2007)

A review of Internet Phone Services Simplified by Jim Doherty and Neil Anderson
Is there a benefit to sharing market sales information? Linking theory and practice
Authors: Takamichi Hosoda, Mohamed M. Naim, Stephen M. Disney, Andrew Potter
Venue: Computers and Industrial Engineering (2008)

Using a real-life data set, we investigate the benefit of sharing market sales information in a setting where a theoretical model argues there is no benefit from such a collaboration scheme. The set of real Electronic Point Of Sales (EPOS) data and the orders that were placed by a retailer to a suppler was used. We have focused on products that operate under an every day low price strategy. To measure the benefit of the second echelon player the Standard Deviation of the Prediction Errors (SDPE) is used as this is linearly related to inventory costs. It is revealed that the second echelon player can reduce its SDPE by between 8% and 19% by exploiting the shared EPOS data, suggesting that there is a benefit to information sharing. Furthermore, it is proposed that the noise element that is originally contained in the EPOS series is the major source of the information sharing benefit.
Some Topological Invariants and a Qualitative Topological Relation Model between Fuzzy Regions
Authors: Xinming Tang, Wolfgang Kainz, Hui Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Topological relations are one of the most fundamental properties of spatial objects. The topological relations between crisp spatial objects have been well identified. However how to formalize the topological relations between fuzzy regions needs more investigation. The paper provides a theoretic framework for modeling topological relations between fuzzy regions. A novel topological model is formalized based on fuzzy topological space (FTS). In order to derive disjoint topological parts of a fuzzy set in FTS, the closure of a fuzzy set is decomposed into two novel parts, the core and the fringe. By use of the core, fringe and the outer of a fuzzy set in the FTS, a new 9-intersection matrix is proposed as a qualitative model for identification of topological relations between two simple fuzzy regions. Since all analysis is totally derived from FTS, therefore its results are universally applicable for GIS modeling and applications.
A reputation-based system model for P2P networks
Authors: Chaiyasit Tayabovorn, Songrit Maneewongvatana
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Over the last few years, peer-to-peer or (P2P) networks have changed much the attitude of our online life. Entire users in such networks can play either provider or consumer role all the time. They can share numerous resources directly with each other, regardless of true identity of interacting participants. To join such networks securely, the reputation system becomes a critical part to evaluate the trust of participants. Unfortunately, among current P2P networks, the reputation data used in the reputation system is still limited and valid to only the same community where its referrers and raters belong. This is regarded as inflexibility, causing problems in many aspects. In this paper, we propose a model of P2P reputation system whose main concept is to create a separate P2P community called reputation community, which keeps the reputation data of various object types of other communities. By this concept, we show how it helps the reputation system gets more flexible, scalable, and secure.
Group Authentication Protocol for Mobile Networks
Authors: Nidal Aboudagga, Jean-Jacques Quisquater, Mohamed Eltoweissy
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

The rapid progress and the wide-spread use of the In- ternet and wireless communications in our professional en- deavors and personal lives are making indispensable the need for ubiquitous authenticated connectivity for both mo- bile individuals and groups. In this paper, we present mGAP, a new protocol for mobile group authentication in wireless networks. mGAP predicts nodes' behavior and manages the authentication of mobile groups and individ- ual nodes during roaming across administrative domains. Unlike most existing solutions, our design distributes the load between the mobile access points and the mobile nodes taking into account the mobile nodes' limited resources. Analysis of mGAP's security and performance is included in the paper.
Code Size Optimization for Embedded Processors using Commutative Transformations
Authors: Sai Pinnepalli, Jinpyo Hong, J. Ramanujam, Doris L. Carver
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Code optimization of the offset assignment generated in embedded systems allows for power and space efficient systems. We propose a new heuristic that uses edge classification to commutatively transformation and optimize the assignment. We introduce concept of breakable and unbreakable edges, which assists in selecting edges for path cover and edges for commutative transformation.