Applications of Linear Programming to Coding Theory

Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem. In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such vectors are known as pseudocodewords. In this work, we completely classify the set of linear programming pseudocodewords for the family of cycle codes. For the case of the binary symmetric channel, another approximation of maximum-likelihood decoding was introduced by Omura in 1972. This decoder employs an iterative algorithm whose behavior closely mimics that of the simplex algorithm. We generalize Omura's decoder to operate on any binary-input memoryless channel, thus obtaining a soft-decision decoding algorithm. Further, we prove that the probability of the generalized algorithm returning the maximum-likelihood codeword approaches 1 as the number of iterations goes to infinity.

Programming peculiarities in two cochlear implant users with superficial siderosis of the central nervous system

To report the audiological outcomes of cochlear implantation in two patients with severe to profound sensorineural hearing loss secondary to superficial siderosis of the CNS and discuss some programming peculiarities that were found in these cases. Retrospective review. Data concerning clinical presentation, diagnosis and audiological assessment pre- and post-implantation were collected of two patients with superficial siderosis of the CNS. Both patients showed good hearing thresholds but variable speech perception outcomes. One patient did not achieve open-set speech recognition, but the other achieved 70% speech recognition in quiet. Electrical compound action potentials could not be elicited in either patient. Map parameters showed the need for increased charge. Electrode impedances showed high longitudinal variability. The implants were fairly beneficial in restoring hearing and improving communication abilities although many reprogramming sessions have been required. The hurdle in programming was the need of frequent adjustments due to the physiologic variations in electrical discharges and neural conduction, besides the changes in the impedances. Patients diagnosed with superficial siderosis may achieve limited results in speech perception scores due to both cochlear and retrocochlear reasons. Careful counseling about the results must be given to the patients and their families before the cochlear implantation indication.

The effect of a Lucia jig for 30 minutes on neuromuscular re-programming, in normal subjects

The Lucia jig is a technique that promotes neuromuscular reprogramming of the masticatory system and allows the stabilization of the mandible without the interference of dental contacts, maintaining the mandible position in harmonic condition with the musculature in normal subjects or in patients with temporomandibular dysfunction (TMD). This study aimed to electromyographically analyze the activity (RMS) of the masseter and temporal muscles in normal subjects (control group) during the use of an anterior programming device, the Lucia jig, in place for 0, 5, 10, 20 and 30 minutes to demonstrate its effect on the stomatognathic system. Forty-two healthy dentate individuals (aged 21 to 40 years) with normal occlusion and without parafunctional habits or ternporomandibular dysfunction (RDC/TMD) were evaluated on the basis of the electromyographic activity of the masseter and temporal muscles before placement of a neuromuscular re-programming device, the Lucia jig, on the upper central incisors. There were no statistically significant differences (p < 0.05) in the electromyographic activity of the masticatory muscles in the different time periods. The Lucia jig changed the electromyographic activity by promoting a neuromuscular reprogramming. In most of the time periods, it decreased the activation of the masticatory muscles, showing that this device has wide applicability in dentistry. The use of a Lucia jig over 0, 5, 10, 15, 20 and 30 minutes did not promote any statistically significant increase in muscle activity despite differences in the data, thus showing that this intra-oral device can be used in dentistry.

Implications of maternal nutrient restriction in transgenerational programming of hypertension and endothelial dysfunction across F1-F3 offspring

Aims: An extensive variety of prenatal insults are associated with an increased incidence of metabolic and cardiovascular disorders in adult life. We previously demonstrated that maternal global nutrient restriction during pregnancy leads to increased blood pressure and endothelial dysfunction in the adult offspring. This study aimed to assess whether prenatal exposure to nutritional insult has transgenerational effects in F-2 and F-3 offspring. Main methods: For this, female Wistar rats were randomly divided into two groups on day 1 of pregnancy: a control group fed standard chow ad libitum and a restricted group fed 50% of the ad libitum intake throughout gestation. At delivery, all animals were fed a standard laboratory chow diet. At 11 weeks of age, one female and one male from each restricted litter were randomly selected and mated with rats from another restricted litters in order to generate the F-2 offspring. The same procedure produced F-3 generation. Similarly, the rats in the control group were bred for each generation. Key Findings: Our findings show that the deleterious effects of maternal nutrient restriction to which the F-0 mothers were exposed may not be limited to the male first generation. In fact, we found that elevated blood pressure, an impaired vasodilatory response to acetylcholine and alterations in NO production were all transferred to the subsequent males from F-2 and F-3 generations. Significance: Our data show that global nutrient restriction during pregnancy results in a specific phenotype that can be passed transgenerationally to a second and third generation. (c) 2012 Elsevier Inc. All rights reserved.

Cochlear Implantation Via the Middle Fossa Approach: Surgical and Programming Considerations

Objectives: To report the results of cochlear implantation via the middle fossa approach in 4 patients, discuss the complications, and present a detailed description of the programming specifications in these cases. Study Design: Retrospective case review. Setting: Tertiary-care referral center with a well-established cochlear implant program. Patients: Four patients with bilateral canal wall down mastoid cavities who underwent the middle fossa approach for cochlear implantation. Interventions: Cochlear implantation and subsequent rehabilitation. A middle fossa approach with cochleostomy was successfully performed on the most superficial part of the apical turn in 4 patients. A Nucleus 24 cochlear implant system was used in 3 patients and a MED-EL Sonata Medium device in 1 patient. The single electrode array was inserted through a cochleostomy from the cochlear apex and occupied the apical, middle, and basal turns. Telemetry and intraoperative impedance recordings were performed at the end of surgery. A CT scan of the temporal bones was performed to document electrode insertion for all of the patients. Main Outcome Measures: Complications, hearing thresholds, and speech perception outcomes were evaluated. Results: Neural response telemetry showed present responses in all but 1 patient, who demonstrated facial nerve stimulation during the test. Open-set speech perception varied from 30% to 100%, despite the frequency allocation order of the MAP. Conclusion: Cochlear implantation via the middle cranial fossa is a safe approach, although it is a challenging procedure, even for experienced surgeons.

An integer linear programming approach for bilinear integer programming

We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear P. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems. (C) 2011 Elsevier B.V. All rights reserved.

Multiobjective Biogeography-Based Optimization Based on Predator-Prey Approach

Biogeography is the science that studies the geographical distribution and the migration of species in an ecosystem. Biogeography-based optimization (BBO) is a recently developed global optimization algorithm as a generalization of biogeography to evolutionary algorithm and has shown its ability to solve complex optimization problems. BBO employs a migration operator to share information between the problem solutions. The problem solutions are identified as habitat, and the sharing of features is called migration. In this paper, a multiobjective BBO, combined with a predator-prey (PPBBO) approach, is proposed and validated in the constrained design of a brushless dc wheel motor. The results demonstrated that the proposed PPBBO approach converged to promising solutions in terms of quality and dominance when compared with the classical BBO in a multiobjective version.

Multiobjective engineering design optimization problems: a sensitivity analysis approach

This paper proposes two new approaches for the sensitivity analysis of multiobjective design optimization problems whose performance functions are highly susceptible to small variations in the design variables and/or design environment parameters. In both methods, the less sensitive design alternatives are preferred over others during the multiobjective optimization process. While taking the first approach, the designer chooses the design variable and/or parameter that causes uncertainties. The designer then associates a robustness index with each design alternative and adds each index as an objective function in the optimization problem. For the second approach, the designer must know, a priori, the interval of variation in the design variables or in the design environment parameters, because the designer will be accepting the interval of variation in the objective functions. The second method does not require any law of probability distribution of uncontrollable variations. Finally, the authors give two illustrative examples to highlight the contributions of the paper.

CoolBOT: a component-oriented programming framework for robotics

[EN] Programming software for controlling robotic systems in order to built working systems that perform adequately according to their design requirements remains being a task that requires an important development effort. Currently, there are no clear programming paradigms for programming robotic systems, and the programming techniques which are of common use today are not adequate to deal with the complexity associated with these systems. The work presented in this document describes a programming tool, concretely a framework, that must be considered as a first step to devise a tool for dealing with the complexity present in robotics systems. In this framework the software that controls a system is viewed as a dynamic network of units of execution inter-connected by means of data paths. Each one of these units of execution, called a component, is a port automaton which provides a given functionality, hidden behind an external interface specifying clearly which data it needs and which data it produces. Components, once defined and built, may be instantiated, integrated and used as many times as needed in other systems. The framework provides the infrastructure necessary to support this concept for components and the inter communication between them by means of data paths (port connections) which can be established and de-established dynamically. Moreover, and considering that the more robust components that conform a system are, the more robust the system is, the framework provides the necessary infrastructure to control and monitor the components than integrate a system at any given instant of time.

A Virtual Programming Lab for Moodle with automatic assessment and anti-plagiarism features

[EN] This paper describes VPL, a Virtual Programming Lab module for Moodle, developed at the University of Las Palmas of Gran Canaria (ULPGC) and released for free uses under GNU/GPL license. For the students, it is a simple development environment with auto evaluation capabilities. For the instructors, it is a students' work management system, with features to facilitate the preparation of assignments, manage the submissions, check for plagiarism, and do assessments with the aid of powerful and flexible assessment tools based on program testing, all of that being independent of the programming language used for the assignments and taken into account critical security issues.

Multiobjective genetic algorithms applied to heat transfer problems

In the present work, the multi-objective optimization by genetic algorithms is investigated and applied to heat transfer problems. Firstly, the work aims to compare different reproduction processes employed by genetic algorithms and two new promising processes are suggested. Secondly, in this work two heat transfer problems are studied under the multi-objective point of view. Specifically, the two cases studied are the wavy fins and the corrugated wall channel. Both these cases have already been studied by a single objective optimizer. Therefore, this work aims to extend the previous works in a more comprehensive study.

Application-oriented Mixed Integer Non-Linear Programming

In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the real-world can be modeled as an MINLP problem; (iii) the challenging nature of this very general class of problems. It is well-known that MINLP problems are NP-hard because they are the generalization of MILP problems, which are NP-hard themselves. However, MINLPs are, in general, also hard to solve in practice. We address to non-convex MINLPs, i.e. having non-convex continuous relaxations: the presence of non-convexities in the model makes these problems usually even harder to solve. The aim of this Ph.D. thesis is to give a flavor of different possible approaches that one can study to attack MINLP problems with non-convexities, with a special attention to real-world problems. In Part 1 of the thesis we introduce the problem and present three special cases of general MINLPs and the most common methods used to solve them. These techniques play a fundamental role in the resolution of general MINLP problems. Then we describe algorithms addressing general MINLPs. Parts 2 and 3 contain the main contributions of the Ph.D. thesis. In particular, in Part 2 four different methods aimed at solving different classes of MINLP problems are presented. Part 3 of the thesis is devoted to real-world applications: two different problems and approaches to MINLPs are presented, namely Scheduling and Unit Commitment for Hydro-Plants and Water Network Design problems. The results show that each of these different methods has advantages and disadvantages. Thus, typically the method to be adopted to solve a real-world problem should be tailored on the characteristics, structure and size of the problem. Part 4 of the thesis consists of a brief review on tools commonly used for general MINLP problems, constituted an integral part of the development of this Ph.D. thesis (especially the use and development of open-source software). We present the main characteristics of solvers for each special case of MINLP.