Growth and optical properties of In x Ga1−x P nanowires synthesized by selective-area epitaxy

Ternary Ⅲ-Ⅴ nanowires (NWs) cover a wide range of wavelengths in the solar spectrum and would greatly benefit from being synthesized as position-controlled arrays for improved vertical yield,reprodudbility,and tunable optical absorption.Here,we report on successful selective-area epitaxy of metal-particle-free vertical InxGa1-xP NW arrays using metal-organic vapor phase epitaxy and detail their optical properties.A systematic growth study establishes the range of suitable growth parameters to obtain uniform NW growth over a large array.The optical properties of the NWs were characterized by room-temperature cathodoluminescence spectroscopy.Tunability of the emission wavelength from 870 nm to approximately 800 nm was achieved.Transmission electron microscopy and energy dispersive X-ray measurements performed on crosssection samples revealed a pure wurtzite crystal structure with very few stacking faults and a slight composition gradient along the NW growth axis.     

New Plain-Exponential Time Classes for Graph Homomorphism

A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f:V(G)→V(H) such that if uv∈E(G) then f(u)f(v)∈E(H). The problem Hom (G,H) of deciding whether there is a homomorphism is NP-complete, and in fact the fastest known algorithm for the general case has a running time of O ^*(n(H) ^cn(G)) (the notation O ^*(⋅) signifies that polynomial factors have been ignored) for a constant 0<c<1. In this paper, we consider restrictions on the graphs G and H such that the problem can be solved in plain-exponential time, i.e. in time O ^*(c ^n(G)+n(H)) for some constant c.     

Selective determination of urea using urease immobilized on ZnO nanowires

Well-aligned zinc oxide (ZnO) nanowire arrays were fabricated on gold-coated plastic substrates using a low-temperature aqueous chemical growth (ACG) method. The ZnO nanowire arrays with 50–130 nm diameters and ∼1 μm in lengths were used in an enzyme-based urea sensor through immobilization of the enzyme urease that was found to be sensitive to urea concentrations from 0.1 mM to 100 mM. Two linear sensitivity regions were observed when the electrochemical responses (EMF) of the sensors were plotted vs. the logarithmic concentration range of urea from 0.1 mM to 100 mM. The proposed sensor showed a sensitivity of 52.8 mV/decade for 0.1–40 mM urea and a fast response time less than 4 s was achieved with good selectivity, reproducibility and negligible response to common interferents such as ascorbic acid and uric acid, glucose, K⁺ and Na⁺ ions.     

Defining syntax-directed translations by tree bimorphisms

We introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. We also show that these “quasi-alphabetic” tree bimorphisms preserve recognizability, and that their class is closed under composition and inverses.     

Branch-and-Bound Methods for Euclidean Registration Problems

In this paper, we propose a practical and efficient method for finding the globally optimal solution to the problem of determining the pose of an object. We present a framework that allows us to use point-to-point, point-to-line, and point-to-plane correspondences for solving various types of pose and registration problems involving euclidean (or similarity) transformations. Traditional methods such as the iterative closest point algorithm or bundle adjustment methods for camera pose may get trapped in local minima due to the nonconvexity of the corresponding optimization problem. Our approach of solving the mathematical optimization problems guarantees global optimality. The optimization scheme is based on ideas from global optimization theory, in particular convex underestimators in combination with branch-and-bound methods. We provide a provably optimal algorithm and demonstrate good performance on both synthetic and real data. We also give examples of where traditional methods fail due to the local minima problem.     

Managing requirements specifications for product lines - An approach and industry case study

Software product line development has emerged as a leading approach for software reuse. This paper describes an approach to manage natural-language requirements specifications in a software product line context. Variability in such product line specifications is modeled and managed using a feature model. The proposed approach has been introduced in the Swedish defense industry. We present a multiple-case study covering two different product lines with in total eight product instances. These were compared to experiences from previous projects in the organization employing clone-and-own reuse. We conclude that the proposed product line approach performs better than clone-and-own reuse of requirements specifications in this particular industrial context.     

Dynamic diamond anvil cell (dDAC): a novel device for studying the dynamic-pressure properties of materials

We have developed a unique device, a dynamic diamond anvil cell (dDAC), which repetitively applies a time-dependent load/pressure profile to a sample. This capability allows studies of the kinetics of phase transitions and metastable phases at compression (strain) rates of up to 500 GPa/s (approximately 0.16 s(-1) for a metal). Our approach adapts electromechanical piezoelectric actuators to a conventional diamond anvil cell design, which enables precise specification and control of a time-dependent applied load/pressure. Existing DAC instrumentation and experimental techniques are easily adapted to the dDAC to measure the properties of a sample under the varying load/pressure conditions. This capability addresses the sparsely studied regime of dynamic phenomena between static research (diamond anvil cells and large volume presses) and dynamic shock-driven experiments (gas guns, explosive, and laser shock). We present an overview of a variety of experimental measurements that can be made with this device.     

On Forward–Backward MODE for Array Signal Processing

We apply the MODE (method of direction estimation) principle to the forward–backward (FB) covariance of the output vector of a sensor array to obtain what we call the FB-MODE procedure. The derivation of FB-MODE is an interesting exercise in matrix analysis, the outcome of which was somewhat unexpected: FB-MODE simply consists of applying the standard MODE approach to the eigenelements of the FB sample covariance matrix. By using an asymptotic expansion technique we also establish the surprising result that FB-MODE is outperformed, from a statistical standpoint, by the standard MODE applied to the forward-only sample covariance (F-MODE). We believe this to be an important result that shows that the FB approach, which proved quite useful for improving the performance of many suboptimal array processing methods, shouldnotbe used with a statistically optimal method such as F-MODE.     

Parameterized Two-Player Nash Equilibrium

We study the problem of computing Nash equilibria in a two-player normal form (bimatrix) game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement those results, by identifying three cases in which the problem becomes fixed-parameter tractable. Our results are based on a graph-theoretic representation of a bimatrix game, and on applying graph-theoretic tools on this representation.     

Accuracy analysis of a covariance matching approach for identifying errors-in-variables systems

A system identification method for errors-in-variables problems based on covariance matching was recently proposed. In the first step, a small amount of covariances of noisy input–output data are computed, and then a parametric model is fitted to these covariances. In this paper, the method is further analyzed and the asymptotic accuracy of the parameter estimates is derived. An explicit algorithm for computing the asymptotic covariance matrix of the parameter estimates is given, and the identification method is shown to be asymptotically statistically efficient assuming that the given information is the computed covariances. As an important byproduct, an efficient algorithm is presented for computing the covariance matrix of the computed input–output covariances.