ALBERT

Description: This paper presents a novel lattice based biomimetic neural network trained by means of a similarity measure derived from a lattice positive valuation. For a wide class of pattern recognition problems, the proposed artificial neural network, implemented as a dendritic hetero-associative memory delivers high percentages of successful classification. The memory is a feedforward dendritic network whose arithmetical operations are based on lattice algebra and can be applied to real multivalued inputs. In this approach, the realization of recognition tasks, shows the inherent capability of prototype-class pattern associations in a fast and straightforward manner without need of any iterative scheme subject to issues about convergence. Using an artificially designed data set we show how the proposed trained neural net classifies a test input pattern. Application to a few typical real-world data sets illustrate the overall network classification performance using different training and testing sample subsets generated randomly.

Description: H-umbilicity was introduced as an analogue of total umbilicity for Lagrangian submanifolds since, in some relevant cases, totally umbilical Lagrangian submanifolds are automatically totally geodesic. In this paper, we show that, in the homogeneous nearly Kähler S3×S3, also H-umbilical Lagrangian submanifolds are automatically totally geodesic.

Description: Given a graph G without isolated vertices, a total Roman dominating function for G is a function f:V(G)→{0,1,2} such that every vertex u with f(u)=0 is adjacent to a vertex v with f(v)=2, and the set of vertices with positive labels induces a graph of minimum degree at least one. The total Roman domination number γtR(G) of G is the smallest possible value of ∑v∈V(G)f(v) among all total Roman dominating functions f. The total Roman domination number of the direct product G×H of the graphs G and H is studied in this work. Specifically, several relationships, in the shape of upper and lower bounds, between γtR(G×H) and some classical domination parameters for the factors are given. Characterizations of the direct product graphs G×H achieving small values (≤7) for γtR(G×H) are presented, and exact values for γtR(G×H) are deduced, while considering various specific direct product classes.

Description: In this paper, we go through the development of a new numerical method to obtain the solution to a size-structured population model that describes the evolution of a consumer feeding on a dynamical resource that reacts to the environment with a lag-time response. The problem involves the coupling of the partial differential equation that represents the population evolution and an ordinary differential equation with a constant delay that describes the evolution of the resource. The numerical treatment of this problem has not been considered before when a delay is included in the resource evolution rate. We analyzed the numerical scheme and proved a second-order rate of convergence by assuming enough regularity of the solution. We numerically confirmed the theoretical results with an academic test problem.

Description: The lack of a universal simulation method for triboelectric nanogenerator (TENG) makes the device design and optimization difficult before experiment, which protracts the research and development process and hinders the landing of practical TENG applications. The existing electrostatic induction models for TENGs have limitations in simulating TENGs with complex geometries and their dynamic behaviors under practical movements due to the topology change issues. Here, a dynamic finite element method (FEM) model is proposed. The introduction of air buffer layers and the moving mesh method eliminates the topology change issues during practical movement and allows simulation of dynamic and time-varying behaviors of TENGs with complex 2D/3D geometries. Systematic investigations are carried out to optimize the air buffer thickness and mesh densities, and the optimized results show excellent consistency with the experimental data and results based on other existing methods. It also shows that a 3D disk-type rotating TENG can be simulated using the model, clearly demonstrating the capability and superiority of the dynamic FEM model. Moreover, the dynamic FEM model is used to optimize the shape of the tribo-material, which is used as a preliminary example to demonstrate the possibility of designing a TENG-based sensor.

Description: The present theoretical work endeavors to solve the Sutterby nanofluid flow and heat transfer problem over a permeable moving sheet, together with the presence of thermal radiation and magnetohydrodynamics (MHD). The fluid flow and heat transfer features near the stagnation region are considered. A new form of similarity transformations is introduced through scaling group analysis to simplify the governing boundary layer equations, which then eases the computational process in the MATLAB bvp4c function. The variation in the values of the governing parameters yields two different numerical solutions. One of the solutions is stable and physically reliable, while the other solution is unstable and is associated with flow separation. An increased effect of the thermal radiation improves the rate of convective heat transfer past the permeable shrinking sheet.

Description: In this paper, 3D-printed electromagnetic (or microwave) encoders with synchronous reading based on permittivity contrast, and devoted to the measurement of displacements and velocities, are reported for the first time. The considered encoders are based on two chains of linearly shaped apertures made on a 3D-printed high-permittivity dielectric material. One such aperture chain contains the identification (ID) code, whereas the other chain provides the clock signal. Synchronous reading is necessary in order to determine the absolute position if the velocity between the encoder and the sensitive part of the reader is not constant. Such absolute position can be determined as long as the whole encoder is encoded with the so-called de Bruijn sequence. For encoder reading, a splitter/combiner structure with each branch loaded with a series gap and a slot resonator (each one tuned to a different frequency) is considered. Such a structure is able to detect the presence of the apertures when the encoder is displaced, at short distance, over the slots. Thus, by injecting two harmonic signals, conveniently tuned, at the input port of the splitter/combiner structure, two amplitude modulated (AM) signals are generated by tag motion at the output port of the sensitive part of the reader. One of the AM envelope functions provides the absolute position, whereas the other one provides the clock signal and the velocity of the encoder. These synchronous 3D-printed all-dielectric encoders based on permittivity contrast are a good alternative to microwave encoders based on metallic inclusions in those applications where low cost as well as major robustness against mechanical wearing and aging effects are the main concerns.

Description: This paper presents a vulnerable road user (VRU) tracking algorithm capable of handling noisy and missing detections from heterogeneous sensors. We propose a cooperative fusion algorithm for matching and reinforcing of radar and camera detections using their proximity and positional uncertainty. The belief in the existence and position of objects is then maximized by temporal integration of fused detections by a multi-object tracker. By switching between observation models, the tracker adapts to the detection noise characteristics making it robust to individual sensor failures. The main novelty of this paper is an improved imputation sampling function for updating the state when detections are missing. The proposed function uses a likelihood without association that is conditioned on the sensor information instead of the sensor model. The benefits of the proposed solution are two-fold: firstly, particle updates become computationally tractable and secondly, the problem of imputing samples from a state which is predicted without an associated detection is bypassed. Experimental evaluation shows a significant improvement in both detection and tracking performance over multiple control algorithms. In low light situations, the cooperative fusion outperforms intermediate fusion by as much as 30%, while increases in tracking performance are most significant in complex traffic scenes.

Description: Flat surfaces captured by 3D point clouds are often used for localization, mapping, and modeling. Dense point cloud processing has high computation and memory costs making low-dimensional representations of flat surfaces such as polygons desirable. We present Polylidar3D, a non-convex polygon extraction algorithm which takes as input unorganized 3D point clouds (e.g., LiDAR data), organized point clouds (e.g., range images), or user-provided meshes. Non-convex polygons represent flat surfaces in an environment with interior cutouts representing obstacles or holes. The Polylidar3D front-end transforms input data into a half-edge triangular mesh. This representation provides a common level of abstraction for subsequent back-end processing. The Polylidar3D back-end is composed of four core algorithms: mesh smoothing, dominant plane normal estimation, planar segment extraction, and finally polygon extraction. Polylidar3D is shown to be quite fast, making use of CPU multi-threading and GPU acceleration when available. We demonstrate Polylidar3D’s versatility and speed with real-world datasets including aerial LiDAR point clouds for rooftop mapping, autonomous driving LiDAR point clouds for road surface detection, and RGBD cameras for indoor floor/wall detection. We also evaluate Polylidar3D on a challenging planar segmentation benchmark dataset. Results consistently show excellent speed and accuracy.

Description: In this study, we proposed a semi-automated and interactive scheme for organ contouring in radiotherapy planning for patients with non-small cell lung cancers. Several organs were contoured, including the lungs, airway, heart, spinal cord, body, and gross tumor volume (GTV). We proposed some schemes to automatically generate and vanish the seeds of the random walks (RW) algorithm. We considered 25 lung cancer patients, whose computed tomography (CT) images were obtained from the China Medical University Hospital (CMUH) in Taichung, Taiwan. The manual contours made by clinical oncologists were taken as the gold standard for comparison to evaluate the performance of our proposed method. The Dice coefficient between two contours of the same organ was computed to evaluate the similarity. The average Dice coefficients for the lungs, airway, heart, spinal cord, and body and GTV segmentation were 0.92, 0.84, 0.83, 0.73, 0.85 and 0.66, respectively. The computation time was between 2 to 4 min for a whole CT sequence segmentation. The results showed that our method has the potential to assist oncologists in the process of radiotherapy treatment in the CMUH, and hopefully in other hospitals as well, by saving a tremendous amount of time in contouring.