Resource allocation in cognitive radio network with energy harvesting by Yan LONG, Xiaoqian ZHANG, Xuming FANG, Rong HE

“…Considering the diversity of energy harvesting capability and spectrum sensing accuracy of SU,as well as dynamic channel quality,under the constraint of energy causality,the secondary network throughput maximization problem in single-hop cognitive radio networks with energy harvesting was studied.The transmission channel selection,transmission power control and transmission time allocation of SU were jointly optimized.Since the optimization problem was non-convex,by converting it into a series of convex optimization sub-problems,the optimize transmission power and transmission time algorithm (OPTA) was obtained.Compared with the existing resource allocation algorithms,such as,hybrid differential evolution algorithm (HDEA),optimized transmission algorithm (OTA),and random assignment channel algorithm (RA),the simulation results verify the correctness and effectiveness of the proposed algorithm.For example,under the same maximum transmission power constraint,the throughput of the proposed OPTA scheme could increase by around 6%,37% and 50% than that of HDEA,OTA and RA schemes respectively.Under the same channel gain diversity,the throughput of the proposed OPTA scheme could increase by around 30%,60% and 94% than that of HDEA,OTA and RA schemes respectively.Under the same energy harvesting efficiency diversity,the throughput of the proposed OPTA scheme could increase by around 27%,50% and 92% than that of HDEA,OTA and RA schemes respectively.…”
Get full text

Strong -Barrier Coverage for One-Way Intruders Detection in Wireless Sensor Networks by Junhai Luo, Shihua Zou

“…Sometimes detecting intruders is not sufficient; distinguishing whether an intruder is legal or illegal is necessary. Since k -barrier coverage is widely used in detecting intruders, a barrier construction algorithm is needed, which can not only detect an intruder but also judge an illegal intruder. …”
Get full text

3D Gerchberg-Saxton Optical Correlation by Wen Chen

“…Since Gerchberg–Saxton algorithm was developed, it has been applied in various fields, e.g., optical display and optical tweezers. …”
Get full text

Research on the Application of User Recommendation Based on the Fusion Method of Spatially Complex Location Similarity by Lili Wang, Ting Shi, Shijin Li

“…By comparing the location-based collaborative filtering (LCF) algorithm, user-based collaborative filtering (UCF) algorithm, and user recommendation algorithm (F2F), the proposed method has the preparation rate, recall rate, and experimental effect advantage. …”
Get full text

Approach towards the achievable sum rates capacity of Gaussian MIMO broadcast channels by PAN Cheng-kang1, CAI Yue-ming1, XU You-yun1, ZHANG Hua-ping2

“…Since it is very difficult to compute the sum rates capacity of Gaussian MIMO broadcast channels directly by using dirty paper coding approach,an iterative water-filling algorithm is proposed to obtain the sum capacity bound for multi-access channel and a suboptimal transmission policy to achieve the capacity bound is derived from the algorithm.Based on the duality of multiple-access and broadcast channels,the capacity bound and transmission policy in multi-access channels are mapped into the broadcast channel.Numerical results show that the proposed iterative algorithm is simple and effective to calculate the sum capacity bound,and the capacity achieved by the transmission policy is very close to the theoretical bound.This policy is quite considerable for downlink transmission of MIMO systems.…”
Get full text

Beamforming design for energy-constrained full-duplex two-way relaying system by Wei WANG, Liyuan AN, Guoan ZHANG, Shibing ZHANG

“…A beamforming design was proposed under simultaneous wireless information and power transfer (SWIPT) protocol.A utility optimization problem was considered aiming to maximize the harvested energy by jointly optimizing the beamforming matrix,the power splitting ratio at the relay and the transmit powers at the sources.Since the formulated joint optimization problem was nonconvex,it was difficult or even intractable to obtain the global optimal solution.To overcome this issue,the objective problem into three subproblems was decoupled which could be solved by the proposed semidefinite relaxation technique and the derived constraints activation solution,respectively.The solution was finally obtained with the proposed convergent iterative algorithm.Simulation results show that the proposed joint optimization scheme achieves the optimal performance.Compared with the traditional half-duplex (HD) algorithm,the proposed algorithm can obtain 2~3 times energy harvesting (EH) efficiency improvement,while the computational complexity increases slightly.…”
Get full text

Tanner crab at southwestern Kamchatka: fishing, stock condition and specifics of the assessment by Р. Yu. Ivanov

“…This algorithm is applied for the data collected at southwestern Kamchatka since 2010. …”
Get full text

A Video Image Segmentation System for the Fruit-trees in Multi-stage Outdoors Orchard under Natural Conditions by Yousef Abbaspour-gilandeh, Sajad Sabzi, Juan Ignacio Arribas

“…The order of segmentation stage methods in multi-stage algorithm is very important since has a direct relationship with final segmentation accuracy. …”
Get full text

Design of hybridly-connected hybrid precoding in millimeter-wave massive MIMO system by Hongyu ZHAO, Hongyan YAO

“…In order to improve the spectral efficiency of hybridly-connected hybrid precoding,the optimal hybrid precoding matrix under the ideal conditions was firstly obtained by using the principle of successive interference cancellation (SIC).Secondly,the optimal hybrid precoding matrix was decomposed into the digital precoding matrix and the analog precoding matrix by using the gradient descent theory.Finally,considering the constant modulus constraint condition of the analog precoding matrix,the digital and analog precoding matrices were optimized by using the alternating minimization method aim to maximize the spectral efficiency.Due to the hybridly-connected structure,the proposed hybrid precoding design algorithm is significantly superior to the partially-connected and fully-connected hybrid precoding in terms of the system energy efficiency.Meanwhile,the algorithm does not increase any hardware complexity and only increases a small amount of computation of the hybridly-connected hybrid precoding.Computer simulation results exhibit that the proposed algorithm can improve the system spectral efficiency of the hybridly-connected hybrid precoding,and the upgrade of spectral efficiency is more significant especially in the conditions that the number of radio frequency (RF) links is greater than the number of data streams.Since the sub-blocks are not necessary to satisfy orthogonality conditions,the proposed algorithm is more suitable for practical application than the existing hybridly-connected hybrid precoding.…”
Get full text

Discrete Unilateral Constrained Extended Kalman Filter in an Embedded System by Leonardo Herrera, Rodrigo Méndez-Ramírez

“…Since its publication in the 1960s, the Kalman Filter (KF) has been a powerful tool in optimal state estimation. …”
Get full text

Adaptive Cooperative Quality Weight Spectrum Sensing for Mitigating Byzantine Attacks in Cognitive Radio by Kanabadee Srisomboon, Luepol Pipanmekaporn, Akara Prayote, Wilaiporn Lee

“…In this paper, we propose the adaptive cooperative quality weight algorithm for mitigating the Byzantine attack issue by distinguishing the BAs and CRUs from the data fusion account while selecting only useful CRUs since the number of members in the account is also the important factor for cooperative spectrum sensing. …”
Get full text

Comparative Analysis of Anomaly Detection Techniques Using Generative Adversarial Network by Imran Ullah Khan, Shah Noor, Ahthasham Sajid, Junaid Javaid, Iqra Tabasusum

“…This paper carries out a survey of the existing literature on machine learning-based algorithms for anomaly detection. This paper places a special emphasis on Generative Adversarial Network-based algorithms for anomaly detection, since it is the most widely used machine-learning based algorithm for anomaly detection.  …”
Get full text

A New Method for Segmentation of Colour Images Applied to Immunohistochemically Stained Cell Nuclei by Petter Ranefall, Lars Egevad, Bo Nordin, Ewert Bengtsson

“…First, a new supervised algorithm for creating a pixel classifier is applied to an image that is typical for the sample. …”
Get full text

A Bio-Inspired Method for the Constrained Shortest Path Problem by Hongping Wang, Xi Lu, Xiaoge Zhang, Qing Wang, Yong Deng

“…The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem. In this paper, we propose an innovative method which is based on the internal mechanism of the adaptive amoeba algorithm. …”
Get full text

Quartic Quantum Speedups for Planted Inference by Alexander Schmidhuber, Ryan O’Donnell, Robin Kothari, Ryan Babbush

“…We describe a quantum algorithm for the Planted Noisy kXOR Problem (also known as Sparse Learning Parity with Noise) that achieves a nearly quartic (fourth-power) speedup over the best known classical algorithm while using exponentially less space. …”
Get full text

A method for calculating the coverage area of radar network based on Monte Carlo method and its simulation by WANG Yinlong, WANG Dan, MA Juntao, ZHAO Deyong

“…The process of the specific algorithm is given. Compared with similar algorithms, the structure of this algorithm is clear and simple, and it is easy to extend. …”
Get full text

A non‐convex ternary variational decomposition and its application for image denoising by Liming Tang, Liang Wu, Zhuang Fang, Chunyan Li

“…An alternating direction iteration algorithm combining with iteratively reweighted l1 algorithm, projection algorithm and wavelet soft threshold algorithm is introduced to effectively solve the proposed model. …”
Get full text

Flexible Flow Shop Scheduling Problem with Reliable Transporters and Intermediate Limited Buffers via considering Learning Effects and Budget Constraint by Meysam Kazemi Esfeh, Amir Abbas Shojaie, Hasan Javanshir, Kaveh Khalili-Damghani

“…Firstly, the model is validated to confirm the accuracy of its performance. Then, since it is an NP-hard one, two metaheuristic algorithms, namely, MOSA and MOEA/D, are rendered to solve mid- and large-scale problems. …”
Get full text

Robust Road Surface Classification Using Time Series Augmented Intelligent Tire Sensor Data and 1-D CNN by Seokchan Kim, Yeong-Jae Kim, Dongwook Lee, Hanmin Lee

“…In recent years, there has been a lot of research on using the vibration characteristic of tires to estimate the road surface condition from its features. However, since tire vibration characteristics vary depending on conditions such as tire pressure, load, and driving status, it is still difficult to develop a road surface classification algorithm that is robust to various situations. …”
Get full text

A New Quotient and Iterative Detection Method in an Affine Krylov Subspace for Solving Eigenvalue Problems by Chein-Shan Liu, Jiang-Ren Chang, Jian-Hung Shen, Yung-Wei Chen

“…The n-dimensional eigenvector is superposed by a constant shifting vector and an m-vector. In the first algorithm, the m-vector is derived as a function of eigenvalue by maximizing the Rayleigh quotient to generate the first characteristic equation, which, however, is not easy to determine the eigenvalues since its roots are not of simple ones, exhibiting turning points, spikes, and even no intersecting point to the zero line. …”
Get full text