Fast Lighting Independent Background Subtraction

This paper describes a simple method of fast background subtraction based upon disparity verification that is invariant to arbitrarily rapid run-time changes in illumination. Using two or more cameras, the method requires the off-line construction of disparity fields mapping the primary background images. At runtime, segmentation is performed by checking background image to each of the additional auxiliary color intensity values at corresponding pixels. If more than two cameras are available, more robust segmentation can be achieved and, in particular, the occlusion shadows can be generally eliminated as well. Because the method only assumes fixed background geometry, the technique allows for illumination variation at runtime. Since no disparity search is performed, the algorithm is easily implemented in real-time on conventional hardware.     

电力电子和未来的航海电气系统(上)

明天的航海电气系统将同今天的系统有极大的不同。电力电子给予船舶上包括推进、电力分配、备用电源、声纳和雷达等在内的各种系统的进展以重要的影响。刚刚出现的新材料、新器件和新的系统概念(诸如宽带半导体材料、碳化硅基的电力半导体器件、电力电子模组(PEBB),以及集成功率系统)正在使、并将持续地使未来的航海系统有别于今天的系统,如同内燃船舶有别于蒸汽船舶。但是,这些正在实现的技术和有关概念还未被大家所周知,而且还有难于理解的地方。本文就将介绍这些新概念和新技术,指出潜在的影响力,并揭示新的设计方法,以推动航海电气系统的发展。     

AN ASYMPTOTIC SECOND‐ORDER SMOOTH SLIDING MODE CONTROL

Presented is a method of smooth sliding mode control design to provide for an asymptotic second‐order sliding mode on the selected sliding surface. The control law is a nonlinear dynamic feedback that in absence of unknown disturbances provides for an asymptotic second‐order sliding mode. Application of the second‐order disturbance observer in a combination with the proposed continuous control law practically gives the second‐order sliding accuracy in presence of unknown disturbances and discrete‐time control update. The piecewise constant control feedback is “smooth” in the sense that its derivative numerically taken at sampling rate does not contain high frequency components. A numerical example is presented.     

A time-predefined local search approach to exam timetabling problems

In recent years the processing speed of computers has increased dramatically. This in turn has allowed search algorithms to execute more iterations in a given amount of real-time. Does this necessarily always lead to an improvement in the quality of final solutions? This paper is devoted to the investigation of that question. We present two variants of local search where the search time can be set as an input parameter. These two approaches are: a time-predefined variant of simulated annealing and an adaptation of the “great deluge” method. We present a comprehensive series of experiments which show that these approaches significantly outperform the previous best results (in terms of solution quality) on a range of benchmark exam timetabling problems. Of course, there is a price to pay for such better results: increased execution time. We discuss the impact of this trade-off between quality and execution time. In particular we discuss issues involving the proper estimation of the algorithm's execution time and the assessment of its importance.     

Generalized notions of mind change complexity

Gold introduced the notion of learning in the limit where a class S is learnable iff there is a recursive machine M which reads the course of values of a function f and converges to a program for f whenever f is in S. An important measure for the speed of convergence in this model is the quantity of mind changes before the onset of convergence. The oldest model is to consider a constant bound on the number of mind changes M makes on any input function; such a bound is referred here as type 1. Later this was generalized to a bound of type 2 where a counter ranges over constructive ordinals and is counted down at every mind change. Although ordinal bounds permit the inference of richer concept classes than constant bounds, they still are a severe restriction. Therefore the present work introduces two more general approaches to bounding mind changes. These are based on counting by going down in a linearly ordered set (type 3) and on counting by going down in a partially ordered set (type 4). In both cases the set must not contain infinite descending recursive sequences. These four types of mind changes yield a hierarchy and there are identifiable classes that cannot be learned with the most general mind change bound of type 4. It is shown that existence of type 2 bound is equivalent to the existence of a learning algorithm which converges on every (also nonrecursive) input function and the existence of type 4 is shown to be equivalent to the existence of a learning algorithm which converges on every recursive function. A partial characterization of type 3 yields a result of independent interest in recursion theory. The interplay between mind change complexity and choice of hypothesis space is investigated. It is established that for certain concept classes, a more expressive hypothesis space can sometimes reduce mind change complexity of learning these classes. The notion of mind change bound for behaviourally correct learning is indirectly addressed by employing the above four types to restrict the number of predictive errors of commission in finite error next value learning (NV′′)—a model equivalent to behaviourally correct learning. Again, natural characterizations for type 2 and type 4 bounds are derived. Their naturalness is further illustrated by characterizing them in terms of branches of uniformly recursive families of binary trees.     

Heat-Killed Enterococcus faecalis EF-2001 Induces Human Dermal Papilla Cell Proliferation and Hair Regrowth in C57BL/6 Mice

Minoxidil is the most widely used treatment for hair growth, but has been associated with several side effects. In this study, we investigated the effects of heat-killed Enterococcus faecalis EF-2001 on hair loss prevention and regrowth using human dermal papilla cells and male C57BL/6 mice. To examine the effects of EF-2001, we used minoxidil as the positive control. In the in vitro experiments, EF-2001 treatment (75–500 μg/mL) led to the proliferation of human dermal papilla cells in a concentration-dependent manner. In the in vivo experiment, the topical application of 200 µL EF-2001 on the dorsal surface of C57BL/6 male mice led to hair growth. Changes in hair regrowth were examined by visual comparison and hematoxylin and eosin staining of skin sections. We also determined the expression levels of marker genes (Wnt) and growth factors (fibroblast growth factor, insulin growth factor 1, and vascular endothelial growth factor) in the skin tissues of the back of each mouse using a quantitative polymerase chain reaction. EF-2001 accelerated the progression of hair regrowth in mice and promoted hair-follicle conversion from telogen to anagen, likely by increasing the expression levels of growth factors and marker genes.     

Mie‐Resonant Membrane Huygens' Metasurfaces

All‐dielectric metasurfaces have become a new paradigm for flat optics as they allow flexible engineering of the electromagnetic space of propagating waves. Such metasurfaces are usually composed of individual subwavelength elements embedded into a host medium or placed on a substrate, which often diminishes the quality of the resonances. The substrate imposes limitations on the metasurface functionalities, especially for infrared and terahertz frequencies. Here a novel concept of membrane Huygens' metasurfaces is introduced. The metasurfaces feature an inverted design, and they consist of arrays of holes made in a thin membrane of high‐index dielectric material, with the response governed by the electric and magnetic Mie resonances excited within dielectric domains of the membrane. Highly efficient transmission combined with the 2π phase coverage in the freestanding membranes is demonstrated. Several functional metadevices for wavefront control are designed, including beam deflector, a lens, and an axicon. Such membrane metasurfaces provide novel opportunities for efficient large‐area metadevices, whose advanced functionality is defined by structuring rather than by chemical composition.     

Dispirooxindole-β-Lactams: Synthesis via Staudinger Ketene-Imine Cycloaddition and Biological Evaluation

In this work, we present the first synthesis of dispirooxindole-β-lactams employing optimized methodology of one-pot Staudinger ketene-imine cycloaddition with N-aryl-2-oxo-pyrrolidine-3-carboxylic acids as the ketene source. Spiroconjugation of indoline-2-one with β-lactams ring is considered to be able to provide stabilization and wide scope of functionalization to resulting scaffolds. The dispipooxindoles obtained demonstrated medium cytotoxicity in the MTT test on A549, MCF7, HEK293, and VA13 cell lines, and one of the compounds demonstrated antibacterial activity against E. coli strain LPTD.     

Self-assembled silver nanoislands formed on glass surface via out-diffusion for multiple usages in SERS applications

We demonstrate that silver nanoisland film self-assembled on the surface of silver-containing glass in the course of thermal processing in hydrogen is capable to detect 10⁻⁷ M concentration of rhodamine 6G in water using surface enhanced Raman spectroscopy (SERS) technique. The film can be multiply restored on the same glass substrate via annealing of the glass in hydrogen. We showed that the film can be self-assembled after as much as ten circles of the substrate cleaning followed by annealing. The proposed technique of the silver nanoisland film formation enables multiple usage of the same glass substrate in SERS experiments.     

uBench: exposing the impact of CUDA block geometry in terms of performance

The choice of thread-block size and shape is one of the most important user decisions when a parallel problem is written for any CUDA architecture. The reason is that thread-block geometry has a significant impact on the global performance of the program. Unfortunately, the programmer has not enough information about the subtle interactions between this choice of parameters and the underlying hardware. This paper presents uBench, a complete suite of micro-benchmarks, in order to explore the impact on performance of (1) the thread-block geometry choice criteria, and (2) the GPU hardware resources and configurations. Each micro-benchmark has been designed to be as simple as possible to focus on a single effect derived from the hardware and thread-block parameter choice. As an example of the capabilities of this benchmark suite, this paper shows an experimental evaluation and comparison of Fermi and Kepler architectures. Our study reveals that, in spite of the new hardware details introduced by Kepler, the principles underlying the block geometry selection criteria are similar for both architectures.