ppxscal/embedding_network huggingface dataset:
Compound Sequential Probability Ratio Test for the Classification of Statistically Dependent Patterns
Authors: A. B. S. Hussain
Venue: IEEE Transactions on Computers (1974)

A sequential test procedure for the classification of statistically dependent patterns is developed. The test is based on the optimum (Bayes) compound decision theory and the theory of Wald's sequential probability ratio test (SPRT). The compound sequential probability ratio (SPRT) is shown to be recursively computable at every instant of the decision process. A two-class recognition problem with first-order Markov dependence among the pattern classes is considered for the purpose of comparing the performance of the CSPRT with that of Wald's SPRT. It is shown that when the pattern classes are statistically dependent the CSPRT requires, on the average, fewer features per pattern than Wald's equally reliable SPRT. Finally, the results of computer simulated recognition experiments using CSPRT and other sequential and nonsequential decision schemes are discussed in detail.
An Architecture for Combined Test Data Compression and Abort-on-Fail Test
Authors: Erik Larsson, Jon Persson
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The low throughput at IC (Integrated Circuit) testing is mainly due to the increasing test data volume, which leads to high ATE (Automatic Test Equipment) memory requirements and long test application times. In contrast to previous approaches that address either test data compression or abort-on-fail testing, we propose an architecture for combined test data compression and abort-on-fail testing. The architecture improves throughput through multi-site testing as the ATE memory requirement is constant and independent of the degree of multi-site testing. For flexibility in modifying the test data at any time, we make use of a test program for decompression; only test independent evaluation logic is added to the IC. Major advantages compared to MISR (Multiple-Input Signature Register) based schemes are that our scheme (1) allows abort-on-fail testing at clock-cycle granularity, (2) does not impact diagnostic capabilities, and (3) needs no special care for the handling of unknowns (X).
An integrated visualization of a smart camera based distributed surveillance system
Authors: Sven Fleck, Christian Vollrath, Florian Walter, Wolfgang Straßer
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Surveillance systems based on distributed sensor networks are massively emerging today, as the interest in enhanced safety in this ever changing world gets more actual than ever. Traditional "CCTV" surveillance systems with their centralized processing (compression) and recording architecture together with a simple multi-monitor visualization of the raw video streams bear several drawbacks and limitations. The necessary communication bandwidth to each camera and the computational requirements on the centralized servers strongly limit such systems in terms of the expandability, installation size (cable lengths) and spatial/temporal resolution of each camera. Additionally, the visualization is counter intuitive and fatiguing due to the massive load of raw video data. We present a distributed network of smart cameras and its integrated visualization. The smart cameras' tracking results are embedded in a common 3D environment as live textures and can be viewed from arbitrary perspectives. Also a georeferenced live visualization embedded in Google Earth is presented. This offers a visualization more abstract from the camera perspective yet more intuitive in terms of integration.
An Unsupervised Approach for Segmentation and Clustering of Soccer Players
Authors: P. Spagnolo, N. Mosca, M. Nitti, A. Distante
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

In this work we consider the problem of soccer team discrimination. The approach we propose starts from the monocular images acquired by a still camera. The first step is the soccer player detection, performed by means of background subtraction. An algorithm based on pixels energy content has been implemented in order to detect moving objects. The use of energy information, combined with a temporal sliding window procedure, allows to be substantially independent from motion hypothesis. Colour histograms in RGB space are extracted from each player, and provided to the unsupervised classification phase. This is composed by two distinct modules: firstly, a modified version of the BSAS clustering algorithm builds the clusters for each class of objects. Then, at runtime, each player is classified by evaluating its distance, in the features space, from the classes previously detected. Algorithms have been tested on different real soccer matches of the Italian Serie A.
Finding dense and isolated submarkets in a sponsored search spending graph
Authors: Kevin J. Lang, Reid Andersen
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Methods for improving sponsored search revenue are often tested or deployed within a small submarket of the larger marketplace. For many applications, the ideal submarket contains a small number of nodes, a large amount of spending within the submarket, and a small amount of spending leaving the submarket. We introduce an efficient algorithm for finding submarkets that are optimal for a user-specified tradeoff between these three quantities. We apply our algorithm to find submarkets that are both dense and isolated in a large spending graph from Yahoo! sponsored search.
Application of Protégé and SPARQL in the Field of Project Knowledge Management
Authors: Hai Dong, Farookh Khadeer Hussain, Elizabeth Chang
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Protégé is a set of open-source ontology design software developed in Stanford Medical Informatics. SPARQL (Protocol and RDF Query Language) is recommended by W3C, to represent the RDF (Resource Description Framework) graph -- a set of triples that consist of a subject, a predicate and an object as the basic expression of data stored in OWL-based knowledge base. In this paper, we propose an ontology-based project knowledge management methodology, by means of Protégé and SPARQL, to solve the issues in project management activities. By introducing a set of new ontology notations, we present the conceptual model of our ontology to realize the function of knowledge management in project organizations. Following that, we realize the prototype in Protégé and validate it by means of SPARQL. Finally we make comments on our project and plan our future work.
CodeSnippets Plug-in to Eclipse: Introducing Web 2.0 Tagging to Improve Software Developer Recall
Authors: Andrew Forward, Timothy Lethbridge, Dwight Deugo
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Putting aside the marketing hype of Web2.0, a few central themes have emerged: user generated content, software to enable users (not restrict them), building a community and instant feedback. Many of these concepts can equally apply to rich client applications and a focus on software development teams. The initial motivation for Code Snippets was to fulfill the personal needs of software developers. At times, they need to reuse the same coding constructs, library access, method calls, and web services. Recalling (or finding) this information is sometimes difficult. Drawing on similar success as online tagging libraries like del.icio.us and flickr.com, we have developed an Eclipse plug-in called CodeSnippets that allows software teams to document, store, share and search communal code to help answer the question, "How do I code that?".
Modeling Data Centers as Economic Markets for Dynamic Service Provisioning and Resource Management
Authors: David Cohen, Stuart Schaefer
Venue: Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing (2006)

Within the computing industry the recent shift in emphasis to Service-Orientation gives rise to the question: how does delivering computation as a service differ from the way we deliver it today? Simultaneously, there has been a corresponding shift to scale-out, commodity computing platforms which has opened a significant gap in terms of control. To date, the management of services in the Enterprise has been left to software developers, who must address the requisite capabilities in isolation. In this paper we propose an approach to allocating a shared pool of physical host computers through the employ of future and spot market semantics. The approach treats computation as a fungible resource whose ownership can be freely exchanged amongst market participants. These methods have been implemented as the Virtual Service Switch which we will present here.
An EM Based Algorithm for Skew Detection
Authors: A. Egozi, I. Dinstein, J. Chapran, M. Fairhurst
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

We present a a statistical approach to skew detection, where the textual features of a document image are mod- eled as a mixture of straight lines in Gaussian noise. The EM algorithm is used to estimate the parameters of the mix- ture model and the skew angle estimate is extracted from the estimated parameters. Experiments prove that our method has some advantages over other existing methods in terms of accuracy and efficiency.
An Incremental Approach for Niching and Building Block Detection via Clustering
Authors: Leonardo Ramos Emmendorfer, Aurora Trinidad Ramirez Pozo
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Diversity preservation has already been established as an important concern for evolutionaly computation. Clus- tering techniques were, among others, successfully applied to this purpose. Another important aspect of the research on evolutiomly computation is related to linkage learning - the detection of the problem structure avoiding disruption of building blocks when new individuals are generated. This paper presents a novel approach which is a nav estimation of distribution algorithm (EDA) where clustering plays two robs: diversity preservation and linkage learning. Initial empirical investigations illustrate the behmior of the algo- rithm when solving two benchmark optimization problems. 1.
A new identification method for use in nonlinear prediction
Authors: Felipe Montoya, Aldo Cipriano, María Ramos
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

This paper presents a new identification method for fuzzy models used in nonlinear prediction. The structure and parameters of the fuzzy model are obtained, using input-output data, by minimization of the prediction error. The predictive capacity of the fuzzy model is compared with other linear and non-linear models analyzing an illustrative example. The results show that the new method presents a better behavior.
Parallel unsymmetric-pattern multifrontal sparse LU with column preordering
Authors: Haim Avron, Gil Shklarski, Sivan Toledo
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

We present a new parallel sparse LU factorization algorithm and code. The algorithm uses a column-preordering partial-pivoting unsymmetric-pattern multifrontal approach. Our baseline sequential algorithm is based on UMFPACK 4, but is somewhat simpler and is often somewhat faster than UMFPACK version 4.0. Our parallel algorithm is designed for shared-memory machines with a small or moderate number of processors (we tested it on up to 32 processors). We experimentally compare our algorithm with SuperLU_MT, an existing shared-memory sparse LU factorization with partial pivoting. SuperLU_MT scales better than our new algorithm, but our algorithm is more reliable and is usually faster. More specifically, on matrices that are costly to factor, our algorithm is usually faster on up to 4 processors, and is usually faster on 8 and 16. We were not able to run SuperLU_MT on 32. The main contribution of this article is showing that the column-preordering partial-pivoting unsymmetric-pattern multifrontal approach, developed as a sequential algorithm by Davis in several recent versions of UMFPACK, can be effectively parallelized.
Guest Editors' Introduction: The State of the Art in Nanoscale CAD
Authors: Fabrizio Lombardi, Cecilia Metra
Venue: IEEE Design Test (2007)

Because of very small feature size, high integration levels, and innovative computational features, new concerns are emerging regarding the implementation of computing systems, leading to increased interest in nanoscale technology. Continued scaling of current top-down trends suggests the need for features measured in the nanometer range. As new techniques to synthesize nanostructures from the bottom up emerge, design practice will require CAD as a framework. Moreover, new tools are necessary for VLSI so that designers can assess the different capabilities for assembling devices into circuits and systems. The design of nanoscale systems is inherently complex and must consider phenomena such as statistical and probabilistic behavior, as well as reduction of parasitic effects. Tools are a necessity to ensure that emerging technologies will move into industry for full commercialization. The convergence of such issues will make CAD at the nanoscale level a vibrant, challenging topic for many years to come. This special section presents a timely account of the state of the art in this area, with emphasis on tools and related frameworks.
A Biologically Motivated Chip and Its Application to the Analysis of Weight Change of Prematurely Born Babies
Authors: Tzu-Lan Lin, Yo-Hsien Lin, Jong-Chen Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Prematurely born babies usually suffer from nutrition deficiency. Total parental nutrition (TPN) has been one of the major treatments commonly used by clinicians to improve the nutritional needs of prematurely born babies. This paper described the application of an artificial neuromolecluar (ANM) chip to a database of prematurely born babies who were treated with TPN. The objective was to investigate the weight changes of these babies from the data of physical examination, laboratory tests, and TPN elements. Experimental results showed that the ANM chip achieved satisfactory results, outperforming both the back-propagation neural networks and SAS (a statistical tool). Out of our expectation, the result was even better than that of human judgment, suggesting that it could be used as an assisting tool to clinicians.
Hybrid Computation Techniques Inferred from Functional Analysis
Authors: C. K. Sanathanan, J. D. Ferguson
Venue: IEEE Transactions on Computers (1971)

The research reported in this paper is concerned with the use of functional analysis and operator theory in providing insights into iterative computational methods. The computational methods are discussed in the context of obtaining the closed-loop response of a complex feedback system on a hybrid computer. The need for iterative solution arises in problems in which the feedback cannot be computed instantaneously, for instance, when there are partial differential equations, and/or where there is a large number of arithmetic and logical operations. The tools of functional analysis are used to devise computational schemes with improved convergence properties.
Dielectric resonator method for measuring the electrical conductivity of carbon nanotubes from microwave to millimeter frequencies
Authors: James Baker-Jarvis, Michael D. Janezic, John H. Lehman
Venue: Journal of Nanomaterials (2007)

We describe a dielectric resonator-based measurement method for determining the electrical conductivity of carbon nanotubes at microwave to millimeter frequencies. This measurement method is not limited by the metal conductor contact resistances or impedance mismatch commonly encountered in the measurement of single nanotubes. The measurement of carbon nanotubes yielded conductivities of approximately 0.08 × 107 S/m.
Handheld AR indoor guidance system using vision technique
Authors: Eunsoo Jung, Sujin Oh, Yanghee Nam
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

We present a mobile augmented reality (AR) system for indoor guidance where we apply vision technique without using markers. There are two main problems: First, to augment suitable information according to users situation, it has to be identified which place the user belongs to. Second, to put information into the scene and to make it aligned with the target scene element, the basic structure of the augmenting space should be grasped. For place recognition in real time mobile system, we employ simple feature detection method combined with graph based spatial connectivity representation. Also, Image-based analysis method is applied to interpret the basic scene structure from the video.
A Camera Calibration Strategy in the Video-based Traffic Information Detection
Authors: Yu Yuan, Jiang Dan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper an improved camera calibration algorithm is applied to the video-based traffic information detection. The geometric camera model is set up based on the pin-hole model and Direct Linear Transformation (DLT). Adopting the coplanar condition, we estimate parameters of the model and realize the transform from image coordinates to world coordinates in the end. The problem of control points is discussed. In our experiment, the algorithm has the advantage of high-accuracy and its parameters can be easily estimated. It is proved that the algorithm could meet the requirement of calibration accuracy in the application of the video-based traffic information detection.
On Basic Groups and Basic Semi-groups in Partial Multiple-Valued Logic
Authors: Renren Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper, the decision problem of basic groups and basic semi-groups in partial multiple-valued logic is solved; meanwhile, it is proved that the precomplete classes which include non-trivial unary semi-group are fully determined by singular semi-group.
Adaptive technology for e-learning: principles and case studies of an emerging field
Authors: Kathleen Scalise, Diana J. Bernbaum, Mike Timms, S. Veeragoudar Harrell, Kristen Burmester, Cathleen A. Kennedy, Mark Wilson
Venue: Journal of the American Society for Information Science and Technology (2007)

This article discusses the rapidly emerging field of computer-based assessment for adaptive content in e-learning (National Research Council, 2001), which we call differentiated e-learning. In e-learning products, a variety of assessment approaches are being used for such diverse purposes as adaptive delivery of content, individualizing learning materials, dynamic feedback, cognitive diagnosis, score reporting, and course placement (Gifford, 2001). A recent paper at the General Teaching Council Conference in London, England, on teaching, learning, and accountability described assessment for personalized learning through e-learning products as a &ldquo;quiet revolution&rdquo; taking place in education (Hopkins, 2004). In our study, we examine approaches for the use of assessment evidence in e-learning in four case studies. The products in the case studies were selected for exhibiting at least one exemplary aspect regarding assessment and measurement. The principles of the Berkeley Evaluation & Assessment Research Center Assessment System (Wilson & Sloane, 2000) are used as a framework of analysis for these products with respect to key measurement principles. &copy; 2007 Wiley Periodicals, Inc.
A Survey of High-Level Language Machines in Japan
Authors: M. Yamamoto
Venue: Computer (1981)

Japanese universities and laboratories have developed a number of experimental HLL machines. The appearance of commercial machines and confirmation of their effectiveness is expected soon.
Study on Cell Cluster Splitting
Authors: W. Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In the filed of biomedical engineering, it is often to use image technique for cell analysis. To recognize cells, one basic and hardest task is for cell delineation, and the cell clusters must be decomposed. In this paper, a novel algorithm based on shape information is proposed for splitting cell clusters. In the algorithm, it integrates morphological smoothing with holes filling in a pre-processing stage. Then the cell clusters are identified through a polygon approximation. Finally the cluster decompose is implemented, which consists of the detecting concave points on the contours and determining the decomposing lines. The algorithm can not only split the simple cell clusters, but also complicated clusters. In addition, this algorithm can be adopted for other applications, where separation between touching and overlapping particles is required.
A security architecture for pay-per-view business models in conditional access systems
Authors: Bart Kirkels, Martijn Maas, Peter Roelse
Venue: Proceedings of the 2007 ACM workshop on Digital Rights Management (2007)

This paper presents a security architecture for a pay-TV conditional access system, assuming the most challenging scenario from a designer's point of view; a pay-per-view business model in a broadcast-only environment. The starting point for the security architecture is a broadcast encryption scheme and a queueing network for injecting conditional access messages into the broadcast stream. Design constraints related to a conditional access client are taken into account in the design of the architecture, as well as a maximum amount of bandwidth available for the transmission of conditional access messages. In addition, commercial design objectives like quick content access and quick client activation are also addressed. A substantial part of the paper is devoted to the design and analysis of an efficient injector model based on queueing theory, defining the strategy for injecting conditional access messages into the broadcast stream. A numerical example with real-world values of the parameters is used to demonstrate the effectiveness of the presented approach.
Verification of C Programs Using Automated Reasoning
Authors: David Crocker, Judith Carlton
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Much of the embedded software development market has necessarily tight constraints on program size and processor power, hence developers use handwritten C rather than autocode. They rely primarily on testing to find errors in their code. We have an established software development tool known commercially as Perfect Developer, which uses a powerful automatic theorem prover and inference engine to reason about requirements and specifications. We have found that automated reasoning can be used to discharge a very high proportion of verification conditions arising from the specification and refinement of software components described in our formal specification language, Perfect. The Perfect Developer tool set can also generate code in a C++ subset or in Java, and the output code is then virtually certain to meet the stated specification, reducing the need for exhaustive testing. However, this is not helpful to developers of embedded software who are constrained to write code by hand. We therefore decided to investigate whether automated reasoning could provide a similar degree of success in the verification of annotated C code. We present our preliminary findings.