检索结果-南通市图书馆

A greedy algorithm based on joint assignment of airport gates and taxiways in large hub airports

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 2020年第4期26卷 417-423页

作者：聂彤彤 Wu Wenjun He Qichang Zhang Xuanyi Sun Yang Zhang Yanhua Faculty of Information Technology Beijing University of TechnologyBeijing 100124P.R.China Beijing Capital International Airport Co. LtdBeijing 100621P.R.China

With the rapid development of civil aviation in recent years,the management and assignment of airport resources are becoming more and more *** the various airport resources,gates and taxiways are very important,therefore,many researchers focus on the airport gate and taxiway assignment ***,the joint assignment algorithm of airport gates and taxiways with realistic airport data has not been well studied.A greedy algorithm based on joint assignment of airport gates and taxiways using the data of a large hub airport in China is *** objective is maximizing the ratio of fixed gates and minimizing the ratio of taxiway *** results show that it outperforms other assignment schemes.

关键词： greedy algorithm airport gate taxiway resources assignment

Using greedy algorithm: DBSCAN revisited II

在线全文

学校读者我要写书评

暂无评论

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2004年第11期 94-101页

作者：岳士弘李平郭继东周水庚 Institute of Industrial Process Control Yining 835000 Hangzhou 310027 China Zhejiang University Yili Teacher’s College

The density-based clustering algorithm presented is different from the classical Density-Based Spatial Clus- tering of Applications with Noise (DBSCAN) (Ester et al., 1996), and has the following advantages: first, greedy algorithm substitutes for R*-tree (Bechmann et al., 1990) in DBSCAN to index the clustering space so that the clustering time cost is decreased to great extent and I/O memory load is reduced as well; second, the merging condition to approach to arbi- trary-shaped clusters is designed carefully so that a single threshold can distinguish correctly all clusters in a large spatial dataset though some density-skewed clusters live in it. Finally, authors investigate a robotic navigation and test two artificial datasets by the proposed algorithm to verify its effectiveness and efficiency.

关键词： DBSCAN algorithm greedy algorithm Density-skewed cluster

A greedy algorithm for Solving the Weapon-Target Assignment Problem

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A Greedy Algorithm for Solving the Weapon-Target Assignment ...

greedy Genetic algorithm to Bounded Knapsack Problem

2010 Third International Conference on Education Technology and Training (ETT 2010)

作者： Gaojun Fan Shihai Guo and Xiaodong Liu Aviation Theory Teaching and Researching Department Naval Flying Academy 125001 Huludao Liaoning Province China

The Weapon-Target Assignment （WTA） problem is to find a proper assignment of weapons to targets in order to minimize （maximize） the expected damage of own-force assets （enemy-force assets）. In this paper, we propose a novel greedy algorithm to solve the WTA problem, known as a NP-complete problem. The proposed algorithm according to a greedy rule is successfully applied to the WTA problems based on readjusting the weight of target. Simulation results show that the proposed algorithm can indeed have great efficiency among the different number of weapons and targets.

关键词： Combinatorial optimization greedy algorithm readjusting rule Weapon-Target Assignment (WTA).

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Greedy Genetic Algorithm to Bounded Knapsack Problem

Maximizing Submodular+Supermodular Functions Subject to a Fairness Constraint

2010 3rd IEEE International Conference on Computer Science and Information Technology—ICCSIT 2010

作者： Sarsij Kaystha Computer Science and Engineering Department Motilal Nehru National Institute of Technology Allahabad India Suneeta Agarwal Computer Science and Engineering Department Motilal Nehru National Institute of Technology Allahabad India

@Sarsij Kaystha$Computer Science and Engineering Department Motilal Nehru National Institute of Technology Allahabad!India@Suneeta Agarwal$Computer Science and Engineering Department Motilal Nehru National Institute o... 详细信息

关键词： component: Bounded Knapsack greedy algorithm Genetic algorithm Combinatorial Problem Optimization

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2024年第1期29卷 46-55页

作者： Zhenning Zhang Kaiqiao Meng Donglei Du Yang Zhou Beijing Institute for Scientific and Engineering Computing Beijing University of TechnologyBeijing 100124China Faculty of Management University of New BrunswickFredericton E3B 5A3Canada School of Mathematics and Statistics Shandong Normal UniversityJinan 250014China

We investigate the problem of maximizing the sum of submodular and supermodular functions under a fairness *** sum function is non-submodular in *** an offline model,we introduce two approximation algorithms:A greedy algorithm and a threshold greedy *** a streaming model,we propose a one-pass streaming *** also analyze the approximation ratios of these algorithms,which all depend on the total curvature of the supermodular *** total curvature is computable in polynomial time and widely utilized in the literature.

关键词： submodular function supermodular function fairness constraint greedy algorithm threshold greedy algorithm streaming algorithm

An Innovative K-Anonymity Privacy-Preserving algorithm to Improve Data Availability in the Context of Big Data

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第4期79卷 1561-1579页

作者： Linlin Yuan Tiantian Zhang Yuling Chen Yuxiang Yang Huang Li State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China College of Information Engineering Guizhou Open UniversityGuiyang550025China Guizhou Academy of Tobacco Science Guiyang550025China

The development of technologies such as big data and blockchain has brought convenience to life,but at the same time,privacy and security issues are becoming more and more *** K-anonymity algorithm is an effective and low computational complexity privacy-preserving algorithm that can safeguard users’privacy by anonymizing big ***,the algorithm currently suffers from the problem of focusing only on improving user privacy while ignoring data *** addition,ignoring the impact of quasi-identified attributes on sensitive attributes causes the usability of the processed data on statistical analysis to be *** on this,we propose a new K-anonymity algorithm to solve the privacy security problem in the context of big data,while guaranteeing improved data ***,we construct a new information loss function based on the information quantity *** that different quasi-identification attributes have different impacts on sensitive attributes,we set weights for each quasi-identification attribute when designing the information loss *** addition,to reduce information loss,we improve K-anonymity in two ***,we make the loss of information smaller than in the original table while guaranteeing privacy based on common artificial intelligence algorithms,i.e.,greedy algorithm and 2-means clustering *** addition,we improve the 2-means clustering algorithm by designing a mean-center method to select the initial center of ***,we design the K-anonymity algorithm of this scheme based on the constructed information loss function,the improved 2-means clustering algorithm,and the greedy algorithm,which reduces the information ***,we experimentally demonstrate the effectiveness of the algorithm in improving the effect of 2-means clustering and reducing information loss.

关键词： Blockchain big data K-anonymity 2-means clustering greedy algorithm mean-center method

Improving access to urban parks through public transit optimization

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Architectural Research 2024年第3期13卷 575-592页

作者： Ning Xu Kaidan Guan Pu Wang School of Architecture Southeast UniversityNanjing 210096China Jiangsu Provincial Urban and Rural Digital Technology Engineering Center Nanjing 210096China

This study establishes an evaluation and optimization framework for the public transit network based on social network analysis and a greedy algorithm,aiming to explore a quantitative approach to improving access to urban parks through public transit *** network analysis and the ArcGIS platform are used to build a public transit network model within Nanjing Old City and analyze its overall network structure *** study also focuses on a method to improve the convenience of reaching regional and citylevel parks by public transit by increasing access and connecting points accordingly.A greedy algorithm is introduced to generate an optimized solution for improving public transit accessibility to regional and city-level parks,consequently enhancing their *** major findings include:(1)The greedy algorithm effectively enhances the performance of the public transit network,but its benefits gradually diminish as more stations are added.(2)Strategically adding stations enhances the performance of most public transit access points,creating efficient pathways for other stations to directly reach these access points and enter regional and city-level parks.(3)The optimized public transit network model offers guidance for the planning and layout of regional and city-level *** site selection for new parks should prioritize establishing connections with the“hubs”in the public transit *** proposed optimization of the public transit network in this study is specific to a single type of urban park,but subsequent research could be conducted to extend the optimization of public transit accessibility around more urban public resources.

关键词： Urban parks Social network analysis Accessibility optimization Public transit network greedy algorithm

A greedy path planning algorithm based on pre-path-planning and real-time-conflict for multiple automated guided vehicles in large-scale outdoor scenarios

在线全文

学校读者我要写书评

暂无评论

High Technology Letters 2023年第3期29卷 279-287页

作者：王腾达 WU Wenjun YANG Feng SUN Teng GAO Qiang Faculty of Information Technology Beijing University of TechnologyBeijing 100124P.R.China The 54th Research Institute of CETC Shijiazhuang 050081P.R.China

With the wide application of automated guided vehicles(AGVs) in large scale outdoor scenarios with complex terrain,the collaborative work of a large number of AGVs becomes the main *** effective multi-agent path finding(MAPF) algorithm is urgently needed to ensure the efficiency and realizability of the whole system. The complex terrain of outdoor scenarios is fully considered by using different values of passage cost to quantify different terrain types. The objective of the MAPF problem is to minimize the cost of passage while the Manhattan distance of paths and the time of passage are also evaluated for a comprehensive comparison. The pre-path-planning and real-time-conflict based greedy(PRG) algorithm is proposed as the solution. Simulation is conducted and the proposed PRG algorithm is compared with waiting-stop A^(*) and conflict based search(CBS) algorithms. Results show that the PRG algorithm outperforms the waiting-stop A^(*) algorithm in all three performance indicators,and it is more applicable than the CBS algorithm when a large number of AGVs are working collaboratively with frequent collisions.

关键词： automated guided vehicle(AGV) multi-agent path finding(MAPF) complex terrain greedy algorithm

Automatic spectrum recognition system for charge state analysis in electron cyclotron resonance ion sources

在线全文

学校读者我要写书评

暂无评论

Nuclear Science and Techniques 2023年第11期34卷 199-211页

作者： Rui Wang Cheng Qian Yu‑Hui Guo Peng Zhang Jin‑Dou Ma Institute of Modern Physics Chinese Academy of SciencesLanzhou 730000China University of Chinese Academy of Sciences Beijing 100049China

The Electron Cyclotron Resonance(ECR)ion source is a critical device for producing highly charged ion beams in various *** the charge-state distribution of the ion beams is essential,but the manual analysis is labor-intensive and prone to inaccuracies due to impurity *** automatic spectrum recognition system based on intelligent algorithms was proposed for rapid and accurate chargestate analysis of ECR ion *** system employs an adaptive window-length Savitzky-Golay(SG)filtering algorithm,an improved automatic multiscale peak detection(AMPD)algorithm,and a greedy matching algorithm based on the relative distance to accurately match different peaks in the spectra with the corresponding charge-state ion ***,a user-friendly operator interface was developed for ease of *** testing on the online ECR ion source platform demonstrates that the system achieves high accuracy,with an average root mean square error of less than 0.1 A for identifying charge-state spectra of ECR ion ***,the system minimizes the stand-ard deviation of the first-order derivative of the smoothed signal to 81.1846 *** results indicate the capability of the designed system to identify ion beam spectra with mass numbers less than Xe,including Xe *** proposed automatic spectrum recognition system represents a significant advancement in ECR ion source analysis,offering a rapid and accurate approach for charge-state analysis while enhancing supply *** exceptional performance and successful imple-mentation of the proposed system on multiple ECR ion source platforms at IMPCAS highlight its potential for widespread adoption in ECR ion source research and applications.

关键词： ECRIS Spectrum recognition SG filtering AMPD algorithm greedy algorithm