scholarly journals A Design of Branch-Line Coupler with Harmonic Suppression and Size Reduction Using Closed-Loop and Open-Loop Resonators

2017 ◽  
Vol 26 (4) ◽  
pp. 999-1005 ◽  
Author(s):  
A. Abdipour ◽  
A. Abdipour ◽  
E. Zare
2020 ◽  
Vol 26 ◽  
pp. 41
Author(s):  
Tianxiao Wang

This article is concerned with linear quadratic optimal control problems of mean-field stochastic differential equations (MF-SDE) with deterministic coefficients. To treat the time inconsistency of the optimal control problems, linear closed-loop equilibrium strategies are introduced and characterized by variational approach. Our developed methodology drops the delicate convergence procedures in Yong [Trans. Amer. Math. Soc. 369 (2017) 5467–5523]. When the MF-SDE reduces to SDE, our Riccati system coincides with the analogue in Yong [Trans. Amer. Math. Soc. 369 (2017) 5467–5523]. However, these two systems are in general different from each other due to the conditional mean-field terms in the MF-SDE. Eventually, the comparisons with pre-committed optimal strategies, open-loop equilibrium strategies are given in details.


2020 ◽  
pp. 99-107
Author(s):  
Erdal Sehirli

This paper presents the comparison of LED driver topologies that include SEPIC, CUK and FLYBACK DC-DC converters. Both topologies are designed for 8W power and operated in discontinuous conduction mode (DCM) with 88 kHz switching frequency. Furthermore, inductors of SEPIC and CUK converters are wounded as coupled. Applications are realized by using SG3524 integrated circuit for open loop and PIC16F877 microcontroller for closed loop. Besides, ACS712 current sensor used to limit maximum LED current for closed loop applications. Finally, SEPIC, CUK and FLYBACK DC-DC LED drivers are compared with respect to LED current, LED voltage, input voltage and current. Also, advantages and disadvantages of all topologies are concluded.


2011 ◽  
Vol E94-C (7) ◽  
pp. 1237-1239
Author(s):  
Chia-Hao KU ◽  
Hsien-Wen LIU ◽  
Yu-Shu LIN ◽  
Kuei-Yi LIN ◽  
Pao-Jen WANG

2021 ◽  
Vol 13 (15) ◽  
pp. 2868
Author(s):  
Yonglin Tian ◽  
Xiao Wang ◽  
Yu Shen ◽  
Zhongzheng Guo ◽  
Zilei Wang ◽  
...  

Three-dimensional information perception from point clouds is of vital importance for improving the ability of machines to understand the world, especially for autonomous driving and unmanned aerial vehicles. Data annotation for point clouds is one of the most challenging and costly tasks. In this paper, we propose a closed-loop and virtual–real interactive point cloud generation and model-upgrading framework called Parallel Point Clouds (PPCs). To our best knowledge, this is the first time that the training model has been changed from an open-loop to a closed-loop mechanism. The feedback from the evaluation results is used to update the training dataset, benefiting from the flexibility of artificial scenes. Under the framework, a point-based LiDAR simulation model is proposed, which greatly simplifies the scanning operation. Besides, a group-based placing method is put forward to integrate hybrid point clouds, via locating candidate positions for virtual objects in real scenes. Taking advantage of the CAD models and mobile LiDAR devices, two hybrid point cloud datasets, i.e., ShapeKITTI and MobilePointClouds, are built for 3D detection tasks. With almost zero labor cost on data annotation for newly added objects, the models (PointPillars) trained with ShapeKITTI and MobilePointClouds achieved 78.6% and 60.0% of the average precision of the model trained with real data on 3D detection, respectively.


2020 ◽  
Vol 11 (1) ◽  
pp. 177
Author(s):  
Pasi Fränti ◽  
Teemu Nenonen ◽  
Mingchuan Yuan

Travelling salesman problem (TSP) has been widely studied for the classical closed loop variant but less attention has been paid to the open loop variant. Open loop solution has property of being also a spanning tree, although not necessarily the minimum spanning tree (MST). In this paper, we present a simple branch elimination algorithm that removes the branches from MST by cutting one link and then reconnecting the resulting subtrees via selected leaf nodes. The number of iterations equals to the number of branches (b) in the MST. Typically, b << n where n is the number of nodes. With O-Mopsi and Dots datasets, the algorithm reaches gap of 1.69% and 0.61 %, respectively. The algorithm is suitable especially for educational purposes by showing the connection between MST and TSP, but it can also serve as a quick approximation for more complex metaheuristics whose efficiency relies on quality of the initial solution.


Sign in / Sign up

Export Citation Format

Share Document