检索结果-内蒙古大学图书馆

IEEE Symposium on Computers and Informatics (ISCI)

作者： Azlan, Ammar Hussin, Naimah Mohd Univ Teknol MARA Perlis Dept Comp Sci Fac Comp & Math Sci Kangar Malaysia

ISBN: (纸本)9781479902101

Curriculum-based course timetabling problem (CB-CTP) is a classical problem that is still being researched on nowadays. There are two phases in solving CB-CTP. The first phase is the construction phase where a population of initial solutions is generated. The second phase is the optimization phase where the final optimal solution is produced. While most papers concentrate on the optimization phase, this paper focuses on the construction phase due to the importance of initial solutions to the optimization phase. The initial solutions are generated by implementing graph coloring heuristic to the CB-CTP. The graph coloring heuristics used in this paper are largest degree and largest weighted degree. Result from computational experiment shows that both methods are able to produce population of initial solutions for almost every data instance.

关键词： constructive algorithm curriculum-based course timetabling graph coloring heuristic initial solution

来源：评论

学校读者我要写书评

暂无评论

Memory-Optimised Parallel Processing of Hi-C Data 23

Memory-Optimised Parallel Processing of Hi-C Data

引用

23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

作者： Drocco, Maurizio Misale, Claudia Pezzi, Guilherme Peretti Tordini, Fabio Aldinucci, Marco Univ Turin Dept Comp Sci I-10124 Turin Italy

ISBN: (纸本)9781479984909

This paper presents the optimisation efforts on the creation of a graph-based mapping representation of gene adjacency. The method is based on the Hi-C process, starting from Next Generation Sequencing data, and it analyses a huge amount of static data in order to produce maps for one or more genes. Straightforward parallelisation of this scheme does not yield acceptable performance on multicore architectures since the scalability is rather limited due to the memory bound nature of the problem. This work focuses on the memory optimisations that can be applied to the graph construction algorithm and its (complex) data structures to derive a cache-oblivious algorithm and eventually to improve the memory bandwidth utilisation. We used as running example NuChart-II, a tool for annotation and statistic analysis of Hi-C data that creates a gene-centric neighborhood graph. The proposed approach, which is exemplified for Hi-C, addresses several common issue in the parallelisation of memory bound algorithms for multicore. Results show that the proposed approach is able to increase the parallel speedup from 7x to 22x (on a 32-core platform). Finally, the proposed C++ implementation outperforms the first R NuChart prototype, by which it was not possible to complete the graph generation because of strong memory-saturation problems.

关键词： Memory Memory PARALLEL PROCESSING (COMPUTERS) Multi-core processors Line graph ANNOTATIONS Scalability constructive algorithm memory bandwidth maps

来源：评论

学校读者我要写书评

暂无评论

Single Layer Feedforward Networks Construction Based on Orthogonal Least Square and Particle Swarm Optimization 15th

Single Layer Feedforward Networks Construction Based on Orth...

引用

15th International Conference on Artificial Intelligence and Soft Computing (ICAISC)

作者： Wu, Xing Rozycki, Pawel Wilamowski, Bogdan M. Auburn Univ Auburn AL 36849 USA Univ Informat Technol & Management Rzeszow Sucharskiego 2 PL-35225 Rzeszow Poland

ISBN: (纸本)9783319393780;9783319393773

According to the simplicity and universal approximation capability, single layer feedforward networks (SLFN) are widely used in classification and regression problems. The paper presents a new OLS-PSO constructive algorithm based on Orthogonal Least Square (OLS) method and Particle Swarm Optimization (PSO) algorithm. Instead of evaluating the orthogonal components of each neuron as the conventional OLS method, a new recursive formulation is derived. Then based on the new evaluation of each neuron's contribution, the PSO algorithm is used to seek the optimal parameters of the new neuron in continuous space. The proposed algorithm is experimented on some practical regression problems and compared with other constructive algorithms. Results show that proposed OLS-PSO algorithm could achieve a compact SLFN with good generalization ability.

关键词： Single Layer Feedforward Networks (SLFN) constructive algorithm Orthogonal Least Square (OLS) Particle Swarm Optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Cheapest Insertion and Disruption of Routes Operators for Solving Multi-Depot Electric Vehicle Location Routing Problem with Time Windows and Battery Swapping via GRASP and RVND

Cheapest Insertion and Disruption of Routes Operators for So...

引用

IEEE Congress on Evolutionary Computation (IEEE CEC)

作者： Portela, Braulio M. O. Bernardino, Heder S. Goncalves, Luciana B. Soares, Stenio S. R. F. Univ Fed Juiz de Fora Juiz De Fora Brazil

ISBN: (纸本)9781728183923

The Multi-Depot Electric Vehicle Location Routing Problem with Time Windows and Battery Swapping (MDEVLRPTW-BS) aims to mitigate the environmental impacts caused by the use of vehicles with an internal combustion engine and uses economically viable electric vehicles in transportation services with time window restrictions. This problem is complex as one must define (i) the location of the battery swapping stations, (ii) the depots to be used from a list of candidates, and (iii) the assignment and routing of a fleet of electric vehicles. We propose here two constructive methods to solve MDEVLRPTW-BS, namely, Cheapest Insertion and Disruption of Routes. These constructive approaches are used with the Greedy Randomized Adaptive Search Procedure (GRASP) and the Random Variable Neighborhood Descent (RVND) method with six movement operators. Two of these operators, namely Isolate and ChangeBSS, are also proposed here for solving MDEVLRPTW-BS. The proposals are compared with a technique from the literature using instances with 5, 10, and 15 customers, and the proposed approaches presented good results, mainly regarding the processing time. Also, we propose new sets of instances larger than those from the literature. Thus, the search techniques can be analyzed when subjected to greater and more realistic situations. These new instances are composed of 100, 144, 288, 360, 420, and 600 customers. For these cases, the approaches also obtained good and promising results, mainly when the Disruption of Routes approach (GRASP-DR-RVND) is used.

关键词： electric vehicle constructive algorithm location routing problem battery swapping green logistic GRASP-RVND

来源：评论

学校读者我要写书评

暂无评论

Automatic synthesis of multiple place resource models with Petri nets

Automatic synthesis of multiple place resource models with P...

引用

American Control Conference

作者： Ferrarini, L Piroddi, L Politecn Milan Dipartimento Elettr & Informat I-20133 Milan Italy

ISBN: (纸本)0780383354

The paper focuses on the correct representation of shared resources in Petri net models of automated manufacturing systems, in the presence of concurrent independent operations, such as assembly and disassembly ones. In particular, an original multiple-place model is specifically derived and a constructive algorithm is proposed for the automatic synthesis of the resource model. The algorithm computes the number of resource places for each resource, as well as their connections to the recipes' transitions. Proper necessary conditions of "well-definiteness" are introduced for the partial models that are incrementally defined by the user.

关键词： manufacturing systems resource allocation Petri nets automatic synthesis multiple place resource models Petri net model resource sharing automated manufacturing systems constructive algorithm necessary condition

来源：评论

学校读者我要写书评

暂无评论

Evolutionary strategy for learning multiple-valued logic functions

Evolutionary strategy for learning multiple-valued logic fun...

引用

34th International Symposium on Multiple-Valued Logic (ISMVL 2004)

作者： Ngom, A Simovici, DA Stojmenovic, I Univ Windsor Dept Comp Sci Windsor ON N9B 3P4 Canada

ISBN: (纸本)0769521304

We consider the problem of synthesizing multiple-valued logic functions by neural networks. An evolutionary strategy (ES) which finds the longest strip in V subset of or equal to K-n is described. A strip contains points located between two parallel hyperplanes. Repeated application of ES partitions the space V into certain number of strips, each of them corresponding to a hidden unit. We construct neural networks based on these hidden units. Preliminary experimental results are presented and discussed.

关键词： multiple-valued logic multiple-threshold perceptron evolution strategy neural network partitioning method constructive algorithm

来源：评论

学校读者我要写书评

暂无评论

Should I Stay or Should I Grow? A Dynamic Self-Governed Growth for Determining Hidden Layer Size in a Multilayer Perceptron

Should I Stay or Should I Grow? A Dynamic Self-Governed Grow...

引用

International Joint Conference on Neural Networks (IJCNN) held as part of the IEEE World Congress on Computational Intelligence (IEEE WCCI)

作者： Ross, Matt Berberian, Nareg Chartier, Sylvain Univ Ottawa Sch Psychol Ottawa ON Canada

ISBN: (纸本)9781728169262

A novel dynamic self-governed growth algorithm inspired from population dynamics is introduced in a Multi-Layer Perceptron (MLP). This allows the inclusion of a carrying capacity, which is the maximum population of hidden units that can be sustained in a single hidden layer. The inclusion of this constraint in combination with population dynamics provides a built-in mechanism for a dynamic growth rate. The proposed approach is used in parallel with direct performance feedback from the network to modulate the growth rate of the hidden layer. This algorithm incrementally adds units to the hidden layer up to a point where the complexity of the task no longer requires further addition. The MLP is extended with the growing algorithm and its adaptability is tested by subjecting the network to increasing levels of task complexity for the n-bit problem. Using fixed rules that dictate both the size of a fixed layer MLP (fMLP) and the upper bound carrying capacity of the growing MLP (gMLP), the resulting topologies are directly compared for the n-bit problem. In short, the results suggest that even if an upper boundary of the carrying capacity is set by a fixed rule, the growing algorithm is capable of converging to less than the predicted number of units required for solving the given task. With the majority of trials growing to the same number of hidden units regardless of the rule used. This effect is consistent across the specified rules and levels of task complexity for the n-bit problem.

关键词： multilayer perceptron growing constructive algorithm population dynamics artificial neural networks parity n-bit

来源：评论

学校读者我要写书评

暂无评论

Dynamic Pick-Up and Delivery Optimization With Multiple Dynamic Events in Real-World Environment

引用

IEEE ACCESS 2019年 7卷 146209-146220页

作者： Sun, Baofeng Yang, Yue Shi, Junyan Zheng, Lili Jilin Univ Coll Transportat Changchun 130025 Jilin Peoples R China

Real-time city distribution strategies are highly dependent on dynamic environments, requiring timely responses to real-time changes due to various dynamic events that take place in the distribution system. Considering the influence of four kinds of real-time information on vehicle routing and vehicle scheduling, including new requests arriving gradually, old requests being modified or canceled, traffic congestion and vehicle breakdowns, a dynamic vehicle routing model based on a dynamic pick-up and delivery problem considering multiple dynamic events in a real-world environment (DPDP-MDE) is established. A dynamic algorithm framework is designed to solve the problem, the tabu search (TS) algorithm and the adaptive large neighborhood search (ALNS) algorithm are adopted to improve the quality of the initial solution, and the dynamic insertion method is adopted to solve the synchronization problem of unfixed requests (that is, unaccepted customer requests and modified requests) and new requests. The experimental results show that the model and dynamic algorithm framework proposed in this paper can effectively solve the dynamic pick-up and delivery problem with time windows (DPDP-TW). At different scheduling time horizons T, the TS algorithm improves the initial solution by an average of 3.11% and the ALNS algorithm by an average of 9.98%. Under different degrees of urgency, compared to the ALNS algorithm, the quality of the solution produced by the TS algorithm is not high, but the computation time is very small and it is relatively stable. Under different request sizes, the TS algorithm can obtain optimization results in 60s under four request levels, which gives it a significant advantage over the ALNS algorithm.

关键词： Dynamic pick-up and delivery problem dynamic events dynamic algorithm framework constructive algorithm tabu search algorithms adaptive large neighborhood search algorithms

来源：评论

学校读者我要写书评

暂无评论

Evolutionary strategy for learning multiple-valued logic functions

引用

JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING 2006年第5-6期12卷 459-489页

作者： Ngom, Alioune Simovici, Dan A. Stojmenovic, Ivan Univ Windsor Dept Comp Sci Windsor ON N9B 3P4 Canada Univ Massachusetts Dept Math & Comp Sci Boston MA 02125 USA Univ Ottawa Sch Informat Technol & Engn Dept Comp Sci Ottawa ON K1N 6N5 Canada

We consider the problem of synthesizing multiple-valued logic functions by neural networks. An evolutionary strategy (ES) which finds the longest strip in V subset of K-n is described. A strip contains points located between two parallel hyperplanes. Repeated application of ES partitions the space V into certain number of strips, each of them corresponding to a hidden unit. We construct neural networks based on these hidden units. Preliminary experimental results are presented and discussed.

关键词： multiple-valued logic multiple-threshold perceptron evolution strategy neural network partitioning method constructive algorithm

来源：评论

学校读者我要写书评

暂无评论

constructive APPROACHES FOR TRAINING OF WAVELET NEURAL NETWORKS USING ADAPTIVE LEARNING RATE

引用

INTERNATIONAL JOURNAL OF WAVELETS MULTIRESOLUTION AND INFORMATION PROCESSING 2013年第3期11卷 1350021-1350021页

作者： Skhiri, Mohamed Zine El Abidine Chtourou, Mohamed Univ Sfax Natl Sch Engn Sfax Dept Elect Engn Sfax Tunisia

This paper investigates the applicability of the constructive approach proposed in Ref. 1 to wavelet neural networks (WNN). In fact, two incremental training algorithms will be presented. The first one, known as one pattern at a time (OPAT) approach, is the WNN version of the method applied in Ref. 1. The second approach however proposes a modified version of Ref. 1, known as one epoch at a time (OEAT) approach. In the OPAT approach, the input patterns are trained incrementally one by one until all patterns are presented. If the algorithm gets stuck in a local minimum and could not escape after a fixed number of successive attempts, then a new wavelet called also wavelon, will be recruited. In the OEAT approach however, all the input patterns are presented one epoch at a time. During one epoch, each pattern is trained only once until all patterns are trained. If the resulting overall error is reduced, then all the patterns will be retrained for one more epoch. Otherwise, a new wavelon will be recruited. To guarantee the convergence of the trained networks, an adaptive learning rate has been introduced using the discrete Lyapunov stability theorem.

关键词： Wavelet neural networks constructive algorithm stability

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：