Origin of Magnetic Fields of Stellar Objects in the Universe Based on the 5D Projection Theory

Beginning with a 5D homogeneous universe [1], we have provided a plausible explanation of the self-rotation phenomenon of stellar objects previously with illustration of large number of star samples [2], via a 5D-4D projection. The origin of such rotation is the balance of the angular momenta of stars and that of positive and negative charged e-trino pairs, within a 3D ⊗1D?void of the stellar object, the existence of which is based on conservation/parity laws in physics if one starts with homogeneous 5D universe. While the in-phase e-trino pairs are proposed to be responsible for the generation of angular momentum, the anti-phase but oppositely charge pairs necessarily produce currents. In the 5D to 4D projection, one space variable in the 5D manifold was compacted to zero in most other 5D theories (including theories of Kaluza-Klein and Einstein [3] [4]). We have demonstrated, using the Fermat’s Last Theorem [5], that for validity of gauge invariance at the 4D-5D boundary, the 4th space variable in the 5D manifold is mapped into two current rings at both magnetic poles as required by Perelman entropy mapping;these loops are the origin of the dipolar magnetic field. One conclusion we draw is that there is no gravitational singularity, and hence no black holes in the universe, a result strongly supported by the recent discovery of many stars with masses well greater than 100 solar mass [6] [7] [8], without trace of phenomena observed (such as strong gamma and X ray emissions), which are supposed to be associated with black holes. We analyze the properties of such loop currents on the 4D-5D boundary, where Maxwell equations are valid. We derive explicit expressions for the dipolar fields over the whole temperature range. We then compare our prediction with measured surface magnetic fields of many stars. Since there is coupling in distribution between the in-phase and anti-phase pairs of e-trinos, the generated mag-netic field is directly related to the angular momentum, leading to the result that the magnetic field can be expressible in terms of only the mechanical variables (mass M, radius R, rotation period P)of a star, as if Maxwell equations are “hidden”. An explanation for the occurrence of this “un-expected result” is provided in Section (7.6). Therefore we provide satisfactory answers to a number of “mysteries” of magnetism in astrophysics such as the “Magnetic Bode’s Relation/Law” [9] and the experimental finding that B-P graph in the log-log plot is linear. Moreover, we have developed a new method for studying the relations among the data (M, R, P) during stellar evolution. Ten groups of stellar objects, effectively over 2000 samples are used in various parts of the analysis. We also explain the emergence of huge magnetic field in very old stars like White Dwarfs in terms of formation of 2D Semion state on stellar surface and release of magnetic flux as magnetic storms upon changing the 2D state back to 3D structure. Moreover, we provide an explanation, on the ground of the 5D theory, for the detection of extremely weak fields in Venus and Mars and the asymmetric distribution of magnetic field on the Martian surface. We predict the equatorial fields B of the newly discovered Trappist-1 star and the 6 nearest planets. The log B?−?log P graph for the 6 planets is linear and they satisfy the Magnetic Bode’s relation. Based on the above analysis, we have discovered several new laws of stellar magnetism, which are summarized in Section (7.6).

New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem

In this paper, we propose two hybrid inertial CQ projection algorithms with linesearch process for the split feasibility problem. Based on the hybrid CQ projection algorithm, we firstly add the inertial term into the iteration to accelerate the convergence of the algorithm, and adopt flexible rules for selecting the stepsize and the shrinking projection region, which makes an optimal stepsize available at each iteration. The shrinking projection region is the intersection of three sets, which are the set C and two hyperplanes. Furthermore, we modify the Armijo-type line-search step in the presented algorithm to get a new algorithm.The algorithms are shown to be convergent under certain mild assumptions. Besides, numerical examples are given to show that the proposed algorithms have better performance than the general CQ algorithm.

Research on Automatic Elimination of Laptop Computer in Security CT Images Based on Projection Algorithm and YOLOv7-Seg

In civil aviation security screening, laptops, with their intricate structural composition, provide the potential for criminals to conceal dangerous items. Presently, the security process necessitates passengers to individually present their laptops for inspection. The paper introduced a method for laptop removal. By combining projection algorithms with the YOLOv7-Seg model, a laptop’s three views were generated through projection, and instance segmentation of these views was achieved using YOLOv7-Seg. The resulting 2D masks from instance segmentation at different angles were employed to reconstruct a 3D mask through angle restoration. Ultimately, the intersection of this 3D mask with the original 3D data enabled the successful extraction of the laptop’s 3D information. Experimental results demonstrated that the fusion of projection and instance segmentation facilitated the automatic removal of laptops from CT data. Moreover, higher instance segmentation model accuracy leads to more precise removal outcomes. By implementing the laptop removal functionality, the civil aviation security screening process becomes more efficient and convenient. Passengers will no longer be required to individually handle their laptops, effectively enhancing the efficiency and accuracy of security screening.

Perspective Projection Algorithm Enabling Mobile Device’s Indoor Positioning

In order to improve the user’s satisfaction with the augmented reality (AR) technology and the accuracy of the service, it is important to obtain the exact position of the user. Frequently used techniques for finding outdoors locations is the global positioning system (GPS), which is less accurate indoors. Therefore, an indoor position is measured by comparing the reception level about access point (AP) signal of wireless fidelity (Wi-Fi) or using bluetooth low energy (BLE) tags. However, Wi-Fi and Bluetooth require additional hardware installation. In this paper, the proposed method of estimating the user’s position uses an indoor image and indoor coordinate map without additional hardware installation. The indoor image has several feature points extracted from fixed objects. By matching the feature points with the feature points of the user image, we can obtain the position of the user on the Indoor map by obtaining six or more pixel coordinates from the user image and solving the solution using the perspective projection formula. The experimental results show that the user position can be obtained more accurately in the indoor environment by using only the software without additional hardware installation.

Variable step-size affine projection algorithm based on global speech absence probability for adaptive feedback cancellation

A novel approach is proposed for improving adaptive feedback cancellation using a variable step-size affine projection algorithm(VSS-APA) based on global speech absence probability(GSAP).The variable step-size of the proposed VSS-APA is adjusted according to the GSAP of the current frame.The weight vector of the adaptive filter is updated by the probability of the speech absence.The performance measure of acoustic feedback cancellation is evaluated using normalized misalignment.Experimental results demonstrate that the proposed approach has better performance than the normalized least mean square(NLMS) and the constant step-size affine projection algorithms.

Transcriptional regulation in the development and dysfunction of neocortical projection neurons

Glutamatergic projection neurons generate sophisticated excitatory circuits to integrate and transmit information among different cortical areas,and between the neocortex and other regions of the brain and spinal cord.Appropriate development of cortical projection neurons is regulated by certain essential events such as neural fate determination,proliferation,specification,differentiation,migration,survival,axonogenesis,and synaptogenesis.These processes are precisely regulated in a tempo-spatial manner by intrinsic factors,extrinsic signals,and neural activities.The generation of correct subtypes and precise connections of projection neurons is imperative not only to support the basic cortical functions(such as sensory information integration,motor coordination,and cognition)but also to prevent the onset and progression of neurodevelopmental disorders(such as intellectual disability,autism spectrum disorders,anxiety,and depression).This review mainly focuses on the recent progress of transcriptional regulations on the development and diversity of neocortical projection neurons and the clinical relevance of the failure of transcriptional modulations.

Enhancing Cancer Classification through a Hybrid Bio-Inspired Evolutionary Algorithm for Biomarker Gene Selection

In this study,our aim is to address the problem of gene selection by proposing a hybrid bio-inspired evolutionary algorithm that combines Grey Wolf Optimization(GWO)with Harris Hawks Optimization(HHO)for feature selection.Themotivation for utilizingGWOandHHOstems fromtheir bio-inspired nature and their demonstrated success in optimization problems.We aimto leverage the strengths of these algorithms to enhance the effectiveness of feature selection in microarray-based cancer classification.We selected leave-one-out cross-validation(LOOCV)to evaluate the performance of both two widely used classifiers,k-nearest neighbors(KNN)and support vector machine(SVM),on high-dimensional cancer microarray data.The proposed method is extensively tested on six publicly available cancer microarray datasets,and a comprehensive comparison with recently published methods is conducted.Our hybrid algorithm demonstrates its effectiveness in improving classification performance,Surpassing alternative approaches in terms of precision.The outcomes confirm the capability of our method to substantially improve both the precision and efficiency of cancer classification,thereby advancing the development ofmore efficient treatment strategies.The proposed hybridmethod offers a promising solution to the gene selection problem in microarray-based cancer classification.It improves the accuracy and efficiency of cancer diagnosis and treatment,and its superior performance compared to other methods highlights its potential applicability in realworld cancer classification tasks.By harnessing the complementary search mechanisms of GWO and HHO,we leverage their bio-inspired behavior to identify informative genes relevant to cancer diagnosis and treatment.

Harnessing the Power of Artificial Intelligence in Neuromuscular Disease Rehabilitation: A Comprehensive Review and Algorithmic Approach

Neuromuscular diseases present profound challenges to individuals and healthcare systems worldwide, profoundly impacting motor functions. This research provides a comprehensive exploration of how artificial intelligence (AI) technology is revolutionizing rehabilitation for individuals with neuromuscular disorders. Through an extensive review, this paper elucidates a wide array of AI-driven interventions spanning robotic-assisted therapy, virtual reality rehabilitation, and intricately tailored machine learning algorithms. The aim is to delve into the nuanced applications of AI, unlocking its transformative potential in optimizing personalized treatment plans for those grappling with the complexities of neuromuscular diseases. By examining the multifaceted intersection of AI and rehabilitation, this paper not only contributes to our understanding of cutting-edge advancements but also envisions a future where technological innovations play a pivotal role in alleviating the challenges posed by neuromuscular diseases. From employing neural-fuzzy adaptive controllers for precise trajectory tracking amidst uncertainties to utilizing machine learning algorithms for recognizing patient motor intentions and adapting training accordingly, this research encompasses a holistic approach towards harnessing AI for enhanced rehabilitation outcomes. By embracing the synergy between AI and rehabilitation, we pave the way for a future where individuals with neuromuscular disorders can access tailored, effective, and technologically-driven interventions to improve their quality of life and functional independence.

How do lateral septum projections to the ventral CA1 influence sociability?

Social dysfunction is a risk factor for several neuropsychiatric illnesses.Previous studies have shown that the lateral septum(LS)-related pathway plays a critical role in mediating social behaviors.Howeve r,the role of the connections between the LS and its downstream brain regions in social behavio rs remains unclea r.In this study,we conducted a three-chamber test using electrophysiological and chemogenetic approaches in mice to determine how LS projections to ventral CA1(vCA1)influence sociability.Our res ults showed that gamma-aminobutyric acid(GABA)-e rgic neuro ns were activated following social experience,and that social behavio rs were enhanced by chemogenetic modulation of these neurons.Moreover,LS GABAergic neurons extended their functional neural connections via vCA1 glutamatergic pyramidal neurons,and regulating LSGABA→vCA1Gluneural projections affected social behaviors,which were impeded by suppressing LSprojecting vCA1 neuronal activity or inhibiting GABAAreceptors in vCA1.These findings support the hypothesis that LS inputs to the vCA1 can control social prefe rences and social novelty behaviors.These findings provide new insights rega rding the neural circuits that regulate sociability.

Development of a Post Quantum Encryption Key Generation Algorithm Using Electromagnetic Wave Propagation Theory

In today’s rapid widespread of digital technologies into all live aspects to enhance efficiency and productivity on the one hand and on the other hand ensure customer engagement, personal data counterfeiting has become a major concern for businesses and end-users. One solution to ensure data security is encryption, where keys are central. There is therefore a need to find robusts key generation implementation that is effective, inexpensive and non-invasive for protecting and preventing data counterfeiting. In this paper, we use the theory of electromagnetic wave propagation to generate encryption keys.

A Block Parallel l_0-Norm Penalized Shrinkage and Widely Linear Affine Projection Algorithm for Adaptive Filter

To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm constraint to promote its application for sparse system. Second, we use the shrinkage denoising method to improve its track ability. Third, we adopt the widely linear processing to take advantage of the non-circular properties of communication signals. Last, to reduce the high computational complexity and make it easy to implemented, we utilize the dichotomous coordinate descent(DCD) iterations and the parallel processing to deal with the tapweight update in the proposed algorithm. To verify the convergence condition of the proposed algorithm, we also analyze its steadystate behavior. Several simulation are done and results show that the proposed algorithm can achieve a faster convergence speed and a lower steady-state misalignment than similar APA-type algorithm. When apply the proposed algorithm in the decision feedback equalizer(DFE), the bite error rate(BER) decreases obviously.

Hybrid alternate projection algorithm and its application for practical conformal array pattern synthesis

Based on the fabricated 12-element cavity-backed microstrip sector cylinder array,a novel hybrid alternate projection algorithm（HAPA）,which combines analytical method with numerical techniques effectively,is proposed for synthesizing the pattern of practical conformal array.The algorithm applies the variable direction aperture projection method with mutual coupling correction techniques to provide the good initial excitations of elements to the enhanced alternate projection algorithm（EAPA）.In order to do further optimization,which improves the convergent speed of the algorithm significantly.Finally,the HAPA has been applied to the fabricated sector cylinder array with mutual coupling considered.The results of synthesized patterns,such as low sidelobe with null points formed pattern,beam scanning with low sidelobe pattern and the shaped beam pattern are presented.It demonstrates the validity of HAPA in practical conformal array synthesis.

Deep Transfers of p-Class Tower Groups

Let p be a prime. For any finite p-group G, the deep transfers T H,G ' : H / H ' → G ' / G " from the maximal subgroups H of index (G:H) = p in G to the derived subgroup G ' are introduced as an innovative tool for identifying G uniquely by means of the family of kernels ùd(G) =(ker(T H,G ')) (G: H) = p. For all finite 3-groups G of coclass cc(G) = 1, the family ùd(G) is determined explicitly. The results are applied to the Galois groups G =Gal(F3 (∞)/ F) of the Hilbert 3-class towers of all real quadratic fields F = Q(√d) with fundamental discriminants d > 1, 3-class group Cl3(F) □ C3 × C3, and total 3-principalization in each of their four unramified cyclic cubic extensions E/F. A systematic statistical evaluation is given for the complete range 1 d 7, and a few exceptional cases are pointed out for 1 d 8.

A Study of EM Algorithm as an Imputation Method: A Model-Based Simulation Study with Application to a Synthetic Compositional Data

Compositional data, such as relative information, is a crucial aspect of machine learning and other related fields. It is typically recorded as closed data or sums to a constant, like 100%. The statistical linear model is the most used technique for identifying hidden relationships between underlying random variables of interest. However, data quality is a significant challenge in machine learning, especially when missing data is present. The linear regression model is a commonly used statistical modeling technique used in various applications to find relationships between variables of interest. When estimating linear regression parameters which are useful for things like future prediction and partial effects analysis of independent variables, maximum likelihood estimation (MLE) is the method of choice. However, many datasets contain missing observations, which can lead to costly and time-consuming data recovery. To address this issue, the expectation-maximization (EM) algorithm has been suggested as a solution for situations including missing data. The EM algorithm repeatedly finds the best estimates of parameters in statistical models that depend on variables or data that have not been observed. This is called maximum likelihood or maximum a posteriori (MAP). Using the present estimate as input, the expectation (E) step constructs a log-likelihood function. Finding the parameters that maximize the anticipated log-likelihood, as determined in the E step, is the job of the maximization (M) phase. This study looked at how well the EM algorithm worked on a made-up compositional dataset with missing observations. It used both the robust least square version and ordinary least square regression techniques. The efficacy of the EM algorithm was compared with two alternative imputation techniques, k-Nearest Neighbor (k-NN) and mean imputation (), in terms of Aitchison distances and covariance.

New Regularization Algorithms for Solving the Deconvolution Problem in Well Test Data Interpretation

Two new regularization algorithms for solving the first-kind Volterra integral equation, which describes the pressure-rate deconvolution problem in well test data interpretation, are developed in this paper. The main features of the problem are the strong nonuniform scale of the solution and large errors (up to 15%) in the input data. In both algorithms, the solution is represented as decomposition on special basic functions, which satisfy given a priori information on solution, and this idea allow us significantly to improve the quality of approximate solution and simplify solving the minimization problem. The theoretical details of the algorithms, as well as the results of numerical experiments for proving robustness of the algorithms, are presented.

Binary Gravitational Search based Algorithm for Optimum Siting and Sizing of DG and Shunt Capacitors in Radial Distribution Systems

This paper presents a binary gravitational search algorithm (BGSA) is applied to solve the problem of optimal allotment of DG sets and Shunt capacitors in radial distribution systems. The problem is formulated as a nonlinear constrained single-objective optimization problem where the total line loss (TLL) and the total voltage deviations (TVD) are to be minimized separately by incorporating optimal placement of DG units and shunt capacitors with constraints which include limits on voltage, sizes of installed capacitors and DG. This BGSA is applied on the balanced IEEE 10 Bus distribution network and the results are compared with conventional binary particle swarm optimization.

基于遗传算法和最小二乘支持向量机的织物剪切性能预测

提出了一种基于最小二乘支持向量机的织物剪切性能预测模型,并且采用遗传算法进行最小二乘支持向量机的参数优化,将获得的样本进行归一化处理后,将其输入预测模型以得到预测结果.仿真结果表明,基于最小二乘支持向量机的预测模型比BP神经网络和线性回归方法具有更高的精度和范化能力. Abstract： A new method is proposed to predict the fabric shearing property with least square support vector machines ( LS-SVM ). The genetic algorithm is investigated to select the parameters of LS-SVM models as a means of improving the LS- SVM prediction. After normalizing the sampling data, the sampling data are inputted into the model to gain the prediction result. The simulation results show the prediction model gives better forecasting accuracy and generalization ability than BP neural network and linear regression method.

Active micro-vibration control based on improved variable step size LMS algorithm

The contradiction of variable step size least mean square(LMS)algorithm between fast convergence speed and small steady-state error has always existed.So,a new algorithm based on the combination of logarithmic and symbolic function and step size factor is proposed.It establishes a new updating method of step factor that is related to step factor and error signal.This work makes an analysis from 3 aspects:theoretical analysis,theoretical verification and specific experiments.The experimental results show that the proposed algorithm is superior to other variable step size algorithms in convergence speed and steady-state error.

Enhanced Euclid Algorithm for Modular Multiplicative Inverse and Its Application in Cryptographic Protocols

Numerous cryptographic algorithms (ElGamal, Rabin, RSA, NTRU etc) require multiple computations of modulo multiplicative inverses. This paper describes and validates a new algorithm, called the Enhanced Euclid Algorithm, for modular multiplicative inverse (MMI). Analysis of the proposed algorithm shows that it is more efficient than the Extended Euclid algorithm (XEA). In addition, if a MMI does not exist, then it is not necessary to use the Backtracking procedure in the proposed algorithm;this case requires fewer operations on every step (divisions, multiplications, additions, assignments and push operations on stack), than the XEA. Overall, XEA uses more multiplications, additions, assignments and twice as many variables than the proposed algorithm.