scholarly journals A Gradient-probability-driven Discrete Search Algorithm for On-chip photonics Inverse Design

2021 ◽  
Author(s):  
ShangLin Yang ◽  
Hao Jia ◽  
Lei Zhang ◽  
Dai JinCheng ◽  
Xin Fu ◽  
...  
Keyword(s):  
Search Algorithm ◽  
Inverse Design ◽  
Discrete Search ◽  
On Chip

scholarly journals Inverse design and demonstration of a compact and broadband on-chip wavelength demultiplexer

2015 ◽  
Vol 9 (6) ◽  
pp. 374-377 ◽  
Author(s):  
Alexander Y. Piggott ◽  
Jesse Lu ◽  
Konstantinos G. Lagoudakis ◽  
Jan Petykiewicz ◽  
Thomas M. Babinec ◽  
...  
Keyword(s):  
Inverse Design ◽  
Wavelength Demultiplexer ◽  
On Chip

scholarly journals The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm

Mathematics ◽  
2018 ◽  
Vol 7 (1) ◽  
pp. 17 ◽  
Author(s):  
Yanhong Feng ◽  
Haizhong An ◽  
Xiangyun Gao
Keyword(s):  
Transfer Function ◽  
Knapsack Problem ◽  
Transfer Functions ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Continuous Optimization ◽  
Search Space ◽  
Discrete Search ◽  
Continuous Optimization Problems

Moth search (MS) algorithm, originally proposed to solve continuous optimization problems, is a novel bio-inspired metaheuristic algorithm. At present, there seems to be little concern about using MS to solve discrete optimization problems. One of the most common and efficient ways to discretize MS is to use a transfer function, which is in charge of mapping a continuous search space to a discrete search space. In this paper, twelve transfer functions divided into three families, S-shaped (named S1, S2, S3, and S4), V-shaped (named V1, V2, V3, and V4), and other shapes (named O1, O2, O3, and O4), are combined with MS, and then twelve discrete versions MS algorithms are proposed for solving set-union knapsack problem (SUKP). Three groups of fifteen SUKP instances are employed to evaluate the importance of these transfer functions. The results show that O4 is the best transfer function when combined with MS to solve SUKP. Meanwhile, the importance of the transfer function in terms of improving the quality of solutions and convergence rate is demonstrated as well.

Broadband on-chip photonic spin Hall element via inverse design

2020 ◽  
Vol 8 (2) ◽  
pp. 121 ◽  
Author(s):  
Zhenwei Xie ◽  
Ting Lei ◽  
Haodong Qiu ◽  
Zecen Zhang ◽  
Hong Wang ◽  
...  
Keyword(s):  
Inverse Design ◽  
On Chip ◽  
Hall Element

Inverse design and demonstration of on-chip laser-driven particle accelerators (Conference Presentation)

2020 ◽  
Author(s):  
Neil V. Sapra ◽  
Ki Youl Yang ◽  
Dries Vercruysse ◽  
Kenneth J. Leedle ◽  
Dylan S. Black ◽  
...  
Keyword(s):  
Inverse Design ◽  
Particle Accelerators ◽  
On Chip

Research on Underground Personnel Positioning Method Based on PSO-GSA Optimization

2016 ◽  
Vol 8 (4) ◽  
pp. 21-74
Author(s):  
Ye Liu ◽  
Tianze Li ◽  
Tao Gao ◽  
Yuhan Wang ◽  
JiaHui Chen
Keyword(s):  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Path Loss ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Experiment Platform ◽  
Positioning Method ◽  
Unknown Node ◽  
Weighted Centroid Localization ◽  
On Chip

In the case of coal mine accidents, in order to ensure timely rescue of the suffering people in a complex environment of underground localization, focusing on Received Signal Strength Indicator (RSSI) in underground personnel positioning accuracy is low and the problem of dynamic tracing parameters changes. Therefore, using an improved gravitational search algorithm (GSA) for the weighted centroid localization that based on RSSI. Utilizing the log distance path loss model gets the distance between the beacon nodes and unknown nodes, and then through the weighted centroid localization algorithm perform the unknown node positioning. Finally, the improved GSA-PSO optimizes the preliminary location results and parameters. Proposed solutions to establish simulation model is verified in MATLAB, and use the on-chip system CC2430 chips experiment platform is established. Experimental results show the proposed method can improve both the positioning accuracy effectively and the adaptive ability of changeful environment.

Research on Underground Personnel Positioning Method Based on PSO-GSA Optimization

2020 ◽  
pp. 1387-1439
Author(s):  
Ye Liu ◽  
Tianze Li ◽  
Tao Gao ◽  
Yuhan Wang ◽  
JiaHui Chen
Keyword(s):  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Experiment Platform ◽  
Positioning Method ◽  
Unknown Node ◽  
Weighted Centroid Localization ◽  
On Chip ◽  
Adaptive Ability

In the case of coal mine accidents, in order to ensure timely rescue of the suffering people in a complex environment of underground localization, focusing on Received Signal Strength Indicator (RSSI) in underground personnel positioning accuracy is low and the problem of dynamic tracing parameters changes. Therefore, using an improved gravitational search algorithm (GSA) for the weighted centroid localization that based on RSSI. Utilizing the log distance path loss model gets the distance between the beacon nodes and unknown nodes, and then through the weighted centroid localization algorithm perform the unknown node positioning. Finally, the improved GSA-PSO optimizes the preliminary location results and parameters. Proposed solutions to establish simulation model is verified in MATLAB, and use the on-chip system CC2430 chips experiment platform is established. Experimental results show the proposed method can improve both the positioning accuracy effectively and the adaptive ability of changeful environment.

Customizing topographical templates for aperiodic nanostructures of block copolymers via inverse design

2019 ◽  
Vol 21 (15) ◽  
pp. 7781-7788 ◽  
Author(s):  
Runrong Zhang ◽  
Liangshun Zhang ◽  
Jiaping Lin ◽  
Shaoliang Lin
Keyword(s):  
Theoretical Model ◽  
Block Copolymers ◽  
Search Algorithm ◽  
Inverse Design

We integrated an advanced inverse search algorithm with a polymeric theoretical model to customize topographical templates for the reproduction of target structures over exceptionally large areas.

A discrete search algorithm for finding the structure of protein backbones and side chains

2013 ◽  
Vol 9 (3) ◽  
pp. 261 ◽  
Author(s):  
Silas Sallaume ◽  
Simone de Lima Martins ◽  
Luiz Satoru Ochi ◽  
Warley Gramacho Da Silva ◽  
Carlile Lavor ◽  
...  
Keyword(s):  
Search Algorithm ◽  
Side Chains ◽  
Discrete Search ◽  
Protein Backbones
Sign in / Sign up

Export Citation Format

Share Document