ppxscal/embedding_network huggingface dataset:
Elicitation of Knowledge from Multiple Experts Using Network Inference
Authors: Robert Rush, William A. Wallace
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Eliciting knowledge from multiple experts usually entails the use of groups, and thus is subject to the problems inherent in group dynamics. We present a technique for multiple expert knowledge acquisition that does not rely upon the use of groups and can take advantage of technological advances in communications and computing, i.e., the Internet. The approach uses influence diagrams to represent the individual expert's understanding of the problem situation and develops a Multiple Expert Influence Diagram (MEID), a composite representation of the experts' knowledge. Following a review of present methods for multiple expert knowledge elicitation, we formally define the MEID, describe its manner of construction, and discuss its interpretation. We continue with a review of the issues to be faced in implementation of the technique, and give an illustrative example. Finally, we emphasize the need to provide users of decision aids with defensible measures of the quality of the rules produced by these aids. The MEID-approach is intended to serve as a first step in this direction.
AOL Companion, 2nd edition
Authors: Jennifer Watson
Venue:  (1998)

:Make America Online work for you by learning the tips, tricks, and secrets of AOLs insiders. AOL Keywords author Jennifer Watson and her online friends are your seasoned companions as you journey to the heart of America Online. Combining friendly fun with solid advice, their tips show you how to tap the real power of America Online and save time and aggravation. Not only will they explain how to access, customize, navigate, communicate, make friends, find stuff, surf the Net, and expand your software, theyll also show you how to do it better and faster than ever before. This is the stuff that turns newcomers into experts, and teaches experts something new. Included are hundreds of tips and tricks for using America Online, each indexed, cross-referenced, and very easy to understand. All are organized logically for cover-to-cover reading or a quick lookup. With an emphasis on chatting, youll find lists of chat smileys and shorthand used on America Online, plus over 300 online terms explained and demystified. AOL Companion is your best friend on the worlds largest online service. Secrets for getting the most from America Online Over 135 how-to topics, indexed and cross-referenced Hundreds of useful America Online tips and tricks Contributions by veteran America Online members Friendly, entertaining writing with no "technobabble" Smileys and other "emoticons" for fun, easy chatting An exhaustive list of America Online shorthand Helpful information on "netiquette" and online safety A complete glossary of America Online lingo
A Distance-Based Approach to Entity Reconciliation in Heterogeneous Databases
Authors: D. Dey, S. Sarkar, P. De
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In modern organizations, decision makers must often be able to quickly access information from diverse sources in order to make timely decisions. A critical problem facing many such organizations is the inability to easily reconcile the information contained in heterogeneous data sources. To overcome this limitation, an organization must resolve several types of heterogeneity problems that may exist across different sources. In this paper, we examine one such problem called the entity heterogeneity problem, which arises when the same real-world entity type is represented using different identifiers in different applications. A decision-theoretic model to resolve the problem is proposed. Our model uses a distance measure to express the similarity between two entity instances. We have implemented the model and tested it on real-world data. The results indicate that the model performs quite well in terms of its ability to predict whether two entity instances should be matched or not. The model is shown to be computationally efficient. It also scales well to large relations from the perspective of the accuracy of prediction. Overall, the test results imply that this is certainly a viable approach in practical situations.
Reusing Analogous Components
Authors: Betty H. C. Cheng, Jun-Jang Jeng
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Using formal specifications to represent software components facilitates the determination of reusability because they more precisely characterize the functionality of the software, and the well-defined syntax makes processing amenable to automation. This paper presents an approach, based on formal methods, to the search, retrieval, and modification of reusable software components. From a two-tiered hierarchy of reusable software components, the existing components that are analogous to the query specification are retrieved from the hierarchy. The specification for an analogous retrieved component is compared to the query specification to determine what changes need to be applied to the corresponding program component in order to make it satisfy the query specification.
Layered patterns for business interaction
Authors: Mikael Lind, Göran Goldkuhl
Venue: ACM SIGGROUP Bulletin (2001)

Business modelling is needed in order to highlight the essentials of businesses when developing information systems. Patterns of inter-related speech acts are the basis for identifying essentials in Language/Action-oriented approaches for business modelling. Weigand et al. has made an attempt to conceptualise the notion of patterns in a layered architecture founded in such approaches. In this paper we present a framework of generic layered patterns for business interaction inspired by a critical examination of Weigand's meta-pattern framework. Our framework of interdependent layers of generic patterns can be used to describe and understand short-termed as well as long-termed business interaction. The five layers of generic patterns are business act as the basic unit of analysis, action pair, exchange, business transaction, and transaction group.
Don't cares and multi-valued logic network minimization
Authors: Yunjian Jiang, Robert K. Brayton
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

We address optimizing multi-valued (MV) logic functions in a multi-level combinational logic network. Each node in the network, called an MV-node, has multi-valued inputs and single multi-valued output. The notion of don't cares used in binary logic is generalized to multi-valued logic. It contains two types of flexibility: incomplete specification and non-determinism. We generalize the computation of observability don't cares for a multi-valued function node. Methods are given to compute (a) the maximum set of observability don't cares, and (b) the compatible set of observability don't cares for each MV-node. We give a recursive image computation to transform the don't cares into the space of local inputs of the node to be minimized. The methods are applied to some experimental multi-valued networks, and demonstrate reduction in the size of the tables that represent multi-valued logic functions.
Mimicing 3D transformations of emotional stylised animation with minimal 2D input
Authors: Fabian Di Fiore, Frank Van Reeth
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

In this paper we introduce a novel approach to assist a graphical artist throughout the creation of traditional facial animation. We focus on eliminating the time-consuming process of drawing all the emotions of a character, which has to be seen from different viewpoints. Furthermore, we aim at preserving the animator's freedom of expressing the artistic style he is bearing in mind.To establish these goals, we introduce the concept of facial emotion channels, of which each represents a facial part expressing an emotion. Furthermore, we present a novel approach through which an emotionally meaningful 2D facial expression from one point of view can be created from a reference expression from another point of view. The provided solution is easy to use and empowers a much quicker cartoon production, without hampering the animation artists' creativity.
Objective-Driven Monitoring for Broadband Networks
Authors: Subrata Mazumdar, Aurel A. Lazar
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

An approach to sensor configuration, installation, and activation for real-time monitoring of broadband networks for managing its performance is presented. An objective-driven measurement strategy for establishing the dynamic and statistical databases of the network is described. Objective driven monitoring allows the activation of sensors for data collection and abstraction based on a set of objectives. The objectives are derived from the quality of service requirements for real-time traffic control and operator submitted queries. The methodology of objective-driven monitoring for selective activation of sensors is implemented as a set of rules in the knowledge base of the monitor.
How Internet Software Companies Negotiate Quality
Authors: Richard Baskerville, Linda Levine, Jan Pries-Heje, Balasubramaniam Ramesh, Sandra Slaughter
Venue: Computer (2001)

Regardless of their market niche, most companies feel pressured to release software faster: within 12 to 18 months for non-Internet companies and as quickly as three to six months for Web ventures. To achieve these short cycles, companies like Microsoft and Netscape have adopted techniques that can halve traditional development times: Lean production tailors work processes, tool use, methods, and project management to eliminate waste and rework. Fast cycle time mandates using development processes that require only a fraction of the time and resources ordinary processes consume. As the scramble to innovate reduces development time, companies must seek nontraditional approaches to software quality. Both Microsoft and Netscape, for example, improve quality, reduce costs, and decrease production time on their large projects by applying prototyping techniques perfected on small projects. To identify what drives and characterizes Internet-speed development, researchers at Carnegie Mellon University, Georgia State University, and the Software Engineering Institute interviewed software developers and project managers at nine companies that use these practices. This study, part of an ongoing project, revealed three important trends. Time drives development decisions based on pressures to reach market first. Quality depends on whether or not practices like parallel QA are in place, the importance customers place on quality, and developers' skill levels. Finally, development processes adjust as companies tweak their methods to achieve higher quality.
Extending SQL with General Transitive Closure and Extreme Value Selections
Authors: J. Eder
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

Many recursive query processing applications are still poorly supported, partly because implementations of general recursive capabilities are inefficient and hard to understand for users, partly because the approaches do not integrate well with existing query languages. An extension is proposed of the database language SQL for the processing of recursive structures. The new constructs are integrated in the view definition mechanism of SQL. Therefore, users with knowledge of SQL can take advantage of the increased functionally without learning a new language. The construct is based on a generalization of transitive closure and is formally defined. Because of the importance of extreme value sections, special constructs are introduced for the selection of tuples with minimal or maximal values in some attributes. Applying these selections on recursively defined views constitutes nonlinear recursion. By the introduction of special constructs for these selections, dealing with general nonlinear recursion can be avoided.
Performance Modeling of Distributed and Replicated Databases
Authors: Matthias Nicola, Matthias Jarke
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

This paper surveys performance models for distributed and replicated database systems. Over the last 20 years, a variety of such performance models have been developed and they differ in 1) which aspects of a real system are or are not captured in the model (e.g., replication, communication, nonuniform data access, etc.) and 2) how these aspects are modeled. We classify the different alternatives and modeling assumptions and discuss their interdependencies and expressiveness for the representation of distributed databases. This leads to a set of building blocks for analytical performance models. To illustrate the work that is surveyed, we select a combination of these proven modeling concepts and give an example of how to compose a balanced analytical model of a replicated database. We use this example to show how to derive meaningful performance values and to discuss the applicability and expressiveness of performance models for distributed and replicated databases. Finally, we compare the analytical results to measurements in a distributed database system.
Text-to-Speech Conversion on a Personal Computer
Authors: Yousif A. El-Imam, Karima Banat
Venue: IEEE Micro (1990)

A system that uses a set of units derived from Arabic syllables to synthesize unlimited-vocabulary speech on PCs is presented. Text-transcription rules operate on input orthography to generate an abstract representation of phonemes and syllables that form synthesis units and speech. General aspects of the problem, such as the synthesis method and the generation of synthesis units, are discussed. The rules and algorithms of speech synthesis and the current PC-based realization of these algorithms are presented. System evaluation results show an average understandability score of 93%. The system requires about 20 s to compose and replay 1 s of speech when using the PC XT and about one third of this figure on the PC AT.
High-sensitivity modulation-doped quantum dot infrared photodetectors
Authors: K. Hirakawa, S.-W. Lee, Ph. Lelong, S. Fujimoto, K. Hirotani, H. Sakaki
Venue: Microelectronic Engineering (2002)

We have designed and fabricated quantum dot (QD) infrared photodetectors which utilize photoionization of self-assembled InAs QDs and lateral transport of photoexcited carriers in the modulation-doped AlGaAs/GaAs two-dimensional channels (modulation-doped quantum-dot infrared photodetectors; MD-QDIPs). A broad photocurrent signal has been observed in the mid-infrared range. A very large photoconductive gain of the order of 105-6 is achieved by long lifetimes as well as high mobilities of photoexcited carriers in the modulation-doped conduction channels.
Nonlinearities and Noise Reduction in 3-Source Photometric Stereo
Authors: Lyle Noakes, Ryszard Kozera
Venue: Journal of Mathematical Imaging and Vision (2003)

1-D Leap-Frog (L. Noakes, J. Math. Australian Soc. A, Vol. 64, pp. 37&ndash;50, 1999) is an iterative scheme for solving a class of nonquadratic optimization problems. In this paper a 2-D version of Leap-Frog is applied to a non optimization problem in computer vision, namely the recovery (so far as possible) of an unknown surface from 3 noisy camera images. This contrasts with previous work on photometric stereo, in which noise is added to the gradient of the height function rather than camera images. Given a suitable initial guess, 2-D Leap-Frog is proved to converge to the maximum-likelihood estimate for the vision problem. Performance is illustrated by examples.
Closed on-line bin packing
Authors: E. Asgeirsson, U. Ayesta, E. Coffman, J. Etra, P. Momcilovic, D. Phillips, V. Vokhshoori, Z. Wang, J. Wolfe
Venue: Acta Cybernetica (2002)

An optimal algorithm for the classical bin packing problem partitions (packs) a given set of items with sizes at most 1 into a smallest number of unit-capacity bins such that the sum of the sizes of the items in each bin is at most 1. Approximation algorithms for this NP-hard problem are called on-line if the items are packed sequentially into bins with the bin receiving a given item being independent of the number and sizes of all items as yet unpacked. Off-line algorithms plan packings assuming full (advance) knowledge of all item sizes. The closed on-line algorithms are intermediate: item sizes are not known in advance but the number n of items is. The uniform model, where the n item sizes are independent uniform random draws from [0,1], commands special attention in the average-case analysis of bin packing algorithms. In this model, the expected wasted space produced by an optimal off-line algorithm is Θ(√n), while that produced by an optimal on-line algorithm is Θ(√n log n). Surprisingly, an optimal closed on-line algorithm also wastes only Θ(√n) space on the average. A proof of this last result is the principal contribution of this paper. However, we also identify a class of optimal closed algorithms, extend the main result to other probability models, and give an estimate of the hidden constant factor.
Integrating Formal Methods into the Development Process
Authors: Richard A. Kemmerer
Venue: IEEE Software (1990)

It is shown that integrating formal specification and verification with development is faster and more cost-effective than doing the steps separately or in parallel. This case study demonstrates their application in a security context and documents their use in several phases of development, starting from the requirements of a terminal serving a security officer, on through formal requirements and design expressed as state transitions, to detailed design specifications and proofs that these agree with higher-level specifications, stopping just before code-level verification (due to complications typical of such projects). The effects of verification on this particular project are addressed.
Leadership Challenges for the Future
Authors: Tim Athey
Venue: IEEE Software (1998)

The particular characteristics of the software industry, coupled with the changes that rapid growth brings, provide challenges in both management and leadership distinct from the world of hardware design and manufacturing. Given the nature of software development, certain competencies will be especially important if software managers are to lead effectively.
On Two Types of Representations of the Braid Group Associated with the Knizhnik&ndash;Zamolodchikov Equation of the Bn Type
Authors: V. A. Golubeva, V. P. Leksin
Venue: Journal of Dynamical and Control Systems (1999)

A generalization of the Kohno theorem on the restricted Riemann&ndash;Hilbert problem for the KZ equation of the Bn type is given. The representation of the the braid group of the Bn type in the algebra of symmetrical chord diagrams is constructed and its connection with the Bn type quasi-bialgebra structure and with the monodromy of the generalized KZ equation of the Bn type is discussed.
Early Quality Prediction: A Case Study in Telecommunications
Authors: Taghi M. Khoshgoftaar, Edward B. Allen, Kalai S. Kalaichelvan, Nishith Goel
Venue: IEEE Software (1996)

Predicting the number of faults is not always necessary to guide quality development; it may be enough to identify the most troublesome modules. Predicting the quality of modules lets developers focus on potential problems and make improvements earlier in development, when it is more cost-effective. In such cases, classification models rather than regression models work very well.As a case study, this article applies discriminant analysis to identify fault-prone modules in a sample representing about 1.3 million lines of code from a very large telecommunications system. We developed two models using design product metrics based on call graphs and control flow graphs. One model used only these metrics; the other included reuse information as well. Both models had excellent fit. However, the model that included reuse data had substantially better predictive accuracy. We thus learned that information about reuse can be a significant input to software quality models for improving the accuracy of predictions.
Modeling Coordinated Work: Definition and Application of the Model &ldquo;Coordinated Work Environment&rdquo;
Authors: H. Tellioğlu
Venue: The Journal of Supercomputing (2003)

This paper describes a coordination model for collaborative work. The model called &ldquo;Coordinated Work Environment&rdquo;, utilizes an assembly of several organization units with specific goals and structure, populated by actors, work practices, and artifacts. Coordination work is defined by interdependencies existing in work practices, which can be prerequisite, simultaneous, or by means of sharing of resources. Coordination between communities of practice is established through interactions between them by using artifacts from object worlds. Interactions are of different kinds: interactions for action, possibilities, clarification, and orientation. The paper is based both on several ethnographic studies carried out in radiology departments in Austria, Denmark, and Sweden, and on analysis and assessment of computer systems (picture archiving and communication systems, radiology, and hospital information systems) and artifacts used to support communication, coordination, and collaboration in radiographic health care. It describes the elements of a coordinated work environment in detail by illustrating some practical examples from radiology work.
On some Kantor flocks
Authors: L. Bader, M. J. de Resmini
Venue: Discrete Mathematics (2002)

For q odd, we extend the known construction of Fisher-Thas-Walker flocks via the osculating planes to a twisted cubic (see Fisher, Thas, Math. Z. 169 (1979) 1-11) to monomial flocks, provided some restrictions on the characteristic hold. In particular, we get an alternative geometric description of Kantor flocks (Kantor, Math. Z. 192 (1986) 65-50) for p ≠ 3.
A Construction Set for Multimedia Applications
Authors: Matthew E. Hodges, Russell M. Sasnett, Mark S. Ackerman
Venue: IEEE Software (1989)

The authors describe an interface system called Athena Muse. Muse is an experiment kit for the construction of multimedia learning environments. Learning environments developed with Muse offer a diverse set of complementary interaction techniques, styles, and devices. An interface developer can choose from four representation approaches: directed graphs, multidimensional spatial frameworks, declarative constraints, and procedural languages.
Realtime visualization of implicit objects with contact control
Authors: Frederic Triquet, Laurent Grisoni, Philippe Meseure, Christophe Chaillou
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

This article presents an extension of classical marching cubes for implicit objects associated with blending control. In the framework of classical blend graph[Guy and Wyvill 1995], a technique for handling blending is presented, based on mostly boolean operations, and hence allowing efficient implementation. What is more, the resulting tesselation is topologically closer to the theoretical topology of the mathematical object considered than classical marching cubes tesselations. We also propose an optimization, that we call partial time stamping, that significantly diminishes the amount of redundant field values evaluation during marching cubes tesselation, and has the advantage of being compatible with blending control. This technique can be seen as the extension of an optimization technique described in [Triquet et al. 2001], that was not designed for blending control. Our technique is finally compared to classical marching cubes implementations, as a reference. In this final section it is shown that our technique permits high performance visualization of implicits objects combined with blending control.