Presentations of constrained systems with unconstrained positions

International audienceWe give a polynomial-time construction of the set of sequences that satisfy a finite-memory constraint defined by a finite list of forbidden blocks, with a specified set of bit positions unconstrained. Such a construction can be used to build modulation/error-correction codes (ECC codes) like the ones defined by the Immink-Wijngaarden scheme in which certain bit positions are reserved for ECC parity. We give a lineartime construction of a finite-state presentation of a constrained system defined by a periodic list of forbidden blocks. These systems, called periodic-finite-type systems, were introduced by Moision and Siegel. Finally, we present a linear-time algorithm for constructing the minimal periodic forbidden blocks of a finite sequence for a given period

Coding for the Optical Channel: the Ghost-Pulse Constraint

We consider a number of constrained coding techniques that can be used to mitigate a nonlinear effect in the optical fiber channel that causes the formation of spurious pulses, called ``ghost pulses.'' Specifically, if $b_1 b_2 ... b_{n}$ is a sequence of bits sent across an optical channel, such that $b_k=b_l=b_m=1$ for some $k,l,m$ (not necessarily all distinct) but $b_{k+l-m} = 0$, then the ghost-pulse effect causes $b_{k+l-m}$ to change to 1, thereby creating an error. We design and analyze several coding schemes using binary and ternary sequences constrained so as to avoid patterns that give rise to ghost pulses. We also discuss the design of encoders and decoders for these coding schemes.Comment: 13 pages, 6 figures; accepted for publication in IEEE Transactions on Information Theor

On Virtual Displacement and Virtual Work in Lagrangian Dynamics

The confusion and ambiguity encountered by students, in understanding virtual displacement and virtual work, is discussed in this article. A definition of virtual displacement is presented that allows one to express them explicitly for holonomic (velocity independent), non-holonomic (velocity dependent), scleronomous (time independent) and rheonomous (time dependent) constraints. It is observed that for holonomic, scleronomous constraints, the virtual displacements are the displacements allowed by the constraints. However, this is not so for a general class of constraints. For simple physical systems, it is shown that, the work done by the constraint forces on virtual displacements is zero. This motivates Lagrange's extension of d'Alembert's principle to system of particles in constrained motion. However a similar zero work principle does not hold for the allowed displacements. It is also demonstrated that d'Alembert's principle of zero virtual work is necessary for the solvability of a constrained mechanical problem. We identify this special class of constraints, physically realized and solvable, as {\it the ideal constraints}. The concept of virtual displacement and the principle of zero virtual work by constraint forces are central to both Lagrange's method of undetermined multipliers, and Lagrange's equations in generalized coordinates.Comment: 12 pages, 10 figures. This article is based on an earlier article physics/0410123. It includes new figures, equations and logical conten

Simonsenia aveniformis sp nov (Bacillariophyceae), molecular phylogeny and systematics of the genus, and a new type of canal raphe system

The genus Simonsenia is reviewed and S. aveniformis described as new for science by light and electron microscopy. The new species originated from estuarine environments in southern Iberia (Atlantic coast) and was isolated into culture. In LM, Simonsenia resembles Nitzschia, with bridges (fibulae) beneath the raphe, which is marginal. It is only electron microscope (EM) examination that reveals the true structure of the raphe system, which consists of a raphe canal raised on a keel (wing), supported by rib like braces (fenestral bars) and tube-like portulae; between the portulae the keel is perforated by open windows (fenestrae). Based on the presence of portulae and a fenestrated keel, Simonsenia has been proposed to be intermediate between Bacillariaceae and Surirellaceae. However, an rbcL phylogeny revealed that Simonsenia belongs firmly in the Bacillariaceae, with which it shares a similar chloroplast arrangement, rather than in the Surirellaceae. Lack of homology between the surirelloid and simonsenioid keels is reflected in subtle differences in the morphology and ontogeny of the portulae and fenestrae. The diversity of Simonsenia has probably been underestimated, particularly in the marine environment.Polish National Science Centre in Cracow within the Maestro program [N 2012/04/A/ST10/00544]; Sciences and Technologies Foundation-FCT (Portugal) [SFRH/BD/62405/2009]info:eu-repo/semantics/publishedVersio

Adaptive Rich Media Presentations via Preference-Based Constrained Optimization

Personalization and adaptation of multi-media messages are well known and well studied problems. Ideally, each message should reflect its recipient\u27s interests, device capabilities, and network conditions. Such personalization is more difficult to carry out given a compound multi-media presentation containing multiple spatially and temporally related elements. This paper describes a novel formal, yet practical approach, and an implemented system prototype for authoring and adapting compound multi-media presentations. Our approach builds on recent advances in preference specification and preferences-based constrained optimization techniques

Dagstuhl Reports : Volume 1, Issue 2, February 2011

Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn

Content Placement in Cache-Enabled Sub-6 GHz and Millimeter-Wave Multi-antenna Dense Small Cell Networks

This paper studies the performance of cache-enabled dense small cell networks consisting of multi-antenna sub-6 GHz and millimeter-wave base stations. Different from the existing works which only consider a single antenna at each base station, the optimal content placement is unknown when the base stations have multiple antennas. We first derive the successful content delivery probability by accounting for the key channel features at sub-6 GHz and mmWave frequencies. The maximization of the successful content delivery probability is a challenging problem. To tackle it, we first propose a constrained cross-entropy algorithm which achieves the near-optimal solution with moderate complexity. We then develop another simple yet effective heuristic probabilistic content placement scheme, termed two-stair algorithm, which strikes a balance between caching the most popular contents and achieving content diversity. Numerical results demonstrate the superior performance of the constrained cross-entropy method and that the two-stair algorithm yields significantly better performance than only caching the most popular contents. The comparisons between the sub-6 GHz and mmWave systems reveal an interesting tradeoff between caching capacity and density for the mmWave system to achieve similar performance as the sub-6 GHz system.Comment: 14 pages; Accepted to appear in IEEE Transactions on Wireless Communication