ppxscal/embedding_network huggingface dataset:
Design and Implementation of a Widget Set for Steerable Projector-Camera Units
Authors: Dennis Reiter, Andreas Butz
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

We describe the design and implementation of graphical interaction widgets for use with a steerable projector-camera unit. The design of our widgets is adapted to provide the right visual cues when projected and they are controlled by the user's hand. The widgets' input regions are arranged in an ergonomic way and they use a simple but robust computer vision technique for interaction.
Meta-modeling for Computer-supported Group-based Learning Design
Authors: Manuel Caeiro-Rodriguez, Martin Llamas-Nistal, Luis Anido-Rifon
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Nowadays, there is a huge demand for Groupbased Learning (GBL) pedagogies, involving learners in so-called "active" and "rich" pedagogies. We describe the basis of a meta-model to support the design of computer-supported GBL processes and scenarios. Such proposal is related with recent innovative developments in the e-learning domain: Educational Modeling Languages (EMLs) and CSCL scripts. An EML provides a framework of elements that supports the description of any design of a teachinglearning experience in a formal way, involving learning participants, resources, tasks, scenarios, etc. CSCL scripts are proposed as tasks processes that aim to facilitate GBL by specifying tasks in collaborative settings, eventually sequencing these tasks and assigning them to learners. Therefore, pedagogical designs may be processed by appropriate software engines to enact them, providing automatic management and coordination of the involved elements. The meta-model proposed in this paper is conceived as an initial step to create a new EML.
A Query System for Spatiotemporal Database Applications
Authors: Byunggu Yu
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

In recent years, an increasing number of database applications deal with continuously changing data objects (CCDOs). In these applications, the underlying data management system must support new types of spatiotemporal queries that refer to CCDOs. The expressive power of the supported query language and the query processing algorithms determine the quality and the efficiency of the query system. In contrast to traditional data objects, CCDOs change continuously. Therefore, the relation between two CCDOs may change over time. We define a motion relation as a sequence of one or more distinct topological relations. This paper surveys existing spatiotemporal query types and proposes a powerful spatiotemporal database query language by defining a complete set of motion predicates that can fill the gap between space and time. In addition, the paper discusses how to efficiently process the proposed queries by utilizing existing indexing schemes.
Identifying Candidate Genes Using the BioWarehouse: A Case Study
Authors: Yannick Pouliot, Thomas J. Lee, Valerie Wagner, Peter D. Karp
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The BioWarehouse is an open source data warehousing environment focused on supporting bioinformatics databases (DBs). Operating on the MySQL or Oracle relational database management systems (RDBMSs), BioWarehouse integrates public source DBs such as Swiss-Prot and GenBank into a unified normalized schema operating under a single DB management system. BioWarehouse also imposes partial semantic normalization on the source data, thus decreasing semantic heterogeneity and facilitating multi-DB queries using the Structured Query Language (SQL). BioWarehouse currently supports the integration of 22 source DBs, as well as the simultaneous storage of multiple versions of a given DB. Loader tools, written in the C and Java languages, are used to parse and load these DBs into the warehouse schema (further described at the URL cited below). As an application case study of the BioWarehouse, we have identified candidate genes for "orphan" activities, defined as activities for which no cognate gene sequences exist. 1,356 (36%) of enzymatic activities that have been assigned an Enzyme Commission (EC) number are orphans [1]. Such high prevalence is problematic, given that many of these activities are decades old and often perform essential functions. Most notably, the existence of orphans introduces gaps in sequence data that significantly limit the accuracy of genome annotation and metabolic pathway prediction. Fortunately, with more than 200 hundred genomes sequenced to completion, and with the availability of systems such as BioWarehouse, the computational identification of candidate genes associated with orphan activities can be envisioned. The BioWarehouse's conglomeration of databases, combined with Oracle 10g's native integration of analytical tools into SQL queries (such as the Basic Local Alignment Search Tool (BLAST) and POSIX regular expressions), enabled us to identify a small number of high-confidence candidate genes associated with a specific orphan activity. We describe the complex queries used in this work to illustrate the value of the data warehousing approach to bioinformatics research. Availability: BioWarehouse is an open source project freely available under the Mozilla license, described at http://bioinformatics.ai.sri.com/biowarehouse/. SRI also operates a publicly accessible BioWarehouse server called Public-house that contains four of the DBs supported by BioWarehouse (see http://bioinformatics.ai.sri.com/biowarehouse/PublicHouseOverview.html to obtain an account).
A Model Driven XML Transformation Framework for Business Performance Management
Authors: Shyh-Kwei Chen, Michael Walher, Kumar Bhaskaran, Hui Lei, Henry Chang, Joachim Frank
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

As XML formats have been widely adopted for representing business documents both within and across enterprises, XML to XML translation becomes a common and critical component for business process integration. Due to limitations of popular approaches such as XSLT for XML translations, we designed a model driven development framework for XML to XML translation with the additional benefits of code re-use and strong built-in model validation. We further applied this framework to the domain of business performance management, converting documents from humanreadable XML format to machine-readable XMI format.
Dynamic Delegation Approach for Access Control in Grids
Authors: G. Geethakumari, Atul Negi, V. N. Sastry
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Access control is a mechanism to secure resources from unauthorized use. Securing a grid resource imposes a distinctive set of challenges to access control policies and mechanisms. As the grid resources are distributed in space and time, direct authorization methods are not always sufficient. Delegation is a way of indirect authorization whereby an active entity in a grid system can access a resource or act on behalf of another active entity. Access to resources in grids can be broadly categorized as full, nil or partial implying a degree of fuzziness. Conventional security models are rigid and the tasks that need to be performed by an active grid entity, require a more flexible form of access. A fuzzy logic based scheme provides more flexibility to resource access and access control in grids. The delegated rights have to be granted in a dynamic environment where the entities of a grid do not have prior information about each other. We propose a new scheme for this, which uses a two- stage fuzzy inference process based on trust relationships among the grid entities.
Species evolve, individuals age
Authors: Mehdi Jazayeri
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

The phenomenon of "software evolution" was observed back in the 1970s when the first large software systems were being developed, and it has attracted renewed attention in the 1990s. Yet, the difficulties of software evolution are still treated as problems that pop up unexpectedly in software projects. In this talk, I look at some possible reasons to explain this apparent contradiction and the possibly related confusion in software evolution research. I point out some ways we can make software evolution research more relevant to software engineering practice. My primary goal is to clarify that what evolves is not the software but our knowledge about a particular type of software.
Stable electrochemically passivated Si surfaces by ultra thin benzene-type layers
Authors: J. Rappich, P. Hartig, N. H. Nickel, I. Sieber, S. Schulze, Th. Dittrich
Venue: Microelectronic Engineering (2005)

Ultra thin organic layers of benzene-type molecules are able to passivate Si surfaces. The organic layers were electrochemically deposited on Si surfaces from aqueous solution of diazonium compounds and show a blocking of the charge transfer from Si into the electrolyte after the deposition process. Electron microscopic images reveal a compact and homogeneous organic layer of 4-bromobenzene on the Si. The surface recombination increases only slightly with respect to a well H-passivated Si surface, so that the interface state density is about 1011 cm2 or slightly below. Organic layer modified Si surfaces are much longer stable in ambient air than the H-terminated surface as observed by a slower decay of the integrated photoluminescence intensity with time. Thermal desorption measurements show that the organic layer is stable up to about 200 °C.
Research on Semantic Web Service-Oriented MMFI for Complex Information Registration
Authors: He Yangfan, He Keqing, Wang Chong
Venue: Proceedings of the IEEE International Workshop (2005)

Information registration is a key problem in semantic web service. Current registration standards are relatively weak in the description of complex relationship between information resources. The Metamodel Framework for Interoperability (MMFI) is proposed in this paper to address this problem. The theoretical foundation of MMFI is metamodeling and ontology, which describe the common features of models in Universe of Discourse. Models based on the same metamodel or ontology can have certain extent of interoperation. MMFI provides a mechanism to record the relationship between metamodel and corresponding models, which contributes to the automatic discovery of compatible services. More specifically, MMFI for Ontology Registration defines a framework for registration and interoperation of ontology models, which will then facilitate the interoperation of the other kind of models by means of common logical background.
Customised Induction Rules for Proving Correctness of Imperative Programs
Authors: Ola Olsson, Angela Wallenburg
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

In this paper we develop a method for automatic construction of customised induction rules for use in a semiinteractive theorem prover. The induction rules are developed to prove the total correctness of loops in an imperative language. We concentrate on integers. First we compute a partition of the domain of the induction variable. Our method makes use of failed proof attempts in the theorem prover to gain information about the problem structure and create the partition. Then, based on this partition we create an induction rule, in destructor style, that is customised to make the proving of the loop simpler. Our concern is in user interaction, rather than in proof strength. Using the customised induction rules, we find that in comparison to standard (Peano) induction or Noetherian induction, the proofs become more modularised and simpler user interaction can be expected. Furthermore, by using destructor style induction we circumvent the problem of creating inverses of functions and we use the machinery of a theorem prover (with symbolic execution) to make the method automatic. We also show that the customised induction rules created by the method are sound.
Active semi-supervised fuzzy clustering for image database categorization
Authors: Nizar Grira, Michel Crucianu, Nozha Boujemaa
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

We consider data clustering problems where a limited amount of high-level semantic information, in the form of pairwise must-link and cannot-link constraints, can be acquired from the user. This form of supervision will guide the categorization of image databases in order to provide overviews that fit better user expectations. We propose here an effective semi-supervised clustering algorithm, Active Fuzzy Constrained Clustering (AFCC), that minimizes a competitive agglomeration-based cost function with fuzzy terms corresponding to pairwise constraints provided by the user. In order to minimize the amount of constraints required, we define an active mechanism for the selection of candidates for constraints. The comparisons performed on a simple benchmark and on a ground truth image database show that with AFCC the results of clustering can be significantly improved with few constraints, making this semi-supervised approach an attractive alternative in the categorization of image databases.
Adaptively Asymmetric Pattern Search for Fast Block-Matching Motion Estimation
Authors: Tyng-Yeu Liang, Po-Hsien Kuo
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper, we invent a novel fast block-matching algorithm (BMA) for motion estimation (ME), called Adaptively Asymmetric Pattern Search (AAPS). Different to the other BMAs, this algorithm uses an asymmetrical search pattern and a predicted vector at the first search step, and dynamically adjusts the size of search pattern to minimize the number of search points. We have already applied AAPS to the process of motion estimation in the MPEG-4 encoding platform, and compared this algorithm with the other BMAs. The experimental result shows that AAPS achieves a 56~65% and 20% improvement in search speed respectively compared to the diamond search algorithm and the adaptive rood pattern search algorithm, and simultaneously maintains a high PSNR.
Locating Text in Images using Matched Wavelets
Authors: Sunil Kumar, Nitin Khanna, Santanu Chaudhury, Shiv Dutt Joshi
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper we have proposed a novel scheme for locating text regions in an image. The method is based on multiresolution wavelet analysis. We used matched wavelets to capture textural characteristics of image regions. A clustering based approach has been proposed for estimating globally matched wavelets (GMWs) for a given collection of images. Using these GMWs, we generate feature vectors for segmentation and identification of text regions in an image. Our method, unlike most of the other methods, does not require any a priori information about the font, fontsize, scripts, geometric transformation, distortion or background texture. We have tested our method on various categories of images like license plates, posters, hand written documents and document images etc. The results show proposed method to be a robust, versatile and effective tool for text extraction from images.
Are External Face Features Useful for Automatic Face Classification?
Authors: Agata Lapedriza, David Masip, Jordi Vitria
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

In this paper a new experiment using the FRGC database is proposed. The experiment deals with the use of external face features for face classification. Unlike the most part of algorithms that can be found in the literature for classifying faces, we consider the external information located at hair and ears as a reliable source of information. These features have often been discarded due to the difficulty of their extraction and alignment, and the lack of robustness in security related applications. Nevertheless, there are a lot of applications where these considerations are not valid, and the proper processing of external features can be an important additional source of information for classifications tasks. We also propose, following this assumption, a method for extracting external information from face images. The method is based on a top-down reconstructionbased algorithm for extracting the external face features. Once extracted, they are encoded in a second step using the Non Negative Matrix Factorization (NMF) algorithm, yielding an aligned high dimensional feature vector. This method has been used in a gender recognition problem, concluding that the encoded information is useful for classification purposes.
uilding yard on line: a distributed and mobile system for supporting building workers
Authors: Daniela Fogli, Andrea Marcante, Piero Mussio, Elisabetta Oliveri, Marco Padula, Rossella Scaioli
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

This paper discusses a participatory and evolutionary methodology for information system design and its application to a case from the building construction sector. The methodology supports collaborative design and evaluation of the system being developed. It takes into account that the evolution of the system depends also on the usability problems users encounter in the field. The system evaluation and adaptation become life-long processes. To this end, tools supporting the methodology are developed to facilitate the in-field collection of usability data, the life-long evaluation and development of the system. The discussion is based on examples from a practical case being developed.
Design Pattern Detection in Eiffel Systems
Authors: Wei Wang, Vassilios Tzerpos
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

The use of design patterns in a software system can provide strong indications about the rationale behind the system's design. As a result, automating the detection of design pattern instances could be of significant help to the process of reverse engineering large software systems. In this paper, we introduce DPVK (Design Pattern Verification toolKit), the first reverse engineering tool to detect pattern instances in Eiffel systems. DPVK is able to detect several different design patterns by examining both the static structure and the dynamic behaviour of a system written in Eiffel. We present three case studies that were performed to assess DPVK's effectiveness.
Digital Modulation Identification by Wavelet Analysis
Authors: Jian Chen, Yonghong Kuo, Jiandong Li, Fenglin Fu, Yubao Ma
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

There is a need to determine the modulation type of an incoming signal. This paper proposes the use of the wavelet transform (WT) for modulation identification of digital signals without requiring any priori knowledge. The identifier consists of inter-class and intra-class identification. Different features have been used for different signals to increase the number of identification types and improve the processing rate. The performance of correct identification is increased too.
Message-based mvc architecture for distributed and desktop applications
Authors: Kishan Mehrotra, Geoffrey C. Fox
Venue:  (2005)

The goal of this dissertation is to develop a paradigm for the next generation of software applications with a clear architecture that unifies desktop and Internet applications. It is aimed at addressing the issues of leveraging existing software assets and incorporating advanced capabilities including collaboration and universal access. As the overall Web systems design on top of the Internet is extremely complex, we divide the task into two separate layers: message-based distributed application architecture and underlying messaging infrastructure linking services together as part of a distributed operating system. This dissertation presents a new approach to building applications as Web Services in a message-based Model-View-Controller (M-MVC) architecture. The premise of this research is that distributed and Web applications which provide services and interface to end users ought to be centered on message exchange. This encourages good design and is an embodiment of the fundamental communication pattern of human interactions. The research investigates a universal modular design with publish subscribe messaging linkage service model that converges desktop applications, distributed applications, and Internet collaboration. This approach allows: maximum reusability of existing components; flexible messaging scheme with high scalability; and automatic and effective collaboration with interactivity of rich media Web content for diverse clients over heterogeneous network environments. In addition, the approach suggests a uniform interface for the next generation Web client with ubiquitous accessibility. We apply this architecture to the quite complex example of a Scalable Vector Graphics (SVG) browser and give detailed performance measurements to demonstrate the viability of the approach.
SIFT: Snort Intrusion Filter for TCP
Authors: Michael Attig, John Lockwood
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

Intrusion rule processing in reconfigurable hardware enables intrusion detection and prevention services to run at multi Gigabit/second rates. High-level intrusion rules mapped directly into hardware separate malicious content from benign content in network traffic. Hardware parallelism allows intrusion systems to scale to support fast network links, such as OC-192 and 10 Gbps Ethernet. In this paper, a Snort Intrusion Filter for TCP (SIFT) is presented that operates as a preprocessor to prevent benign traffic from being inspected by an intrusion monitor running Snort. Snort is a popular open-source rule-processing intrusion system. SIFT selectively forwards IP packets that contain questionable headers or defined signatures to a PC where complete rule processing is performed. SIFT alleviates the need for most network traffic from being inspected by software. Statistics, like how many packets match rules, are used to optimize rule processing systems. SIFT has been implemented and tested in FPGA hardware and used to process Internet traffic from a campus Internet backbone with live data