ppxscal/embedding_network huggingface dataset:
Face Image Retrieval and Annotation Based on Two Latent Semantic Spaces in FIARS
Authors: Hideaki Ito, Hiroyasu Koshimizu
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

This paper describes face image retrieval and annotation based on latent semantic indexing in FIARS. Two latent semantic spaces are constructed from visual and symbolic features to develop these mechanisms. These features are corresponding to lengths of some places of a face and its parts, and keywords, respectively. One latent semantic space is constructed from visual features, the other space is constructed from both features. The former space is used for retrieving similar face images to a given face image, and the latter is used for seeking keywords to the given face image. Moreover, two types of visual futures are defined. One is specified in terms of the lengths of face parts, and the other in terms of points on the outlines of a face and its parts. As an experiment, recall and precision ratios of retrieved face images are measured from the viewpoint of whether similar face images are retrieved, and the ratios of retrieved keywords are measured using two types of the visual features from the viewpoint of whether the retrieved keywords are suitable for the given face image. To evaluate efficiency, not only face images which are stored in the database of the system, but also new face images are given as queries.
Reactive Component based Service-Oriented Design - A Case Study
Authors: Jing Liu, Jifeng He
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

Service-Oriented Design (SOD) is a software development paradigm that utilizes services as fundamental elements for developing applications/solutions. Recently, service orientation is becoming a mainstream approach for building large scale software systems. However, current software models do not take services as fundamental elements and it is very difficult for people to model from services. We consider that contract equipped reactive component model is well suited for addressing various aspects of service oriented systems including service description, delegation, as well as composition. To demonstrate this idea, a case study: e-commerce application is presented in this paper. We start from analyzing the service that the customers need, then assign the service to the interface, which in turn, delegates the service to the component. A Java-like formal language rCOS is used to describe the models. In our model, interface is used to capture the syntax information and contract is applied to capture the semantics information of the service. Component is obtained by refining the contract to designs.
Evaluating Different Genetic Operators in the Testing for Unwanted Emergent Behavior Using Evolutionary Learning of Behavior
Authors: Jorg Denzinger, Jordan Kidney
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

We present an experimental comparison of different genetic operators regarding their use in an evolutionary learning method that searches for unwanted emergent behavior in a multi-agent system. The idea of the learning method is to evolve cooperative behavior of a group of so-called attack agents that act in the same environment as the tested agents. The attack agents use action sequences as agent architecture and the quality of a group of such agents is measured by how near their behavior brings the tested agents to show the unwanted behavior. Our experiments within the ARES II rescue simulator with an agent team written by students show that this method is able to find unwanted emergent behavior of the agents. They also show that rather standard genetic operators (on the team level and the agent level) are already sufficient to find this unwanted behavior.
A Sensor Middleware for Lightweight Relocatable Sensing Programs
Authors: Makoto ISHIGURO, Kenji TEI, Yoshiaki FUKAZAWA, Shinichi HONIDEN
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Wireless sensor networks (WSNs) have attracted attention in recent years. Many sensors will be equipped in buildings and provide data about the context of buildings in the future. We can provide many kinds of services that use various context information acquired from wireless sensor networks. However, sensing programs may not be able to be executed concurrently on the same sensor node because of sensors' resource restrictions. So, sensing programs sometimes have to relocate to other sensors if necessary. In this paper, we suggest a middleware for the relocation of a sensing program. Considering severe resource restrictions in a wireless sensor network, we can make a sensing program with a small code footprint.
Learning a common language through an emergent interaction topology
Authors: Samarth Swarup, Kiran Lakkaraju, Les Gasser
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We study the effects of various emergent topologies of interaction on the rate of language convergence in a population of communicating agents. The agents generate, parse, and learn sentences from each other using recurrent neural networks. An agent chooses another agent to learn from, based on that agent's fitness. Fitness is defined to include a frequency-dependent term capturing the approximate number of interactions an agent has had with others---its "popularity" as a teacher. This method of frequency-dependent selection is based on our earlier Noisy Preferential Attachment algorithm, which has been shown to produce various network topologies, including scale-free and small-world networks. We show that convergence occurs much more quickly with this strategy than it does for uniformly random interactions. In addition, this strategy more closely represents choice preference dynamics in large natural populations, and so may be more realistic as a model for adaptive language.
SQL.CT: Providing Data Management for Visual Exploration of CT Datasets
Authors: Shirley Cohen, David E. Guzman
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

We present the design and implementation of SQL.CT, a prototype for managing, querying, and visualizing 3D CT (Computed Tomography) datasets. The system is motivated by scientific studies of fossil records. Our prototype is built on top of SQL Server 2005 and uses both web service and service broker technologies. The desktop client utilizes commodity graphics cards to interactively render 3D volumes. This paper presents the user requirements, discusses the design of the data model and desktop client, and reports on preliminary performance measurements. Our experiments show that by pushing the spatial logic as low as possible into the DBMS, we can filter the data early. We observe some significant performance benefits from the reduced message traffic to and from the remote client.
share.loc - A Multi Tiered Interoperable E-Learning Metadata Repository
Authors: Daniel Dahl, Gottfried Vossen, Peter Westerkamp
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The importance of metadata for e-Learning is undisputed, particularly in terms of the Semantic Web. Based on metadata standards such as LOM (Learning Object Metadata), e-Learning repositories can offer an effective and efficient search for e-Learning content. The emerging paradigm of Service-Oriented Architectures (SOAs) enables developers to implement open systems instead of monolithic ones. Well-defined interfaces for distributed systems have to be provided to enable easy integration of functionalities. In this context it is important to build the entire system architecture on a suitably chosen metadata standard. The e-Learning Repository share.loc presented in this paper uses special implementations of LOM within its different tiers of the entire architecture. An additional service tier that is implemented vertically to the common application tiers enables remote systems to request LOM-compliant representations of metadata from each tier that are tailored towards their individual needs.
Tiancalli06: An Agent for the Supply Chain Management Game 2006
Authors: Daniel Macias Galindo, Darnes Vilarino Ayala, Fabiola Lopez y. Lopez
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

For two years now, the Tiancalli Project has been developed. This Project consists in the construction of a TAC SCM compliant agent. The contest is about different software agents competing for a simulated market. This year, we present the Tiancalli06 agent. In this article the learning techniques implemented to the agent are described. These strategies are used so the agent can compete in the market and obtain incomes. The final results about the performance of the agent on the three phases that it participated are also presented - Qualification, Seeding and Quarter Finals. The previous results of this Project can be found in [8, 9, 10, 11, 12].
Reinventing the wheel, revisited
Authors: Gregg W. Taylor
Venue: ACM SIGAPL APL Quote Quad (1996)

I am a cyclist. I've ridden since before my paper route at age twelve; I rode to high school; and for 12 years I rode to work. I no longer ride to work, but I try to ride about an hour a day. In all those years I never really paid much attention to my wheels. Sure, I repaired flats, greased the bearings, and learned that the axle hung from the top of the wheel rather being supported from the bottom. But all-in-all, I mostly took my wheels for granted. They worked fine, did their job, and I never considered there was much else to worry about. 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
Parallel Support Set Searches for Meshfree Methods
Authors: C. Cartwright, S. Oliveira, D. E. Stewart
Venue: SIAM Journal on Scientific Computing (2006)

We describe the implementation of a parallel algorithm that solves a computational geometry problem arising in meshfree methods. We solve the following problem: Given a collection of N d-rectangles Si and Q points xk in Rd, compute Ik = { i | xk \in Si }. This task is necessary for computing values of the meshfree basis functions Psii (xk) and can be used to efficiently compute the mass and stiffness matrices for the meshfree Galerkin method.
Fractional system identification for lead acid battery state of charge estimation
Authors: Jocelyn Sabatier, Mohamed Aoun, Alain Oustaloup, Gilles Grégoire, Franck Ragot, Patrick Roy
Venue: Signal Processing (2006)

This paper deals with the application of fractional system identification to lead acid battery state of charge estimation. Fractional behavior of lead acid batteries is justified. A fractional system identification method recently developed is presented and a new fractional model of the battery is proposed. Based on parameter variations of this model, a state of charge estimation method is presented. Validation tests of this method on unknown state of charge are carried out. These validation tests highlights that the proposed estimation method gives a state of charge estimation with an error close to 5% whatever the operating temperature.
MV-MAX: improving wireless infrastructure access for multi-vehicular communication
Authors: David Hadaller, Srinivasan Keshav, Tim Brecht
Venue: Proceedings of the 2006 SIGCOMM workshop on Challenged networks (2006)

When a roadside 802.11-based wireless access point is shared by more than one vehicle, the vehicle with the lowest transmission rate reduces the effective transmission rate of all other vehicles. This performance anomaly [9] degrades both individual and overall throughput in such multi-vehicular environments. Observing that every vehicle eventually receives good performance when it is near the access point, we propose MV-MAX (Multi-Vehicular Maximum), a medium access protocol that opportunistically grants wireless access to vehicles with the maximum transmission rate. Mathematical analysis and trace-driven simulations based on real data show that MV-MAX not only improves overall system throughput, compared to 802.11, by a factor of almost 4, but also improves on the previously proposed time-fairness scheme [20, 22, 15] by a factor of more than 2. Moreover, despite being less fair than 802.11, almost every vehicle benefits by using MV-MAX over the more equitable 802.11 access mechanism. Finally, we show that our results are consistent across different data sets.
Evaluating Behavior Correctness of Synchronous Systems through Time to Service Distribution Analysis: Tools Required
Authors: L. du Bousquet
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

For synchronous software validation, in addition to safety properties, eventuality properties may be required to specify that a request will be eventually served. Even if the eventuality properties are true, a deeper analysis of the "time-to-service" (time between a request and its response) under different environmental conditions can bring additional information about the system behavior correctness. The paper underlines the need of tools easy-to-use which could help to carry out such kind of analyses.
Simulation modeling and analysis of a new mixed model production lines
Authors: Servet Hasgül, Alptuǧ Selçuk Büyüksünetçi
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Mixed model production lines are often used in manufacturing systems. In production lines, different product types are simultaneously manufactured by processing small batches. This paper describes a recently completed project involving the development of simulation models for a mixed model production line in a refrigerator company. Decision maker wants to determine the bottlenecks before changing the traditional line to a mixed model production line. Due to the enlarged number of models, the design of an assembly system becomes more complicated. Performance evaluation is an important phase in the design of assembly lines in a mixed model production environment. Simulation models helped us to identify production line bottlenecks and evaluate some number of suggested solutions.
FreeSML: delivering on the open-source simulation language promise
Authors: John J. DiLeo
Venue: Proceedings of the 37th conference on Winter simulation (2005)

FreeSML is a Java-based simulation language, providing support for process-oriented and event-oriented simulation, along with limited support for continuous-variable simulation. The core simulation engine is indirectly derived from that of Silk 1.3, and the language's public interface is based heavily on those of Silk and SSJ. Unlike earlier languages, FreeSML was developed with the specific intent that it be released as an open-source package, and has been released under the Free Software Foundation's Lesser General Public License.
Supporting casual tutors and demonstrators: a case study in computer science and software engineering
Authors: Michael Kirley
Venue: Proceedings of the 8th Austalian conference on Computing education - Volume 52 (2006)

This paper describes the implementation and evaluation of a comprehensive Department-based training and support program for casual tutors and laboratory demonstrators at the University of Melbourne. The program provides a structured approach to help casual staff develop an understanding of what is involved in high quality teaching and student learning, which can be applied in a computer science and software engineering context. The program involves a number of different phases, including: training sessions, self assessment, peer observation, academic staff member observations, and quality of teaching surveys. We discuss the strengths and limitations of the program, the implications for the Department and identify future directions.
Euclidean Structure from Confocal Conics: Theory and Application to Camera Calibration
Authors: Pierre Gurdjos, Jun-Sik Kim, In-So Kweon
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Plane-based calibration is now a very popular procedure because of its flexibility. One key step consists in detecting a set of coplanar features, from which the Euclidean structure of the corresponding 3D plane has to be computed. We suggest to use confocal conics as calibration targets, as they offer undeniable advantages over other ones (e.g., points or lines) in terms of detection and estimation, especially in the presence of partial occlusion. We introduce important projective and Euclidean properties of the linear family of conics (i.e., the confocal conic range), spanned by two confocal conics. In particular, we rely on the fact that the circular point-envelope - a rank-2 conic that encodes the 2D Euclidean structure - is a degenerate member of any confocal conic range. This allows us to give closed-form solutions in three cases: one conic with known foci, two confocal conics with known product of ratios of semi axes, and two unknown confocal conics. The performances of the proposed algorithms (consisting of a few lines of Matlab-like code) show up high accuracies for both intrinsic and extrinsic camera parameters. In addition to experiments with synthetic data, a video sequence is processed, showing off the interest of using confocal conics as calibration targets, for augmented reality purposes.
An XML Routing Synopsis for Unstructured P2P Networks
Authors: Qiang Wang, Abhay Kumar Jha, M. Tamer Ozsu
Venue: Proceedings of the Seventh International Conference on Web-Age Information Management Workshops (2006)

Many emerging applications that use XML are distributed, usually over large peer-to-peer (P2P) networks on the Internet. The deployment of an XML query shipping system over P2P networks requires a specialized synopsis to capture XML data in routing tables. In this paper, we propose a novel graph-structured routing synopsis, called kd-synopsis, for deployment over unstructured super-peer based P2P networks. This synopsis is based on length-constrained FBsimulation relationship, which allows the balancing of the precision and size of the synopsis according to different space constraints on peers with heterogeneous capacity. We report comprehensive experiments to demonstrate the effectiveness of the kd-synopsis.
Efficient computation using self-reconfiguration
Authors: Viktor K. Prasanna
Venue:  (2005)

Reconfigurable devices (such as FPGAs) have emerged as more efficient alternatives to microprocessors for a number of applications. A key strength of reconfigurable devices is that the logic configured on them can be quickly modified at runtime to suit application requirements. So far, however, the task (called runtime reconfiguration) of computing the modifications required and performing the reconfiguration, has been handled by conventional von Neumann processors. This work shows that a reconfigurable device can perform the task of runtime reconfiguration more efficiently than a von Neumann processor. To do so, the work makes the following key contributions: introduction and precise description of the concept of self-reconfiguration, design and implementation of a device that self-reconfigures efficiently, development and implementation of algorithms that utilize self-reconfiguration to perform runtime reconfiguration more efficiently than a von Neumann processor. Self-reconfiguration is essentially the modification of logic configured on a reconfigurable device by the device itself, without any external intervention. The technique is precisely described using a Mealy machine based reconfigurable device model. Based on the description, fast context switching and fast configuration memory access are identified as the key requirements for a device to self-reconfigure efficiently. The architecture of a device, the Self-Reconfigurable Gate Array (SRGA), is developed that utilizes a novel configuration memory organization to meet the above requirements. By performing layout and SPICE level simulation of key components, (for a 0.18&mu;m CMOS process) it is shown that an 8 context 256 &times; 256 PE (processing element) SRGA can perform context switching in 4.8ns and access arbitrary configuration memory locations in at most 5.1ns. Next, basic operations that utilize self-reconfiguration to efficiently route along a row or column of the SRGA are developed. Using above operations, an algorithm for mapping an arbitrary N node binary tree into &Theta;(N log N) PEs is developed and implemented on the SRGA as well as a von Neumann processor. Detailed performance evaluation is carried out to show that while the area time product of both is similar, the SRGA implementation is faster by a factor of at least four, and as the binary tree size increases, its advantage over the von Neumann implementation grows. Using self-reconfiguration thus not only improves performance but also simplifies the architecture by eliminating the von Neumann processor. Finally, an algorithm for performing regular expression matching on the SRGA is presented. It utilizes the above binary tree mapping operation to efficiently instantiate, at runtime, a finite state machine corresponding to the given regular expression, thereby demonstrating the use of the developed architecture and algorithms for real world applications.
Towards Agent-Based Coalition Formation for Service Composition
Authors: IngoM uller, Ryszard Kowalczyk, Peter Braun
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

The topic of agent-based service composition has been experiencing much attention recently. Researchers are applying agent technology with the aim to improve adaptiveness and flexibility of prevailing static Web service composition solutions. One major characteristic of multi-agent systems in particular is their ability of emergent behavior that allows gaining complex system behavior from small distributed sets of simple rules. This paper describes a multi-agent-based coalition formation approach for service composition that achieves emergent behavior based on a light-weight interaction protocol and decentralized decision making. The paper also presents evaluation results of first experiments to underline the validity of the approach.