Detailed 3D human body reconstruction from multi-view images combining voxel super-resolution and learned implicit representation

Applied Intelligence - The task of reconstructing detailed 3D human body models from images is interesting but challenging in computer vision due to the high freedom of human bodies. This work...     

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.     

A computational study of vortex-airfoil interaction using high-order finite difference methods

Simulations of the interaction between a vortex and a NACA0012 airfoil are performed with a stable, high-order accurate (in space and time), multi-block finite difference solver for the compressible Navier-Stokes equations.We begin by computing a benchmark test case to validate the code. Next, the flow with steady inflow conditions are computed on several different grids. The resolution of the boundary layer as well as the amount of the artificial dissipation is studied to establish the necessary resolution requirements. We propose an accuracy test based on the weak imposition of the boundary conditions that does not require a grid refinement.Finally, we compute the vortex-airfoil interaction and calculate the lift and drag coefficients. It is shown that the viscous terms add the effect of detailed small scale structures to the lift and drag coefficients.     

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.