CNKSR2 interactome analysis indicates its association with the centrosome/microtubule system

The protein connector enhancer of kinase suppressor of Ras 2(CNKSR2),present in both the postsynaptic density and cytoplasm of neurons,is a scaffolding protein with several protein-binding domains.Variants of the CNKSR2 gene have been implicated in neurodevelopmental disorders,particularly intellectual disability,although the precise mechanism involved has not yet been fully understood.Research has demonstrated that CNKSR2 plays a role in facilitating the localization of postsynaptic density protein complexes to the membrane,thereby influencing synaptic signaling and the morphogenesis of dendritic spines.However,the function of CNKSR2 in the cytoplasm remains to be elucidated.In this study,we used immunoprecipitation and high-resolution liquid chromatography-mass spectrometry to identify the interactors of CNKSR2.Through a combination of bioinformatic analysis and cytological experiments,we found that the CNKSR2 interactors were significantly enriched in the proteome of the centrosome.We also showed that CNKSR2 interacted with the microtubule protein DYNC1H1 and with the centrosome marker CEP290.Subsequent colocalization analysis confirmed the centrosomal localization of CNKSR2.When we downregulated CNKSR2 expression in mouse neuroblastoma cells(Neuro 2A),we observed significant changes in the expression of numerous centrosomal genes.This manipulation also affected centrosome-related functions,including cell size and shape,cell proliferation,and motility.Furthermore,we found that CNKSR2 interactors were highly enriched in de novo variants associated with intellectual disability and autism spectrum disorder.Our findings establish a connection between CNKSR2 and the centrosome,and offer new insights into the underlying mechanisms of neurodevelopmental disorders.

Functions of nuclear factor Y in nervous system development,function and health

Nuclear factor Y is a ubiquitous heterotrimeric transcription factor complex conserved across eukaryotes that binds to CCAAT boxes,one of the most common motifs found in gene promoters and enhancers.Over the last 30 years,research has revealed that the nuclear factor Y complex controls many aspects of brain development,including differentiation,axon guidance,homeostasis,disease,and most recently regeneration.However,a complete understanding of transcriptional regulatory networks,including how the nuclear factor Y complex binds to specific CCAAT boxes to perform its function remains elusive.In this review,we explore the nuclear factor Y complex’s role and mode of action during brain development,as well as how genomic technologies may expand understanding of this key regulator of gene expression.

Structural Complexity Analysis of Information Systems Based on Petri Nets

Aim To present a quantitative method for structural complexity analysis and evaluation of information systems. Methods Based on Petri net modeling and analysis techniques and with the aid of mathematical tools in general net theory(GNT), a quantitative method for structure description and analysis of information systems was introduced. Results The structural complexity index and two related factors, i.e. element complexity factor and connection complexity factor were defined, and the relations between them and the parameters of the Petri net based model of the system were derived. Application example was presented. Conclusion The proposed method provides a theoretical basis for quantitative analysis and evaluation of the structural complexity and can be applied in the general planning and design processes of the information systems.

Improved reduced-complexity bit and power allocation algorithms for multicarrier systems

Based on the iterative bit-filling procedure, a computationally efficient bit and power allocation algorithm is presented. The algorithm improves the conventional bit-filling algorithms by maintaining only a subset of subcarriers for computation in each iteration, which reduces the complexity without any performance degradation. Moreover, a modified algorithm with even lower complexity is developed, and equal power allocation is introduced as an initial allocation to accelerate its convergence. Simulation results show that the modified algorithm achieves a considerable complexity reduction while causing only a minor drop in performance.

THE CONVERGENCE OF A NEW MODIFIED BFGS METHOD WITHOUT LINE SEARCHES FOR UNCONSTRAINED OPTIMIZATION OR COMPLEXITY SYSTEMS

In this paper,a new modified BFGS method without line searches is proposed.Unlike traditionalBFGS method,this modified BFGS method is proposed based on the so-called fixed steplengthstrategy introduced by Sun and Zhang.Under some suitable assumptions,the global convergence andthe superlinear convergence of the new algorithm are established,respectively.And some preliminarynumerical experiments,which shows that the new Algorithm is feasible,is also reported.

Low Complexity Joint Hybrid Precoding for Millimeter Wave MIMO Systems

In millimeter wave(mmWave) multiple-input multiple-output(MIMO) systems, hybrid precoding has been widely used to overcome the severe propagation loss. In order to improve the spectrum efficiency with low complexity, we propose a joint hybrid precoding algorithm for single-user mmWave MIMO systems in this paper. By using the concept of equivalent channel, the proposed algorithm skillfully utilizes the idea of alternating optimization to complete the design of RF precoder and combiner. Then, the baseband precoder and combiner are computed by calculating the singular value decomposition of the equivalent channel. Simulation results demonstrate that the proposed algorithm can achieve satisfactory performance with quite low complexity. Moreover, we investigate the effects of quantization on the analog components and find that the proposed scheme is effective even with coarse quantization.

Low complexity method for spreading sequence estimation of DSSS signal in non-cooperative communication systems

It is a necessary step to estimate the spreading sequence of direct sequence spread spectrum （DSSS） signal for blind despreading and demodulation in non-cooperative communications. Two innovative and effective detection statistics are proposed to implement the synchronization and spreading sequence estimation procedure. The proposed algorithm also has a low computational complexity with only linear additions and modifications. Theoretical analysis and simulation results show that the algorithm performs quite well in low SNR environment, and is much better than all the existing typical algorithms with a comprehensive consideration both in performance and computational complexity.

Timing Advanced Estimation Algorithm of Low Complexity Based on DFT Spectrum Analysis for Satellite System

In satellite mobile communication system, relative movement of the satellite and the terminal will cause a large Doppler offset. Timing advanced estimation with Zadoff-Chu sequence is sensitive to the frequency offset. When the frequency offset is larger than one times subcarrier spacing, the value of peak cannot be detected at the receiving end. To suppress the larger Doppler frequency shift, this paper proposes a novel timing advanced estimation scheme(TAE-MCD) for satellite communication system. In this algorithm, t r a n s m i t t e d s i g n a l i s d i v i d e d i n t o Z C sequence and its conjugate sequence. Using multiplication and DFT operation to find the estimated peak at the receiving end, and make subtraction with the obtained sequences at last. The scheme can not only inhibit the adverse effects of large Doppler frequency shift in timing estimation effectively, but also reduce the computational complexity at the receiving end and improve the work efficiency of the hardware. Simulations results show that TAEMCD outperform the existing timing advanced estimation methods, on the condition of no additional time and frequency resource are needed.

A novel low-complexity power allocation algorithm based on the NOMA system in a low-speed environment

For future wireless communication systems,Power Domain Non-Orthogonal Multiple Access(PD-NOMA)using an advanced receiver has been considered as a promising radio access technology candidate.Power allocation plays an important role in the PD-NOMA system because it considerably affects the total throughput and Geometric Mean User Throughput(GMUT)performance.However,most existing studies have not completely accounted for the computational complexity of the power allocation process when the User Terminals(UTs)move in a slow fading channel environment.To resolve such problems,a power allocation method is proposed to considerably reduce the search space of a Full Search Power(FSP)allocation algorithm.The initial power reallocation coefficients will be set to start with former optimal values by the proposed Lemma before searching for optimal power reallocation coefficients based on total throughput performance.Step size and correction granularity will be adjusted within a much narrower power search range while invalid power combinations may be reasonably discarded during the search process.The simulation results show that the proposed power reallocation scheme can greatly reduce computational complexity while the total throughput and GMUT performance loss are not greater than 1.5%compared with the FSP algorithm.

A Low-Complexity Signal Detection Utilizing AOR Iterative Method for Massive MIMO Systems

Massive multiple-input multiple-output(MIMO) system is capable of substantially improving the spectral efficiency as well as the capacity of wireless networks relying on equipping a large number of antenna elements at the base stations. However, the excessively high computational complexity of the signal detection in massive MIMO systems imposes a significant challenge for practical hardware implementations. In this paper, we propose a novel minimum mean square error(MMSE) signal detection using the accelerated overrelaxation(AOR) iterative method without complicated matrix inversion, which is capable of reducing the overall complexity of the classical MMSE algorithm by an order of magnitude. Simulation results show that the proposed AOR-based method can approach the conventional MMSE signal detection with significant complexity reduction.

Complexity analyses of multi-wing chaotic systems

The complexities of multi-wing chaotic systems based on the modified Chen system and a multi-segment quadratic function are investigated by employing the statistical complexity measure （SCM） and the spectral entropy （SE） algorithm. How to choose the parameters of the SCM and SE algorithms is discussed. The results show that the complexity of the multi-wing chaotic system does not increase as the number of wings increases, and it is consistent with the results of the Grassberger-Procaccia （GP） algorithm and the largest Lyapunov exponent （LLE） of the multi-wing chaotic system.

An incommensurate fractional discrete macroeconomic system:Bifurcation,chaos,and complexity

This study proposes a novel fractional discrete-time macroeconomic system with incommensurate order.The dynamical behavior of the proposed macroeconomic model is investigated analytically and numerically.In particular,the zero equilibrium point stability is investigated to demonstrate that the discrete macroeconomic system exhibits chaotic behavior.Through using bifurcation diagrams,phase attractors,the maximum Lyapunov exponent and the 0–1 test,we verified that chaos exists in the new model with incommensurate fractional orders.Additionally,a complexity analysis is carried out utilizing the approximation entropy(ApEn)and C_(0)complexity to prove that chaos exists.Finally,the main findings of this study are presented using numerical simulations.

Evolvement of the System Complexity Degree under Different Time Scalings:an Illustration of the Traffic Flow System

It is investigable how the system scaling affects the system complexity degree. The traffic flow system is taken in this paper as an illustration to study this question. First, the Lempel-Ziv algorithm is introduced for accurate depiction of the complexity degree of the traffic flow system. We gain 3 actual sequences and 20s period traffic flow sequences on the basis of the measure of the traffic flow data; we gain 5 traffic flow sequences whose periods are between 1-5min by simulating the traffic flow system. By calculating the complicacy of the 11 sequences, we obtain two hypothesis: the complicacies of the same system are different under different time scalings; negative correlation exists between the complicacy and the time scaling of the system.

Nonlocality Distillation and Trivial Communication Complexity for High-Dimensional Systems

A nonlocality distillation protocol for arbitrary high-dimensional systems is proposed. We study the nonlocality distillation in the 2-input d-output bi-partite case. Firstly, we give the one-parameter nonlocal boxes and their correlated distilling protocol. Then, we generalize the one-parameter nonlocality distillation protocol to the twoparameter case. Furthermore, we introduce a contracting protocol testifying that the 2-input d-output nonlocal boxes make communication complexity trivial.

Complexity and Self-Organized Criticality of Solid Earth System(Ⅰ)

The author puts forward the proposition of Complexity and Self Organized Criticality of Solid Earth System in the light of: (1) the science of complexity studies the mechanisms of emergence of complexity and is the science of the 21st century, (2) the study of complexity of the earth system would be one of the growing points occupying a strategic position in the development of geosciences in the 21st century. By the proposition we try to cogitate from a new viewpoint the ancient yet ever new solid earth system. The author abstracts the fundamental problem of the solid earth system from the essence of the generalized geological systems and processes which reads: the complexity and self organized criticality of the global nature, structure and dynamical behavior of the whole solid earth system emerging from the multiple coupling and superposition of non linear interactions among the multicomponents of the earths material and the multiple generalized geological (geological, geophysical, and geochemical) processes . Starting from this cognizance the author proposes eight major themes and the methodology of researches on the complexity and self organized criticality of the solid earth system.

Low Complexity Multiuser Detection Algorithm for Multi-Beam Satellite Systems

The minimum mean square error-successive interference cancellation( MMSE-SIC) multiuser detection algorithm has high complexity and long processing latency. A multiuser detection algorithm is proposed for multi-beam satellite systems in order to decrease the complexity and latency. The spot beams are grouped base on the distance between them in the proposed algorithm. Some groups are detected in parallel after a crucial group-wise interference cancellation. Furthermore, the multi-stage structure is introduced to improve the performance. Simulation results show that the proposed algorithm can achieve better performance with less complexity compared with the existing group detection algorithm. Moreover,the proposed algorithm using one stage can reduce the complexity over the fast MMSE-SIC and existing group detection algorithm by 9% and20. 9%. The processing latency is reduced significantly compared with the MMSE-SIC.

Air Traffic Operation Complexity Analysis Based on Metrics System

In order to quantitatively analyze air traffic operation complexity,multidimensional metrics were selected based on the operational characteristics of traffic flow.The kernel principal component analysis method was utilized to reduce the dimensionality of metrics,therefore to extract crucial information in the metrics.The hierarchical clustering method was used to analyze the complexity of different airspace.Fourteen sectors of Guangzhou Area Control Center were taken as samples.The operation complexity of traffic situation in each sector was calculated based on real flight radar data.Clustering analysis verified the feasibility and rationality of the method,and provided a reference for airspace operation and management.

Analysis and evaluation of structural complexity of circular economy system＇s industrial chain

This paper examined the method to evaluate structural complexity of circular economy system＇s industrial chain, which applied entropy information and hierarchical metrics to produce complexity degrees according to the theory of complex system. We developed an evaluation model to make a general metrics for circular economy system of industrial chains. The development of the evaluation tree drew upon five factors to identify the structural complexity. The evaluation model generated unitive entropy information from six data definition （node, level of community, metabolic span, degree of node, number of relation and connectivity of node） according to the evaluation tree. The industrial chains of Tashan circular economy park of Datong Coal Mine Group and Gujiao circular economy park of Xishan Coal-Electricity Group were evaluated by the proposed method. The key factors stunted by the decline of structural complexity were identified and the unitive metrics of entropy information of the industrial chain was shown for realigning the circular economy systems.

Low-complexity resource allocation in rate-constrained OFDMA downlink systems

A resource allocation algorithm with quality of service(QoS) guarantees in a cellular orthogonal frequency division multiple access(OFDMA) network is proposed.The algorithm is a modified water-filling algorithm.In the first phase,power and subcarriers are allocated together,and in the second phase,users' minimum data rate requ irements are met,while the remaining resources are allocated in order to maximi ze sum rate.It is a cell-level algorithm,and its main advantages are low implementation complexity and capacity of maintaining higher ratio of QoS satisf ying users' requirements.Simulation results show that this scheme outperform s other proportional resour ce allocation schemes.

Study on complexity of Sutong Bridge's objectives system and its meta-synthesis management

Objectives define the boundaries of complex engineering system.It is a hard work to identify the specific objectives of a complex engineering system.The objectives system development needs a complicated process,from nix to prototype,and to final definition.The total process will cover the following course:from chaos to well-ordered;from qualitativeness to combination of quantitativeness and qualitativenss,then from qualitativeness to quantitativeness(a recurrent process),expert experience and theoretical science,rationality and sensibility,synthesis analysis and meta-synthesis,routinization and non-routinization.Such process is explicit in phase development yet overlapped;mutually confined yet mutually independent;permeated conflicts yet pregnant in harmony.This article explores the complexity of Sutong Bridge's objectives development and the process of meta-synthesis in the Sutong Bridge engineering.