检索结果-南通市图书馆

China Communications 2016年第8期13卷 177-183页

作者： Zeheng Yang Yongan Guo School of Computer Science and Engineering University of Electronic Science and Technology of China(UESTC) College of Telecommunications and Information Engineering Nanjing University of Posts and Telecommunications

Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the *** exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link *** on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on integer linear programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate *** topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.

关键词： network virtualization virtual network embedding exact VNE algorithm integer linear programming location constraint VNR acceptance ratio

Revision of stratified OWL ontologiesbased on integer linear programming

在线全文

学校读者我要写书评

暂无评论

Journal of Southeast University(English Edition) 2020年第1期36卷 1-7页

作者： Ji Qiu Qi Guilin Boutouhami Khaoula School of Modern Posts Nanjing University of Posts and Telecommunications Nanjing 210023 China School of Computer Science and Engineering Southeast University Nanjing 211189 China Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast University Nanjing 211189 China

To revise stratified web ontology language(OWL)ontologies,the kernel revision operator is extended by defining novel conflict stratification and the incision function based on integer linear programming(ILP).The ILP-based model considers an optimization problem of minimizing a linear objective function which is suitable for selecting the minimal number of axioms to remove when revising *** on the incision function,a revision algorithm is proposed to apply ILP to all minimal incoherence-preserving subsets(MIPS).Although this algorithm can often find a minimal number of axioms to remove,it is very time-consuming to compute ***,an adapted revision algorithm to deal with unsatisfiable concepts individually is also *** results reveal that the proposed ILP-based revision algorithm is much more efficient than the commonly used algorithm based on the hitting set *** addition,the adapted algorithm can achieve higher efficiency,while it may delete more axioms.

关键词： ontology revision inconsistency handling semantic web integer linear programming

A new heuristic algorithm for general integer linear programming problems

在线全文

学校读者我要写书评

暂无评论

Journal of Chongqing University 2006年第3期5卷 170-174页

作者：高培旺 Department of Finance Guangxi University of Finance and Economics Nanning 530003 P. R. China

A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of assistant sets, an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane. A simple numerical example shows that the algorithm is efficient for some problems, and therefore, of practical interest.

关键词： integer linear programming objective function hyperplane cutting plane heuristic algorithm

XGRouter： high-quality global router in X-architecture with particle swarm optimization

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2015年第4期9卷 576-594页

作者： Genggeng LIU Wenzhong GUO Rongrong LI Yuzhen NIU Guolong CHEN College of Mathematics and Computer Science Fuzhou University Fuzhou 350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350116 China

This paper presents a high-quality very large scale integration （VLSI） global router in X-architecture, called XGRouter, that heavily relies on integer linear pro- gramming （ILP） techniques, partition strategy and particle swarm optimization （PSO）. A new ILP formulation, which can achieve more uniform routing solution than other formu- lations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing re- gion is extended progressively from the most congested re- git）n. In the post-processing stage of XGRouter, maze rout- ing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global rout- ing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global touters, XGRouter has no overflow.

关键词： global routing overflow total wire length con-gestion uniformity X-architecture particle swarm optimiza-tion integer linear programming

Hierarchical method of task assignment for multiple cooperating UAV teams

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2015年第5期26卷 1000-1009页

作者： Xiaoxuan Hu Huawei Ma Qingsong Ye He Luo School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education

The problem of task assignment for multiple cooperating unmanned aerial vehicle(UAV) teams is considered. Multiple UAVs forming several small teams are needed to perform attack tasks on a set of predetermined ground targets. A hierarchical task assignment method is presented to address the problem. It breaks the original problem down to three levels of sub-problems: target clustering, cluster allocation and target assignment. The first two sub-problems are centrally solved by using clustering algorithms and integer linear programming, respectively, and the third sub-problem is solved in a distributed and parallel manner, using a mixed integer linear programming model and an improved ant colony algorithm. The proposed hierarchical method can reduce the computational complexity of the task assignment problem considerably, especially when the number of tasks or the number of UAVs is large. Experimental results show that this method is feasible and more efficient than non-hierarchical methods.

关键词： unmanned aerial vehicle(UAV) task assignment clustering integer linear programming ant colony optimization(ACO) algorithm

THE TIME INTERVAL ALIGNMENT (IA) POLICIES, BOUNDARY AND APPLICATIONS WITH MULTIPLE STREAM ARRIVALS

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science and Systems Engineering 2011年第4期20卷 400-415页

作者： Meimei WANG James R. PERKINS Decision Support Information System Beth Israel Deaconess Medical Center Boston MA 02120 USA Department of Manufacturing Engineering Boston University Boston MA 02446 USA

This paper discusses a class of interval alignment （IA） scheduling policies, which are particularly effective for the systems that do not have Markovian structure. The numerical results show that IA policies effectively smooth part flows, improve performance and decrease average Work-in-Process （WlP） by adding intermediate delays to the system, The boundary of IA policy is proven and the applications of IA policy in the system with multiple stream arrivals have been discussed. With the combination of release policy, it is practical to implement IA to multiple stream arrival system.

关键词： Detailed scheduling policies non-Markovian multiple stream interval alignment policies integer linear programming lea

An Intelligent Optimization Method of Reinforcing Bar Cutting for Construction Site

在线全文

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2023年第1期134卷 637-655页

作者： Zhaoxi Ma Qin Zhao Tianyou Cang Zongjian Li Yiyun Zhu Xinhong Hei Department of Civil Engineering and Architecture Xi’an University of TechnologyXi’an710048China State Key Laboratory of Rail Transit Engineering Informatization(FSDI) Xi’an710043China Department of Computer Science and Engineering Xi’an University of TechnologyXi’an710048China

To meet the requirements of specifications,intelligent optimization of steel bar blanking can improve resource utilization and promote the intelligent development of sustainable *** one of the most important building materials in construction engineering,reinforcing bars(rebar)account for more than 30%of the cost in civil engineering.A significant amount of cutting waste is generated during the construction *** cutting waste increases construction costs and generates a considerable amount of CO_(2)*** study aimed to develop an optimization algorithm for steel bar blanking that can be used in the intelligent optimization of steel bar engineering to realize sustainable *** the proposed algorithm,the integer linear programming algorithm was applied to solve the *** was combined with the statistical method,a greedy strategy was introduced,and a method for determining the dynamic critical threshold was developed to ensure the accuracy of large-scale data *** proposed algorithm was verified through a case study;the results confirmed that the rebar loss rate of the proposed method was reduced by 9.124%compared with that of traditional distributed processing of steel bars,reducing CO_(2)emissions and saving construction *** the scale of a project increases,the calculation quality of the optimization algorithmfor steel bar blanking proposed also increases,while maintaining high calculation *** the results of this study are applied in practice,they can be used as a sustainable foundation for building informatization and intelligent development.

关键词： Building construction rebar work cutting stock problem optimization algorithm integer linear programming

HISP： a hybrid intelligent approach for identifying Jirected signaling pathways

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Molecular Cell Biology 2017年第6期9卷 453-462页

作者： Xing-Ming Zhao Shan Li Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai 200433 China Department of Mathematics Shanghai University Shanghai 200444 China

Signal transduction plays important roles in biological systems. Unfortunately, our knowledge about signaling pathways is far from complete. Specifically, the direction of signaling flows is less known even though the signaling molecules of some signaling pathways have been determined. In this paper, we propose a novel hybrid intelligent method, namely HISP （Hybrid Intelligent approach for identifying directed Signaling Pathways）, to determine both the topologies of signaling pathways and the direction of signaling flows within a pathway based on integer linear programming and genetic algorithm. By integrating the protein-protein interaction, gene expression, and gene knockout data, our HISP approach is able to determine the optimal topologies of signaling pathways in an accurate way. Benchmark results on yeast MAPK signaling pathways demonstrate the efficiency of our proposed approach. When applied to the EGFR/ErbB signaling pathway in human hepatocytes, HISP unveils a high-resolution signaling path- way, where many signaling interactions were missing by existing computational approaches.

关键词： EGFR/ErbB signaling pathway genetic algorithm hybrid intelligence integer linear programming MAPK signaling path-way signaling pathway

Energy-constrained ferry route design for sparse wireless sensor networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Central South University 2013年第11期20卷 3142-3149页

作者：王勇彭伟窦强龚正虎 College of Computer National University of Defense Technology

In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor *** the sensors are far away from each other in such highly partitioned scenario,a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the ***,practical constraints(e.g.,the energy)preclude a ferry from visiting all sensors in a single *** such case,the ferry can only access part of the sensors in each tour and move back to the sink to get the energy ***,the energy-constrained ferry route design(ECFRD)problem is discussed,which leads to the optimization problem of minimizing the total route length of the ferry,while keeping the route length of each tour below a given *** ECFRD problem is proved to be NP-hard problem,and the integer linear programming(ILP)formulation is *** that,efficient heuristic algorithms are proposed to solve this *** experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution.

关键词： message ferry energy-constrained route design integer linear programming wireless sensor networks

Hierarchical method of task assignment for multiple cooperating UAV teams

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2015年第5期28卷 1000-1009页

作者： Xiaoxuan Hu Huawei Ma Qingsong Ye He Luo School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education

关键词： unmanned aerial vehicle (UAV) task assignment clustering integer linear programming ant colony optimization(ACO) algorithm