ppxscal/embedding_network huggingface dataset:
Learning Exemplar-Based Categorization for the Detection of Multi-View Multi-Pose Objects
Authors: Ying Shan, Feng Han, Harpreet S. Sawhney, Rakesh Kumar
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

This paper proposes a novel approach for multi-view multi-pose object detection using discriminative shapebased exemplars. The key idea underlying this method is motivated by numerous previous observations that manually clustering multi-view multi-pose training data into different categories and then combining the separately trained two-class classifiers greatly improved the detection performance. A novel computational framework is proposed to unify different processes of categorization, training individual classifier for each intra-class category, and training a strong classifier combining the individual classifiers. The individual processes employ a single objective function that is optimized using two nested AdaBoost loops. The outer AdaBoost loop is used to select discriminative exemplars and the inner AdaBoost is used to select discriminative features on the selected exemplars. The proposed approach replaces the manual time-consuming process of exemplar selection as well as addresses the problem of labeling ambiguity inherent in this process. Also, our approach fully complies with the standard AdaBoost-based object detection framework in terms of real-time implementation. Experiments on multi-view multi-pose people and vehicle data demonstrate the efficacy of the proposed approach.
Refuting Security Proofs for Tripartite Key Exchange with Model Checker in Planning Problem Setting
Authors: Kim-Kwang Raymond Choo
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

We encode a simplified version of the Canetti and Krawczyk (2001) formalism using Asynchronous Product Automata (APA). We then use a model checker tool, Simple Homomorphism Verification Tool (SHVT), to perform statespace analysis on our Automata in the setting of planning problem. As a case study, we revisit two tripartite key exchange protocols of Hitchcock, Boyd, and González Nieto (2004), which carry claimed security proofs in the Canetti and Krawczyk (2001) model. We refute their proofs of security by pointing out previously unpublished flaws in the protocols using SHVT. We then point out corresponding flaws in the refuted proofs.
Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems)
Authors: Michel RAYNAL, Corentin TRAVERS
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

The k-set agreement problem is a paradigm of coordination problems encountered in distributed computing. The parameter k defines the coordination degree we are interested in. (The case k = corresponds to the well-known uniform consensus problem.) More precisely, the k-set agreement problem considers a system made up of n processes where each process proposes a value. It requires that each non-faulty process decides a value such that a decided value is a proposed value, and no more than k different values are decided. This paper visits the k-set agreement problem in synchronous systems where up to t processes can experience failures. Three failure models are explored: the crash failure model, the send omission failure model, and the general omission failure model. Lower bounds and protocols are presented for each model. Open problems for the general omission failure model are stated. This paper can be seen as a short tutorial whose aim is to make the reader familiar with the k-set agreement problem in synchrony models with increasing fault severity. An important concern of the paper is simplicity. In addition to its survey flavor, several results and protocols that are presented are new.
Model Simulation for Test Execution Capacity Estimation
Authors: Eduardo Aranha, Paulo Borba, Jose Lima
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

It is important for a company to know if it is able to attend the clients' requests on time and according to their expectations, mainly in competitive markets. A usual activity performed to ensure quality is the test activity. Software testing is been considered so important that organizations can allocate teams exclusively for test activities. In this context, it is important that test managers know the capacity of their test team. This paper defines a capacity model for test execution teams and presents the use of simulation technique for estimating teams capacities for executing tests in mobile applications. We also report our experiences using this model in an organizational setting.
Architecture of a Universal Relation Data Source for Web Applications with Advanced Access Control and Simplified Migration
Authors: Vit Vrba, Lubomir Cvrk, Vit Novotny, Karol Molnar
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

In enterprise systems many software operations over a database are implemented in a similar way. Systems always take care of correct storage of a data into appropriate tables, data integrity, multilingual support, locales, data validation etc. Data are often stored in a relational database management systems using SQL. SQL standard itself does not provide suitable support for wide range of operations which need to be implemented in almost all cases. Furthermore SQL implementation and triggers/stored procedures programming language differ between various systems. This leads to very difficult migration of software systems based on one database management system to another. Access control provided by the databases is not suitable for an application because users would be allowed to access a database but they must be allowed to access an application instead. Sometimes an application needs to design a more sophisticated access control system. This article deals with this topic and designs an architecture which universally solves all mentioned problem areas. Key benefits it brings are independency on any particular database management system, easy migration to another one and fast fully automatic lowlevel record based rights checking.
Design of robust fault detection filters for multivariable feedback systems
Authors: A. Zolghadri, F. Castang, D. Henry
Venue: International Journal of Modelling and Simulation (2006)

This paper presents a new and general scheme to design robust fault detection and isolation (FDI) filters for multivariable uncertain systems under feedback control. The design procedure simultaneously ensures robustness of the FDI output against disturbances and modelling errors, and nominal sensitivity to faults. Robust sensitivity of the residual signals is analyzed by means of a test based on the generalized structured singular value. The feedback controller is directly included in the design procedure, making the proposed approach very appealing in most practically relevant situations. Simulation results based on an engine failure scenario of the RCAM benchmark illustrate the potential of the proposed approach.
Mathematical modelling of adaptive wormhole routing in the presence of self-similar traffic
Authors: Geyong Min, M. Ould-Khaoua
Venue: Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (2003)

The properties of self-similar traffic have strong effects on queueing performance. It has been suggested that many existing computer and communication systems need to be reevaluated in the presence of this new type of traffic. To this end, this paper proposes an analytical performance model for adaptive wormhole routing in torus interconnection networks under self-similar traffic. The bursty characteristic of traffic over multiple time scales is captured by the superposition of a number of two-state Markov-modulated poisson processes (MMPPs). Simulation experiments demonstrate that the proposed model exhibits a good degree of accuracy for various system sizes and under different operating conditions. The analytical model is then used to investigate the impact of the important parameter of traffic self-similarity on network performance.
Video segmentation using stabilized inverse diffusion
Authors: A. Mani
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

A video segmentation scheme using stabilized inverse diffusion equations is proposed. The scheme is based on the non-linear scale-space analysis of video lattice. Non-linear diffusion and especially stabilized inverse diffusion is a very robust method for image segmentation. In this paper the two-dimensional diffusion process has been extended to three dimensions. The segmentation scheme is based on this extended process. Also, a progressive scale-space evolution of the image sequence is proposed that reduces the memory requirements as well as solves the region correspondence problem. Finally, segmentation results for two image sequences are shown. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A qualitative feature-based characterization of 2D architectural style: Special Topic Section on Computational Analysis of Style
Authors: Julie R. Jupp, John S. Gero
Venue: Journal of the American Society for Information Science and Technology (2006)

Architectural plans are design diagrams that describe building layout where space is planned according to design requirements. Style in architecture is generally characterized as common features appearing in a particular class of building design. This research seeks to address how to recognize architectural design style from a 2D plan diagram. We explore this question in a computational encoder-analyzer (E-A) model for 2D plans, where a characterization of 2D style is based on qualitative spatial representation and information theoretic measures. In a preliminary study of a prominent architect's plans, we demonstrate the effectiveness of our approach. We conclude by discussing practical applications of automated plan recognition and classification in design support tools. &copy; 2006 Wiley Periodicals, Inc.
On the expressive power of the loop language
Authors: Tristan Crolard, Samuel Lacas, Pierre Valarcher
Venue: Nordic Journal of Computing (2006)

We define a translation of Meyer and Ritchie's Loop language into a subsystem of Gödel's system T (with product types). Then we show that this translation actually provides a lock-step simulation if a call-by-value strategy is assumed for system T. Some generalizations and possible applications are discussed.
Preface to SMIWEP-MATeS'06: workshop held in conjunction with the 6th international conference on web engineering (ICWE2006) Palo Alto, California, USA. July 10th, 2006
Authors: Geert-Jan Houben, Oscar Pastor, Daniel Schwabe, Oscar Corcho, Pedro Sampaio, Andreas Wombacher
Venue: Workshop proceedings of the sixth international conference on Web engineering (2006)

This workshop is the result of joining the two workshops "Web Services Modeling and Implementation Using Sound Web Engineering Practices" (SMIWEP) and "Methods, Architectures & Technologies for e-Service Engineering" (MATeS), which were originally proposed in conjunction with the ICWE 2006 conference. As a result of the selection process of both workshops, the six papers included in the proceedings were accepted and presented on July 10th, 2006. The workshop had plenty of time for discussion and as a main result of these discussions there was a proposal for topics to be covered in the e-services research agenda for the next year.
First-class nonstandard interpretations by opening closures
Authors: Jeffrey Mark Siskind, Barak A. Pearlmutter
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

We motivate and discuss a novel functional programming construct that allows convenient modular run-time nonstandard interpretation via reflection on closure environments. This map-closure construct encompasses both the ability to examine the contents of a closure environment and to construct a new closure with a modified environment. From the user's perspective, map-closure is a powerful and useful construct that supports such tasks as tracing, security logging, sandboxing, error checking, profiling, code instrumentation and metering, run-time code patching, and resource monitoring. From the implementor's perspective, map-closure is analogous to call/cc. Just as call/cc is a non-referentially-transparent mechanism that reifies the continuations that are only implicit in programs written in direct style, map-closure is a non-referentially-transparent mechanism that reifies the closure environments that are only implicit in higher-order programs. Just as CPS conversion is a non-local but purely syntactic transformation that can eliminate references to call/cc, closure conversion is a non-local but purely syntactic transformation that can eliminate references to map-closure. We show how the combination of map-closure and call/cc can be used to implement set! as a procedure definition and a local macro transformation.
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Authors: Jianhong Zhou, Ashfaq Khokhar
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications including biological data analysis, financial forecasting, and text mining. Biclustering algorithms are significantly more complex compared to the classical one dimensional clustering techniques, particularly those requiring multiple computing platforms for large and distributed data sets. In this paper, we develop an efficient scalable algorithm, referred to as ParRescue(Parallel Residue Co-clustering), that is capable of performing biclustering on extremely large or geographically distributed data sets. ParRescue divides the cluster tasks among processors with minimal communication costs thus making it scalable over large number of computing nodes. The proposed implementation is based on an existing sequential approach that has been modified for amenable parallel implementation. The proposed Par- Rescue algorithm has been implemented using MPI and the performance results are reported based on executions on a 64 node Linux PC cluster connected over 100 Mbits links. The experimental results show scalable performance with near linear speedups across different data and machine sizes compared to the modified sequential algorithm.
Horizon Detection Using Machine Learning Techniques
Authors: Sergiy Fefilatyev, Volha Smarodzinava, Lawrence O. Hall, Dmitry B. Goldgof
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

Detecting a horizon in an image is an important part of many image related applications such as detecting ships on the horizon, flight control, and port security. Most of the existing solutions for the problem only use image processing methods to identify a horizon line in an image. This results in good accuracy for many cases and is fast in computation. However, for some images with difficult environmental conditions like a foggy or cloudy sky these image processing methods are inherently inaccurate in identifying the correct horizon. This paper investigates how to detect the horizon line in a set of images using a machine learning approach. The performance of the SVM, J48, and Naïve Bayes classifiers, used for the problem, has been compared. Accuracy of 90-99% in identifying horizon was achieved on image data set of 20 images.
Architecture-Centric Quality Engineering form Software Product Lines
Authors: Ronny Kolb, Dirk Muthig
Venue: Proceedings of the 10th International on Software Product Line Conference (2006)

The product line approach to software development is based on the systematic, large-scale reuse of development artifacts such as architecture, design, and components between a set of functional similar products. It promises, among others, to shorten the development time of software systems and to significantly reduce development and maintenance costs. In order to achieve the promised improvements, however, the components and artifacts intended for reuse must be of high quality. Therefore, more than for traditional software development, quality engineering (i.e., constructive and analytical activities performed to assure the quality of development artifacts and end products) becomes a very crucial part of every software product line effort. Even though quality engineering
Static analysis for syntax objects
Authors: David Fisher, Olin Shivers
Venue: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming (2006)

We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems or program analysis, for the new, user-defined forms or embedded languages, thus allowing us to construct "towers" of language levels. In addition, the static semantics of the languages at two adjacent levels in the tower can be connected, allowing improved reasoning power at a higher (and perhaps more restricted) level to be reflected down to the static semantics of the language level below. We demonstrate our system by designing macros for an assembly language, together with some example static analyses (termination analysis, type inference and control-flow analysis).
Failures of the VCG mechanism in combinatorial auctions and exchanges
Authors: Vincent Conitzer, Tuomas Sandholm
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechanism: the problem of revenue guarantees, and that of collusion. The existence of these problems even in one-item settings is well-known; in this paper, we lay out their full extent in multi-item settings. We study four settings: combinatorial forward auctions with free disposal, combinatorial reverse auctions with free disposal, combinatorial forward (or reverse) auctions without free disposal, and combinatorial exchanges. In each setting, we give an example of how additional bidders (colluders) can make the outcome much worse (less revenue or higher cost) under the VCG mechanism (but not under a first price mechanism); derive necessary and sufficient conditions for such an effective collusion to be possible under the VCG mechanism; and (when nontrivial) study the computational complexity of deciding whether these conditions hold.
Statically typed linear algebra in Haskell
Authors: Frederik Eaton
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell (2006)

Numerical computations are often specified in terms of operations on vectors and matrices. This is partly because it is often natural to do so; but it is also partly because, being otherwise useful, such operations have been provided very fast implementations in linear algebra libraries such as ATLAS (implementing BLAS), LAPACK, fftw, etc. Due to their better cache awareness and use of specialized processor instructions, a high-level invocation of an operation such as matrix multiplication using these libraries may execute orders of magnitude more quickly than a straightforward low-level implementation written in, say, C. The combination of efficiency and expressivity has made the framework of linear algebra an exceedingly popular one for scientists. For example, Matlab[1], an interpreter of a simple linear algebra language, has become a standard research tool in many fields.The process of expressing an algorithm in terms of matrices can be error-prone. Matlab and other popular matrix languages are dynamically-typed, which means that type errors are only detected at run-time. Even statically typed languages rarely keep track of more information in an object type than its tensor rank (e.g., to discriminate between matrices and vectors) and element type.If we could additionally expose object dimensions to the type system then we would ideally be able to detect a much wider variety of common errors at compile time than is currently possible. This would in turn make it easier to build and maintain larger numericsintensive software projects.We call our idea of exposing dimensions to the type system "strongly typed linear algebra". We have written a prototype implementation in Haskell, which is based on Alberto Ruiz's GSLHaskell[2] and which uses techniques from Kiselyov and Shan's "Implicit Configurations" paper[3].The presentation will cover the key aspects of our design such as the use of GADTs to combine matrix and vector types, and the use of higher-rank types and staging (namely, Template Haskell) to closely approximate a dependent-type system. Then, we will give a demonstration of interactive use, and compare our system to existing systems in the areas of speed and usability.
An IMS-LD Editor to Describe a Tutoring Activity in an On-line Training
Authors: Patricia Gounon, Pascal Leroux, Xavier Dubourg
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this paper, we present an environment which supports the on-line education designer when describing a pedagogical scenario. The idea is to propose a formalism to illustrate a pedagogical scenario in terms of a description of a learning situation (learning scenario) and the interactions between learners and tutors (tutoring scenario). Our research focuses precisely on the tutoring activity design. We aim to specify roles and tutor involvement and also to describe the tools supporting tutor activity. Firs of all, we present the Triton model to guide learner accompaniment specification definition in terms of tasks and tools supporting their activities and its reification in IMS LD. Lastly, we describe EdiScenE founded on these two propositions.
Evaluating a computational model of social causality and responsibility
Authors: Wenji Mao, Jonathan Gratch
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Intelligent agents are typically situated in a social environment and must reason about social cause and effect. Such reasoning is qualitatively different from physical causal reasoning that underlies most intelligent systems. Modeling social causal reasoning can enrich the capabilities of multi-agent systems and intelligent user interfaces. In this paper, we empirically evaluate a computational model of social causality and responsibility against human social judgments. Results from our experimental studies show that in general, the model's predictions of internal variables and inference process are consistent with human responses, though they also suggest some possible refinement to the computational model.