On properties not inherited by monoids from their Schützenberger groups

We give an example of a monoid with finitely many left and right ideals, all of whose Schützenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does not have finite derivation type, and therefore does not admit a presentation by a finite complete rewriting system. The example also serves as a counterexample to several other natural questions regarding complete rewriting systems and finite derivation type. Specifically it allows us to construct two finitely generated monoids M and N with isometric Cayley graphs, where N has finite derivation type (respectively, admits a presentation by a finite complete rewriting system) but M does not. This contrasts with the case of finitely generated groups for which finite derivation type is known to be a quasi-isometry invariant. The same example is also used to show that neither of these two properties is preserved under finite Green index extensions.     

STRINGVACUA. A Mathematica package for studying vacuum configurations in string phenomenology

We give a simple tutorial introduction to the Mathematica package STRINGVACUA, which is designed to find vacua of string-derived or inspired four-dimensional N=1 supergravities. The package uses powerful algebro-geometric methods, as implemented in the free computer algebra system Singular, but requires no knowledge of the mathematics upon which it is based. A series of easy-to-use Mathematica modules are provided which can be used both in string theory and in more general applications requiring fast polynomial computations. The use of these modules is illustrated throughout with simple examples.

Program summary

Program title: STRINGVACUACatalogue identifier: AEBZ_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEBZ_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: GNU GPLNo. of lines in distributed program, including test data, etc.: 31 050No. of bytes in distributed program, including test data, etc.: 163 832Distribution format: tar.gzProgramming language: “Mathematica” syntaxComputer: Home and office spec desktop and laptop machines, networked or stand aloneOperating system: Windows XP (with Cygwin), Linux, Mac OS, running Mathematica V5 or aboveRAM: Varies greatly depending on calculation to be performedClassification: 11.1External routines: Linux: The program “Singular” is called from Mathematica. Windows: “Singular” is called within the Cygwin environment from Mathematica.Nature of problem: A central problem of string-phenomenology is to find stable vacua in the four-dimensional effective theories which result from compactification.Solution method: We present an algorithmic method, which uses techniques of algebraic geometry, to find all of the vacua of any given string-phenomenological system in a huge class.Running time: Varies greatly depending on calculation requested.     

An Architecture for Human‐Guided Autonomy: Team TROOPER at the DARPA Robotics Challenge Finals

Recent robotics efforts have automated simple, repetitive tasks to increase execution speed and lessen an operator's cognitive load, allowing them to focus on higher‐level objectives. However, an autonomous system will eventually encounter something unexpected, and if this exceeds the tolerance of automated solutions, there must be a way to fall back to teleoperation. Our solution is a largely autonomous system with the ability to determine when it is necessary to ask a human operator for guidance. We call this approach human‐guided autonomy. Our design emphasizes human‐on‐the‐loop control where an operator expresses a desired high‐level goal for which the reasoning component assembles an appropriate chain of subtasks. We introduce our work in the context of the DARPA Robotics Challenge (DRC) Finals. We describe the software architecture Team TROOPER developed and used to control an Atlas humanoid robot. We employ perception, planning, and control automation for execution of subtasks. If subtasks fail, or if changing environmental conditions invalidate the planned subtasks, the system automatically generates a new task chain. The operator is able to intervene at any stage of execution, to provide input and adjustment to any control layer, enabling operator involvement to increase as confidence in automation decreases. We present our performance at the DRC Finals and a discussion about lessons learned.     

A Faà di Bruno Hopf algebra for a group of Fliess operators with applications to feedback

A Faà di Bruno type Hopf algebra is developed for a group of integral operators known as Fliess operators, where operator composition is the group product. Such operators are normally written in terms of generating series over a noncommutative alphabet. Using a general series expansion for the antipode, an explicit formula for the generating series of the compositional inverse operator is derived. The result is applied to analytic nonlinear feedback systems to produce an explicit formula for the feedback product, that is, the generating series for the Fliess operator representation of the closed-loop system written in terms of the generating series of the Fliess operator component systems. This formula is employed to provide a proof that local convergence is preserved under feedback.     

Nonparametric supervised learning by linear interpolation with maximum entropy

Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of a test point. We propose and explore the behavior of a learning algorithm that uses linear interpolation and the principle of maximum entropy (LIME). We consider some theoretical properties of the LIME algorithm: LIME weights have exponential form; the estimates are consistent; and the estimates are robust to additive noise. In relation to bias reduction, we show that near-neighbors contain a test point in their convex hull asymptotically. The common linear interpolation solution used for regression on grids or look-up-tables is shown to solve a related maximum entropy problem. LIME simulation results support use of the method, and performance on a pipeline integrity classification problem demonstrates that the proposed algorithm has practical value.     

TreePlus: interactive exploration of networks with enhanced tree layouts

Despite extensive research, it is still difficult to produce effective interactive layouts for large graphs. Dense layout and occlusion make food Webs, ontologies and social networks difficult to understand and interact with. We propose a new interactive visual analytics component called TreePlus that is based on a tree-style layout. TreePlus reveals the missing graph structure with visualization and interaction while maintaining good readability. To support exploration of the local structure of the graph and gathering of information from the extensive reading of labels, we use a guiding metaphor of "plant a seed and watch it grow." It allows users to start with a node and expand the graph as needed, which complements the classic overview techniques that can be effective at (but often limited to) revealing clusters. We describe our design goals, describe the interface and report on a controlled user study with 28 participants comparing TreePlus with a traditional graph interface for six tasks. In general, the advantage of TreePlus over the traditional interface increased as the density of the displayed data increased. Participants also reported higher levels of confidence in their answers with TreePlus and most of them preferred TreePlus     

Unsupervised multiresolution segmentation for images with low depthof field

Unsupervised segmentation of images with low depth of field (DOF) is highly useful in various applications. This paper describes a novel multiresolution image segmentation algorithm for low DOF images. The algorithm is designed to separate a sharply focused object-of-interest from other foreground or background objects. The algorithm is fully automatic in that all parameters are image independent. A multi-scale approach based on high frequency wavelet coefficients and their statistics is used to perform context-dependent classification of individual blocks of the image. Unlike other edge-based approaches, our algorithm does not rely on the process of connecting object boundaries. The algorithm has achieved high accuracy when tested on more than 100 low DOF images, many with inhomogeneous foreground or background distractions. Compared with he state of the art algorithms, this new algorithm provides better accuracy at higher speed     

Chlorpropamide-induced hypoglycemia: successful treatment with diazoxide

A healthy adolescent boy was treated on two occasions for an overdose of chlorpropamide (Diabinese). Glucose therapy alone was not sufficient to control the hypoglycemia, but the administration of glucose plus diazoxide raised the blood sugar to supranormal levels. A bolus of intravenous glucagon briefly raised the blood sugar level to within normal limits, increased the blood ketones but also augmented insulin secretion. An overdose of sulfonylurea may cause prolonged and fatal hypoglycemia. Rational therapy, both in diabetic and normal persons, is glucose plus an "insulin antagonist." The administration of diazoxide was effective in our patient, substantially reducing the plasma insulin level; this agent may be the "insulin-antagonist" of choice for use in sulfonylurea-induced hypoglycemia.     

Photocatalytic effect of carbon-modified n-TiO2 nanoparticles under visible light illumination

The present research focused on wet process synthesis of visible light active carbon-modified (CM)-n-TiO₂ nanoparticles and their photocatalytic activity. The CM-n-TiO₂ was synthesized by hydrolysis of TiCl₄ in the presence of tetrabutylammonium hydroxide and also in the presence of glucose and sodium hydroxide. UV–vis spectra, X-ray diffraction (XRD), and FT-IR were used to characterize these photocatalysts. It was found that the CM-n-TiO₂ nanoparticles synthesized by hydrolysis with tetrabutylammonium hydroxide or with sodium hydroxide and glucose when subjected to extended aging and subsequent calcinations absorb well into the visible to near infrared region up to 800 nm and exhibit enhanced visible light photocatalytic activity on degradation of 4-chlorophenol. CM-n-TiO₂ synthesized using glucose as the carbon source generated 13-fold increase in the initial rate of photodegradation of 4-chlorophenol compared to those by regular n-TiO₂, whereas, it increased only eight-fold when tetrabutylammonium hydroxide was used as the carbon source.     

Load combination analysis by ‘Directional simulation in the load space’

The reliability of structures subjected to multiple time-varying random loads is considered herein. It is well-known that the reliability of such systems may be evaluated by considering outcrossings of the load process vector out of a safe domain, and the contribution of individual loads to structural failure may be evaluated by considering outcrossings caused by combinations of one or more loads. In this paper the ‘Directional Simulation in the Load Space’ approach to reliability analysis is developed to consider explicitly outcrossings caused by all possible combinations of loads, during analysis of systems comprising stationary continuous Gaussian loads. To do this, the direction of the load process vector is ‘fixed’ at each point of outcrossing (to physically represent the particular combination of loads causing the outcrossing), and, by considering each possible load combination, all loads not causing an outcrossing are then held constant during radial integration (to model correctly that they do not contribute to each outcrossing). A numerical example demonstrating the validity of the proposed formulation is presented.