ppxscal/embedding_network huggingface dataset:
Free-Form Object Reconstruction from Silhouettes, Occluding Edges and Texture Edges: A Unified and Robust Operator Based on Duality
Authors: Shubao Liu, Kongbin Kang, Jean-Philippe Tarel, David B. Cooper
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

In this paper, the duality in differential form is developed between a 3D primal surface and its dual manifold formed by the surface’s tangent planes, i.e., each tangent plane of the primal surface is represented as a four-dimensional vector which constitutes a point on the dual manifold. The iterated dual theorem shows that each tangent plane of the dual manifold corresponds to a point on the original 3D surface, i.e., the “dual” of the “dual” goes back to the “primal”. This theorem can be directly used to reconstruct 3D surface from image edges by estimating the dual manifold from these edges. In this paper we further develop the work in our original conference papers resulting in the robust differential dual operator. We argue that the operator makes good use of the information available in the image data, by using both points of intensity discontinuity and their edge directions; we provide a simple physical interpretation of what the abstract algorithm is actually estimating and why it makes sense in terms of estimation accuracy; our algorithm operates on all edges in the images, including silhouette edges, self occlusion edges, and texture edges, without distinguishing their types (thus resulting in improved accuracy and handling locally concave surface estimation if texture edges are present); the algorithm automatically handles various degeneracies; and the algorithm incorporates new methodologies for implementing the required operations such as appropriately relating edges in pairs of images, evaluating and using the algorithm’s sensitivity to noise to determine the accuracy of an estimated 3D point. Experiments with both synthetic and real images demonstrate that the operator is accurate, robust to degeneracies and noise, and general for reconstructing free-form objects from occluding edges and texture edges detected in calibrated images or video sequences.
Robust Analog Circuit Sizing Using Ellipsoid Method and Affine Arithmetic
Authors: Xuexin Liu, Wai-Shing Luk, Yu Song, Pushan Tang, Xuan Zeng
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Analog circuit sizing under process/parameter variations is formulated as a mini-max geometric programming problem. To tackle such problem, we present a new method that combines the ellipsoidmethod and affine arithmetic. Affine arithmetic is not only used for keeping tracks of variations and correlations, but also helps to determine the sub-gradient at each iteration of the ellipsoid method. An example of designing a CMOS operational amplifier is given to demonstrate the effectiveness of the proposed method. Finally numerical results are verified by SPICE simulation.
Novices' progress in introductory programming courses
Authors: Linda Mannila
Venue: Informatics in education (2007)

This paper presents an approach for educators to evaluate student progress throughout a course, and not merely based on a final exam. We introduce progress reports and describe how these can be used as a tool to evaluate student learning and understanding during programming courses. Complemented with data from surveys and the exam, the progress reports can be used to build an overall picture of individual student progress in a course, and to answer questions related to how students (1) understand program code as a whole, (2) understand individual constructs, and (3) perceive the difficulty level of different programming topics. We also present results from using this approach in introductory programming courses at secondary level. Our initial experience from using the progress reports is positive, as they provide valuable information during the course, which most likely would remain uncovered otherwise.
Qualitative Logics and Equivalences for Probabilistic Systems
Authors: Luca de Alfaro, Krishnendu Chatterjee, Marco Faella, Axel Legay
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

We present Qualitative Randomized CTL (QRCTL), a qualitative version of pCTL, for specifying properties of Markov Decision Processes (MDPs). QRCTL formulas can express the fact that certain temporal properties hold with probability 0 or 1, but they do not distinguish other probabilities values. We present a symbolic, polynomial time model-checking algorithm for QRCTL on MDPs. Then, we study the equivalence relation induced by QRCTL, called qualitative equivalence. We show that for finite alternating MDPs, where nondeterministic and probabilistic choice occur in different states, qualitative equivalence coincides with alternating bisimulation, and can thus be computed via efficient partition-refinement algorithms. Surprisingly, the result does not hold for non-alternating MDPs. Indeed, we show that no local partition refinement algorithm can compute qualitative equivalence on non-alternating MDPs. Finally, we consider QRCTL*, that is the "star extension" of QRCTL. We show that QRCTL and QRCTL* induce the same qualitative equivalence on alternating MDPs, while on non-alternating MDPs, the equivalence arising from QRCTL* can be strictly finer. We also provide a full characterization of the relation between qualitative equivalence, bisimulation, and alternating bisimulation, according to whether the MDPs are finite, and to whether their transition relations are finite-branching.
Using learning to facilitate the evolution of features for recognizing visual concepts
Authors: J. Bala, K. De Jong, J. Huang, H. Vafaie, H. Wechsler
Venue: Evolutionary Computation (1996)

This paper describes a hybrid methodology that integrates genetic algorithms (GAs) and decision tree learning in order to evolve useful subsets of discriminatory features for recognizing complex visual concepts. A GA is used to search the space of all possible subsets of a large set of candidate discrimination features. Candidate feature subsets are evaluated by using C4.5, a decision tree learning algorithm, to produce a decision tree based on the given features using a limited amount of training data. The classification performance of the resulting decision tree on unseen testing data is used as the fitness of the underlying feature subset. Experimental results are presented to show how increasing the amount of learning significantly improves feature set evolution for difficult visual recognition problems involving satellite and facial image data. In addition, we also report on the extent to which other more subtle aspects of the Baldwin effect are exhibited by the system.
On Behavioral Metric for Probabilistic Systems: Definition and Approximation Algorithm
Authors: Taolue Chen, Tingting Han, Jian Lu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper, we consider the behavioral pseu- dometrics for probabilistic systems. The model we are interested in is probabilistic automata, which are based on state transition systems and make a clear distinction between probabilistic and nondeterministic choices. The pseudometrics are defined as the greatest fixpoint of a monotonic functional on the complete lat- tice of state metrics. A distinguished characteristic of this pseudometric lies in that it does not discount the future, which addresses some algorithmic challenges to compute the distance of two states in the model. We solve this problem by providing an approximation al- gorithm: up to any desired degree of accuracy , the distance can be approximated to within in time ex- ponential in the size of the model and logarithmic in 1 . A key ingredient of our algorithm is to express a pseudometric being a post-fixpoint as the elementary sentence over real closed fields, which allows us to ex- ploit Tarski's decision procedure, together with binary search to approximate the behavioral distance.
Verifying the Mondex Case Study
Authors: Peter H. Schmitt, Isabel Tonin
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

The Mondex Case study is still the most substantial contribution to the Grand Challenge repository. It has been the target of a number of formal verification efforts. Those efforts concentrated on correctness proofs for refinement steps of the specification in various specification formalisms using different verification tools. In this paper we report on a Java Card implementation of the Mondex protocol and on proving its correctness using the KeY tool. The security properties to be proved are formalised in the Java Modelling Language and follow as closely as possible the concrete layer of the previous Z specification. This work demonstrates that with an appropriate specification language and verification tool, it is possible to bridge the gap between specification and implementation ensuring a fully verified result.
Collective Media Annotation using Undirected Random Field Models
Authors: Matthew Cooper
Venue: Proceedings of the International Conference on Semantic Computing (2007)

We present methods for semantic annotation of multimedia data. The goal is to detect semantic attributes (also referred to as concepts) in clips of video via analysis of a single keyframe or set of frames. The proposed methods integrate high performance discriminative single concept detectors in a random field model for collective multiple concept detection. Furthermore, we describe a generic framework for semantic media classification capable of capturing arbitrary complex dependencies between the semantic concepts. Finally, we present initial experimental results comparing the proposed approach to existing methods.
The Refinement Paradigm: The Interaction of Coding and Efficiency Knowledge in Program Synthesis
Authors: E. Kant
Venue: IEEE Transactions on Software Engineering (1981)

A refinement paradigm for implementing a high-level specification in a low-level target language is discussed. In this paradigm, coding and analysis knowledge work together to produce an efficient program in the target language. Since there are many possible implementations for a given specification of a program, searching knowledge is applied to increase the efficiency of the process of finding a good implementation. For example, analysis knowledge is applied to determine upper and lower cost bounds on alternate implementations, and these bounds are used to measure the potential impact of different design decisions and to decide which alternatives should be pursued. In this paper we also describe a particular implementation of this program synthesis paradigm, called PSI/SYN, that has automatically implemented a number of programs in the domain of symbolic processing.
Keynote Speech 1: New Paths for Test
Authors: Jacob Abraham
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Test techniques for screening defective integrated circuits (ICs) after manufacture have to consider potential defects as well as the cost. In the future, test must deal with trends including advances in IC technology which continue to reduce feature sizes, the fact that mixed-signal systems on a chip are becoming a larger fraction of the semiconductor market, and very high transistor densities as well as new transistor technologies which loom over the horizon. This talk will explore the significant impact that these trends will have on the future of test. Test approaches for digital circuits have to deal with failures which are no longer just logic level, and test techniques have to address embedded mixed-signal and RF modules. In addition, with the very large number of potential devices on a chip, test will have to begin to address tolerating defects or on-chip repair for reasonable yields. Some possible directions which show promising solutions to these problems will also be described.
A non-contact mouse for surgeon-computer interaction
Authors: C. Grätzel, T. Fong, S. Grange, C. Baur
Venue: Technology and Health Care (2004)

We have developed a system that uses computer vision to replace standard computer mouse functions with hand gestures. The system is designed to enable non-contact human-computer interaction (HCI), so that surgeons will be able to make more effective use of computers during surgery. In this paper, we begin by discussing the need for non-contact computer interfaces in the operating room. We then describe the design of our non-contact mouse system, focusing on the techniques used for hand detection, tracking, and gesture recognition. Finally, we present preliminary results from testing and planned future work.
Mapping users' perspectives and outlining social impacts from digitalization of terrestrial TV in Brazil
Authors: Giovanni M. de Holanda, Ismael M. A. Ávila, Ricardo B. Martins
Venue: Telematics and Informatics (2008)

The digital divide has numerous aspects and is as dynamic as the technology industry is able to develop and disseminate new ICTs and services, thus increasing or creating new gaps among the more advanced societies and those still hampered by social and economic problems. In developing countries the diffusion of new technologies is often hindered by factors such as insufficient income, deficient infrastructure, cultural barriers and lack of information. Brazil is no exception to that rule, and all information and communication technologies (ICT) diffusion surveys undertaken to date confirm the trend that digital exclusion is following the dreadful pattern of social exclusion. The income disparities in Brazil are very severe and, also due to the country's huge territory and complex geographical and cultural formations, a technological innovation is seldom capable of reaching the population as a whole and benefiting the entire society. One outstanding exception is the terrestrial (free-to-air) TV, which, after about 50 years since its introduction, has reached an adoption rate of more than 90%, and now covers the whole country, with enormous sociocultural consequences. In view of this, and with the objective of addressing the problem of digital exclusion, the Brazilian Government has devised the deployment of digital terrestrial television-DTT-as a singular opportunity to reduce the digital divide and to promote the access of the population to interactive and citizenship services through an already familiar interface, thus avoiding or reducing cultural constraints and illiteracy barriers usually posed by other ICTs. This study undertakes a comprehensive discussion of that policy and its effects, and provides some data to support the strategy: the results of two interrelated studies; one that maps TV users' characteristics and expectations regarding digital TV, and another that models the social network effects on the diffusion of DTT into Brazilian society and the users' behavior when facing the new media, namely, an agent-based modeling and simulation-ABMS. The model uses the mapping information as input to test some hypothetical scenarios in the diffusion process, so as to identify factors that affect the overall diffusion process. All these studies are in the scope of a broader and deeper methodology for ex ante analysis.
Character-Stroke Detection for Text-Localization and Extraction
Authors: K. Subramanian, P. Natarajan, M. Decerbo, D. Castanon
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper, we present a new approach for analysis of images for text-localization and extraction. Our approach puts very few constraints on the font, size and color of text and is capable of handling both scene text and artificial text well. In this paper, we exploit two well-known features of text: approximately constant stroke width and local con- trast, and develop a fast, simple, and effective algorithm to detect character strokes. We also show how these can be used for accurate extraction and motivate some advantages of using this approach for text localization over other color- space segmentation based approaches. We analyze the per- formance of our stroke detection algorithm on images col- lected for the robust-reading competitions at ICDAR 2003.
Recognition Algorithm for Topographic Features
Authors: Naoto Harada, Takafumi Hayashi, Naru Hirata, Hirohide Demura, Noriaki Asada
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This research describes development of recognition algorithm for topographic features such as impact craters, wrinkle ridges, and grabens on Digital Terrain Models of SELENE (SELenological and Engineering Explorer). Because SELENE provides massive volumes of lunar data, its data sets require semi-automatic laborsaving analysis. We try to recognize circular and linear topographic features with General Hough Transform. Although the transform is one of the most popular techniques, this should be optimized for our targeted features. Experimental results of this algorithm show that typical craters and topographic lineaments can be extracted.
A Mathematical Framework for the Investigation of Testing
Authors: J. S. Gourlay
Venue: IEEE Transactions on Software Engineering (1983)

Testing has long been in need of mathematical underpinnings to explain its value as well as its limitations. This paper develops and applies a mathematical framework that 1) unifies previous work on the subject, 2) provides a mechanism for comparing the power of methods of testing programs based on the degree to which the methods approximate program verification, and 3) provides a reasonable and useful interpretation of the notion that successful tests increase one's confidence in the program's correctness.
Selecting a Military Computer Architecture
Authors: W. E. Burr
Venue: Computer (1977)

Selecting or even designing a computer architecture is at best as much a black art as a science. The problem is particularly difficult when one tries to choose an architecture meant to serve a very broad range of users whose present and future requirements are poorly understood. This article describes the activities of a joint Army/Navy Selection Committee, which was charged with the task of selecting a single computer architecture to be used as the basis for a new military computer family. The range of applications for military computers is broad and ill defined; how the committee tried to cope with this problem should be of interest to others who are interested in measuring, designing, or selecting computer architectures.
Improving Timing-Independent Testing of Crosstalk Using Realistic Assumptions on Delay Faults
Authors: Shahdad Irajpour, Sandeep K. Gupta, Melvin A. Breuer
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Test generation methodology previously developed for crosstalk targets in the presence of manufacturing defects and process variations results in low coverage. In this paper, under a realistic assumption about the nature of manufacturing defects, we show that by incorporating two new concepts, namely, noncriticality and delay-superiority, significantly higher coverage of targets and lower test generation and test application costs are achieved.
Improving Email Conversation Efficiency through Semantically Enhanced Email
Authors: Simon Scerri, Brian Davis, Siegfried Handschuh
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Despite persisting in popularity email is still plagued with information overload, hindering the workflow of data the user has to handle. While the revolutionization of the Web by the Semantic Web is underway, we aspire to use the same technology to enhance electronic mail with useful semantics. In so doing we will tackle one of the largest flaws of the email communication genre - the lack of shared expectations about the form and content of the interaction. This can be attributed to the lack of explicit semantics covering the context and content of exchanged email messages. Earlier research showed that email content can be captured by applying speech act theory. We will refine and extend this work to develop an ontology for email speech acts and outline non-deterministic models to support the user in deciding the best course of action upon sending or receiving an email.
Towards an agenda for EFT research
Authors: Kenneth L. Kraemer, John Leslie King
Venue: ACM SIGCAS Computers and Society (1977)

During the past decade the foundation has been laid for a major change in the payment and fund transfer system in American society. As technological advances are achieved, their application could eventually mean that the payments system will be based on digital impulses rather than on cash or paper checks. Preauthorization techniques, automated banking, and point of sale devices are already part of rapidly expanding new technology---electronic fund transfer (EFT) systems.
An Autoscale Residue Multiplier
Authors: F. J. Taylor
Venue: IEEE Transactions on Computers (1982)

Dynamic range overflow is a serious problem in residue arithmetic systems. Contemporary overflow management schemes rely on inefficient scaling operations. In this correspondence a residue scaler is architectured which inhibits dynamic range overflow. The system uses the popular three moduli set {2n-1, 2n, 2n + 1}. Using a 4K memory model, practical 12-and 18-bit autoscalers are configured. An error model for the derived residue arithmetic unit is also derived and experimentally verified.
Cooperation of Trustworthy Peers in P2P Overlay Networks
Authors: Yoshio Nakajima, Kenichi Watanabe, Alireza Goudarzi Nemati, Tomoya Enokido, Makoto Takizawa, S. Misbah Deen
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

In a fully distributed peer-to-peer (P2P) overlay network, peer processes (peers) cannot perceive where every object exists due to the scalability and openness. A peer has to obtain service through communicating with acquaintance peers. Here, acquaintance peers may hold obsolete information and may be even malicious. Hence, it is critical for a peer to identify which acquaintance is more trustworthy. In this paper, the trustworthiness of an acquaintance is defined in terms of the satisfiability and ranking factor. We define how satisfiable a requesting peer is for each type of access requests by newly taking into account the authorization. The ranking factor of an acquaintance shows how much the acquaintance is trusted by trustworthy acquaintances. The trustworthiness of each acquaintance is propagated in a peer-by-peer way. We evaluate how the ranking factors of acquaintances are changing in presence of faulty peers.
Fast Implementation of Gray-scale Morphological Matching Measurement
Authors: Wu Wei, Zhu Guangxi, Chen Yunfeng
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper describes a fast algorithm for gray-scale image matching. This algorithm is based on the opening operation of mathematical morphology and presents a concept of morphological size in theory. By operating the morphological size of the discrepancy function between two gray-scale images, their matching degree can be measured well. By analyzing the sufficient condition to the result of that grayscale image opened by 3-D sphere is non-empty in 3-D digital space, we adopted a technique of threshold decomposition to transform morphological operations from gray-scale to binary, which resolved the problems of difficult construction to 3-D structuring element and complex operations. A fast method of interval approximation was proposed to calculate the grayscale morphological size quickly. Binary morphological operations use flat structuring elements and it is essentially boolean operations. Thus, this fast algorithm can be applied on the hardware platform well.