Search Results (154)

To fully leverage the advantages of both hot air drying and radio frequency vacuum drying, a segmented combination drying technique was applied to post-harvest Cistanche. This new drying method involves using hot air drying in the initial stage to remove the majority of free water, followed by radio frequency vacuum drying in the later stage to remove the remaining small amount of free water and bound water. During the radio frequency vacuum drying (RFV) phase, the effects of temperature (45, 55, and 65 °C), vacuum pressure (0.020, 0.030, and 0.040 MPa), plate spacing (65, 75, and 85 mm), and slice thickness (4, 5, and 6 mm) on the drying characteristics, quality, and microstructure of Cistanche slices were investigated. Additionally, infrared thermal imaging technology was used to examine the surface temperature distribution of the material during the drying process. The results showed that compared to radio frequency vacuum drying alone, the hot air–radio frequency combined drying significantly shortened the drying time. Under conditions of lower vacuum pressure (0.020 MPa), plate spacing (65 mm), and higher temperature (65 °C), the drying time was reduced and the drying rate increased. Infrared thermal imaging revealed that in the early stages of hot air–radio frequency vacuum combined drying, the center temperature of Cistanche was higher than the edge temperature. As drying progressed, the internal moisture of the material diffused from the inside out, resulting in higher edge temperatures compared to the center and the formation of overheating zones. Compared to natural air drying, the hot air–radio frequency vacuum combined drying effectively preserved the content of active components such as polysaccharides (275.56 mg/g), total phenols (38.62 mg/g), total flavonoids (70.35 mg/g), phenylethanoid glycosides, and iridoids. Scanning electron microscopy observed that this combined drying method reduced surface collapse and cracking of the material. This study provides theoretical references for future drying processes of Cistanche. Full article

The complete characterization of the almost-entropic region yields rate regions for network coding problems. However, this characterization is difficult and open. In this paper, we propose a novel algorithm to determine whether an arbitrary vector in the entropy space is entropic or not, by parameterizing and generating probability mass functions by neural networks. Given a target vector, the algorithm minimizes the normalized distance between the target vector and the generated entropic vector by training the neural network. The algorithm reveals the entropic nature of the target vector, and obtains the underlying distribution, accordingly. The proposed algorithm was further implemented with convolutional neural networks, which naturally fit the structure of joint probability mass functions, and accelerate the algorithm with GPUs. Empirical results demonstrate improved normalized distances and convergence performances compared with prior works. We also conducted optimizations of the Ingleton score and Ingleton violation index, where a new lower bound of the Ingleton violation index was obtained. An inner bound of the almost-entropic region with four random variables was constructed with the proposed method, presenting the current best inner bound measured by the volume ratio. The potential of a computer-aided approach to construct achievable schemes for network coding problems using the proposed method is discussed. Full article

Topology optimization focuses on the conceptual design of structures, characterized by a large optimization space and a significant impact on structural performance, and has been widely applied in industrial fields such as aviation and aerospace. However, most topology optimization methods prioritize structural stiffness and often overlook stress levels, which are critical factors in engineering design. In recent years, explicit topology optimization methods have been extensively developed due to their ability to produce clear boundaries and their compatibility with CAD/CAE systems. Nevertheless, research on incorporating stress constraints within the explicit topology optimization framework remains scarce. This paper is dedicated to investigating stress constraints within the explicit topology optimization framework. Due to the clear boundaries and absence of intermediate density elements in the explicit topology optimization framework, this approach avoids the challenge of stress calculation for intermediate density elements encountered in the traditional density method. This provides a natural advantage in solving topology optimization problems considering stress constraints, resulting in more accurate stress calculations. Compared with existing approaches, this paper proposes a novel component topology description function that enhances the deformability of components, improving the representation of geometric boundaries. The lower-bound Kreisselmeier–Steinhauser aggregation function is employed to manage the stress constraint, reducing the solution scale and computational burden. The effectiveness of the proposed method is demonstrated through two classic examples of topology optimization. Full article

In this paper, a novel intelligent controller for the trajectory tracking control of a nonholonomic mobile robot with time-varying parameter uncertainty and external disturbances in the case of tire hysteresis loss is proposed. Based on tire dynamics principles, a dynamic and kinematic model of a nonholonomic mobile robot is established, and the neural network approximation model of the system’s nonlinear term caused by many coupling factors when the robot enters a roll is given. Then, in order to adaptively estimate the unknown upper bounds on the uncertainties and perturbations for each subsystem in real time, a novel adaptive law employed online as a gain parameter is designed to solve the problem of inter-system coupling and reduce the transient response time of the system with lower uncertainties. Additionally, based on improved gray wolf optimizer and fuzzy system techniques, an adaptive algorithm using the gray wolf optimizer study space as the output variable of the fuzzy system to expand the search area of the gray wolves is developed to optimize the controller parameters online. Finally, the efficacy of the proposed intelligent control scheme and the feasibility of the proposed algorithm are verified by the 2023a version of MATLAB/Simulink platform. Full article

In dynamical systems, Hilbert spaces provide a useful framework for analyzing and solving problems because they are able to handle infinitely dimensional spaces. Many dynamical systems are described by linear operators acting on a Hilbert space. Understanding the spectrum, eigenvalues, and eigenvectors of these operators is crucial. Functional analysis typically involves the use of tensors to represent multilinear mappings between Hilbert spaces, which can result in inequality in tensor Hilbert spaces. In this paper, we study two types of function spaces and use convex and harmonic convex mappings to establish various operator inequalities and their bounds. In the first part of the article, we develop the operator Hermite–Hadamard and upper and lower bounds for weighted discrete Jensen-type inequalities in Hilbert spaces using some relational properties and arithmetic operations from the tensor analysis. Furthermore, we use the Riemann–Liouville fractional integral and develop several new identities which are used in operator Milne-type inequalities to develop several new bounds using different types of generalized mappings, including differentiable, quasi-convex, and convex mappings. Furthermore, some examples and consequences for logarithm and exponential functions are also provided. Furthermore, we provide an interesting example of a physics dynamical model for harmonic mean. Lastly, we develop Hermite–Hadamard inequality in variable exponent function spaces, specifically in mixed norm function space (lq(·)(Lp(·))). Moreover, it was developed using classical Lebesgue space (Lp) space, in which the exponent is constant. This inequality not only refines Jensen and triangular inequality in the norm sense, but we also impose specific conditions on exponent functions to show whether this inequality holds true or not. Full article

Blockchain is a developing technology that promises advancements when it is applied to other fields. Applying blockchain to other systems requires a customized blockchain model to satisfy the requirements of different application fields. One important area is to integrate blockchain with smart spaces and the Internet of Things to process, manage, and store data. Actually, smart spaces and Internet of Things systems include various types of transactions in terms of sensitivity. The sensitivity can be considered as correctness sensitivity, time sensitivity, and specialization sensitivity. Correctness sensitivity means that the systems should accept precise or approximated data in some cases, whereas time sensitivity means that there are time bounds for each type of transaction, and specialization sensitivity applies when some transactions are processed only by specialized people. Therefore, this work introduces the smart partitioned blockchain model, where we use machine learning and deep learning models to classify transactions into different pools according to their sensitivity levels. Then, each pool is mapped to a specific part of the smart partitioned blockchain model. The parts can be permissioned or permissionless. The permissioned parts can have different sub-parts if needed. Consequently, the smart partitioned blockchain can be customized to meet application-field requirements. In the experimental results, we use bank and medical datasets with a predefined sensitivity threshold for classification accuracy in each system. The bank transactions are critical, whereas the classification of the medical dataset is speculative and less critical. The Random Forest model is used for bank-dataset classification, and its accuracy reaches 100%, whereas Sequential Deep Learning is used for the medical dataset, which reaches 91%. This means that all bank transactions are correctly mapped to the corresponding parts of the blockchain, whereas accuracy is lower for the medical dataset. However, acceptability is determined based on the predefined sensitivity threshold. Full article

In this paper, we consider a visible light positioning (VLP) system, where an array of photo diodes combined with apertures is used as a directional receiver and a set of inexpensive and energy-efficient light-emitting diodes (LEDs) is used as transmitters. The paper focuses on the optimisation of the layout of the transmitter, i.e., the number and placement of the LEDs, to meet the wanted position estimation accuracy levels. To this end, we evaluate the Cramer–Rao bound (CRB), which is a lower bound on the mean-squared error (MSE) of the position estimate, to analyse the influence of the LEDs’ placement. In contrast to other works, where only the location of the LEDs was considered and/or the optimisation was carried out through simulations, in this work, the optimisation is carried out analytically and considers all the parameters involved in the VLP system as well as the illumination. Based on our results, we formulate simple rules of thumb with which we can determine the spacing between LEDs and the minimum number of LEDs, as well as their position on the ceiling, while also taking into account the requirements for the illumination. Full article

Battlefield surveillance radar is usually 2-D radar, which cannot realize target three-dimensional localization, leading to poor resolution for the air target in the elevation dimension. Previous researchers have used the Traditional Height Finder Radar (HFR) or multiple 2-D radar networking to estimate the target three-dimensional location. However, all of them face the problems of high cost, poor real-time performance and high requirement of space–time registration. In this paper, Reconfigurable Intelligent Surfaces (RISs) with low cost are introduced into the 2-D radar to realize the target three-dimensional localization. Taking advantage of the wide beam of 2-D radar in the elevation dimension, several Unmanned Aerial Vehicles (UAVs) carrying RISs are set in the receiving beam to form multiple auxiliary measurement channels. In addition, the traditional 2-D radar measurements combined with the auxiliary channel measurements are used to realize the target three-dimensional localization by solving a nonlinear least square problem with a convex optimization method. For the proposed RIS-assisted target three-dimensional localization problem, the Cramer–Rao Lower Bound (CRLB) is derived to measure the target localization accuracy. Simulation results verify the effectiveness of the proposed 3-D localization method, and the influences of the number, the positions and the site errors of the RISs on the localization accuracy are covered. Full article

In this note, we investigate the pinching problem for oriented compact submanifolds of dimension n with parallel normalized mean curvature vector in a space form Fn+p(c). We first prove a codimension reduction theorem for submanifolds under lower Ricci curvature bounds. Moreover, if the submanifolds have constant normalized scalar curvature R≥c, we obtain a classification theorem for submanifolds under lower Ricci curvature bounds. It should be emphasized that our Ricci pinching conditions are sharp for even n and p=2. Full article

In this study, to solve the low accuracy of multi-space-based sensor joint tracking in the presence of unknown noise characteristics, an adaptive multi-sensor joint tracking algorithm (AMSJTA) is proposed. First, the coordinate transformation from the target object to the optical sensors is considered, and the observation vector-based measurement model is established. Then, the measurement noise characteristics are assumed to be white Gaussian noise, and the measurement covariance matrix is set as a constant. On this premise, the traditional iterative extended Kalman filter is applied to solve this problem. However, in most actual engineering applications, the measurement noise characteristics are unknown. Thus, a forgetting factor is introduced to adaptively estimate the unknown measurement noise characteristics, and the AMSJTA is designed to improve the tracking accuracy. Furthermore, the lower bound of the proposed algorithm is theoretically proved. Finally, numerical simulations are executed to verify the effectiveness and superiority of the proposed AMSJTA. Full article

Localizing a moving source by Time Difference of Arrival (TDOA) and Frequency Difference of Arrival (FDOA) commonly requires at least N+1 sensors in N-dimensional space to obtain more than N pairs of TDOAs and FDOAs, thereby establishing more than 2N equations to solve for 2N unknowns. However, if there are insufficient sensors, the localization problem will become underdetermined, leading to non-unique solutions or inaccuracies in the minimum norm solution. This paper proposes a localization method using TDOAs and FDOAs while incorporating the motion model. The motion between the source and sensors increases the equivalent length of the baseline, thereby improving observability even when using the minimum number of sensors. The problem is formulated as a Maximum Likelihood Estimation (MLE) and solved through Gauss–Newton (GN) iteration. Since GN requires an initialization close to the true value, the MLE is transformed into a semidefinite programming problem using Semidefinite Relaxation (SDR) technology, while SDR results in a suboptimal estimate, it is sufficient as an initialization to guarantee the convergence of GN iteration. The proposed method is analytically shown to reach the Cramér–Rao Lower Bound (CRLB) accuracy under mild noise conditions. Simulation results confirm that it achieves CRLB-level performance when the number of sensors is lower than N+1, thereby corroborating the theoretical analysis. Full article

The focus of our research is the examination of Hermitian curves over finite fields, specifically concentrating on places of degree three and their role in constructing Hermitian codes. We begin by studying the structure of the Riemann–Roch space associated with these degree-three places, aiming to determine essential characteristics such as the basis. The investigation then turns to Hermitian codes, where we analyze both functional and differential codes of degree-three places, focusing on their parameters and automorphisms. In addition, we explore the study of subfield subcodes and trace codes, determining their structure by giving lower bounds for their dimensions. This presents a complex problem in coding theory. Based on numerical experiments, we formulate a conjecture for the dimension of some subfield subcodes of Hermitian codes. Our comprehensive exploration seeks to deepen the understanding of Hermitian codes and their associated subfield subcodes related to degree-three places, thus contributing to the advancement of algebraic coding theory and code-based cryptography. Full article

The question of the global topology of the Universe (cosmic topology) is still open. In the $\Lambda$CDM concordance model, it is assumed that the space of the Universe possesses the trivial topology of ${\mathbb{R}}^3$, and thus that the Universe has an infinite volume. As an alternative, in this paper, we study one of the simplest non-trivial topologies given by a cubic 3-torus describing a universe with a finite volume. To probe cosmic topology, we analyze certain structure properties in the cosmic microwave background (CMB) using Betti functionals and the Euler characteristic evaluated on excursions sets, which possess a simple geometrical interpretation. Since the CMB temperature fluctuations $\delta T$ are observed on the sphere ${\mathbb{S}}^2$ surrounding the observer, there are only three Betti functionals ${\beta }_k\left(\nu \right)$, $k=0,1,2$. Here, $\nu =\delta T/{\sigma }_0$ denotes the temperature threshold normalized by the standard deviation ${\sigma }_0$ of $\delta T$. The analytic approximations of the Gaussian expectations for the Betti functionals and an exact formula for the Euler characteristic are given. It is shown that the amplitudes of ${\beta }_0\left(\nu \right)$ and ${\beta }_1\left(\nu \right)$ decrease with an increasing volume $V=L^3$ of the cubic 3-torus universe. Since the computation of the ${\beta }_k$’s from observational sky maps is hindered due to the presence of masks, we suggest a method that yields lower and upper bounds for them and apply it to four Planck 2018 sky maps. It is found that the ${\beta }_k$’s of the Planck maps lie between those of the torus universes with side-lengths $L=2.0$ and $L=3.0$ in units of the Hubble length and above the infinite $\Lambda$CDM case. These results give a further hint that the Universe has a non-trivial topology. Full article

We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to construct almost-optimal codes with this property, meaning that their average length differs from the minimum possible by at most one. We obtain our results by uncovering a relation between our class of codes and the class of one-to-one codes. Additionally, we derive upper and lower bounds to the average length of optimal prefix-free codes with a space in terms of the source entropy. Full article

A substantial number of dwellings in the UK have poor building fabric, leading to higher carbon emissions, fuel expenses, and the risk of cold homes. To tackle these challenges, domestic energy efficiency policies are being implemented. One effective approach is the use of energy models, which enable sensitivity analysis to provide valuable insights for policymakers. This study employed dynamic thermal simulation models for 32 housing archetypes representative of solid-walled homes in the UK to calculate the heat loss and the sensitivity coefficient per building fabric feature, after which a metric Heat Loss Sensitivity (HLS) index was established to guide the selection of retrofit features for each archetype. The building fabric features’ inputs were then adjusted to establish both lower and upper bounds, simulating low and high performance levels, to predict the how space heating energy demand varies. The analysis was extended by replicating the process with various scenarios considering climates, window-to-wall ratios, and overshadowing. The findings highlight the external wall as the primary consideration in retrofitting due to its high HLS index, even at high window-to-wall ratios. It was also established that dwelling type is important in retrofit decision-making, with floor and loft retrofits having a high HLS index in bungalows. Furthermore, the analysis underlines the necessity for Standard Assessment Procedure assessors to evaluate loft U-value and air permeability rates prior to implementing retrofit measures, given the significance of these factors in the lower and upper bounds analysis. Researchers globally can replicate the HLS index approach, facilitating the implementation of housing retrofit policies worldwide. Full article