Abstract. Many domestic scholars have studied on straw utilization from lodging resistance, by breeding agricultural experts to optimization parameters, which selected by agricultural mechanical experts and efficient utilization after the harvest crush. Therefore, the study of the mechanical properties of corn stalks has great prospects. It can provide the basis for the design of agricultural machinery and comprehensive utilization of straw that study the relationship between the properties of the corn stalk and the mechanical properties. In this paper, the radial compression and bending mechanical properties of corn stalk was conducted by universal material testing machine, which contributes to the increase of corn crop and provides basis for the development of equipment.
Machine type communications (MTC) in the next generation of mobile communication systems require a new random access scheme to handle massive access with low signaling overhead and latency. The recently developed compressive sensing multi-user detection (CS-MUD) supports joint activity and data detection by exploiting the sparsity of device activity. In this paper, we adopt the CS-based random access scheme by assigning the unique identification sequences to distinguish the different sensor nodes and employ group orthogonal matching pursuit least square (GOMP-LS) and weighted iteration (WI) GOMP algorithms based on the conventional GOMP with respect to high-reliability and low-latency applications. In addition, to further reduce computational complexity and latency, we introduce a low complexity WIGOMP with inverse Cholesky factorization (WIGOMP-ICF). Based on the simulation results and analysis, we can observe that the proposed three algorithms are promising to support different services requirements for MTC by considering high reliability, low latency, and computational complexity.
In the guidance of the thoughts from fire safety engineering and according to the kinetic mechanism of the occurrence and development of fire and the technological principle of fire prevention and control, this paper preliminarily studies the application of fire risk evaluation method in the fire safety engineering of an underground construction. By determining fire security goal, performance criterion and key fire danger zone, this paper uses FDS software to carry out a fire and smoke spread computer numerical simulation and obtains available safe evacuation time; simultaneously, it obtains required safe evacuation time in this underground construction by using an empirical formula computation method. After a comparison of these two kinds of time, it puts forward 6 measures to control fire smoke, which can provide reference for the improvement of this construction's fire safety planning and design.
Abstract:In this paper, a boundary control-based algorithm Binary Quantum Particle Swarm Optimization (BQPSO) that considers quantum particle swarm with Delta potential well was used to determine otsu threshold. In the optimization, particles moved in the Delta potential well with the best position POPSIZE as center. The best threshold was determined by updating individual extremum of a single particle pbest and global extremum of particles swarm gbest to their good-enough fitness values, in order for image segmentation. As for profiles, random circle method was used to extract radius of fruit circle. With binocular vision system, a Fourier-transform algorithm was adopted to extract offsets of left and right tomato images, and by marking their sorting baseline, they were matched according to sequential consistency principle.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.