Complexity of Combinatorial Market Makers

Abstract: We analyze the computational complexity of market maker pricing algorithms for combinatorial prediction markets. We focus on Hanson's popular logarithmic market scoring rule market maker (LMSR). Our goal is to implicitly maintain correct LMSR prices across an exponentially large outcome space. We examine both permutation combinatorics, where outcomes are permutations of objects, and Boolean combinatorics, where outcomes are combinations of binary events. We look at three restrictive languages that limit what traders can bet on. Even with severely limited languages, we find that LMSR pricing is $\SP$-hard, even when the same language admits polynomial-time matching without the market maker. We then propose an approximation technique for pricing permutation markets based on a recent algorithm for online permutation learning. The connections we draw between LMSR pricing and the vast literature on online learning with expert advice may be of independent interest.


Structure and Optimality of Myopic Policy in Opportunistic Access with Noisy Observations

Abstract: A restless multi-armed bandit problem that arises in multichannel opportunistic communications is considered, where channels are modeled as independent and identical Gilbert-Elliot channels and channel state observations are subject to errors. A simple structure of the myopic policy is established under a certain condition on the false alarm probability of the channel state detector. It is shown that the myopic policy has a semi-universal structure that reduces channel selection to a simple round-robin procedure and obviates the need to know the underlying Markov transition probabilities. The optimality of the myopic policy is proved for the case of two channels and conjectured for the general case based on numerical examples.


Les Agents comme des interpr\'eteurs Scheme : Sp\'ecification dynamique par la communication

Abstract: We proposed in previous papers an extension and an implementation of the STROBE model, which regards the Agents as Scheme interpreters. These Agents are able to interpret messages in a dedicated environment including an interpreter that learns from the current conversation therefore representing evolving meta-level Agent's knowledge. When the Agent's interpreter is a nondeterministic one, the dialogues may consist of subsequent refinements of specifications in the form of constraint sets. The paper presents a worked out example of dynamic service generation - such as necessary on Grids - by exploiting STROBE Agents equipped with a nondeterministic interpreter. It shows how enabling dynamic specification of a problem. Then it illustrates how these principles could be effective for other applications. Details of the implementation are not provided here, but are available.


Extreme Learning Machine for land cover classification

Abstract: This paper explores the potential of extreme learning machine based supervised classification algorithm for land cover classification. In comparison to a backpropagation neural network, which requires setting of several user-defined parameters and may produce local minima, extreme learning machine require setting of one parameter and produce a unique solution. ETM+ multispectral data set (England) was used to judge the suitability of extreme learning machine for remote sensing classifications. A back propagation neural network was used to compare its performance in term of classification accuracy and computational cost. Results suggest that the extreme learning machine perform equally well to back propagation neural network in term of classification accuracy with this data set. The computational cost using extreme learning machine is very small in comparison to back propagation neural network.


Approximating General Metric Distances Between a Pattern and a Text

Abstract: Let $T=t_0 ... t_{n-1}$ be a text and $P = p_0 ... p_{m-1}$ a pattern taken from some finite alphabet set $\Sigma$, and let $\dist$ be a metric on $\Sigma$. We consider the problem of calculating the sum of distances between the symbols of $P$ and the symbols of substrings of $T$ of length $m$ for all possible offsets. We present an $\epsilon$-approximation algorithm for this problem which runs in time $O(\frac{1}{\epsilon^2}n\cdot \mathrm{polylog}(n,\abs{\Sigma}))$


A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization

Abstract: We present a general approach for collaborative filtering (CF) using spectral regularization to learn linear operators from "users" to the "objects" they rate. Recent low-rank type matrix completion approaches to CF are shown to be special cases. However, unlike existing regularization based CF methods, our approach can be used to also incorporate information such as attributes of the users or the objects -- a limitation of existing regularization based CF methods. We then provide novel representer theorems that we use to develop new estimation methods. We provide learning algorithms based on low-rank decompositions, and test them on a standard CF dataset. The experiments indicate the advantages of generalizing the existing regularization based CF methods to incorporate related information about users and objects. Finally, we show that certain multi-task learning methods can be also seen as special cases of our proposed approach.


3-Way Composition of Weighted Finite-State Transducers

Abstract: Composition of weighted transducers is a fundamental algorithm used in many applications, including for computing complex edit-distances between automata, or string kernels in machine learning, or to combine different components of a speech recognition, speech synthesis, or information extraction system. We present a generalization of the composition of weighted transducers, 3-way composition, which is dramatically faster in practice than the standard composition algorithm when combining more than two transducers. The worst-case complexity of our algorithm for composing three transducers $T_1$, $T_2$, and $T_3$ resulting in $T$, \ignore{depending on the strategy used, is $O(|T|_Q d(T_1) d(T_3) + |T|_E)$ or $(|T|_Q d(T_2) + |T|_E)$,} is $O(|T|_Q \min(d(T_1) d(T_3), d(T_2)) + |T|_E)$, where $|\cdot|_Q$ denotes the number of states, $|\cdot|_E$ the number of transitions, and $d(\cdot)$ the maximum out-degree. As in regular composition, the use of perfect hashing requires a pre-processing step with linear-time expected complexity in the size of the input transducers. In many cases, this approach significantly improves on the complexity of standard composition. Our algorithm also leads to a dramatically faster composition in practice. Furthermore, standard composition can be obtained as a special case of our algorithm. We report the results of several experiments demonstrating this improvement. These theoretical and empirical improvements significantly enhance performance in the applications already mentioned.


Error-Correcting Data Structures

Abstract: We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries about the object, even if the data structure has been corrupted by a constant fraction of errors. This new model is the common generalization of (static) data structures and locally decodable error-correcting codes. The main issue is the tradeoff between the space used by the data structure and the time (number of probes) needed to answer a query about the encoded object. We prove a number of upper and lower bounds on various natural error-correcting data structure problems. In particular, we show that the optimal length of error-correcting data structures for the Membership problem (where we want to store subsets of size s from a universe of size n) is closely related to the optimal length of locally decodable codes for s-bit strings.


Minimal Committee Problem for Inconsistent Systems of Linear Inequalities on the Plane

Abstract: A representation of an arbitrary system of strict linear inequalities in R^n as a system of points is proposed. The representation is obtained by using a so-called polarity. Based on this representation an algorithm for constructing a committee solution of an inconsistent plane system of linear inequalities is given. A solution of two problems on minimal committee of a plane system is proposed. The obtained solutions to these problems can be found by means of the proposed algorithm.


Thread extraction for polyadic instruction sequences

Abstract: In this paper, we study the phenomenon that instruction sequences are split into fragments which somehow produce a joint behaviour. In order to bring this phenomenon better into the picture, we formalize a simple mechanism by which several instruction sequence fragments can produce a joint behaviour. We also show that, even in the case of this simple mechanism, it is a non-trivial matter to explain by means of a translation into a single instruction sequence what takes place on execution of a collection of instruction sequence fragments.


Program Promises

Abstract: The framework of promise theory offers an alternative way of understanding programming models, especially in distributed systems. We show that promise theory can express some familiar constructs and resolve some problems in program interface design, using fewer and simpler concepts than the Unified Modelling Language (UML).


On the Complexity of Nash Equilibria of Action-Graph Games

Abstract: We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that encapsulates both "local" dependencies as in graphical games, and partial indifference to other agents' identities as in anonymous games, which occur in many natural settings. This is achieved by specifying a graph on the set of actions, so that the payoff of an agent for selecting a strategy depends only on the number of agents playing each of the neighboring strategies in the action graph. We present a Polynomial Time Approximation Scheme for computing mixed Nash equilibria of AGGs with constant treewidth and a constant number of agent types (and an arbitrary number of strategies), together with hardness results for the cases when either the treewidth or the number of agent types is unconstrained. In particular, we show that even if the action graph is a tree, but the number of agent-types is unconstrained, it is NP-complete to decide the existence of a pure-strategy Nash equilibrium and PPAD-complete to compute a mixed Nash equilibrium (even an approximate one); similarly for symmetric AGGs (all agents belong to a single type), if we allow arbitrary treewidth. These hardness results suggest that, in some sense, our PTAS is as strong of a positive result as one can expect.


Zero-knowledge authentication schemes from actions on graphs, groups, or rings

Abstract: We propose a general way of constructing zero-knowledge authentication schemes from actions of a semigroup on a set, without exploiting any specific algebraic properties of the set acted upon. Then we give several concrete realizations of this general idea, and in particular, we describe several zero-knowledge authentication schemes where forgery (a.k.a. impersonation) is NP-hard. Computationally hard problems that can be employed in these realizations include (Sub)graph Isomorphism, Graph Colorability, Diophantine Problem, and many others.


Generalized Whac-a-Mole

Abstract: We consider online competitive algorithms for the problem of collecting weighted items from a dynamic set S, when items are added to or deleted from S over time. The objective is to maximize the total weight of collected items. We study the general version, as well as variants with various restrictions, including the following: the uniform case, when all items have the same weight, the decremental sets, when all items are present at the beginning and only deletion operations are allowed, and dynamic queues, where the dynamic set is ordered and only its prefixes can be deleted (with no restriction on insertions). The dynamic queue case is a generalization of bounded-delay packet scheduling (also referred to as buffer management). We present several upper and lower bounds on the competitive ratio for these variants.


Longest paths in Planar DAGs in Unambiguous Logspace

Abstract: We show via two different algorithms that finding the length of the longest path in planar directed acyclic graph (DAG) is in unambiguous logspace UL, and also in the complement class co-UL. The result extends to toroidal DAGs as well.


Parameterized Algorithms for Partial Cover Problems

Abstract: Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the universe with as few sets of the family as possible. The variations of covering problems include well known problems like Set Cover, Vertex Cover, Dominating Set and Facility Location to name a few. Recently there has been a lot of study on partial covering problems, a natural generalization of covering problems. Here, the goal is not to cover all the elements but to cover the specified number of elements with the minimum number of sets. In this paper we study partial covering problems in graphs in the realm of parameterized complexity. Classical (non-partial) version of all these problems have been intensively studied in planar graphs and in graphs excluding a fixed graph $H$ as a minor. However, the techniques developed for parameterized version of non-partial covering problems cannot be applied directly to their partial counterparts. The approach we use, to show that various partial covering problems are fixed parameter tractable on planar graphs, graphs of bounded local treewidth and graph excluding some graph as a minor, is quite different from previously known techniques. The main idea behind our approach is the concept of implicit branching. We find implicit branching technique to be interesting on its own and believe that it can be used for some other problems.


SAT Has No Wizards

Abstract: An (encoded) decision problem is a pair (E, F) where E=words that encode instances of the problem, F=words to be accepted. We use "strings" in a technical sense. With an NP problem (E, F) we associate the "logogram" of F relative to E, which conveys structural information on E, F, and how F is embedded in E. The kernel Ker(P) of a program P that solves (E, F) consists of those strings in the logogram that are used by P. There are relations between Ker(P) and the complexity of P. We develop an application to SAT that relies upon a property of internal independence of SAT. We show that SAT cannot have in its logogram strings serving as collective certificates. As consequence, all programs that solve SAT have same kernel.


A review of the Statistical Mechanics approach to Random Optimization Problems

Abstract: We review the connection between statistical mechanics and the analysis of random optimization problems, with particular emphasis on the random k-SAT problem. We discuss and characterize the different phase transitions that are met in these problems, starting from basic concepts. We also discuss how statistical mechanics methods can be used to investigate the behavior of local search and decimation based algorithms.


On the Complexity of Elementary Modal Logics

Abstract: Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case basis. We prove a very general classification for a wide class of relevant logics: Many important subclasses of modal logics can be obtained by restricting the allowed models with first-order Horn formulas. We show that the satisfiability problem for each of these logics is either NP-complete or PSPACE-hard, and exhibit a simple classification criterion. Further, we prove matching PSPACE upper bounds for many of the PSPACE-hard logics.


To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?

Abstract: We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match-a feature where an ad of an advertiser can be mapped to a broader range of relevant queries, and not necessarily to the particular keyword(s) that ad is associated with. Starting with a very natural setting for strategies available to the advertisers, and via a careful look through the algorithmic lens, we first propose solution concepts for the game originating from the strategic behavior of advertisers as they try to optimize their budget allocation across various keywords. Next, we consider two broad match scenarios based on factors such as information asymmetry between advertisers and the auctioneer, and the extent of auctioneer's control on the budget splitting. In the first scenario, the advertisers have the full information about broad match and relevant parameters, and can reapportion their own budgets to utilize the extra information; in particular, the auctioneer has no direct control over budget splitting. We show that, the same broad match may lead to different equilibria, one leading to a revenue improvement, whereas another to a revenue loss. This leaves the auctioneer in a dilemma - whether to broad-match or not. This motivates us to consider another broad match scenario, where the advertisers have information only about the current scenario, and the allocation of the budgets unspent in the current scenario is in the control of the auctioneer. We observe that the auctioneer can always improve his revenue by judiciously using broad match. Thus, information seems to be a double-edged sword for the auctioneer.


Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem

Abstract: There is considerable interest in the use of genetic algorithms to solve problems arising in the areas of scheduling and timetabling. However, the classical genetic algorithm paradigm is not well equipped to handle the conflict between objectives and constraints that typically occurs in such problems. In order to overcome this, successful implementations frequently make use of problem specific knowledge. This paper is concerned with the development of a GA for a nurse rostering problem at a major UK hospital. The structure of the constraints is used as the basis for a co-evolutionary strategy using co-operating sub-populations. Problem specific knowledge is also used to define a system of incentives and disincentives, and a complementary mutation operator. Empirical results based on 52 weeks of live data show how these features are able to improve an unsuccessful canonical GA to the point where it is able to provide a practical solution to the problem


Kolmogorov Complexity Theory over the Reals

Abstract: Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the BSS-machine (aka real-RAM) has been established as a major model of computation. This real realm has turned out to exhibit natural counterparts to many notions and results in classical complexity and recursion theory; although usually with considerably different proofs. The present work investigates similarities and differences between discrete and real Kolmogorov Complexity as introduced by Montana and Pardo (1998).


Well-Centered Triangulation

Abstract: Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have optimality properties and relationships to Delaunay and minmax angle triangulations. We present an iterative algorithm that seeks to transform a given triangulation in two or three dimensions into a well-centered one by minimizing a cost function and moving the interior vertices while keeping the mesh connectivity and boundary vertices fixed. The cost function is a direct result of a new characterization of well-centeredness in arbitrary dimensions that we present. Ours is the first optimization-based heuristic for well-centeredness, and the first one that applies in both two and three dimensions. We show the results of applying our algorithm to small and large two-dimensional meshes, some with a complex boundary, and obtain a well-centered tetrahedralization of the cube. We also show numerical evidence that our algorithm preserves gradation and that it improves the maximum and minimum angles of acute triangulations created by the best known previous method.


On the Security of ``an efficient and complete remote user authentication scheme''

Abstract: Recently, Liaw et al. proposed a remote user authentication scheme using smart cards. Their scheme has claimed a number of features e.g. mutual authentication, no clock synchronization, no verifier table, flexible user password change, etc. We show that Liaw et al.'s scheme is completely insecure. By intercepting a valid login message in Liaw et al.'s scheme, any unregistered user or adversary can easily login to the remote system and establish a session key.


New Implementation Framework for Saturation-Based Reasoning

Abstract: The saturation-based reasoning methods are among the most theoretically developed ones and are used by most of the state-of-the-art first-order logic reasoners. In the last decade there was a sharp increase in performance of such systems, which I attribute to the use of advanced calculi and the intensified research in implementation techniques. However, nowadays we are witnessing a slowdown in performance progress, which may be considered as a sign that the saturation-based technology is reaching its inherent limits. The position I am trying to put forward in this paper is that such scepticism is premature and a sharp improvement in performance may potentially be reached by adopting new architectural principles for saturation. The top-level algorithms and corresponding designs used in the state-of-the-art saturation-based theorem provers have (at least) two inherent drawbacks: the insufficient flexibility of the used inference selection mechanisms and the lack of means for intelligent prioritising of search directions. In this position paper I analyse these drawbacks and present two ideas on how they could be overcome. In particular, I propose a flexible low-cost high-precision mechanism for inference selection, intended to overcome problems associated with the currently used instances of clause selection-based procedures. I also outline a method for intelligent prioritising of search directions, based on probing the search space by exploring generalised search directions. I discuss some technical issues related to implementation of the proposed architectural principles and outline possible solutions.


Domination in graphs with bounded propagation: algorithms, formulations and hardness results

Abstract: We introduce a hierarchy of problems between the \textsc{Dominating Set} problem and the \textsc{Power Dominating Set} (PDS) problem called the $\ell$-round power dominating set ($\ell$-round PDS, for short) problem. For $\ell=1$, this is the \textsc{Dominating Set} problem, and for $\ell\geq n-1$, this is the PDS problem; here $n$ denotes the number of nodes in the input graph. In PDS the goal is to find a minimum size set of nodes $S$ that power dominates all the nodes, where a node $v$ is power dominated if (1) $v$ is in $S$ or it has a neighbor in $S$, or (2) $v$ has a neighbor $u$ such that $u$ and all of its neighbors except $v$ are power dominated. Note that rule (1) is the same as for the \textsc{Dominating Set} problem, and that rule (2) is a type of propagation rule that applies iteratively. The $\ell$-round PDS problem has the same set of rules as PDS, except we apply rule (2) in ``parallel'' in at most $\ell-1$ rounds. We prove that $\ell$-round PDS cannot be approximated better than $2^{\log^{1-\epsilon}{n}}$ even for $\ell=4$ in general graphs. We provide a dynamic programming algorithm to solve $\ell$-round PDS optimally in polynomial time on graphs of bounded tree-width. We present a PTAS (polynomial time approximation scheme) for $\ell$-round PDS on planar graphs for $\ell=O(\tfrac{\log{n}}{\log{\log{n}}})$. Finally, we give integer programming formulations for $\ell$-round PDS.


Minimizing the Maximum Interference is Hard

Abstract: We consider the following interference model for wireless sensor and ad hoc networks: the receiver interference of a node is the number of transmission ranges it lies in. We model transmission ranges as disks. For this case we show that choosing transmission radii which minimize the maximum interference while maintaining a connected symmetric communication graph is NP-complete.


Support Vector classifiers for Land Cover Classification

Abstract: Support vector machines represent a promising development in machine learning research that is not widely used within the remote sensing community. This paper reports the results of Multispectral(Landsat-7 ETM+) and Hyperspectral DAIS)data in which multi-class SVMs are compared with maximum likelihood and artificial neural network methods in terms of classification accuracy. Our results show that the SVM achieves a higher level of classification accuracy than either the maximum likelihood or the neural classifier, and that the support vector machine can be used with small training datasets and high-dimensional data.


Choice numbers of graphs

Abstract: A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. The simplest case of another problem, stated by the same authors, is settled, proving that every 2-choosable graph is also $(4:2)$-choosable. Applying probabilistic methods, an upper bound for the $k^{th}$ choice number of a graph is given. We also prove that a directed graph with maximum outdegree $d$ and no odd directed cycle is $(k(d+1):k)$-choosable for every $k \geq 1$. Other results presented in this article are related to the strong choice number of graphs (a generalization of the strong chromatic number). We conclude with complexity analysis of some decision problems related to graph choosability.


Set Covering Problems with General Objective Functions

Abstract: We introduce a parameterized version of set cover that generalizes several previously studied problems. Given a ground set V and a collection of subsets S_i of V, a feasible solution is a partition of V such that each subset of the partition is included in one of the S_i. The problem involves maximizing the mean subset size of the partition, where the mean is the generalized mean of parameter p, taken over the elements. For p=-1, the problem is equivalent to the classical minimum set cover problem. For p=0, it is equivalent to the minimum entropy set cover problem, introduced by Halperin and Karp. For p=1, the problem includes the maximum-edge clique partition problem as a special case. We prove that the greedy algorithm simultaneously approximates the problem within a factor of (p+1)^1/p for any p in R^+, and that this is the best possible unless P=NP. These results both generalize and simplify previous results for special cases. We also consider the corresponding graph coloring problem, and prove several tractability and inapproximability results. Finally, we consider a further generalization of the set cover problem in which we aim at minimizing the sum of some concave function of the part sizes. As an application, we derive an approximation ratio for a Rent-or-Buy set cover problem.


Reconstruction of eye movements during blinks

Abstract: In eye movement research in reading, the amount of data plays a crucial role for the validation of results. A methodological problem for the analysis of the eye movement in reading are blinks, when readers close their eyes. Blinking rate increases with increasing reading time, resulting in high data losses, especially for older adults or reading impaired subjects. We present a method, based on the symbolic sequence dynamics of the eye movements, that reconstructs the horizontal position of the eyes while the reader blinks. The method makes use of an observed fact that the movements of the eyes before closing or after opening contain information about the eyes movements during blinks. Test results indicate that our reconstruction method is superior to methods that use simpler interpolation approaches. In addition, analyses of the reconstructed data show no significant deviation from the usual behavior observed in readers.


Digraph Decompositions and Monotonicity in Digraph Searching

Abstract: We consider monotonicity problems for graph searching games. Variants of these games - defined by the type of moves allowed for the players - have been found to be closely connected to graph decompositions and associated width measures such as path- or tree-width. Of particular interest is the question whether these games are monotone, i.e. whether the cops can catch a robber without ever allowing the robber to reach positions that have been cleared before. The monotonicity problem for graph searching games has intensely been studied in the literature, but for two types of games the problem was left unresolved. These are the games on digraphs where the robber is invisible and lazy or visible and fast. In this paper, we solve the problems by giving examples showing that both types of games are non-monotone. Graph searching games on digraphs are closely related to recent proposals for digraph decompositions generalising tree-width to directed graphs. These proposals have partly been motivated by attempts to develop a structure theory for digraphs similar to the graph minor theory developed by Robertson and Seymour for undirected graphs, and partly by the immense number of algorithmic results using tree-width of undirected graphs and the hope that part of this success might be reproducible on digraphs using a directed tree-width. Unfortunately the number of applications for the digraphs measures introduced so far is still small. We therefore explore the limits of the algorithmic applicability of digraph decompositions. In particular, we show that various natural candidates for problems that might benefit from digraphs having small directed tree-width remain NP-complete even on almost acyclic graphs.


Textual Fingerprinting with Texts from Parkin, Bassewitz, and Leander

Abstract: Current research in author profiling to discover a legal author's fingerprint does not only follow examinations based on statistical parameters only but include more and more dynamic methods that can learn and that react adaptable to the specific behavior of an author. But the question on how to appropriately represent a text is still one of the fundamental tasks, and the problem of which attribute should be used to fingerprint the author's style is still not exactly defined. In this work, we focus on linguistic selection of attributes to fingerprint the style of the authors Parkin, Bassewitz and Leander. We use texts of the genre Fairy Tale as it has a clear style and texts of a shorter size with a straightforward story-line and a simple language.


Using Alloy to model-check visual design notations

Abstract: This paper explores the process of validation for the abstract syntax of a graphical notation. We define an unified specification for five of the UML diagrams used by the Discovery Method and, in this document, we illustrate how diagrams can be represented in Alloy and checked against our specification in order to know if these are valid under the Discovery notation.


Approximation Resistant Predicates From Pairwise Independence

Abstract: We study the approximability of predicates on $k$ variables from a domain $[q]$, and give a new sufficient condition for such predicates to be approximation resistant under the Unique Games Conjecture. Specifically, we show that a predicate $P$ is approximation resistant if there exists a balanced pairwise independent distribution over $[q]^k$ whose support is contained in the set of satisfying assignments to $P$.


Software graphs and programmer awareness

Abstract: Dependencies between types in object-oriented software can be viewed as directed graphs, with types as nodes and dependencies as edges. The in-degree and out-degree distributions of such graphs have quite different forms, with the former resembling a power-law distribution and the latter an exponential distribution. This effect appears to be independent of application or type relationship. A simple generative model is proposed to explore the proposition that the difference arises because the programmer is aware of the out-degree of a type but not of its in-degree. The model reproduces the two distributions, and compares reasonably well to those observed in 14 different type relationships across 12 different Java applications.


The Stength of Weak cooperation: A Case Study on Flickr

Abstract: Web 2.0 works with the principle of weak cooperation, where a huge amount of individual contributions build solid and structured sources of data. In this paper, we detail the main properties of this weak cooperation by illustrating them on the photo publication website Flickr, showing the variety of uses producing a rich content and the various procedures devised by Flickr users themselves to select quality. We underlined the interaction between small and heavy users as a specific form of collective production in large social networks communities. We also give the main statistics on the (5M-users, 150M-photos) data basis we worked on for this study, collected from Flickr website using the public API.


Generic and Typical Ranks of Three-Way Arrays

Abstract: The concept of tensor rank, introduced in the twenties, has been popularized at the beginning of the seventies. This has allowed to carry out Factor Analysis on arrays with more than two indices. The generic rank may be seen as an upper bound to the number of factors that can be extracted from a given tensor. We explain in this short paper how to obtain numerically the generic rank of tensors of arbitrary dimensions, and compare it with the rare algebraic results already known at order three. In particular, we examine the cases of symmetric tensors, tensors with symmetric matrix slices, or tensors with free entries.


Multiclass Approaches for Support Vector Machine Based Land Cover Classification

Abstract: SVMs were initially developed to perform binary classification; though, applications of binary classification are very limited. Most of the practical applications involve multiclass classification, especially in remote sensing land cover classification. A number of methods have been proposed to implement SVMs to produce multiclass classification. A number of methods to generate multiclass SVMs from binary SVMs have been proposed by researchers and is still a continuing research topic. This paper compares the performance of six multi-class approaches to solve classification problem with remote sensing data in term of classification accuracy and computational cost. One vs. one, one vs. rest, Directed Acyclic Graph (DAG), and Error Corrected Output Coding (ECOC) based multiclass approaches creates many binary classifiers and combines their results to determine the class label of a test pixel. Another catogery of multi class approach modify the binary class objective function and allows simultaneous computation of multiclass classification by solving a single optimisation problem. Results from this study conclude the usefulness of One vs. One multi class approach in term of accuracy and computational cost over other multi class approaches.


Improved Approximations for Multiprocessor Scheduling Under Uncertainty

Abstract: This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty, or SUU, in which the execution of each job may fail probabilistically. This problem is motivated by the increasing use of distributed computing to handle large, computationally intensive tasks. In the SUU problem we are given n unit-length jobs and m machines, a directed acyclic graph G of precedence constraints among jobs, and unrelated failure probabilities q_{ij} for each job j when executed on machine i for a single timestep. Our goal is to find a schedule that minimizes the expected makespan, which is the expected time at which all jobs complete. Lin and Rajaraman gave the first approximations for this NP-hard problem for the special cases of independent jobs, precedence constraints forming disjoint chains, and precedence constraints forming trees. In this paper, we present asymptotically better approximation algorithms. In particular, we give an O(loglog min(m,n))-approximation for independent jobs (improving on the previously best O(log n)-approximation). We also give an O(log(n+m) loglog min(m,n))-approximation algorithm for precedence constraints that form disjoint chains (improving on the previously best O(log(n)log(m)log(n+m)/loglog(n+m))-approximation by a (log n/loglog n)^2 factor when n = poly(m). Our algorithm for precedence constraints forming chains can also be used as a component for precedence constraints forming trees, yielding a similar improvement over the previously best algorithms for trees.


Sign Language Tutoring Tool

Abstract: In this project, we have developed a sign language tutor that lets users learn isolated signs by watching recorded videos and by trying the same signs. The system records the user's video and analyses it. If the sign is recognized, both verbal and animated feedback is given to the user. The system is able to recognize complex signs that involve both hand gestures and head movements and expressions. Our performance tests yield a 99% recognition rate on signs involving only manual gestures and 85% recognition rate on signs that involve both manual and non manual components, such as head movement and facial expressions.


Anisotropic selection in cellular genetic algorithms

Abstract: In this paper we introduce a new selection scheme in cellular genetic algorithms (cGAs). Anisotropic Selection (AS) promotes diversity and allows accurate control of the selective pressure. First we compare this new scheme with the classical rectangular grid shapes solution according to the selective pressure: we can obtain the same takeover time with the two techniques although the spreading of the best individual is different. We then give experimental results that show to what extent AS promotes the emergence of niches that support low coupling and high cohesion. Finally, using a cGA with anisotropic selection on a Quadratic Assignment Problem we show the existence of an anisotropic optimal value for which the best average performance is observed. Further work will focus on the selective pressure self-adjustment ability provided by this new selection scheme.


Fixed Point and Aperiodic Tilings

Abstract: An aperiodic tile set was first constructed by R.Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals) We present a new construction of an aperiodic tile set that is based on Kleene's fixed-point construction instead of geometric arguments. This construction is similar to J. von Neumann self-reproducing automata; similar ideas were also used by P. Gacs in the context of error-correcting computations. The flexibility of this construction allows us to construct a "robust" aperiodic tile set that does not have periodic (or close to periodic) tilings even if we allow some (sparse enough) tiling errors. This property was not known for any of the existing aperiodic tile sets.


Min-Cost 2-Connected Subgraphs With k Terminals

Abstract: In the k-2VC problem, we are given an undirected graph G with edge costs and an integer k; the goal is to find a minimum-cost 2-vertex-connected subgraph of G containing at least k vertices. A slightly more general version is obtained if the input also specifies a subset S \subseteq V of terminals and the goal is to find a subgraph containing at least k terminals. Closely related to the k-2VC problem, and in fact a special case of it, is the k-2EC problem, in which the goal is to find a minimum-cost 2-edge-connected subgraph containing k vertices. The k-2EC problem was introduced by Lau et al., who also gave a poly-logarithmic approximation for it. No previous approximation algorithm was known for the more general k-2VC problem. We describe an O(\log n \log k) approximation for the k-2VC problem.


Self-* overload control for distributed web systems

Abstract: Unexpected increases in demand and most of all flash crowds are considered the bane of every web application as they may cause intolerable delays or even service unavailability. Proper quality of service policies must guarantee rapid reactivity and responsiveness even in such critical situations. Previous solutions fail to meet common performance requirements when the system has to face sudden and unpredictable surges of traffic. Indeed they often rely on a proper setting of key parameters which requires laborious manual tuning, preventing a fast adaptation of the control policies. We contribute an original Self-* Overload Control (SOC) policy. This allows the system to self-configure a dynamic constraint on the rate of admitted sessions in order to respect service level agreements and maximize the resource utilization at the same time. Our policy does not require any prior information on the incoming traffic or manual configuration of key parameters. We ran extensive simulations under a wide range of operating conditions, showing that SOC rapidly adapts to time varying traffic and self-optimizes the resource utilization. It admits as many new sessions as possible in observance of the agreements, even under intense workload variations. We compared our algorithm to previously proposed approaches highlighting a more stable behavior and a better performance.


Guarding curvilinear art galleries with vertex or point guards

Abstract: One of the earliest and most well known problems in computational geometry is the so-called art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they cover the interior of the polygon. In this paper we consider the problem of guarding an art gallery which is modeled as a polygon with curvilinear walls. Our main focus is on polygons the edges of which are convex arcs pointing towards the exterior or interior of the polygon (but not both), named piecewise-convex and piecewise-concave polygons. We prove that, in the case of piecewise-convex polygons, if we only allow vertex guards, $\lfloor\frac{4n}{7}\rfloor-1$ guards are sometimes necessary, and $\lfloor\frac{2n}{3}\rfloor$ guards are always sufficient. Moreover, an $O(n\log{}n)$ time and O(n) space algorithm is described that produces a vertex guarding set of size at most $\lfloor\frac{2n}{3}\rfloor$. When we allow point guards the afore-mentioned lower bound drops down to $\lfloor\frac{n}{2}\rfloor$. In the special case of monotone piecewise-convex polygons we can show that $\lfloor\frac{n}{2}\rfloor$ vertex guards are always sufficient and sometimes necessary; these bounds remain valid even if we allow point guards. In the case of piecewise-concave polygons, we show that $2n-4$ point guards are always sufficient and sometimes necessary, whereas it might not be possible to guard such polygons by vertex guards. We conclude with bounds for other types of curvilinear polygons and future work.


The complexity of planar graph choosability

Abstract: A graph $G$ is {\em $k$-choosable} if for every assignment of a set $S(v)$ of $k$ colors to every vertex $v$ of $G$, there is a proper coloring of $G$ that assigns to each vertex $v$ a color from $S(v)$. We consider the complexity of deciding whether a given graph is $k$-choosable for some constant $k$. In particular, it is shown that deciding whether a given planar graph is 4-choosable is NP-hard, and so is the problem of deciding whether a given planar triangle-free graph is 3-choosable. We also obtain simple constructions of a planar graph which is not 4-choosable and a planar triangle-free graph which is not 3-choosable.


On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems

Abstract: This paper has been withdrawn by the corresponding author because the newest version is now published in Discrete Applied Mathematics.


Covering Directed Graphs by In-trees

Abstract: Given a directed graph $D=(V,A)$ with a set of $d$ specified vertices $S=\{s_1,...,s_d\}\subseteq V$ and a function $f\colon S \to \mathbb{Z}_+$ where $\mathbb{Z}_+$ denotes the set of non-negative integers, we consider the problem which asks whether there exist $\sum_{i=1}^d f(s_i)$ in-trees denoted by $T_{i,1},T_{i,2},..., T_{i,f(s_i)}$ for every $i=1,...,d$ such that $T_{i,1},...,T_{i,f(s_i)}$ are rooted at $s_i$, each $T_{i,j}$ spans vertices from which $s_i$ is reachable and the union of all arc sets of $T_{i,j}$ for $i=1,...,d$ and $j=1,...,f(s_i)$ covers $A$. In this paper, we prove that such set of in-trees covering $A$ can be found by using an algorithm for the weighted matroid intersection problem in time bounded by a polynomial in $\sum_{i=1}^df(s_i)$ and the size of $D$. Furthermore, for the case where $D$ is acyclic, we present another characterization of the existence of in-trees covering $A$, and then we prove that in-trees covering $A$ can be computed more efficiently than the general case by finding maximum matchings in a series of bipartite graphs.


The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace

Abstract: The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithms, it is in the class $AC^1$. In this paper we improve the upper bound for planar 3-connected graphs to unambiguous logspace, in fact to $UL \cap coUL$. As a consequence of our method we get that the isomorphism problem for oriented graphs is in $NL$. We also show that the problems are hard for $L$.


Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set

Abstract: The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we propose to use measure and conquer also as a tool in the design of algorithms. In an iterative process, we can obtain a series of branch and reduce algorithms. A mathematical analysis of an algorithm in the series with measure and conquer results in a quasiconvex programming problem. The solution by computer to this problem not only gives a bound on the running time, but also can give a new reduction rule, thus giving a new, possibly faster algorithm. This makes design by measure and conquer a form of computer aided algorithm design. When we apply the methodology to a Set Cover modelling of the Dominating Set problem, we obtain the currently fastest known exact algorithms for Dominating Set: an algorithm that uses $O(1.5134^n)$ time and polynomial space, and an algorithm that uses $O(1.5063^n)$ time.


Structural aspects of tilings

Abstract: In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in two different contexts: the first one is combinatorial and the other topological. These two approaches have independent merits and, once combined, provide somehow surprising results. The particular case where the set of produced tilings is countable is deeply investigated while we prove that the uncountable case may have a completely different structure. We introduce a pattern preorder and also make use of Cantor-Bendixson rank. Our first main result is that a tile-set that produces only periodic tilings produces only a finite number of them. Our second main result exhibits a tiling with exactly one vector of periodicity in the countable case.


Equilibria, Fixed Points, and Complexity Classes

Abstract: Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing optimal strategies and the values of competitive games (stochastic and other games); stable configurations of neural networks; analysing basic stochastic models for evolution like branching processes and for language like stochastic context-free grammars; and models that incorporate the basic primitives of probability and recursion like recursive Markov chains. It is not known whether these problems can be solved in polynomial time. There are certain common computational principles underlying different types of equilibria, which are captured by the complexity classes PLS, PPAD, and FIXP. Representative complete problems for these classes are respectively, pure Nash equilibria in games where they are guaranteed to exist, (mixed) Nash equilibria in 2-player normal form games, and (mixed) Nash equilibria in normal form games with 3 (or more) players. This paper reviews the underlying computational principles and the corresponding classes.


Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental

Abstract: In the Multislope Ski Rental problem, the user needs a certain resource for some unknown period of time. To use the resource, the user must subscribe to one of several options, each of which consists of a one-time setup cost (``buying price''), and cost proportional to the duration of the usage (``rental rate''). The larger the price, the smaller the rent. The actual usage time is determined by an adversary, and the goal of an algorithm is to minimize the cost by choosing the best option at any point in time. Multislope Ski Rental is a natural generalization of the classical Ski Rental problem (where the only options are pure rent and pure buy), which is one of the fundamental problems of online computation. The Multislope Ski Rental problem is an abstraction of many problems where online decisions cannot be modeled by just two options, e.g., power management in systems which can be shut down in parts. In this paper we study randomized algorithms for Multislope Ski Rental. Our results include the best possible online randomized strategy for any additive instance, where the cost of switching from one option to another is the difference in their buying prices; and an algorithm that produces an $e$-competitive randomized strategy for any (non-additive) instance.


Limit complexities revisited

Abstract: The main goal of this paper is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result from (Vereshchagin, 2002) saying that $\limsup_n\KS(x|n)$ (here $\KS(x|n)$ is conditional (plain) Kolmogorov complexity of $x$ when $n$ is known) equals $\KS^{\mathbf{0'}(x)$, the plain Kolmogorov complexity with $\mathbf{0'$-oracle. Then we use the same argument to prove similar results for prefix complexity (and also improve results of (Muchnik, 1987) about limit frequencies), a priori probability on binary tree and measure of effectively open sets. As a by-product, we get a criterion of $\mathbf{0'}$ Martin-L\"of randomness (called also 2-randomness) proved in (Miller, 2004): a sequence $\omega$ is 2-random if and only if there exists $c$ such that any prefix $x$ of $\omega$ is a prefix of some string $y$ such that $\KS(y)\ge |y|-c$. (In the 1960ies this property was suggested in (Kolmogorov, 1968) as one of possible randomness definitions; its equivalence to 2-randomness was shown in (Miller, 2004) while proving another 2-randomness criterion (see also (Nies et al. 2005)): $\omega$ is 2-random if and only if $\KS(x)\ge |x|-c$ for some $c$ and infinitely many prefixes $x$ of $\omega$. Finally, we show that the low-basis theorem can be used to get alternative proofs for these results and to improve the result about effectively open sets; this stronger version implies the 2-randomness criterion mentioned in the previous sentence.


Minimizing Flow Time in the Wireless Gathering Problem

Abstract: We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet. We prove that no polynomial time algorithm for this problem can have approximation ratio less than $\Omega(m^{1/3)$ when $m$ packets have to be transmitted, unless $P = NP$. We then use resource augmentation to assess the performance of a FIFO-like strategy. We prove that this strategy is 5-speed optimal, i.e., its cost remains within the optimal cost if we allow the algorithm to transmit data at a speed 5 times higher than that of the optimal solution we compare to.


Factoring Polynomials over Finite Fields using Balance Test

Abstract: We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), (Gao, 2001) designed a polynomial time algorithm that fails to factor only if the input polynomial satisfies a strong symmetry property, namely square balance. In this paper, we propose an extension of Gao's algorithm that fails only under an even stronger symmetry property. We also show that our property can be used to improve the time complexity of best deterministic algorithms on most input polynomials. The property also yields a new randomized polynomial time algorithm.


Stackelberg Network Pricing Games

Abstract: We study a multi-player one-round game termed Stackelberg Network Pricing Game, in which a leader can set prices for a subset of $m$ priceable edges in a graph. The other edges have a fixed cost. Based on the leader's decision one or more followers optimize a polynomial-time solvable combinatorial minimization problem and choose a minimum cost solution satisfying their requirements based on the fixed costs and the leader's prices. The leader receives as revenue the total amount of prices paid by the followers for priceable edges in their solutions, and the problem is to find revenue maximizing prices. Our model extends several known pricing problems, including single-minded and unit-demand pricing, as well as Stackelberg pricing for certain follower problems like shortest path or minimum spanning tree. Our first main result is a tight analysis of a single-price algorithm for the single follower game, which provides a $(1+\epsilon) \log m$-approximation for any $\epsilon >0$. This can be extended to provide a $(1+\epsilon)(\log k + \log m)$-approximation for the general problem and $k$ followers. The latter result is essentially best possible, as the problem is shown to be hard to approximate within $\mathcal{O(\log^\epsilon k + \log^\epsilon m)$. If followers have demands, the single-price algorithm provides a $(1+\epsilon)m^2$-approximation, and the problem is hard to approximate within $\mathcal{O(m^\epsilon)$ for some $\epsilon >0$. Our second main result is a polynomial time algorithm for revenue maximization in the special case of Stackelberg bipartite vertex cover, which is based on non-trivial max-flow and LP-duality techniques. Our results can be extended to provide constant-factor approximations for any constant number of followers.


Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound

Abstract: We study the one-way number-on-the-forehead (NOF) communication complexity of the $k$-layer pointer jumping problem with $n$ vertices per layer. This classic problem, which has connections to many aspects of complexity theory, has seen a recent burst of research activity, seemingly preparing the ground for an $\Omega(n)$ lower bound, for constant $k$. Our first result is a surprising sublinear -- i.e., $o(n)$ -- upper bound for the problem that holds for $k \ge 3$, dashing hopes for such a lower bound. A closer look at the protocol achieving the upper bound shows that all but one of the players involved are collapsing, i.e., their messages depend only on the composition of the layers ahead of them. We consider protocols for the pointer jumping problem where all players are collapsing. Our second result shows that a strong $n - O(\log n)$ lower bound does hold in this case. Our third result is another upper bound showing that nontrivial protocols for (a non-Boolean version of) pointer jumping are possible even when all players are collapsing. Our lower bound result uses a novel proof technique, different from those of earlier lower bounds that had an information-theoretic flavor. We hope this is useful in further study of the problem.


Geodesic Fr\'echet Distance Inside a Simple Polygon

Abstract: We unveil an alluring alternative to parametric search that applies to both the non-geodesic and geodesic Fr\'echet optimization problems. This randomized approach is based on a variant of red-blue intersections and is appealing due to its elegance and practical efficiency when compared to parametric search. We present the first algorithm for the geodesic Fr\'echet distance between two polygonal curves $A$ and $B$ inside a simple bounding polygon $P$. The geodesic Fr\'echet decision problem is solved almost as fast as its non-geodesic sibling and requires $O(N^{2\log k)$ time and $O(k+N)$ space after $O(k)$ preprocessing, where $N$ is the larger of the complexities of $A$ and $B$ and $k$ is the complexity of $P$. The geodesic Fr\'echet optimization problem is solved by a randomized approach in $O(k+N^{2\log kN\log N)$ expected time and $O(k+N^{2)$ space. This runtime is only a logarithmic factor larger than the standard non-geodesic Fr\'echet algorithm (Alt and Godau 1995). Results are also presented for the geodesic Fr\'echet distance in a polygonal domain with obstacles and the geodesic Hausdorff distance for sets of points or sets of line segments inside a simple polygon $P$.


On Dynamic Breadth-First Search in External-Memory

Abstract: We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially $n$ nodes and O(n) edges and monotone update sequences of either $\Theta(n)$ edge insertions or $\Theta(n)$ edge deletions, we prove an amortized high-probability bound of $O(n/B^{2/3}+\sort(n)\cdot \log B)$ I/Os per update. In contrast, the currently best approach for static BFS on sparse undirected graphs requires $\Omega(n/B^{1/2}+\sort(n))$ I/Os.


An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines

Abstract: We study the scheduling problem on unrelated machines in the mechanism design setting. This problem was proposed and studied in the seminal paper (Nisan and Ronen 1999), where they gave a 1.75-approximation randomized truthful mechanism for the case of two machines. We improve this result by a 1.6737-approximation randomized truthful mechanism. We also generalize our result to a $0.8368m$-approximation mechanism for task scheduling with $m$ machines, which improve the previous best upper bound of $0.875m(Mu'alem and Schapira 2007).


Tight Bounds for Blind Search on the Integers

Abstract: We analyze a simple random process in which a token is moved in the interval $A=\{0,...,n\$: Fix a probability distribution $\mu$ over $\{1,...,n\$. Initially, the token is placed in a random position in $A$. In round $t$, a random value $d$ is chosen according to $\mu$. If the token is in position $a\geq d$, then it is moved to position $a-d$. Otherwise it stays put. Let $T$ be the number of rounds until the token reaches position 0. We show tight bounds for the expectation of $T$ for the optimal distribution $\mu$. More precisely, we show that $\min_\mu\{E_\mu(T)\=\Theta((\log n)^2)$. For the proof, a novel potential function argument is introduced. The research is motivated by the problem of approximating the minimum of a continuous function over $[0,1]$ with a ``blind'' optimization strategy.


Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps

Abstract: This paper presents a formalized proof of a discrete form of the Jordan Curve Theorem. It is based on a hypermap model of planar subdivisions, formal specifications and proofs assisted by the Coq system. Fundamental properties are proven by structural or noetherian induction: Genus Theorem, Euler's Formula, constructive planarity criteria. A notion of ring of faces is inductively defined and a Jordan Curve Theorem is stated and proven for any planar hypermap.


Computing Minimum Spanning Trees with Uncertainty

Abstract: We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge $e$ of the graph only a set $A_e$, called an uncertainty area, that contains the actual edge weight $w_e$ is known. The algorithm can `update' $e$ to obtain the edge weight $w_e \in A_e$. The task is to output the edge set of a minimum spanning tree after a minimum number of updates. An algorithm is $k$-update competitive if it makes at most $k$ times as many updates as the optimum. We present a 2-update competitive algorithm if all areas $A_e$ are open or trivial, which is the best possible among deterministic algorithms. The condition on the areas $A_e$ is to exclude degenerate inputs for which no constant update competitive algorithm can exist. Next, we consider a setting where the vertices of the graph correspond to points in Euclidean space and the weight of an edge is equal to the distance of its endpoints. The location of each point is initially given as an uncertainty area, and an update reveals the exact location of the point. We give a general relation between the edge uncertainty and the vertex uncertainty versions of a problem and use it to derive a 4-update competitive algorithm for the minimum spanning tree problem in the vertex uncertainty model. Again, we show that this is best possible among deterministic algorithms.


Lower bounds for adaptive linearity tests

Abstract: Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions which are far from linear. Linearity tests were first introduced by (Blum, Luby and Rubenfeld, 1993), and were later used in the PCP theorem, among other applications. The quality of a linearity test is described by its correctness c - the probability it accepts linear functions, its soundness s - the probability it accepts functions far from linear, and its query complexity q - the number of queries it makes. Linearity tests were studied in order to decrease the soundness of linearity tests, while keeping the query complexity small (for one reason, to improve PCP constructions). Samorodnitsky and Trevisan (Samorodnitsky and Trevisan 2000) constructed the Complete Graph Test, and prove that no Hyper Graph Test can perform better than the Complete Graph Test. Later in (Samorodnitsky and Trevisan 2006) they prove, among other results, that no non-adaptive linearity test can perform better than the Complete Graph Test. Their proof uses the algebraic machinery of the Gowers Norm. A result by (Ben-Sasson, Harsha and Raskhodnikova 2005) allows to generalize this lower bound also to adaptive linearity tests. We also prove the same optimal lower bound for adaptive linearity test, but our proof technique is arguably simpler and more direct than the one used in (Samorodnitsky and Trevisan 2006). We also study, like (Samorodnitsky and Trevisan 2006), the behavior of linearity tests on quadratic functions. However, instead of analyzing the Gowers Norm of certain functions, we provide a more direct combinatorial proof, studying the behavior of linearity tests on random quadratic functions...


A Theory for Valiant's Matchcircuits (Extended Abstract)

Abstract: The computational function of a matchgate is represented by its character matrix. In this article, we show that all nonsingular character matrices are closed under matrix inverse operation, so that for every $k$, the nonsingular character matrices of $k$-bit matchgates form a group, extending the recent work of Cai and Choudhary (2006) of the same result for the case of $k=2$, and that the single and the two-bit matchgates are universal for matchcircuits, answering a question of Valiant (2002).


Geometric Set Cover and Hitting Sets for Polytopes in $R^3$

Abstract: Suppose we are given a finite set of points $P$ in $\R^3$ and a collection of polytopes $\mathcal{T}$ that are all translates of the same polytope $T$. We consider two problems in this paper. The first is the set cover problem where we want to select a minimal number of polytopes from the collection $\mathcal{T}$ such that their union covers all input points $P$. The second problem that we consider is finding a hitting set for the set of polytopes $\mathcal{T}$, that is, we want to select a minimal number of points from the input points $P$ such that every given polytope is hit by at least one point. We give the first constant-factor approximation algorithms for both problems. We achieve this by providing an epsilon-net for translates of a polytope in $R^3$ of size $\bigO(\frac{1{\epsilon)$.


Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic

Abstract: We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These logics are obtained from the restriction of set quantification in monadic second order logic to certain subsets like, e.g., finite sets, chains, and finite unions of chains. We show that these theories of the Shelah-Stupp iteration can be reduced to corresponding theories of the base structure. This fails for Muchnik's iteration.


New Combinatorial Complete One-Way Functions

Abstract: In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we present two new one-way functions based on semi-Thue string rewriting systems and a version of the Post Correspondence Problem and prove their completeness. Besides, we present an alternative proof of Levin's result. We also discuss the properties a combinatorial problem should have in order to hold a complete one-way function.


On Geometric Spanners of Euclidean and Unit Disk Graphs

Abstract: We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor $C_{del\approx 2.42$; however, its degree may not be bounded. Our first result is a very simple linear time algorithm for constructing a subgraph of the Delaunay graph with stretch factor $\rho =1+2\pi(k\cos{\frac{\pi{k)^{-1$ and degree bounded by $k$, for any integer parameter $k\geq 14$. This result immediately implies an algorithm for constructing a planar geometric spanner of a Euclidean graph with stretch factor $\rho \cdot C_{del$ and degree bounded by $k$, for any integer parameter $k\geq 14$. Moreover, the resulting spanner contains a Euclidean Minimum Spanning Tree (EMST) as a subgraph. Our second contribution lies in developing the structural results necessary to transfer our analysis and algorithm from Euclidean graphs to unit disk graphs, the usual model for wireless ad-hoc networks. We obtain a very simple distributed, {\em strictly-localized algorithm that, given a unit disk graph embedded in the plane, constructs a geometric spanner with the above stretch factor and degree bound, and also containing an EMST as a subgraph. The obtained results dramatically improve the previous results in all aspects, as shown in the paper.


Quantifying Homology Classes

Abstract: We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we define an optimal basis of a homology group to be the basis whose elements' size have the minimal sum. We provide a greedy algorithm to compute the optimal basis and measure classes in it. The algorithm runs in $O(\beta^4 n^3 \log^2 n)$ time, where $n$ is the size of the simplicial complex and $\beta$ is the Betti number of the homology group. Third, we discuss different ways of localizing homology classes and prove some hardness results.


Cardinality and counting quantifiers on omega-automatic structures

Abstract: We investigate structures that can be represented by omega-automata, so called omega-automatic structures, and prove that relations defined over such structures in first-order logic expanded by the first-order quantifiers `there exist at most $\aleph_0$ many', 'there exist finitely many' and 'there exist $k$ modulo $m$ many' are omega-regular. The proof identifies certain algebraic properties of omega-semigroups. As a consequence an omega-regular equivalence relation of countable index has an omega-regular set of representatives. This implies Blumensath's conjecture that a countable structure with an $\omega$-automatic presentation can be represented using automata on finite words. This also complements a very recent result of Hj\"orth, Khoussainov, Montalban and Nies showing that there is an omega-automatic structure which has no injective presentation.


Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

Abstract: Consider a set of labels $L$ and a set of trees ${\mathcal T} = \{{\mathcal T}^{(1), {\mathcal T}^{(2), ..., {\mathcal T}^{(k) \$ where each tree ${\mathcal T}^{(i)$ is distinctly leaf-labeled by some subset of $L$. One fundamental problem is to find the biggest tree (denoted as supertree) to represent $\mathcal T}$ which minimizes the disagreements with the trees in ${\mathcal T}$ under certain criteria. This problem finds applications in phylogenetics, database, and data mining. In this paper, we focus on two particular supertree problems, namely, the maximum agreement supertree problem (MASP) and the maximum compatible supertree problem (MCSP). These two problems are known to be NP-hard for $k \geq 3$. This paper gives the first polynomial time algorithms for both MASP and MCSP when both $k$ and the maximum degree $D$ of the trees are constant.


Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages

Abstract: The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the single levels of these hierarchies and obtain the following results: - The classes of the Boolean hierarchy over level $\Sigma_1$ of the dot-depth hierarchy are decidable in $NL$ (previously only the decidability was known). The same remains true if predicates mod $d$ for fixed $d$ are allowed. - If modular predicates for arbitrary $d$ are allowed, then the classes of the Boolean hierarchy over level $\Sigma_1$ are decidable. - For the restricted case of a two-letter alphabet, the classes of the Boolean hierarchy over level $\Sigma_2$ of the Straubing-Th\'erien hierarchy are decidable in $NL$. This is the first decidability result for this hierarchy. - The membership problems for all mentioned Boolean-hierarchy classes are logspace many-one hard for $NL$. - The membership problems for quasi-aperiodic languages and for $d$-quasi-aperiodic languages are logspace many-one complete for $PSPACE$.


Succinctness of the Complement and Intersection of Regular Expressions

Abstract: We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the complement of a given regular expression, a double exponential size increase cannot be avoided. Similarly, when constructing a regular expression defining the intersection of a fixed and an arbitrary number of regular expressions, an exponential and double exponential size increase, respectively, can in worst-case not be avoided. All mentioned lower bounds improve the existing ones by one exponential and are tight in the sense that the target expression can be constructed in the corresponding time class, i.e., exponential or double exponential time. As a by-product, we generalize a theorem by Ehrenfeucht and Zeiger stating that there is a class of DFAs which are exponentially more succinct than regular expressions, to a fixed four-letter alphabet. When the given regular expressions are one-unambiguous, as for instance required by the XML Schema specification, the complement can be computed in polynomial time whereas the bounds concerning intersection continue to hold. For the subclass of single-occurrence regular expressions, we prove a tight exponential lower bound for intersection.


Model Checking Games for the Quantitative mu-Calculus

Abstract: We investigate quantitative extensions of modal logic and the modal mu-calculus, and study the question whether the tight connection between logic and games can be lifted from the qualitative logics to their quantitative counterparts. It turns out that, if the quantitative mu-calculus is defined in an appropriate way respecting the duality properties between the logical operators, then its model checking problem can indeed be characterised by a quantitative variant of parity games. However, these quantitative games have quite different properties than their classical counterparts, in particular they are, in general, not positionally determined. The correspondence between the logic and the games goes both ways: the value of a formula on a quantitative transition system coincides with the value of the associated quantitative game, and conversely, the values of quantitative parity games are definable in the quantitative mu-calculus.


A New Approach to Spreadsheet Analytics Management in Financial Markets

Abstract: Spreadsheets in financial markets are frequently used as database, calculator and reporting application combined. This paper describes an alternative approach in which spreadsheet design and database technology have been brought together in order to alleviate management and regulatory concerns over the operational risks of spreadsheet usage. In particular, the paper focuses on the rapid creation and centralised deployment of statistical analytics within a software system now in use by major investment banks, and presents a novel technique for the manipulation in spreadsheets of high volumes of intraday market data.


Fabrication of Miniaturized Variable-focus Lens Using Liquid Filling Technique

Abstract: This paper describes a simple method for fabricating a variable-focus lens by using PDMS (polydimethylsiloxane) and filling with liquid for the variable-focus lens. The lens diameter of 2-mm was designed in this experiment and expected to reach the focal length in the range of 3 ~ 12 mm. The theoretical value between the liquid volume and the lens contact angle at different focal lengths were simulated and measured. The pumped-in volumes ranged from 200 to 1400 $\mu$l, the contact angles ranged from 14.25 degrees to 49.02 degrees. Changing the deformation of PDMS film using different micro-fluidic volume produces the variable focal length from 4 10 mm in this experiment. The proposed method successfully fabricated a variable-focus lens. Bonding PDMS only once using no expensive instrument such as oxygen plasma was accomplished. The final objective is to insert the variable focus lens into portable optical imagery products.


A Novel X-Axis Tuning Fork Gyroscope with "8 Vertical Springs-Proofmass" Structure on (111)-Silicon

Abstract: A novel x-axis tuning fork MEMS gyroscope with "8 vertical springs-proofmass" structure for Coriolis effect detection is presented. Compared with the common single-plane springs, the 8 vertical springs, symmetrically located at the top and bottom sides, more stably suspend the large thick proofmass featuring large capacitance variation and low mechanical noise. A bulk-micromachining technology is applied to obtain the large proofmass and twins-like dual beams. During the fabrication process, the dimensions of the 8 vertical springs are precisely confined by thermal oxide protected limit trenches (LTs) sidewalls and the extreme slowly etched (111)-planes; therefore a small mismatch of less than 30 Hz is achieved before tuning. Initial test shows a sensitivity of 0.15mV/(deg/s) and rate resolution around 0.1deg/s under atmosphere pressure.


Fabrication of MEMS Resonators in Thin SOI

Abstract: A simple and fast process for micro-electromechanical (MEM) resonators with deep sub-micron transduction gaps in thin SOI is presented in this paper. Thin SOI wafers are important for advanced CMOS technology and thus are evaluated as resonator substrates for future co-integration with CMOS circuitry on a single chip. As the transduction capacitance scales with the resonator thickness, it is important to fabricate deep sub-micron trenches in order to achieve a good capacitive coupling. Through the combination of conventional UV-lithography and focused ion beam (FIB) milling the process needs only two lithography steps, enabling therefore a way for fast prototyping of MEM-resonators. Different FIB parameters and etching parameters are compared in this paper and their effect on the process are reported.


Usage of Porous Al2O3 Layers for RH Sensing

Abstract: At the Department of Electron Devices a cheap, more or less CMOS process compatible capacitive type RH sensor has been developed. Capacitive sensors are based on dielectric property changes of thin films upon water vapour uptake which depends on the surrounding media's relative humidity content. Because of the immense surface-to-volume ratio and the abundant void fraction, very high sensitivities can be obtained with porous ceramics. One of the ceramics to be used is porous Al2O3, obtained by electrochemical oxidation of aluminium under anodic bias. The average pore sizes are between 6...9 nm. In our paper we intend to demonstrate images representing the influence of the technological parameters on the porous structure and the device sensitivity.


Modeling of large area hot embossing

Abstract: Today, hot embossing and injection molding belong to the established plastic molding processes in microengineering. Based on experimental findings, a variety of microstructures have been replicated so far using the processes. However, with increasing requirements regarding the embossing surface and the simultaneous decrease of the structure size down into the nanorange, increasing know-how is needed to adapt hot embossing to industrial standards. To reach this objective, a German-Canadian cooperation project has been launched to study hot embossing theoretically by a process simulation and experimentally. The present publication shall report about the first results of the simulation - the modeling and simulation of large area replication based on an eight inch microstructured mold.


Liquid Density Sensing Using Resonant Flexural Plate Wave Device with Sol-Gel PZT Thin Films

Abstract: This paper presents the design, fabrication and preliminary experimental results of a flexure plate wave (FPW) resonator using sol-gel derived lead zirconate titanates (PZT) thin films. The resonator adopts a two-port structure with reflecting grates on the composite membrane of PZT and SiNx. The design of the reflecting grate is derived from a SAW resonator model using COM theory to produce a sharp resonant peak. The comparison between the mass and the viscosity effects from the theoretical expression illustrates the applications and the constraints of the proposed device in liquid sensing. Multiple coatings of sol-gel derived PZT films are adopted because of the cost advantage and the high electromechanical coupling effect over other piezoelectric films. The fabrication issues of the proposed material structure are addressed. Theoretical estimations of the mass and the viscosity effects are compared with the experimental results. The resonant frequency has a good linear correlation with the density of low viscosity liquids, which demonstrate the feasibility of the proposed device.


Design, Fabrication and Characterization of a Piezoelectric Microgenerator Including a Power Management Circuit

Abstract: We report in this paper the design, fabrication and experimental characterization of a piezoelectric MEMS microgenerator. This device scavenges the energy of ambient mechanical vibrations characterized by frequencies in the range of 1 kHz. This component is made with Aluminum Nitride thin film deposited with a CMOS compatible process. Moreover we analyze two possible solutions for the signal rectification: a discrete doubler-rectifier and a full custom power management circuit. The ASIC developed for this application takes advantage of diodes with very low threshold voltage and therefore allows the conversion of extremely low input voltages corresponding to very weak input accelerations. The volume of the proposed generator is inferior to 1mm3 and the generated powers are in the range of 1$\mu$W. This system is intended to supply power to autonomous wireless sensor nodes.


A complete study of electroactive polymers for energy scavenging: modelling and experiments

Abstract: Recent progresses in ultra low power microelectronics propelled the development of several microsensors and particularly the self powered microsystems (SPMS). One of their limitations is their size and their autonomy due to short lifetime of the batteries available on the market. To ensure their ecological energetic autonomy, a promising alternative is to scavenge the ambient energy such as the mechanical one. Nowadays, few microgenerators operate at low frequency. They are often rigid structures that can perturb the application or the environment; none of them are perfectly flexible. Thus, our objective is to create a flexible, non-intrusive scavenger using electroactive polymers. The goal of this work is to design a generator which can provide typically 100 ?W to supply a low consumption system. We report in this paper an analytical model which predicts the energy produced by a simple electroactive membrane, and some promising experimental results.


Step-up converter for electromagnetic vibrational energy scavenger

Abstract: This paper introduces a voltage multiplier (VM) circuit which can step up a minimum voltage of 150 mV (peak). The operation and characteristics of this converter circuit are described. The voltage multiplier circuit is also tested with micro and macro scale electromagnetic vibrational generators and the effect of the VM on the optimum load conditions of the electromagnetic generator is presented. The measured results show that 85% efficiency can be achieved from this VM circuit at a power level of 18 ?W.


Gas Damping Coefficient Research for MEMS Comb Linear Vibration Gyroscope

Abstract: Silicon-MEMS gyroscope is an important part of MEMS (Micro Electrical Mechanical System). There are some disturb ignored in traditional gyroscope that must be evaluated newly because of its smaller size (reach the level of micron). In these disturb, the air pressure largely influences the performance of MEMS gyroscope. Different air pressure causes different gas damping coefficient for the MEMS comb linear vibration gyroscope and different gas damping coefficient influences the quality factor of the gyroscope directive. The quality factor influences the dynamic working bandwidth of the MEMS comb linear vibration gyroscope, so it is influences the output characteristic of the MEMS comb linear vibration gyroscope. The paper shows the relationship between the air pressure and the output amplified and phase of the detecting axis through analyzing the air pressure influence on the MEMS comb linear vibration gyroscope. It discusses the influence on the frequency distribute and quality factor of the MEMS comb linear vibration gyroscope for different air pressure.


Comparison of Two Low-Power Electronic Interfaces for Capacitive Mems Sensors

Abstract: The paper discusses the importance and the issues of interfacing capacitive sensors. Two architectures applicable for interfacing capacitive sensors are presented. The first solution was designed to interface a capacitive humidity sensor designed and built for a humidity-dependent monolithic capacitor developed at Budapest University of Technology and Economics. The second case presents the possible read-out solutions for a SOI-MEMS accelerometer. Both of the architectures were built and tested in a discrete implementation to qualify the methods before the integrated realization. The paper presents a detailed comparison of the two methods


High Efficiency 3-Phase Cmos Rectifier with Step Up and Regulated

Abstract: This paper presents several design issues related to the monolithic integration of a 3-phase AC to DC low voltage, low power rectifier for 3-phase micro source electrical conditioning. Reduced input voltage operation (down to 1V), high efficiency, and output voltage regulations are implemented, based on commercially available CMOS technology. Global design and system issues are detailed. The management of start-up sequences under self supplied conditions as well as output voltage regulations are specifically addressed. Simulation results, practical implementation and validation are presented. They are based on the association of three micro elements : a 3-phase micro-generator, a stand alone 3-phase AC to DC integrated rectifier, and an output voltage conditioner based on a commercially available IC.


Silicon on Nothing Mems Electromechanical Resonator

Abstract: The very significant growth of the wireless communication industry has spawned tremendous interest in the development of high performances radio frequencies (RF) components. Micro Electro Mechanical Systems (MEMS) are good candidates to allow reconfigurable RF functions such as filters, oscillators or antennas. This paper will focus on the MEMS electromechanical resonators which show interesting performances to replace SAW filters or quartz reference oscillators, allowing smaller integrated functions with lower power consumption. The resonant frequency depends on the material properties, such as Young's modulus and density, and on the movable mechanical structure dimensions (beam length defined by photolithography). Thus, it is possible to obtain multi frequencies resonators on a wafer. The resonator performance (frequency, quality factor) strongly depends on the environment, like moisture or pressure, which imply the need for a vacuum package. This paper will present first resonator mechanisms and mechanical behaviors followed by state of the art descriptions with applications and specifications overview. Then MEMS resonator developments at STMicroelectronics including FEM analysis, technological developments and characterization are detailed.


Copper Planar Microcoils Applied to Magnetic Actuation

Abstract: Recent advances in microtechnology allow realization of planar microcoils. These components are integrated in MEMS as magnetic sensor or actuator. In the latter case, it is necessary to maximize the effective magnetic field which is proportional to the current passing through the copper track and depends on the distance to the generation microcoil. The aim of this work was to determine the optimal microcoil design configuration for magnetic field generation. The results were applied to magnetic actuation, taking into account technological constraints. In particular, we have considered different realistic configurations that involve a magnetically actuated device coupled to a microcoil. Calculations by a semi-analytical method using Matlab software were validated by experimental measurements. The copper planar microcoils are fabricated by U.V. micromoulding on different substrates: flexible polymer (Kapton) and silicate on silicon. They are constituted by a spiral-like continuous track. Their total surface is about 1 mm2.


Ni-MH battery modelling for ambient intelligence applications

Abstract: Mobile devices, like sensor networks and MEMS actuators use mobile power supplies to ensure energy for their operation. These are mostly batteries. The lifetime of the devices depends on the power consumption and on the quality and capacitance of the battery. Though the integrated circuits and their power consumption improve continually, their clock frequency also increases with the time, and the resultant power consumption seems not to vary, or slightly increase. On the other hand, the properties of batteries are developing much slower, necessitating the optimization of their usage on system level.


Analysis of polysilicon micro beams buckling with temperature-dependent properties

Abstract: The suspended electrothermal polysilicon micro beams generate displacements and forces by thermal buckling effects. In the previous electro-thermal and thermo-elastic models of suspended polysilicon micro beams, the thermo-mechanical properties of polysilicon have been considered constant over a wide rang of temperature (20- 900 degrees C). In reality, the thermo-mechanical properties of polysilicon depend on temperature and change significantly at high temperatures. This paper describes the development and validation of theoretical and Finite Element Model (FEM) including the temperature dependencies of polysilicon properties such as thermal expansion coefficient and Young's modulus. In the theoretical models, two parts of elastic deflection model and thermal elastic model of micro beams buckling have been established and simulated. Also, temperature dependent buckling of polysilicon micro beam under high temperature has been modeled by Finite Element Analysis (FEA). Analytical results and numerical results using FEA are compared with experimental data available in literature. Their reasonable agreement validates analytical model and FEM. This validation indicates the importance of including temperature dependencies of polysilicon thermo-mechanical properties such as Coefficient of Thermal Expansion (CTE) in the previous models.


Parameter Identification of Pressure Sensors by Static and Dynamic Measurements

Abstract: Fast identification methods of pressure sensors are investigated. With regard to a complete accurate sensor parameter identification two different measurement methods are combined. The approach consists on one hand in performing static measurements - an applied pressure results in a membrane deformation measured interferometrically and the corresponding output voltage. On the other hand optical measurements of the modal responses of the sensor membranes are performed. This information is used in an inverse identification algorithm to identify geometrical and material parameters based on a FE model. The number of parameters to be identified is thereby generally limited only by the number of measurable modal frequencies. A quantitative evaluation of the identification results permits furthermore the classification of processing errors like etching errors. Algorithms and identification results for membrane thickness, intrinsic stress and output voltage will be discussed in this contribution on the basis of the parameter identification of relative pressure sensors.


New Horizontal Frustum Optical Waveguide Fabrication Using UV Proximity Printing

Abstract: This paper presents a novel method to fabricate the horizontal frustum structure as a planar optical waveguide by using the proximity printing technique. A horizontal frustum optical waveguide with a both lateral and vertical taper structure was produced. The orthogonal and inclined masks with the diffraction effect were employed in lithography process. This method can precisely control each horizontal frustum optical waveguide geometric profile in the fabrication process. The horizontal frustum optical waveguide and its array with the same inclined angle were generated. The beam propagation simulation software (BPM_CAD) was used to modeling the optical performance. The simulation results reveal that the mode profile matched into horizontal frustum optical waveguide and fiber from the laser diode. The optical loss of horizontal hemi-frustum structure of optical waveguides was less than 0.2dB. The horizontal hemifrustum waveguide will be used for fiber coupling on boards for further optical communication systems.


A Fully Parameterized Fem Model for Electromagnetic Optimization of an RF Mems Wafer Level Package

Abstract: In this work, we present a fully parameterized capped transmission line model for electromagnetic optimization of a wafer level package (WLP) for RF MEMS applications using the Ansoft HFSS-TM electromagnetic simulator. All the degrees of freedom (DoF's) in the package fabrication can be modified within the model in order to optimize for losses and mismatch (capacitive and inductive couplings) introduced by the cap affecting the MEMS RF behaviour. Ansoft HFSS-TM was also validated for the simulation of capped RF MEMS devices by comparison against experimental data. A test run of capped 50 transmission lines and shorts was fabricated and tested.


Development of a Nanostructual Microwave Probe Based on GaAs

Abstract: With the development of nanotechnology, the measurement of electrical properties in local area of materials and devices has become a great need. Although a lot kind of scanning probe microscope have been developed for satisfying the requirement of nanotechnology, a microscope technique which can determine electrical properties in local area of materials and devices is not yet developed. Recently, microwave microscope has been an interest to many researchers, due to its potential in the evaluation of electrical properties of materials and devices. The advance of microwave is that the response of materials is directly relative to the electromagnetic properties of materials. However, because of the problem of the structure of probes, nanometer-scale resolution has not been successful. To achieve the goal, a new structure microwave probe is required. In this paper, we report a nanostructural microwave probe. To restrain the attenuation of microwave in the probe, GaAs was used as the substrate of the probe. To obtain the desired structure, wet etching was used to fabricate the probe. Different with the dry etching, a side-etching will occur under the etching mask. Utilizing this property, a micro tip can be fabricated by etching a wafer, of which a small mask was introduced on the surface in advance.


Characterisation of an Electrostatic Vibration Harvester

Abstract: Harvesting energy from ambient vibration is proposed as an alternative to storage based power supplies for autonomous systems. The system presented converts the mechanical energy of a vibration into electrical energy by means of a variable capacitor, which is polarized by an electret. A lumped element model is used to study the generator and design a prototype. The device has been micromachined in silicon, based on a two-wafer process. The prototype was successfully tested, both using an external polarization source and an electret.


Surface Generation Analysis in Micro End-Milling Considering the Influences of Grain

Abstract: Micro end-milling method is a universal micro manufacturing method, which can be used to fabricating complex 3D structures and parts with many materials. But compared with their micrometer order size, their surface roughness quality is not satisfied. In this paper, the different metal phase grains influences are researched, and the micro end-milling process is described while the material is anisotropic. In this paper, the physical characteristics of different grains, especially friction coefficient and elastic module, are very critical to determine the chip formation process and surface generation. The chip is often discontinues because of the grain boundary effect. Through the micro end-milling experiment, the bottom surface results correlate very well with the theory analysis.


An Integrated Circuit Compatible Compact Package for Thermal Gas Flowmeters

Abstract: An original packaging method suitable for integrated thermal mass flow sensors is presented. The method consists in the application of a plastic transparent adapter to the chip surface. The adapter is sealed to the chip surface by means of a thermal procedure. By this approach it is possible to selectively convey the fluid flow to reduced chip areas, avoiding contact with the pads. Fabrication and testing of a very compact flow sensor is described.


A High Power Density Electrostatic Vibration-to-Electric Energy Converter Based On An In-Plane Overlap Plate (IPOP) Mechanism

Abstract: In this paper, design, fabrication and characterization issues of a bulk silicon-based, vibration powered, electric energy generator are addressed. The converter is based on an In-Plane Overlap Plate (IPOP) configuration [1]. Measurements have shown that with a theoretically lossless electronics and a starting voltage of 5 V, power density of 58 $\mu$W/cm3 is achievable at the resonance frequency of 290 Hz. It can be further improved by reducing the parasitic capacitance, which can be achieved by silicon etching, but a considerable mass is lost. In [2], it is shown that 19% of mass reduction improves power density from 12.95 $\mu$W/cm3 to 59 $\mu$W/cm3. Hence an enhancement in fabrication process is proposed, which is termed as Backside DRIE. It helps in increasing power density without loosing an important quantity of mass. Simulations have shown that 2.5% of mass removal improves power density up to 76.71 $\mu$W/cm3. Initial simulation results and problems of associated electronics are also discussed.