Optimal quinary cyclic codes with minimum distance four by Ye TIAN, Yu-qing ZHANG, Yu-pu HU

“…Cyclic codes are an extremely important subclass of linear codes.They are widely used in the communication systems and data storage systems because they have efficient encoding and decoding algorithm.Until now,how to construct the optimal ternary cyclic codes has received a lot of attention and much progress has been made.However,there is less research about the optimal quinary cyclic codes.Firstly,an efficient method to determine if cyclic codes C_(1,e,t)were optimal codes was obtained.Secondly,based on the proposed method,when the equation e=5_k+1 or e=5_m−2hold,the theorem that the cyclic codes C_(1,e,t)were optimal quinary cyclic codes was proved.In addition,perfect nonlinear monomials were used to construct optimal quinary cyclic codes with parameters[5_m−1,5_m−2m−2,4]optimal quinary cyclic codes over <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"> <msub> <mi>F</mi> <mrow> <msup> <mn>5</mn> <mi>m</mi> </msup> </mrow> </msub> </math></inline-formula>.…”
Get full text

Multiple-seller and multiple-buyer spectrum sharing model in cognitive radio-based wireless sensor network by Yuxing Mao, Tao Cheng, Huiyuan Zhao, Na Shen

“…Simulation results show that the Bertrand game model is a good choice for determining spectrum pricing and that the ant colony optimization–based multiple knapsack problem algorithm is an efficient way to allocate spectrum dynamically.…”
Get full text

Automated identification of bulk structures, two-dimensional materials, and interfaces using symmetry-based clustering by Thea Denell, Lauri Himanen, Markus Scheidgen, Claudia Draxl

“…Even noisy systems are shown to be classifiable, showing the suitability of our algorithm for real-world data applications. The software implementation is provided in the open-source Python package, MatID, exploiting synergies with popular atomic-structure manipulation libraries and extending the accessibility of those libraries through the NOMAD platform.…”
Get full text

Geometry Optimisation of a Wave Energy Converter by Susana Costa, Jorge Ferreira, Nelson Martins

“…The proposed procedure starts by developing an initial geometry, which is later evaluated in terms of hydrodynamics and optimised through an optimisation algorithm to tune the shape parameters that influence energy absorption, intending to obtain the optimal geometry. …”
Get full text

Efficient Chlorophyll Prediction and Sampling in the Sea: A Real-Time Approach With UCB-Based Path Planning by Perihan Karakose, Cafer Bal

“…In the second phase of the study, an exhaustive search algorithm is combined with reward functions like Upper Confidence Bound (UCB), entropy, and variance reduction. …”
Get full text

Joint estimation of frequency and DOA with spatio-temporal under sampling by Xiang-dong HUANG, Hong-yu XIAN, Zi-yang YAN, Sen-xue JING

“…In order to estimate the frequency and DOA of an incident signal with sub-Nyquist spatio-temporal sampling,A novel joint estimation algorithm based on spectrum correction and Chinese remainder theorem(CRT)was proposed.Firstly,the incident signal was parallelly sampled at multiple sensors non-uniformly located in a sparse linear array.Then,AM spectrum corrector was employed to extract the rema of frequency and phase-difference from a small quantity of snapshots.Finally,implementing the close-form CRT on these remainders directly yields the estimates of frequency and DOA.In the proposed scheme,the spectrum corrector was shared by both the frequency estimator and the DOA es-timator,which contributed to a high utilization of the snapshots.Furthermore,compared to the existing CRT based esti-mators,the proposed estimator needs not to incorporate multiple times of temporal undersampling on a single sensor,which saves considerable time consumption and thus obtain high ability of tracking time-variant objects.Simulations verify the feasibility and the high-accuracy of the proposed joint estimator and further study shows that high reconstruc-tion probability can be realized even in low SNR cases,which present the vast potential for future development.…”
Get full text

Evolution Balancing of the Small-Sized Wheel Loader Assembly Line by Rongshen Lai, Liang Hou, Yongming Wu

“…Then, with minimizing the number of workstations, the in-station and between-station load indexes and adjustment costs, and maximizing relevancy between activities as optimization objectives, meanwhile regarding product platform planning, modularity design and the critical chain technology in concurrent engineering as constraint conditions, the evolution balancing problem of PFAL is optimized using improved genetic algorithm (IGA). Finally, the whole analysis procedure is demonstrated by the small-sized wheel loader PFAL case study and the effectiveness of the proposed method is verified.…”
Get full text

The Network Evolution of the Internationalizing Firm by Sérgio Fernando Loureiro Rezende, Alysson Moreira Alves, Dirley dos Reis Moreira Bicalho, Ângela França Versiani

“…The data analysis is based on Clauset et al.’s (2009) computational algorithm and PAFit, a new statistical method. The aim is to identify the extent to which the network evolution follows a power-law distribution and the degree to which preferential attachment affects the network evolution. …”
Get full text

Resilience-Based Optimization of Postdisaster Restoration Strategy for Road Networks by Xinhua Mao, Jibiao Zhou, Changwei Yuan, Dan Liu

“…Due to the NP-hardness of the model, a genetic algorithm is developed to solve the model. Finally, a case study is conducted to demonstrate the effectiveness of the proposed method. …”
Get full text

The Node Arrangement Methodology of Wireless Sensor Networks for Long-Span Bridge Health Monitoring by Guang-Dong Zhou, Ting-Hua Yi

“…An improved general genetic algorithm is proposed to configure sensor nodes, and a nonuniform node arrangement method is developed to distribute relay nodes. …”
Get full text

Lightweight anomaly detection model for UAV networks based on memory-enhanced autoencoders by HU Tianzhu, SHEN Yulong, REN Baoquan, HE Ji, LIU Chengliang, LI Hongjun

“…The hierarchical clustering algorithm was used to divide the composite statistical features, and the separated features were input to multiple small memory-enhanced autoencoders in the integrated architecture for independent training, which reduced the computational complexity and solved the problem of false negatives caused by the overfitting of the reconstruction effect of the traditional autoencoder. …”
Get full text

Secure transmission scheme for millimeter-wave Internet of vehicles with multiple base stations and users by JU Ying, CHEN Yuchao, TIAN Suheng, LIU Lei, LI Zan, PEI Qingqi, WANG Mingyang

“…For the timeliness of millimeter-wave secure beamforming in mobile scenarios and the robustness of secure connections in millimeter-wave dynamic eavesdropping scenarios, a multi-agent secure cooperative communication scheme based on a dueling double deep Q network (D3QN)-deep deterministic policy gradient (DDPG) algorithm was proposed to address communication security issues. …”
Get full text

A Modified Mann Iteration by Boundary Point Method for Finding Minimum-Norm Fixed Point of Nonexpansive Mappings by Songnian He, Wenlong Zhu

“…In order to overcome this weakness, we introduce a new modified Mann iteration by boundary point method (see Section 3 for details) for finding the minimum norm fixed point of  T and prove its strong convergence under some assumptions. Since our algorithm does not involve the computation of the metric projection PC, which is often used so that the strong convergence is guaranteed, it is easy implementable. …”
Get full text

FAULT RECOGNITION METHOD RESEARCH BASED ON SEMI-SUPERVISED NEIGHBORHOOD SELF-ADAPTIVE LINERA LOCAL TANGENT SPACE ALIGNMENT by XIE XiaoHua, WANG QingHong

“…The experiment results of classical 3D manifold,UCI datasets and bearing fault diagnosis show that the algorithm overcomes the drawbacks that the LLTSA has no supervision and the use of global unified neighborhood parameters and it is more effective to find the low dimensional nature of the data for improving the recognition accuracy and has certain superiority.…”
Get full text

An Optimal Design of Multiple Antenna Positions on Mobile Devices Based on Mutual Coupling Analysis by Peerapong Uthansakul, Danai Assanuk, Monthippa Uthansakul

“…In this paper, genetic algorithm (GA) is used to find the optimal antenna positions on a mobile device. …”
Get full text

HRM: An Intelligent Helmet Recognition Model in Complex Scenes by Panbo He, Chunxue Wu, Rami Yared, Yuanhao Ma

“…Compared with SSD, YOLOv3, and YOLOv5, the average accuracy of this algorithm is improved by 6.89%, 8.28%, and 2.44% and has strong generalization ability in dense scenes and small target scenes, which meets the accuracy requirements of helmet wearing detection in engineering applications.…”
Get full text

Multiple Attribute Trigonometric Decision-Making and Its Application to the Selection of Engineers by M. Palanikumar, K. Arulmozhi, Omaima Al-Shanqiti, Chiranjibe Jana, Madhumangal Pal

“…In addition, we acquired a flowchart and an algorithm that interact with MADM and are called ST-PyNSNIVWA, ST-PyNSNIVWG, ST-GPyNSNIVWA, and ST-GPyNSNIVWG, respectively. …”
Get full text

Graph-to-sequence deep reinforcement learning based complex task deployment strategy in MEC by Zhuo CHEN, Mintao CAO, Zhiyuan ZHOU, Xin HUANG, Yan LI

“…With the help of mobile edge computing (MEC) and network virtualization technology, the mobile terminals can offload the computing, storage, transmission and other resource required for executing various complex applications to the edge service nodes nearby, so as to obtain more efficient service experience.For edge service providers, the optimal energy consumption decision-making problem when deploying complex tasks was comprehensively investigated.Firstly, the problem of deploying complex tasks to multiple edge service nodes was modeled as a mixed integer programming (MIP) model, and then a deep reinforcement learning (DRL) solution strategy that integrated graph to sequence was proposed.Potential dependencies between multiple subtasks through a graph-based encoder design were extracted and learned, thereby automatically discovering common patterns of task deployment based on the available resource status and utilization rate of edge service nodes, and ultimately quickly obtaining the deployment strategy with the optimal energy consumption.Compared with representative benchmark strategies in different network scales, the experimental results show that the proposed strategy is significantly superior to the benchmark strategies in terms of task deployment error ratio, total power consumption of MEC system, and algorithm solving efficiency.…”
Get full text

Modelling and Assertion-Based Verification of Run-Time Reconfigurable Designs Using Functional Programming Abstractions by Bahram N. Uchevler, Kjetil Svarstad

“…Assertions can be used to verify specifications of designs in different verification methods such as simulation-based and formal verification. A partitioning algorithm is proposed for clustering the assertion-checker circuits to implement the verification circuits in a limited reconfigurable area in the target FPGA. …”
Get full text

Allocation Optimization of Multi-Axis Suspension Dynamic Parameter for Tracked Vehicle by Qihui Ling, Juchuan Dai, Xingyun He, Shengzhao Chen, Zhewu Chen

“…Then, the evaluation index and its quantitative algorithm, which reflect the multi-aspect performance of the suspension system, are proposed. …”
Get full text