OpenRaiser/Intern-Atlas huggingface dataset:
Model of Electrostatic Actuated Deformable Mirror Using Strongly Coupled Electro-Mechanical Finite Element
Venue: arXiv cs.OH 2007
Year: 2007

The aim of this paper is to deal with multi-physics simulation of micro-electro-mechanical systems (MEMS) based on an advanced numerical methodology. MEMS are very small devices in which electric as well as mechanical and fluid phenomena appear and interact. Because of their microscopic scale, strong coupling effects arise between the different physical fields, and some forces, which were negligible at macroscopic scale, have to be taken into account. In order to accurately design such micro-electro-mechanical systems, it is of primary importance to be able to handle the strong coupling between the electric and the mechanical fields. In this paper, the finite element method (FEM) is used to model the strong coupled electro-mechanical interactions and to perform static and transient analyses taking into account large mesh displacements. These analyses will be used to study the behaviour of electrostatically actuated micro-mirrors.
Morphological annotation of Korean with Directly Maintainable Resources
Venue: arXiv cs.CL 2007
Year: 2007

This article describes an exclusively resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. Our annotator is designed to process text before the operation of a syntactic parser. In its present state, it annotates one-stem words only. The output is a graph of morphemes annotated with accurate linguistic information. The granularity of the tagset is 3 to 5 times higher than usual tagsets. A comparison with a reference annotated corpus showed that it achieves 89% recall without any corpus training. The language resources used by the system are lexicons of stems, transducers of suffixes and transducers of generation of allomorphs. All can be easily updated, which allows users to control the evolution of the performances of the system. It has been claimed that morphological annotation of Korean text could only be performed by a morphological analysis module accessing a lexicon of morphemes. We show that it can also be performed directly with a lexicon of words and without applying morphological rules at annotation time, which speeds up annotation to 1,210 word/s. The lexicon of words is obtained from the maintainable language resources through a fully automated compilation process.
Lexicon management and standard formats
Venue: arXiv cs.CL 2007
Year: 2007

International standards for lexicon formats are in preparation. To a certain extent, the proposed formats converge with prior results of standardization projects. However, their adequacy for (i) lexicon management and (ii) lexicon-driven applications have been little debated in the past, nor are they as a part of the present standardization effort. We examine these issues. IGM has developed XML formats compatible with the emerging international standards, and we report experimental results on large-coverage lexica.
To Code or Not to Code Across Time: Space-Time Coding with Feedback
Venue: arXiv cs.IT 2007
Year: 2007

Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initially been designed with a focus on open-loop systems, recent technological advances have enabled the possibility of low-rate feedback from the receiver to the transmitter. The focus of this paper is on the implications of this feedback in a single-user multi-antenna system with a general model for spatial correlation. We assume a limited feedback model, that is, a coherent receiver and statistics along with B bits of quantized channel information at the transmitter. We study space-time coding with a family of linear dispersion (LD) codes that meet an additional orthogonality constraint so as to ensure low-complexity decoding. Our results show that, when the number of bits of feedback (B) is small, a space-time coding scheme that is equivalent to beamforming and does not code across time is optimal in a weak sense in that it maximizes the average received SNR. As B increases, this weak optimality transitions to optimality in a strong sense which is characterized by the maximization of the average mutual information. Thus, from a system designer's perspective, our work suggests that beamforming may not only be attractive from a low-complexity viewpoint, but also from an information-theoretic viewpoint.
Weak vs. Self vs. Probabilistic Stabilization
Venue: arXiv cs.DC 2007
Year: 2007

Self-stabilization is a strong property that guarantees that a network always resume correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic stabilization only gives probabilistic convergence to a correct behavior. Also, weak stabilization only gives the possibility of convergence. In this paper, we investigate the relative power of weak, self, and probabilistic stabilization, with respect to the set of problems that can be solved. We formally prove that in that sense, weak stabilization is strictly stronger that self-stabilization. Also, we refine previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weak-stabilizing protocol can be turned into a probabilistic self-stabilizing one. This latter result hints at more practical use of weak-stabilization, as such algorthms are easier to design and prove than their (probabilistic) self-stabilizing counterparts.
Derivations of Normalized Mutual Information in Binary Classifications
Venue: arXiv cs.LG 2007
Year: 2007

This correspondence studies the basic problem of classifications - how to evaluate different classifiers. Although the conventional performance indexes, such as accuracy, are commonly used in classifier selection or evaluation, information-based criteria, such as mutual information, are becoming popular in feature/model selections. In this work, we propose to assess classifiers in terms of normalized mutual information (NI), which is novel and well defined in a compact range for classifier evaluation. We derive close-form relations of normalized mutual information with respect to accuracy, precision, and recall in binary classifications. By exploring the relations among them, we reveal that NI is actually a set of nonlinear functions, with a concordant power-exponent form, to each performance index. The relations can also be expressed with respect to precision and recall, or to false alarm and hitting rate (recall).
Coding for Network Coding
Venue: arXiv cs.IT 2007
Year: 2007

We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include node- or link- failures, Byzantine behavior of nodes, or an over-estimate of the network min-cut. Building on the work of Koetter and Kschischang, we introduce a probabilistic model for errors. We compute the capacity of this channel and we define an error-correction scheme based on random sparse graphs and a low-complexity decoding algorithm. By optimizing over the code degree profile, we show that this construction achieves the channel capacity in complexity which is jointly quadratic in the number of coded information bits and sublogarithmic in the error probability.
Self-dual, dual-containing and related quantum codes from group rings
Venue: arXiv cs.IT 2007
Year: 2007

Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other properties are derived by working within the group ring. Quantum codes are constructed from the dual-containing codes.
Spreadsheet Risk - A New Direction for HMRC?
Venue: arXiv cs.CY 2007
Year: 2007

Her Majestys Revenue & Customs (HMRC) was born out of the need to create a UK tax authority by merging both the Inland Revenue and HM Customs & Excise into one department. HMRC encounters spreadsheets in tax-payers systems on a very regular basis as well as being a heavy user of spreadsheets internally. The approach to spreadsheet risk assessment and spreadsheet audit is by the use of trained computer auditors and data handlers. This, by definition, limits the use of our specialist spreadsheet audit tool to such trained staff. In order to tackle the growing use of spreadsheets, a new way of approaching the problem has been piloted. The aim is to issue all staff who come across spreadsheets with a simple to use analysis and risk assessment tool, based on the departmental software SpACE (Spreadsheet Audit & Compliance Examination).
Copeland Voting Fully Resists Constructive Control
Venue: arXiv cs.GT 2007
Year: 2007

Control and bribery are settings in which an external agent seeks to influence the outcome of an election. Faliszewski et al. [FHHR07] proved that Llull voting (which is here denoted by Copeland^1) and a variant (here denoted by Copeland^0) of Copeland voting are computationally resistant to many, yet not all, types of constructive control and that they also provide broad resistance to bribery. We study a parameterized version of Copeland voting, denoted by Copeland^alpha where the parameter alpha is a rational number between 0 and 1 that specifies how ties are valued in the pairwise comparisons of candidates in Copeland elections. We establish resistance or vulnerability results, in every previously studied control scenario, for Copeland^alpha, for each rational alpha, 0 <alpha < 1. In particular, we prove that Copeland^0.5, the system commonly referred to as ``Copeland voting,'' provides full resistance to constructive control. Among the systems with a polynomial-time winner problem, this is the first natural election system proven to have full resistance to constructive control. Results on bribery and fixed-parameter tractability of bounded-case control proven for Copeland^0 and Copeland^1 in [FHHR07] are extended to Copeland^alpha for each rational alpha, 0 < alpha < 1; we also give results in more flexible models such as microbribery and extended control.
Circumspect descent prevails in solving random constraint satisfaction problems
Venue: arXiv cs.DS 2007
Year: 2007

We study the performance of stochastic local search algorithms for random instances of the $K$-satisfiability ($K$-SAT) problem. We introduce a new stochastic local search algorithm, ChainSAT, which moves in the energy landscape of a problem instance by {\em never going upwards} in energy. ChainSAT is a \emph{focused} algorithm in the sense that it considers only variables occurring in unsatisfied clauses. We show by extensive numerical investigations that ChainSAT and other focused algorithms solve large $K$-SAT instances almost surely in linear time, up to high clause-to-variable ratios $α$; for example, for K=4 we observe linear-time performance well beyond the recently postulated clustering and condensation transitions in the solution space. The performance of ChainSAT is a surprise given that by design the algorithm gets trapped into the first local energy minimum it encounters, yet no such minima are encountered. We also study the geometry of the solution space as accessed by stochastic local search algorithms.
Learning Similarity for Character Recognition and 3D Object Recognition
Venue: arXiv cs.CV 2007
Year: 2007

I describe an approach to similarity motivated by Bayesian methods. This yields a similarity function that is learnable using a standard Bayesian methods. The relationship of the approach to variable kernel and variable metric methods is discussed. The approach is related to variable kernel Experimental results on character recognition and 3D object recognition are presented..
Evolving localizations in reaction-diffusion cellular automata
Venue: arXiv cs.AI 2007
Year: 2007

We consider hexagonal cellular automata with immediate cell neighbourhood and three cell-states. Every cell calculates its next state depending on the integral representation of states in its neighbourhood, i.e. how many neighbours are in each one state. We employ evolutionary algorithms to breed local transition functions that support mobile localizations (gliders), and characterize sets of the functions selected in terms of quasi-chemical systems. Analysis of the set of functions evolved allows to speculate that mobile localizations are likely to emerge in the quasi-chemical systems with limited diffusion of one reagent, a small number of molecules is required for amplification of travelling localizations, and reactions leading to stationary localizations involve relatively equal amount of quasi-chemical species. Techniques developed can be applied in cascading signals in nature-inspired spatially extended computing devices, and phenomenological studies and classification of non-linear discrete systems.
Balancing forward and feedback error correction for erasure channels with unreliable feedback
Venue: arXiv cs.IT 2007
Year: 2007

The traditional information theoretic approach to studying feedback is to consider ideal instantaneous high-rate feedback of the channel outputs to the encoder. This was acceptable in classical work because the results were negative: Shannon pointed out that even perfect feedback often does not improve capacity and in the context of symmetric DMCs, Dobrushin showed that it does not improve the fixed block-coding error exponents in the interesting high rate regime. However, it has recently been shown that perfect feedback does allow great improvements in the asymptotic tradeoff between end-to-end delay and probability of error, even for symmetric channels at high rate. Since gains are claimed with ideal instantaneous feedback, it is natural to wonder whether these improvements remain if the feedback is unreliable or otherwise limited. Here, packet-erasure channels are considered on both the forward and feedback links. First, the feedback channel is considered as a given and a strategy is given to balance forward and feedback error correction in the suitable information-theoretic limit of long end-to-end delays. At high enough rates, perfect-feedback performance is asymptotically attainable despite having only unreliable feedback! Second, the results are interpreted in the zero- sum case of "half-duplex" nodes where the allocation of bandwidth or time to the feedback channel comes at the direct expense of the forward channel. It turns out that even here, feedback is worthwhile since dramatically lower asymptotic delays are possible by appropriately balancing forward and feedback error correction. The results easily generalize to channels with strictly positive zero-undeclared-error capacities.
The price of ignorance: The impact of side-information on delay for lossless source-coding
Venue: arXiv cs.IT 2007
Year: 2007

Inspired by the context of compressing encrypted sources, this paper considers the general tradeoff between rate, end-to-end delay, and probability of error for lossless source coding with side-information. The notion of end-to-end delay is made precise by considering a sequential setting in which source symbols are revealed in real time and need to be reconstructed at the decoder within a certain fixed latency requirement. Upper bounds are derived on the reliability functions with delay when side-information is known only to the decoder as well as when it is also known at the encoder. When the encoder is not ignorant of the side-information (including the trivial case when there is no side-information), it is possible to have substantially better tradeoffs between delay and probability of error at all rates. This shows that there is a fundamental price of ignorance in terms of end-to-end delay when the encoder is not aware of the side information. This effect is not visible if only fixed-block-length codes are considered. In this way, side-information in source-coding plays a role analogous to that of feedback in channel coding. While the theorems in this paper are asymptotic in terms of long delays and low probabilities of error, an example is used to show that the qualitative effects described here are significant even at short and moderate delays.
Cumulative and Averaging Fission of Beliefs
Venue: arXiv cs.AI 2007
Year: 2007

Belief fusion is the principle of combining separate beliefs or bodies of evidence originating from different sources. Depending on the situation to be modelled, different belief fusion methods can be applied. Cumulative and averaging belief fusion is defined for fusing opinions in subjective logic, and for fusing belief functions in general. The principle of fission is the opposite of fusion, namely to eliminate the contribution of a specific belief from an already fused belief, with the purpose of deriving the remaining belief. This paper describes fission of cumulative belief as well as fission of averaging belief in subjective logic. These operators can for example be applied to belief revision in Bayesian belief networks, where the belief contribution of a given evidence source can be determined as a function of a given fused belief and its other contributing beliefs.
About Algorithm for Transformation of Logic Functions (ATLF)
Venue: arXiv cs.LO 2007
Year: 2007

In this article the algorithm for transformation of logic functions which are given by truth tables is considered. The suggested algorithm allows the transformation of many-valued logic functions with the required number of variables and can be looked in this sense as universal.
Undecidable Problems About Timed Automata
Venue: arXiv cs.LO 2007
Year: 2007

We solve some decision problems for timed automata which were recently raised by S. Tripakis in [ Folk Theorems on the Determinization and Minimization of Timed Automata, in the Proceedings of the International Workshop FORMATS'2003, LNCS, Volume 2791, p. 182-188, 2004 ] and by E. Asarin in [ Challenges in Timed Languages, From Applied Theory to Basic Theory, Bulletin of the EATCS, Volume 83, p. 106-120, 2004 ]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular. We show that the problem of the minimization of the number of clocks of a timed automaton is undecidable. It is also undecidable whether the shuffle of two timed regular languages is timed regular. We show that in the case of timed Büchi automata accepting infinite timed words some of these problems are Pi^1_1-hard, hence highly undecidable (located beyond the arithmetical hierarchy).
Hard constraint satisfaction problems have hard gaps at location 1
Venue: arXiv cs.CC 2007
Year: 2007

An instance of Max CSP is a finite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satisfied constraints. Max CSP captures many well-known problems (such as Max k-SAT and Max Cut) and is consequently NP-hard. Thus, it is natural to study how restrictions on the allowed constraint types (or constraint languages) affect the complexity and approximability of Max CSP. The PCP theorem is equivalent to the existence of a constraint language for which Max CSP has a hard gap at location 1, i.e. it is NP-hard to distinguish between satisfiable instances and instances where at most some constant fraction of the constraints are satisfiable. All constraint languages, for which the CSP problem (i.e., the problem of deciding whether all constraints can be satisfied) is currently known to be NP-hard, have a certain algebraic property. We prove that any constraint language with this algebraic property makes Max CSP have a hard gap at location 1 which, in particular, implies that such problems cannot have a PTAS unless P = NP. We then apply this result to Max CSP restricted to a single constraint type; this class of problems contains, for instance, Max Cut and Max DiCut. Assuming P $\neq$ NP, we show that such problems do not admit PTAS except in some trivial cases. Our results hold even if the number of occurrences of each variable is bounded by a constant. We use these results to partially answer open questions and strengthen results by Engebretsen et al. [Theor. Comput. Sci., 312 (2004), pp. 17--45], Feder et al. [Discrete Math., 307 (2007), pp. 386--392], Krokhin and Larose [Proc. Principles and Practice of Constraint Programming (2005), pp. 388--402], and Jonsson and Krokhin [J. Comput. System Sci., 73 (2007), pp. 691--702]
A Web-based System for Observing and Analyzing Computer Mediated Communications
Venue: arXiv cs.HC 2007
Year: 2007

Tracking data of user's activities resulting from Computer Mediated Communication (CMC) tools (forum, chat, etc.) is often carried out in an ad-hoc manner, which either confines the reusability of data in different purposes or makes data exploitation difficult. Our research works are biased toward methodological challenges involved in designing and developing a generic system for tracking user's activities while interacting with asynchronous communication tools like discussion forums. We present in this paper, an approach for building a Web-based system for observing and analyzing user activity on any type of discussion forums.
Distribution of Edge Load in Scale-free Trees
Venue: arXiv cs.NI 2007
Year: 2007

Node betweenness has been studied recently by a number of authors, but until now less attention has been paid to edge betweenness. In this paper, we present an exact analytic study of edge betweenness in evolving scale-free and non-scale-free trees. We aim at the probability distribution of edge betweenness under the condition that a local property, the in-degree of the ``younger'' node of a randomly selected edge, is known. En route to the conditional distribution of edge betweenness the exact joint distribution of cluster size and in-degree, and its one dimensional marginal distributions have been presented in the paper as well. From the derived probability distributions the expectation values of different quantities have been calculated. Our results provide an exact solution not only for infinite, but for finite networks as well.
VoIP over Multiple IEEE 802.11 Wireless LANs
Venue: arXiv cs.NI 2007
Year: 2007

Prior work indicates that 802.11 is extremely inefficient for VoIP transport. Only 12 and 60 VoIP sessions can be supported in an 802.11b and an 802.11g WLAN, respectively. This paper shows that the bad news does not stop there. When there are multiple WLANs in the vicinity of each other, the already-low VoIP capacity can be further eroded in a significant manner. For example, in a 5-by-5, 25-cell multi-WLAN network, the VoIP capacities for 802.11b and 802.11g are only 1.63 and 10.34 sessions per AP, respectively. This paper investigates several solutions to improve the VoIP capacity. Based on a conflict graph model, we propose a clique-analytical call-admission scheme, which increases the VoIP capacity by 52% and 37% in 802.11b and 802.11g respectively. If all the three orthogonal frequency channels available in 11b and 11g are used, the capacity can be nearly tripled by the call-admission scheme. This paper also proposes for the first time the use of coarse-grained time-division multiple access (CoTDMA) in conjunction with the basic 802.11 CSMA to eliminate the performance-degrading exposed-node and hidden-node problems. We find that CoTDMA can further increase the VoIP capacity in the multi-WLAN scenario by an additional 35%.