Using Pearson’s System of Curves to Approximate the Distributions of the Difference between Two Correlated Estimates of Signal-to-Noise Ratios: The Cases of Bivariate Normal and Bivariate Lognormal Distributions

Background: The signal-to-noise ratio (SNR) is recognized as an index of measurements reproducibility. We derive the maximum likelihood estimators of SNR and discuss confidence interval construction on the difference between two correlated SNRs when the readings are from bivariate normal and bivariate lognormal distribution. We use the Pearsons system of curves to approximate the difference between the two estimates and use the bootstrap methods to validate the approximate distributions of the statistic of interest. Methods: The paper uses the delta method to find the first four central moments, and hence the skewness and kurtosis which are important in the determination of the parameters of the Pearsons distribution. Results: The approach is illustrated in two examples;one from veterinary microbiology and food safety data and the other on data from clinical medicine. We derived the four central moments of the target statistics, together with the bootstrap method to evaluate the parameters of Pearsons distribution. The fitted Pearsons curves of Types I and II were recommended based on the available data. The R-codes are also provided to be readily used by the readers.

Time-temperature-property curves for quench sensitivity of 6063 aluminum alloy

The quench sensitivity of 6063 alloy was investigated via constructing time-temperature-property（TTP） curves by interrupted quenching technique and transmission electron microscopy（TEM） analysis.The results show that the quench sensitivity of 6063 alloy is lower than that of 6061 or 6082 alloy,and the critical temperature ranges from 300 to 410℃ with the nose temperature of about 360℃.From TEM analysis,heterogeneous precipitate β-Mg2Si is prior to nucleate on the（AlxFeySiz） dispersoids in the critical temperature range,and grows up most rapidly at the nose temperature of 360℃.The heterogeneous precipitation leads to a low concentration of solute,which consequently reduces the amount of the strengthening phase β＇＇ after aging.In the large-scale industrial production of 6063 alloy,the cooling rate during quenching should be enhanced as high as possible in the quenching sensitive temperature range（410-300℃） to suppress the heterogeneous precipitation to get optimal mechanical properties,and it should be slowed down properly from the solution temperature to 410℃ and below 300℃ to reduce the residual stress.

A comparative study of data-driven battery capacity estimation based on partial charging curves

With its generality and practicality, the combination of partial charging curves and machine learning(ML) for battery capacity estimation has attracted widespread attention. However, a clear classification,fair comparison, and performance rationalization of these methods are lacking, due to the scattered existing studies. To address these issues, we develop 20 capacity estimation methods from three perspectives:charging sequence construction, input forms, and ML models. 22,582 charging curves are generated from 44 cells with different battery chemistry and operating conditions to validate the performance. Through comprehensive and unbiased comparison, the long short-term memory(LSTM) based neural network exhibits the best accuracy and robustness. Across all 6503 tested samples, the mean absolute percentage error(MAPE) for capacity estimation using LSTM is 0.61%, with a maximum error of only 3.94%. Even with the addition of 3 m V voltage noise or the extension of sampling intervals to 60 s, the average MAPE remains below 2%. Furthermore, the charging sequences are provided with physical explanations related to battery degradation to enhance confidence in their application. Recommendations for using other competitive methods are also presented. This work provides valuable insights and guidance for estimating battery capacity based on partial charging curves.

Method for determining the position of landslide slip-surface with a typical inclinometric curves

In the actual monitoring of deep hole displacement,the identification of slip surfaces is primarily based on abrupt changes observed in the inclinometric curve.In conventional identification methods,inclinometric curves exhibiting indications of sliding can be categorized into three types:B-type,D-type,and r-type.The position of the slip surface is typically determined by identifying the depth corresponding to the point of maximum displacement mutation.However,this method is sensitive to the interval of measurement points and the observation scale of the coordinate axes and suffers from unclear sliding surfaces and uncertain values.Based on the variation characteristics of these diagonal curves,we classified the landslide into three components:the sliding body,the sliding interval,and the immobile body.Moreover,three different generalization models were established to analyze the relationships between the curve form and the slip surface location based on different physical indicators such as displacement rate,relative displacement,and acceleration.The results show that the displacement rate curves of an r-type slope exhibit a clustering feature in the sliding interval,and by solving for the depth of discrete points within the step phase,it is possible to determine the location of the slip surface.On the other hand,D-type slopes have inflection points in the relative displacement curve located at the slip surface.The acceleration curves of B-type slopes exhibit clustering characteristics during the sliding interval,while the scattered acceleration data demonstrate wandering characteristics.Consequently,the slip surface location can be revealed by solving the depth corresponding to the maximum acceleration with cubic spline interpolation.The approach proposed in this paper was applied to the monitoring data of a landslide in Yunnan Province,China.The results indicate that our approach can accurately identify the slip surface location and enable computability of its position,thereby enhancing applicability and reliability of the deep-hole displacement monitoring data.

Exploring the topographical pattern beneath the water surface: Global bathymetric volume-area-height curves(BVAH) of inland surface water bodies

Global inland surface water bodies such as lakes and reservoirs,important components of the hydrosphere and ecosphere,are increasingly affected by climate change.Generating bathymetric volume-areaheight (BVAH) curves for global inland surface water bodies can enhance our understanding of their topography and climate impacts.However,accurately quantifying the topographic patterns of these water bodies remains challenging due to the difficulties in collecting comprehensive bathymetric data.Therefore,we collected and processed over 2000 bathymetric maps of global water bodies from over 50 different data sources and then developed the BVAH model.Finally,the BVAH hydrological curves of 16671 global inland surface water bodies (larger than 10 km~2) were generated.The results include but are not limited to (1) For most targeted water bodies,area (A) and volume (V) exhibit significant power function relationships with surface heights (H),with optimal power values quantified as 1.42 for A and 2.42 for V.(2) The BVAH model outperforms GLOBathy in estimating area and volume changes,achieving higher correlation coefficients (CC) of approximately 0.962 for the area and 0.991 for volume,and demonstrating lower percentages of root mean squared errors (PRMSE) around 10.9% for the area and 4.8% for volume.(3) In the case study of the Xizang Plateau and various large global reservoirs,the BVAH curve database can capture dynamic volume changes.As a unified simulation of the bathymetric topographical patterns,our bathymetric dataset and corresponding BVAH curve database have great potential to contribute to effective water resource management and ecological conservation efforts worldwide.

Analytical Determination of Size and Location of Roadside Horizontal Sightline Offsets for Compound Curves

AASHTO’s guideline for geometric design of highways and similar guidelines require that roadside areas on the inside of horizontal curves be cleared of high objects to provide stopping sight distance. The guidelines have analytical models for determining the extent of clearance, known as the horizontal sightline offset or clearance offset, for simple curves. Researchers in the past have developed analytical models for clearance offsets for spiraled and reverse curves. Very few researchers developed analytical models for available sight distances for compound curves. Still missing are models for horizontal sightline offsets and locations of the offsets for compound curves. The objective of this paper is to present development of analytical models and charts for determining horizontal sightline offsets and their locations for compound curves. The paper considers curves whose component arcs are individually shorter than stopping sight distance. The resulting models and the charts have been verified with accurate values determined using graphical methods. The models and the charts will find application in geometric design of highway compound curves.

Performance Analysis of Curved Track G2T-FSO(Ground-to-Train Free Space Optical)Model under Various Weather Conditions

The demand for broadband data services on high-speed trains is rapidly growing as more people commute between their homes and workplaces.However,current radio frequency(RF)technology cannot adequately meet this demand.In order to address the bandwidth constraint,a technique known as free space optics(FSO)has been proposed.This paper presents a mathematical derivation and formulation of curve track G2T-FSO(Ground-to-train Free Space Optical)model,where the track radius characteristics is 2667 m,divergence angle track is 1.5°for train velocity at V=250 km/h.Multiple transmitter configurations are proposed to maximize coverage range and enhance curve track G2T-FSO link performance under varying weather conditions.The curved track G2T-FSO model was evaluated in terms of received power,signal-to-noise ratio(SNR),bit error rate(BER),and eye diagrams.The results showed maximum coverage lengths of 618,505,365,and 240 m for 4Tx/1Rx,3Tx/1Rx,2Tx/1Rx,and 1Tx/1Rx configurations,respectively.The analyzed results demonstrate that the G2T-FSO link can be effectively implemented under various weather conditions.

Message Verification Protocol Based on Bilinear Pairings and Elliptic Curves for Enhanced Security in Vehicular Ad Hoc Networks

Vehicular ad hoc networks(VANETs)provide intelligent navigation and efficient route management,resulting in time savings and cost reductions in the transportation sector.However,the exchange of beacons and messages over public channels among vehicles and roadside units renders these networks vulnerable to numerous attacks and privacy violations.To address these challenges,several privacy and security preservation protocols based on blockchain and public key cryptography have been proposed recently.However,most of these schemes are limited by a long execution time and massive communication costs,which make them inefficient for on-board units(OBUs).Additionally,some of them are still susceptible to many attacks.As such,this study presents a novel protocol based on the fusion of elliptic curve cryptography(ECC)and bilinear pairing(BP)operations.The formal security analysis is accomplished using the Burrows–Abadi–Needham(BAN)logic,demonstrating that our scheme is verifiably secure.The proposed scheme’s informal security assessment also shows that it provides salient security features,such as non-repudiation,anonymity,and unlinkability.Moreover,the scheme is shown to be resilient against attacks,such as packet replays,forgeries,message falsifications,and impersonations.From the performance perspective,this protocol yields a 37.88%reduction in communication overheads and a 44.44%improvement in the supported security features.Therefore,the proposed scheme can be deployed in VANETs to provide robust security at low overheads.

Sensitive Information Security Based on Elliptic Curves

The elliptic curve cryptography algorithm represents a major advancement in the field of computer security. This innovative algorithm uses elliptic curves to encrypt and secure data, providing an exceptional level of security while optimizing the efficiency of computer resources. This study focuses on how elliptic curves cryptography helps to protect sensitive data. Text is encrypted using the elliptic curve technique because it provides great security with a smaller key on devices with limited resources, such as mobile phones. The elliptic curves cryptography of this study is better than using a 256-bit RSA key. To achieve equivalent protection by using the elliptic curves cryptography, several Python libraries such as cryptography, pycryptodome, pyQt5, secp256k1, etc. were used. These technologies are used to develop a software based on elliptic curves. If built, the software helps to encrypt and decrypt data such as a text messages and it offers the authentication for the communication.

Review on Service Curves of Typical Scheduling Algorithms

In recent years,various internet architectures,such as Integrated Services(IntServ),Differentiated Services(DiffServ),Time Sensitive Networking(TSN)and Deterministic Networking(DetNet),have been proposed to meet the quality-of-service(QoS)requirements of different network services.Concurrently,network calculus has found widespread application in network modeling and QoS analysis.Network calculus abstracts the details of how nodes or networks process data packets using the concept of service curves.This paper summarizes the service curves for typical scheduling algorithms,including Strict Priority(SP),Round Robin(RR),Cycling Queuing and Forwarding(CQF),Time Aware Shaper(TAS),Credit Based Shaper(CBS),and Asynchronous Traffic Shaper(ATS).It introduces the theory of network calculus and then provides an overview of various scheduling algorithms and their associated service curves.The delay bound analysis for different scheduling algorithms in specific scenarios is also conducted for more insights.

The Effectiveness of the Havriliak-Negami Model in Predicting the Master Curves of the Asphalt Blends with SBS Triblock Copolymer and Organic-Montmorillonite at Different Temperatures and Frequencies

The dynamic viscoelastic properties of asphalt AC-20 and its composites with Organic-Montmorillonite clay (OMMt) and SBS were modeled using the empirical Havriliak-Negami (HN) model, based on linear viscoelastic theory (LVE). The HN parameters, α, β, G0, G∞and τHN were determined by solving the HN equation across various temperatures and frequencies. The HN model successfully predicted the rheological behavior of the asphalt and its blends within the temperature range of 25˚C - 40˚C. However, deviations occurred between 40˚C - 75˚C, where the glass transition temperature Tg of the asphalt components and the SBS polymer are located, rendering the HN model ineffective for predicting the dynamic viscoelastic properties of composites containing OMMt under these conditions. Yet, the prediction error of the HN model dropped to 2.28% - 2.81% for asphalt and its mixtures at 100˚C, a temperature exceeding the Tg values of both polymer and asphalt, where the mixtures exhibited a liquid-like behavior. The exponent α and the relaxation time increased with temperature across all systems. Incorporating OMMt clay into the asphalt blends significantly enhanced the relaxation dynamics of the resulting composites.

Improving the Transmission Security of Vein Images Using a Bezier Curve and Long Short-Term Memory

The act of transmitting photos via the Internet has become a routine and significant activity.Enhancing the security measures to safeguard these images from counterfeiting and modifications is a critical domain that can still be further enhanced.This study presents a system that employs a range of approaches and algorithms to ensure the security of transmitted venous images.The main goal of this work is to create a very effective system for compressing individual biometrics in order to improve the overall accuracy and security of digital photographs by means of image compression.This paper introduces a content-based image authentication mechanism that is suitable for usage across an untrusted network and resistant to data loss during transmission.By employing scale attributes and a key-dependent parametric Long Short-Term Memory(LSTM),it is feasible to improve the resilience of digital signatures against image deterioration and strengthen their security against malicious actions.Furthermore,the successful implementation of transmitting biometric data in a compressed format over a wireless network has been accomplished.For applications involving the transmission and sharing of images across a network.The suggested technique utilizes the scalability of a structural digital signature to attain a satisfactory equilibrium between security and picture transfer.An effective adaptive compression strategy was created to lengthen the overall lifetime of the network by sharing the processing of responsibilities.This scheme ensures a large reduction in computational and energy requirements while minimizing image quality loss.This approach employs multi-scale characteristics to improve the resistance of signatures against image deterioration.The proposed system attained a Gaussian noise value of 98%and a rotation accuracy surpassing 99%.

Gaussian Distance Weighted Algorithm for Geometric Characteristics of Three-Dimensional Discrete Curves

Discrete curves are composed of a set of ordered discrete points distributed at the intersection of the scanning plane and the surface of the object. In order to accurately calculate the geometric characteristics of any point on the discrete curve, a distance-based Gaussian weighted algorithm is proposed to estimate the geometric characteristics of three-dimensional space discrete curves. According to the definition of discrete derivatives, the algorithm fully considers the relative position difference between a specific point and its neighboring points, introduces the distance weighting idea, and integrates the smoothing strategy. The experiment uses two spatial discrete curves for uniform and non-uniform sampling, and compares them with two commonly used estimation algorithms. The comparative analysis is carried out in terms of sampling density, neighborhood radius and noise resistance. The experimental results show that the Gaussian distance weighted algorithm is effective and provides an efficient algorithm for underground pipeline safety detection.

C^n-CONTINUOUS B-TYPE SPLINE CURVES WITH ITSLOCALIZATION INTERPOLATION AND APPROXIMATION

This paper presents a class of Cn- continuous B- type spline curves with some paramet- ric factors.The length of their local support is equal to4.Taking the different values of the parametric factors,the curves can become free- type curves or interpolate a set of given points even mix the both cases.When the parametric factors satisfy the certain conditions,the degrees of the curves can be decreased as low as possible.Besides,when all the parametric factors tend to zero,the curves globally approximate to the control polygon.

A PICARD-TYPE THEOREM AND A UNIQUENESS THEOREM OF NON-ARCHIMEDEAN ANALYTIC CURVES IN PROJECTIVE SPACE

In this article, we prove a Picard-type Theorem and a uniqueness theorem for non-Archimedean analytic curves in the projective space Pn(F), where the characteristic of F is 0 or positive. In the main results of this article, we ignore the zeros with large multiplicities.

INTERACTION CURVES OF LINEARLY INTENSIFYING POLYMERIC MATERIALS UNDER TENSILE-TORSIONAL STRESS

Theoretical and experimental research has been performed on the interaction curves and stress paths of crystalline polymeric materials PE and POM under tensile-torsional stress with a linearly intensifying model and in terms of the yield points undergoing Von Mises criterion.

Magnetic Field Curves and Magnetic Equipotential Surfaces around Crossing Electrical Wires Replacing Classical Magnetic Field Lines

This article is based on a recent model specifically defining magnetic field values around electrical wires. With this model, calculations of field around parallel wires were obtained. Now, this model is extended with the new concept of magnetic equipotential surface to magnetic field curves around crossing wires. Cases of single, double, and triple wires are described. Subsequent article will be conducted for more general scenarios where wires are neither infinite nor parallel.

The Origin of the Flat Rotation Curves in Spiral Galaxies: The Hidden Roles of Glitching SMDEOs and Emission of Gravitational Waves

Supermassive DEOs (SMDEOs) are cosmologically evolved objects made of irreducible incompressible supranuclear dense superfluids: The state we consider to govern the matter inside the cores of massive neutron stars. These cores are practically trapped in false vacua, rendering their detection by outside observers impossible. Based on massive parallel computations and theoretical investigations, we show that SMDEOs at the centres of spiral galaxies that are surrounded by massive rotating torii of normal matter may serve as powerful sources for gravitational waves carrying away roughly 1042 erg/s. Due to the extensive cooling by GWs, the SMDEO-Torus systems undergo glitching, through which both rotational and gravitational energies are abruptly ejected into the ambient media, during which the topologies of the embedding spacetimes change from curved into flatter ones, thereby triggering a burst gravitational energy of order 1059 erg. Also, the effects of glitches found to alter the force balance of objects in the Lagrangian-L1 region between the central SMDEO-Torus system and the bulge, enforcing the enclosed objects to develop violent motions, that may explain the origin of the rotational curve irregularities observed in the innermost part of spiral galaxies. Our study shows that the generated GWs at the centres of galaxies, which traverse billions of objects during their outward propagations throughout the entire galaxy, lose energy due to repeatedly squeezing and stretching the objects. Here, we find that these interactions may serve as damping processes that give rise to the formation of collective forces f∝m(r)/r, that point outward, endowing the objects with the observed flat rotation curves. Our approach predicts a correlation between the baryonic mass and the rotation velocities in galaxies, which is in line with the Tully-Fisher relation. The here-presented self-consistent approach explains nicely the observed rotation curves without invoking dark matter or modifying Newtonian gravitation in the low-field approximation.

融合注意力机制的YOLOv8-TS交通标志检测网络

道路交通标志识别是自动驾驶、车联网的重要组成部分,为进一步提高交通标志检测的精度和速度,提出一种基于YOLOv8s改进的YOLOv8-TS道路交通标志检测网络。首先,对YOLOv8s进行了整体的轻量化设计,并设计了Conv-G7S和CSP-G7S模块,减少了网络的参数量;其次,设计了CSP-SwinTransformer模块,强化了模型利用窗口内的特征信息进行上下文感知和建模的能力;然后,在颈部网络融合了卷积注意力机制(CBAM),强化了模型对不同通道、空间权重信息的学习;最后,对损失函数进行了改进,提升了边界框回归性能。实验结果表明,在中国道路交通标志TT100K数据集上,精确率(Precision)、平均精度(mAP@0.5)分别提高了6.9%、3.7%,而改进后模型的参数量下降了75.4%,模型的大小仅为5.8 MB,平均精度(mAP@0.5)达到96.5%,检测速度由126.58 f/s提升至136.99 f/s。

Efficient Flexible M-Tree Bulk Loading Using FastMap and Space-Filling Curves

Many database applications currently deal with objects in a metric space.Examples of such objects include unstructured multimedia objects and points of interest(POIs)in a road network.The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space.Studies have been conducted on the bulk loading of large datasets in an M-tree.However,because previous algorithms involve excessive distance computations and disk accesses,they perform poorly in terms of their index construction and search capability.This study proposes two efficient M-tree bulk loading algorithms.Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve,thereby significantly improving the index construction and search performance.Our second algorithm is an extension of the first,and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance.Through the use of various synthetic and real-world datasets,the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm.