ppxscal/embedding_network huggingface dataset:
Using FMEA models and ontologies to build diagnostic models
Authors: Burton H. Lee
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

Product design and diagnosis are, today, worlds apart. Despite strong areas of overlap at the ontological level, traditional design process theory and practice does not recognize diagnosis as a part of the modeling process chain; neither do diagnosis knowledge engineering processes reference design modeling tasks as a source of knowledge acquisition. This paper presents the DAEDALUS knowledge engineering framework as a methodology for integrating design and diagnosis tasks, models, and modeling environments around a common Domain Ontology and Product Models Library. The approach organizes domain knowledge around the execution of a set of tasks in an enterprise product engineering task workflow. Each task employs a Task Application which uses a customized subset of the Domain Ontology&mdash;the Task Ontology&mdash;to construct a graphical Product Model. The Ontology is used to populate the models with relevant concepts (variables) and relations (relationships), thus serving as a concept dictionary-style mechanism for knowledge sharing and reuse across the different Task Applications. For inferencing, each task employs a local Problem-solving Method (PSM), and a Model-PSM Mapping, which operate on the local Product Model to produce reasoning outcomes. The use of a common Domain Ontology across tasks and models facilitates semantic consistency of variables and relations in constructing Bayesian networks for design and diagnosis.The approach is motivated by inefficiencies encountered in cleanly exchanging and integrating design FMEA and diagnosis models. Demonstration software under development is intended to illustrate how the DAEDALUS framework can be applied to knowledge sharing and exchange between Bayesian network-based design FMEA and diagnosis modeling tasks. Anticipated limitations of the DAEDALUS methodology are discussed, as is its relationship to Tomiyama's Knowledge Intensive Engineering Framework (KIEF). DAEDALUS is grounded in formal knowledge engineering principles and methodologies established during the past decade. Finally, the framework is presented as one possible approach for improved integration of generalized design and diagnostic modeling and knowledge exchange.
World-wide gallery for pseudo-3D photo collage
Authors: Hiroya Tanaka, Shohei Matsukawa, Akira Wakita, Kaoru Misaki, Tom Saito, Hiroki Ito
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

"Pseudo-3D Photo Collage", one of new wed3D techniques, is based on multiple photographs and Spatial-Hyperlinks. A user can design various patterns of HyperPhoto-Networks, for example, linear, loop, tree, grid, rhizome and so on. It is similar to design a website based on HyperText-Networks. We propose several design patterns and those applications to create highly-designed virtual sequences.
First-principle investigation of the hydroxylation of zirconia and hafnia surfaces
Authors: I. M. Iskandarova, A. A. Knizhnik, E. A. Rykova, A. A. Bagatur'yants, B. V. Potapkin, A. A. Korkin
Venue: Microelectronic Engineering (2003)

First-principle calculations demonstrate that the adsorption energies of water on the (001) and (101) surfaces of tetragonal zirconia (t-ZrO2) and on the (001) surface of monoclinic zirconia and hafnia (m-ZrO2 and m-HfO2) strongly depend on the surface hydroxylation degree. It is found that the fully hydroxylated t-ZrO2(001) surface undergoes a 2×2 reconstruction. The influence of surface dipole-dipole interactions on the calculated adsorption energy is discussed.
Appraising two decades of distributed computing theory research
Authors: Michael J. Fischer, Michael Merritt
Venue: Distributed Computing (2003)

The field of distributed computing started around 1970 when people began to imagine a future world of multiple interconnected computers operating collectively. The theoretical challenge was to define what a computational problem would be in such a setting and to explore what could and could not be accomplished in a realistic setting in which the different computers fell under different administrative structures, operated at different speeds under the control of uncoordinated clocks, and sometimes failed in unpredictable ways. Meanwhile, the practical problem was to turn the vision into reality by building networks and networking equipment, communication protocols, and useful distributed applications. The theory of distributed computing became recognized as a distinct discipline with the holding of the first ACM Principles of Distributed Computing conference in 1982. This paper reviews some of the accomplishments of the theoretical community during the past two decades, notes an apparent disconnect between theoretical and practical concerns, and speculates on future synergy between the two.
Awareness support in a groupware widget toolkit
Authors: Jason Hill, Carl Gutwin
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Group awareness is an important part of synchronous collaboration, and support for group awareness can greatly improve groupware usability. However, it is still difficult to build groupware that supports group awareness. To address this problem, we have developed the MAUI toolkit, a Java toolkit with a broad suite of awareness-enhanced UI components. The toolkit contains both extensions of standard Swing widgets, and groupware-specific components such as telepointers. All components have added functionality for collecting, distributing, and visualizing group awareness information. The toolkit packages components as JavaBeans, allowing wide code reuse, easy integration with IDEs, and drag-and-drop creation of working group-aware interfaces. The toolkit provides the first ever set of UI widgets that are truly collaboration-aware, and provides them in a way that greatly simplifies the construction and testing of rich groupware interfaces.
Cubic theta functions
Authors: Shaun Cooper
Venue: Journal of Computational and Applied Mathematics (2003)

Some new identities for the four cubic theta functions a'(q,z), a(q,z), b(q,z) and c(q,z) are given. For example, we show that a'(q,z)3 = b(q,z)3 + c(q)2c(q,z).This is a counterpart of the identity a(q,z)3 = b(q)2b(q,z3) + c(q,z)3, which was found by Hirschhorn et al.The Laurent series expansions of the four cubic theta functions are given. Their transformation properties are established using an elementary approach due to K. Venkatachaliengar. By applying the modular transformation to the identities given by Hirschhorn et al., several new identities in which a'(q,z) plays the role of a(q,z) are obtained.
Unique decomposition categories, Geometry of Interaction and combinatory logic
Authors: Esfandiar Haghverdi
Venue: Mathematical Structures in Computer Science (2000)

In another paper (Abramsky et al. 1999), we have developed Abramsky's analysis of Girard's Geometry of Interaction programme in detail. In this paper, our goal is to study the data ow based computational aspects of that analysis. We introduce unique decomposition categories that provide a suitable categorical framework for such computational analysis. The current study also serves to establish connections with the work on proof nets and paths by Girard and Danos and Regnier in this categorical setting. The latter goal is partially achieved here by the presentation of categorical models for dynamic algebras.
E-commerce adoption in small firms: a study of online share trading
Authors: Pak Yuen P. Chan, Annette M. Mills
Venue: Managing e-commerce and mobile computing technologies (2003)

This research examines the adoption of e-commerce technology (namely, order-execution online trading technology) by six small brokerage firms at various stages in the evaluation and adoption processes. The study is informed by innovation theory and prior research, and seeks to identify the key factors influencing the adoption process. Consistent with innovation theory, the case findings suggest that three classes of factors influence adoption: innovation factors, factors, organizational factors and environmental factors. The key factors within each of these classes were identified as compatibility and perceived benefits (innovation factors); IT sophistication, internal and external IT support and management support (organizational factors); and pressure from e-commerce-able competitors and clients (environmental factors). Of these variables, compatibility and perceived benefits were found to be the most significant in impacting e-commerce adoption.
Support Theory for Preconditioning
Authors: Erik G. Boman, Bruce Hendrickson
Venue: SIAM Journal on Matrix Analysis and Applications (2003)

We present support theory, a set of techniques for bounding extreme eigenvalues and condition numbers for matrix pencils. Our intended application of support theory is to enable proving condition number bounds for preconditioners for symmetric, positive definite systems. One key feature sets our approach apart from most other works: We use support numbers instead of generalized eigenvalues. Although closely related, we believe support numbers are more convenient to work with algebraically. This paper provides the theoretical foundation of support theory and describes a set of analytical tools and techniques. For example, we present a new theorem for bounding support numbers (generalized eigenvalues) where the matrices have a known factorization (not necessarily square or triangular). This result generalizes earlier results based on graph theory. We demonstrate the utility of this approach by a simple example: block Jacobi preconditioning on a model problem. Also, our analysis of a new class of preconditioners, maximum-weight basis preconditioners, in [E. G. Boman, D. Chen, B. Hendrickson, and S. Toledo, Numer. Linear Algebra Appl., to appear] is based on results contained in this paper.
The &ell;1 oblique procrustes problem
Authors: Nickolay T. Trendafilov, G. A. Watson
Venue: Statistics and Computing (2004)

In this paper, we reconsider the well-known oblique Procrustes problem where the usual least-squares objective function is replaced by a more robust discrepancy measure, based on the &ell;1 norm or smooth approximations of it.We propose two approaches to the solution of this problem. One approach is based on convex analysis and uses the structure of the problem to permit a solution to the &ell;1 norm problem. An alternative approach is to smooth the problem by working with smooth approximations to the &ell;1 norm, and this leads to a solution process based on the solution of ordinary differential equations on manifolds. The general weighted Procrustes problem (both orthogonal and oblique) can also be solved by the latter approach. Numerical examples to illustrate the algorithms which have been developed are reported and analyzed.
Ontologies for semantically interoperable systems
Authors: Leo Obrst
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

In this paper, we discuss the use of ontologies for semantic interoperability and integration. We argue that information technology has evolved into a world of largely loosely coupled systems and as such, needs increasingly more explicit, machine-interpretable semantics. Ontologies in the form of logical domain theories and their knowledge bases offer the richest representations of machine-interpretable semantics for systems and databases in the loosely coupled world, thus ensuring greater semantic interoperability and integration. Finally, we discuss how ontologies support semantic interoperability in the real, commercial and governmental world.
Analysis for Active Network Security Abased on Pi-Calculus Model
Authors: ZhengYou Xia, YiPing Zhong, ShiYong Zhang
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In order to search and analysis the threat model of active network, we hope to present a kind of strict and mathematic model analysis for active network security.We use the \pi-calculusto analyze the security relation of active network components and respectively present calculus model for active node, active code/packet, EE, and user. The threat system calculus model is also proposed and proved that it is congruence. Finally, the conclusion is presented in this paper
When Does It Pay to Make Software More Reliable?
Authors: Ed Stoker, Joanne Bechta Dugan
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Substantial work has been done in the areaof software fault analysis, prediction and evaluation. Somework considers the relationship between failures and cost.Unfortunately, current work does not address the issues ofrevenues, return on investment, or time-value of money. Theseshortcomings limit the usefulness and acceptance of softwarereliability within industry. To address these shortcomings,we have developed an Economic Reliability Analysis [ERA]framework at the University of Virginia, that fuses reliabilityengineering methods with economic analysis.We introduce the [ERA] framework to the software reliabilitycommunity and fuse it with the Musa/Okumoto NHPPsoftware reliability model to estimate the economic impactof operational software faults. This framework defines a setof economic vectors that are calculated using the softwarereliability model along with a few additional financial elements.This extended software reliability model is then used toevaluate an operational software system with three differentproposed software upgrades. All four software systems are analyzedand compared. This analysis provides a more completemethod to apply software reliability modeling techniques toexisting software systems and proposed design changes.
CMeRun: program logic debugging courseware for CS1/CS2 students
Authors: Jim Etheredge
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

It is generally known that most, if not all, beginning programming students have difficulty understanding and debugging programs. For many students the primary problem is that when a program executes, it is essentially a "black box". They know what they think they wrote, but their only clues to logic errors come from watching the output of the program. If there are problems, it is difficult for inexperienced programmers to trace the problem back to the source of the error(s). This paper presents CMeRun, a tool that allows the user to see each statement in a program as it executes. This tool will allow beginning students to master coding and debugging skills much faster since it allows them to "look into" a program as it executes. Having this kind of insight into program execution will improve understanding, decrease development time, and reduce student frustration.
Simple and Efficient Relational Querying of Software Structures
Authors: Dirk Beyer, Andreas Noack, Claus Lewerentz
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Many analyses of software systems can be formalized asrelational queries, for example the detection of design patterns,of patterns of problematic design, of code clones, ofdead code, and of differences between the as-built and theas-designed architecture. This paper describes the conceptsof CrocoPat, a tool for querying and manipulating relations.CrocoPat is easy to use, because of its simple query andmanipulation language based on predicate calculus, and itssimple file format for relations. CrocoPat is efficient, becauseit internally represents relations as binary decisiondiagrams, a data structure that is well-known as a compactrepresentation of large relations in computer-aided verification.CrocoPat is general, because it manipulates not onlygraphs (i.e. binary relations), but n-ary relations.
Bookshelf
Authors: Philipp K. Janert, Shantha Mohan, Robert C. Larrabee
Venue: IEEE Software (2004)

Philipp K. Janert reviews Softare Configuration Management Patterns by Stephen P. Berczuk and Brad AppletonShantha Mohan reviews How to Run Successful Projects III: The Silver Bullet by Fergus O'ConnellRobert Larrabee reviews Beyond Software Architecture: Creating and Sustaining Winning Solutions by Luke Hohmann
CEO Characteristics and Firm R&D Spending
Authors: Vincent L. Barker, George C. Mueller
Venue: Management Science (2002)

Over the past fifteen years, a number of studies have examined the determinants of firm R&D spending. These studies, however, almost invariably focus on the role of firm or external ownership characteristics in predicting R&D spending while overlooking the attributes of the top managers involved in allocating corporate resources. In this study, we change that focus by empirically examining how R&D spending as compared to industry competitors varies at firms based on the characteristics of their CEOs. Using a sample of publicly traded firms, we find that CEO characteristics explain a significant proportion of the sample variance in firm R&D spending even when corporate strategy, ownership structure, and other firm-level attributes are controlled. In terms of individual CEO characteristics, we find that R&D spending is greater at firms where CEOs are younger, have greater wealth invested in firm stock and signifacant career experience in marketing and/or engineering/R&D. In contrast to existing theory, we find that the amount of a CEO's formal education had no significant association with R&D spending once a CEO has attained a college degree. However, significant R&D spending increases are found at firms where CEOs have advanced science-related degrees. From subgroup analyses, we further find that CEO effects on relative R&D spending increase with longer CEO tenure implying that CEOs, over time, may mold R&D spending to suit their own preferences. From these results, we make implications for both research on determinants of R&D spending and managerial practice.
Building panoramic images in the GIMP
Authors: Andrew Burton
Venue: Linux Journal (2004)

Show off a giant view of your next vacation spot. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Barriers to adoption of software reuse a qualitative study
Authors: Karma Sherif, Ajay Vinze
Venue: Information and Management (2003)

With economic pressures to deliver software applications at a faster rate and at lower cost, software reuse is becoming a significant technology for software development. This paper focuses on deriving a descriptive and explanatory theory concerning the individual and organizational barriers associated with the adoption of reuse. A case-study research method was used. A series of five cases were selected on the basis of theoretical replication. The findings, which indicate that barriers occur at both the individual and organizational level, suggest that those at the individual level are actually a consequence of the interaction of barriers caused at the organizational level.
Personalizing to Product Category Knowledge: Exploring the Mediating Effect of Shopping Tools on Decision Confidence
Authors: Arnold Kamis, Michael J. Davern
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Prior efforts in personalization have focused primarily on modeling individual consumer'spreferences so that products for which they have a higher likelihood of purchasing are presented. In this study we explore the potential of an approach to personalization focusing on customizing shopping tools based on a consumer's Product Category Knowledge. The low Product Category Knowledge user may not be able to use the shopping tools as well as the high Product Category Knowledge user, because lower Product Category Knowledge usersallocate cognitive power to learning the product attribute space at the expense of using the tool effectively. Alternatively, shopping tools may effectively guide the decision making of low Product Category Knowledge users, but be perceived as too restrictive by high Product Category Knowledge users, thus diminishing their Decision Confidence. To determine which of these scenarios holds true we had sixty-six subjects interact with different decision toolsof varying effort-accuracy tradeoffs in our purposebuilt web store for purchasing a computer. We examine the impact of Product Category Knowledge on perceptions of ease of use and usefulness of the decision tools, and ultimately Decision Confidence, a key predictor of purchase likelihood. The results evidence the potential value of adapting tools to the degree of user Product Category Knowledge. High Product Category Knowledge users may require less restrictive decision tools to promote Decision Confidence, whereas low Product CategoryKnowledge users may require simpler tools and more decisional guidance [1].
One-way permutations and self-witnessing languages
Authors: Christopher M. Homan, Mayur Thakur
Venue: Journal of Computer and System Sciences (2003)

A desirable property of one-way functions is that they be total, one-to-one, and onto--in other words, that they be permutations. We prove that one-way permutations exist exactly if P ≠ UP ∩ coUP. This provides the first characterization of the existence of one-way permutations based on a complexity-class separation and shows that their existence is equivalent to a number of previously studied complexity-theoretic hypotheses. We study permutations in the context of witness functions of nondeterministic Turing machines. A language is in PermUP if, relative to some unambiguous, nondeterministic, polynomial-time Turing machine accepting the language, the function mapping each string to its unique witness is a permutation of the members of the language. We show that, under standard complexity-theoretic assumptions, PermUP is a strict subset of UP. We study SelfNP, the set of all languages such that, relative to some nondeterministic, polynomial-time Turing machine that accepts the language, the set of all witnesses of strings in the language is identical to the language itself. We show that SAT ∈ SelfNP, and, under standard complexity-theoretic assumptions, SelfNP ≠ NP.
Current Mode Techniques for Sub-pico-Ampere Circuit Design
Authors: Bernabé Linares-Barranco, Teresa Serrano-Gotarredona, Rafael Serrano-Gotarredona, Clara Serrano-Gotarredona
Venue: Analog Integrated Circuits and Signal Processing (2004)

In this paper we explore the low current limit that standard CMOS technologies offer for current mode based VLSI designs. We show and validate a reliable circuit design technique for current mode signal processing down to fempto-amperes. We will take advantage of specific-current extractors and logarithmic current splitters to obtain on-chip sub-pA currents. Then we will use a special on-chip saw-tooth oscillator to monitor and measure currents down to a few fempto-amps. This way, sub-pA currents are characterized without driving them off-chip, nor requiring expensive instrumentation with complicated low leakage setups. A special current mirror is also introduced for reliably replicating such low currents. As an example, a simple log-domain first-order low-pass filter is implemented that uses a 100 fF capacitor and a 3.5 fA bias current to achieve a cut-off frequency of 0.5 Hz and using an area of 12 &times; 24.35 &mu;m2 in a standard 0.35 &mu;m CMOS process. A technique for characterizing noise at these currents is described and verified. Also, temperature dependence of leakage currents is measured as well.