ppxscal/embedding_network huggingface dataset:
Discriminative Parameter Learning of General Bayesian Network Classifiers
Authors: Bin Shen, Xiaoyuan Su, Russell Greiner, Petr Musilek, Corrine Cheng
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Greiner and Zhou [1] presented ELR, a discriminative parameter-learning algorithm that maximizes conditional likelihood (CL) for a fixed Bayesian Belief Network (BN) structure, and demonstrated that it often produces classifiers that are more accurate than the ones producedusing the generative approach (OFE), which finds maximal likelihood parameters. This is especially true when learning parameters for incorrect structures, such as Naïve Bayes (NB). In searching for algorithms to learn better BN classifiers, this paper uses ELR to learn parameters of more nearly correct BN structures ¿ e.g., of a general Bayesian network (GBN) learned from a structure-learning algorithm [2]. While OFE typically produces more accurate classifiers with GBN (vs. NB), we show that ELR does not, when the training data is not sufficient for the GBN structure learner to produce a good model. Our empirical studies also suggest that the better the BN structure is, the less advantages ELR has over OFE, for classification purposes. ELR learning on NB (i.e., with little structural knowledge) still performs about the same as OFE on GBN in classification accuracy, over a large number of standard benchmark datasets.
As Users Grow More Savvy: Experiences with an Asynchronous Distance Learning Tool
Authors: David Bargeron, Jonathan Grudin
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Over a three-year period we designed and redesigned interfaces to a conceptually simple multimedia annotation tool called MRAS, the Microsoft Research Annotation System. We expected MRAS to be widely useful in education settings with little or no modification. In a series of deployments we encountered a surprising range of specific requirements. These included context- and content-specific needs. We ultimately had to shift from an application focus to a platform focus, from a single general-purpose tool to a toolkit to support asynchronous group interaction, with which task-specific applications could be built. Software that can be widely used with little or no modification has advantages for producers and consumers, but our experience suggests that as computer users become more aware of the flexibility of software, general purpose shrinkwrap software may fade away. Requests for MRAS from educators who would likely encounter similar problems suggests that these difficulties are not predictable. We discuss implications for designers, developers, and users.
Direct Computation of Generator Internal Dynamic States from Terminal Measurements
Authors: Vaithianathan Venkatasubramanian, Rajesh G. Kavasseri
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

Estimating the dynamic state variables of a synchronous generator has been a long standing research problem in power system control designs. In this paper, we present a technique to compute approximately the state variables of a synchronous generator, purely from terminalmeasurements. The approximation follows from an analysis of the fundamental equations describing synchronous machine models. The method assumes the availablity of the measurements: real and reactive power, terminal voltage, and the field current. By exploiting the structure of the flux linkage equations, approximate formulas for the machine rotor angle(with respect to the phase of the terminal voltage) as well as for the internal flux linkages are derived, and they are shown to be excellent approximations in simulations of detailed machine models.
The absent interface in design engineering
Authors: Pierre Leclercq, Roland Juchmes
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

In order to respond to the difficulties encountered by CAD software applications in really assisting the conceptual designer, we propose a tool that is capable of interpreting design sketches and feeding data to various project evaluators, right from the early phases in the design process. For that purpose, we use the concept of the absent interface, which is the only interface that is compatible with the cognitive process involved in sketching. In this paper, we present the principles of such an interface, illustrated by EsQUIsE, a software prototype for capturing and interpreting architectural sketches, which has been under development for several years.
Adaptive IP QoS Architecture and Algorithms
Authors: Xiumei Fan, Chuang Lin, Xiuping Fan, Yaya Wei
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

This paper proposed a sort of self-organizing IP QoS architecture based on adaptive edge control (QAAC) and presented its routing realization algorithms (called DSQR). In QAAC architecture, active probe would cooperate with passive regulate and artificial intelligencewould control the proportion of probe packets, chromosome packets and information packets, in order to provide effective QoS for users. This architecture can enhance network adaptive and scalable through the users's adaptive and self-organizing behaving and QAAC will coexistence with traditional best effort services and architectures. The simulation results show that QAAC and DSQR are effective and applied to provide preferable service. This will accommodate the next generation network development and application requirements much more.
Better-quasi-orderings and coinduction
Authors: Thomas Forster
Venue: Theoretical Computer Science (2003)

We can characterise the class of BQOs as the largest class of well-founded quasiorders closed under the Hoare powerdomain construction and colimits.
Translating system specifications to VHDL
Authors: Sanjiv Narayan, Frank Vahid, Daniel D. Gajski
Venue: Proceedings of the conference on European design automation (1991)

Languages based on hierarchical and concurrent state diagrams are powerful in specifying system level designs. Simulating such languages can be simplified by translating to a simulation language such as VHDL and then using available simulators. This paper describes system level abstractions commonly found in specification languages and presents semantic preserving VHDL implementations.
Connectivity compression for three-dimensional planar triangle meshes
Authors: Kanuengnij Kubola
Venue:  (2003)

Graphical display of three-dimensional surfaces is the most effective means of conveying our everyday world in a computer application. Such programs are often executed remotely through a computer network. Transmission of the large amount of data required for an accurate rendering requires substantial channel bandwidth. Lossless compression algorithms for mesh data can therefore improve the performance of these computer programs. A mesh is generally represented by a list of vertices and a list of faces, each of which is a list of vertex indices. The list of faces, referred to as the connectivity data because it shows how the vertices are connected to each other, constitutes the bulk of the mesh data. In this dissertation, I propose a new reversible compression algorithm for connectivity data of a mesh. In the new method, the connectivity of a three-dimensional object is snapped onto a two-dimensional grid before being encoded. After encoding, a lossless compression algorithm, such as Huffman coding, is used to further compress the symbol stream. The capability of this new method is demonstrated with three-dimensional planar triangle meshes. For a planar triangle, meshes containing V vertices, our technique provides between 1.4V and 3.0V bits for the connectivity cost, compared to 6Vlog2V bits required without compression. As our approach does not depend on the vertex locations, we may separately compress the vertex data with any vertex-encoding method currently available.
HOLCF = HOL + LCF
Authors: Olaf Müller, Tobias Nipkow, David Von Oheimb, Oscar Slotosch
Venue: Journal of Functional Programming (1999)

HOLCF is the definitional extension of Church's Higher-Order Logic with Scott's Logic for Computable Functions that has been implemented in the theorem prover Isabelle. This results in a flexible setup for reasoning about functional programs. HOLCF supports standard domain theory (in particular fixpoint reasoning and recursive domain equations), but also coinductive arguments about lazy datatypes. This paper describes in detail how domain theory is embedded in HOL, and presents applications from functional programming, concurrency and denotational semantics.
Review of "Current issues in parsing technology" by Masaru Tomita. Kluwer Academic Publishers 1991.
Venue: Computational Linguistics (1991)

Current Issues in Parsing Technology, edited by Masaru Tomita, contains 18 revised versions from the 45 papers that were presented at the International Workshop on Parsing Technologies (IWPT-89) in August 1989. (Other papers from the conference relating to generalized LR parsing can be found in another book edited by Tomita, aptly titled Generalized LR Parsing.) Seventeen of the contributions in the book report on implementations or formal results (e.g., theorems and proofs) associated with parsing issues, while the first chapter is an introduction by the editor that sets the context and objective for the conference and the book. This introductory chapter also briefly summarizes each of the other papers. Before discussing the common goal and commenting on whether the reports satisfy that objective, a short sketch of each contribution is provided.
A taxonomy of inheritance semantics
Authors: Alyce Faulstich-Brady
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

One of the fundamental concepts of the object-oriented paradigm is inheritance. Unfortunately, though, there is not just one semantic definition of inheritance in the object-oriented world; instead, it is used in various languages to represent a number of different kinds of class relationships. This creates several difficulties. One is that language-independent references to inheritance, in specifications for example, are not well-defined. Another is that we cannot apply our understanding of inheritance from one language to another. In some languages, we cannot even apply the same understanding of inheritance from one class to another. This paper identifies three different ways in which inheritance is used, describes the conceptual distinctions among them, and identifies what information we can infer from each.
The CORAS methodology: model-based risk assessment using UML and UP
Authors: Folker den Braber, Theo Dimitrakos, Bjørn Axel Gran, Mass Soldal Lund, Ketil Stølen, Jan Øyvind Aagedal
Venue: UML and the unified process (2003)

This chapter introduces the CORAS methodology in which Unified Modeling Language (UML) and Unified Process (UP) are combined to support a model-based risk assessment on security-critical systems. The hypothesis is that modeling techniques like UML contribute to increased understanding for the different stakeholders involved during a risk assessment. In the CORAS methodology, a traditional risk management, process is integrated with UP, which is a well-accepted system development process. CORAS tries to show how UML can contribute to better understanding, documentation, and communicating during the different phases of the risk management process. CORAS addresses both systems under development and systems already in use.
Adaptable software architecture generation using the nfr approach
Authors: Narayanan Subramanian
Venue:  (2003)

Adaptability is emerging as an important non-functional requirement (NFR) for software systems. Briefly stated, adaptability is the ability of software systems to withstand changes in their environment. In general, a software system will be adaptable provided its software architecture is itself adaptable in the first place. However, there are very few systematic methods to develop adaptable architectures and almost all of them fail to provide traceability to adaptability requirements and lack ability to represent NFRs, their decompositions, and design artifacts. This thesis uses the NFR Approach to generate adaptable architectures that not only provides a mechanism to trace architectures to requirements but also provides a rich ontology to represent various software artifacts. The thesis first explores the nature of adaptability itself, defines adaptability in a manner consistent with most of the current definitions of adaptability, and explores the constituents of a software architecture such as components, connections, patterns, constraints, styles and rationales. Next, the thesis identifies adaptable constituents of architecture and, to aid in this effort, the Adaptable Software Architecture Framework (ASAF) is proposed that helps in identifying and cataloging adaptable architectural constituents and subsequently searching the catalogs for the most appropriate constituents for a given problem. One of the premises used in this thesis is that using adaptable constituents helps generate adaptable architectures. The ASAF is based on the well-known NFR Framework that helps deal with NFRs at different software development phases including the architecture development phase. Using ASAF, the adaptable architectural constituents are identified and then stored in a knowledge base for later reuse; when required, a search through the knowledge base is made for the most appropriate constituents satisfying the particular requirements and an architecture is developed using these constituents. All these steps together comprise the NFR Approach as applied to adaptable architecture generation. The ASAF also helps in developing a framework for architecture adaptability metrics, called the Process-Oriented Metrics for Software Architecture Adaptability (POMSAA), which generates architectural adaptability metrics in an intuitive manner. POMSAA has been applied to two commercial systems developed at Anritsu Company. In order to validate ASAF, a prototype implementation called the Adaptable Software Architecture Assistant (ASAA) is developed that helps in the semi-automatic generation of adaptable architectures. ASAF and ASAA are used in three different software systems. The results of the application of ASAF and ASAA and the feedback from the industry experts are encouraging and give hope to systematic and semi-automatic generation of adaptable architectures.
Artificial Intelligence: Arrogance or Ignorance?
Authors: Neville Holmes
Venue: Computer (2003)

What the computing profession names its endeavors can shape society's view of us.
Interactive graphical querying of time series and linear sequence data sets
Authors: Harry Hochheiser
Venue:  (2003)

Numerous analytic domains involve the study of measurable quantities that change over time. This widespread interest in time series data sets has led to substantial work in algorithmic strategies for querying and indexing data. Much less work has been done in the development of interactive tools for identifying patterns in these data sets.This dissertation uses a graphical mechanism for specifying queries on time series data to provide the basis for an exploration of the algorithmic and semantic issues surrounding interactive querying of time series data. Contributions of this dissertation include: (1) The definition of timeboxes&mdash;rectangular widgets that can be used in direct-manipulation Graphical User Interfaces (GUIs) to specify query constraints on time series data sets. Timeboxes are used to simultaneously specify two sets of constraints: given a set of N time series profiles, a timebox covering time periods x1&hellip;x2 (x 1 &le; x2) and values y 1&hellip;y2 (y1 &le; y2) will retrieve only those n &isin; N that have values y1 &le; y &le; y2 during all times x 1 &le; x &le; x2. (2) The TimeSearcher information visualization tool, which is based on the time-box query model. TimeSearcher's object-oriented architecture can easily be extended to support variants of the timebox model that provide additional expressive power. (3) The design and implementation of query models and widgets that extend the timebox model, including variable-time timeboxes (VTTs), angular queries, leaders laggards queries, multiple search attributes, and query inversion. (4) Analysis of algorithmic issues: A comparison of multiple alternative search algorithms found that simple sequential scans outperformed geometric indices for processing timebox queries. (5) Empirical evaluation of timeboxes: Two empirical studies, each with 12 subjects, provided preliminary insight into the utility of timeboxes and led to design improvements for input and display. (6) Validation through case studies: TimeSearcher has been used by molecular biologists to explore gene expression data and nucleotide frequencies. This work has validated the utility of the tool and identified design suggestions and opportunities. (7) A framework for extending the timebox model, including the description of numerous possible extensions.
Multibiometric systems
Authors: Anil K. Jain, Arun Ross
Venue: Communications of the ACM (2004)

The latest research indicates using a combination of biometric avenues for human identification is more effective, and far more challenging.
VLSI architecture of modified Euclidean algorithm for Reed-Solomon code
Authors: Y. W. Chang, T. K. Truong, J. H. Jeng
Venue: Information Sciences: an International Journal (2003)

A modified Euclidean decoding algorithm to solve the Berlekamp's key equation of Reed-Solomon code for correcting errors, is presented in this paper. It is derived to solve the error locator and evaluator polynomials simultaneously without performing the operations of polynomial division and field element inversion. In this algorithm, the number of iterations used to solve the equation is fixed, and also the weights used to reduce the degree of the error evaluator polynomial at each iteration can be extracted from the coefficient of fixed degree. Therefore, this proposed algorithm saves many controlling circuits, and provides module architecture with regularity. As a result it is simple and easy to implement, and in addition it can be easily configured for various applications.
Isosurface Construction in Any Dimension Using Convex Hulls
Authors: Praveen Bhaniramka, Rephael Wenger, Roger Crawfis
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

Abstract--We present an algorithm for constructing isosurfaces in any dimension. The input to the algorithm is a set of scalar values in a d-dimensional regular grid of (topological) hypercubes. The output is a set of (d-1)-dimensional simplices forming a piecewise linear approximation to the isosurface. The algorithm constructs the isosurface piecewise within each hypercube in the grid using the convex hull of an appropriate set of points. We prove that our algorithm correctly produces a triangulation of a (d-1)-manifold with boundary. In dimensions three and four, lookup tables with 2^8 and 2^{16} entries, respectively, can be used to speed the algorithm's running time. In three dimensions, this gives the popular Marching Cubes algorithm. We discuss applications of four-dimensional isosurface construction to time varying isosurfaces, interval volumes, and morphing.
Energy Management on Handheld Devices
Authors: Marc A Viredaz, Lawrence S Brakmo, William R Hamburgen
Venue: Queue (2003)

Handheld devices are becoming ubiquitous and as their capabilities increase, they are starting to displace laptop computers—much as laptop computers have displaced desktop computers in many roles. Handheld devices are evolving from today’s PDAs, organizers, cellular phones, and game machines into a variety of new forms. Although partially offset by improvements in low-power electronics, this increased functionality carries a corresponding increase in energy consumption. Second, as a consequence of displacing other pieces of equipment, handheld devices are seeing more use between battery charges. Finally, battery technology is not improving at the same pace as the energy requirements of handheld electronics. Therefore, energy management, once in the realm of desired features, has become an important design requirement and one of the greatest challenges in portable computing, and it will remain so for a long time to come.
Trust-building measures: a review of consumer health portals
Authors: Wenhong Luo, Mohammad Najdawi
Venue: Communications of the ACM (2004)

Health Web sites are employ a medley of trust-building approaches. But does a definitive formula exist for winning consumer trust?
The Swedish national graduate school in scientific computing (NGSSC)
Authors: Sverker Holmgren, Anders Ynnerman
Venue: Future Generation Computer Systems (2003)

The Swedish National Graduate School in Scientific Computing (NGSSC) was founded in 1996, and has so far admitted 75 graduate students in five nationally announced admission rounds. The aim of NGSSC is to produce PhDs with skills in strategically important disciplines together with a broad knowledge of numerical and computational techniques, and to spread the use of computations into new areas of research. NGSSC consists of both a geographical and a disciplinary network and focuses on providing core knowledge on advanced computational techniques to graduate students in application fields. This presents some special challenges to the program, such as developing its own identity and dealing with the very different backgrounds of the students. The NGSSC activities focus on a package of specially developed courses, tailored for student groups with very mixed backgrounds. The courses are given in intensive format, and are compulsory for the students participating in the program.
Self-frustrated arrays of &#x03C0;-junctions and 0-&#x03C0;-bi-stability
Authors: V. V. Ryazanov, V. A. Oboznov, A. V. Timofeev, V. V. Bol'ginov
Venue: Microelectronic Engineering (2003)

Phase interference in arrays of superconductor-ferromagnet-superconductor (SFS) Josephson junctions has been investigated experimentally. A transition of the SFS junctions to the π-state manifests itself in the half-period shift of the external magnetic field dependence of the transport critical current in the triangular SFS arrays. It is associated with the appearance of spontaneous supercurrents in the array at zero external field, with the ground state degenerated with respect to the two possible current flow directions. In conventional Josephson arrays this state can be observed only by imposing frustrating external field equal to a half-integer number of magnetic quanta per cell. At temperatures close to the '0-π' transition the critical current versus field dependences of the arrays have shown the behaviour that can been explained by 0-π-bi-stability of the SFS junctions.
A Power-Saving Scheduling for IEEE 802.11 Mobile Ad Hoc Network
Authors: Ming Liu, Ming T. Liu
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Power efficiency is one of the most important aspects in mobile networks. Much research has been done in saving power for mobile devices. The IEEE 802.11 standard adopts a MAC layer sleep-wake power-saving scheme, and in the ad hoc mode of IEEE 802.11, a fully connected network is used. Taking advantage of the above mechanisms, we propose in this paper an enhanced power-saving algorithm that incorporates a contention-free schedulingfunction for data transmission within the beacon interval. We show by simulations that this enhanced algorithm results in better efficiency on both system throughput and energypreservation.