corpus_id
stringlengths 7
12
| paper_id
stringlengths 9
16
| title
stringlengths 1
261
| abstract
stringlengths 70
4.02k
| source
stringclasses 1
value | bibtex
stringlengths 208
20.9k
| citation_key
stringlengths 6
100
|
|---|---|---|---|---|---|---|
arxiv-1801 | 0711.2155 | Guarded Hybrid Knowledge Bases | <|reference_start|>Guarded Hybrid Knowledge Bases: Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web.We define guarded hybrid knowledge bases (or g-hybrid knowledge bases) as knowledge bases that consist of a Description Logic knowledge base and a guarded logic program, similar to the DL+log knowledge bases from (Rosati 2006). G-hybrid knowledge bases enable an integration of Description Logics and Logic Programming where, unlike in other approaches, variables in the rules of a guarded program do not need to appear in positive non-DL atoms of the body, i.e. DL atoms can act as guards as well. Decidability of satisfiability checking of g-hybrid knowledge bases is shown for the particular DL DLRO, which is close to OWL DL, by a reduction to guarded programs under the open answer set semantics. Moreover, we show 2-EXPTIME-completeness for satisfiability checking of such g-hybrid knowledge bases. Finally, we discuss advantages and disadvantages of our approach compared with DL+log knowledge bases.<|reference_end|> | arxiv | @article{heymans2007guarded,
title={Guarded Hybrid Knowledge Bases},
author={Stijn Heymans, Jos de Bruijn, Livia Predoiu, Cristina Feier, Davy Van
Nieuwenborgh},
journal={arXiv preprint arXiv:0711.2155},
year={2007},
archivePrefix={arXiv},
eprint={0711.2155},
primaryClass={cs.LO}
} | heymans2007guarded |
arxiv-1802 | 0711.2157 | On Approximating Multi-Criteria TSP | <|reference_start|>On Approximating Multi-Criteria TSP: We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP). For multi-criteria Max-STSP, where the edge weights have to be symmetric, we devise an algorithm with an approximation ratio of 2/3 - eps. For multi-criteria Max-ATSP, where the edge weights may be asymmetric, we present an algorithm with a ratio of 1/2 - eps. Our algorithms work for any fixed number k of objectives. Furthermore, we present a deterministic algorithm for bi-criteria Max-STSP that achieves an approximation ratio of 7/27. Finally, we present a randomized approximation algorithm for the asymmetric multi-criteria minimum TSP with triangle inequality Min-ATSP. This algorithm achieves a ratio of log n + eps.<|reference_end|> | arxiv | @article{manthey2007on,
title={On Approximating Multi-Criteria TSP},
author={Bodo Manthey},
journal={arXiv preprint arXiv:0711.2157},
year={2007},
archivePrefix={arXiv},
eprint={0711.2157},
primaryClass={cs.DS}
} | manthey2007on |
arxiv-1803 | 0711.2239 | Mise en place de sc\'enarios pour la conception d'outils en Chirurgie Minimalement Invasive | <|reference_start|>Mise en place de sc\'enarios pour la conception d'outils en Chirurgie Minimalement Invasive: Nowadays, more and more surgical interventions are carried out in Minimally Invasive Surgery, to make the post-operative constraints less painful for the patient. Actually, new surgical tools or medical products are designed after informal discussions between surgeons and designers. The user requirements documents are the main document used by the mechanical designers to design and improve the product. Medical terms, often used by surgeons and employed to explain their needs, don't allow for an instantaneous understanding by designers. Unfortunately, this relation causes a dysfunction in the definition cycle of the product. Our aim is to work on the design process, its assistance thanks to methods and tools and on its organisation for better understandings and more complementarities between surgeons and designers. We propose on this article a design method already tested in the informatics domain: User Centred Design which takes the user into account more effectively in the process design. We already propose a scenario oriented design method centred on the user and represented as a scenario (Scenario-Based Design). We start in this article by clarifying these concepts before detailing their implementation for the design of a new surgical tool.<|reference_end|> | arxiv | @article{thomann2007mise,
title={Mise en place de sc\'enarios pour la conception d'outils en Chirurgie
Minimalement Invasive},
author={Guillaume Thomann (LGS), Jean Caelen (LIG), Morgan Verdier (LGS),
Brigitte Meillon (LIG)},
journal={Les Syst\`emes de Production, Lavoisier (Ed.) (2007) 93-107},
year={2007},
archivePrefix={arXiv},
eprint={0711.2239},
primaryClass={cs.HC}
} | thomann2007mise |
arxiv-1804 | 0711.2270 | Can a Computer Laugh ? | <|reference_start|>Can a Computer Laugh ?: A computer model of "a sense of humour" suggested previously [arXiv:0711.2058,0711.2061], relating the humorous effect with a specific malfunction in information processing, is given in somewhat different exposition. Psychological aspects of humour are elaborated more thoroughly. The mechanism of laughter is formulated on the more general level. Detailed discussion is presented for the higher levels of information processing, which are responsible for a perception of complex samples of humour. Development of a sense of humour in the process of evolution is discussed.<|reference_end|> | arxiv | @article{suslov2007can,
title={Can a Computer Laugh ?},
author={I. M. Suslov (P.L.Kapitza Institute for Physical Problems, Moscow,
Russia)},
journal={Computer Chronicle (Moscow), 1994, issue 1, p.1},
year={2007},
archivePrefix={arXiv},
eprint={0711.2270},
primaryClass={cs.CL cs.AI q-bio.NC}
} | suslov2007can |
arxiv-1805 | 0711.2383 | Decoding the Golden Code: a VLSI design | <|reference_start|>Decoding the Golden Code: a VLSI design: The recently proposed Golden code is an optimal space-time block code for 2 X 2 multiple-input multiple-output (MIMO) systems. The aim of this work is the design of a VLSI decoder for a MIMO system coded with the Golden code. The architecture is based on a rearrangement of the sphere decoding algorithm that achieves maximum-likelihood (ML) decoding performance. Compared to other approaces, the proposed solution exhibits an inherent flexibility in terms of modulation schemes QAM modulation size and this makes our architecture particularly suitable for adaptive modulation schemes.<|reference_end|> | arxiv | @article{cerato2007decoding,
title={Decoding the Golden Code: a VLSI design},
author={Barbara Cerato, Guido Masera and Emanuele Viterbo},
journal={arXiv preprint arXiv:0711.2383},
year={2007},
archivePrefix={arXiv},
eprint={0711.2383},
primaryClass={cs.AR}
} | cerato2007decoding |
arxiv-1806 | 0711.2399 | Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio | <|reference_start|>Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio: The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of TSP tours, each of which approximates the optimal solution within at most a factor of 2. We consider the problem of finding among these tours the one that gives the closest approximation, i.e.\ the \emph{minimum-weight double-tree shortcutting}. Previously, we gave an efficient algorithm for this problem, and carried out its experimental analysis. In this paper, we address the related question of the worst-case approximation ratio for the minimum-weight double-tree shortcutting method. In particular, we give lower bounds on the approximation ratio in some specific metric spaces: the ratio of 2 in the discrete shortest path metric, 1.622 in the planar Euclidean metric, and 1.666 in the planar Minkowski metric. The first of these lower bounds is tight; we conjecture that the other two bounds are also tight, and in particular that the minimum-weight double-tree method provides a 1.622-approximation for planar Euclidean TSP.<|reference_end|> | arxiv | @article{deineko2007minimum-weight,
title={Minimum-weight double-tree shortcutting for Metric TSP: Bounding the
approximation ratio},
author={Vladimir Deineko and Alexander Tiskin},
journal={arXiv preprint arXiv:0711.2399},
year={2007},
archivePrefix={arXiv},
eprint={0711.2399},
primaryClass={cs.DS}
} | deineko2007minimum-weight |
arxiv-1807 | 0711.2442 | Are networks with more edges easier to synchronize? | <|reference_start|>Are networks with more edges easier to synchronize?: In this paper, the relationship between the network synchronizability and the edge distribution of its associated graph is investigated. First, it is shown that adding one edge to a cycle definitely decreases the network sychronizability. Then, since sometimes the synchronizability can be enhanced by changing the network structure, the question of whether the networks with more edges are easier to synchronize is addressed. It is shown by examples that the answer is negative. This reveals that generally there are redundant edges in a network, which not only make no contributions to synchronization but actually may reduce the synchronizability. Moreover, an example shows that the node betweenness centrality is not always a good indicator for the network synchronizability. Finally, some more examples are presented to illustrate how the network synchronizability varies following the addition of edges, where all the examples show that the network synchronizability globally increases but locally fluctuates as the number of added edges increases.<|reference_end|> | arxiv | @article{duan2007are,
title={Are networks with more edges easier to synchronize?},
author={Zhisheng Duan, Wenxu Wang, Chao Liu and Guanrong Chen},
journal={arXiv preprint arXiv:0711.2442},
year={2007},
archivePrefix={arXiv},
eprint={0711.2442},
primaryClass={cs.NI}
} | duan2007are |
arxiv-1808 | 0711.2444 | Proof nets for display logic | <|reference_start|>Proof nets for display logic: This paper explores several extensions of proof nets for the Lambek calculus in order to handle the different connectives of display logic in a natural way. The new proof net calculus handles some recent additions to the Lambek vocabulary such as Galois connections and Grishin interactions. It concludes with an exploration of the generative capacity of the Lambek-Grishin calculus, presenting an embedding of lexicalized tree adjoining grammars into the Lambek-Grishin calculus.<|reference_end|> | arxiv | @article{moot2007proof,
title={Proof nets for display logic},
author={Richard Moot (INRIA Futurs, Labri)},
journal={arXiv preprint arXiv:0711.2444},
year={2007},
archivePrefix={arXiv},
eprint={0711.2444},
primaryClass={cs.CL}
} | moot2007proof |
arxiv-1809 | 0711.2478 | A Compact Self-organizing Cellular Automata-based Genetic Algorithm | <|reference_start|>A Compact Self-organizing Cellular Automata-based Genetic Algorithm: A Genetic Algorithm (GA) is proposed in which each member of the population can change schemata only with its neighbors according to a rule. The rule methodology and the neighborhood structure employ elements from the Cellular Automata (CA) strategies. Each member of the GA population is assigned to a cell and crossover takes place only between adjacent cells, according to the predefined rule. Although combinations of CA and GA approaches have appeared previously, here we rely on the inherent self-organizing features of CA, rather than on parallelism. This conceptual shift directs us toward the evolution of compact populations containing only a handful of members. We find that the resulting algorithm can search the design space more efficiently than traditional GA strategies due to its ability to exploit mutations within this compact self-organizing population. Consequently, premature convergence is avoided and the final results often are more accurate. In order to reinforce the superior mutation capability, a re-initialization strategy also is implemented. Ten test functions and two benchmark structural engineering truss design problems are examined in order to demonstrate the performance of the method.<|reference_end|> | arxiv | @article{barmpoutis2007a,
title={A Compact Self-organizing Cellular Automata-based Genetic Algorithm},
author={Vasileios Barmpoutis, Gary F. Dargush},
journal={arXiv preprint arXiv:0711.2478},
year={2007},
archivePrefix={arXiv},
eprint={0711.2478},
primaryClass={cs.NE cs.AI}
} | barmpoutis2007a |
arxiv-1810 | 0711.2486 | An annotation based approach to support design communication | <|reference_start|>An annotation based approach to support design communication: The aim of this paper is to propose an approach based on the concept of annotation for supporting design communication. In this paper, we describe a co-operative design case study where we analyse some annotation practices, mainly focused on design minutes recorded during project reviews. We point out specific requirements concerning annotation needs. Based on these requirements, we propose an annotation model, inspired from the Speech Act Theory (SAT) to support communication in a 3D digital environment. We define two types of annotations in the engineering design context, locutionary and illocutionary annotations. The annotations we describe in this paper are materialised by a set of digital artefacts, which have a semantic dimension allowing express/record elements of technical justifications, traces of contradictory debates, etc. In this paper, we first clarify the semantic annotation concept, and we define general properties of annotations in the engineering design context, and the role of annotations in different design project situations. After the description of the case study, where we observe and analyse annotations usage during the design reviews and minute making, the last section is dedicated to present our approach. We then describe the SAT concept, and define the concept of annotation acts. We conclude with a description of basic annotation functionalities that are actually implemented in a software, based on our approach.<|reference_end|> | arxiv | @article{hisarciklilar2007an,
title={An annotation based approach to support design communication},
author={Onur Hisarciklilar (LGS), Jean-Franc{c}ois Boujut (LGS)},
journal={Dans Proceedings of ICED'07 - International Conference on
Engineering Design, Paris : France (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0711.2486},
primaryClass={cs.HC}
} | hisarciklilar2007an |
arxiv-1811 | 0711.2489 | Axiomatic structure of k-additive capacities | <|reference_start|>Axiomatic structure of k-additive capacities: In this paper we deal with the problem of axiomatizing the preference relations modelled through Choquet integral with respect to a $k$-additive capacity, i.e. whose M\"obius transform vanishes for subsets of more than $k$ elements. Thus, $k$-additive capacities range from probability measures ($k=1$) to general capacities ($k=n$). The axiomatization is done in several steps, starting from symmetric 2-additive capacities, a case related to the Gini index, and finishing with general $k$-additive capacities. We put an emphasis on 2-additive capacities. Our axiomatization is done in the framework of social welfare, and complete previous results of Weymark, Gilboa and Ben Porath, and Gajdos.<|reference_end|> | arxiv | @article{miranda2007axiomatic,
title={Axiomatic structure of k-additive capacities},
author={Pedro Miranda, Michel Grabisch (CES), Pedro Gil},
journal={Mathematical Social Sciences (2005) 153-178},
year={2007},
archivePrefix={arXiv},
eprint={0711.2489},
primaryClass={cs.DM}
} | miranda2007axiomatic |
arxiv-1812 | 0711.2490 | The M\"obius transform on symmetric ordered structures and its application to capacities on finite sets | <|reference_start|>The M\"obius transform on symmetric ordered structures and its application to capacities on finite sets: Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry necessarily entails non associativity, hence computing rules are defined in order to deal with non associativity. We study in details computing rules, which we endow with a partial order. This permits to find solutions to the inversion formula underlying the M\"obius transform. Then we apply these results to the case of capacities, a notion from decision theory which corresponds, in the language of ordered sets, to order preserving mappings, preserving also top and bottom. In this case, the solution of the inversion formula is called the M\"obius transform of the capacity. Properties and examples of M\"obius transform of sup-preserving and inf-preserving capacities are given.<|reference_end|> | arxiv | @article{grabisch2007the,
title={The M\"obius transform on symmetric ordered structures and its
application to capacities on finite sets},
author={Michel Grabisch (CES)},
journal={Discrete Mathematics (2004) 17-34},
year={2007},
archivePrefix={arXiv},
eprint={0711.2490},
primaryClass={cs.DM}
} | grabisch2007the |
arxiv-1813 | 0711.2501 | Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators | <|reference_start|>Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators: The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen's inequality as well as some other inequalities in the derivation, we demonstrate that an exponentially tight analysis can be carried out by assessing the relevant moments of a certain distance enumerator. The resulting bound has the following advantages: (i) it is at least as tight as Forney's bound, (ii) under certain symmetry conditions associated with the channel and the random coding distribution, it is simpler than Forney's bound in the sense that it involves an optimization over one parameter only (rather than two), and (iii) in certain special cases, like the binary symmetric channel (BSC), the optimum value of this parameter can be found in closed form, and so, there is no need to conduct a numerical search. We have not found yet, however, a numerical example where this new bound is strictly better than Forney's bound. This may provide an additional evidence to support Forney's conjecture that his bound is tight for the average code. We believe that the technique we suggest in this paper can be useful in simplifying, and hopefully also improving, exponential error bounds in other problem settings as well.<|reference_end|> | arxiv | @article{merhav2007error,
title={Error Exponents of Erasure/List Decoding Revisited via Moments of
Distance Enumerators},
author={Neri Merhav},
journal={arXiv preprint arXiv:0711.2501},
year={2007},
doi={10.1109/TIT.2008.929004},
archivePrefix={arXiv},
eprint={0711.2501},
primaryClass={cs.IT math.IT}
} | merhav2007error |
arxiv-1814 | 0711.2503 | Sparsity in time-frequency representations | <|reference_start|>Sparsity in time-frequency representations: We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an $S$-sparse Gabor representation in $\mathbb{C}^n$ with respect to a random unimodular window can be recovered by Basis Pursuit with high probability provided that $S\leq Cn/\log(n)$. Our results are applicable to the channel estimation problem in wireless communications and they establish the usefulness of a class of measurement matrices for compressive sensing.<|reference_end|> | arxiv | @article{pfander2007sparsity,
title={Sparsity in time-frequency representations},
author={Goetz E. Pfander, Holger Rauhut},
journal={arXiv preprint arXiv:0711.2503},
year={2007},
archivePrefix={arXiv},
eprint={0711.2503},
primaryClass={math.CA cs.IT math.IT}
} | pfander2007sparsity |
arxiv-1815 | 0711.2546 | Normalization of IZF with Replacement | <|reference_start|>Normalization of IZF with Replacement: ZF is a well investigated impredicative constructive version of Zermelo-Fraenkel set theory. Using set terms, we axiomatize IZF with Replacement, which we call \izfr, along with its intensional counterpart \iizfr. We define a typed lambda calculus $\li$ corresponding to proofs in \iizfr according to the Curry-Howard isomorphism principle. Using realizability for \iizfr, we show weak normalization of $\li$. We use normalization to prove the disjunction, numerical existence and term existence properties. An inner extensional model is used to show these properties, along with the set existence property, for full, extensional \izfr.<|reference_end|> | arxiv | @article{moczydlowski2007normalization,
title={Normalization of IZF with Replacement},
author={Wojciech Moczydlowski},
journal={Logical Methods in Computer Science, Volume 4, Issue 2 (April 8,
2008) lmcs:1235},
year={2007},
doi={10.2168/LMCS-4(2:1)2008},
archivePrefix={arXiv},
eprint={0711.2546},
primaryClass={cs.LO}
} | moczydlowski2007normalization |
arxiv-1816 | 0711.2547 | Interference Alignment on the Deterministic Channel and Application to Fully Connected AWGN Interference Networks | <|reference_start|>Interference Alignment on the Deterministic Channel and Application to Fully Connected AWGN Interference Networks: An interference alignment example is constructed for the deterministic channel model of the $K$ user interference channel. The deterministic channel example is then translated into the Gaussian setting, creating the first known example of a fully connected Gaussian $K$ user interference network with single antenna nodes, real, non-zero and contant channel coefficients, and no propagation delays where the degrees of freedom outerbound is achieved. An analogy is drawn between the propagation delay based interference alignment examples and the deterministic channel model which also allows similar constructions for the 2 user $X$ channel as well.<|reference_end|> | arxiv | @article{cadambe2007interference,
title={Interference Alignment on the Deterministic Channel and Application to
Fully Connected AWGN Interference Networks},
author={Viveck Cadambe, Syed A. Jafar, Shlomo Shamai (Shitz)},
journal={arXiv preprint arXiv:0711.2547},
year={2007},
archivePrefix={arXiv},
eprint={0711.2547},
primaryClass={cs.IT math.IT}
} | cadambe2007interference |
arxiv-1817 | 0711.2562 | Algorithmic Arithmetic Fewnomial Theory I: One Variable | <|reference_start|>Algorithmic Arithmetic Fewnomial Theory I: One Variable: Withdrawn by the authors due to an error in the proof of the finite field result (Thm. 1.5): The random primes used in the proof need NOT avoid the exceptional primes from Lemma 2.7, thus leaving Thm. 1.5 unproved.<|reference_end|> | arxiv | @article{ibrahim2007algorithmic,
title={Algorithmic Arithmetic Fewnomial Theory I: One Variable},
author={Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek},
journal={arXiv preprint arXiv:0711.2562},
year={2007},
archivePrefix={arXiv},
eprint={0711.2562},
primaryClass={math.NT cs.CC math.AG}
} | ibrahim2007algorithmic |
arxiv-1818 | 0711.2585 | Computing the Tutte polynomial in vertex-exponential time | <|reference_start|>Computing the Tutte polynomial in vertex-exponential time: The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating link in knot theory, and the partition functions of the models of Ising, Potts, and Fortuin--Kasteleyn in statistical physics. Prior to this work, deletion--contraction was also the fastest known general-purpose algorithm for these invariants, running in time roughly proportional to the number of spanning trees in the input graph. Here, we give a substantially faster algorithm that computes the Tutte polynomial--and hence, all the aforementioned invariants and more--of an arbitrary graph in time within a polynomial factor of the number of connected vertex sets. The algorithm actually evaluates a multivariate generalization of the Tutte polynomial by making use of an identity due to Fortuin and Kasteleyn. We also provide a polynomial-space variant of the algorithm and give an analogous result for Chung and Graham's cover polynomial. An implementation of the algorithm outperforms deletion--contraction also in practice.<|reference_end|> | arxiv | @article{björklund2007computing,
title={Computing the Tutte polynomial in vertex-exponential time},
author={Andreas Bj"orklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto},
journal={arXiv preprint arXiv:0711.2585},
year={2007},
archivePrefix={arXiv},
eprint={0711.2585},
primaryClass={cs.DS cond-mat.stat-mech math.CO}
} | björklund2007computing |
arxiv-1819 | 0711.2605 | Generalized D-Forms Have No Spurious Creases | <|reference_start|>Generalized D-Forms Have No Spurious Creases: A convex surface that is flat everywhere but on finitely many smooth curves (or "seams") and points is a seam form. We show that the only creases through the flat components of a seam form are either between vertices or tangent to the seams. As corollaries we resolve open problems about certain special seam forms: the flat components of a D-form have no creases at all, and the flat component of a pita-form has at most one crease, between the seam's endpoints.<|reference_end|> | arxiv | @article{price2007generalized,
title={Generalized D-Forms Have No Spurious Creases},
author={Gregory N. Price and Erik D. Demaine},
journal={arXiv preprint arXiv:0711.2605},
year={2007},
archivePrefix={arXiv},
eprint={0711.2605},
primaryClass={cs.CG}
} | price2007generalized |
arxiv-1820 | 0711.2615 | A Biologically Inspired Classifier | <|reference_start|>A Biologically Inspired Classifier: We present a method for measuring the distance among records based on the correlations of data stored in the corresponding database entries. The original method (F. Bagnoli, A. Berrones and F. Franci. Physica A 332 (2004) 509-518) was formulated in the context of opinion formation. The opinions expressed over a set of topic originate a ``knowledge network'' among individuals, where two individuals are nearer the more similar their expressed opinions are. Assuming that individuals' opinions are stored in a database, the authors show that it is possible to anticipate an opinion using the correlations in the database. This corresponds to approximating the overlap between the tastes of two individuals with the correlations of their expressed opinions. In this paper we extend this model to nonlinear matching functions, inspired by biological problems such as microarray (probe-sample pairing). We investigate numerically the error between the correlation and the overlap matrix for eight sequences of reference with random probes. Results show that this method is particularly robust for detecting similarities in the presence of translocations.<|reference_end|> | arxiv | @article{bagnoli2007a,
title={A Biologically Inspired Classifier},
author={Franco Bagnoli, Francesca Di Patti},
journal={arXiv preprint arXiv:0711.2615},
year={2007},
archivePrefix={arXiv},
eprint={0711.2615},
primaryClass={cs.DB cs.IR}
} | bagnoli2007a |
arxiv-1821 | 0711.2618 | A System for Distributed Mechanisms: Design, Implementation and Applications | <|reference_start|>A System for Distributed Mechanisms: Design, Implementation and Applications: We describe here a structured system for distributed mechanism design appropriate for both Intranet and Internet applications. In our approach the players dynamically form a network in which they know neither their neighbours nor the size of the network and interact to jointly take decisions. The only assumption concerning the underlying communication layer is that for each pair of processes there is a path of neighbours connecting them. This allows us to deal with arbitrary network topologies. We also discuss the implementation of this system which consists of a sequence of layers. The lower layers deal with the operations that implement the basic primitives of distributed computing, namely low level communication and distributed termination, while the upper layers use these primitives to implement high level communication among players, including broadcasting and multicasting, and distributed decision making. This yields a highly flexible distributed system whose specific applications are realized as instances of its top layer. This design is implemented in Java. The system supports at various levels fault-tolerance and includes a provision for distributed policing the purpose of which is to exclude `dishonest' players. Also, it can be used for repeated creation of dynamically formed networks of players interested in a joint decision making implemented by means of a tax-based mechanism. We illustrate its flexibility by discussing a number of implemented examples.<|reference_end|> | arxiv | @article{apt2007a,
title={A System for Distributed Mechanisms: Design, Implementation and
Applications},
author={Krzysztof R. Apt, Farhad Arbab, Huiye Ma},
journal={arXiv preprint arXiv:0711.2618},
year={2007},
archivePrefix={arXiv},
eprint={0711.2618},
primaryClass={cs.DC cs.GT}
} | apt2007a |
arxiv-1822 | 0711.2642 | Multiuser MIMO Achievable Rates with Downlink Training and Channel State Feedback | <|reference_start|>Multiuser MIMO Achievable Rates with Downlink Training and Channel State Feedback: We consider a MIMO fading broadcast channel and compute achievable ergodic rates when channel state information is acquired at the receivers via downlink training and it is provided to the transmitter by channel state feedback. Unquantized (analog) and quantized (digital) channel state feedback schemes are analyzed and compared under various assumptions. Digital feedback is shown to be potentially superior when the feedback channel uses per channel state coefficient is larger than 1. Also, we show that by proper design of the digital feedback link, errors in the feedback have a minor effect even if simple uncoded modulation is used on the feedback channel. We discuss first the case of an unfaded AWGN feedback channel with orthogonal access and then the case of fading MIMO multi-access (MIMO-MAC). We show that by exploiting the MIMO-MAC nature of the uplink channel, a much better scaling of the feedback channel resource with the number of base station antennas can be achieved. Finally, for the case of delayed feedback, we show that in the realistic case where the fading process has (normalized) maximum Doppler frequency shift 0 < F < 1/2, a fraction 1 - 2F of the optimal multiplexing gain is achievable. The general conclusion of this work is that very significant downlink throughput is achievable with simple and efficient channel state feedback, provided that the feedback link is properly designed.<|reference_end|> | arxiv | @article{caire2007multiuser,
title={Multiuser MIMO Achievable Rates with Downlink Training and Channel State
Feedback},
author={Giuseppe Caire, Nihar Jindal, Mari Kobayashi, Niranjay Ravindran},
journal={arXiv preprint arXiv:0711.2642},
year={2007},
doi={10.1109/TIT.2010.2046225},
archivePrefix={arXiv},
eprint={0711.2642},
primaryClass={cs.IT math.IT}
} | caire2007multiuser |
arxiv-1823 | 0711.2652 | An information-theoretic analog of a result of Perelman | <|reference_start|>An information-theoretic analog of a result of Perelman: Each compact manifold M of finite dimension k is differentiable and supports an intrinsic probability measure. There then exists a measurable transformation of M to the k-dimensional "surface" of the (k+1)-dimensional ball.<|reference_end|> | arxiv | @article{mcmillan2007an,
title={An information-theoretic analog of a result of Perelman},
author={Brockway McMillan},
journal={arXiv preprint arXiv:0711.2652},
year={2007},
archivePrefix={arXiv},
eprint={0711.2652},
primaryClass={math.DG cs.IT math.IT}
} | mcmillan2007an |
arxiv-1824 | 0711.2666 | The Generalized Asymptotic Equipartition Property: Necessary and Sufficient Conditions | <|reference_start|>The Generalized Asymptotic Equipartition Property: Necessary and Sufficient Conditions: Suppose a string $X_1^n=(X_1,X_2,...,X_n)$ generated by a memoryless source $(X_n)_{n\geq 1}$ with distribution $P$ is to be compressed with distortion no greater than $D\geq 0$, using a memoryless random codebook with distribution $Q$. The compression performance is determined by the ``generalized asymptotic equipartition property'' (AEP), which states that the probability of finding a $D$-close match between $X_1^n$ and any given codeword $Y_1^n$, is approximately $2^{-n R(P,Q,D)}$, where the rate function $R(P,Q,D)$ can be expressed as an infimum of relative entropies. The main purpose here is to remove various restrictive assumptions on the validity of this result that have appeared in the recent literature. Necessary and sufficient conditions for the generalized AEP are provided in the general setting of abstract alphabets and unbounded distortion measures. All possible distortion levels $D\geq 0$ are considered; the source $(X_n)_{n\geq 1}$ can be stationary and ergodic; and the codebook distribution can have memory. Moreover, the behavior of the matching probability is precisely characterized, even when the generalized AEP is not valid. Natural characterizations of the rate function $R(P,Q,D)$ are established under equally general conditions.<|reference_end|> | arxiv | @article{harrison2007the,
title={The Generalized Asymptotic Equipartition Property: Necessary and
Sufficient Conditions},
author={Matthew T. Harrison},
journal={IEEE Transactions on Information Theory, (2008) 54: 3211-3216},
year={2007},
doi={10.1109/TIT.2008.924668},
archivePrefix={arXiv},
eprint={0711.2666},
primaryClass={cs.IT math.IT}
} | harrison2007the |
arxiv-1825 | 0711.2671 | Combined Integer and Variable Precision (CIVP) Floating Point Multiplication Architecture for FPGAs | <|reference_start|>Combined Integer and Variable Precision (CIVP) Floating Point Multiplication Architecture for FPGAs: In this paper, we propose an architecture/methodology for making FPGAs suitable for integer as well as variable precision floating point multiplication. The proposed work will of great importance in applications which requires variable precision floating point multiplication such as multi-media processing applications. In the proposed architecture/methodology, we propose the replacement of existing 18x18 bit and 25x18 bit dedicated multipliers in FPGAs with dedicated 24x24 bit and 24x9 bit multipliers, respectively. We have proved that our approach of providing the dedicated 24x24 bit and 24x9 bit multipliers in FPGAs will make them efficient for performing integer as well as single precision, double precision, and Quadruple precision floating point multiplications.<|reference_end|> | arxiv | @article{thapliyal2007combined,
title={Combined Integer and Variable Precision (CIVP) Floating Point
Multiplication Architecture for FPGAs},
author={Himanshu Thapliyal, Hamid R. Arabnia, Rajnish Bajpai, Kamal K. Sharma},
journal={arXiv preprint arXiv:0711.2671},
year={2007},
archivePrefix={arXiv},
eprint={0711.2671},
primaryClass={cs.AR}
} | thapliyal2007combined |
arxiv-1826 | 0711.2674 | Partial Reversible Gates(PRG) for Reversible BCD Arithmetic | <|reference_start|>Partial Reversible Gates(PRG) for Reversible BCD Arithmetic: IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. Furthermore, in the recent years reversible logic has emerged as a promising computing paradigm having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. The major goal in reversible logic is to minimize the number of reversible gates and garbage outputs. Thus, this paper proposes the novel concept of partial reversible gates that will satisfy the reversibility criteria for specific cases in BCD arithmetic. The partial reversible gate is proposed to minimize the number of reversible gates and garbage outputs, while designing the reversible BCD arithmetic circuits.<|reference_end|> | arxiv | @article{thapliyal2007partial,
title={Partial Reversible Gates(PRG) for Reversible BCD Arithmetic},
author={Himanshu Thapliyal, Hamid R. Arabnia, Rajnish Bajpai, Kamal K. Sharma},
journal={arXiv preprint arXiv:0711.2674},
year={2007},
archivePrefix={arXiv},
eprint={0711.2674},
primaryClass={cs.AR}
} | thapliyal2007partial |
arxiv-1827 | 0711.2710 | Finding a Feasible Flow in a Strongly Connected Network | <|reference_start|>Finding a Feasible Flow in a Strongly Connected Network: We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the sum of demands and the minimum arc capacity is at least this sum. A fast algorithm for this problem improves the worst-case time bound of the Goldberg-Rao maximum flow method by a constant factor. Erlebach and Hagerup gave an linear-time feasible flow algorithm. We give an arguably simpler one.<|reference_end|> | arxiv | @article{haeupler2007finding,
title={Finding a Feasible Flow in a Strongly Connected Network},
author={Bernhard Haeupler and Robert E. Tarjan},
journal={arXiv preprint arXiv:0711.2710},
year={2007},
archivePrefix={arXiv},
eprint={0711.2710},
primaryClass={cs.DS}
} | haeupler2007finding |
arxiv-1828 | 0711.2712 | Parity Forwarding for Multiple-Relay Networks | <|reference_start|>Parity Forwarding for Multiple-Relay Networks: This paper proposes a relaying strategy for the multiple-relay network in which each relay decodes a selection of transmitted messages by other transmitting terminals, and forwards parities of the decoded codewords. This protocol improves the previously known achievable rate of the decode-and-forward (DF) strategy for multirelay networks by allowing relays to decode only a selection of messages from relays with strong links to it. Hence, each relay may have several choices as to which messages to decode, and for a given network many different parity forwarding protocols may exist. A tree structure is devised to characterize a class of parity forwarding protocols for an arbitrary multirelay network. Based on this tree structure, closed-form expressions for the achievable rates of these DF schemes are derived. It is shown that parity forwarding is capacity achieving for new forms of degraded relay networks.<|reference_end|> | arxiv | @article{razaghi2007parity,
title={Parity Forwarding for Multiple-Relay Networks},
author={P. Razaghi and W. Yu},
journal={arXiv preprint arXiv:0711.2712},
year={2007},
archivePrefix={arXiv},
eprint={0711.2712},
primaryClass={cs.IT math.IT}
} | razaghi2007parity |
arxiv-1829 | 0711.2745 | On Capacity Scaling in Arbitrary Wireless Networks | <|reference_start|>On Capacity Scaling in Arbitrary Wireless Networks: In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e., $n$ nodes are placed uniformly at random in a square region of area $n$). They showed that for small path-loss exponents $\alpha\in(2,3]$ cooperative communication is order optimal, and for large path-loss exponents $\alpha > 3$ multi-hop communication is order optimal. However, their results (both the communication scheme and the proof technique) are strongly dependent on the regularity induced with high probability by the random node placement. In this paper, we consider the problem of characterizing the throughput scaling in extended wireless networks with arbitrary node placement. As a main result, we propose a more general novel cooperative communication scheme that works for arbitrarily placed nodes. For small path-loss exponents $\alpha \in (2,3]$, we show that our scheme is order optimal for all node placements, and achieves exactly the same throughput scaling as in Ozgur et al. This shows that the regularity of the node placement does not affect the scaling of the achievable rates for $\alpha\in (2,3]$. The situation is, however, markedly different for large path-loss exponents $\alpha >3$. We show that in this regime the scaling of the achievable per-node rates depends crucially on the regularity of the node placement. We then present a family of schemes that smoothly "interpolate" between multi-hop and cooperative communication, depending upon the level of regularity in the node placement. We establish order optimality of these schemes under adversarial node placement for $\alpha > 3$.<|reference_end|> | arxiv | @article{niesen2007on,
title={On Capacity Scaling in Arbitrary Wireless Networks},
author={Urs Niesen, Piyush Gupta, Devavrat Shah},
journal={IEEE Transactions on Information Theory, vol. 55, pp. 3959-3982,
September 2009},
year={2007},
doi={10.1109/TIT.2009.2025537},
archivePrefix={arXiv},
eprint={0711.2745},
primaryClass={cs.IT math.IT}
} | niesen2007on |
arxiv-1830 | 0711.2749 | Diamond Solitaire | <|reference_start|>Diamond Solitaire: We investigate the game of peg solitaire on different board shapes, and find those of diamond or rhombus shape have interesting properties. When one peg captures many pegs consecutively, this is called a sweep. Rhombus boards of side 6 have the property that no matter which peg is missing at the start, the game can be solved to one peg using a maximal sweep of length 16. We show how to construct a solution on a rhombus board of side 6i, where the final move is a maximal sweep of length r, where r=(9i-1)(3i-1) is a "rhombic matchstick number".<|reference_end|> | arxiv | @article{bell2007diamond,
title={Diamond Solitaire},
author={George I. Bell},
journal={The Games and Puzzles Journal, Issue 41, September-October 2005
http://gpj.connectfree.co.uk/gpjw.htm},
year={2007},
archivePrefix={arXiv},
eprint={0711.2749},
primaryClass={math.CO cs.DM}
} | bell2007diamond |
arxiv-1831 | 0711.2760 | Computer Supported Collaborative Research | <|reference_start|>Computer Supported Collaborative Research: It is suggested that a new area of CSCR (Computer Supported Collaborative Research) is distinguished from CSCW (Computer Supported Collaborative Work) and CSCL (Computer Supported Collaborative Learning) and that the demarcation between the three areas could do with greater clarification and prescription. Although the areas of Human Computer Interaction (HCI), CSCW, and CSCL are now relatively well established, the related field of Computer Supported Collaborative Research (CSCR) is new and little understood. An analysis of the principles and issues behind CSCR is undertaken with a view to determining precisely its nature and scope and to delineate it clearly from CSCW and CSCL. This determination is such that it is generally applicable to the building, design and evaluation of collaborative research environments. A particular instance of the CSCR domain is then examined in order to determine the requirements of a collaborative research environment for students and supervisors (CRESS).<|reference_end|> | arxiv | @article{hinze-hoare2007computer,
title={Computer Supported Collaborative Research},
author={Vita Hinze-Hoare},
journal={arXiv preprint arXiv:0711.2760},
year={2007},
archivePrefix={arXiv},
eprint={0711.2760},
primaryClass={cs.HC}
} | hinze-hoare2007computer |
arxiv-1832 | 0711.2762 | Variations on Information Embedding in Multiple Access and Broadcast Channels | <|reference_start|>Variations on Information Embedding in Multiple Access and Broadcast Channels: Information embedding (IE) is the transmission of information within a host signal subject to a distortion constraint. There are two types of embedding methods, namely irreversible IE and reversible IE, depending upon whether or not the host, as well as the message, is recovered at the decoder. In irreversible IE, only the embedded message is recovered at the decoder, and in reversible IE, both the message and the host are recovered at the decoder. This paper considers combinations of irreversible and reversible IE in multiple access channels (MAC) and physically degraded broadcast channels (BC).<|reference_end|> | arxiv | @article{kotagiri2007variations,
title={Variations on Information Embedding in Multiple Access and Broadcast
Channels},
author={ShivaPrasad Kotagiri, J.Nicholas Laneman},
journal={arXiv preprint arXiv:0711.2762},
year={2007},
archivePrefix={arXiv},
eprint={0711.2762},
primaryClass={cs.IT math.IT}
} | kotagiri2007variations |
arxiv-1833 | 0711.2780 | Epcast: Controlled Dissemination in Human-based Wireless Networks by means of Epidemic Spreading Models | <|reference_start|>Epcast: Controlled Dissemination in Human-based Wireless Networks by means of Epidemic Spreading Models: Epidemics-inspired techniques have received huge attention in recent years from the distributed systems and networking communities. These algorithms and protocols rely on probabilistic message replication and redundancy to ensure reliable communication. Moreover, they have been successfully exploited to support group communication in distributed systems, broadcasting, multicasting and information dissemination in fixed and mobile networks. However, in most of the existing work, the probability of infection is determined heuristically, without relying on any analytical model. This often leads to unnecessarily high transmission overheads. In this paper we show that models of epidemic spreading in complex networks can be applied to the problem of tuning and controlling the dissemination of information in wireless ad hoc networks composed of devices carried by individuals, i.e., human-based networks. The novelty of our idea resides in the evaluation and exploitation of the structure of the underlying human network for the automatic tuning of the dissemination process in order to improve the protocol performance. We evaluate the results using synthetic mobility models and real human contacts traces.<|reference_end|> | arxiv | @article{scellato2007epcast:,
title={Epcast: Controlled Dissemination in Human-based Wireless Networks by
means of Epidemic Spreading Models},
author={Salvatore Scellato (Scuola Superiore di Catania), Cecilia Mascolo
(Department of Computer Science, University College London), Mirco Musolesi
(Department of Computer Science, Dartmouth College), Vito Latora
(Dipartimento di Fisica e Astronomia, Universita' di Catania)},
journal={arXiv preprint arXiv:0711.2780},
year={2007},
archivePrefix={arXiv},
eprint={0711.2780},
primaryClass={cs.NI}
} | scellato2007epcast: |
arxiv-1834 | 0711.2801 | Inverse Sampling for Nonasymptotic Sequential Estimation of Bounded Variable Means | <|reference_start|>Inverse Sampling for Nonasymptotic Sequential Estimation of Bounded Variable Means: In this paper, we consider the nonasymptotic sequential estimation of means of random variables bounded in between zero and one. We have rigorously demonstrated that, in order to guarantee prescribed relative precision and confidence level, it suffices to continue sampling until the sample sum is no less than a certain bound and then take the average of samples as an estimate for the mean of the bounded random variable. We have developed an explicit formula and a bisection search method for the determination of such bound of sample sum, without any knowledge of the bounded variable. Moreover, we have derived bounds for the distribution of sample size. In the special case of Bernoulli random variables, we have established analytical and numerical methods to further reduce the bound of sample sum and thus improve the efficiency of sampling. Furthermore, the fallacy of existing results are detected and analyzed.<|reference_end|> | arxiv | @article{chen2007inverse,
title={Inverse Sampling for Nonasymptotic Sequential Estimation of Bounded
Variable Means},
author={Xinjia Chen},
journal={arXiv preprint arXiv:0711.2801},
year={2007},
archivePrefix={arXiv},
eprint={0711.2801},
primaryClass={math.ST cs.LG math.PR stat.TH}
} | chen2007inverse |
arxiv-1835 | 0711.2811 | Une approche par les mod\`eles pour le suivi de l'activit\'e de construction d'un b\^atiment Bat'iViews : une interface multi-vues orient\'ee gestion de chantier | <|reference_start|>Une approche par les mod\`eles pour le suivi de l'activit\'e de construction d'un b\^atiment Bat'iViews : une interface multi-vues orient\'ee gestion de chantier: Cooperation between actors in design and construction activities in architecture is an essential stake nowadays. In professional practices the actors involved in construction projects use numerous tools. The project is unique but the "views" that actors manipulate are various and sometimes fundamentally different. Their common characteristic is that they partially represent the cooperation context through a specific point of view. "Bat'iViews" suggests to the actors a multi-view interface of the context and enables to navigate through the different views. This proposition is based on a model-driven approach. We distinguish between "context modelling" and modelling of concepts represented in each "businessview". A model integrative infrastructure allows us to develop the prototype and to manage user interaction through the definition of models' transformations.<|reference_end|> | arxiv | @article{halin2007une,
title={Une approche par les mod\`eles pour le suivi de l'activit\'e de
construction d'un b\^atiment. Bat'iViews : une interface multi-vues
orient\'ee gestion de chantier},
author={Gilles Halin (CRAI), Sylvain Kubicki (CRAI)},
journal={arXiv preprint arXiv:0711.2811},
year={2007},
archivePrefix={arXiv},
eprint={0711.2811},
primaryClass={cs.HC}
} | halin2007une |
arxiv-1836 | 0711.2824 | Degrees of Freedom of Wireless X Networks | <|reference_start|>Degrees of Freedom of Wireless X Networks: We explore the degrees of freedom of $M\times N$ user wireless $X$ networks, i.e. networks of $M$ transmitters and $N$ receivers where every transmitter has an independent message for every receiver. We derive a general outerbound on the degrees of freedom \emph{region} of these networks. When all nodes have a single antenna and all channel coefficients vary in time or frequency, we show that the \emph{total} number of degrees of freedom of the $X$ network is equal to $\frac{MN}{M+N-1}$ per orthogonal time and frequency dimension. Achievability is proved by constructing interference alignment schemes for $X$ networks that can come arbitrarily close to the outerbound on degrees of freedom. For the case where either M=2 or N=2 we find that the outerbound is exactly achievable. While $X$ networks have significant degrees of freedom benefits over interference networks when the number of users is small, our results show that as the number of users increases, this advantage disappears. Thus, for large $K$, the $K\times K$ user wireless $X$ network loses half the degrees of freedom relative to the $K\times K$ MIMO outerbound achievable through full cooperation. Interestingly, when there are few transmitters sending to many receivers ($N\gg M$) or many transmitters sending to few receivers ($M\gg N$), $X$ networks are able to approach the $\min(M,N)$ degrees of freedom possible with full cooperation on the $M\times N$ MIMO channel. Similar to the interference channel, we also construct an example of a 2 user $X$ channel with propagation delays where the outerbound on degrees of freedom is achieved through interference alignment based on a simple TDMA strategy.<|reference_end|> | arxiv | @article{cadambe2007degrees,
title={Degrees of Freedom of Wireless X Networks},
author={Viveck R. Cadambe, Syed A. Jafar},
journal={arXiv preprint arXiv:0711.2824},
year={2007},
archivePrefix={arXiv},
eprint={0711.2824},
primaryClass={cs.IT math.IT}
} | cadambe2007degrees |
arxiv-1837 | 0711.2832 | Premi\`ere \'etape vers une navigation r\'ef\'erentielle par l'image pour l'assistance \`a la conception des ambiances lumineuses | <|reference_start|>Premi\`ere \'etape vers une navigation r\'ef\'erentielle par l'image pour l'assistance \`a la conception des ambiances lumineuses: In the first design stage, image reference plays a double role of means of formulation and resolution of problems. In our approach, we consider image reference as a support of creation activity to generate ideas and we propose a tool for navigation in references by image in order to assist daylight ambience design. Within this paper, we present, in a first part, the semantic indexation method to be used for the indexation of our image database. In a second part we propose a synthetic analysis of various modes of referential navigation in order to propose a tool implementing all or a part of these modes.<|reference_end|> | arxiv | @article{chaabouni2007premi\`ere,
title={Premi\`ere \'etape vers une navigation r\'ef\'erentielle par l'image
pour l'assistance \`a la conception des ambiances lumineuses},
author={Salma Chaabouni (MAP / Crai), Jc Bignon (MAP / Crai), Gilles Halin
(MAP / Crai)},
journal={arXiv preprint arXiv:0711.2832},
year={2007},
archivePrefix={arXiv},
eprint={0711.2832},
primaryClass={cs.IR}
} | chaabouni2007premi\`ere |
arxiv-1838 | 0711.2835 | Faster Algorithms for Rigidity in the Plane | <|reference_start|>Faster Algorithms for Rigidity in the Plane: In [1], a new construction called red-black hierarchy characterizing Laman graphs and an algorithm for computing it were presented. For a Laman graph G=(V,E) with n vertices it runs in O(n^2) time assuming that a partition of (V,E+e) into two spanning trees is given. We show that a simple modification reduces the running time to O(n\log n). The total running time can be reduced O(n\sqrt{n\log n}) using the algorithm by Gabow and Westermann [2] for partitioning a graph into two forests. The existence of a red-black hierarchy is a necessary and sufficient condition for a graph to be a Laman graph. The algorithm for constructing a red-black hierarchy can be then modified to recognize Laman graphs in the same time.<|reference_end|> | arxiv | @article{bereg2007faster,
title={Faster Algorithms for Rigidity in the Plane},
author={Sergey Bereg},
journal={arXiv preprint arXiv:0711.2835},
year={2007},
archivePrefix={arXiv},
eprint={0711.2835},
primaryClass={cs.CG}
} | bereg2007faster |
arxiv-1839 | 0711.2842 | A new approach for scientific data dissemination in developing countries: a case of Indonesia | <|reference_start|>A new approach for scientific data dissemination in developing countries: a case of Indonesia: This short paper is intended as an additional progress report to share our experiences in Indonesia on collecting, integrating and disseminating both global and local scientific data across the country through the web technology. Our recent efforts are exerted on improving the local public access to global scientific data, and on the other hand encouraging the local scientific data to be more accessible for the global communities. We have maintained well-connected infrastructure and some web-based information management systems to realize such objectives. This paper is especially focused on introducing the ARSIP for mirroring global as well as sharing local scientific data, and the newly developed Indonesian Scientific Index for integrating local scientific data through an automated intelligent indexing system.<|reference_end|> | arxiv | @article{handoko2007a,
title={A new approach for scientific data dissemination in developing
countries: a case of Indonesia},
author={L.T. Handoko},
journal={Earth, Moon, and Planets 104 (2009) 331},
year={2007},
doi={10.1007/s11038-008-9283-6},
number={FISIKALIPI-07020},
archivePrefix={arXiv},
eprint={0711.2842},
primaryClass={cs.CY}
} | handoko2007a |
arxiv-1840 | 0711.2843 | Complexity of the conditional colorability of graphs | <|reference_start|>Complexity of the conditional colorability of graphs: For an integer $r>0$, a conditional $(k,r)$-coloring of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex $v$ of degree $d(v)$ in $G$ is adjacent to vertices with at least $min\{r, d(v)\}$ different colors. The smallest integer $k$ for which a graph $G$ has a conditional $(k,r)$-coloring is called the $r$th order conditional chromatic number, denoted by $\chi_r(G)$. It is easy to see that the conditional coloring is a generalization of the traditional vertex coloring for which $r=1$. In this paper, we consider the complexity of the conditional colorings of graphs. The main result is that the conditional $(3,2)$-colorability is $NP$-complete for triangle-free graphs with maximum degree at most 3, which is different from the old result that the traditional 3-colorability is polynomial solvable for graphs with maximum degree at most 3. This also implies that it is $NP$-complete to determine if a graph of maximum degree 3 is $(3,2)$- or $(4,2)$-colorable. Also we have proved that some old complexity results for traditional colorings still hold for the conditional colorings.<|reference_end|> | arxiv | @article{li2007complexity,
title={Complexity of the conditional colorability of graphs},
author={Xueliang Li, Xiangmei Yao, Wenli Zhou},
journal={arXiv preprint arXiv:0711.2843},
year={2007},
archivePrefix={arXiv},
eprint={0711.2843},
primaryClass={cs.DM cs.CC}
} | li2007complexity |
arxiv-1841 | 0711.2844 | Dynamic 3-Coloring of Claw-free Graphs | <|reference_start|>Dynamic 3-Coloring of Claw-free Graphs: A {\it dynamic $k$-coloring} of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex of degree at least 2 in $G$ will be adjacent to vertices with at least 2 different colors. The smallest number $k$ for which a graph $G$ can have a dynamic $k$-coloring is the {\it dynamic chromatic number}, denoted by $\chi_d(G)$. In this paper, we investigate the dynamic 3-colorings of claw-free graphs. First, we prove that it is $NP$-complete to determine if a claw-free graph with maximum degree 3 is dynamically 3-colorable. Second, by forbidding a kind of subgraphs, we find a reasonable subclass of claw-free graphs with maximum degree 3, for which the dynamically 3-colorable problem can be solved in linear time. Third, we give a linear time algorithm to recognize this subclass of graphs, and a linear time algorithm to determine whether it is dynamically 3-colorable. We also give a linear time algorithm to color the graphs in the subclass by 3 colors.<|reference_end|> | arxiv | @article{li2007dynamic,
title={Dynamic 3-Coloring of Claw-free Graphs},
author={Xueliang Li, Wenli Zhou},
journal={arXiv preprint arXiv:0711.2844},
year={2007},
archivePrefix={arXiv},
eprint={0711.2844},
primaryClass={cs.DM cs.CC}
} | li2007dynamic |
arxiv-1842 | 0711.2867 | Maximizing PageRank via outlinks | <|reference_start|>Maximizing PageRank via outlinks: We analyze linkage strategies for a set I of webpages for which the webmaster wants to maximize the sum of Google's PageRank scores. The webmaster can only choose the hyperlinks starting from the webpages of I and has no control on the hyperlinks from other webpages. We provide an optimal linkage strategy under some reasonable assumptions.<|reference_end|> | arxiv | @article{de kerchove2007maximizing,
title={Maximizing PageRank via outlinks},
author={Cristobald de Kerchove, Laure Ninove, Paul Van Dooren},
journal={arXiv preprint arXiv:0711.2867},
year={2007},
archivePrefix={arXiv},
eprint={0711.2867},
primaryClass={cs.IR math.RA}
} | de kerchove2007maximizing |
arxiv-1843 | 0711.2873 | Trellis Computations | <|reference_start|>Trellis Computations: For a certain class of functions, the distribution of the function values can be calculated in the trellis or a sub-trellis. The forward/backward recursion known from the BCJR algorithm is generalized to compute the moments of these distributions. In analogy to the symbol probabilities, by introducing a constraint at a certain depth in the trellis we obtain symbol moments. These moments are required for an efficient implementation of the discriminated belief propagation algorithm in [2], and can furthermore be utilized to compute conditional entropies in the trellis. The moment computation algorithm has the same asymptotic complexity as the BCJR algorithm. It is applicable to any commutative semi-ring, thus actually providing a generalization of the Viterbi algorithm.<|reference_end|> | arxiv | @article{heim2007trellis,
title={Trellis Computations},
author={Axel Heim, Vladimir Sidorenko, Uli Sorger},
journal={arXiv preprint arXiv:0711.2873},
year={2007},
archivePrefix={arXiv},
eprint={0711.2873},
primaryClass={cs.IT math.IT}
} | heim2007trellis |
arxiv-1844 | 0711.2895 | Cryptography from Noisy Storage | <|reference_start|>Cryptography from Noisy Storage: We show how to implement cryptographic primitives based on the realistic assumption that quantum storage of qubits is noisy. We thereby consider individual-storage attacks, i.e. the dishonest party attempts to store each incoming qubit separately. Our model is similar to the model of bounded-quantum storage, however, we consider an explicit noise model inspired by present-day technology. To illustrate the power of this new model, we show that a protocol for oblivious transfer (OT) is secure for any amount of quantum-storage noise, as long as honest players can perform perfect quantum operations. Our model also allows the security of protocols that cope with noise in the operations of the honest players and achieve more advanced tasks such as secure identification.<|reference_end|> | arxiv | @article{wehner2007cryptography,
title={Cryptography from Noisy Storage},
author={Stephanie Wehner, Christian Schaffner, Barbara Terhal},
journal={Phys. Rev. Lett. 100, 220502 (2008)},
year={2007},
doi={10.1103/PhysRevLett.100.220502},
archivePrefix={arXiv},
eprint={0711.2895},
primaryClass={quant-ph cs.CR}
} | wehner2007cryptography |
arxiv-1845 | 0711.2897 | Estimation of fuzzy anomalies in Water Distribution Systems | <|reference_start|>Estimation of fuzzy anomalies in Water Distribution Systems: State estimation is necessary in diagnosing anomalies in Water Demand Systems (WDS). In this paper we present a neural network performing such a task. State estimation is performed by using optimization, which tries to reconcile all the available information. Quantification of the uncertainty of the input data (telemetry measures and demand predictions) can be achieved by means of robust estate estimation. Using a mathematical model of the network, fuzzy estimated states for anomalous states of the network can be obtained. They are used to train a neural network capable of assessing WDS anomalies associated with particular sets of measurements.<|reference_end|> | arxiv | @article{izquierdo2007estimation,
title={Estimation of fuzzy anomalies in Water Distribution Systems},
author={J. Izquierdo, M.M. Tung, R. Perez, F. J. Martinez},
journal={Progress in Industrial Mathematics at ECMI 2006 (edited by L. L.
Bonilla, M. A. Moscoso, G. Platero, and J. M. Vega), vol. 12 of Mathematics
in Industry, pp. 801-805 (Springer, Berlin, 2007), ISBN 978-3-540-71991-5},
year={2007},
archivePrefix={arXiv},
eprint={0711.2897},
primaryClass={cs.NE}
} | izquierdo2007estimation |
arxiv-1846 | 0711.2909 | Comparing the notions of optimality in CP-nets, strategic games and soft constraints | <|reference_start|>Comparing the notions of optimality in CP-nets, strategic games and soft constraints: The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of three formalisms used for different purposes in reasoning about multi-agent systems: strategic games, CP-nets, and soft constraints. To relate the notions of optimality in these formalisms we introduce a natural qualitative modification of the notion of a strategic game. We show then that the optimal outcomes of a CP-net are exactly the Nash equilibria of such games. This allows us to use the techniques of game theory to search for optimal outcomes of CP-nets and vice-versa, to use techniques developed for CP-nets to search for Nash equilibria of the considered games. Then, we relate the notion of optimality used in the area of soft constraints to that used in a generalization of strategic games, called graphical games. In particular we prove that for a natural class of soft constraints that includes weighted constraints every optimal solution is both a Nash equilibrium and Pareto efficient joint strategy. For a natural mapping in the other direction we show that Pareto efficient joint strategies coincide with the optimal solutions of soft constraints.<|reference_end|> | arxiv | @article{apt2007comparing,
title={Comparing the notions of optimality in CP-nets, strategic games and soft
constraints},
author={Krzysztof R. Apt, Francesca Rossi, Kristen Brent Venable},
journal={arXiv preprint arXiv:0711.2909},
year={2007},
archivePrefix={arXiv},
eprint={0711.2909},
primaryClass={cs.AI cs.GT}
} | apt2007comparing |
arxiv-1847 | 0711.2914 | Image Classification Using SVMs: One-against-One Vs One-against-All | <|reference_start|>Image Classification Using SVMs: One-against-One Vs One-against-All: Support Vector Machines (SVMs) are a relatively new supervised classification technique to the land cover mapping community. They have their roots in Statistical Learning Theory and have gained prominence because they are robust, accurate and are effective even when using a small training sample. By their nature SVMs are essentially binary classifiers, however, they can be adopted to handle the multiple classification tasks common in remote sensing studies. The two approaches commonly used are the One-Against-One (1A1) and One-Against-All (1AA) techniques. In this paper, these approaches are evaluated in as far as their impact and implication for land cover mapping. The main finding from this research is that whereas the 1AA technique is more predisposed to yielding unclassified and mixed pixels, the resulting classification accuracy is not significantly different from 1A1 approach. It is the authors conclusion therefore that ultimately the choice of technique adopted boils down to personal preference and the uniqueness of the dataset at hand.<|reference_end|> | arxiv | @article{anthony2007image,
title={Image Classification Using SVMs: One-against-One Vs One-against-All},
author={Gidudu Anthony, Hulley Gregg and Marwala Tshilidzi},
journal={arXiv preprint arXiv:0711.2914},
year={2007},
archivePrefix={arXiv},
eprint={0711.2914},
primaryClass={cs.LG cs.AI cs.CV}
} | anthony2007image |
arxiv-1848 | 0711.2917 | Use of Wikipedia Categories in Entity Ranking | <|reference_start|>Use of Wikipedia Categories in Entity Ranking: Wikipedia is a useful source of knowledge that has many applications in language processing and knowledge representation. The Wikipedia category graph can be compared with the class hierarchy in an ontology; it has some characteristics in common as well as some differences. In this paper, we present our approach for answering entity ranking queries from the Wikipedia. In particular, we explore how to make use of Wikipedia categories to improve entity ranking effectiveness. Our experiments show that using categories of example entities works significantly better than using loosely defined target categories.<|reference_end|> | arxiv | @article{thom2007use,
title={Use of Wikipedia Categories in Entity Ranking},
author={James A. Thom (RMIT), Jovan Pehcevski (INRIA Rocquencourt / INRIA
Sophia Antipolis), Anne-Marie Vercoustre (INRIA Rocquencourt / INRIA Sophia
Antipolis)},
journal={Dans The 12th Australasian Document Computing Symposium (ADCS'07)
(2007)},
year={2007},
archivePrefix={arXiv},
eprint={0711.2917},
primaryClass={cs.IR}
} | thom2007use |
arxiv-1849 | 0711.2961 | Recognizing Members of the Tournament Equilibrium Set is NP-hard | <|reference_start|>Recognizing Members of the Tournament Equilibrium Set is NP-hard: A recurring theme in the mathematical social sciences is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's tournament equilibrium set (TEQ) ranks among the most intriguing, but also among the most enigmatic, tournament solutions that have been proposed so far in this context. Due to its unwieldy recursive definition, little is known about TEQ. In particular, its monotonicity remains an open problem up to date. Yet, if TEQ were to satisfy monotonicity, it would be a very attractive tournament solution concept refining both the Banks set and Dutta's minimal covering set. We show that the problem of deciding whether a given alternative is contained in TEQ is NP-hard.<|reference_end|> | arxiv | @article{brandt2007recognizing,
title={Recognizing Members of the Tournament Equilibrium Set is NP-hard},
author={Felix Brandt, Felix Fischer, Paul Harrenstein},
journal={Social Choice and Welfare 34(4), 2009},
year={2007},
doi={10.1007/s00355-009-0419-z},
archivePrefix={arXiv},
eprint={0711.2961},
primaryClass={cs.CC cs.GT cs.MA}
} | brandt2007recognizing |
arxiv-1850 | 0711.2971 | IT services design to support coordination practices in the Luxembourguish AEC sector | <|reference_start|>IT services design to support coordination practices in the Luxembourguish AEC sector: In the Architecture Engineering and Construction sector (AEC) cooperation between actors is essential for project success. The configuration of actors' organization takes different forms like the associated coordination mechanisms. Our approach consists in analyzing these coordination mechanisms through the identification of the "base practices" realized by the actors of a construction project to cooperate. We also try with practitioners to highlight the "best practices" of cooperation. Then we suggest here two prototypes of IT services aiming to demonstrate the value added of IT to support cooperation. These prototype tools allow us to sensitize the actors through terrain experiments and then to bring inch by inch the Luxembourgish AEC sector towards electronic cooperation.<|reference_end|> | arxiv | @article{kubicki2007it,
title={IT services design to support coordination practices in the
Luxembourguish AEC sector},
author={Sylvain Kubicki (MAP / CRAI), Annie Guerri'ero (MAP / CRAI), Damien
Hanser (MAP / CRAI), Gilles Halin (MAP / CRAI)},
journal={arXiv preprint arXiv:0711.2971},
year={2007},
archivePrefix={arXiv},
eprint={0711.2971},
primaryClass={cs.HC}
} | kubicki2007it |
arxiv-1851 | 0711.2998 | Optimizing diversity | <|reference_start|>Optimizing diversity: We consider the problem of minimizing the size of a family of sets G such that every subset of 1,...,n can be written as a disjoint union of at most k members of G, where k and n are given numbers. This problem originates in a real-world application aiming at the diversity of industrial production. At the same time, the minimum of G so that every subset of 1,...,n is the union of two sets in G has been asked by Erdos and studied recently by Furedi and Katona without requiring the disjointness of the sets. A simple construction providing a feasible solution is conjectured to be optimal for this problem for all values of n and k and regardless of the disjointness requirement; we prove this conjecture in special cases including all (n,k) for which n <= 3k holds, and some individual values of n and k.<|reference_end|> | arxiv | @article{frein2007optimizing,
title={Optimizing diversity},
author={Yannick Frein (LGS), Benjamin L'ev^eque (LGS), Andras Sebo (LGS)},
journal={arXiv preprint arXiv:0711.2998},
year={2007},
archivePrefix={arXiv},
eprint={0711.2998},
primaryClass={cs.DM}
} | frein2007optimizing |
arxiv-1852 | 0711.3013 | Natural realizations of sparsity matroids | <|reference_start|>Natural realizations of sparsity matroids: A hypergraph G with n vertices and m hyperedges with d endpoints each is (k,l)-sparse if for all sub-hypergraphs G' on n' vertices and m' edges, m'\le kn'-l. For integers k and l satisfying 0\le l\le dk-1, this is known to be a linearly representable matroidal family. Motivated by problems in rigidity theory, we give a new linear representation theorem for the (k,l)-sparse hypergraphs that is natural; i.e., the representing matrix captures the vertex-edge incidence structure of the underlying hypergraph G.<|reference_end|> | arxiv | @article{streinu2007natural,
title={Natural realizations of sparsity matroids},
author={Ileana Streinu and Louis Theran},
journal={arXiv preprint arXiv:0711.3013},
year={2007},
archivePrefix={arXiv},
eprint={0711.3013},
primaryClass={math.CO cs.CG math.AG math.MG}
} | streinu2007natural |
arxiv-1853 | 0711.3077 | On Low Complexity Maximum Likelihood Decoding of Convolutional Codes | <|reference_start|>On Low Complexity Maximum Likelihood Decoding of Convolutional Codes: This paper considers the average complexity of maximum likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path taken through a Markov graph. Integrated with the Viterbi algorithm (VA), complexity reduction methods such as the sphere decoder often use the sum log likelihood (SLL) of a Markov path as a bound to disprove the optimality of other Markov path sets and to consequently avoid exhaustive path search. In this paper, it is shown that SLL-based optimality tests are inefficient if one fixes the coding memory and takes the codeword length to infinity. Alternatively, optimality of a source symbol at a given time index can be testified using bounds derived from log likelihoods of the neighboring symbols. It is demonstrated that such neighboring log likelihood (NLL)-based optimality tests, whose efficiency does not depend on the codeword length, can bring significant complexity reduction to ML decoding of convolutional codes. The results are generalized to ML sequence detection in a class of discrete-time hidden Markov systems.<|reference_end|> | arxiv | @article{luo2007on,
title={On Low Complexity Maximum Likelihood Decoding of Convolutional Codes},
author={Jie Luo},
journal={arXiv preprint arXiv:0711.3077},
year={2007},
doi={10.1109/TIT.2008.2006461},
archivePrefix={arXiv},
eprint={0711.3077},
primaryClass={cs.IT cs.CC math.IT}
} | luo2007on |
arxiv-1854 | 0711.3099 | Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks | <|reference_start|>Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks: In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficiently with networks of more than a few hundred nodes. In this paper, we propose an augmented tree-based address space structure and a hierarchical multi-path routing protocol, referred to as Augmented Tree-based Routing (ATR), which utilizes such a structure in order to solve the scalability problem and to gain good resilience against node failure/mobility and link congestion/instability. Simulation results and performance comparisons with existing protocols substantiate the effectiveness of the ATR.<|reference_end|> | arxiv | @article{caleffi2007augmented,
title={Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks},
author={Marcello Caleffi, Giancarlo Ferraiuolo, Luigi Paura},
journal={IEEE MHWMN'07: The Third IEEE International Workshop on
Heterogeneous Multi-Hop Wireless and Mobile Networks 2007},
year={2007},
doi={10.1109/MOBHOC.2007.4428727},
archivePrefix={arXiv},
eprint={0711.3099},
primaryClass={cs.NI}
} | caleffi2007augmented |
arxiv-1855 | 0711.3128 | Entity Ranking in Wikipedia | <|reference_start|>Entity Ranking in Wikipedia: The traditional entity extraction problem lies in the ability of extracting named entities from plain text using natural language processing techniques and intensive training from large document collections. Examples of named entities include organisations, people, locations, or dates. There are many research activities involving named entities; we are interested in entity ranking in the field of information retrieval. In this paper, we describe our approach to identifying and ranking entities from the INEX Wikipedia document collection. Wikipedia offers a number of interesting features for entity identification and ranking that we first introduce. We then describe the principles and the architecture of our entity ranking system, and introduce our methodology for evaluation. Our preliminary results show that the use of categories and the link structure of Wikipedia, together with entity examples, can significantly improve retrieval effectiveness.<|reference_end|> | arxiv | @article{vercoustre2007entity,
title={Entity Ranking in Wikipedia},
author={Anne-Marie Vercoustre (INRIA Rocquencourt / INRIA Sophia Antipolis),
James A. Thom (RMIT), Jovan Pehcevski (INRIA Rocquencourt / INRIA Sophia
Antipolis)},
journal={Dans the 23rd Annual ACM Symposium on Applied Computing (2008)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3128},
primaryClass={cs.IR}
} | vercoustre2007entity |
arxiv-1856 | 0711.3149 | Approche polyedrale pour le probleme du separateur (VSP) | <|reference_start|>Approche polyedrale pour le probleme du separateur (VSP): In an undirected connected graph G=(V,E), the vertex separator problem (VSP) asks for a partition of V into nonempty subsets A, B, C such that |C| is minimized such that there is no edge between A and B, and sizes of A and B are similar. This paper presents a polyhedral approach of the (VSP), introducing new efficient valid inequalities and providing computational tests and results.<|reference_end|> | arxiv | @article{meurs2007approche,
title={Approche polyedrale pour le probleme du separateur (VSP)},
author={Marie-Jean Meurs},
journal={arXiv preprint arXiv:0711.3149},
year={2007},
archivePrefix={arXiv},
eprint={0711.3149},
primaryClass={cs.DM}
} | meurs2007approche |
arxiv-1857 | 0711.3152 | Multipath Channels of Bounded Capacity | <|reference_start|>Multipath Channels of Bounded Capacity: The capacity of discrete-time, non-coherent, multipath fading channels is considered. It is shown that if the delay spread is large in the sense that the variances of the path gains do not decay faster than geometrically, then capacity is bounded in the signal-to-noise ratio.<|reference_end|> | arxiv | @article{koch2007multipath,
title={Multipath Channels of Bounded Capacity},
author={Tobias Koch, Amos Lapidoth},
journal={arXiv preprint arXiv:0711.3152},
year={2007},
doi={10.1109/ITW.2008.4578611},
archivePrefix={arXiv},
eprint={0711.3152},
primaryClass={cs.IT math.IT}
} | koch2007multipath |
arxiv-1858 | 0711.3176 | To Decode the Interference or To Consider it as Noise | <|reference_start|>To Decode the Interference or To Consider it as Noise: We address single-user data transmission over a channel where the received signal incurs interference from a finite number of users (interfering users) that use single codebooks for transmitting their own messages. The receiver, however, is allowed to decode interfering users' messages. This means the signal transmitted from any interfering user is either decoded or considered as noise at the receiver side. We propose the following method to obtain an achievable rate for this channel. Assuming its own data is decoded successfully, the receiver partitions the set of interfering users into two disjoint subsets, namely the set of decodable users and the set of non-decodable users. Then the transmitter's rate is chosen such that the intended signal can be jointly decoded with the set of decodable users. To show the strength of this method, we prove that for the additive Gaussian channel with Gaussian interfering users, the Gaussian distribution is optimal and the achievable rate is the capacity of this channel. To obtain the maximum achievable rate, one needs to find the maximum decodable subset of interfering users. Due to the large number of possible choices, having efficient algorithms that find the set of decodable users with maximum cardinality is desired. To this end, we propose an algorithm that enables the receiver to accomplish this task in polynomial time.<|reference_end|> | arxiv | @article{motahari2007to,
title={To Decode the Interference or To Consider it as Noise},
author={Abolfazl S. Motahari and Amir K. Khandani},
journal={arXiv preprint arXiv:0711.3176},
year={2007},
archivePrefix={arXiv},
eprint={0711.3176},
primaryClass={cs.IT math.IT}
} | motahari2007to |
arxiv-1859 | 0711.3183 | Detecting palindromes, patterns, and borders in regular languages | <|reference_start|>Detecting palindromes, patterns, and borders in regular languages: Given a language L and a nondeterministic finite automaton M, we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given that M accepts at least one word in L, we consider how long a shortest word can be. The languages L that we examine include the palindromes, the non-palindromes, the k-powers, the non-k-powers, the powers, the non-powers (also called primitive words), the words matching a general pattern, the bordered words, and the unbordered words.<|reference_end|> | arxiv | @article{anderson2007detecting,
title={Detecting palindromes, patterns, and borders in regular languages},
author={Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey
Shallit},
journal={arXiv preprint arXiv:0711.3183},
year={2007},
archivePrefix={arXiv},
eprint={0711.3183},
primaryClass={cs.CC cs.DM cs.FL}
} | anderson2007detecting |
arxiv-1860 | 0711.3197 | How to realize "a sense of humour" in computers ? | <|reference_start|>How to realize "a sense of humour" in computers ?: Computer model of a "sense of humour" suggested previously [arXiv:0711.2058, 0711.2061, 0711.2270] is raised to the level of a realistic algorithm.<|reference_end|> | arxiv | @article{suslov2007how,
title={How to realize "a sense of humour" in computers ?},
author={I. M. Suslov (P.L.Kapitza Institute for Physical Problems, Moscow,
Russia)},
journal={arXiv preprint arXiv:0711.3197},
year={2007},
archivePrefix={arXiv},
eprint={0711.3197},
primaryClass={cs.CL cs.AI q-bio.NC}
} | suslov2007how |
arxiv-1861 | 0711.3205 | Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission | <|reference_start|>Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission: This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Optimal relay subset selection with the objective of maximizing the overall throughput is a difficult problem that depends on multiple factors including node locations, queue lengths and power consumption. A partial decode-and-forward strategy is applied in this paper to improve the tractability of the relay selection problem and performance of the overall network. Note that the number of relays selected ultimately determines the performance of the network. This paper benchmarks this performance by determining the net diversity achieved using the relays selected and the partial decode-and-forward strategy. This framework is subsequently used to further transform relay selection into a simpler relay placement problem, and two proximity-based approximation algorithms are developed to determine the appropriate set of relays to be selected in the network. Other selection strategies such as random relay selection and a greedy algorithm that relies on channel state information are also presented. This paper concludes by showing that the proposed proximity-based relay selection strategies yield near-optimal expected rates for a small number of selected relays.<|reference_end|> | arxiv | @article{lo2007relay,
title={Relay Subset Selection in Wireless Networks Using Partial
Decode-and-Forward Transmission},
author={Caleb K. Lo, Sriram Vishwanath and Robert W. Heath Jr},
journal={arXiv preprint arXiv:0711.3205},
year={2007},
archivePrefix={arXiv},
eprint={0711.3205},
primaryClass={cs.IT math.IT}
} | lo2007relay |
arxiv-1862 | 0711.3235 | A Game-Theoretic Analysis of Updating Sets of Probabilities | <|reference_start|>A Game-Theoretic Analysis of Updating Sets of Probabilities: We consider how an agent should update her uncertainty when it is represented by a set $\P$ of probability distributions and the agent observes that a random variable $X$ takes on value $x$, given that the agent makes decisions using the minimax criterion, perhaps the best-studied and most commonly-used criterion in the literature. We adopt a game-theoretic framework, where the agent plays against a bookie, who chooses some distribution from $\P$. We consider two reasonable games that differ in what the bookie knows when he makes his choice. Anomalies that have been observed before, like time inconsistency, can be understood as arising important because different games are being played, against bookies with different information. We characterize the important special cases in which the optimal decision rules according to the minimax criterion amount to either conditioning or simply ignoring the information. Finally, we consider the relationship between conditioning and calibration when uncertainty is described by sets of probabilities.<|reference_end|> | arxiv | @article{grunwald2007a,
title={A Game-Theoretic Analysis of Updating Sets of Probabilities},
author={Peter D. Grunwald and Joseph Y. Halpern},
journal={arXiv preprint arXiv:0711.3235},
year={2007},
archivePrefix={arXiv},
eprint={0711.3235},
primaryClass={cs.AI math.ST stat.TH}
} | grunwald2007a |
arxiv-1863 | 0711.3242 | On the Centroids of Symmetrized Bregman Divergences | <|reference_start|>On the Centroids of Symmetrized Bregman Divergences: In this paper, we generalize the notions of centroids and barycenters to the broad class of information-theoretic distortion measures called Bregman divergences. Bregman divergences are versatile, and unify quadratic geometric distances with various statistical entropic measures. Because Bregman divergences are typically asymmetric, we consider both the left-sided and right-sided centroids and the symmetrized centroids, and prove that all three are unique. We give closed-form solutions for the sided centroids that are generalized means, and design a provably fast and efficient approximation algorithm for the symmetrized centroid based on its exact geometric characterization that requires solely to walk on the geodesic linking the two sided centroids. We report on our generic implementation for computing entropic centers of image clusters and entropic centers of multivariate normals, and compare our results with former ad-hoc methods.<|reference_end|> | arxiv | @article{nielsen2007on,
title={On the Centroids of Symmetrized Bregman Divergences},
author={Frank Nielsen, Richard Nock},
journal={arXiv preprint arXiv:0711.3242},
year={2007},
archivePrefix={arXiv},
eprint={0711.3242},
primaryClass={cs.CG}
} | nielsen2007on |
arxiv-1864 | 0711.3247 | A Distributed Dynamic Frequency Allocation Algorithm | <|reference_start|>A Distributed Dynamic Frequency Allocation Algorithm: We consider a network model where the nodes are grouped into a number of clusters and propose a distributed dynamic frequency allocation algorithm that achieves performance close to that of a centralized optimal algorithm. Each cluster chooses its transmission frequency band based on its knowledge of the interference that it experiences. The convergence of the proposed distributed algorithm to a sub-optimal frequency allocation pattern is proved. For some specific cases of spatial distributions of the clusters in the network, asymptotic bounds on the performance of the algorithm are derived and comparisons to the performance of optimal centralized solutions are made. These analytic results and additional simulation studies verify performance close to that of an optimum centralized frequency allocation algorithm. It is demonstrated that the algorithm achieves about 90% of the Shannon capacities corresponding to the optimum/near-optimum centralized frequency band assignments. Furthermore, we consider the scenario where each cluster can be in active or inactive mode according to a two-state Markov model. We derive conditions to guarantee finite steady state variance for the output of the algorithm using stochastic analysis. Further simulation studies confirm the results of stochastic modeling and the performance of the algorithm in the time-varying setup.<|reference_end|> | arxiv | @article{babadi2007a,
title={A Distributed Dynamic Frequency Allocation Algorithm},
author={Behtash Babadi, Vahid Tarokh},
journal={arXiv preprint arXiv:0711.3247},
year={2007},
archivePrefix={arXiv},
eprint={0711.3247},
primaryClass={cs.NI}
} | babadi2007a |
arxiv-1865 | 0711.3250 | Improved Fully Dynamic Reachability Algorithm for Directed Graph | <|reference_start|>Improved Fully Dynamic Reachability Algorithm for Directed Graph: We propose a fully dynamic algorithm for maintaining reachability information in directed graphs. The proposed deterministic dynamic algorithm has an update time of $O((ins*n^{2}) + (del * (m+n*log(n))))$ where $m$ is the current number of edges, $n$ is the number of vertices in the graph, $ins$ is the number of edge insertions and $del$ is the number of edge deletions. Each query can be answered in O(1) time after each update. The proposed algorithm combines existing fully dynamic reachability algorithm with well known witness counting technique to improve efficiency of maintaining reachability information when edges are deleted. The proposed algorithm improves by a factor of $O(\frac{n^2}{m+n*log(n)})$ for edge deletion over the best existing fully dynamic algorithm for maintaining reachability information.<|reference_end|> | arxiv | @article{kurapati2007improved,
title={Improved Fully Dynamic Reachability Algorithm for Directed Graph},
author={Venkata Seshu Kumar Kurapati},
journal={arXiv preprint arXiv:0711.3250},
year={2007},
archivePrefix={arXiv},
eprint={0711.3250},
primaryClass={cs.DS}
} | kurapati2007improved |
arxiv-1866 | 0711.3251 | Limited Feedback-based Block Diagonalization for the MIMO Broadcast Channel | <|reference_start|>Limited Feedback-based Block Diagonalization for the MIMO Broadcast Channel: Block diagonalization is a linear precoding technique for the multiple antenna broadcast (downlink) channel that involves transmission of multiple data streams to each receiver such that no multi-user interference is experienced at any of the receivers. This low-complexity scheme operates only a few dB away from capacity but requires very accurate channel knowledge at the transmitter. We consider a limited feedback system where each receiver knows its channel perfectly, but the transmitter is only provided with a finite number of channel feedback bits from each receiver. Using a random quantization argument, we quantify the throughput loss due to imperfect channel knowledge as a function of the feedback level. The quality of channel knowledge must improve proportional to the SNR in order to prevent interference-limitations, and we show that scaling the number of feedback bits linearly with the system SNR is sufficient to maintain a bounded rate loss. Finally, we compare our quantization strategy to an analog feedback scheme and show the superiority of quantized feedback.<|reference_end|> | arxiv | @article{ravindran2007limited,
title={Limited Feedback-based Block Diagonalization for the MIMO Broadcast
Channel},
author={Niranjay Ravindran, Nihar Jindal},
journal={arXiv preprint arXiv:0711.3251},
year={2007},
doi={10.1109/JSAC.2008.081013},
archivePrefix={arXiv},
eprint={0711.3251},
primaryClass={cs.IT math.IT}
} | ravindran2007limited |
arxiv-1867 | 0711.3274 | Microsystem Product Development | <|reference_start|>Microsystem Product Development: Over the last decade the successful design and fabrication of complex MEMS (MicroElectroMechanical Systems), optical circuits and ASICs have been demonstrated. Packaging and integration processes have lagged behind MEMS research but are rapidly maturing. As packaging processes evolve, a new challenge presents itself, microsystem product development. Product development entails the maturation of the design and all the processes needed to successfully produce a product. Elements such as tooling design, fixtures, gages, testers, inspection, work instructions, process planning, etc., are often overlooked as MEMS engineers concentrate on design, fabrication and packaging processes. Thorough, up-front planning of product development efforts is crucial to the success of any project.<|reference_end|> | arxiv | @article{polosky2007microsystem,
title={Microsystem Product Development},
author={M.-A. Polosky, E.-J. Garcia},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3274},
primaryClass={cs.OH}
} | polosky2007microsystem |
arxiv-1868 | 0711.3275 | Parasitic Effects Reduction for Wafer-Level Packaging of RF-Mems | <|reference_start|>Parasitic Effects Reduction for Wafer-Level Packaging of RF-Mems: In RF-MEMS packaging, next to the protection of movable structures, optimization of package electrical performance plays a very important role. In this work, a wafer-level packaging process has been investigated and optimized in order to minimize electrical parasitic effects. The RF-MEMS package concept used is based on a wafer-level bonding of a capping silicon substrate to an RF-MEMS wafer. The capping silicon substrate resistivity, substrate thickness and the geometry of through-substrate electrical interconnect vias have been optimized using finite-element electromagnetic simulations (Ansoft HFSS). Test structures for electrical characterization have been designed and after their fabrication, measurement results will be compared with simulations.<|reference_end|> | arxiv | @article{iannacci2007parasitic,
title={Parasitic Effects Reduction for Wafer-Level Packaging of RF-Mems},
author={J. Iannacci, Jason Tian, S. Sinaga, R. Gaddi, A. Gnudi, M. Bartek},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3275},
primaryClass={cs.OH}
} | iannacci2007parasitic |
arxiv-1869 | 0711.3276 | Surface Conditioning Effect on Vacuum Microelectronics Components Fabricated by Deep Reactive Ion Etching | <|reference_start|>Surface Conditioning Effect on Vacuum Microelectronics Components Fabricated by Deep Reactive Ion Etching: Advances in material processing such as silicon micromachining are opening the way to vacuum microelectronics. Two-dimensional vacuum components can be fabricated using the microsystems processes. We developed such devices using a single metal layer and silicon micromachining by DRIE. The latter technological step has significant impact on the characteristics of the vacuum components. This paper presents a brief summary of electron emission possibilities and the design leading to the fabrication of a lateral field emission diode. First measurement results and the aging of the devices are also discussed.<|reference_end|> | arxiv | @article{phommahaxay2007surface,
title={Surface Conditioning Effect on Vacuum Microelectronics Components
Fabricated by Deep Reactive Ion Etching},
author={A. Phommahaxay (ESYCOM-Esiee), G. Lissorgues (ESYCOM-Esiee), L.
Rousseau (ESYCOM-Esiee), T. Bourouina (ESYCOM-Esiee), P. Nicole},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3276},
primaryClass={cs.OH}
} | phommahaxay2007surface |
arxiv-1870 | 0711.3277 | 3-D Self-Assembled Soi Mems: An Example of Multiphysics Simulation | <|reference_start|>3-D Self-Assembled Soi Mems: An Example of Multiphysics Simulation: MEMS devices are typical systems where multiphysics simulations are unavoidable. In this work, we present possible applications of 3-D self-assembled SOI (Silicon-on-Insulator) MEMS such as, for instance, thermal actuators and flow sensors. The numerical simulations of these microsystems are presented. Structural and thermal parts have to be strongly coupled for correctly describing the fabrication process and for simulating the behavior of these 3-D SOI MEMS.<|reference_end|> | arxiv | @article{mendez20073-d,
title={3-D Self-Assembled Soi Mems: An Example of Multiphysics Simulation},
author={C. Mendez, C. Louis, S. Paquay, P. De Vincenzo, I. Klapka, V. Rochus,
F. Iker, Nicolas Andr'e, J.-P. Raskin},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3277},
primaryClass={cs.OH}
} | mendez20073-d |
arxiv-1871 | 0711.3279 | Influence of the Feedback Filter on the Response of the Pulsed Digital Oscillator | <|reference_start|>Influence of the Feedback Filter on the Response of the Pulsed Digital Oscillator: This paper introduces a new feedback topology for the Pulsed Digital Oscillator (PDO) and compares it to the classical topology. The `classic' or single feedback topology, introduced in previous works, shows a strong behavior dependence on the damping losses in the MEMS resonator. A new double feedback topology is introduced here in order to help solving this problem. Comparative discrete-time simulations and preliminary experimental measurements have been carried out for both topologies, showing how the new double feedback topology may increase PDO performance for some frequency ranges.<|reference_end|> | arxiv | @article{dominguez2007influence,
title={Influence of the Feedback Filter on the Response of the Pulsed Digital
Oscillator},
author={M. Dominguez, Joan Pons, J. Ricart, J. Juillard (EA2523), E. Colinet
(EA2523)},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3279},
primaryClass={cs.OH}
} | dominguez2007influence |
arxiv-1872 | 0711.3284 | Concave Microlens Array Mold Fabrication in Photoresist Using UV Proximity Printing | <|reference_start|>Concave Microlens Array Mold Fabrication in Photoresist Using UV Proximity Printing: This paper presents a simple and effective method to fabricate a polydimethyl-siloxane (PDMS) microlens array with a high fill factor, which utilizes the UV proximity printing and photoresist replication methods. The concave microlens array mold was made using a printing gap in lithography process, which utilizes optical diffraction of UV light to deflect away from the aperture edges and produces a certain exposure in the photoresist material outside the aperture edges. This method can precisely control the geometric profile of concave microlens array. The experimental results showed that the concave micro-lens array in photoresist could be formed automatically when the printing gap ranged from 240 micron to 720 micron. High fill factor microlens array can be produced, when the control pitch distance between the adjacent apertures of the concave microlens array was decreased to the aperture size.<|reference_end|> | arxiv | @article{lin2007concave,
title={Concave Microlens Array Mold Fabrication in Photoresist Using UV
Proximity Printing},
author={Tsung-Hung Lin, Hsiharng Yang, Ching-Kong Chao},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3284},
primaryClass={cs.OH}
} | lin2007concave |
arxiv-1873 | 0711.3286 | The annealing induced extraordinary properties of SI based ZNO film grown by RF sputtering | <|reference_start|>The annealing induced extraordinary properties of SI based ZNO film grown by RF sputtering: Pb(Zr0.52Ti0.48)O3 (PZT) thin films were in situ deposited by pulsed laser deposition (PLD) on Pt/Ti/SiO2/Si substrates using a template layer derived by sol-gel method. A 0.1-$\mu$m-thick PZT layer with (111) or (100)-preferred orientation was first deposited onto Pt/Ti/SiO2/Si substrates using the sol-gel method, and than a PZT layer with thickness of 1$\mu$m was in situ deposited by PLD on the above-mentioned PZT layer. The crystalline phases and the preferred orientations of the PZT films were investigated by X-ray diffraction analysis. Surface and cross-sectional morphologies were observed by scanning electron microscopy and transmission electron microscopy. The electrical properties of the films were evaluated by measuring their P-E hysteresis loops and dielectric constants. The preferred orientation of the films can be controlled using the template layer derived by the sol-gel method. The deposition temperature required to obtain the perovskite phase in this process is approximately 460 degrees C, and is significantly lower than that in the case of direct film deposition by PLD on the Pt/Ti/SiO2/Si substrates. Keywords: lead zirconate titanate (PZT), thin film, sol-gel method, laser ablation, electrical properties<|reference_end|> | arxiv | @article{li2007the,
title={The annealing induced extraordinary properties of SI based ZNO film
grown by RF sputtering},
author={Jing Li, L. Dedeng, Suntao Wu},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3286},
primaryClass={cs.OH}
} | li2007the |
arxiv-1874 | 0711.3287 | Parametric Yield Analysis of Mems via Statistical Methods | <|reference_start|>Parametric Yield Analysis of Mems via Statistical Methods: This paper considers a developing theory on the effects of inevitable process variations during the fabrication of MEMS and other microsystems. The effects on the performance and design yield of the microsystems devices are analyzed and presented. A novel methodology in the design cycle of MEMS and other microsystems is briefly introduced. This paper describes the initial steps of this methodology that is aimed at counteracting the parametric variations in the product cycle of microsystems. It is based on a concept of worst-case analysis that has proven successful in the parent IC technology. Issues ranging from the level of abstraction of the microsystem models to the availability of such models are addressed<|reference_end|> | arxiv | @article{vudathu2007parametric,
title={Parametric Yield Analysis of Mems via Statistical Methods},
author={S.-P. Vudathu, K.-K. Duganapalli, Rainer Laur, D. Kubalinska, A.
Bunse-Gerstner},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3287},
primaryClass={cs.OH}
} | vudathu2007parametric |
arxiv-1875 | 0711.3288 | Electrostatically-Driven Resonator on Soi with Improved Temperature Stability | <|reference_start|>Electrostatically-Driven Resonator on Soi with Improved Temperature Stability: This paper deals with a single-crystal-silicon (SCS) MEMS resonator with improved temperature stability. While simulations have shown that the temperature coefficient of resonant frequency can be down to 1 ppm/degrees C, preliminary measurements on non-optimised structures gave evidence of a temperature coefficient of 29 ppm/degrees C. Design, optimisation, experimental results with post process simulation and prospective work are presented.<|reference_end|> | arxiv | @article{giridhar2007electrostatically-driven,
title={Electrostatically-Driven Resonator on Soi with Improved Temperature
Stability},
author={A. Giridhar (ESYCOM-Esiee, Ief), F. Verjus (ESYCOM-Esiee), F. Marty
(IEF), A. Bosseboeuf (IEF), T. Bourouina (IEF)},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3288},
primaryClass={cs.OH}
} | giridhar2007electrostatically-driven |
arxiv-1876 | 0711.3289 | Electromechanical Reliability Testing of Three-Axial Silicon Force Sensors | <|reference_start|>Electromechanical Reliability Testing of Three-Axial Silicon Force Sensors: This paper reports on the systematic electromechanical characterization of a new three-axial force sensor used in dimensional metrology of micro components. The siliconbased sensor system consists of piezoresistive mechanicalstress transducers integrated in thin membrane hinges supporting a suspended flexible cross structure. The mechanical behavior of the fragile micromechanical structure isanalyzed for both static and dynamic load cases. This work demonstrates that the silicon microstructure withstands static forces of 1.16N applied orthogonally to the front-side of the structure. A statistical Weibull analysis of the measured data shows that these values are significantly reduced if the normal force is applied to the back of the sensor. Improvements of the sensor system design for future development cycles are derived from the measurement results.<|reference_end|> | arxiv | @article{spinner2007electromechanical,
title={Electromechanical Reliability Testing of Three-Axial Silicon Force
Sensors},
author={S. Spinner, J. Bartholomeyczik, B. Becker, M. Doelle, O. Paul, I.
Polian, R. Roth, K. Seitz, P. Ruther},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3289},
primaryClass={cs.OH}
} | spinner2007electromechanical |
arxiv-1877 | 0711.3290 | An Active Chaotic Micromixer Integrating Thermal Actuation Associating PDMS and Silicon Microtechnology | <|reference_start|>An Active Chaotic Micromixer Integrating Thermal Actuation Associating PDMS and Silicon Microtechnology: Due to scaling laws, in microfluidic, flows are laminar. Consequently, mixing between two liquids is mainly obtained by natural diffusion which may take a long time or equivalently requires centimetre length channels. To reduce time and length for mixing, it is possible to generate chaotic-like flows either by modifying the channel geometry or by creating an external perturbation of the flow. In this paper, an active micromixer is presented consisting on thermal actuation with heating resistors. In order to disturb the liquid flow, an oscillating transverse flow is generated by heating the liquid. Depending on the value of boiling point, either bubble expansion or volumetric dilation controlled the transverse flow amplitude. A chaotic like mixing is then induced under particular conditions depending on volume expansion, liquid velocity, frequency of actuation... This solution presents the advantage to achieve mixing in a very short time (1s) and along a short channel distance (channel width). It can also be integrated in a more complex device due to actuator integration with microfluidics.<|reference_end|> | arxiv | @article{français2007an,
title={An Active Chaotic Micromixer Integrating Thermal Actuation Associating
PDMS and Silicon Microtechnology},
author={O. Franc{c}ais, M.-C. Jullien (SATIE), L. Rousseau (ESYCOM-Esiee), P.
Poulichet (ESYCOM-Esiee), S. Desportes (PPSM), A. Chouai (PPSM), J.-P.
Lefevre (PPSM), J. Delaire (PPSM)},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3290},
primaryClass={cs.OH}
} | français2007an |
arxiv-1878 | 0711.3291 | Resolution Limits for Resonant Mems Sensors Based on Discrete Relay Feedback Techniques | <|reference_start|>Resolution Limits for Resonant Mems Sensors Based on Discrete Relay Feedback Techniques: This paper is devoted to the analysis of resonant MEMS sensors based on discrete relay feedback techniques. One drawback of such techniques is that some synchronization usually occurs between the discrete part and the continuous part of the system: this results in sensor responses that are very similar to the curves known as devil's staircases, i.e. the frequency does not vary smoothly with the sensor's input. The main contribution of this paper is a theoretical calculation of the resolution of such systems. The resolutions of two existing resonant MEMS architectures are then calculated and these results are discussed.<|reference_end|> | arxiv | @article{juillard2007resolution,
title={Resolution Limits for Resonant Mems Sensors Based on Discrete Relay
Feedback Techniques},
author={J. Juillard, E. Colinet (LETI), M. Dominguez, Joan Pons, J. Ricart},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3291},
primaryClass={cs.OH}
} | juillard2007resolution |
arxiv-1879 | 0711.3292 | A Silicon-Based Micro Gas Turbine Engine for Power Generation | <|reference_start|>A Silicon-Based Micro Gas Turbine Engine for Power Generation: This paper reports on our research in developing a micro power generation system based on gas turbine engine and piezoelectric converter. The micro gas turbine engine consists of a micro combustor, a turbine and a centrifugal compressor. Comprehensive simulation has been implemented to optimal the component design. We have successfully demonstrated a silicon-based micro combustor, which consists of seven layers of silicon structures. A hairpin-shaped design is applied to the fuel/air recirculation channel. The micro combustor can sustain a stable combustion with an exit temperature as high as 1600 K. We have also successfully developed a micro turbine device, which is equipped with enhanced micro air-bearings and driven by compressed air. A rotation speed of 15,000 rpm has been demonstrated during lab test. In this paper, we will introduce our research results major in the development of micro combustor and micro turbine test device.<|reference_end|> | arxiv | @article{shan2007a,
title={A Silicon-Based Micro Gas Turbine Engine for Power Generation},
author={X.-C. Shan, Z.-F. Wang, R. Maeda, Y.F. Sun, M. Wu, J.S. Hua},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3292},
primaryClass={cs.OH}
} | shan2007a |
arxiv-1880 | 0711.3294 | Energy Conversion Using New Thermoelectric Generator | <|reference_start|>Energy Conversion Using New Thermoelectric Generator: During recent years, microelectronics helped to develop complex and varied technologies. It appears that many of these technologies can be applied successfully to realize Seebeck micro generators: photolithography and deposition methods allow to elaborate thin thermoelectric structures at the micro-scale level. Our goal is to scavenge energy by developing a miniature power source for operating electronic components. First Bi and Sb micro-devices on silicon glass substrate have been manufactured with an area of 1cm2 including more than one hundred junctions. Each step of process fabrication has been optimized: photolithography, deposition process, anneals conditions and metallic connections. Different device structures have been realized with different micro-line dimensions. Each devices performance will be reviewed and discussed in function of their design structure.<|reference_end|> | arxiv | @article{savelli2007energy,
title={Energy Conversion Using New Thermoelectric Generator},
author={Guillaume Savelli (LEG), Marc Plissonnier, Jacqueline Bablet, C.
Salvi, J.M. Fournier},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3294},
primaryClass={cs.OH}
} | savelli2007energy |
arxiv-1881 | 0711.3296 | Above Ic Micro-Power Generators for RF-Mems | <|reference_start|>Above Ic Micro-Power Generators for RF-Mems: This work presents recent advances in the development and the integration of an electrochemical (chemicalelectrical energy conversion) micro power generator used as a high voltage energy source for RF-MEMS powering. Autonomous MEMS require similarly miniaturized power sources. Up to day, solid state thin film batteries are realized with mechanical masks. This method doesn't allow dimensions below a few mm^2 active area, and besides the whole process flow is done under controlled atmosphere so as to ensure materials chemical stability (mainly lithiated materials). Within this context, Microelectronics micro-fabrication procedures (photolithography, Reactive Ion Etching...) are used to reach both miniaturisation (100x100 $\mu$m^2 targeted unit cell active area) and Above IC technological compatibility. All process steps developed here are realized in clean room environment.<|reference_end|> | arxiv | @article{oukassi2007above,
title={Above Ic Micro-Power Generators for RF-Mems},
author={S. Oukassi, R. Salot, S. Bancel, J.-P. Pereira-Ramos},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3296},
primaryClass={cs.OH}
} | oukassi2007above |
arxiv-1882 | 0711.3297 | Packaging of RF Mems Switching Functions on Alumina Substrate | <|reference_start|>Packaging of RF Mems Switching Functions on Alumina Substrate: Recently the strong demands in wireless communication requires expanding development for the application of RF MEMS (Radio Frequency micro electro mechanical systems) sensing devices such as micro-switches, tunable capacitors because it offers lower power consumption, lower losses, higher linearity and higher Q factors compared with conventional communications components. To accelerate commercialisation of RF MEMS products, development for packaging technologies is one of the most critical issues should be solved beforehand.<|reference_end|> | arxiv | @article{khatib2007packaging,
title={Packaging of RF Mems Switching Functions on Alumina Substrate},
author={M.-K. El Khatib (XLIM), A. Pothier (XLIM), P. Blondy (XLIM)},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3297},
primaryClass={cs.OH}
} | khatib2007packaging |
arxiv-1883 | 0711.3298 | Recent Developments in Mems-Based Micro Fuel Cells | <|reference_start|>Recent Developments in Mems-Based Micro Fuel Cells: Micro fuel cells ($\mu$-FC) represent promising power sources for portable applications. Today, one of the technological ways to make $\mu$-FC is to have recourse to standard microfabrication techniques used in the fabrication of micro electromechanical systems (MEMS). This paper shows an overview on the applications of MEMS techniques on miniature FC by presenting several solutions developed throughout the world. It also describes the latest developments of a new porous silicon-based miniature fuel cell. Using a silane grafted on an inorganic porous media as the proton-exchange membrane instead of a common ionomer such as Nafion, the fuel cell achieved a maximum power density of 58 mW cm-2 at room temperature with hydrogen as fuel.<|reference_end|> | arxiv | @article{pichonat2007recent,
title={Recent Developments in Mems-Based Micro Fuel Cells},
author={T. Pichonat (FEMTO-ST - Lopmd), B. Gauthier-Manuel (FEMTO-ST - Lopmd)},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3298},
primaryClass={cs.OH}
} | pichonat2007recent |
arxiv-1884 | 0711.3299 | Influence of Micro-Cantilever Geometry and Gap on Pull-in Voltage | <|reference_start|>Influence of Micro-Cantilever Geometry and Gap on Pull-in Voltage: In this paper, we study the behaviour of a microcantilever beam under electrostatic actuation using finite difference method. This problem has a lot of applications in MEMS based devices like accelerometers, switches and others. In this paper, we formulated the problem of a cantilever beam with proof mass at its end and carried out the finite difference solution. we studied the effects of length, width, and the gap size on the pull-in voltage using data that are available in the literature. Also, the stability limit is compared with the single degree of freedom commonly used in the earlier literature as an approximation to calculate the pull-in voltage.<|reference_end|> | arxiv | @article{faris2007influence,
title={Influence of Micro-Cantilever Geometry and Gap on Pull-in Voltage},
author={W. Faris, H. Mohammed, M.M. Abdalla, C.-H. Ling},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3299},
primaryClass={cs.OH}
} | faris2007influence |
arxiv-1885 | 0711.3300 | Design and Development of Novel Electroplating Spring Frame Mems Structure Specimens for the Microtensile Testing of Thin Film Materials | <|reference_start|>Design and Development of Novel Electroplating Spring Frame Mems Structure Specimens for the Microtensile Testing of Thin Film Materials: Microelectromechanical systems (MEMS) technologies are developing rapidly with increasing study of the design, fabrication and commercialization of microscale systems and devices. Accurate mechanical properties are important for successful design and development of MEMS. We have demonstrated here a novel electroplating spring frame MEMS Structure Specimen integrates pin-pin align holes, misalignment compensate spring structure frame, load sensor beam and freestanding thin film. The specimen can be fit into a specially designed microtensile apparatus which is capable of carrying out a series of tests on sub-micro scale freestanding thin films.<|reference_end|> | arxiv | @article{lin2007design,
title={Design and Development of Novel Electroplating Spring Frame Mems
Structure Specimens for the Microtensile Testing of Thin Film Materials},
author={Ming-Tzer Lin, Chi-Jia Tong, Chung-Hsun Chiang},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3300},
primaryClass={cs.OH}
} | lin2007design |
arxiv-1886 | 0711.3301 | Characterisation of the Etching Quality in Micro-Electro-Mechanical Systems by Thermal Transient Methodology | <|reference_start|>Characterisation of the Etching Quality in Micro-Electro-Mechanical Systems by Thermal Transient Methodology: Our paper presents a non-destructive thermal transient measurement method that is able to reveal differences even in the micron size range of MEMS structures. Devices of the same design can have differences in their sacrificial layers as consequence of the differences in their manufacturing processes e.g. different etching times. We have made simulations examining how the etching quality reflects in the thermal behaviour of devices. These simulations predicted change in the thermal behaviour of MEMS structures having differences in their sacrificial layers. The theory was tested with measurements of similar MEMS devices prepared with different etching times. In the measurements we used the T3Ster thermal transient tester equipment. The results show that deviations in the devices, as consequence of the different etching times, result in different temperature elevations and manifest also as shift in time in the relevant temperature transient curves.<|reference_end|> | arxiv | @article{szabo2007characterisation,
title={Characterisation of the Etching Quality in Micro-Electro-Mechanical
Systems by Thermal Transient Methodology},
author={P. Szabo, B. Nemeth, M. Rencz, B. Courtois (TIMA)},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3301},
primaryClass={cs.OH}
} | szabo2007characterisation |
arxiv-1887 | 0711.3302 | The Effects of Additives on the Physical Properties of Electroformed Nickel and on the Stretch of Photoelectroformed Nickel Components | <|reference_start|>The Effects of Additives on the Physical Properties of Electroformed Nickel and on the Stretch of Photoelectroformed Nickel Components: The process of nickel electroforming is becoming increasingly important in the manufacture of MST products, as it has the potential to replicate complex geometries with extremely high fidelity. Electroforming of nickel uses multi-component electrolyte formulations in order to maximise desirable product properties. In addition to nickel sulphamate (the major electrolyte component), formulation additives can also comprise nickel chloride (to increase nickel anode dissolution), sulphamic acid (to control pH), boric acid (to act as a pH buffer), hardening/levelling agents (to increase deposit hardness and lustre) and wetting agents (to aid surface wetting and thus prevent gas bubbles and void formation). This paper investigates the effects of some of these variables on internal stress and stretch as a function of applied current density.<|reference_end|> | arxiv | @article{allen2007the,
title={The Effects of Additives on the Physical Properties of Electroformed
Nickel and on the Stretch of Photoelectroformed Nickel Components},
author={D. Allen, N. Duclos, I. Garbutt, M. Saumer, Ch. Dhum, M. Schmitt, J.
E. Hoffmann},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3302},
primaryClass={cs.OH}
} | allen2007the |
arxiv-1888 | 0711.3304 | A Novel Contact Resistance Model of Anisotropic Conductive Film for FPD Packaging | <|reference_start|>A Novel Contact Resistance Model of Anisotropic Conductive Film for FPD Packaging: In this research, a novel contact resistance model for the flat panel display (FPD) packaging based on the within layer parallel and between layers series resistance concepts was proposed. The FJ2530 anisotropic conductive films (ACF) by Sony Inc. containing the currently smallest 3micron conductive particles was used to conduct the experiments to verify the accuracy of the proposed model. Calculated resistance of the chip-on-glass (COG) packaging by the proposed model is 0.163\Omega. It is found that the gold bump with 0.162\Omega resistance play the major role of the overall resistance. Although the predicted resistance by the proposed model is only one third of the experimentally measured value, it has been three-fold improvement compared to the existing models.<|reference_end|> | arxiv | @article{wang2007a,
title={A Novel Contact Resistance Model of Anisotropic Conductive Film for FPD
Packaging},
author={Gou-Jen Wang, Yi-Chin Lin, Gwo-Sen Lin},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3304},
primaryClass={cs.OH}
} | wang2007a |
arxiv-1889 | 0711.3305 | Measurement Technique for Elastic and Mechanical Properties of Polycrystalline Silicon-Germanium Films Using Surface Acoustic Waves and Projection Masks | <|reference_start|>Measurement Technique for Elastic and Mechanical Properties of Polycrystalline Silicon-Germanium Films Using Surface Acoustic Waves and Projection Masks: Using Rayleigh surface acoustic waves (SAW), the Young's modulus, the density and the thickness of polycrystalline Silicon-Germanium (SiGe) films deposited on silicon and SiO2 were measured, in excellent agreement with theory. The dispersion curve of the propagating SAW is calculated with a Boundary Element Method (BEM)-Model based on Green's functions. The propagating SAW is generated with a nanosecond laser in a narrowband scheme projecting stripes from a mask on the surface of the sample. For this purpose a glass mask and a liquid crystal display (LCD) mask are used. The slope of the SAW is then measured using a probe beam setup. From the wavelength of the mask and the frequency of the measured SAW, the dispersion curve is determined point by point. Fitting the BEM-Model to the measured nonlinear dispersion curve provides several physical parameters simultaneously. In the present work this is demonstrated for the Young's modulus, the density and the thickness of SiGe films. The results from the narrowband scheme measurement are in excellent agreement with separated measurements of the thickness (profilometer), the density (balance) and the Young's modulus (nanoindenter).<|reference_end|> | arxiv | @article{bennis2007measurement,
title={Measurement Technique for Elastic and Mechanical Properties of
Polycrystalline Silicon-Germanium Films Using Surface Acoustic Waves and
Projection Masks},
author={A. Bennis, C. Leinenbach, C. Raudzis, R. M"uller-Fiedler, S.
Kronm"uller},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3305},
primaryClass={cs.OH}
} | bennis2007measurement |
arxiv-1890 | 0711.3306 | Effect of Surface Finish of Substrate on Mechanical Reliability of in-48SN Solder Joints in Moems Package | <|reference_start|>Effect of Surface Finish of Substrate on Mechanical Reliability of in-48SN Solder Joints in Moems Package: Interfacial reactions and shear properties of the In-48Sn (in wt.%) ball grid array (BGA) solder joints after bonding were investigated with four different surface finishes of the substrate over an underlying Cu pad: electroplated Ni/Au (hereafter E-NG), electroless Ni/immersion Au (hereafter ENIG), immersion Ag (hereafter I-Ag) and organic solderability preservative (hereafter OSP). During bonding, continuous AuIn2, Ni3(Sn,In)4 and Cu6(Sn,In)5 intermetallic compound (IMC) layers were formed at the solder/E-NG, solder/ENIG and solder/OSP interface, respectively. The interfacial reactions between the solder and I-Ag substrate during bonding resulted in the formation of Cu6(Sn,In)5 and Cu(Sn,In)2 IMCs with a minor Ag element. The In-48Sn/I-Ag solder joint showed the best shear properties among the four solder joints after bonding, whereas the solder/ENIG solder joint exhibited the weakest mechanical integrity.<|reference_end|> | arxiv | @article{koo2007effect,
title={Effect of Surface Finish of Substrate on Mechanical Reliability of
in-48SN Solder Joints in Moems Package},
author={Ja-Myeong Koo, Seung-Boo Jung},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3306},
primaryClass={cs.OH}
} | koo2007effect |
arxiv-1891 | 0711.3308 | Non Linear Techniques for Increasing Harvesting Energy from Piezoelectric and Electromagnetic Micro-Power-Generators | <|reference_start|>Non Linear Techniques for Increasing Harvesting Energy from Piezoelectric and Electromagnetic Micro-Power-Generators: Non-linear techniques are used to optimize the harvested energy from piezoelectric and electromagnetic generators. This paper introduces an analytical study for the voltage amplification obtained from these techniques. The analytical study is experimentally validated using a macro model of piezoelectric generator. Moreover, the integration influences on these techniques is studied. Through all the obtained results, a suitable structure for autonomous microsystems is proposed.<|reference_end|> | arxiv | @article{ammar2007non,
title={Non Linear Techniques for Increasing Harvesting Energy from
Piezoelectric and Electromagnetic Micro-Power-Generators},
author={Yasser Ammar (TIMA), S. Basrour (TIMA)},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3308},
primaryClass={cs.OH}
} | ammar2007non |
arxiv-1892 | 0711.3309 | Optimization of Piezoelectric Electrical Generators Powered by Random Vibrations | <|reference_start|>Optimization of Piezoelectric Electrical Generators Powered by Random Vibrations: This paper compares the performances of a vibrationpowered electrical generators using PZT piezoelectric ceramic associated to two different power conditioning circuits. A new approach of the piezoelectric power conversion based on a nonlinear voltage processing is presented and implemented with a particular power conditioning circuit topology. Theoretical predictions and experimental results show that the nonlinear processing technique may increase the power harvested by a factor up to 4 compared to the Standard optimization technique. Properties of this new technique are analyzed in particular in the case of broadband, random vibrations, and compared to those of the Standard interface.<|reference_end|> | arxiv | @article{lefeuvre2007optimization,
title={Optimization of Piezoelectric Electrical Generators Powered by Random
Vibrations},
author={E. Lefeuvre (LGEF), A. Badel (LGEF), C. Richard (LGEF), L. Petit
(LGEF), D. Guyomar (LGEF)},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3309},
primaryClass={cs.OH}
} | lefeuvre2007optimization |
arxiv-1893 | 0711.3311 | Power Processing Circuits for Mems Inertial Energy Scavengers | <|reference_start|>Power Processing Circuits for Mems Inertial Energy Scavengers: Inertial energy scavengers are self-contained devices which generate power from ambient motion, by electrically damping the internal motion of a suspended proof mass. There are significant challenges in converting the power generated from such devices to useable form, particularly in micro-engineered variants. This paper presents approaches to this power conversion requirement, with emphasis on the cases of electromagnetic and electrostatic transduction.<|reference_end|> | arxiv | @article{mitcheson2007power,
title={Power Processing Circuits for Mems Inertial Energy Scavengers},
author={P.-D. Mitcheson, T.-C. Green, E.-M. Yeatman},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3311},
primaryClass={cs.OH}
} | mitcheson2007power |
arxiv-1894 | 0711.3312 | Motion-Based Generators for Industrial Applications | <|reference_start|>Motion-Based Generators for Industrial Applications: Scaling down of electronic systems has generated a large interest in the research on miniature energy sources. In this paper a closer look is given to the use of vibration based scavengers in industrial environments, where waste energy is abundantly available as engine related vibrations or large amplitude motions. The modeling of mechanical generators resulted in the design and realization of two prototypes, based on electromagnetic and electrostatic conversion of energy. Although the prototypes are not yet optimized against size and efficiency, a power of 0.3 mW has been generated in a 5 Hz motion with a 0.5 meter amplitude.<|reference_end|> | arxiv | @article{sterken2007motion-based,
title={Motion-Based Generators for Industrial Applications},
author={T. Sterken, P. Fiorini, R. Puers},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3312},
primaryClass={cs.OH}
} | sterken2007motion-based |
arxiv-1895 | 0711.3313 | Design and Fabrication of a Micro Electrostatic Vibration-to-Electricity Energy Converter | <|reference_start|>Design and Fabrication of a Micro Electrostatic Vibration-to-Electricity Energy Converter: This paper presents a micro electrostatic vibration-toelectricity energy converter. For the 3.3 V supply voltage and 1cm2 chip area constraints, optimal design parameters were found from theoretical calculation and Simulink simulation. In the current design, the output power is 200 $\mu$W/cm2 for the optimal load of 8 M\Omega. The device was fabricated in a silicon-on-insulator (SOI) wafer. Mechanical and electrical measurements were conducted. Residual particles caused shortage of the variable capacitor and the output power could not be measured. Device design and fabrication processes are being refined.<|reference_end|> | arxiv | @article{chiu2007design,
title={Design and Fabrication of a Micro Electrostatic Vibration-to-Electricity
Energy Converter},
author={Yi Chiu, Chiung-Ting Kuo, Yu-Shan Chu},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3313},
primaryClass={cs.OH}
} | chiu2007design |
arxiv-1896 | 0711.3314 | Macro and Micro Scale Electromagnetic Kinetic Energy Harvesting Generators | <|reference_start|>Macro and Micro Scale Electromagnetic Kinetic Energy Harvesting Generators: This paper is concerned with generators that harvest electrical energy from the kinetic energy present in the sensor nodes environment. These generators have the potential to replace or augment battery power which has a limited lifetime and requires periodic replacement which limits the placement and application of the sensor node.<|reference_end|> | arxiv | @article{beeby2007macro,
title={Macro and Micro Scale Electromagnetic Kinetic Energy Harvesting
Generators},
author={S.-P. Beeby, M.-J. Tudor, R.-N. Torah, E. Koukharenko, S. Roberts, T.
O'Donnell, S. Roy},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3314},
primaryClass={cs.OH}
} | beeby2007macro |
arxiv-1897 | 0711.3315 | Impact of Thermal Behavior on Offset in a High-Q Gyroscope | <|reference_start|>Impact of Thermal Behavior on Offset in a High-Q Gyroscope: In this paper, CFD approach is used to simulate the thermal behavior in a sensitive high-Q gyroscope. The electromagnetically driving wires, in which AC current flows, are treated as Joule heat sources in the model. We found that the differences of temperature, pressure and velocity along the driving direction and transversely across the proof masses increased as the gap height between the proof mass and top glass became smaller. Local pressure gradient is expected to possibly enhance the impact of any imperfect led by MEMS processes or designs on the offset of our tuning fork type gyroscope, which has been experimentally verified. A device with 200um gap gives a two-third offset down compared with that of its counterpart with 50um gap.<|reference_end|> | arxiv | @article{duan2007impact,
title={Impact of Thermal Behavior on Offset in a High-Q Gyroscope},
author={Fei Duan, J. Jiao, Y. Wang},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3315},
primaryClass={cs.OH}
} | duan2007impact |
arxiv-1898 | 0711.3316 | Scaling Effects for Electromagnetic Vibrational Power Generators | <|reference_start|>Scaling Effects for Electromagnetic Vibrational Power Generators: This paper investigates how the power generated by electromagnetic based vibrational power generators scales with the dimension of the generator. The effects of scaling on the magnetic fields, the coil parameters and the electromagnetic damping are presented. An analysis is presented for both wire-wound coil technology and micro-fabricated coils.<|reference_end|> | arxiv | @article{o'donnell2007scaling,
title={Scaling Effects for Electromagnetic Vibrational Power Generators},
author={T. O'Donnell, C. Saha, S.-P. Beeby, M.-J. Tudor},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3316},
primaryClass={cs.OH}
} | o'donnell2007scaling |
arxiv-1899 | 0711.3317 | A Generic Surface Micromachining Module for Mems Hermetic Packaging at Temperatures Below 200 degrees C | <|reference_start|>A Generic Surface Micromachining Module for Mems Hermetic Packaging at Temperatures Below 200 degrees C: This paper presents the different processing steps of a new generic surface micromachining module for MEMS hermetic packaging at temperatures around 180 degrees C based on nickel plating and photoresist sacrificial layers. The advantages of thin film caps are the reduced thickness and area consumption and the promise of being a low-cost batch process. Moreover, sealing happens by a reflow technique, giving the freedom of choosing the pressure and atmosphere inside the cavity. Sacrificial etch holes are situated above the device allowing shorter release times compared to the state-of-the-art. With the so-called over-plating process, small etch holes can be created in the membrane without the need of expensive lithography tools. The etch holes in the membrane have been shown to be sufficiently small to block the sealing material to pass through, but still large enough to enable an efficient release.<|reference_end|> | arxiv | @article{hellin-rico2007a,
title={A Generic Surface Micromachining Module for Mems Hermetic Packaging at
Temperatures Below 200 degrees C},
author={R. Hellin-Rico, J.-P. Celis, K. Baert, C. Van Hoof, A. Witvrouw},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3317},
primaryClass={cs.OH}
} | hellin-rico2007a |
arxiv-1900 | 0711.3318 | A Ku-Band Novel Micromachined Bandpass Filter with Two Transmission Zeros | <|reference_start|>A Ku-Band Novel Micromachined Bandpass Filter with Two Transmission Zeros: This paper presents a micromachined bandpass filter with miniature size that has relatively outstanding performance. A silicon-based eight-order microstrip bandpass filter is fabricated and measured. A novel design method of the interdigital filter that can create two transmission zeros is described. The location of the transmission zeros can be shifted arbitrarily in the stopband. By adjusting the zero location properly, the filter provides much better skirt rejection and lower insertion loss than a conventional microstrip interdigital filter. To reduce the chip size, through-silicon-substrate-via-hole is used. Good experimental results are obtained.<|reference_end|> | arxiv | @article{yong2007a,
title={A Ku-Band Novel Micromachined Bandpass Filter with Two Transmission
Zeros},
author={Zhang Yong, Zhu Jian, Yu Yuanwei, Chen Chen, Jia Shi Xing},
journal={Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0711.3318},
primaryClass={cs.OH}
} | yong2007a |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.