Flatness-Based Control of a Single Qubit Gate

This work considers the open-loop control problem of steering a two-level quantum system from any initial to any final condition. The model of this system evolves on the state space , having two inputs that correspond to the complex amplitude of a resonant laser field. A symmetry preserving flat output is constructed using a fully geometric construction and quaternion computations. Simulation results of this flatness-based open-loop control are provided.     

Performance bounds in linear control of unstable MIMO systems with pole location constraint

This paper proposes a methodology to compute quadratic performance bounds when the closed loop poles of a discrete-time multivariable control loop are confined to a disk, centred at the origin, and with radius less than one. The underlying philosophy in this constraint is to avoid certain undesirable dynamic features which arise in quadratic optimal designs. An expression for the performance loss due to the pole location constraint is also provided. Using numerical examples, we show that the performance loss is compensated by an improved transient performance, specially visible in the control signals.     

Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem

In this paper we study the coordination of different activities in a supply chain issued from a real case. Multiple suppliers send raw materials (RMs) to a distribution center (DC) that delivers them to a unique plant where the storage of the RMs and the finished goods is not possible. Then, the finished goods are directly shipped to multiple customers having just‐in‐time (JIT) demands. Under these hypotheses, we show that the problem can be reduced to multiple suppliers and one DC. Afterwards, we analyze two cases; in the first, we consider an uncapacitated storage at DC, and in the second, we analyze the capacitated storage case. For the first case, we show that the problem is NP‐hard in the ordinary sense using the Knapsack decision problem. We then propose two exact methods: a mixed integer linear program (MILP) and a pseudopolynomial dynamic program. A classical dynamic program and an improved one using the idea of Shaw and Wagelmans are given. With numerical tests we show that the dynamic program gives the optimal solution in reasonable time for quite large instances compared with the MILP. For the second case, the capacity limitation in DC is assumed, which makes the problem solving more challenging. We propose an MILP and a dynamic programming‐based heuristic that provides solutions close to the optimal solution in very short times.     

Interpretation of MR images using self-organizing maps and knowledge-based expert systems

A new image segmentation system is presented to automatically segment and label brain magnetic resonance (MR) images to show normal and abnormal brain tissues using self-organizing maps (SOM) and knowledge-based expert systems. Elements of a feature vector are formed by image intensities, first-order features, texture features extracted from gray-level co-occurrence matrix and multiscale features. This feature vector is used as an input to the SOM. SOM is used to over segment images and a knowledge-based expert system is used to join and label the segments. Spatial distributions of segments extracted from the SOM are also considered as well as gray level properties. Segments are labeled as background, skull, white matter, gray matter, cerebrospinal fluid (CSF) and suspicious regions.     

Avatar mobility in user-created networked virtual worlds: measurements, analysis, and implications

We collected mobility traces of avatars spanning multiple regions in Second Life, a popular user-created virtual world. We analyzed the traces to characterize the dynamics of the avatars’ mobility and behavior, both temporally and spatially. We discuss the implications of our findings on the design of peer-to-peer architecture, interest management, mobility modeling of avatars, server load balancing and zone partitioning, caching, and prefetching for user-created virtual worlds.     

A Genre-Aware Approach to Focused Crawling

Focused crawlers have as their main goal to crawl Web pages that are relevant to a specific topic or user interest, playing an important role for a great variety of applications. In general, they work by trying to find and crawl all kinds of pages deemed as related to an implicitly declared topic. However, users are often not simply interested in any document about a topic, but instead they may want only documents of a given type or genre on that topic to be retrieved. In this article, we describe an approach to focused crawling that exploits not only content-related information but also genre information present in Web pages to guide the crawling process. This approach has been designed to address situations in which the specific topic of interest can be expressed by specifying two sets of terms, the first describing genre aspects of the desired pages and the second related to the subject or content of these pages, thus requiring no training or any kind of preprocessing. The effectiveness, efficiency and scalability of the proposed approach are demonstrated by a set of experiments involving the crawling of pages related to syllabi of computer science courses, job offers in the computer science field and sale offers of computer equipments. These experiments show that focused crawlers constructed according to our genre-aware approach achieve levels of F1 superior to 88%, requiring the analysis of no more than 65% of the visited pages in order to find 90% of the relevant pages. In addition, we experimentally analyze the impact of term selection on our approach and evaluate a proposed strategy for semi-automatic generation of such terms. This analysis shows that a small set of terms selected by an expert or a set of terms specified by a typical user familiar with the topic is usually enough to produce good results and that such a semi-automatic strategy is very effective in supporting the task of selecting the sets of terms required to guide a crawling process.     

New insights into the morphology of Trypanosoma cruzi reservosome

Reservosomes are late endosomes present only in members of the Schizotrypanum subgenus of the Trypanosoma genus and are defined as the site of storage of endocytosed macromolecules and lysosomal enzymes. They have been extensively described in Trypanosoma cruzi epimastigote: are bounded by a membrane unit, present an electron-dense protein matrix with electron-lucent lipid inclusions, being devoid of inner membranes. Here we performed a detailed ultrastructural analysis of these organelles using a variety of electron microscopy techniques, including ultrathin sectioning, uranyl acetate stained preparations, and freeze fracture, either in intact epimastigotes or in isolated reservosomes. New informations were obtained. First, both isolated and in situ reservosomes presented small profiles of inner membranes that are morphologically similar to the membrane surrounding the organelle. In uranyl acetate stained preparations, internal membrane profiles turned out to be longer than they appeared in ultrathin section images and traversed the organelle diameter. Internal vesicles were also found. Second, endocytosed cargo are not associated with internal vesicles and reach reservosomes on board of vesicles that fuse with the boundary membrane, delivering cargo directly into reservosome lumen. Third, electron-lucent bodies with saturated lipid core surrounded by a membrane monolayer and with unusual rectangular shape were also observed. Fourth, it was possible to demonstrate the presence of intramembranous particles on the E face of both internal vesicles and the surrounding membrane. Collectively, these results indicate that reservosomes have a complex internal structure, which may correlate with their multiple functions.     

Simple tests for multi-criteria optimality

In this paper we present two tests which can decide whether a given pointx ₀ ^N is locally efficient or not with respect to a given finite set of real valued continuously differentiable functions defined on ^N . Examples indicate that the tests may fail on a nowhere dense set.     

Extreme-ultraviolet interferometry at 15.5 nm using multilayer optics

The development of multilayer mirror technology capable of operating in the range of 3-30 nm and the construction of thin membranes with excellent uniformity and strength have made it possible to design and implement a Mach-Zehnder interferometer operating at 15.5 nm. We have tested this interferometer by using a soft x-ray laser as a source, and we show its use in probing high-density plasmas.