ppxscal/embedding_network huggingface dataset:
SINCLAS: standard igneous norm and volcanic rock classification system
Authors: Surendra P. Verma, Ignacio S. Torres-Alvarado, Zulma T. Sotelo-Rodríguez
Venue: Computers Geosciences (2002)

SINCLAS is an efficient CIPW norm and volcanic rock classification system written in MS-VisualBasic®. It reads input data from STATISTICA® or MS-Excel® files and returns the results to them for further use. As an important improvement, the system takes into account minor chemical constituents in the norm computation. Before computing the CIPW norms and final rock classification, this program handles the Fe2O3/FeO ratio according to three different options and recalculates the actual analyses to an anhydrous (volatile-free) 100 % adjusted basis. Based on mass balance principles and variable atomic weights, SINCLAS achieves accurate and highly consistent CIPW norm results, generally better than 0.002%m/m. Furthermore, the program uses the latest IUGS recommendations for classification of volcanic rocks based on the total alkalis versus silica (TAS) diagram. Taking advantage of the MS-Windows® operating system, SINCLAS is simple to run; it generates a file with adjusted SiO2 and Na2O + K2O values for a TAS diagram in any graphics package, and reports the results in ready-to-print tables in MS-Word® format.
Virtue: Performance Visualization of Parallel and Distributed Applications
Authors: Eric Shaffer, Daniel A. Reed, Shannon Whitmore, Benjamin Schaeffer
Venue: Computer (1999)

High-speed, wide-area networks have made it both possible and desirable to interconnect geographically distributed applications that control distributed collections of scientific data, remote scientific instruments, and high-performance computer systems. Historically, performance analysis has focused on monolithic applications executing on large, stand-alone, parallel systems. In such a domain, measurement, postmortem analysis, and code optimization suffice to eliminate performance bottlenecks and optimize applications. Distributed visualization, data mining, and analysis tools allow scientists to collaboratively analyze and understand complex phenomena. Likewise, real-time performance measurement and immersive performance display systems--that is, systems providing large stereoscopic displays of complex data--enable collaborating groups to interact with executing software, tuning its behavior to meet research and performance goals. To satisfy these demands, the authors designed Virtue, a prototype system that integrates collaborative, immersive performance visualization with real-time performance measurement and adaptive control of applications on computational grids. These tools enable physically distributed users to explore and steer the behavior of complex software in real time and to analyze and optimize distributed-application dynamics.
Interacting with the virtually recreated Peranakans
Authors: Meehae Song, Thomas Elias, Wolfgang Müller-Wittig, Tony K. Y. Chan
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

Virtual Reality (VR) technology opens up many new possibilities. One of the new and upcoming areas this VR technology is rapidly being used for is in the Digital Heritage domain. With the abundant content and the need for preservation and conservation for cultural heritage, there has been an explosion of Digital Heritage projects worldwide. VR technology provides an important educational tool to recreate the cultural heritage content in an immersive high-quality 3D environment for the users to enter and experience the culture in real-time. Intuitive interaction techniques providing users other tools as an alternative to the conventional mouse and keyboard input also add to enhanced educational value. Here, we present a Digital Heritage project focusing on the Singapore region. We have selected the Peranakans and their Culture as the main topic for reconstruction using the VR technology. Innovative interaction techniques specific to the selected Digital Heritage content is also under development. This paper outlines the motivation, early developments, and implementation currently in progress.
Discriminant Waveletfaces and Nearest Feature Classifiers for Face Recognition
Authors: Jen-Tzung Chien, Chia-Chen Wu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Feature extraction, discriminant analysis, and classification rule are three crucial issues for face recognition. This paper presents hybrid approaches to handle three issues together. For feature extraction, we apply the multiresolution wavelet transform to extract waveletface. We also perform the linear discriminant analysis on waveletfaces to reinforce discriminant power. During classification, the nearest feature plane (NFP) and nearest feature space (NFS) classifiers are explored for robust decision in presence of wide facial variations. Their relationships to conventional nearest neighbor and nearest feature line classifiers are demonstrated. In the experiments, the discriminant waveletface incorporated with the NFS classifier achieves the best face recognition performance.
Evaluations of architectural designs and implementation for database-driven web sites
Authors: Wen-Syan Li, Wang-Pin Hsiung, Oliver Po, K. Selçuk Candan, Divyakant Agrawal
Venue: Data Knowledge Engineering (2002)

Response time is a key differentiation point among electronic commerce (e-commerce) applications. For many e-commerce applications, Web pages are created dynamically based on the current business state, stored in database systems. The architecture of database-driven e-commerce Web sites are more complex than that of typical Web sites. It requires integration of Web servers, application servers, and back-end database systems as well as synchronization of multiple databases if caches are used for acceleration of content delivery. In this paper, we analyze the factors that impact the performance and scalability of a database-driven Web site. We experimentally test (1) the performance metrics of database update, query, and synchronization; (2) trigger overhead; and (3) application server (AS) and database connection overhead and constraints. We describe several architectural design approaches for database-driven Web sites and present experimental results on their performance under various conditions, including varying request rates, update-to-request ratio, cache hit ratio, number of regional AS/data cache suites deployed, and database size. We also discuss how to handle Web page requests that involve SSL, cookies, and fragment pages (i.e. by frame or JSP).
Sketching Interfaces: Toward More Human Interface Design
Authors: James A. Landay, Brad A. Myers
Venue: Computer (2001)

Today people expect computers to perform not only obvious computational tasks but also to assist in people-oriented tasks. This shift is causing user-interface (UI) researchers to explore methods that bend computers to people's way of interacting by supporting ambiguity, creativity, and informal communication that combines many of the benefits of paper-based sketching with the merits of current electronic tools.Researchers at the University of California, Berkeley and Carnegie Mellon University have designed, implemented, and evaluated an informal sketching tool, SILK (Sketching Interfaces Like Krazy). During the early phases of UI design, designers need the freedom to sketch design ideas quickly, the ability to test designs by interacting with them, and the flexibility to fill in design details as they make choices. Besides refining design details as graphic artists deliberate, SILK supports story-boards-sketches that illustrate how design elements behave, how a dialog box appears when the user activates a button. Designers can present story-boards to colleagues, customers, or end users to show how an interface will behave.A usability evaluation of the implemented SILK system demonstrated that it is an effective tool for early creative design and for communicating design ideas effectively to engineers.
Case Studies in Security and Resource Management for Mobile Object Systems
Authors: Dejan Milojicic, Gul Agha, Philippe Bernadat, Deepika Chauhan, Shai Guday, Nadeem Jamali, Dan Lambright, Franco Travostino
Venue: Autonomous Agents and Multi-Agent Systems (2002)

Mobile objects have gained a lot of attention in research and industry in the recent past, but they also have a long history. Security is one of the key requirements of mobile objects, and one of the most researched characteristics related to mobility. Resource management has been somewhat neglected in the past, but it is being increasingly addressed, in both the context of security and QoS. In this paper we place a few systems supporting mobile objects in perspective based upon how they address security and resource management. We start with the theoretical model of Actors that supports concurrent mobile objects in a programming environment. Then we describe task migration for the Mach microkernel, a case of mobile objects supported by an operating system. Using the OMG MASIF standard as an example, we then analyze middleware support for mobile objects. Mobile Objects and Agents (MOA) system, is an example of middleware level support based on Java. The active networks project, Conversant, supports object mobility at the communication protocol level. We summarize these projects, comparing their security and resource management, and conclude by deriving a few general observations on how security and resource management have been applied and how they might evolve in the future.
Will Linux Be Computer Games' Dark Horse OS?
Authors: Michael Macedonia
Venue: Computer (2001)

Although Linux-based PC games have enjoyed only modest sales, one console giant is betting heavily on the open source OS.
PLEIADES: an internet-based parallel/distributed system
Authors: D. Koulopoulos, K. Papoutsis, G. Goulas, E. Housos
Venue: Software&mdash;Practice Experience (2002)

The use of LAN-based clusters of computers for computational purposes has been in use for several years with significant success and acceptability. The introduction of the Internet infrastructure as the interconnection medium of the cluster allows for additional flexibility and transparency of such systems. PLEIADES is an Internet-based parallel/distributed system whose purpose is to allow users to use distant computational resources in order to form virtual clusters. In addition, PLEIADES can be used as a computational infrastructure service provider for applications in need of computational resources. PLEIADES uses a tiered architecture with particular emphasis on the existence of a middle tier, whose task is to assist in the communication between the interface and the resource management tiers. The existence of the middle tier allows for the creation of an open system that is able to easily integrate with new resource management platforms and tools. Since the use of a mature resource management system for parallel/distributed computing was a prerequisite of the PLEIADES architecture, the Condor resource management environment was used. The design and implementation characteristics of PLEIADES together with some experimental uses of the system are also presented.
A simulated annealing approach to police district design
Authors: Steven J. D'Amico, Shoou-Jiun Wang, Rajan Batta, Christopher M. Rump
Venue: Computers and Operations Research (2002)

This paper considers the problem of redistricting or redrawing police command boundaries. We model this problem as a constrained graph-partitioning problem involving the partitioning of a police jurisdiction into command districts subject to constraints of contiguity, compactness, convexity and size. Since the districting affects urban emergency services, there also exist quality-of-service constraints, which limit the response time (queue time plus travel time) to calls for service. Confronted with the combinatorial challenge of the districting problem, we propose a simulated annealing algorithm to search for a "good" partitioning of the police jurisdiction. At each iteration of the algorithm, we employ a variant of the well-known PCAM model to optimally assign the patrol cars and assess the "goodness" of a particular district design with respect to some prescribed performance measures. This approach differs from the well-known Hypercube queuing model, which simply evaluates the performance of a user-specified district design and allocation. A computational case study using data from the Buffalo, New York, Police Department reveals the merits of this approach.
A RISC Architecture with Two-Size, Overlapping Register Windows
Authors: Borivoje Furht
Venue: IEEE Micro (1988)

The issues involved in designing multiple-register window schemes are examined, and fixed-size, variable-size and two-size window organizations are discussed. These three multiple-register approaches are compared. A detailed example is presented, showing that the proposed two-size register window scheme has significant advantages over both fixed-size and variable-size schemes. A prototype design is presented.
Multibit Correcting Data Interface for Fault-Tolerant Systems
Authors: G. R. Redinbo, L. M. Napolitano,  Jr., D. D. Andaleon
Venue: IEEE Transactions on Computers (1993)

A fault-detecting, bidirectional data interface between uncoded data from one component, such as a processor, and coded data in the rest of the system is described. This interface is capable of correcting a single multibit symbol error or detecting the occurrence of two such errors. The device uses a shortened Reed-Solomon code, and two practical symbol sizes are considered; nibble (4-bit) errors are protected by a (40, 32) binary equivalent shortened code, and byte errors are covered by a (80, 64) binary-sized code. The Reed-Solomon codes have maximum protection levels, even when shortened, and allow simplifying the design options. A dual orthogonal basis used for the symbols' representations provides significant hardware savings. The interface unit achieves internal fault detection by comparing regenerated parity values in a totally self-checking equality checker. A fault-tolerant ultrareliable memory module is proposed and evaluated. An illustrative design is realized using a single desktop programmable gate array.
Establishing Software Measurement Programs
Authors: Raymond J. Offen, Ross Jeffery
Venue: IEEE Software (1997)

In seeking to improve software, companies are finding out how much is involved in measuring it. They are also learning that the more integral software measurement is to the company's underlying business strategy, the more likely it is to succeed.
The Impact of Tools on Software Productivity
Authors: Tilmann Bruckhaus, Nazim H. Madhavji, Ingrid Janssen, John Henshaw
Venue: IEEE Software (1996)

To stay competitive, software organizations must continuously improve product quality and customer satisfaction, as well as lower software development costs and shorten delivery time. One way to do this is to adopt appropriate software tools. However, to make effective use of specific tools you should first understand how a tool will affect these critical variables in your project. Because we don't know how to analyze a tool's impact on specific projects, we generally adopt them based on an intuitive understanding of their expected impact. In many cases, the actual results of this practice are disappointing. The problem is aggravated because tool adoption often brings considerable costs. The authors did a case study on the impact of tool insertion in ongoing software projects. The result of their study was a method that organizations can use to assess the impact of tool insertion on software productivity.
Toward Bayes-Optimal Linear Dimension Reduction
Authors: L. J. Buturovic
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Dimension reduction is the process of transforming multidimensional vectors into a low-dimensional space. In pattern recognition, it is often desired that this task be performed without significant loss of classification information. The Bayes error is an ideal criterion for this purpose; however, it is known to be notoriously difficult for mathematical treatment. Consequently, suboptimal criteria have been used in practice. We propose an alternative criterion, based on the estimate of the Bayes error, that is hopefully closer to the optimal criterion than the criteria currently in use. An algorithm for linear dimension reduction, based on this criterion, is conceived and implemented. Experiments demonstrate its superior performance in comparison with conventional algorithms.
A Reconfigurable Fuzzy Neural Network with In-Situ Learning
Authors: Witold Pedrycz, C. Hart Poskar, Peter J. Czezowski
Venue: IEEE Micro (1995)

This paper proposes a Reconfigurable Fuzzy Processor (RFP), for implementing both aggregative (OR, AND) and referential (Matching, Difference, Dominance, and Inclusion) operations. The RFP architecture combines both structural and parametric flexibility in the design of a network implementing these processors as a collection of fuzzy neurons. RFP neurons are composed of three main units: the fuzzy processor (also termed RFP), the learning unit (incorporating a Fuzzy Backpropagation learning algorithm) and a local memory unit.A Fuzzy Neural Network (FNN) is implemented as a bidirectionally linked series of shared buses. This implementation facilitates a modular and scalable design environment for the RFP. An appropriate interface is also provided, separate from the RFP neuron itself, to promote the reuse of the neuron design with alternative interconnect networks.
Lessons Learned in Building a Corporate Metrics Program
Authors: Shari Lawrence Pfleeger
Venue: IEEE Software (1993)

The achievements of the Contel Technology Center's software-metrics project, which brought metrics use from concept to standard operating procedure throughout the corporation, are reviewed. Metrics and process maturity pilot projects, metrics tools, metric databases, and metric data analysis are discussed. The lessons learned from the project, which could help metrics programs in other large, diverse organizations, are also discussed.
Bayesian Analysis of the Stochastic Switching Regression Model Using Markov Chain Monte Carlo Methods
Authors: Mark S. McNulty, Maria Ana E. Odejar
Venue: Computational Economics (2001)

This study develops Bayesian methods for estimating the parameters of a stochastic switching regression model. Markov Chain Monte Carlo methods, data augmentation, and Gibbs sampling are used to facilitate estimation of the posterior means. The main feature of these methods is that the posterior means are estimated by the ergodic averages of samples drawn from conditional distributions, which are relatively simple in form and more feasible to sample from than the complex joint posterior distribution. A simulation study is conducted comparing model estimates obtained using data augmentation, Gibbs sampling, and the maximum likelihood EM algorithm and determining the effects of the accuracy of and bias of the researcher's prior distributions on the parameter estimates.
Design of the Access Network Segment of Future Mobile Communications Systems
Authors: E. C. Tzifa, V. P. Demesticha, P. P. Demestichas, M. E. Theologou, M. E. Anagnostou
Venue: Wireless Personal Communications: An International Journal (1999)

An important component of future mobile communications systems is their access network segment that enables interworking between the mobile unit and the fixed network. In this paper we define and solve two important problems, related to the design of this segment. First, the efficient utilisation of the available radio spectrum. In this context we present a scheme that may be used for reconfiguring the frequency allocation, therefore, improving the spectrum utilisation. The second problem that we address is that of deploying Cell Site Switches (CSSs), and Local Exchanges (LEs). Our aim in this paper is the following. First, to formally define and optimally formulate these problems. Second, to solve them resorting also to computationally efficient heuristic algorithms. Finally, to provide results and draw subsequent conclusions.
Automatic Intra-Register Vectorization for the Intel&reg; Architecture
Authors: Aart J. C. Bik, Milind Girkar, Paul M. Grey, Xinmin Tian
Venue: International Journal of Parallel Programming (2002)

Recent extensions to the Intel&reg; Architecture feature the SIMD technique to enhance the performance of computational intensive applications that perform the same operation on different elements in a data set. To date, much of the code that exploits these extensions has been hand-coded. The task of the programmer is substantially simplified, however, if a compiler does this exploitation automatically. The high-performance Intel&reg; C++/Fortran compiler supports automatic translation of serial loops into code that uses the SIMD extensions to the Intel&reg; Architecture. This paper provides a detailed overview of the automatic vectorization methods used by this compiler together with an experimental validation of their effectiveness.
A framework for the admission control of QoS multicast traffic in mobile ad hoc networks
Authors: Elena Pagani, Gian Paolo Rossi
Venue: Proceedings of the 4th ACM international workshop on Wireless mobile multimedia (2001)

Recently, QoS issues have initiated to be studied in both wired and wireless networks, to support multimedia and real-time applications. In this paper, we propose a framework for the admission control of multimedia multicast traffic and for the system configuration in MANETs. We present a mechanism to ensure bandwidth guarantees to multicast sessions (Call-Admission Multicast Protocol for MANETs, M-CAMP). M-CAMP is scalable, operates on a per-call basis and supports the group membership dynamics. It adopts a measurement-based approach to evaluate the end-to-end bandwidth availability between the traffic source and the group of destinations. M-CAMP is independent of the underlying wireless technology and protocols, as far as a multicast routing service is available. It does not require any maintenance of status information in the mobile hosts.
An alternative implementation of indicator kriging
Authors: Andrew Richmond
Venue: Computers Geosciences (2002)

Indicator kriging (IK) provides a non-parametric distribution estimated directly at fixed thresholds by considering indicator transforms of conditioning data in the form of cumulative distribution functions with 0/1 step functions. To adequately estimate all distributions, IK is frequently implemented with numerous thresholds using large numbers of conditioning data, resulting in significant order-relation violations. An alternative implementation of IK is proposed, involving the direct coding of the conditioning data in the form of probability distribution functions with 0/1 step functions, and the dynamic relocation of thresholds to the conditioning data values. Improved local accuracy and precision, and recoverable reserve estimates were obtained from the proposed implementation of IK when compared to the traditional IK method in an artificial case study. Computer programs dtik3d and dtpik are provided to implement the proposed dynamic threshold IK technique.