A new Logic Pulser in a probe package injects pulses onto digital circuit nodes without dis connecting 1C outputs. A new Logic Probe detects pulses, high and low levels, and open circuits or bad levels.

Despite the widespread use of exploratory factor analysis in psychological research, researchers often make questionable decisions when conducting these analyses. This article reviews the major design and analytical decisions that must be made when conducting a factor analysis and notes that each

We collected a corpus of parallel text in 11 languages from the proceedings of the European Parliament, which are published on the web 1. This corpus has found widespread use in the NLP community. Here, we focus on its acquisition and its application as training data for statistical machine

Abstract. In spite of the fact that OCL and UML evolved simultaneously, the usage of the constraint language in modeling real-world applications has been insignificant compared to the usage of the graphical language. Presently, OCL is requested in new modeling approaches: Model Driven Architecture, Model Driven Development, Domain Specific Languages, Aspect Oriented Modeling, and various emerging technologies: Semantic Web, Business Rules. In this context, the question What has to be done for OCL to become the rule, not the exception, in the modeling domain? is more pressing than ever. The purpose of this paper is to propose an answer to this question, although not a complete one. Our work is an attempt to synchronize the language specification and its understanding, straight related to the language implementation in CASE tools, by proposing solutions for incomplete or non-deterministic OCL specifications. In order to manage the new extensions required for the constraint language, a new language structure is suggested.

Abstract. The Nelder–Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical results have been proved explicitly for the Nelder–Mead algorithm. This paper

Our capabilities of both generating and collecting data have been increasing rapidly in the last several decades. Contributing factors include the widespread use of bar codes for most commercial products, the computerization of many business, scientific and government transactions and managements

Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available

embryonic stem cells and fetal fibroblasts, along with comparative analysis of messenger RNA and small RNA components of the transcriptome, several histone modifications, and sites of DNA-protein interaction for several key regulatory factors. Widespread differences were identified in the composition

. Despite the widespread use of error correcting codes in many fields of information processing, and a general consensus on the usefulness of FEC techniques within some of the Internet protocols, very few actual implementations exist of the latter. This probably derives from the different types

Research on ontology is becoming increasingly widespread in the computer science community, and its importance is being recognized in a multiplicity of research fields and application areas, including knowledge engineering, database design and integration, information retrieval and extraction. We