ppxscal/embedding_network huggingface dataset:
Warm Fronts and High Pressure Systems: Overcoming Geographic Dispersion in a Meteorological Cyberinfrastructure Project
Authors: Katherine A. Lawrence, Thomas A. Finholt, Il-hwan Kim
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Linked Environments for Atmospheric Discovery (LEAD) is a US National Science Foundation multidisciplinary project designing cyberinfrastructure for mesoscale meteorology. This ethnographic case study, supplemented with survey data, illustrates the unique management challenges faced by large, geographicallydispersed teams using distance technologies. Like many cyberinfrastructure development projects, LEAD had no common institutional affiliation, simply shared funding. We explore how participants struggled to blend people and expertise across multiple institutions. LEAD relied heavily on technologies to support interaction, but these overshadowed the true core of their success: the team members' collaboration history and interpersonal skills. Nevertheless, competing institutional goals and agendas constantly aggravated the burden of keeping the project team motivated and aligned. Our results suggest that the fate of cyberinfrastructure projects, unlike those in centrally managed corporations or loosely coupled collaboratories, may rely more on members' willingness to exert the effort required to build and maintain longdistance relationships.
Migration of Common Lisp Programs to the Java Platform -The Linj Approach
Authors: Antonio Menezes Leitao
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Translation between high-level programming languages might be the last resort to preserve software written in languages that are no longer widely used. Although the translation process has many similarities with the compilation process, it becomes much more complex when it must produce maintainable code. In this case, besides preserving the semantics of the original software, the translator must also generate a program that obeys the pragmatics of the target language and that should be as similar as possible to an equivalent human-written program in that language. In this paper, we present Linj, a translator between Common Lisp and Java that generates human-readable Java code that can be further maintained by Java programmers. The translator explores extensive knowledge of the syntax, semantics and pragmatics of both Common Lisp and Java, is extensible and has been successfully used in several industry projects.
Oblivious routing for fat-tree based system area networks with uncertain traffic demands
Authors: Xin Yuan, Wickus Nienaber, Zhenhai Duan, Rami Melhem
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

Fat-tree based system area networks have been widely adopted in high performance computing clusters. In such systems, the routing is often deterministic and the traffic demand is usually uncertain and changing. In this paper, we study routing performance on fat-tree based system area networks with deterministic routing under the assumption that the traffic demand is uncertain. The performance of a routing algorithm under uncertain traffic demands is characterized by the oblivious performance ratio that bounds the relative performance of the routing algorithm and the optimal routing algorithm for any given traffic demand. We consider both single path routing where the traffic between each source-destination pair follows one path, and multi-path routing where multiple paths can be used for the traffic between a source-destination pair. We derive lower bounds of the oblivious performance ratio of any single path routing scheme for fat-tree topologies and develop single path oblivious routing schemes that achieve the optimal oblivious performance ratio for commonly used fat-tree topologies. These oblivious routing schemes provide the best performance guarantees among all single path routing algorithms under uncertain traffic demands. For multi-path routing, we show that it is possible to obtain a scheme that is optimal for any traffic demand (an oblivious performance ratio of 1) on the fat-tree topology. These results quantitatively demonstrate that single path routing cannot guarantee high routing performance while multi-path routing is very effective in balancing network loads on the fat-tree topology.
Extending the Applicability of Recommender Systems: A Multilayer Framework for Matching Human Resources
Authors: Tobias Keim
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Recommender Systems (RS) so far have been applied to many fields of e-commerce in order to assist users in finding the products that best meet their preferences. However, while the application of RS to the search for objects is well established, this is not the case for the search for subjects. This is astonishing as a growing number of people make personal and professional information digitally available to others by managing profiles in CV databases, social networking platforms and other online services. In order to address this new field of application for RS, we integrate own prior research into a unified multilayer framework supporting the matching of individuals for recruitment and team staffing processes. By this means we enhance RS research and make a next step towards the development of empirically and theoretically grounded decision support for the human resources function.
Lessons Learned from Caisis: An Open Source, Web-Based System for Integrating Clinical Practice and Research
Authors: Paul Fearn, Kevin Regan, Frank Sculli, Jason Fajardo, Brandon Smith, Paul Alli
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

In 2003, we presented an open source, web-based prostate cancer database developed to integrate clinical practice and research workflows at the IEEE Symposium on Computer- Based Medical Systems [1]. Caisis was designed around structured chronological patient histories which could be displayed to clinicians and processed by computer algorithms. We extended the system to handle 9 diseases. It has been adopted by 15 sites in 4 countries with over 400 users and is currently used to manage data for over 165,000 patients. Lessons learned include the following: 1) the original structure accommodates new diseases well, but users are quick to return to spreadsheets or denormalized data models; 2) design and support should be extended to address a variety of system-adoption scenarios; 3) perceived usability is affected by the entire set of applications an individual must use to perform their job; and 4) user training and support must be enhanced as the system evolves and becomes more complex.
Two-Dimensional Extension of the Reservoir Technique for Some Linear Advection Systems
Authors: François Alouges, Gérard Coq, Emmanuel Lorin
Venue: Journal of Scientific Computing (2007)

In this paper we present an extension of the reservoir technique (see, [Alouges et al., Submitted; Alouges et al.(2002a), In: Finite volumes for complex applications, III, pp. 247---254, Marseille; Alouges et al.(2002b), C. R. Math. Acad. Sci. Paris, 335(7), 627---632.]) for two-dimensional advection equations with non-constant velocities. The purpose of this work is to make decrease the numerical diffusion of finite volume schemes, correcting the numerical directions of propagation, using a so-called corrector vector combined with the reservoirs. We then introduce an object called velocities rose in order to minimize the algorithmic complexity of this method.
Research on a Holonic Agent-Based Inter-Organizational Collaborative Business Model
Authors: Wenli Li
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

The development of Internet and mobile communications provides companies with more opportunities to conduct business. Most companies work through collaborative business (C-Business) with their partners via the Internet and mobile terminals. This indicates a need to explore new information system design methods to support such business activities. This paper analyzes the limitations of the main technologies and methods of system design used in traditional E-Business. The traditional design methods of information systems cannot meet current needs, but a distributed and inter-platform computing architecture, utilizing CORBA, Enterprise Java Beans (EJB) and holonic agents, gives us a new way to handle the problem. The paper proposes a model based on these technologies, which can carry out negotiations and information interactions between companies via collaboration components or objects. A holonic agentbased collaborative model provides better security and flexibility, and improves the performance of interorganizational cooperation. Based on this model, the company and its partners or customers can implement online collaboration easily. An example is included that shows the usability of the model.
Variability Driven Joint Leakage-Delay Optimization Through Gate Sizing with Provabale Convergence
Authors: Ashish Dobhal, Vishal Khandelwal, Azadeh Davoodi, Ankur Srivastava
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In this paper, we approach the gate sizing problem in VLSI circuits considering the variability of process parameters in the nano technology. We follow a penalty based approach in which violation of the timing/leakage constraints is associated with a penalty proportional to the degree of violation. We show that minimization of the expected value of this penalty can be optimally achieved due to inherent convexity of the expected penalty function without making any assumptions on the nature of variability and correlations. Such an approach is ideal in situations where the chips violating the timing and leakage constraints are sold at a loss (and not simply discarded). Comparision with state of the art sensitivity based approach demonstrate an improvement of 73.1% in the expected penalty/loss (also called cumulative yield loss) with an area overhead of 1.8%. Our approach also shows a speed-up of 2.41 times. We also show that minimization of the cumulative yield loss also improves the traditional yield loss of the circuit with a 68.86% improvement from a sensitivity based approach.
Efficient Testable Bit Parallel Multipliers over GF(2^m) with Constant Test set
Authors: J. Mathew, H. Rahaman, D. K. Pradhan
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

We present a C-testable method for detecting stuck-at (s-a) faults in the polynomial basis (PB) bit parallel multiplier circuits over GF(2m). It requires only 7 tests for detecting faults to provide 100% fault coverage, which is independent of the multiplier size. These 7 tests can be derived directly without any requirement of ATPG tools. Synopsys® tool is used to generate ATPG based test patterns.
Enhanced Resolution Jitter Testing Using Jitter Expansion
Authors: Hyun Choi, Donghoon Han, Abhijit Chatterjee
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

This paper presents a hardware jitter expansion technique to enable high-resolution jitter measurement of multi-GHz digital signals. To realize high-resolution timing analysis, the jitter is reconstructed on a low-speed signal and jitter measurements are made on this signal instead of the original high-speed signal. The reconstructed jitter on the low-speed signal occurs on a proportionately larger time-scale as opposed to the original jitter on the high-speed signal. Consequently, the jitter on the low-speed signal can be measured easily using conventional jitter measurement techniques and mapped back to its corresponding value relative to the high-speed signal. The approach allows one or two orders of magnitude smaller jitter values to be measured than standard jitter measurement techniques available today. The proposed hardware is easily implemented as a front-end to any existing jitter measurement system. Simulation data and hardware measurements are presented to prove the viability of the proposed scheme.
PROFER: predictive, robust finite-state parsing for spoken language
Authors: E. C. Kaiser
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

The natural language processing component of a speech understanding system is commonly a robust, semantic parser, implemented as either a chart-based transition network, or as a generalized left-right (GLR) parser. In contrast, we are developing a robust, semantic parser that is a single, predictive finite-state machine. Our approach is motivated by our belief that such a finite-state parser can ultimately provide an efficient vehicle for tightly integrating higher-level linguistic knowledge into speech recognition. We report on our development of this parser, with an example of its use, and a description of how it compares to both finite-state predictors and chart-based semantic parsers, while combining the elements of both.
A Generative Approach to the Development of Autonomous Robot Software
Authors: Philipp A. Baer, Roland Reichle, Michael Zapf, Thomas Weise, Kurt Geihs
Venue: Proceedings of the Fourth IEEE International Workshop on Engineering of Autonomic and Autonomous Systems (2007)

The integration of new or existing software components into established architectures and the ability to deal with heterogeneity are key requirements for middleware and development frameworks for robotic systems. This paper presents SPICA, a software development framework for communication infrastructures of autonomous mobile robots. Utilizing the model-driven software development paradigm, communication and data flow can be defined on an abstract level. For this purpose, domain-specific languages and tools are provided that allow specification and generation of module communication infrastructures for communication between modules along with primitives for data management. The high-level platform-independent specifications are automatically transformed into low-level platform and programming language-specific source code. We illustrate the applicability of our approach with an elaborate example describing the design of a soccer robot architecture that has proven its strength during RoboCup 2006. Our experiences have revealed that SPICA is advantageous for prototyping as well as for building high performance systems.
Defining a Process Model for Forensic Analysis of Digital Devices and Storage Media
Authors: Michael W. Andrew
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

There are three components of the overall digital forensic process defined by current industry standards; acquisition, preservation, and analysis. This paper explores defining a model for the analysis phase that will address legal and technical concerns surrounding the forensic analysis process.
Managing Resistance to Organizational Change: How GSS Can Reveal Role Related Resistance Behaviors
Authors: Sajda Qureshi, Alanah Davis
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Organizational change brings about a number of behaviors that are seen to run counter to the implementation of the information systems. These behaviors may be seen as jeopardizing the success of the change process and the success of the information system. This paper investigates the resistance to change using a change management game conducted with senior level employees and partners of a top four consulting company. While the task was based on a real organizational transformation, the participants were also going through the same real experiences. Following analysis of resistance to change behaviors, this paper provides insight into the ways in which resistance to change can be mitigated. The contribution of this paper is in the discovery of change management behaviors as they relate to organizational transformation and information systems development.
Maximum likelihood discriminant feature spaces
Authors: G. Saon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Linear discriminant analysis (LDA) is known to be inappropriate for the case of classes with unequal sample covariances. There has been an interest in generalizing LDA to heteroscedastic discriminant analysis (HDA) by removing the equal within-class covariance constraint. This paper presents a new approach to HDA by defining an objective function which maximizes the class discrimination in the projected subspace while ignoring the rejected dimensions. Moreover, we investigate the link between discrimination and the likelihood of the projected samples and show that HDA can be viewed as a constrained ML projection for a full covariance Gaussian model, the constraint being given by the maximization of the projected between-class scatter volume. It is shown that, under diagonal covariance Gaussian modeling constraints, applying a diagonalizing linear transformation (MLLT) to the HDA space results in increased classification accuracy even though HDA alone actually degrades the recognition performance. Experiments performed on the Switchboard and Voicemail databases show a 10%-13% relative improvement in the word error rate over standard cepstral processing.
Non-isometric manifold learning: analysis and an algorithm
Authors: Piotr Dollár, Vincent Rabaud, Serge Belongie
Venue: Proceedings of the 24th international conference on Machine learning (2007)

In this work we take a novel view of nonlinear manifold learning. Usually, manifold learning is formulated in terms of finding an embedding or 'unrolling' of a manifold into a lower dimensional space. Instead, we treat it as the problem of learning a representation of a nonlinear, possibly non-isometric manifold that allows for the manipulation of novel points. Central to this view of manifold learning is the concept of generalization beyond the training data. Drawing on concepts from supervised learning, we establish a framework for studying the problems of model assessment, model complexity, and model selection for manifold learning. We present an extension of a recent algorithm, Locally Smooth Manifold Learning (LSML), and show it has good generalization properties. LSML learns a representation of a manifold or family of related manifolds and can be used for computing geodesic distances, finding the projection of a point onto a manifold, recovering a manifold from points corrupted by noise, generating novel points on a manifold, and more.
The On-Line Heilbronn's Triangle Problem in d Dimensions
Authors: Gill Barequet, Alina Shaikhet
Venue: Discrete Computational Geometry (2007)

In this paper we show a lower bound for the on-line version of Heilbronn's triangle problem in d dimensions. Specifically, we provide an incremental construction for positioning n points in the d-dimensional unit cube, for which every simplex defined by d + 1 of these points has volume &#x03a9;(1/n(d+1)ln(d-2)-0.265 d+2.269) (for d &#x2265; 5).
Analytical development of the MMAXNLMS algorithm
Authors: M. I. Haddad
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

In this paper an adaptive algorithm with reduced complexity is analysed for the white Gaussian input case. The new analysis is extended for the proposed case where updating includes more than one component of the weight vector. The new algorithm, which updates the weights corresponding to the element sizes of the data vector with the largest magnitude, is compared with the case where the updated weights are chosen randomly according to a uniform density function. Analysis is performed for both cases and the results are verified via computer simulations.
Cross-Platform Development: Software that Lasts
Authors: Judith Bishop, Nigel Horspool
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

The design of software that is easy to port or deliberately targeted for multiple platforms is a neglected area of software engineering. A promising solution is to link components and toolkits through XML and reflection.
Multimedia teaching tools for an introductory circuit analysis course
Authors: J.-P. R. Bayard
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The paper discusses the use of computer technology as a tool for increasing access to and quality of our electrical engineering program at the California State University, Sacramento. Using readily available software and Internet access, a comprehensive set of lecture materials, student exercises and basic laboratory demonstrations are produced in electronic format in order to promote learning, reinforcement and consistency. While the central focus of this work is on learning, the convenience aspect of this method of delivery has proven to be effective tool for increasing performance as well as enrolment.
A fast, sequential decoding algorithm with application to speaker verification
Authors: Qi Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

To implement speaker verification (SV) technology for real-world applications with a large user population, the system cost becomes an important issue. One needs a fast algorithm which can support more users in a central telephone switch given the limited hardware, or can reduce the hardware requirement on a wireless handset. Li (see Proc. Int'l. Conf. on Spoken Language Processing, Sydney, 1998) proposed a fast, sequential decoding algorithm for left-to-right HMM. The algorithm is based on a sequential detection scheme which is asymptotically optimal in the sense of detecting a possible change in distribution as reliably and quickly as possible. In this paper, the algorithm is evaluated in a fixed-phrase SV system on a database with 23,578 utterances recorded from 100 speakers. The experimental results show that the decoding speed of the proposed algorithm is about 7 to 10 times faster than the Viterbi algorithm while the accuracy is in an acceptable level. The results indicate that the proposed algorithm can also be applied to speaker identification, utterance verification, audio segmentation, voice/silence detection and many other applications.
The benefit of stochastic PP attachment to a rule-based parser
Authors: Kilian A. Foth, Wolfgang Menzel
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

To study PP attachment disambiguation as a benchmark for empirical methods in natural language processing it has often been reduced to a binary decision problem (between verb or noun attachment) in a particular syntactic configuration. A parser, however, must solve the more general task of deciding between more than two alternatives in many different contexts. We combine the attachment predictions made by a simple model of lexical attraction with a full-fledged parser of German to determine the actual benefit of the subtask to parsing. We show that the combination of data-driven and rule-based components can reduce the number of all parsing errors by 14% and raise the attachment accuracy for dependency parsing of German to an unprecedented 92%.