Cognitive performance and differentiation of B-SNIP psychosis Biotypes: Algorithmic Diagnostics for Efficient Prescription of Treatments (ADEPT) - 2 by Brett A. Clementz, Ishanu Chattopadhyay, S. Kristian Hill, Jennifer E. McDowell, Sarah K. Keedy, David A. Parker, Rebekah L. Trotti, Elena I. Ivleva, Matcheri S. Keshavan, Elliot S. Gershon, Godfrey D. Pearlson, Carol A. Tamminga, Robert D. Gibbons

“…Method: Clinical assessments from ADEPT-CLIN plus 18 cognitive measures from 1907 individuals with a B-SNIP psychosis Biotype were used to create an additional diagnostic algorithm called ADEPT-COG. Extremely randomized trees were used to create this low burden classifier. …”
Get full text

Apply a deep learning hybrid model optimized by an Improved Chimp Optimization Algorithm in PM2.5 prediction by Ming Wei, Xiaopeng Du

“…Subsequently, a one-dimensional convolutional neural network (1DCNN) with efficient feature extraction capability is used to extract dynamic features from sequences. The extracted feature vector sequences are then fed into a Long Short-Term Memory Network (LSTM). …”
Get full text

Reconstruction of sparse check matrix for LDPC at high bit error rate by Zhaojun WU, Limin ZHANG, Zhaogen ZHONG, Renxin LIU

“…In order to reconstruct the sparse check matrix of LDPC, a new algorithm which could directly reconstruct the LDPC was proposed.Firstly, according to the principle of the traditional reconstruction algorithm, the defects of the traditional algorithm and the reasons for the defects were analyzed in detail.Secondly, based on the characteristics of sparse matrix, some bit sequences in code words were randomly extracted for Gaussian elimination.At the same time, in order to reliably realize that the extracted bits sequence could contain parity check nodes, the multiple random variables were determined based on the probability of containing check nodes in one extraction.Finally, the statistical characteristics of LDPC under the suspected check vector was analyzed.Based on the minimum error decision rule, the sparse check vector was determined.The simulation results show that the rate of reconstruction of most LDPC in IEEE 802.11 protocol can reach more than 95% at BER of 0.001, and the noise robustness of the proposed method is better than that of the traditional algorithm.At the same time, the new algorithm not only does not need sparseness of parity check matrix, but also has the good performance for both diagonal and non-diagonal check matrix.…”
Get full text

Optimal Active-Reactive Power Dispatch for Distribution Network With Carbon Trading Based on Improved Multi-Objective Equilibrium Optimizer Algorithm by Furong Tu, Sumei Zheng, Kuncan Chen

“…The IMOEO algorithm incorporates a Sobol sequence initialization method, dynamic adjustment factors, and particles that employ various evolutionary strategies based on the crowding distance. …”
Get full text

A bird’s-eye view of the biological mechanism and machine learning prediction approaches for cell-penetrating peptides by Maduravani Ramasundaram, Honglae Sohn, Thirumurthy Madhavan

“…ML classifiers, such as support vector machine (SVM), random forest (RF), gradient-boosted decision trees (GBDT), and different types of artificial neural networks (ANN), are commonly used for CPP prediction with cross-validation performance evaluation. …”
Get full text

Exploration of the Mountainous Urban Rail Transit Resilience Under Extreme Rainfalls: A Case Study in Chongqing, China by Chenhui Liu, Xue Su, Zhichun Wu, Yingjun Zhang, Cuizhu Zhou, Xiangguo Wu, Yong Huang

“…When all affected nodes fail, network service efficiency decreases by 84.0% and 75.2% under landslide and flood disasters, respectively. Compared with the random recovery strategy, recovery strategies based on topological importance and service efficiency index, the optimal recovery strategy based on genetic algorithm performs much better.…”
Get full text

Victimization analysis model of user network behavior based on network traffic by Shengli ZHOU, Xiaoyang XU

“…The analysis of network victimization is of great significance to the prevention and control of telecom fraud.By studying the network traffic generated by the interaction between users and websites, a victimization identification model of telecom fraud crime based on network behavior flow analysis was proposed, the association rules between different behavior characteristics were analyzed, the behavior sequence features were reconstructed, and the victimization of network behavior sequence with random forest algorithm was evaluated.Based on the network behavior data set of public security organs, the experiment proves that the model can effectively improve the recognition accuracy of network behavior victimization.…”
Get full text

Perfect secrecy cryptosystem with nonuniform distribution of keys by Chuanjun TIAN

“…More strictly mathematical concepts of infinite perfect secrecy and random “one-time pad” cryptosystem in theory were presented,and the whole secure communication system was divided into two stages:design of a basic cryptosystem and one of its applications.How to design a basic cryptosystem by using a group of orthogonal Latin squares was first studied and an example to illustrate how to design nonlinear encryption transformations for a basic cryptosystem was given.Then,how to design the sequence of keys by using random method with nonuniform distribution was discussed,and it was strictly proven in theory that the infinite random “one-time pad” cryptosystem based on the designed basic cryptosystem was of perfect secrecy.Since the obtained result generalizes the existing one for random “one-time pad” cryptosystem to be perfect by using a basic cryptosystem with modulo addition,it may be used as a wider ideal simulated prototype to design stream cipher algorithms.Since the number of basic cryptosystems that can be designed is much more than one of the common basic cryptosystems with modulo addition,the obtained result is effective supplement and perfection to mainstream design method for the current stream cryptosystems.…”
Get full text

Research on cloud dynamic public key information security based on elliptic curve and primitive Pythagoras by Zhenlong Man, Jianmeng Liu, Fan Zhang, Xiangfu Meng

“…In the diffusion algorithm, the three-side rotation characteristic of the Rubik’s cube is simulated, the binary sequence of pixel values is stored at eight vertices of the cube, the cube is rotated according to the key value, and the changed 8 new binary numbers are XOR operated with the random sequence to obtain the new pixel value. …”
Get full text

Shortest-Path Optimization of Ship Diesel Engine Disassembly and Assembly Based on AND/OR Network by Deng-Zhi Chen, Chen Wei, Guo-Ling Jia, Zhi-Hua Hu

“…Then, we devised a mixed-integer linear program (MILP) to optimize the SDEDA sequence based on the AND/OR network. Considering the flow balance in the AND/OR network, we developed exact algorithms and random search algorithms using breadth-first, branch cut and depth-first strategies to minimize the cost of the shortest path that represents an optimal sequence of D&A operations. …”
Get full text

Design of multi-key encryption method by Yuqing ZHONG, Hao WANG, Zebing LIN, Min WANG, Liye CHEN

“…In order to improve the security in the process of information transmission,the current encryption methods were studied,and the research status was reported which increased the security of encryption by processing the key.According to the principle of segmenting and grouping data in the process of sending and encrypting,a method of multi-key encryption was designed:the segmenting key group and grouping key group were generated by the source key and random number,and the corresponding key was selected for each segmented and grouped data by its sequence number according to the matching algorithm.This method realized the encryption of multi-key in the process of information transmission.Finally,on the one hand,MATLAB was used to test and verify the encryption efficiency of this method.On the other hand,the security of this method was analyzed from the theoretical and mathematical perspective,comparing with the traditional method.It is concluded that this method can increase the security of the traditional method without too much cost much cost.…”
Get full text

EMD-GM-ARMA Model for Mining Safety Production Situation Prediction by Menglong Wu, Yicheng Ye, Nanyan Hu, Qihu Wang, Huimin Jiang, Wen Li

“…First of all, according to the nonstationary characteristics of the mining safety accident time series, nonstationary original time series were decomposed into high- and low-frequency signals using the EMD algorithm, which represents the overall trend and random disturbances, respectively. …”
Get full text

A multi-scale rotated ship targets detection network for remote sensing images in complex scenarios by Siyu Li, Fei Yan, Yunqing Liu, Yuzhuo Shen, Lan Liu, Ke Wang

“…This network combines ARC adaptive rotating convolution with a multi-scale feature fusion mechanism to enhance the model’s perceptual capability, addressing the issues of limited target feature information and random orientation angles. The proposed algorithm is validated on two public remote sensing image datasets, HRSC2016 and DOTA. …”
Get full text

Lightweight opportunistic routing forwarding strategy based on Markov chain by Feng LI, Ya-li SI, Zhen CHEN, Li-min SHEN

“…A lightweight opportunistic routing forwarding strategy (MOR) was proposed based on Markov chain.In the scheme,the execute process of network was divided into a plurality of equal time period,and the random encounter state of node in each time period was represented by activity degree.The state sequence of a plurality of continuous time period constitutes a discrete Markov chain.The activity degree of encounter node was estimated by Markov model to predict its state of future time period,which can enhance the accuracy of activity degree estimation.Then,the method of comprehensive evaluating forwarding utility was designed based on the activity degree of node and the average encounter interval.MOR used the utility of node for making a routing forwarding decision.Each node only maintained a state of last time period and a state transition probability matrix,and a vector recording the average encounter interval of nodes.So,the routing forwarding decision algorithm was simple and efficient,low time and space complexity.Furthermore,the method was proposed to set optimal number of the message copy based on multiple factors,which can effectively balance the utilization of network resources.Results show that compared with existing algorithms,MOR algorithm can effectively increase the delivery ratio and reduce the delivery delay,and lower routing overhead ratio.…”
Get full text

HOC Based Blind Identification of Hydroturbine Shaft Volterra System by Bing Bai, Lixiang Zhang

“…When using optimization method to identify the time domain kernels, we combined the traditional optimization algorithm (direct search method) with genetic algorithm (GA) and constituted the hybrid genetic algorithm (HGA). …”
Get full text

A Torus-Chaotic System and Its Pseudorandom Properties by Jizhao Liu, Xiangzi Zhang, Qingchun Zhao, Jing Lian, Fangjun Huang, Yide Ma

“…Furthermore, the pseudorandom properties of output sequence are well studied and a random number generator algorithm is proposed, which has the potential of being used in several cyber security systems such as the verification code, secure QR code, and some secure communication protocols.…”
Get full text

Topology control based on dynamic graph embedding in Internet of vehicles by Yanfei SUN, Jiazheng YIN, Jin QI, Xiaoxuan HU, Mengting CHEN, Zhenjiang DONG

“…It is contrasted with random network, DeepWalk methods,Node2Vec methods and dynamic growth (DN) algorithm. …”
Get full text

New hash function based on C-MD structure and chaotic neural network by Liquan CHEN, Yuhang ZHU, Yu WANG, Zhongyuan QIN, Yang MA

“…In recent years, widely used hash algorithms such as MD5 and SHA-1 have been found to have varying degrees of security risks.The iterative structure of the SHA-2 algorithm is similar to that of SHA-1, making it vulnerable to attacks as well.Meanwhile, SHA-3 has a complex internal structure and low implementation efficiency.To address these issues, a keyed hash function was designed and implemented based on chaotic neural network and C-MD structure.The approach involved improving the Merkle-Damgard structure by proposing the chaotic neural network Merkle-Damgard (C-MD) structure.This structure can be used to design a hash function that can withstand attacks such as the middle attack, multiple collision attack, and second pre-image attack for long information.Besides, the chaotic neural network was used as the compression function to increase the complexity of the hash function and improve its collision resistance, while also enabling it to output multiple lengths.Moreover, a plaintext preprocessor was designed, which used the coupled image lattice to generate chaos sequence related to the length of the plaintext to fill the plaintext, thus enhancing the ability of the hash function to resist length expansion attacks.Simulation results demonstrate that the proposed hash function performs faster than SHA-2, SHA-3 and the same type of chaotic hash function proposed by Teh et al.It can resist second pre-image attack, multi-collision attack and differential attack, while also exhibiting better collision resistance and mapping uniformity.In addition, the proposed Hash function can output Hash values of different lengths, making it suitable for use in digital signature, key generation, Hash-based message authentication code, deterministic random bit generator, and other application fields.…”
Get full text

The "one-group-one-cipher" cryptograph of block-cipher based on chaotic by XUAN Lei1, YAN Ji-ning1

“…The"one-group-one-cipher"algorithm used the sequence from chaotic mapping as sub-key for block cipher was presented to solve the problem of weak keys existing in currently combined cipher algorithms.The randomness of abstracted key sequence was validated in aspects of Shannon entropy.The"one-group-one-cipher"algorithm was de-signed and implemented based on hyper-chaos generalized Hénon mapping and IDEA algorithms, and its security was analyzed theoretically.Analysis shows that the algorithm is so secure that it can withstand brute force attack, and it was perfect secrecy.The disadvantages of key’s reuse of block ciphers are avoided, and the practicality and feasibility of chaos ciphers and one-time pad are improved.…”
Get full text

A Secure and Efficient White-Box Implementation of SM4 by Xiaobo Hu, Yanyan Yu, Yinzi Tu, Jing Wang, Shi Chen, Yuqi Bao, Tengyuan Zhang, Yaowen Xing, Shihui Zheng

“…We employ fourth-order non-linear encoding to reduce the loss of efficiency while utilizing a random sequence to shuffle lookup table access, thereby severing the potential link between memory data and the intermediate values of SM4. …”
Get full text