ppxscal/embedding_network huggingface dataset:
Learning Distance Functions for Automatic Annotation of Images
Authors: Josip Krapac, Frédéric Jurie
Venue: Adaptive Multimedial Retrieval: Retrieval, User, and Semantics: 5th International Workshop, AMR 2007, Paris, France, July 5-6, 2007 Revised Selected Papers (2007)

This paper gives an overview of recent approaches towards image representation and image similarity computation for content-based image retrieval and automatic image annotation (category tagging). Additionaly, a new similarity function between an image and an object class is proposed. This similarity function combines various aspects of object class appearance through use of representative images of the class. Similarity to a representative image is determined by weighting local image similarities, where weights are learned from training image pairs, labeled "same" and "different", using linear SVM. The proposed approach is validated on a challenging dataset where it performed favorably.
Computer-aided measurement plan for an impeller on a coordinate measurement machine with a rotating and tilting probe
Authors: Eun-Young Heo, Dong-Won Kim, Jong-Yeong Lee, Kyoung-Yun Kim
Venue: Robotics and Computer-Integrated Manufacturing (2008)

This paper presents a computer-aided measurement plan (CAMP) for an impeller on a coordinate measurement machine (CMM) with a rotating/tilting probe. The blade surfaces of a machined impeller were measured exactly to secure the machining tolerance and surface finish of the impeller. CMM with a rotating and tilting probe is commonly used for this measurement. However, it is not easy to evaluate all the points on the impeller surfaces due to the time-consuming nature of the CMM measurement. In addition, many points cannot be easily accessed by the CMM probe due to the interference between the probe and the impeller blades. Furthermore, the inherent complexity of the existing teaching operation of a probe using a joystick suggests the necessity of developing a new method for the measurement planning of an impeller. Thus, this paper proposes a CAMP for effectively gauging the inspection points based on the ruled line information of the impeller blade surfaces. The proposed plan partitions the surfaces into several measurement regions based on the ruled lines of a blade surface and the approach vectors of the probe. Finally, a case example for an impeller is presented to demonstrate the effectiveness of the proposed strategy.
An Adaptive Collaborative Filtering Algorithm for Online Reputation Systems
Authors: Min Zuo, Jian-hua Li, Gong-shen Liu
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

This paper presents an adaptive collaborative filtering algorithm to help users of online reputation systems avoid the misleading of dishonest ratings. This algorithm evaluates the trustworthiness of ratings by comparing the raters’ opinions with the opinions of the evaluator, and gives the ratings proper weights before including them into the final judgment. Different weighting functions are applied to positive and negative ratings adaptively so that the weights can better capture the characteristics of various types of malicious raters. Simulations prove that the proposed algorithm can effectively avoid misleading ratings, minimize their bad influences on trust evaluation, and help users make more reliable trust decisions from a personal point of view.
Performance Analysis of VoIP over HSDPA in a Multi-cell Environment
Authors: Irene Bruin, Frank Brouwer, Neill Whillans, Yusun Fu, Youqian Xiao
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

This paper describes network level simulation results for VoIP and Best Effort traffic running over HSDPA. The main focus involves an analysis of how the system is able to deal with user mobility, and in particular handover. Both a handover threshold level as well as a handover setup delay have been included in the simulation model, and a discard timer is used to remove outdated packets from the Node B queue.Link adaptation and H-ARQ (Hybrid-Automatic Repeat reQuest) functionalities are also included in the simulator. An infinite multi-cell environment has been modeled and the users are assumed to move at vehicular speeds. A performance analysis will show the end-to-end QoS. The handover threshold, delay and discard times are also varied in order to investigate their impact on the performance.
Delay-dependent stability analysis for impulsive BAM neural networks with time-varying delays
Authors: Kelin Li
Venue: Computers Mathematics with Applications (2008)

In this paper, we investigate a class of impulsive BAM neural networks with time-varying delays. By establishing the delay differential inequality with impulsive initial conditions and employing M-matrix theory, we find some new sufficient conditions ensuring the existence, uniqueness and global exponential stability of the equilibrium point for impulsive BAM neural networks with time-varying delays. In particular, the estimate of the exponential convergence rate is also provided, which depends on the system parameters. An example is given to show the effectiveness of the results obtained here.
Supervised dFasArt: A Neuro-fuzzy Dynamic Architecture for Maneuver Detection in Road Vehicle Collision Avoidance Support Systems
Authors: Rafael Toledo, Miguel Pinzolas, Jose Manuel Cano-Izquierdo
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

A supervised version of dFasArt, a neuronal architecture based method that employs dynamic activation functions determined by fuzzy sets is used for solving support of the problem of inter-vehicles collisions in roads. The dynamic character of dFasArt minimizes problems caused by noise in the sensors and provides stability on the predicted maneuvers. To test the proposed algorithm, several experiments with real data have been carried out, with good results.
History Dependent Automata for Service Compatibility
Authors: Vincenzo Ciancia, Gian-Luigi Ferrari, Marco Pistore, Emilio Tuosto
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

We use History Dependent Automata (HD-Automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing.Informally speaking, service requests are modelled as pairs of HD-Automata $\langle{C_o,C_r}\rangle$; C r describes the (abstract) behaviour of the searched service and C o the (abstract) behaviour guaranteed by the invoker. Symmetrically, service publication consists of a pair of HD-Automata $\langle{S_o,S_r}\rangle$ such that S o provides an (abstraction of) of the behaviour guaranteed by the service and S r yields the requirement imposed to invokers. An invocation $\langle{C_o,C_r}\rangle$ matches a published interface $\langle{S_o,S_r}\rangle$ when C o simulates S r and S o simulates C r .
Sorting streamed multisets
Authors: Travis Gagie
Venue: Information Processing Letters (2008)

Sorting is a classic problem and one to which many others reduce easily. In the streaming model, however, we are allowed only one pass over the input and sublinear memory, so in general we cannot sort. In this paper we show that, to determine the sorted order of a multiset s of size n containing @s>=2 distinct elements using one pass and o(nlog@s) bits of memory, it is generally necessary and sufficient that its entropy H=o(log@s). Specifically, if s={s"1,...,s"n} and s"i"""1,...,s"i"""n is the stable sort of s, then we can compute i"1,...,i"n in one pass using O((H+1)n) time and O(Hn) bits of memory, with a simple combination of classic techniques. On the other hand, in the worst case it takes that much memory to compute any sorted ordering of s in one pass.
Eliminating Redundant Clauses in SAT Instances
Authors: Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs
Venue: Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007)

In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Since testing whether a SAT instance does not contain any redundant clause is NP-complete, a logically incomplete but polynomial-time procedure to remove redundant clauses is proposed as a pre-treatment of SAT solvers. It relies on the use of the linear-time unit propagation technique and often allows for significant performance improvements of the subsequent satisfiability checking procedure for really difficult real-world instances.
Ponder2 - Policy-Based Self Managed Cells
Authors: Kevin Twidle, Emil Lupu
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Pervasive systems require minimal user intervention while constantly adapting their configuration and behaviour. For example, a personal area network of sensors and computational devices monitoring the health of a patient needs to be able to reconfigure itself in response to sensor changes (failures/removals or additions), changes in the activities or context of the patient as well as changes in the health of the patient.This tutorial will present the Self-Managed Cell architecture developed at Imperial College in collaboration with the University of Glasgow with par-ticular emphasis on the use of policy-based techniques for implementing adaptation and reconfiguration in autonomous pervasive systems. Policies are rules governing choices in the behaviour of systems and are often en-countered as either event-condition-action rules or authorisation rules, al-though other types of policies such as negotiation, filtering and delegation can be defined. Policies can be used to define management and adaptation behaviours within autonomous cells of devices. In addition, they can govern interactions between and federation of the autonomous cells.During this tutorial we will present aspects of the Ponder2 policy specification and implementation, structuring concepts for interactions between cells and integration of policy driven interpreters event and domain ser-vices. This tutorial will include a hands-on practical session based on the Ponder2 implementation realised at Imperial College. Ponder2 was recently designed as part of the TrustCoM project and has been used in several projects funded by the European Union and the EPSRC. More information about Ponder2 can be found at http://ponder2.netThis tutorial is aimed at those interested policy-based architectures for autonomous pervasive systems and will allow attendees to gain direct experience with the Ponder2 system. This tutorial is based on a tutorial previously given at the UKUBINET Workshop 2006. Attendees must have a laptop with Java JDK 5.0 installed (Windows, MAC or Linux platform).
Programming the Intel 80-core network-on-a-chip terascale processor
Authors: Timothy G. Mattson, Rob Van der Wijngaart, Michael Frumkin
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Intel's 80-core Terascale Processor was the first generally programmable microprocessor to break the Teraflops barrier. The primary goal for the chip was to study power management and on-die communication technologies. When announced in 2007, it received a great deal of attention for running a stencil kernel at 1.0 single precision TFLOPS while using only 97 Watts. The literature about the chip, however, focused on the hardware, saying little about the software environment or the kernels used to evaluate the chip.
A Heterogeneous Approach to UML Semantics
Authors: María Victoria Cengarle, Alexander Knapp, Andrzej Tarlecki, Martin Wirsing
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

UML models consist of several diagrams of different types describing different views of a software system ranging from specifications of the static system structure to descriptions of system snapshots and dynamic behaviour. In this paper a heterogeneous approach to the semantics of UML is proposed where each diagram type can be described in its "natural" semantics, and the relations between diagram types are expressed by appropriate translations. More formally, the UML family of diagram types is represented as a "heterogeneous institution environment": each diagram type is described as an appropriate institution where typically the data structures occurring in a diagram are represented by signature elements whereas the relationships between data and the dynamic behaviour of objects are captured by sentences; in several cases, the diagrams are themselves the sentences. The relationship between two diagram types is described by a socalled institution comorphism, and in case no institution comorphism exists, by a co-span of such comorphisms. Consistency conditions between different diagrams are derived from the comorphism translations. This heterogeneous semantic approach to UML is illustrated by several example diagram types including class diagrams, OCL, and interaction diagrams.
A PCA Based Unsupervised Feature Selection Algorithm
Authors: Yihui Luo, Shuchu Xiong, Sichun Wang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Principal components analysis (PCA) is an important approach to unsupervised dimensionality reduction. However, principal components (PCs) are a set of new variables carrying no clear physical meanings and still require all the original variables. To deal with this problem, the PC dominant feature (PCDF) is defined. Then, feature selection using them is considered and a new algorithm for determining such PC dominant features is proposed. Experimental results show that using the principal components as the basis the new algorithm can find a good feature subset.
Multi-Identity Single-Key Decryption without Random Oracles
Authors: Fuchun Guo, Yi Mu, Zhide Chen, Li Xu
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

Multi-Identity Single-Key Decryption (MISKD) is an Identity-Based Encryption (IBE) system where a private decryption key can map multiple public keys (identities). More exactly, in MISKD, a single private key can be used to decrypt multiple ciphertexts encrypted with different public keys associated to the private key. MISKD is a variant of IBE and offers convenience to users who have to manage many private keys in a standard IBE. The notion of MISKD was recently introduced by Guo, Mu and Chen in Pairing 2007. They proposed a concrete MISKD scheme and proved its security based on the Bilinear Strong Diffie-Hellman problem (q-BSDH) in random oracle model. In this paper, we present a novel MISKD scheme that is provably secure in the selective-ID model based on the Decisional Bilinear Diffie-Hellman (DBDH) assumption. Our scheme is more efficient in decryption.
Fast Mechanical Properties Estimation for Finite Element Model of Bone Tissue
Authors: Sheng Zheng Wang, Jie Yang
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Finite element model could be generated by computed tomography (CT) data set which provide accurate information about bone geometry and tissue density. In this work, an efficient approach for computing CT numbers for each element is presented. Mechanical properties of bone tissue can be estimated according to the relationship between tissue density and CT numbers. The experimental results show that this method can be applied to estimate mechanical properties of bone tissue accurately. The quality of meshes of geometry model and the number of materials are two key factors that affect the accuracy and efficiency of biomechanical analysis. In addition, the choice of relationship between CT numbers and elastic modulus should be proved by further study, which may help many researchers develop more accurate models.
Sequent Calculi for Branching Time Temporal Logics of Knowledge and Belief
Authors: Jūratė Sakalauskaitė
Venue: Informatica (2007)

In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators &ldquo;next&rdquo; and &ldquo;until&rdquo; with the branching temporal logic operator &ldquo;on all paths&rdquo;. The latter operator is interpreted with respect to a version of the bundle semantics. In addition the temporal logic of knowledge (belief) contains an indexed set of unary modal operators &ldquo;agent i knows&rdquo; (&ldquo;agent i believes&rdquo;) and it contains the modality of common knowledge (belief). For these logics we present sequent calculi with a restricted cut rule. Thus, we get proof systems where proof-search becomes decidable. The soundness and completeness for these calculi are proved.
Design and Implementation of TPEG Based RFID Application Service
Authors: Hyungon Kim
Venue: Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services (2007)

This paper presents the design of the TPEG-RFID event container and the results of a trial implementation. With regard to the designed TPEG-RFID event container, an example of its coding rules providing for RFID based bus-line information is presented. Implementation details of DMB data server and user terminal are also designed as software functional blocks. The presented implementation is an attempt to verify the feasibility of the designed TPEG-RFID application service system. In particular, the RFID based bus-line information service is specified. The test results show that users could utilize the current location based RFID application services with the designed system. 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 Grid Based Collaborative Design System
Authors: Tieming Su, Xiaoliang Tai, Weizhen Zhang, Zongying Ou
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

A collaborative design system architecture based on Grid is proposed. The architecture can take full advantage of grid features such as computing capability, massive data storage and device sharing etc., which is more suitable for the development of a complex collaborative design environment compared with the widely used Distributed Component Object and existing Grid based collaborative design architectures. Under this architecture, the construction method of Grid services is researched. Parallel and distributed Grid computing technology is used to increase the efficiency of complex product design. A collaborative modeling method based on XML is put forward to support real-time modeling by using design semantics instead of 3D solid model data transport. Finally, a collaborative design prototype system based on Globus Toolkit 4.0 is presented and analyzed.
Migration from Traditional Networks to Converged Next Generation Networks Architecture with Guaranteed Quality of Service
Authors: Cherif Ghazel, Leila Saïdane
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The development of more powerful communication systems, such as NGN networks, will soon make traditional communication systems obsolete. Instead of wasting these expensive and functional resources, it is more economical to explore ways of transforming them into sophisticated NGN-compatible architectures. This can be achieved through a suitably designed migration process from vertical networks with separate services to horizontal multiservice converged networks. However, different operators have different needs and objectives when undertaking this all-important migration process. In this work, we propose a migration strategy, which takes several factors into consideration. In particular, the proposed migration strategy aims for assisting established operators to capitalize on their existing resources and migrate smoothly towards converged NGN architecture. Most importantly, the desired upgrade is achieved while satisfying requirements in terms of QoS guarantees.
Classification with diffuse or incomplete information
Authors: Amaury Caballero, Kang Yen
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

In many different fields like finance, business, pattern recognition, communication and many other applications, analysts are often faced with the task of classifying items based on historical or measured data. A major difficulty faced by such analysts is that data to be classified can often be quite complex, with numerous interrelated variables, or even incomplete. The time and effort required to develop a model to solve accurately such classification problems can be significant. The use of rough sets and fuzzy logic give the analyst a powerful tool for solving the proposed task. The work is focused on analyzing the advantages of these methods, from the point of view of their simplicity and time consuming.
Token-Based Payment in Dynamic SAML-Based Federations
Authors: David J. Lutz, Burkhard Stiller
Venue: Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services (2008)

The newly developed approach on token-based payments introduces an integration of payments with current schemes for Identity Federations based on SAML. This new design utilizes an established federation infrastructure as well as its protocols. Only relevant mechanisms to support the payment on the federation infrastructure level are extended.
Autonomous transfer for reinforcement learning
Authors: Matthew E. Taylor, Gregory Kuhlmann, Peter Stone
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Recent work in transfer learning has succeeded in making reinforcement learning algorithms more efficient by incorporating knowledge from previous tasks. However, such methods typically must be provided either a full model of the tasks or an explicit relation mapping one task into the other. An autonomous agent may not have access to such high-level information, but would be able to analyze its experience to find similarities between tasks. In this paper we introduce Modeling Approximate State Transitions by Exploiting Regression (MASTER), a method for automatically learning a mapping from one task to another through an agent's experience. We empirically demonstrate that such learned relationships can significantly improve the speed of a reinforcement learning algorithm in a series of Mountain Car tasks. Additionally, we demonstrate that our method may also assist with the difficult problem of task selection for transfer.