ppxscal/embedding_network huggingface dataset:
Efficient Mixed-Domain Behavioural Modeling of Ferromagnetic Hysteresis Implemented in VHDL-AMS
Authors: Peter R. Wilson, J. Neil Ross, Andrew D. Brown, Tom Kazmierski, Jerzy Baranowski
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

In this paper a modified model of ferromagnetic hysteresis suitable for mixed-signal simulations in VHDLAMS is presented. The aim of this paper is to demonstrate how a numerically stable and accurate implementation of the Jiles-Atherton model can be achieved using a 4th order Runga-Kutta integration of the derivative of magnetization with respect to the field strength (H). While most SPICE-like implementations require inconvenient integration in time to obtain the magnetization derivative, our approach is more general as it does not rely on the underlying differential equation solver for this purpose. The model addresses the non-physical situation of negative BH slopes and proposes an alternative implementation of the anhysteretic function using a polynomial approximation of the Langevin function for low signal levels and a new function with no discontinuities. Model efficiency is improved by monitoring the change in H and only activating the integration function when H changes by a specifiedamount.
A Parallel Boundary Value Technique for Singularly Perturbed Two-Point Boundary Value Problems
Authors: J. Vigo-aguiar, S. Natesan
Venue: The Journal of Supercomputing (2004)

A class of singularly perturbed two-point boundary-value problems (BVPs) for second-order ordinary differential equations (DEs) is considered here. In order to obtain numerical solution to these problems, an iterative non-overlapping domain decomposition method is suggested. The BVPs are independent in each subdomain and one can use parallel computers to solve these BVPs. One of the characteristics of the method is that the number of processors available is a free parameter of the method. Practical experiments on a Silicon Graphics Origin 200, with 4 MIPS R10000 processors have been performed, showing the reliability and performance of the proposed parallel schemes. Error estimates for the solution and numerical examples are provided.
Automated short proof generation for projective geometric theorems with Cayley and bracket algebras: II. conic geometry
Authors: Hongbo Li, Yihong Wu
Venue: Journal of Symbolic Computation (2003)

In this paper we study plane conic geometry, particularly different representations of geometric constructions and relations in plane conic geometry, with Cayley and bracket algebras. We propose three powerful simplification techniques for bracket computation involving conic points, and an algorithm for rational Cayley factorization in conic geometry. The factorization algorithm is not a general one, but works for all the examples tried so far. We establish a series of elimination rules for various geometric constructions based on the idea of bracket-oriented representation and elimination, and an algorithm for optimal representation of the conclusion in theorem proving. These techniques can be used in any applications involving brackets and conics. In theorem proving, our algorithm based on these techniques can produce extremely short proofs for difficult theorems in conic geometry.
On the Number of Elements in Matroids with Small Circuits or Cocircuits
Authors: Tristan Denley, Talmage James Reid
Venue: Combinatorics, Probability and Computing (1999)

It has been conjectured that a connected matroid with largest circuit size c &ge; 2 and largest cocircuit size c&#x002A; &ge; 2 has at most &frac12;cc&#x002A; elements. Pou-Lin Wu has shown that this conjecture holds for graphic matroids. We prove two special cases of the conjecture, not restricted to graphic matroids, thereby providing the first nontrivial evidence that the conjecture is true for non-graphic matroids. Specifically, we prove the special case of the conjecture in which c = 4 or c&#x002A; = 4. We also prove the special case for binary matroids with c = 5 or c&#x002A; = 5.
Quantifying contention and balancing memory load on hardware DSM multiprocessors
Authors: Dimitrios S. Nikolopoulos
Venue: Journal of Parallel and Distributed Computing (2003)

This paper makes the following contributions: It proposes a new methodology for quantifying remote memory access contention on hardware DSM multiprocessors. The most valuable aspect of this methodology is that it assesses the overhead of contention on real parallel programs running on real hardware. The methodology uses as input the number of accesses from each node of the DSM to each page in memory. A trace of the memory accesses of the program obtained at runtime is used to compute a fairly accurate estimate of the fraction of execution time wasted due to contention. The paper presents also a new algorithm which detects potential hot spots in pages and balances memory load using dynamic page migration. The algorithm attacks indirectly the problem of contention by balancing the remote memory access latency across the nodes of the system. Experiments with five irregular parallel codes on a 128-processor Origin2000 show that the algorithm yields significant performance improvements.
An End-to-End Tool Chain for Multi-View Modeling and Analysis of Avionics Mission Computing Software
Authors: Zonghua Gu, Shige Wang, Sharath Kodase, Kang G. Shin
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

We present an end-to-end tool-chain for model-baseddesign and analysis of component-based embedded real-timesoftware, with Avionics Mission Computing asan application domain. The tool-chain covers the entiresystem development life-cycle including modeling,analysis, code generation, and runtime instrumentation.Emphasis is placed on integration of tools developedby multiple institutions via standardized interfaceformat definitions in XML. By capturing all relevantinformation explicitly in models at the design level,and performing analysis that provides insight into non-functionalaspects of the system, we can raise the levelof abstraction for the designer, and facilitate rapid systemprototyping.
Real surfaces in complex surfaces
Authors: Marko Slapar
Venue:  (2003)

Let S &sub; X be a real compact surface, C&infin; embedded in a complex surface X. The problem of existence of a regular Stein neighborhood basis of S in X has so far not been well understood. In a generic position, there are only finitely many complex points on X, which can be classified as either elliptic or hyperbolic. By a result of Bishop, the nonexistence of elliptic complex points on S is a necessary condition for the existence of a Stein neighborhood basis of S. We show that an embedded surface S, without elliptic complex points, and with the extra condition of flatness at hyperbolic complex points, has a regular Stein neighborhood basis in X. A connection between complex points and unions of totally real planes is then explored to prove a similar result for certain polynomially convex unions of totally real planes. Using these results, together with the global theory of complex points on embedded real surfaces, we give some new examples of totally real surfaces and Stein domains inside complex elliptic surfaces.
Enhancing SAT-based Bounded Model Checking using Sequential Logic Implications
Authors: Rajat Arora, Michael S. Hsiao
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

We present a novel technique of improving the SAT-basedBounded Model Checking, by inducing powerful sequential signalcorrelations (crossing time-frame boundaries) into the originalCNF formula of the unrolled circuit. A quick preprocessing on thecircuit-under-verification, builds a large set of direct and indirectsequential implications. The non-trivial implications (spanningmultiple time-frames) are converted into two-literal clauses. Theseclauses are quickly replicated throughout the unrolled sequentialcircuit, and appended to the existing CNF database. The addedclauses prune the overall search space of SAT-solver engine andprovide correlation among the different variables, which enhancesthe Boolean Constraint Propagation (BCP). Experimental Resultsfor checking difficult instances of random safety properties onISCAS'89 benchmark circuits show that more than 148x speedupcan be achieved over the conventional approach.
Flexible Interface Matching for Web-Service Discovery
Authors: Yiqiao Wang, Eleni Stroulia
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

The web-services stack of standards is designed to support the reuse and interoperation of software components on the web. A critical step, to that end, is service discovery, i.e., the identification of existing web services that can potentially be used in the context of a new web application. UDDI, the standard API for publishing web-services specifications, provides a simple browsing-by-business-category mechanism for developers to review and select published services. In our work, we have developed a flexible service discovery method, foridentifying potentially useful services and assessing their relevance to the task at hand. Given a textual description of the desired service, a traditional information-retrieval method is used to identify the most similar service description files, and to order them according to their similarity. Next, given this set of likely candidates and a (potentially partial) specification of the desired service behavior, a structure-matching step further refines and assesses the quality of the candidate service set. In this paper, we describe and experimentally evaluate our web-servicediscovery process.
Linking soundscape composition and acoustic ecology
Authors: Hildegard Westerkamp
Venue: Organised Sound (2002)

1. EXPLORING THE CONNECTIONThe term soundscape composition did not exist when I started composing with environmental sounds in the mid-1970s. Through a variety of fortunate circumstances and because of what the 1970s were in Vancouver and Canada - artistically inspiring and moneys were available for adventurous and culturally, socially, politically progressive projects - I had discovered that environmental sounds were the perfect compositional &lsquo;language&rsquo; for me. I had learnt much while working with the World Soundscape Project at Simon Fraser University, about listening, about the properties of sound, about noise, the issues we face regarding the quality of the sound environment and much more. This in combination with learning to record and to work with analog technology in the sonic studio allowed me to speak with sound in a way I found irresistible. In addition, the start-up of Vancouver Co-operative Radio gave us the - at that time rare - opportunity to broadcast our work. It was a place where cultural exploration and political activism could meet. It was from within this exciting context of ecological concern for the soundscape and the availability of an alternate media outlet that my compositional work - now often called soundscape composition - emerged. And it came as a surprise to me, as I had never thought of composing nor of broadcasting as a professional choice in my life.
Emotional facial expression model building
Authors: Yangzhou Du, Xueyin Lin
Venue: Pattern Recognition Letters (2003)

Human face plays a crucial role in interpersonal communication. If we synthesize vivid expressional face in cyberspace, we could make the interaction between computer and human more natural and friendly. In this paper, we present a simple methodology for mimicking realistic face by manipulating emotional states. Compared with traditional methods of facial expression synthesis, our approach takes three advantages at the same time. They are (1) generating facial expressions under quantitative control of emotional states, (2) rendering shape and illumination changes on face simultaneously and (3) synthesizing expressional face for any new person by only utilizing a neutral face image. We have discussed the implementation method in the paper and demonstrated the effects of our approach by using a series of interesting experiments, such as predicting unseen expressions for an unfamiliar person, simulating one's facial expressions with someone else's style, extracting pure emotional expressions from the admixtures.
Cyborg morals, cyborg values, cyborg ethics
Authors: Kevin Warwick
Venue: Ethics and Information Technology (2003)

The era of the Cyborg is now upon us. This has enormous implications on ethical values for both humans and cyborgs. In this paper the state of play is discussed. Routes to cyborgisation are introduced and different types of Cyborg are considered. The author's own self-experimentation projects are described as central to the theme taken. The presentation involves ethical aspects of cyborgisation both as it stands now and those which need to be investigated in the near future as the effects of increased technological power have a more dramatic influence. An important feature is the potential for cyborgs to act against, rather than for, the interests of humanity.
A solver for the network testbed mapping problem
Authors: Robert Ricci, Chris Alfeld, Jay Lepreau
Venue: ACM SIGCOMM Computer Communication Review (2003)

Network experiments of many types, especially emulation, require the ability to map virtual resources requested by an experimenter onto available physical resources. These resources include hosts, routers, switches, and the links that connect them. Experimenter requests, such as nodes with special hardware or software, must be satisfied, and bottleneck links and other scarce resources in the physical topology should be conserved when physical resources are shared. In the face of these constraints, this mapping becomes an NP-hard problem. Yet, in order to prevent mapping time from becoming a serious hindrance to experimentation, this process cannot consume an excessive amount of time.In this paper, we explore this problem, which we call the network testbed mapping problem.We describe the interesting challenges that characterize it, and explore its applications to emulation and other spaces, such as distributed simulation. We present the design, implementation, and evaluation of a solver for this problem, which is in production use on the Netbed shared network testbed. Our solver builds on simulated annealing to find very good solutions in a few seconds for our historical workload, and scales gracefully on large well-connected synthetic topologies.
Tabu Search-based algorithm for Capacitated Multicommodity Network Design Problem
Authors: Nadia Cobos Zaleta, Ada M. Alvarez Socarrás
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

The goal of this paper is to present an efficientprocedure to find good solutions to realistically sizefixed-charge, capacitated, multicommodity, networkdesign problems. At the present time, there exists noalgorithm that can solve large instances, common inseveral applications, in a reasonable period of time, soheuristic procedures must be applied. The designproblem addressed in this work is formulated as amixed-integer programming problem and solved by aprocedure based in Tabu Search meta-heuristic.Computational experiments were conducted andresults are compared with those obtained by anevolutionary algorithm.
Interactive computation and visualization of fetch using standard computer graphics hardware
Authors: Michael Wainer
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Fetch is a measure of unobstructed wind exposure over open water. Depending on prevailing conditions, it may necessitate considering wind exposure from many directions. Applications in geography may require visualization of fetch over an entire body of water. Impossible by hand and computationally demanding even on a computer, this paper describes a new method which accelerates the process to interactive speeds. The speedup is obtained by reformulating the problem to one of graphics rendering and making use of commonly available computer graphics hardware through OpenGL, a widely support graphics standard.
A parallel logarithmic time complexity algorithm for the simulation of general multibody system dynamics
Authors: Kurt S. Anderson
Venue:  (2003)

Multibody systems encompass a vast array of machines, vehicles, and mechanisms, including molecular, bio-mechanical, and micro/nano electro-mechanical systems. The ability to rapidly compute the dynamics of multibody systems is of paramount importance to technologies including real-time operator or hardware in the loop simulation, model based control, and comprehensive design optimization. This dissertation surveys the literature as it pertains to increased computational performance of multibody dynamics simulation and analysis, and presents and validates a novel method for achieving new levels of performance with parallel computers. Existing parallel multibody simulation methods are shown to exhibit one or more undesirable characteristics when applied to general systems. Commonly, non-optimal growth in complexity (high order) of a solution algorithm occurs. There is one existing optimal order method capable of treating general systems, but this method should only be used in conjunction with very large parallel computers, requiring currently unrealistic interprocessor communications costs to be effective. To address a lack of performance with respect to general systems and modest computer resources, a new parallel algorithm of optimal order is introduced which draws exclusively from the latest developments in serial processor low order constrained system solutions. The existing constraint solution termed Recursive Coordinate Reduction (RCR) is shown to be applicable only to a narrow class of kinematic constraints and a completely generalized form is derived and verified. The new parallel method of Recursive Coordinate Reduction Parallelism (RCRP) is systematically derived as a special case of the fastest serial processor algorithm and outperforms existing methods both theoretically and in practice. The method is validated in an object oriented multi-threaded implementation which utilizes shared memory in a parallel computer.
Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization
Authors: Qian Zhao, Hanying Feng, Michelle Effros
Venue: Proceedings of the Conference on Data Compression (2004)

In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensionalrandom vectors, dithering followed by uniform scalar quantization and then byentropy coding achieves performance close to the n-dimensional optimum for amulti-resolution source code. Based on this result, we propose a practical codedesign algorithm and compare its performance with that of the Set Partitioningin Hierarchical Trees (SPIHT) algorithm on natural images.
Hereditary systems and greedy-type algorithms
Authors: Victor Il'ev
Venue: Discrete Applied Mathematics (2003)

We define a hereditary system on a finite set U as a partition of the family 2U of all subsets of U into disjoint families A and D satisfying (A ∈ A,A' ⊆ A) ↠ A' ∈ A and (D ∈ D, D ⊆ D') ↠ D' ∈ A, respectively. The members of A are called independent sets, the sets D ∈ D are called dependent. We consider two important special cases of hereditary systems, matroids and comatroids, and study the structure of these objects. Two general combinatorial optimization problems on a hereditary system, the maximum independent set problem max{f(X):X ∈ A}and the minimum dependent set problem min{f(X):X ∈ D}, are considered. Jenkyns, Korteand Hausmann obtained a performance guarantee of the greedy heuristic ('best in') for the maximumindependent set problem. We present a greedy-type approximation algorithm for solvingthe minimum dependent set problem, the steepest descent heuristic ('worst out'), study interconnectionsbetween the above-mentioned problems and derive performance guarantees of thesteepest descent algorithm. Finally, we apply our results to obtain performance guarantees of thesteepest descent algorithm for some known special combinatorial minimization problems.
Bonferroni-Type Inequalities via Chordal Graphs
Authors: Klaus Dohmen
Venue: Combinatorics, Probability and Computing (2002)

Let &lcub;Av&rcub;v&isin;V be a finite collection of events and G = (V, E) be a chordal graph. Our main result &ndash; the chordal graph sieve &ndash; is a Bonferroni-type inequality where the selection of intersections in the estimates is determined by a chordal graph G. It interpolates between Boole's inequality (G empty) and the sieve formula (G complete). By varying G, several inequalities both well-known and new are obtained in a concise and unified way.
Classroom presentation from the tablet PC
Authors: Richard J. Anderson, Ruth Anderson, Tammy VanDeGriff, Steven A. Wolfman, Ken Yasuhara
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

We have developed and deployed a lecture presentation system in which the instructor uses a Tablet PC as a presentation device. The system was deployed in six university courses in Autumn 2002 and has been favorably received by students and instructors. In our system, the instructor holds a pen-based computer that is wirelessly networked with another computer driving the classroom projector. The instructor displays slides from the tablet and can write on top of them. Various navigation and control facilities are available.
IT Architecture in strategic alliance negotiations: a case
Authors: Purnendu Mandal
Venue: Business strategies for information technology management (2003)

In forming strategic alliances managers should consider information technological fit along with other business considerations among partners. The development of IT architecture for the new situation and its use in the negotiation process could potentially be rewarding for all the parties involved. This chapter uses a case study to describe the way in which the development of IT architecture for the proposed alliance between an information and communications technology (ICT) organisation and its partners helped in the negotiation process. A telecommunications organisation (TEL) intended to enter into the retail electricity distribution business in alliance with existing operators in the retail electricity industry so that TEL could improve its market position. An IT architecture for the new market situation was developed, which helped in understanding the future informational requirements and dependence of partners on each other.