Compiling ER Specifications into Declarative Programs

Abstract: This paper proposes an environment to support high-level database programming in a declarative programming language. In order to ensure safe database updates, all access and update operations related to the database are generated from high-level descriptions in the entity- relationship (ER) model. We propose a representation of ER diagrams in the declarative language Curry so that they can be constructed by various tools and then translated into this representation. Furthermore, we have implemented a compiler from this representation into a Curry program that provides access and update operations based on a high-level API for database programming.


Web-based Interface in Public Cluster

Abstract: A web-based interface dedicated for cluster computer which is publicly accessible for free is introduced. The interface plays an important role to enable secure public access, while providing user-friendly computational environment for end-users and easy maintainance for administrators as well. The whole architecture which integrates both aspects of hardware and software is briefly explained. It is argued that the public cluster is globally a unique approach, and could be a new kind of e-learning system especially for parallel programming communities.


Spreadsheet Engineering: A Research Framework

Abstract: Spreadsheet engineering adapts the lessons of software engineering to spreadsheets, providing eight principles as a framework for organizing spreadsheet programming recommendations. Spreadsheets raise issues inadequately addressed by software engineering. Spreadsheets are a powerful modeling language, allowing strategic rapid model change, and enabling exploratory modeling. Spreadsheets users learn slowly with experience because they focus on the problem domain not programming. The heterogeneity of spreadsheet users requires a taxonomy to guide recommendations. Deployment of best practices is difficult and merits research.


Singular Curves in the Joint Space and Cusp Points of 3-RPR parallel manipulators

Abstract: This paper investigates the singular curves in the joint space of a family of planar parallel manipulators. It focuses on special points, referred to as cusp points, which may appear on these curves. Cusp points play an important role in the kinematic behavior of parallel manipulators since they make possible a nonsingular change of assembly mode. The purpose of this study is twofold. First, it exposes a method to compute joint space singular curves of 3-RPR planar parallel manipulators. Second, it presents an algorithm for detecting and computing all cusp points in the joint space of these same manipulators.


Exploring the Composition of Unit Test Suites

Abstract: In agile software development, test code can considerably contribute to the overall source code size. Being a valuable asset both in terms of verification and documentation, the composition of a test suite needs to be well understood in order to identify opportunities as well as weaknesses for further evolution. In this paper, we argue that the visualization of structural characteristics is a viable means to support the exploration of test suites. Thanks to general agreement on a limited set of key test design principles, such visualizations are relatively easy to interpret. In particular, we present visualizations that support testers in (i) locating test cases; (ii) examining the relation between test code and production code; and (iii) studying the composition of and dependencies within test cases. By means of two case studies, we demonstrate how visual patterns help to identify key test suite characteristics. This approach forms the first step in assisting a developer to build up understanding about test suites beyond code reading.


PIDoc: Wiki style Literate Programming for Prolog

Abstract: This document introduces PlDoc, a literate programming system for Prolog. Starting point for PlDoc was minimal distraction from the programming task and maximal immediate reward, attempting to seduce the programmer to use the system. Minimal distraction is achieved using structured comments that are as closely as possible related to common Prolog documentation practices. Immediate reward is provided by a web interface powered from the Prolog development environment that integrates searching and browsing application and system documentation. When accessed from localhost, it is possible to go from documentation shown in a browser to the source code displayed in the user's editor of choice.


Discriminative Phoneme Sequences Extraction for Non-Native Speaker's Origin Classification

Abstract: In this paper we present an automated method for the classification of the origin of non-native speakers. The origin of non-native speakers could be identified by a human listener based on the detection of typical pronunciations for each nationality. Thus we suppose the existence of several phoneme sequences that might allow the classification of the origin of non-native speakers. Our new method is based on the extraction of discriminative sequences of phonemes from a non-native English speech database. These sequences are used to construct a probabilistic classifier for the speakers' origin. The existence of discriminative phone sequences in non-native speech is a significant result of this work. The system that we have developed achieved a significant correct classification rate of 96.3% and a significant error reduction compared to some other tested techniques.


On the defence notion

Abstract: 'Trojan horses', 'logic bombs', 'armoured viruses' and 'cryptovirology' are terms recalling war gears. In fact, concepts of attack and defence drive the world of computer virology, which looks like a war universe in an information society. This war has several shapes, from invasions of a network by worms, to military and industrial espionage ...


Performance Bounds for Lambda Policy Iteration and Application to the Game of Tetris

Abstract: We consider the discrete-time infinite-horizon optimal control problem formalized by Markov Decision Processes. We revisit the work of Bertsekas and Ioffe, that introduced $\lambda$ Policy Iteration, a family of algorithms parameterized by $\lambda$ that generalizes the standard algorithms Value Iteration and Policy Iteration, and has some deep connections with the Temporal Differences algorithm TD($\lambda$) described by Sutton and Barto. We deepen the original theory developped by the authors by providing convergence rate bounds which generalize standard bounds for Value Iteration described for instance by Puterman. Then, the main contribution of this paper is to develop the theory of this algorithm when it is used in an approximate form and show that this is sound. Doing so, we extend and unify the separate analyses developped by Munos for Approximate Value Iteration and Approximate Policy Iteration. Eventually, we revisit the use of this algorithm in the training of a Tetris playing controller as originally done by Bertsekas and Ioffe. We provide an original performance bound that can be applied to such an undiscounted control problem. Our empirical results are different from those of Bertsekas and Ioffe (which were originally qualified as "paradoxical" and "intriguing"), and much more conform to what one would expect from a learning experiment. We discuss the possible reason for such a difference.


Addendum to Research MMMCV; A Man/Microbio/Megabio/Computer Vision

Abstract: In October 2007, a Research Proposal for the University of Sydney, Australia, the author suggested that biovie-physical phenomenon as `electrodynamic dependant biological vision', is governed by relativistic quantum laws and biovision. The phenomenon on the basis of `biovielectroluminescence', satisfies man/microbio/megabio/computer vision (MMMCV), as a robust candidate for physical and visual sciences. The general aim of this addendum is to present a refined text of Sections 1-3 of that proposal and highlighting the contents of its Appendix in form of a `Mechanisms' Section. We then briefly remind in an article aimed for December 2007, by appending two more equations into Section 3, a theoretical II-time scenario as a time model well-proposed for the phenomenon. The time model within the core of the proposal, plays a significant role in emphasizing the principle points on Objectives no. 1-8, Sub-hypothesis 3.1.2, mentioned in Article [arXiv:0710.0410]. It also expresses the time concept in terms of causing quantized energy f(|E|) of time |t|, emit in regard to shortening the probability of particle loci as predictable patterns of particle's un-occurred motion, a solution to Heisenberg's uncertainty principle (HUP) into a simplistic manner. We conclude that, practical frames via a time algorithm to this model, fixates such predictable patterns of motion of scenery bodies onto recordable observation points of a MMMCV system. It even suppresses/predicts superposition phenomena coming from a human subject and/or other bio-subjects for any decision making event, e.g., brainwave quantum patterns based on vision. Maintaining the existential probability of Riemann surfaces of II-time scenarios in the context of biovielectroluminescence, makes motion-prediction a possibility.


Combined Acoustic and Pronunciation Modelling for Non-Native Speech Recognition

Abstract: In this paper, we present several adaptation methods for non-native speech recognition. We have tested pronunciation modelling, MLLR and MAP non-native pronunciation adaptation and HMM models retraining on the HIWIRE foreign accented English speech database. The ``phonetic confusion'' scheme we have developed consists in associating to each spoken phone several sequences of confused phones. In our experiments, we have used different combinations of acoustic models representing the canonical and the foreign pronunciations: spoken and native models, models adapted to the non-native accent with MAP and MLLR. The joint use of pronunciation modelling and acoustic adaptation led to further improvements in recognition accuracy. The best combination of the above mentioned techniques resulted in a relative word error reduction ranging from 46% to 71%.


Instruction sequences with indirect jumps

Abstract: We study sequential programs that are instruction sequences with direct and indirect jump instructions. The intuition is that indirect jump instructions are jump instructions where the position of the instruction to jump to is the content of some memory cell. We consider several kinds of indirect jump instructions. For each kind, we define the meaning of programs with indirect jump instructions of that kind by means of a translation into programs without indirect jump instructions. For each kind, the intended behaviour of a program with indirect jump instructions of that kind under execution is the behaviour of the translated program under execution on interaction with some memory device.


An interface group for process components

Abstract: We take a process component as a pair of an interface and a behaviour. We study the composition of interacting process components in the setting of process algebra. We formalize the interfaces of interacting process components by means of an interface group. An interesting feature of the interface group is that it allows for distinguishing between expectations and promises in interfaces of process components. This distinction comes into play in case components with both client and server behaviour are involved.


Machine structure oriented control code logic

Abstract: Control code is a concept that is closely related to a frequently occurring practitioner's view on what is a program: code that is capable of controlling the behaviour of some machine. We present a logical approach to explain issues concerning control codes that are independent of the details of the behaviours that are controlled. Using this approach, such issues can be explained at a very abstract level. We illustrate this among other things by means of an example about the production of a new compiler from an existing one. The approach is based on abstract machine models, called machine structures. We introduce a model of systems that provide execution environments for the executable codes of machine structures and use it to go into portability of control codes.


On the operating unit size of load/store architectures

Abstract: We introduce a strict version of the concept of a load/store instruction set architecture in the setting of Maurer machines. We take the view that transformations on the states of a Maurer machine are achieved by applying threads as considered in thread algebra to the Maurer machine. We study how the transformations on the states of the main memory of a strict load/store instruction set architecture that can be achieved by applying threads depend on the operating unit size, the cardinality of the instruction set, and the maximal number of states of the threads.


A thread calculus with molecular dynamics

Abstract: We present a theory of threads, interleaving of threads, and interaction between threads and services with features of molecular dynamics, a model of computation that bears on computations in which dynamic data structures are involved. Threads can interact with services of which the states consist of structured data objects and computations take place by means of actions which may change the structure of the data objects. The features introduced include restriction of the scope of names used in threads to refer to data objects. Because that feature makes it troublesome to provide a model based on structural operational semantics and bisimulation, we construct a projective limit model for the theory.


Routing in Outer Space: Improved Security and Energy-Efficiency in Multi-Hop Wireless Networks

Abstract: In this paper we consider security-related and energy-efficiency issues in multi-hop wireless networks. We start our work from the observation, known in the literature, that shortest path routing creates congested areas in multi-hop wireless networks. These areas are critical--they generate both security and energy efficiency issues. We attack these problems and set out routing in outer space, a new routing mechanism that transforms any shortest path routing protocol (or approximated versions of it) into a new protocol that, in case of uniform traffic, guarantees that every node of the network is responsible for relaying the same number of messages, on expectation. We can show that a network that uses routing in outer space does not have congested areas, does not have the associated security-related issues, does not encourage selfish positioning, and, in spite of using more energy globally, lives longer of the same network using the original routing protocol.


SWI-Prolog and the Web

Abstract: Where Prolog is commonly seen as a component in a Web application that is either embedded or communicates using a proprietary protocol, we propose an architecture where Prolog communicates to other components in a Web application using the standard HTTP protocol. By avoiding embedding in external Web servers development and deployment become much easier. To support this architecture, in addition to the transfer protocol, we must also support parsing, representing and generating the key Web document types such as HTML, XML and RDF. This paper motivates the design decisions in the libraries and extensions to Prolog for handling Web documents and protocols. The design has been guided by the requirement to handle large documents efficiently. The described libraries support a wide range of Web applications ranging from HTML and XML documents to Semantic Web RDF processing. To appear in Theory and Practice of Logic Programming (TPLP)


An On-the-fly Tableau-based Decision Procedure for PDL-Satisfiability

Abstract: We present a tableau-based algorithm for deciding satisfiability for propositional dynamic logic (PDL) which builds a finite rooted tree with ancestor loops and passes extra information from children to parents to separate good loops from bad loops during backtracking. It is easy to implement, with potential for parallelisation, because it constructs a pseudo-model ``on the fly'' by exploring each tableau branch independently. But its worst-case behaviour is 2EXPTIME rather than EXPTIME. A prototype implementation in the TWB (http://twb.rsise.anu.edu.au) is available.


Am\'elioration des Performances des Syst\`emes Automatiques de Reconnaissance de la Parole pour la Parole Non Native

Abstract: In this article, we present an approach for non native automatic speech recognition (ASR). We propose two methods to adapt existing ASR systems to the non-native accents. The first method is based on the modification of acoustic models through integration of acoustic models from the mother tong. The phonemes of the target language are pronounced in a similar manner to the native language of speakers. We propose to combine the models of confused phonemes so that the ASR system could recognize both concurrent pronounciations. The second method we propose is a refinment of the pronounciation error detection through the introduction of graphemic constraints. Indeed, non native speakers may rely on the writing of words in their uttering. Thus, the pronounctiation errors might depend on the characters composing the words. The average error rate reduction that we observed is (22.5%) relative for the sentence error rate, and 34.5% (relative) in word error rate.


Simple Recursive Games

Abstract: We define the class of "simple recursive games". A simple recursive game is defined as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving simple recursive games and obtain an almost-linear time comparison-based algorithm for computing an equilibrium of such a game. The existence of a linear time comparison-based algorithm remains an open problem.


Considerations on P vs NP

Abstract: In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set E(A) containing propositional calculus formulae, each of which requires the algorithm A to take non-polynomial time to find the truth-values of its propositional letters satisfying it. Moreover, E(A)'s size is an exponential function of n, which makes it impossible to detect such formulae in a polynomial time. Hence, the satisfability problem does not have a polynomial complexity


Dynamic aspects of individual design activities. A cognitive ergonomics viewpoint

Abstract: This paper focuses on the use of knowledge possessed by designers. Data collection was based on observations (by the cognitive ergonomics researcher) and simultaneous verbalisations (by the designers) in empirical studies conducted in the context of industrial design projects. The contribution of this research is typical of cognitive ergonomics, in that it provides data on actual activities implemented by designers in their actual work situation (rather than on prescribed and/or idealised processes and methods). Data presented concern global strategies (the way in which designers actually organise their activity) and local strategies (reuse in design). Results from cognitive ergonomics and other research that challenges the way in which people are supposed to work with existing systems are generally not received warmly. Abundant corroboration of such results is required before industry may consider taking them into account. The opportunistic organisation of design activity is taken here as an example of this reluctance. The results concerning this aspect of design have been verified repeatedly, but only prototypes and experimental systems implementing some of the requirements formulated on their basis, are under development.


Designing as Construction of Representations: A Dynamic Viewpoint in Cognitive Design Research

Abstract: This article presents a cognitively oriented viewpoint on design. It focuses on cognitive, dynamic aspects of real design, i.e., the actual cognitive activity implemented by designers during their work on professional design projects. Rather than conceiving de-signing as problem solving - Simon's symbolic information processing (SIP) approach - or as a reflective practice or some other form of situated activity - the situativity (SIT) approach - we consider that, from a cognitive viewpoint, designing is most appropriately characterised as a construction of representations. After a critical discussion of the SIP and SIT approaches to design, we present our view-point. This presentation concerns the evolving nature of representations regarding levels of abstraction and degrees of precision, the function of external representations, and specific qualities of representation in collective design. Designing is described at three levels: the organisation of the activity, its strategies, and its design-representation construction activities (different ways to generate, trans-form, and evaluate representations). Even if we adopt a "generic design" stance, we claim that design can take different forms depending on the nature of the artefact, and we propose some candidates for dimensions that allow a distinction to be made between these forms of design. We discuss the potential specificity of HCI design, and the lack of cognitive design research occupied with the quality of design. We close our discussion of representational structures and activities by an outline of some directions regarding their functional linkages.


Optimizing Latency and Reliability of Pipeline Workflow Applications

Abstract: Mapping applications onto heterogeneous platforms is a difficult challenge, even for simple application patterns such as pipeline graphs. The problem is even more complex when processors are subject to failure during the execution of the application. In this paper, we study the complexity of a bi-criteria mapping which aims at optimizing the latency (i.e., the response time) and the reliability (i.e., the probability that the computation will be successful) of the application. Latency is minimized by using faster processors, while reliability is increased by replicating computations on a set of processors. However, replication increases latency (additional communications, slower processors). The application fails to be executed only if all the processors fail during execution. While simple polynomial algorithms can be found for fully homogeneous platforms, the problem becomes NP-hard when tackling heterogeneous platforms. This is yet another illustration of the additional complexity added by heterogeneity.


The Price of Selfish Stackelberg Leadership in a Network Game

Abstract: We study a class of games in which a finite number of agents each controls a quantity of flow to be routed through a network, and are able to split their own flow between multiple paths through the network. Recent work on this model has contrasted the social cost of Nash equilibria with the best possible social cost. Here we show that additional costs are incurred in situations where a selfish ``leader'' agent allocates his flow, and then commits to that choice so that other agents are compelled to minimise their own cost based on the first agent's choice. We find that even in simple networks, the leader can often improve his own cost at the expense of increased social cost. Focusing on the 2-player case, we give upper and lower bounds on the worst-case additional cost incurred.


Fair Scheduling in OFDMA-based Wireless Systems with QoS Constraints

Abstract: In this work we consider the problem of downlink resource allocation for proportional fairness of long term received rates of data users and quality of service for real time sessions in an OFDMA-based wireless system. The base station allocates available power and bandwidth to individual users based on long term average received rates, QoS based rate constraints and channel conditions. We solve the underlying constrained optimization problem and propose an algorithm that achieves the optimal allocation. Numerical evaluation results show that the proposed algorithm provides better QoS to voice and video sessions while providing more and fair rates to data users in comparison with existing schemes.


Practical Resource Allocation Algorithms for QoS in OFDMA-based Wireless Systems

Abstract: In this work we propose an efficient resource allocation algorithm for OFDMA based wireless systems supporting heterogeneous traffic. The proposed algorithm provides proportionally fairness to data users and short term rate guarantees to real-time users. Based on the QoS requirements, buffer occupancy and channel conditions, we propose a scheme for rate requirement determination for delay constrained sessions. Then we formulate and solve the proportional fair rate allocation problem subject to those rate requirements and power/bandwidth constraints. Simulations results show that the proposed algorithm provides significant improvement with respect to the benchmark algorithm.


Conception individuelle et collective. Approche de l'ergonomie cognitive [Individual and Collective Design. The Cognitive-Ergonomics Approach]

Abstract: This text presents the cognitive-ergonomics approach to design, in both its individual and collective form. It focuses on collective design with respect to individual design. The theoretical framework adopted is that of information processing, specified for design problems. The cognitive characteristics of design problems are presented: the effects of their ill-defined character and of the different types of representation implemented in solving these problems, amongst others the more or less "satisficing" character of the different possible solutions. The text first describes the cognitive activities implemented in both individual and collective design: different types of control activities and of the executive activities of solution development and evaluation. Specific collective-design characteristics are then presented: co-design and distributed-design activities, temporo-operative and cognitive synchronisation, and different types of argumentation, of co-designers' intervention modes in the design process, of solution-proposals evaluation. The paper concludes by a confrontation between the two types of design, individual and collective.


Towards a Sound Theory of Adaptation for the Simple Genetic Algorithm

Abstract: The pace of progress in the fields of Evolutionary Computation and Machine Learning is currently limited -- in the former field, by the improbability of making advantageous extensions to evolutionary algorithms when their capacity for adaptation is poorly understood, and in the latter by the difficulty of finding effective semi-principled reductions of hard real-world problems to relatively simple optimization problems. In this paper we explain why a theory which can accurately explain the simple genetic algorithm's remarkable capacity for adaptation has the potential to address both these limitations. We describe what we believe to be the impediments -- historic and analytic -- to the discovery of such a theory and highlight the negative role that the building block hypothesis (BBH) has played. We argue based on experimental results that a fundamental limitation which is widely believed to constrain the SGA's adaptive ability (and is strongly implied by the BBH) is in fact illusionary and does not exist. The SGA therefore turns out to be more powerful than it is currently thought to be. We give conditions under which it becomes feasible to numerically approximate and study the multivariate marginals of the search distribution of an infinite population SGA over multiple generations even when its genomes are long, and explain why this analysis is relevant to the riddle of the SGA's remarkable adaptive abilities.


Predicting relevant empty spots in social interaction

Abstract: An empty spot refers to an empty hard-to-fill space which can be found in the records of the social interaction, and is the clue to the persons in the underlying social network who do not appear in the records. This contribution addresses a problem to predict relevant empty spots in social interaction. Homogeneous and inhomogeneous networks are studied as a model underlying the social interaction. A heuristic predictor function approach is presented as a new method to address the problem. Simulation experiment is demonstrated over a homogeneous network. A test data in the form of baskets is generated from the simulated communication. Precision to predict the empty spots is calculated to demonstrate the performance of the presented approach.


N3Logic: A Logical Framework For the World Wide Web

Abstract: The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the Semantic Web provides a unifying representation of richly structured data. Adding logic to the Web implies the use of rules to make inferences, choose courses of action, and answer questions. This logic must be powerful enough to describe complex properties of objects but not so powerful that agents can be tricked by being asked to consider a paradox. The Web has several characteristics that can lead to problems when existing logics are used, in particular, the inconsistencies that inevitably arise due to the openness of the Web, where anyone can assert anything. N3Logic is a logic that allows rules to be expressed in a Web environment. It extends RDF with syntax for nested graphs and quantified variables and with predicates for implication and accessing resources on the Web, and functions including cryptographic, string, math. The main goal of N3Logic is to be a minimal extension to the RDF data model such that the same language can be used for logic and data. In this paper, we describe N3Logic and illustrate through examples why it is an appropriate logic for the Web.


Capacity as a Fundamental Metric for Mechanism Design in the Information Economy

Abstract: The auction theory literature has so far focused mostly on the design of mechanisms that takes the revenue or the efficiency as a yardstick. However, scenarios where the {\it capacity}, which we define as \textit{``the number of bidders the auctioneer wants to have a positive probability of getting the item''}, is a fundamental concern are ubiquitous in the information economy. For instance, in sponsored search auctions (SSA's) or in online ad-exchanges, the true value of an ad-slot for an advertiser is inherently derived from the conversion-rate, which in turn depends on whether the advertiser actually obtained the ad-slot or not; thus, unless the capacity of the underlying auction is large, key parameters, such as true valuations and advertiser-specific conversion rates, will remain unknown or uncertain leading to inherent inefficiencies in the system. In general, the same holds true for all information goods/digital goods. We initiate a study of mechanisms, which take capacity as a yardstick, in addition to revenue/efficiency. We show that in the case of a single indivisible item one simple way to incorporate capacity constraints is via designing mechanisms to sell probability distributions, and that under certain conditions, such optimal probability distributions could be identified using a Linear programming approach. We define a quantity called {\it price of capacity} to capture the tradeoff between capacity and revenue/efficiency. We also study the case of sponsored search auctions. Finally, we discuss how general such an approach via probability spikes can be made, and potential directions for future investigations.


Applying Software Defect Estimations: Using a Risk Matrix for Tuning Test Effort

Abstract: Applying software defect esimation techniques and presenting this information in a compact and impactful decision table can clearly illustrate to collaborative groups how critical this position is in the overall development cycle. The Test Risk Matrix described here has proven to be a valuable addition to the management tools and approaches used in developing large scale software on several releases. Use of this matrix in development planning meetings can clarify the attendant risks and possible consequences of carrying out or bypassing specific test activities.


Data Structures for Mergeable Trees

Abstract: Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant requires merging two paths in a single operation. In contrast to the standard problem, in which only one tree arc changes at a time, a single merge operation can change many arcs. In spite of this, we develop a data structure that supports merges on an n-node forest in O(log^2 n) amortized time and all other standard tree operations in O(log n) time (amortized, worst-case, or randomized depending on the underlying data structure). For the special case that occurs in the motivating application, in which arbitrary arc deletions (cuts) are not allowed, we give a data structure with an O(log n) time bound per operation. This is asymptotically optimal under certain assumptions. For the even-more special case in which both cuts and parent queries are disallowed, we give an alternative O(log n)-time solution that uses standard dynamic trees as a black box. This solution also applies to the motivating application. Our methods use previous work on dynamic trees in various ways, but the analysis of each algorithm requires novel ideas. We also investigate lower bounds for the problem under various assumptions.


An analysis of a random algorithm for estimating all the matchings

Abstract: Counting the number of all the matchings on a bipartite graph has been transformed into calculating the permanent of a matrix obtained from the extended bipartite graph by Yan Huo, and Rasmussen presents a simple approach (RM) to approximate the permanent, which just yields a critical ratio O($n\omega(n)$) for almost all the 0-1 matrices, provided it's a simple promising practical way to compute this #P-complete problem. In this paper, the performance of this method will be shown when it's applied to compute all the matchings based on that transformation. The critical ratio will be proved to be very large with a certain probability, owning an increasing factor larger than any polynomial of $n$ even in the sense for almost all the 0-1 matrices. Hence, RM fails to work well when counting all the matchings via computing the permanent of the matrix. In other words, we must carefully utilize the known methods of estimating the permanent to count all the matchings through that transformation.


Kinematic calibration of orthoglide-type mechanisms

Abstract: The paper proposes a novel calibration approach for the Orthoglide-type mechanisms based on observations of the manipulator leg parallelism during mo-tions between the prespecified test postures. It employs a low-cost measuring system composed of standard comparator indicators attached to the universal magnetic stands. They are sequentially used for measuring the deviation of the relevant leg location while the manipulator moves the TCP along the Cartesian axes. Using the measured differences, the developed algorithm estimates the joint offsets that are treated as the most essential parameters to be adjusted. The sensitivity of the meas-urement methods and the calibration accuracy are also studied. Experimental re-sults are presented that demonstrate validity of the proposed calibration technique


A Mobile Computing Architecture for Numerical Simulation

Abstract: The domain of numerical simulation is a place where the parallelization of numerical code is common. The definition of a numerical context means the configuration of resources such as memory, processor load and communication graph, with an evolving feature: the resources availability. A feature is often missing: the adaptability. It is not predictable and the adaptable aspect is essential. Without calling into question these implementations of these codes, we create an adaptive use of these implementations. Because the execution has to be driven by the availability of main resources, the components of a numeric computation have to react when their context changes. This paper offers a new architecture, a mobile computing architecture, based on mobile agents and JavaSpace. At the end of this paper, we apply our architecture to several case studies and obtain our first results.


Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming

Abstract: Building rules on top of ontologies is the ultimate goal of the logical layer of the Semantic Web. To this aim an ad-hoc mark-up language for this layer is currently under discussion. It is intended to follow the tradition of hybrid knowledge representation and reasoning systems such as $\mathcal{AL}$-log that integrates the description logic $\mathcal{ALC}$ and the function-free Horn clausal language \textsc{Datalog}. In this paper we consider the problem of automating the acquisition of these rules for the Semantic Web. We propose a general framework for rule induction that adopts the methodological apparatus of Inductive Logic Programming and relies on the expressive and deductive power of $\mathcal{AL}$-log. The framework is valid whatever the scope of induction (description vs. prediction) is. Yet, for illustrative purposes, we also discuss an instantiation of the framework which aims at description and turns out to be useful in Ontology Refinement. Keywords: Inductive Logic Programming, Hybrid Knowledge Representation and Reasoning Systems, Ontologies, Semantic Web. Note: To appear in Theory and Practice of Logic Programming (TPLP)


The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions

Abstract: Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is undecidable. In this paper, we study the three-color and two-color Tantrix(TM) rotation puzzle problems (3-TRP and 2-TRP) and their variants. Restricting the number of allowed colors to three (respectively, to two) reduces the set of available Tantrix(TM) tiles from 56 to 14 (respectively, to 8). We prove that 3-TRP and 2-TRP are NP-complete, which answers a question raised by Holzer and Holzer in the affirmative. Since our reductions are parsimonious, it follows that the problems Unique-3-TRP and Unique-2-TRP are DP-complete under randomized reductions. We also show that the another-solution problems associated with 4-TRP, 3-TRP, and 2-TRP are NP-complete. Finally, we prove that the infinite variants of 3-TRP and 2-TRP are undecidable.


Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications

Abstract: This note considers reciprocal of primes in binary representation and shows that the conjecture that 0s exceed 1s in most cases continues to hold for primes less one million. The conjecture has also been tested for ternary representation with similar results. Some applications of this result to cryptography are discussed.


A Polynomial Time Algorithm for Graph Isomorphism

Abstract: We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two non-isomorphic graphs with the same eigenvalues.


Empirical Evaluation of Four Tensor Decomposition Algorithms

Abstract: Higher-order tensor decompositions are analogous to the familiar Singular Value Decomposition (SVD), but they transcend the limitations of matrices (second-order tensors). SVD is a powerful tool that has achieved impressive results in information retrieval, collaborative filtering, computational linguistics, computational vision, and other fields. However, SVD is limited to two-dimensional arrays of data (two modes), and many potential applications have three or more modes, which require higher-order tensor decompositions. This paper evaluates four algorithms for higher-order tensor decomposition: Higher-Order Singular Value Decomposition (HO-SVD), Higher-Order Orthogonal Iteration (HOOI), Slice Projection (SP), and Multislice Projection (MP). We measure the time (elapsed run time), space (RAM and disk space requirements), and fit (tensor reconstruction accuracy) of the four algorithms, under a variety of conditions. We find that standard implementations of HO-SVD and HOOI do not scale up to larger tensors, due to increasing RAM requirements. We recommend HOOI for tensors that are small enough for the available RAM and MP for larger tensors.


Autoregressive Time Series Forecasting of Computational Demand

Abstract: We study the predictive power of autoregressive moving average models when forecasting demand in two shared computational networks, PlanetLab and Tycoon. Demand in these networks is very volatile, and predictive techniques to plan usage in advance can improve the performance obtained drastically. Our key finding is that a random walk predictor performs best for one-step-ahead forecasts, whereas ARIMA(1,1,0) and adaptive exponential smoothing models perform better for two and three-step-ahead forecasts. A Monte Carlo bootstrap test is proposed to evaluate the continuous prediction performance of different models with arbitrary confidence and statistical significance levels. Although the prediction results differ between the Tycoon and PlanetLab networks, we observe very similar overall statistical properties, such as volatility dynamics.


Query Evaluation and Optimization in the Semantic Web

Abstract: We address the problem of answering Web ontology queries efficiently. An ontology is formalized as a Deductive Ontology Base (DOB), a deductive database that comprises the ontology's inference axioms and facts. A cost-based query optimization technique for DOB is presented. A hybrid cost model is proposed to estimate the cost and cardinality of basic and inferred facts. Cardinality and cost of inferred facts are estimated using an adaptive sampling technique, while techniques of traditional relational cost models are used for estimating the cost of basic facts and conjunctive ontology queries. Finally, we implement a dynamic-programming optimization algorithm to identify query evaluation plans that minimize the number of intermediate inferred facts. We modeled a subset of the Web ontology language OWL Lite as a DOB, and performed an experimental study to analyze the predictive capacity of our cost model and the benefits of the query optimization technique. Our study has been conducted over synthetic and real-world OWL ontologies, and shows that the techniques are accurate and improve query performance. To appear in Theory and Practice of Logic Programming (TPLP).


Bi-capacities -- Part II: the Choquet integral

Abstract: Bi-capacities arise as a natural generalization of capacities (or fuzzy measures) in a context of decision making where underlying scales are bipolar. They are able to capture a wide variety of decision behaviours, encompassing models such as Cumulative Prospect Theory (CPT). The aim of this paper in two parts is to present the machinery behind bi-capacities, and thus remains on a rather theoretical level, although some parts are firmly rooted in decision theory, notably cooperative game theory. The present second part focuses on the definition of Choquet integral. We give several expressions of it, including an expression w.r.t. the M\"obius transform. This permits to express the Choquet integral for 2-additive bi-capacities w.r.t. the interaction index.


Bi-capacities -- Part I: definition, M\"obius transform and interaction

Abstract: Bi-capacities arise as a natural generalization of capacities (or fuzzy measures) in a context of decision making where underlying scales are bipolar. They are able to capture a wide variety of decision behaviours, encompassing models such as Cumulative Prospect Theory (CPT). The aim of this paper in two parts is to present the machinery behind bi-capacities, and thus remains on a rather theoretical level, although some parts are firmly rooted in decision theory, notably cooperative game theory. The present first part is devoted to the introduction of bi-capacities and the structure on which they are defined. We define the M\"obius transform of bi-capacities, by just applying the well known theory of M\" obius functions as established by Rota to the particular case of bi-capacities. Then, we introduce derivatives of bi-capacities, by analogy with what was done for pseudo-Boolean functions (another view of capacities and set functions), and this is the key point to introduce the Shapley value and the interaction index for bi-capacities. This is done in a cooperative game theoretic perspective. In summary, all familiar notions used for fuzzy measures are available in this more general framework.


Derivative of functions over lattices as a basis for the notion of interaction between attributes

Abstract: The paper proposes a general notion of interaction between attributes, which can be applied to many fields in decision making and data analysis. It generalizes the notion of interaction defined for criteria modelled by capacities, by considering functions defined on lattices. For a given problem, the lattice contains for each attribute the partially ordered set of remarkable points or levels. The interaction is based on the notion of derivative of a function defined on a lattice, and appears as a generalization of the Shapley value or other probabilistic values.


A numerical approach for 3D manufacturing tolerances synthesis

Abstract: Making a product conform to the functional requirements indicated by the customer suppose to be able to manage the manufacturing process chosen to realise the parts. A simulation step is generally performed to verify that the expected generated deviations fit with these requirements. It is then necessary to assess the actual deviations of the process in progress. This is usually done by the verification of the conformity of the workpiece to manufacturing tolerances at the end of each set-up. It is thus necessary to determine these manufacturing tolerances. This step is called "manufacturing tolerance synthesis". In this paper, a numerical method is proposed to perform 3D manufacturing tolerances synthesis. This method uses the result of the numerical analysis of tolerances to determine influent mall displacement of surfaces. These displacements are described by small displacements torsors. An algorithm is then proposed to determine suitable ISO manufacturing tolerances.


Guarded Hybrid Knowledge Bases

Abstract: Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web.We define guarded hybrid knowledge bases (or g-hybrid knowledge bases) as knowledge bases that consist of a Description Logic knowledge base and a guarded logic program, similar to the DL+log knowledge bases from (Rosati 2006). G-hybrid knowledge bases enable an integration of Description Logics and Logic Programming where, unlike in other approaches, variables in the rules of a guarded program do not need to appear in positive non-DL atoms of the body, i.e. DL atoms can act as guards as well. Decidability of satisfiability checking of g-hybrid knowledge bases is shown for the particular DL DLRO, which is close to OWL DL, by a reduction to guarded programs under the open answer set semantics. Moreover, we show 2-EXPTIME-completeness for satisfiability checking of such g-hybrid knowledge bases. Finally, we discuss advantages and disadvantages of our approach compared with DL+log knowledge bases.


On Approximating Multi-Criteria TSP

Abstract: We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP). For multi-criteria Max-STSP, where the edge weights have to be symmetric, we devise an algorithm with an approximation ratio of 2/3 - eps. For multi-criteria Max-ATSP, where the edge weights may be asymmetric, we present an algorithm with a ratio of 1/2 - eps. Our algorithms work for any fixed number k of objectives. Furthermore, we present a deterministic algorithm for bi-criteria Max-STSP that achieves an approximation ratio of 7/27. Finally, we present a randomized approximation algorithm for the asymmetric multi-criteria minimum TSP with triangle inequality Min-ATSP. This algorithm achieves a ratio of log n + eps.


Mise en place de sc\'enarios pour la conception d'outils en Chirurgie Minimalement Invasive

Abstract: Nowadays, more and more surgical interventions are carried out in Minimally Invasive Surgery, to make the post-operative constraints less painful for the patient. Actually, new surgical tools or medical products are designed after informal discussions between surgeons and designers. The user requirements documents are the main document used by the mechanical designers to design and improve the product. Medical terms, often used by surgeons and employed to explain their needs, don't allow for an instantaneous understanding by designers. Unfortunately, this relation causes a dysfunction in the definition cycle of the product. Our aim is to work on the design process, its assistance thanks to methods and tools and on its organisation for better understandings and more complementarities between surgeons and designers. We propose on this article a design method already tested in the informatics domain: User Centred Design which takes the user into account more effectively in the process design. We already propose a scenario oriented design method centred on the user and represented as a scenario (Scenario-Based Design). We start in this article by clarifying these concepts before detailing their implementation for the design of a new surgical tool.


Decoding the Golden Code: a VLSI design

Abstract: The recently proposed Golden code is an optimal space-time block code for 2 X 2 multiple-input multiple-output (MIMO) systems. The aim of this work is the design of a VLSI decoder for a MIMO system coded with the Golden code. The architecture is based on a rearrangement of the sphere decoding algorithm that achieves maximum-likelihood (ML) decoding performance. Compared to other approaces, the proposed solution exhibits an inherent flexibility in terms of modulation schemes QAM modulation size and this makes our architecture particularly suitable for adaptive modulation schemes.


Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio

Abstract: The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of TSP tours, each of which approximates the optimal solution within at most a factor of 2. We consider the problem of finding among these tours the one that gives the closest approximation, i.e.\ the \emph{minimum-weight double-tree shortcutting}. Previously, we gave an efficient algorithm for this problem, and carried out its experimental analysis. In this paper, we address the related question of the worst-case approximation ratio for the minimum-weight double-tree shortcutting method. In particular, we give lower bounds on the approximation ratio in some specific metric spaces: the ratio of 2 in the discrete shortest path metric, 1.622 in the planar Euclidean metric, and 1.666 in the planar Minkowski metric. The first of these lower bounds is tight; we conjecture that the other two bounds are also tight, and in particular that the minimum-weight double-tree method provides a 1.622-approximation for planar Euclidean TSP.


Are networks with more edges easier to synchronize?

Abstract: In this paper, the relationship between the network synchronizability and the edge distribution of its associated graph is investigated. First, it is shown that adding one edge to a cycle definitely decreases the network sychronizability. Then, since sometimes the synchronizability can be enhanced by changing the network structure, the question of whether the networks with more edges are easier to synchronize is addressed. It is shown by examples that the answer is negative. This reveals that generally there are redundant edges in a network, which not only make no contributions to synchronization but actually may reduce the synchronizability. Moreover, an example shows that the node betweenness centrality is not always a good indicator for the network synchronizability. Finally, some more examples are presented to illustrate how the network synchronizability varies following the addition of edges, where all the examples show that the network synchronizability globally increases but locally fluctuates as the number of added edges increases.


Proof nets for display logic

Abstract: This paper explores several extensions of proof nets for the Lambek calculus in order to handle the different connectives of display logic in a natural way. The new proof net calculus handles some recent additions to the Lambek vocabulary such as Galois connections and Grishin interactions. It concludes with an exploration of the generative capacity of the Lambek-Grishin calculus, presenting an embedding of lexicalized tree adjoining grammars into the Lambek-Grishin calculus.


A Compact Self-organizing Cellular Automata-based Genetic Algorithm

Abstract: A Genetic Algorithm (GA) is proposed in which each member of the population can change schemata only with its neighbors according to a rule. The rule methodology and the neighborhood structure employ elements from the Cellular Automata (CA) strategies. Each member of the GA population is assigned to a cell and crossover takes place only between adjacent cells, according to the predefined rule. Although combinations of CA and GA approaches have appeared previously, here we rely on the inherent self-organizing features of CA, rather than on parallelism. This conceptual shift directs us toward the evolution of compact populations containing only a handful of members. We find that the resulting algorithm can search the design space more efficiently than traditional GA strategies due to its ability to exploit mutations within this compact self-organizing population. Consequently, premature convergence is avoided and the final results often are more accurate. In order to reinforce the superior mutation capability, a re-initialization strategy also is implemented. Ten test functions and two benchmark structural engineering truss design problems are examined in order to demonstrate the performance of the method.


An annotation based approach to support design communication

Abstract: The aim of this paper is to propose an approach based on the concept of annotation for supporting design communication. In this paper, we describe a co-operative design case study where we analyse some annotation practices, mainly focused on design minutes recorded during project reviews. We point out specific requirements concerning annotation needs. Based on these requirements, we propose an annotation model, inspired from the Speech Act Theory (SAT) to support communication in a 3D digital environment. We define two types of annotations in the engineering design context, locutionary and illocutionary annotations. The annotations we describe in this paper are materialised by a set of digital artefacts, which have a semantic dimension allowing express/record elements of technical justifications, traces of contradictory debates, etc. In this paper, we first clarify the semantic annotation concept, and we define general properties of annotations in the engineering design context, and the role of annotations in different design project situations. After the description of the case study, where we observe and analyse annotations usage during the design reviews and minute making, the last section is dedicated to present our approach. We then describe the SAT concept, and define the concept of annotation acts. We conclude with a description of basic annotation functionalities that are actually implemented in a software, based on our approach.


Axiomatic structure of k-additive capacities

Abstract: In this paper we deal with the problem of axiomatizing the preference relations modelled through Choquet integral with respect to a $k$-additive capacity, i.e. whose M\"obius transform vanishes for subsets of more than $k$ elements. Thus, $k$-additive capacities range from probability measures ($k=1$) to general capacities ($k=n$). The axiomatization is done in several steps, starting from symmetric 2-additive capacities, a case related to the Gini index, and finishing with general $k$-additive capacities. We put an emphasis on 2-additive capacities. Our axiomatization is done in the framework of social welfare, and complete previous results of Weymark, Gilboa and Ben Porath, and Gajdos.


The M\"obius transform on symmetric ordered structures and its application to capacities on finite sets

Abstract: Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry necessarily entails non associativity, hence computing rules are defined in order to deal with non associativity. We study in details computing rules, which we endow with a partial order. This permits to find solutions to the inversion formula underlying the M\"obius transform. Then we apply these results to the case of capacities, a notion from decision theory which corresponds, in the language of ordered sets, to order preserving mappings, preserving also top and bottom. In this case, the solution of the inversion formula is called the M\"obius transform of the capacity. Properties and examples of M\"obius transform of sup-preserving and inf-preserving capacities are given.


Normalization of IZF with Replacement

Abstract: ZF is a well investigated impredicative constructive version of Zermelo-Fraenkel set theory. Using set terms, we axiomatize IZF with Replacement, which we call \izfr, along with its intensional counterpart \iizfr. We define a typed lambda calculus $\li$ corresponding to proofs in \iizfr according to the Curry-Howard isomorphism principle. Using realizability for \iizfr, we show weak normalization of $\li$. We use normalization to prove the disjunction, numerical existence and term existence properties. An inner extensional model is used to show these properties, along with the set existence property, for full, extensional \izfr.


Generalized D-Forms Have No Spurious Creases

Abstract: A convex surface that is flat everywhere but on finitely many smooth curves (or "seams") and points is a seam form. We show that the only creases through the flat components of a seam form are either between vertices or tangent to the seams. As corollaries we resolve open problems about certain special seam forms: the flat components of a D-form have no creases at all, and the flat component of a pita-form has at most one crease, between the seam's endpoints.


A Biologically Inspired Classifier

Abstract: We present a method for measuring the distance among records based on the correlations of data stored in the corresponding database entries. The original method (F. Bagnoli, A. Berrones and F. Franci. Physica A 332 (2004) 509-518) was formulated in the context of opinion formation. The opinions expressed over a set of topic originate a ``knowledge network'' among individuals, where two individuals are nearer the more similar their expressed opinions are. Assuming that individuals' opinions are stored in a database, the authors show that it is possible to anticipate an opinion using the correlations in the database. This corresponds to approximating the overlap between the tastes of two individuals with the correlations of their expressed opinions. In this paper we extend this model to nonlinear matching functions, inspired by biological problems such as microarray (probe-sample pairing). We investigate numerically the error between the correlation and the overlap matrix for eight sequences of reference with random probes. Results show that this method is particularly robust for detecting similarities in the presence of translocations.


A System for Distributed Mechanisms: Design, Implementation and Applications

Abstract: We describe here a structured system for distributed mechanism design appropriate for both Intranet and Internet applications. In our approach the players dynamically form a network in which they know neither their neighbours nor the size of the network and interact to jointly take decisions. The only assumption concerning the underlying communication layer is that for each pair of processes there is a path of neighbours connecting them. This allows us to deal with arbitrary network topologies. We also discuss the implementation of this system which consists of a sequence of layers. The lower layers deal with the operations that implement the basic primitives of distributed computing, namely low level communication and distributed termination, while the upper layers use these primitives to implement high level communication among players, including broadcasting and multicasting, and distributed decision making. This yields a highly flexible distributed system whose specific applications are realized as instances of its top layer. This design is implemented in Java. The system supports at various levels fault-tolerance and includes a provision for distributed policing the purpose of which is to exclude `dishonest' players. Also, it can be used for repeated creation of dynamically formed networks of players interested in a joint decision making implemented by means of a tax-based mechanism. We illustrate its flexibility by discussing a number of implemented examples.


Combined Integer and Variable Precision (CIVP) Floating Point Multiplication Architecture for FPGAs

Abstract: In this paper, we propose an architecture/methodology for making FPGAs suitable for integer as well as variable precision floating point multiplication. The proposed work will of great importance in applications which requires variable precision floating point multiplication such as multi-media processing applications. In the proposed architecture/methodology, we propose the replacement of existing 18x18 bit and 25x18 bit dedicated multipliers in FPGAs with dedicated 24x24 bit and 24x9 bit multipliers, respectively. We have proved that our approach of providing the dedicated 24x24 bit and 24x9 bit multipliers in FPGAs will make them efficient for performing integer as well as single precision, double precision, and Quadruple precision floating point multiplications.


Partial Reversible Gates(PRG) for Reversible BCD Arithmetic

Abstract: IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. Furthermore, in the recent years reversible logic has emerged as a promising computing paradigm having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. The major goal in reversible logic is to minimize the number of reversible gates and garbage outputs. Thus, this paper proposes the novel concept of partial reversible gates that will satisfy the reversibility criteria for specific cases in BCD arithmetic. The partial reversible gate is proposed to minimize the number of reversible gates and garbage outputs, while designing the reversible BCD arithmetic circuits.


Finding a Feasible Flow in a Strongly Connected Network

Abstract: We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the sum of demands and the minimum arc capacity is at least this sum. A fast algorithm for this problem improves the worst-case time bound of the Goldberg-Rao maximum flow method by a constant factor. Erlebach and Hagerup gave an linear-time feasible flow algorithm. We give an arguably simpler one.


Abstract: It is suggested that a new area of CSCR (Computer Supported Collaborative Research) is distinguished from CSCW (Computer Supported Collaborative Work) and CSCL (Computer Supported Collaborative Learning) and that the demarcation between the three areas could do with greater clarification and prescription. Although the areas of Human Computer Interaction (HCI), CSCW, and CSCL are now relatively well established, the related field of Computer Supported Collaborative Research (CSCR) is new and little understood. An analysis of the principles and issues behind CSCR is undertaken with a view to determining precisely its nature and scope and to delineate it clearly from CSCW and CSCL. This determination is such that it is generally applicable to the building, design and evaluation of collaborative research environments. A particular instance of the CSCR domain is then examined in order to determine the requirements of a collaborative research environment for students and supervisors (CRESS).


Epcast: Controlled Dissemination in Human-based Wireless Networks by means of Epidemic Spreading Models

Abstract: Epidemics-inspired techniques have received huge attention in recent years from the distributed systems and networking communities. These algorithms and protocols rely on probabilistic message replication and redundancy to ensure reliable communication. Moreover, they have been successfully exploited to support group communication in distributed systems, broadcasting, multicasting and information dissemination in fixed and mobile networks. However, in most of the existing work, the probability of infection is determined heuristically, without relying on any analytical model. This often leads to unnecessarily high transmission overheads. In this paper we show that models of epidemic spreading in complex networks can be applied to the problem of tuning and controlling the dissemination of information in wireless ad hoc networks composed of devices carried by individuals, i.e., human-based networks. The novelty of our idea resides in the evaluation and exploitation of the structure of the underlying human network for the automatic tuning of the dissemination process in order to improve the protocol performance. We evaluate the results using synthetic mobility models and real human contacts traces.


Une approche par les mod\`eles pour le suivi de l'activit\'e de construction d'un b\^atiment. Bat'iViews : une interface multi-vues orient\'ee gestion de chantier

Abstract: Cooperation between actors in design and construction activities in architecture is an essential stake nowadays. In professional practices the actors involved in construction projects use numerous tools. The project is unique but the "views" that actors manipulate are various and sometimes fundamentally different. Their common characteristic is that they partially represent the cooperation context through a specific point of view. "Bat'iViews" suggests to the actors a multi-view interface of the context and enables to navigate through the different views. This proposition is based on a model-driven approach. We distinguish between "context modelling" and modelling of concepts represented in each "businessview". A model integrative infrastructure allows us to develop the prototype and to manage user interaction through the definition of models' transformations.


Premi\`ere \'etape vers une navigation r\'ef\'erentielle par l'image pour l'assistance \`a la conception des ambiances lumineuses

Abstract: In the first design stage, image reference plays a double role of means of formulation and resolution of problems. In our approach, we consider image reference as a support of creation activity to generate ideas and we propose a tool for navigation in references by image in order to assist daylight ambience design. Within this paper, we present, in a first part, the semantic indexation method to be used for the indexation of our image database. In a second part we propose a synthetic analysis of various modes of referential navigation in order to propose a tool implementing all or a part of these modes.


Faster Algorithms for Rigidity in the Plane

Abstract: In [1], a new construction called red-black hierarchy characterizing Laman graphs and an algorithm for computing it were presented. For a Laman graph G=(V,E) with n vertices it runs in O(n^2) time assuming that a partition of (V,E+e) into two spanning trees is given. We show that a simple modification reduces the running time to O(n\log n). The total running time can be reduced O(n\sqrt{n\log n}) using the algorithm by Gabow and Westermann [2] for partitioning a graph into two forests. The existence of a red-black hierarchy is a necessary and sufficient condition for a graph to be a Laman graph. The algorithm for constructing a red-black hierarchy can be then modified to recognize Laman graphs in the same time.


A new approach for scientific data dissemination in developing countries: a case of Indonesia

Abstract: This short paper is intended as an additional progress report to share our experiences in Indonesia on collecting, integrating and disseminating both global and local scientific data across the country through the web technology. Our recent efforts are exerted on improving the local public access to global scientific data, and on the other hand encouraging the local scientific data to be more accessible for the global communities. We have maintained well-connected infrastructure and some web-based information management systems to realize such objectives. This paper is especially focused on introducing the ARSIP for mirroring global as well as sharing local scientific data, and the newly developed Indonesian Scientific Index for integrating local scientific data through an automated intelligent indexing system.


Complexity of the conditional colorability of graphs

Abstract: For an integer $r>0$, a conditional $(k,r)$-coloring of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex $v$ of degree $d(v)$ in $G$ is adjacent to vertices with at least $min\{r, d(v)\}$ different colors. The smallest integer $k$ for which a graph $G$ has a conditional $(k,r)$-coloring is called the $r$th order conditional chromatic number, denoted by $\chi_r(G)$. It is easy to see that the conditional coloring is a generalization of the traditional vertex coloring for which $r=1$. In this paper, we consider the complexity of the conditional colorings of graphs. The main result is that the conditional $(3,2)$-colorability is $NP$-complete for triangle-free graphs with maximum degree at most 3, which is different from the old result that the traditional 3-colorability is polynomial solvable for graphs with maximum degree at most 3. This also implies that it is $NP$-complete to determine if a graph of maximum degree 3 is $(3,2)$- or $(4,2)$-colorable. Also we have proved that some old complexity results for traditional colorings still hold for the conditional colorings.


Dynamic 3-Coloring of Claw-free Graphs

Abstract: A {\it dynamic $k$-coloring} of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex of degree at least 2 in $G$ will be adjacent to vertices with at least 2 different colors. The smallest number $k$ for which a graph $G$ can have a dynamic $k$-coloring is the {\it dynamic chromatic number}, denoted by $\chi_d(G)$. In this paper, we investigate the dynamic 3-colorings of claw-free graphs. First, we prove that it is $NP$-complete to determine if a claw-free graph with maximum degree 3 is dynamically 3-colorable. Second, by forbidding a kind of subgraphs, we find a reasonable subclass of claw-free graphs with maximum degree 3, for which the dynamically 3-colorable problem can be solved in linear time. Third, we give a linear time algorithm to recognize this subclass of graphs, and a linear time algorithm to determine whether it is dynamically 3-colorable. We also give a linear time algorithm to color the graphs in the subclass by 3 colors.


Estimation of fuzzy anomalies in Water Distribution Systems

Abstract: State estimation is necessary in diagnosing anomalies in Water Demand Systems (WDS). In this paper we present a neural network performing such a task. State estimation is performed by using optimization, which tries to reconcile all the available information. Quantification of the uncertainty of the input data (telemetry measures and demand predictions) can be achieved by means of robust estate estimation. Using a mathematical model of the network, fuzzy estimated states for anomalous states of the network can be obtained. They are used to train a neural network capable of assessing WDS anomalies associated with particular sets of measurements.


Comparing the notions of optimality in CP-nets, strategic games and soft constraints

Abstract: The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of three formalisms used for different purposes in reasoning about multi-agent systems: strategic games, CP-nets, and soft constraints. To relate the notions of optimality in these formalisms we introduce a natural qualitative modification of the notion of a strategic game. We show then that the optimal outcomes of a CP-net are exactly the Nash equilibria of such games. This allows us to use the techniques of game theory to search for optimal outcomes of CP-nets and vice-versa, to use techniques developed for CP-nets to search for Nash equilibria of the considered games. Then, we relate the notion of optimality used in the area of soft constraints to that used in a generalization of strategic games, called graphical games. In particular we prove that for a natural class of soft constraints that includes weighted constraints every optimal solution is both a Nash equilibrium and Pareto efficient joint strategy. For a natural mapping in the other direction we show that Pareto efficient joint strategies coincide with the optimal solutions of soft constraints.


Image Classification Using SVMs: One-against-One Vs One-against-All

Abstract: Support Vector Machines (SVMs) are a relatively new supervised classification technique to the land cover mapping community. They have their roots in Statistical Learning Theory and have gained prominence because they are robust, accurate and are effective even when using a small training sample. By their nature SVMs are essentially binary classifiers, however, they can be adopted to handle the multiple classification tasks common in remote sensing studies. The two approaches commonly used are the One-Against-One (1A1) and One-Against-All (1AA) techniques. In this paper, these approaches are evaluated in as far as their impact and implication for land cover mapping. The main finding from this research is that whereas the 1AA technique is more predisposed to yielding unclassified and mixed pixels, the resulting classification accuracy is not significantly different from 1A1 approach. It is the authors conclusion therefore that ultimately the choice of technique adopted boils down to personal preference and the uniqueness of the dataset at hand.


Use of Wikipedia Categories in Entity Ranking

Abstract: Wikipedia is a useful source of knowledge that has many applications in language processing and knowledge representation. The Wikipedia category graph can be compared with the class hierarchy in an ontology; it has some characteristics in common as well as some differences. In this paper, we present our approach for answering entity ranking queries from the Wikipedia. In particular, we explore how to make use of Wikipedia categories to improve entity ranking effectiveness. Our experiments show that using categories of example entities works significantly better than using loosely defined target categories.


Recognizing Members of the Tournament Equilibrium Set is NP-hard

Abstract: A recurring theme in the mathematical social sciences is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's tournament equilibrium set (TEQ) ranks among the most intriguing, but also among the most enigmatic, tournament solutions that have been proposed so far in this context. Due to its unwieldy recursive definition, little is known about TEQ. In particular, its monotonicity remains an open problem up to date. Yet, if TEQ were to satisfy monotonicity, it would be a very attractive tournament solution concept refining both the Banks set and Dutta's minimal covering set. We show that the problem of deciding whether a given alternative is contained in TEQ is NP-hard.


IT services design to support coordination practices in the Luxembourguish AEC sector

Abstract: In the Architecture Engineering and Construction sector (AEC) cooperation between actors is essential for project success. The configuration of actors' organization takes different forms like the associated coordination mechanisms. Our approach consists in analyzing these coordination mechanisms through the identification of the "base practices" realized by the actors of a construction project to cooperate. We also try with practitioners to highlight the "best practices" of cooperation. Then we suggest here two prototypes of IT services aiming to demonstrate the value added of IT to support cooperation. These prototype tools allow us to sensitize the actors through terrain experiments and then to bring inch by inch the Luxembourgish AEC sector towards electronic cooperation.


Optimizing diversity

Abstract: We consider the problem of minimizing the size of a family of sets G such that every subset of 1,...,n can be written as a disjoint union of at most k members of G, where k and n are given numbers. This problem originates in a real-world application aiming at the diversity of industrial production. At the same time, the minimum of G so that every subset of 1,...,n is the union of two sets in G has been asked by Erdos and studied recently by Furedi and Katona without requiring the disjointness of the sets. A simple construction providing a feasible solution is conjectured to be optimal for this problem for all values of n and k and regardless of the disjointness requirement; we prove this conjecture in special cases including all (n,k) for which n <= 3k holds, and some individual values of n and k.


Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks

Abstract: In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficiently with networks of more than a few hundred nodes. In this paper, we propose an augmented tree-based address space structure and a hierarchical multi-path routing protocol, referred to as Augmented Tree-based Routing (ATR), which utilizes such a structure in order to solve the scalability problem and to gain good resilience against node failure/mobility and link congestion/instability. Simulation results and performance comparisons with existing protocols substantiate the effectiveness of the ATR.


Entity Ranking in Wikipedia

Abstract: The traditional entity extraction problem lies in the ability of extracting named entities from plain text using natural language processing techniques and intensive training from large document collections. Examples of named entities include organisations, people, locations, or dates. There are many research activities involving named entities; we are interested in entity ranking in the field of information retrieval. In this paper, we describe our approach to identifying and ranking entities from the INEX Wikipedia document collection. Wikipedia offers a number of interesting features for entity identification and ranking that we first introduce. We then describe the principles and the architecture of our entity ranking system, and introduce our methodology for evaluation. Our preliminary results show that the use of categories and the link structure of Wikipedia, together with entity examples, can significantly improve retrieval effectiveness.


Approche polyedrale pour le probleme du separateur (VSP)

Abstract: In an undirected connected graph G=(V,E), the vertex separator problem (VSP) asks for a partition of V into nonempty subsets A, B, C such that |C| is minimized such that there is no edge between A and B, and sizes of A and B are similar. This paper presents a polyhedral approach of the (VSP), introducing new efficient valid inequalities and providing computational tests and results.


Detecting palindromes, patterns, and borders in regular languages

Abstract: Given a language L and a nondeterministic finite automaton M, we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given that M accepts at least one word in L, we consider how long a shortest word can be. The languages L that we examine include the palindromes, the non-palindromes, the k-powers, the non-k-powers, the powers, the non-powers (also called primitive words), the words matching a general pattern, the bordered words, and the unbordered words.


On the Centroids of Symmetrized Bregman Divergences

Abstract: In this paper, we generalize the notions of centroids and barycenters to the broad class of information-theoretic distortion measures called Bregman divergences. Bregman divergences are versatile, and unify quadratic geometric distances with various statistical entropic measures. Because Bregman divergences are typically asymmetric, we consider both the left-sided and right-sided centroids and the symmetrized centroids, and prove that all three are unique. We give closed-form solutions for the sided centroids that are generalized means, and design a provably fast and efficient approximation algorithm for the symmetrized centroid based on its exact geometric characterization that requires solely to walk on the geodesic linking the two sided centroids. We report on our generic implementation for computing entropic centers of image clusters and entropic centers of multivariate normals, and compare our results with former ad-hoc methods.


A Distributed Dynamic Frequency Allocation Algorithm

Abstract: We consider a network model where the nodes are grouped into a number of clusters and propose a distributed dynamic frequency allocation algorithm that achieves performance close to that of a centralized optimal algorithm. Each cluster chooses its transmission frequency band based on its knowledge of the interference that it experiences. The convergence of the proposed distributed algorithm to a sub-optimal frequency allocation pattern is proved. For some specific cases of spatial distributions of the clusters in the network, asymptotic bounds on the performance of the algorithm are derived and comparisons to the performance of optimal centralized solutions are made. These analytic results and additional simulation studies verify performance close to that of an optimum centralized frequency allocation algorithm. It is demonstrated that the algorithm achieves about 90% of the Shannon capacities corresponding to the optimum/near-optimum centralized frequency band assignments. Furthermore, we consider the scenario where each cluster can be in active or inactive mode according to a two-state Markov model. We derive conditions to guarantee finite steady state variance for the output of the algorithm using stochastic analysis. Further simulation studies confirm the results of stochastic modeling and the performance of the algorithm in the time-varying setup.


Improved Fully Dynamic Reachability Algorithm for Directed Graph

Abstract: We propose a fully dynamic algorithm for maintaining reachability information in directed graphs. The proposed deterministic dynamic algorithm has an update time of $O((ins*n^{2}) + (del * (m+n*log(n))))$ where $m$ is the current number of edges, $n$ is the number of vertices in the graph, $ins$ is the number of edge insertions and $del$ is the number of edge deletions. Each query can be answered in O(1) time after each update. The proposed algorithm combines existing fully dynamic reachability algorithm with well known witness counting technique to improve efficiency of maintaining reachability information when edges are deleted. The proposed algorithm improves by a factor of $O(\frac{n^2}{m+n*log(n)})$ for edge deletion over the best existing fully dynamic algorithm for maintaining reachability information.


Microsystem Product Development

Abstract: Over the last decade the successful design and fabrication of complex MEMS (MicroElectroMechanical Systems), optical circuits and ASICs have been demonstrated. Packaging and integration processes have lagged behind MEMS research but are rapidly maturing. As packaging processes evolve, a new challenge presents itself, microsystem product development. Product development entails the maturation of the design and all the processes needed to successfully produce a product. Elements such as tooling design, fixtures, gages, testers, inspection, work instructions, process planning, etc., are often overlooked as MEMS engineers concentrate on design, fabrication and packaging processes. Thorough, up-front planning of product development efforts is crucial to the success of any project.


Parasitic Effects Reduction for Wafer-Level Packaging of RF-Mems

Abstract: In RF-MEMS packaging, next to the protection of movable structures, optimization of package electrical performance plays a very important role. In this work, a wafer-level packaging process has been investigated and optimized in order to minimize electrical parasitic effects. The RF-MEMS package concept used is based on a wafer-level bonding of a capping silicon substrate to an RF-MEMS wafer. The capping silicon substrate resistivity, substrate thickness and the geometry of through-substrate electrical interconnect vias have been optimized using finite-element electromagnetic simulations (Ansoft HFSS). Test structures for electrical characterization have been designed and after their fabrication, measurement results will be compared with simulations.


Surface Conditioning Effect on Vacuum Microelectronics Components Fabricated by Deep Reactive Ion Etching

Abstract: Advances in material processing such as silicon micromachining are opening the way to vacuum microelectronics. Two-dimensional vacuum components can be fabricated using the microsystems processes. We developed such devices using a single metal layer and silicon micromachining by DRIE. The latter technological step has significant impact on the characteristics of the vacuum components. This paper presents a brief summary of electron emission possibilities and the design leading to the fabrication of a lateral field emission diode. First measurement results and the aging of the devices are also discussed.


3-D Self-Assembled Soi Mems: An Example of Multiphysics Simulation

Abstract: MEMS devices are typical systems where multiphysics simulations are unavoidable. In this work, we present possible applications of 3-D self-assembled SOI (Silicon-on-Insulator) MEMS such as, for instance, thermal actuators and flow sensors. The numerical simulations of these microsystems are presented. Structural and thermal parts have to be strongly coupled for correctly describing the fabrication process and for simulating the behavior of these 3-D SOI MEMS.


Influence of the Feedback Filter on the Response of the Pulsed Digital Oscillator

Abstract: This paper introduces a new feedback topology for the Pulsed Digital Oscillator (PDO) and compares it to the classical topology. The `classic' or single feedback topology, introduced in previous works, shows a strong behavior dependence on the damping losses in the MEMS resonator. A new double feedback topology is introduced here in order to help solving this problem. Comparative discrete-time simulations and preliminary experimental measurements have been carried out for both topologies, showing how the new double feedback topology may increase PDO performance for some frequency ranges.


Concave Microlens Array Mold Fabrication in Photoresist Using UV Proximity Printing

Abstract: This paper presents a simple and effective method to fabricate a polydimethyl-siloxane (PDMS) microlens array with a high fill factor, which utilizes the UV proximity printing and photoresist replication methods. The concave microlens array mold was made using a printing gap in lithography process, which utilizes optical diffraction of UV light to deflect away from the aperture edges and produces a certain exposure in the photoresist material outside the aperture edges. This method can precisely control the geometric profile of concave microlens array. The experimental results showed that the concave micro-lens array in photoresist could be formed automatically when the printing gap ranged from 240 micron to 720 micron. High fill factor microlens array can be produced, when the control pitch distance between the adjacent apertures of the concave microlens array was decreased to the aperture size.


The annealing induced extraordinary properties of SI based ZNO film grown by RF sputtering

Abstract: Pb(Zr0.52Ti0.48)O3 (PZT) thin films were in situ deposited by pulsed laser deposition (PLD) on Pt/Ti/SiO2/Si substrates using a template layer derived by sol-gel method. A 0.1-$\mu$m-thick PZT layer with (111) or (100)-preferred orientation was first deposited onto Pt/Ti/SiO2/Si substrates using the sol-gel method, and than a PZT layer with thickness of 1$\mu$m was in situ deposited by PLD on the above-mentioned PZT layer. The crystalline phases and the preferred orientations of the PZT films were investigated by X-ray diffraction analysis. Surface and cross-sectional morphologies were observed by scanning electron microscopy and transmission electron microscopy. The electrical properties of the films were evaluated by measuring their P-E hysteresis loops and dielectric constants. The preferred orientation of the films can be controlled using the template layer derived by the sol-gel method. The deposition temperature required to obtain the perovskite phase in this process is approximately 460 degrees C, and is significantly lower than that in the case of direct film deposition by PLD on the Pt/Ti/SiO2/Si substrates. Keywords: lead zirconate titanate (PZT), thin film, sol-gel method, laser ablation, electrical properties


Parametric Yield Analysis of Mems via Statistical Methods

Abstract: This paper considers a developing theory on the effects of inevitable process variations during the fabrication of MEMS and other microsystems. The effects on the performance and design yield of the microsystems devices are analyzed and presented. A novel methodology in the design cycle of MEMS and other microsystems is briefly introduced. This paper describes the initial steps of this methodology that is aimed at counteracting the parametric variations in the product cycle of microsystems. It is based on a concept of worst-case analysis that has proven successful in the parent IC technology. Issues ranging from the level of abstraction of the microsystem models to the availability of such models are addressed


Electrostatically-Driven Resonator on Soi with Improved Temperature Stability

Abstract: This paper deals with a single-crystal-silicon (SCS) MEMS resonator with improved temperature stability. While simulations have shown that the temperature coefficient of resonant frequency can be down to 1 ppm/degrees C, preliminary measurements on non-optimised structures gave evidence of a temperature coefficient of 29 ppm/degrees C. Design, optimisation, experimental results with post process simulation and prospective work are presented.


Electromechanical Reliability Testing of Three-Axial Silicon Force Sensors

Abstract: This paper reports on the systematic electromechanical characterization of a new three-axial force sensor used in dimensional metrology of micro components. The siliconbased sensor system consists of piezoresistive mechanicalstress transducers integrated in thin membrane hinges supporting a suspended flexible cross structure. The mechanical behavior of the fragile micromechanical structure isanalyzed for both static and dynamic load cases. This work demonstrates that the silicon microstructure withstands static forces of 1.16N applied orthogonally to the front-side of the structure. A statistical Weibull analysis of the measured data shows that these values are significantly reduced if the normal force is applied to the back of the sensor. Improvements of the sensor system design for future development cycles are derived from the measurement results.


An Active Chaotic Micromixer Integrating Thermal Actuation Associating PDMS and Silicon Microtechnology

Abstract: Due to scaling laws, in microfluidic, flows are laminar. Consequently, mixing between two liquids is mainly obtained by natural diffusion which may take a long time or equivalently requires centimetre length channels. To reduce time and length for mixing, it is possible to generate chaotic-like flows either by modifying the channel geometry or by creating an external perturbation of the flow. In this paper, an active micromixer is presented consisting on thermal actuation with heating resistors. In order to disturb the liquid flow, an oscillating transverse flow is generated by heating the liquid. Depending on the value of boiling point, either bubble expansion or volumetric dilation controlled the transverse flow amplitude. A chaotic like mixing is then induced under particular conditions depending on volume expansion, liquid velocity, frequency of actuation... This solution presents the advantage to achieve mixing in a very short time (1s) and along a short channel distance (channel width). It can also be integrated in a more complex device due to actuator integration with microfluidics.


Resolution Limits for Resonant Mems Sensors Based on Discrete Relay Feedback Techniques

Abstract: This paper is devoted to the analysis of resonant MEMS sensors based on discrete relay feedback techniques. One drawback of such techniques is that some synchronization usually occurs between the discrete part and the continuous part of the system: this results in sensor responses that are very similar to the curves known as devil's staircases, i.e. the frequency does not vary smoothly with the sensor's input. The main contribution of this paper is a theoretical calculation of the resolution of such systems. The resolutions of two existing resonant MEMS architectures are then calculated and these results are discussed.


A Silicon-Based Micro Gas Turbine Engine for Power Generation

Abstract: This paper reports on our research in developing a micro power generation system based on gas turbine engine and piezoelectric converter. The micro gas turbine engine consists of a micro combustor, a turbine and a centrifugal compressor. Comprehensive simulation has been implemented to optimal the component design. We have successfully demonstrated a silicon-based micro combustor, which consists of seven layers of silicon structures. A hairpin-shaped design is applied to the fuel/air recirculation channel. The micro combustor can sustain a stable combustion with an exit temperature as high as 1600 K. We have also successfully developed a micro turbine device, which is equipped with enhanced micro air-bearings and driven by compressed air. A rotation speed of 15,000 rpm has been demonstrated during lab test. In this paper, we will introduce our research results major in the development of micro combustor and micro turbine test device.


Energy Conversion Using New Thermoelectric Generator

Abstract: During recent years, microelectronics helped to develop complex and varied technologies. It appears that many of these technologies can be applied successfully to realize Seebeck micro generators: photolithography and deposition methods allow to elaborate thin thermoelectric structures at the micro-scale level. Our goal is to scavenge energy by developing a miniature power source for operating electronic components. First Bi and Sb micro-devices on silicon glass substrate have been manufactured with an area of 1cm2 including more than one hundred junctions. Each step of process fabrication has been optimized: photolithography, deposition process, anneals conditions and metallic connections. Different device structures have been realized with different micro-line dimensions. Each devices performance will be reviewed and discussed in function of their design structure.


Above Ic Micro-Power Generators for RF-Mems

Abstract: This work presents recent advances in the development and the integration of an electrochemical (chemicalelectrical energy conversion) micro power generator used as a high voltage energy source for RF-MEMS powering. Autonomous MEMS require similarly miniaturized power sources. Up to day, solid state thin film batteries are realized with mechanical masks. This method doesn't allow dimensions below a few mm^2 active area, and besides the whole process flow is done under controlled atmosphere so as to ensure materials chemical stability (mainly lithiated materials). Within this context, Microelectronics micro-fabrication procedures (photolithography, Reactive Ion Etching...) are used to reach both miniaturisation (100x100 $\mu$m^2 targeted unit cell active area) and Above IC technological compatibility. All process steps developed here are realized in clean room environment.


Packaging of RF Mems Switching Functions on Alumina Substrate

Abstract: Recently the strong demands in wireless communication requires expanding development for the application of RF MEMS (Radio Frequency micro electro mechanical systems) sensing devices such as micro-switches, tunable capacitors because it offers lower power consumption, lower losses, higher linearity and higher Q factors compared with conventional communications components. To accelerate commercialisation of RF MEMS products, development for packaging technologies is one of the most critical issues should be solved beforehand.