Query：
学者姓名：林东
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
针对麻雀搜索算法后期种群多样性减少、易陷入局部最优解等问题,提出一种新的改进麻雀搜索算法.所提算法先引入小孔成像反向学习策略对发现者的位置进行更新,提升寻优位置的多样性;其次受Logistic模型的启发,提出一种新的自适应因子对安全阈值进行动态控制,平衡所提算法的全局搜索与局部开发的能力.通过与其他算法在6个基准函数上进行仿真对比,结果表明:所提算法的收敛精度与速度均优于其他算法.在工程应用上,用所提算法优化K-means聚类算法进行图像分割,峰值信噪比(PSNR)、结构相似性(SSIM)及特征相似性(FSIM)3种度量指标验证了其良好的分割性能.
Keyword ：
K-means聚类算法 K-means聚类算法 Logistic模型 Logistic模型 图像分割 图像分割 小孔成像反向学习 小孔成像反向学习 麻雀搜索算法 麻雀搜索算法
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 陈刚 , 林东 , 陈飞 et al. 基于Logistic回归麻雀算法的图像分割 [J]. | 北京航空航天大学学报 , 2023 , 49 (3) : 636-646 . |
| MLA | 陈刚 et al. "基于Logistic回归麻雀算法的图像分割" . | 北京航空航天大学学报 49 . 3 (2023) : 636-646 . |
| APA | 陈刚 , 林东 , 陈飞 , 陈祥宇 . 基于Logistic回归麻雀算法的图像分割 . | 北京航空航天大学学报 , 2023 , 49 (3) , 636-646 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Missing data is an inevitable and ubiquitous problem in the data-driven Intelligent Transportation System (ITS), which seriously affects the accuracy of urban traffic planning and management. Most existing traffic data processing methods often only exploit the characteristics of single source data. In this paper, we present a novel coupled tensors model by using multi-source traffic data for missing data imputation, and propose a tensor completion algorithm based on a modified CMTF-WOPT(Coupled Matrix and Tensor Factorization-Weighted OP-Timization) algorithm to recover the missing traffic data. We also present extensive simulation results by using real world traffic datasets to evaluate the performance of the proposed algorithm. The simulation results show that the proposed coupled tensor completion algorithm makes a significant improvement on the recovery accuracy compared with existing tensor completion algorithms, especially under high missing rates.
Keyword ：
data recovery data recovery Intelligent Transportation System Intelligent Transportation System multi-source data multi-source data tensor completion tensor completion
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhou, Weiming , Zheng, Haifeng , Feng, Xinxin et al. A Multi-source Based Coupled Tensors Completion Algorithm for Incomplete Traffic Data Imputation [C] . 2019 . |
| MLA | Zhou, Weiming et al. "A Multi-source Based Coupled Tensors Completion Algorithm for Incomplete Traffic Data Imputation" . (2019) . |
| APA | Zhou, Weiming , Zheng, Haifeng , Feng, Xinxin , Lin, Dong . A Multi-source Based Coupled Tensors Completion Algorithm for Incomplete Traffic Data Imputation . (2019) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Missing data is an inevitable and ubiquitous problem in the data-driven Intelligent Transportation System (ITS), which seriously affects the accuracy of urban traffic planning and management. Most existing traffic data processing methods often only exploit the characteristics of single source data. In this paper, we present a novel coupled tensors model by using multisource traffic data for missing data imputation, and propose a tensor completion algorithm based on a modified CMTF-WOPT(Coupled Matrix and Tensor Factorization-Weighted OP-Timization) algorithm to recover the missing traffic data. We also present extensive simulation results by using real world traffic datasets to evaluate the performance of the proposed algorithm. The simulation results show that the proposed coupled tensor completion algorithm makes a significant improvement on the recovery accuracy compared with existing tensor completion algorithms, especially under high missing rates. © 2019 IEEE.
Keyword ：
Data handling Data handling Information management Information management Intelligent systems Intelligent systems Intelligent vehicle highway systems Intelligent vehicle highway systems Recovery Recovery Signal processing Signal processing Tensors Tensors Traffic signals Traffic signals Urban transportation Urban transportation
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhou, Weiming , Zheng, Haifeng , Feng, Xinxin et al. A Multi-source Based Coupled Tensors Completion Algorithm for Incomplete Traffic Data Imputation [C] . 2019 . |
| MLA | Zhou, Weiming et al. "A Multi-source Based Coupled Tensors Completion Algorithm for Incomplete Traffic Data Imputation" . (2019) . |
| APA | Zhou, Weiming , Zheng, Haifeng , Feng, Xinxin , Lin, Dong . A Multi-source Based Coupled Tensors Completion Algorithm for Incomplete Traffic Data Imputation . (2019) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
除大型渔船或远洋船只外,我国现有中小船只及"三无"船舶由于数量多、 种类杂、 涉及范围广、 灵活性强,且存在安全监管难度大、 管理职责不清等问题,一般的信息技术和单一的技术手段已经无法满足管理需求.而实现渔船进出港自动监管的关键问题在于如何实现渔船身份的自动识别、 如何解决渔船位置的判定以及以何种方式对渔船进出港进行空间表达.在此基础上运用北斗定位系统和RFID技术相结合来分析渔船的调度方案,可增加调度方案的科学性和提高调度工作的效率.
Keyword ：
RFID技术 RFID技术 中小渔船 中小渔船 港口管理 港口管理 超远程 超远程
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 陈少松 , 林东 . 基于超远程RFID的中小渔船进出港管理系统研究与实现 [J]. | 福建质量管理 , 2019 , (1) : 253 . |
| MLA | 陈少松 et al. "基于超远程RFID的中小渔船进出港管理系统研究与实现" . | 福建质量管理 1 (2019) : 253 . |
| APA | 陈少松 , 林东 . 基于超远程RFID的中小渔船进出港管理系统研究与实现 . | 福建质量管理 , 2019 , (1) , 253 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
在智能交通系统中,短时交通流预测可以为路线规划、交通管理和公共安全等领域提供数据支撑.为了提高数据缺失和异常情况下的预测准确性,提出了一种基于自适应秩动态张量分析的算法来进行短时交通流预测.首先构造了覆盖周、天、时间窗口和空间4个维度的张量,以挖掘交通流数据之间的多模相关性.其次,利用滑动窗口模型,形成动态结构的张量流数据.然后将主成分分析算法扩展成可以接收张量输入的离线张量分析算法,并引入自适应秩和遗忘因子形成自适应秩动态张量分析算法.最后将张量流数据输入自适应秩动态张量分析算法中,实现对短时交通流数据的预测.实验结果显示,即使在数据有缺失的情况下,自适应秩动态张量分析算法也能实现良好的预测.
Keyword ：
动态张量分析 动态张量分析 多模信息 多模信息 数据缺失 数据缺失 短时交通流预测 短时交通流预测
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 何领朝 , 林东 , 冯心欣 . 基于自适应秩动态张量分析的短时交通流预测 [J]. | 物联网学报 , 2019 , 3 (3) : 18-25 . |
| MLA | 何领朝 et al. "基于自适应秩动态张量分析的短时交通流预测" . | 物联网学报 3 . 3 (2019) : 18-25 . |
| APA | 何领朝 , 林东 , 冯心欣 . 基于自适应秩动态张量分析的短时交通流预测 . | 物联网学报 , 2019 , 3 (3) , 18-25 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this paper, we propose a niching Pareto ant colony optimization (NPACO) algorithm to solve the bi-objective pathfinding problem. First, based on a planar navigable data model, three different searching area restricted methods are proposed and compared. In addition, a node simplification strategy is introduced to simplify nodes that exist in network branch loops, eliminating the redundant search time in the branch loops. Afterward, we propose the elitist ants and weakened strategy for an ACO to overcome the problem caused by the impact of accumulated pheromone on the suboptimal path and apply the strategy to a PACO for urban city pathfinding. Finally, the niching method is adopted to simultaneously locate and maintain multiple optimal solutions to increase search robustness. The experimental results show that the NPACO with a restricted and simplified search area returns a Pareto optimal solution set that is uniformly distributed along the Pareto frontier with low computational complexity.
Keyword ：
Ant colony optimization Ant colony optimization Pareto optimal solution Pareto optimal solution Pathfinding problem Pathfinding problem
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Dong , He, Lingchao , Feng, Xinxin et al. Niching Pareto Ant Colony Optimization Algorithm for Bi-Objective Pathfinding Problem [J]. | IEEE ACCESS , 2018 , 6 : 21184-21194 . |
| MLA | Lin, Dong et al. "Niching Pareto Ant Colony Optimization Algorithm for Bi-Objective Pathfinding Problem" . | IEEE ACCESS 6 (2018) : 21184-21194 . |
| APA | Lin, Dong , He, Lingchao , Feng, Xinxin , Luo, Wei . Niching Pareto Ant Colony Optimization Algorithm for Bi-Objective Pathfinding Problem . | IEEE ACCESS , 2018 , 6 , 21184-21194 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Ant colony optimization (ACO) is a kind of simulated evolutionary algorithm. It imitates ants' foraging process to find the shortest path, coexists with the characteristics of randomness and heuristic. It is applied successfully to solve combinatorial optimization problems, such as the TSP problem, the job-shop scheduling problem, etc. In practical application, ACO has the limitation of easily being trapped into local optimum and long time to converge. We propose an improved ant colony optimization algorithm, consisting of introducing random factor and introducing elitist ants as well as weakened strategy. Random factor provides a direction to search within the field of the optimal path. Elitist ants and weakened strategy strengthens the pheromone above the shortest path and weakens the pheromone above the suboptimal path to decrease the accumulated impact. Both of them shorten the convergence time. Simulation results show that the improved algorithm has a better performance than the traditional one. It can not only find a shorter path but also cost less convergence time, along with satisfactory time complexity. The best path length of TSPlib pr136 we get is 96910, closed to official record 96772 and relative error is 0:14%. © 2016 IEEE.
Keyword ：
Ant colony optimization Ant colony optimization Artificial intelligence Artificial intelligence Combinatorial optimization Combinatorial optimization Graph theory Graph theory Green computing Green computing Internet of things Internet of things Job shop scheduling Job shop scheduling
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Luo, Wei , Lin, Dong , Feng, Xinxin . An Improved Ant Colony Optimization and Its Application on TSP Problem [C] . 2016 : 136-141 . |
| MLA | Luo, Wei et al. "An Improved Ant Colony Optimization and Its Application on TSP Problem" . (2016) : 136-141 . |
| APA | Luo, Wei , Lin, Dong , Feng, Xinxin . An Improved Ant Colony Optimization and Its Application on TSP Problem . (2016) : 136-141 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
电力线通信目前用途广泛，具有广阔的市场前景。但由于存在信息安全问题以及通过复杂信道的误码问题，需通过在信源端选择加密算法来对原始信息进行加密，防止非法第三方对信息进行窃取。利用纠错编码对加密后的信息进行信道编码，提高通信过程的可靠性，提高通信质量。本文采用DES加密方式和（7，4）汉明码编码方式形成整体方案，利用CCS软件进行加解密算法以及信道编码算法的编译，并下载到DSP目标板运行，验证方案的可行性。
Keyword ：
CCS CCS DSP DSP 信道编码 信道编码 加密 加密 电力线载波 电力线载波
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 陈阳 , 林东 . 电力线载波加密通信系统研究与设计 [J]. | 有线电视技术 , 2016 , 23 (3) : 35-37 . |
| MLA | 陈阳 et al. "电力线载波加密通信系统研究与设计" . | 有线电视技术 23 . 3 (2016) : 35-37 . |
| APA | 陈阳 , 林东 . 电力线载波加密通信系统研究与设计 . | 有线电视技术 , 2016 , 23 (3) , 35-37 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
低压电力线信道上的噪声干扰且具有时变性和随机性,对于通信系统的研发影响较大.为了给电力线通信系统的研发设计提供可控制、可重复的实验环境,在对低压PLC信道噪声特性的分析、建模仿真的基础上,利用MATLAB/Simulink直接生成DSP可执行代码,设计低压电力线信道噪声发生器.利用MATLAB快速生成DSP代码的方法,实现的噪声发生器与仿真实现噪声一致,同时方法简便,大大减少DSP设计开发的工作量.
Keyword ：
DSP DSP MATLAB/Simulink MATLAB/Simulink 信道噪声发生器 信道噪声发生器 电力线通信 电力线通信
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 叶夏兰 , 林东 . PLC信道噪声建模仿真及其 噪声发生器的DSP实现 [J]. | 有线电视技术 , 2016 , 23 (1) : 40-43 . |
| MLA | 叶夏兰 et al. "PLC信道噪声建模仿真及其 噪声发生器的DSP实现" . | 有线电视技术 23 . 1 (2016) : 40-43 . |
| APA | 叶夏兰 , 林东 . PLC信道噪声建模仿真及其 噪声发生器的DSP实现 . | 有线电视技术 , 2016 , 23 (1) , 40-43 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
利用MATLAB中的Simulink对OFDM系统进行建模仿真,并通过代码转换对其发送端的核心算法生成DSP代码,经编译、链接、加载后在DSP目标板运行.OFDM符号由DSP板的输出接口输出,经D/A转换及放大后送入传输信道.在示波器上观测到OFDM时域符号波形与理论波形及仿真波形三者一致,验证了通过Simlink对系统DSP代码转换生成的正确性.
Keyword ：
DSP DSP FFT FFT OFDM OFDM Simulink Simulink 代码转换 代码转换
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 叶夏兰 , 林东 . OFDM建模仿真及其DSP代码转换生成 [J]. | 有线电视技术 , 2015 , (7) : 66-69 . |
| MLA | 叶夏兰 et al. "OFDM建模仿真及其DSP代码转换生成" . | 有线电视技术 7 (2015) : 66-69 . |
| APA | 叶夏兰 , 林东 . OFDM建模仿真及其DSP代码转换生成 . | 有线电视技术 , 2015 , (7) , 66-69 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
