IRS辅助的SWIPT系统中基于能效优先的波束成形设计与优化

以智能反射面(intelligent reflecting surface,IRS)辅助的无线携能通信(simultaneous wireless information and power transfer,SWIPT)系统为背景,研究了该系统中基于能效优先的多天线发送端有源波束成形与IRS无源波束成形联合设计与优化方法。以最大化接收端的最小能效为优化目标,构造在发送端功率、接收端能量阈值、IRS相移等多约束下的非线性优化问题,用交替方向乘子法(alternating direction method of multipliers,ADMM)求解。采用Dinkelbach算法转化目标函数,通过奇异值分解(singular value decomposition,SVD)和半定松弛(semi-definite relaxation,SDR)得到发送端有源波束成形向量。采用SDR得到IRS相移矩阵与反射波束成形向量。结果表明,该系统显著降低了系统能量收集(energy harvesting,EH)接收端的能量阈值。当系统总电路功耗为?15 dBm时,所提方案的用户能效为300 KB/J。当IRS反射阵源数与发送天线数均为最大值时,系统可达最大能效。     

基于熵权TOPSIS的工程咨询机构BIM技术应用能力评价

构建工程咨询机构BIM技术应用能力评价的指标体系,提出改进的熵权TOPSIS评价模型,以4个典型的工程咨询单位为例,进行BIM技术运用能力评价。研究表明,BIM行业的整体水平已经有了明显的提升,但是区域间的发展还存在一定差距。     

A self-adaptive synthetic over-sampling technique for imbalanced classification

Traditionally, in supervised machine learning, (a significant) part of the available data (usually 50%-80%) is used for training and the rest—for validation. In many problems, however, the data are highly imbalanced in regard to different classes or does not have good coverage of the feasible data space which, in turn, creates problems in validation and usage phase. In this paper, we propose a technique for synthesizing feasible and likely data to help balance the classes as well as to boost the performance in terms of confusion matrix as well as overall. The idea, in a nutshell, is to synthesize data samples in close vicinity to the actual data samples specifically for the less represented (minority) classes. This has also implications to the so-called fairness of machine learning. In this paper, we propose a specific method for synthesizing data in a way to balance the classes and boost the performance, especially of the minority classes. It is generic and can be applied to different base algorithms, for example, support vector machines, k-nearest neighbour classifiers deep neural, rule-based classifiers, decision trees, and so forth. The results demonstrated that (a) a significantly more balanced (and fair) classification results can be achieved and (b) that the overall performance as well as the performance per class measured by confusion matrix can be boosted. In addition, this approach can be very valuable for the cases when the number of actual available labelled data is small which itself is one of the problems of the contemporary machine learning.     

Recent Biophysical Issues About the Preparation of Solute-Filled Lipid Vesicles

Here we report some recent biophysical issues on the preparation of solute-filled lipid vesicles and their relevance to the construction of “synthetic cells.” First, we introduce the “semi-synthetic minimal cells” as the liposome-based cell-like systems, which contain a minimal number of biomolecules required to display simple and complex biological functions. Next, we focus on recent aspects related to the construction of synthetic cells. Emphasis is given to the interplay between the methods of synthetic cell preparation and the physics of solute encapsulation. We briefly introduce the notion of structural and compositional “diversity” in synthetic cell populations.     

Friction compensation controller for load varying machine tool feed drive

The load applied to a machine tool feed drive changes during the machining process as material is removed. This load change alters the Coulomb friction of the feed drive. Because Coulomb friction accounts for a large part of the total friction the friction compensation control accuracy of the feed drives is limited if this nonlinear change in the applied load is not considered. This paper presents a new friction compensation method that estimates the machine tool load in real time and considers its effect on friction characteristics. A friction observer based on a Kalman filter with load estimation is proposed for friction compensation control considering the applied load change. A specially designed feed drive testbed that enables the applied load to be modified easily was constructed for experimental verification. Control performance and friction estimation accuracy are demonstrated experimentally using the testbed.     

High-resolution ISAR imaging of fast rotating targets based on pattern-coupled Bayesian strategy for multiple measurement vectors

Very high resolution inverse synthetic aperture radar (ISAR) imaging of fast rotating targets is a complicated task. There may be insufficient pulses or may introduce migration through range cells (MTRC) during the coherent processing interval (CPI) when we use the conventional range Doppler (RD) ISAR technique. With compressed sensing (CS) technique, we can achieve the high-resolution ISAR imaging of a target with limited number of pulses. Sparse representation based method can achieve the super resolution ISAR imaging of a target with a short CPI, during which the target rotates only a small angle and the range migration of the scatterers is small. However, traditional CS-based ISAR imaging method generally faced with the problem of basis mismatch, which may degrade the ISAR image. To achieve the high resolution ISAR imaging of fast rotating targets, this paper proposed a pattern-coupled sparse Bayesian learning method for multiple measurement vectors, i.e. the PC-MSBL algorithm. A multi-channel pattern-coupled hierarchical Gaussian prior is proposed to model the pattern dependencies among neighboring range cells and correct the MTRC problem. The expectation-maximization (EM) algorithm is used to infer the maximum a posterior (MAP) estimate of the hyperparameters. Simulation results validate the effectiveness and superiority of the proposed algorithm.     

Alteration of the Route to Menaquinone towards Isochorismate-Derived Metabolites

Chorismate and isochorismate constitute branch-point intermediates in the biosynthesis of many aromatic metabolites in microorganisms and plants. To obtain unnatural compounds, we modified the route to menaquinone in Escherichia coli. We propose a model for the binding of isochorismate to the active site of MenD ((1R,2S, 5S,6S)-2-succinyl-5-enolpyruvyl-6-hydroxycyclohex-3-ene-1-carboxylate (SEPHCHC) synthase) that explains the outcome of the native reaction with α-ketoglutarate. We have rationally designed variants of MenD for the conversion of several isochorismate analogues. The double-variant Asn117Arg–Leu478Thr preferentially converts (5S,6S)-5,6-dihydroxycyclohexa-1,3-diene-1-carboxylate (2,3-trans-CHD), the hydrolysis product of isochorismate, with a >70-fold higher ratio than that for the wild type. The single-variant Arg107Ile uses (5S,6S)-6-amino-5-hydroxycyclohexa-1,3-diene-1-carboxylate (2,3-trans-CHA) as substrate with >6-fold conversion compared to wild-type MenD. The novel compounds have been made accessible in vivo (up to 5.3 g L⁻¹). Unexpectedly, as the identified residues such as Arg107 are highly conserved (>94 %), some of the designed variations can be found in wild-type SEPHCHC synthases from other bacteria (Arg107Lys, 0.3 %). This raises the question for the possible natural occurrence of as yet unexplored branches of the shikimate pathway.     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.