ppxscal/embedding_network huggingface dataset:
New nonlinear control of three-phase NPC boost rectifier operating under severe disturbances
Authors: Loubna Yacoubi, Farhat Fnaiech, Louis-A. Dessaint, Kamal Al-Haddad
Venue: Mathematics and Computers in Simulation (2003)

This paper proposes a new nonlinear control of three-phase three-level neutral point clamped (NPC) boost rectifier operating under severe disturbances. The nonlinear control strategy is employed to take into account the essential nonlinearities of the system and it totally differ from the common approach of linearizing the nonlinear system around a nominal operating point. In order to apply this technique, a nonlinear state-space mathematical model of the rectifier is developed. An input/output feedback linearization is then designed and the linearizing Control law is derived. The resulting model is linearized and decoupled. Afterwards, the stabilizing controllers are designed based on linear techniques to control power factor, output and neutral point voltages. This control uses a 3 kHz pulse width modulator (PWM). Simulation results are performed using Simnlink/Matlab and PSB tool The Controllers' performance has been evaluated under diverse parameter variations and input and output disturbances. Alow output voltage ripples and line-current THD and also a small overshoot and a fast settling time are obtained.
Quantitative Evaluation Methodology for Dynamic, Web-Based Collaboration Tools
Authors: Chris Furmanski, David Payton, Mike Daily
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

One of the primary hurdles to effectively evaluating adaptive software is that its very use alters the system from one moment to the next. Here, we developed and implemented an empirical-evaluation methodology that was successfully tested on an adaptive, web-basedcollaboration tool. Subjects participated in an "open-book" exam, spending limited amounts oftime on the web researching a generic, non-technical topic, such as jazz or baseball, and were later tested on the information they had found. We employed objective, user-centeredmetrics to quantify subjects' ability to make enhanced web searches when using the tool. Test results from 8 subjects showed that our approach could reliably measure differences in a user's performance for different collaboration algorithms. Our protocol demonstrated that history-dependent tools can be evaluated without large subject pools and without extensivedatabase preparation if careful evaluation design is utilized.
Simulation of Fuzzy-Logic-Based Intelligent Wheelchair Control System
Authors: Iztok Špacapan, Juš Kocijan, Tadej Bajd
Venue: Journal of Intelligent and Robotic Systems (2004)

Fuzzy logic control system for an intelligent wheelchair aimed for assistance by the severely handicapped persons is presented in the paper. It is based on a computer simulation of wheelchair navigation, in which fuzzy logic enables control priority to smoothly alternate between manual and automatic control of the wheelchair in the vicinity of obstacles. The main purpose of designing and simulating this control approach is to improve the safety of a wheelchair in the presence of obstacles. To analyze the success of the wheelchair control, a dynamic model of the wheelchair, together with the models of distance sensors, has been developed using Lagrange analysis.
Spanning Subgraphs of Random Graphs
Authors: Oliver Riordan
Venue: Combinatorics, Probability and Computing (2000)

Let Gp be a random graph on 2d vertices where edges are selected independently with a fixed probability p > &frac14;, and let H be the d-dimensional hypercube Qd. We answer a question of Bollob&aacute;s by showing that, as d &rarr; &infin;, Gp almost surely has a spanning subgraph isomorphic to H. In fact we prove a stronger result which implies that the number of d-cubes in G &isin; &Gscr;(n, M) is asymptotically normally distributed for M in a certain range. The result proved can be applied to many other graphs, also improving previous results for the lattice, that is, the 2-dimensional square grid. The proof uses the second moment method &ndash; writing X for the number of subgraphs of G isomorphic to H, where G is a suitable random graph, we expand the variance of X as a sum over all subgraphs of H itself. As the subgraphs of H may be quite complicated, most of the work is in estimating the various terms of this sum.
Overcoming shortcomings in schema-based software design systems
Authors: Hing-Yan Lee, Mehdi T. Harandi
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

This paper describes a solution to the problem of acquiring reuseable design components for schema-based software design (SBD) systems. It also discusses some inherent shortcomings of the SBD approach that can be overcome by adopting a hybrid approach that incorporates the use of design cases. This discussion is made against the background of IDeA, an SBD system.
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs
Authors: Ivana Ljubić, Günther R. Raidl
Venue: Journal of Heuristics (2003)

This paper considers the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph vertex-biconnected. A real-world instance of this problem is the enhancement of an already established computer network to become robust against single node failures. The presented memetic algorithm includes effective preprocessing of problem data and a fast local improvement strategy which is applied before a solution is included into the population. In this way, the memetic algorithm's population consists always of only feasible, locally optimal solution candidates. Empirical results on two sets of test instances indicate the superiority of the new approach over two previous heuristics and an earlier genetic algorithm.
News Briefs
Authors: Linda Dailey Paulson
Venue: Computer (2004)

Topics include:E-Mail Security Gets PersonalCeiling for Controversial US H-1B Visas DropsTechnique Speeds Data Transmission in ComputersViewing the World through Interactive Panoramic Images
Organised Sound compact disc
Authors: Anonymous
Venue: Organised Sound (2002)

The Organised Sound Volume 7 CD contains both audio and video. Video material can only be viewed from a computer system. The CD will play all the audio tracks and sound examples in a standard audio CD player.
Optimal parallelization of simulated annealing by state mixing
Authors: John Reinitz
Venue:  (2001)

This thesis describes a new, efficient, and general purpose parallel simulated annealing algorithm. The algorithm is based on periodic mixing steps, in which favorable states reproduce and unfavor able ones are destroyed. It runs on a distributed memory Multiple Instructions Multiple Data architecture parallel computer. Parallel efficiency is controlled by the interval between mixing steps. In this thesis, it is shown that for certain values of this interval found by exhaustive search, the algorithm can give up to 100% parallel efficiency on up to 50 processors and 80% parallel efficiency on 100 processors. Moreover, for a given number of processors, there is a range of mixing interval which gives high parallel efficiency. In this thesis, two efficient statistical estimators, namely, the cross-correlation and variance among processors are defined for finding efficient mixing intervals are constructed which give parallel efficiency of 75% without exhaustive search. This is done by tracking the two statistical estimators right after communication, so as to obtain the lower and upper bounds for the optimal mixing interval. The algorithm was tested on two problems. One was an inverse problem on gene expression dynamics in developmental biology, and the other was the Lennard-Jones potential problem.
Distributed Bayesian Algorithms for Fault-Tolerant Event Region Detection in Wireless Sensor Networks
Authors: Bhaskar Krishnamachari, Sitharama Iyengar
Venue: IEEE Transactions on Computers (2004)

Abstract--We propose a distributed solution for a canonical task in wireless sensor networks--the binary detection of interesting environmental events. We explicitly take into account the possibility of sensor measurement faults and develop a distributed Bayesian algorithm for detecting and correcting such faults. Theoretical analysis and simulation results show that 85-95 percent of faults can be corrected using this algorithm, even when as many as 10 percent of the nodes are faulty.
Virtual trees for the byzantine generals algorithm
Authors: Ahuva Tikvati, Mordechai Ben-Ari, Yifat Ben-David Kolikant
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

The Byzantine Generals algorithm for achieving reliability in the presence of faults is a classic topic in distributed computation and operating systems, not the least because of its colorful story. We describe a concept called virtual data structures, which are concrete representations of global data structures that is not actually maintained by the nodes of a distributed system, but are required in order to understand the correctness of algorithms. We show that the use of virtual trees for the Byzantine Generals algorithm can improve the understanding of this algorithm, and we describe a visualization of the trees.
Wavelet-based volume morphing
Authors: Taosong He, Sidney Wang, Arie Kaufman
Venue: Proceedings of the conference on Visualization '94 (1994)

This paper presents a technique for performing volume morphing between two volumetric datasets in the wavelet domain. The idea is to decompose the volumetric datasets into a set of frequency bands, apply smooth interpolation to each band, and reconstruct to form the morphed model. In addition, a technique for establishing a suitable correspondence among object voxels is presented. The combination of these two techniques results in a smooth transition between the two datasets and produces morphed volume with fewer high frequency distortions than those obtained from spatial domain volume morphing.
An Algebraic Proof of Deuber's Theorem
Authors: Neil Hindman, Dona Strauss
Venue: Combinatorics, Probability and Computing (1998)

Deuber's theorem states that, given any m, p, c, r in IN, there exist n, q, &mu; in IN such that, whenever an (n, q, c&mu;)-set is r-coloured, there is a monochrome (m, p, c)-set. This theorem has been used in conjunction with the algebraic structure of the Stone&ndash;&Ccaron;ech compactification &beta;IN of IN to derive several strengthenings of itself. We present here an algebraic proof of the main results in &beta;IN and derive Deuber's theorem as a consequence.
Formal methods for silicon compilation
Authors: Ton Kalker
Venue: Proceedings of the conference on European design automation (1991)

At the Philips Research Laboratories there is a large research effort on Silicon Compilation for DSP applications. The PIRAMID system is a prototype compiler which is capable of going from specification to layout within a few hours. The input language for PIRAMID has an applicative nature and is called SILAGE. In order to reduce the number of mistakes made during specification a good formal semantics of SILAGE is an absolute necessity. A study into the feasibility of denoting the formal semantics of SILAGE in the mathematical notation of Higher Order Logic revealed several weak points of SILAGE. This paper shows that using mathematical methods one can define a better (with respect to specification/verification purposes) version of SILAGE (SILAGE+) without really adding to the complexity of the PIRAMID compiler.
Identifying Markov Blankets with Decision Tree Induction
Authors: Lewis Frey, Douglas Fisher, Ioannis Tsamardinos, Constantin F. Aliferis, Alexander Statnikov
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

The Markov Blanket of a target variable is theminimum conditioning set of variables that makes thetarget independent of all other variables. MarkovBlankets inform feature selection, aid in causal discoveryand serve as a basis for scalable methods of constructingBayesian networks. This paper applies decision treeinduction to the task of Markov Blanket identification.Notably, we compare (a) C5.0, a widely used algorithmfor decision rule induction, (b) C5C, which post-processesC5.0's rule set to retain the most frequentlyreferenced variables and (c) PC, a standard method forBayesian Network induction. C5C performs as well as orbetter than C5.0 and PC across a number of data sets.Our modest variation of an inexpensive, accurate, off-the-shelfinduction engine mitigates the need for specializedprocedures, and establishes baseline performance againstwhich specialized algorithms can be compared.
Instance-based networking: a communication paradigm for mobile applications
Authors: Moustafa Youssef, Tamer Elsayed, Mohamed Hussein, Tamer Nadeem, Adel Youssef
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

In this work we consider the design principles of the Instance-Based Network (IBN), an extended version of a generic Content-Based Network (CBN). IBN acts as an overlay communication platform over which end-point entities, called contents, communicate independently from their physical locations while providing the flexibility of having different instances of the same content. The semantics of different instances are assigned by the application using the IBN. Routing in the IBN is instance-based; the IBN can route a message to a specific content instance or to the closest instance, if no exact match is found for the destination content instance.
VRMath: an environment for knowledge construction of 3D geometry concepts and processes in virtual reality microworlds
Authors: Andy Yeh, Rod Nason
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

There are many powerful ideas in the use of computer graphics to aid learning and teaching in mathematics. One such powerful idea is the trend toward the utilisation of learning environments with real-time 3D visualisation and accessibility to the Internet that enable students to express their own ideas, engage in multiple knowledge representations and perspectives, and manipulate and share knowledge for collaborative learning. VRMath is informed by the above ideas. Its raison d'etre is to provide elementary school students with a rich learning environment for the construction of 3D geometry concepts and processes and for advanced 3D modelling and simulations.
Inducing a cline from corpora of political manifestos
Authors: Sofie Van Gijsel, Carl Vogel
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Techniques from corpus linguistics are applied to the analysis of a number of European right-wing parties in an effort to extend methods for ranking parties on a left-right spectrum within and across countries and languages. Focus is placed on parties not in government, and analysis is derived from corpora derived from election manifestos published by those parties. The techniques applied are objective in that they apply statistical measures with confidence tests to objectively quantifiable linguistic features of the documents. The results show that the quantitative methods semantically cluster together more 'traditional' right-wing parties as opposed to new-style, populist right-wing parties, and solely on the basis of manifesto texts. Valid applicability of the techniques is demonstrated. The methods are then used to estimate pairwise similarity of a number of European political parties, including cross-national comparisons.
Multiple-Valued Logic and Artificial IntelligenceFundamentals of Fuzzy Control Revisited
Authors: Claudio Moraga, Enric Trillas, Sergio Guadarrama
Venue: Artificial Intelligence Review (2003)

This paper reviews one particular area of Artificial Intelligence, which roots may be traced back to Multiple-valued Logic: the area of fuzzy control. After an introduction based on an experimental scenario, basic cases of fuzzy control are presented and formally analyzed. Their capabilities are discussed and their constraints are explained. Finally it is shown that a parameterization of either the fuzzy sets or the connectives used to express the rules governing a fuzzy controller allows the use of new optimization methods to improve the overall performance.
XML parsing: a threat to database performance
Authors: Matthias Nicola, Jasmi John
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

XML parsing is generally known to have poor performance characteristics relative to transactional database processing. Yet, its potentially fatal impact on overall database performance is being underestimated. We report real-word database applications where XML parsing performance is a key obstacle to a successful XML deployment. There is a considerable share of XML database applications which are prone to fail at an early and simple road block: XML parsing. We analyze XML parsing performance and quantify the extra overhead of DTD and schema validation. Comparison with relational database performance shows that the desired response times and transaction rates over XML data can not be achieved without major improvements in XML parsing technology. Thus, we identify research topics which are most promising for XML parser performance in database systems.
Some issues in multi-phase software reliability modeling
Authors: M. A. Vouk, K. C. Tai
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

During early software testing phases, testing profiles are often very different from operational profiles. Consequently, assessment of operational software quality during these non-operational testing stages is difficult, and is open to interpretation. The paper discusses some issues related to this. Software is assumed to be a large system composed of components that evolve in parallel. The focus is on early identification of software components that in operation may be excessively error-prone. The approach involves definition of states based on static and dynamic propositions about the verification and testing history of the software, and the use of that information in models that span multiple testing phases. An example based on a risk model is presented.
Faults in Grids: Why are they so bad and What can be done about it?
Authors: Raissa Medeiros, Walfredo Cirne, Francisco Brasileiro, Jacques Sauvé
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

Computational Grids have the potential to become themain execution platform for high performance and distributedapplications. However, such systems are extremelycomplex and prone to failures. In this paper, wepresent a survey with the grid community on which severalpeople shared their actual experience regardingfault treatment. The survey reveals that, nowadays, usershave to be highly involved in diagnosing failures, thatmost failures are due to configuration problems (a hint ofthe area's immaturity), and that solutions for dealingwith failures are mainly application-dependent. Goingfurther, we identify two main reasons for this state of affairs.First, grid components that provide high-level abstractionswhen working, do expose all gory details whenbroken. Since there are no appropriate mechanisms todeal with the complexity exposed (configuration, middleware,hardware and software issues), users need to bedeeply involved in the diagnosis and correction of failures.To address this problem, one needs a way to coordinatedifferent support teams working at the grids differentlevels of abstraction. Second, fault tolerance schemestoday implemented on grids tolerate only crash failures.Since grids are prone to more complex failures, suchthose caused by heisenbugs, one needs to toleratetougher failures. Our hope is that the very heterogeneity,that makes a grid a complex environment, can help in thecreation of diverse software replicas, a strategy that cantolerate more complex failures.
A Remark on the Number of Complete and Empty Subgraphs
Authors: Richard H. Schelp, Andrew Thomason
Venue: Combinatorics, Probability and Computing (1998)

Let kp(G) denote the number of complete subgraphs of order p in the graph G. Bollob&aacute;s proved that any real linear combination of the form &sum;apkp(G) attains its maximum on a complete multipartite graph. We show that the same is true for a linear combination of the form &sum;apkp(G) +bpkp(G&macr;), provided bp&ge;0 for every p.
Neurodynamical Optimization
Authors: Li-Zhi Liao, Houduo Qi, Liqun Qi
Venue: Journal of Global Optimization (2004)

Dynamical (or ode) system and neural network approaches for optimization have been co-existed for two decades. The main feature of the two approaches is that a continuous path starting from the initial point can be generated and eventually the path will converge to the solution. This feature is quite different from conventional optimization methods where a sequence of points, or a discrete path, is generated. Even dynamical system and neural network approaches share many common features and structures, yet a complete comparison for the two approaches has not been available. In this paper, based on a detailed study on the two approaches, a new approach, termed neurodynamical approach, is introduced. The new neurodynamical approach combines the attractive features in both dynamical (or ode) system and neural network approaches. In addition, the new approach suggests a systematic procedure and framework on how to construct a neurodynamical system for both unconstrained and constrained problems. In analyzing the stability issues of the underlying dynamical (or ode) system, the neurodynamical approach adopts a new strategy, which avoids the Lyapunov function. Under the framework of this neurodynamical approach, strong theoretical results as well as promising numerical results are obtained.
A hybrid molecular dynamics simulation method for solids
Authors: S. Itoh, M. Igami
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

An efficient molecular dynamics simulation method for solids is presented, where two different schemes are hybridized. This hybrid method can be processed at high speed over 10 times in comparison with conventional simulation methods.
A Specification-Compatible Bluetooth Inquiry Simplification
Authors: Brian S. Peterson, Rusty O. Baldwin, Jeffrey P. Kharoufeh
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

We identify and analyze a specification-compatible method for implementing the Bluetooth inquiry function that simplifies the design while reducing the mean inquiry time. Using simulation data and independent empirical measurements, we verify a previously derived probability density function for the inquiry time of a Bluetooth device. Although the derived density matches the simulated data, it does not closely match the measured data. Assuming the manufacturer made a logical simplification to the specification, we derive the probability density function using the simplification and show it matches the empirical data. In addition to simplifying the inquiry substate implementation, the inquiry modification performs better than the specified inquiry process. We also present a simple method to mitigate a noisy channel.