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

作者： Min, Zeng Low, Malcolm Yoke Hean Jing, Hsu Wen Ying, Huang Shell Fan, Liu Aye, Win Cho Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Nanyang Avenue Singapore 639798 Singapore

ISBN: (纸本)9789881701282

Stowage planning for container vessels concerns the core competence of the shipping lines. As such, automated stowage planning has attracted much research in the past two decades, but with few documented successes. In an ongoing project, we are developing a prototype stowage planning system aiming for large containerships. The system consists of three modules: the stowage plan generator, the stability adjustment module, and the optimization engine. This paper mainly focuses on the stability adjustment module. The objective of the stability adjustment module is to check the global ship stability of the stowage plan produced by the stowage plan generator and resolve the stability issues by applying a heuristic algorithm to search for alternative feasible locations for containers that violate some of the stability criteria. We demonstrate that the procedure proposed is capable of solving the stability problems for a large containership with more than 5000 TEUs.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

Stowage planning of large containership with tradeoff between crane workload balance and ship stability

Stowage planning of large containership with tradeoff betwee...

引用

作者： Fan, Liu Low, Malcolm Yoke Hean Ying, Huang Shell Jing, Hsu Wen Min, Zeng Aye, Win Cho Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Nanyang Avenue Singapore 639798 Singapore

ISBN: (纸本)9789881701282

This paper describes an effective algorithm for generating basic stowage plans of large containership calling at a given number of ports. The algorithm applies an efficient block-based container allocation heuristic method of our previous work and taking into considerations more constraints in the real-world operations of commercial shipping line. The algorithm divides the cargo-space of a large containership into blocks, and assigns groups of containers to different partitions of the ship according to a set of heuristic rules. We present a practical test case and analyze the stowage plan generated by our system based on critical measurements such as the number of re-handles, crane intensity and ship stability.

关键词： Cranes

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive mechanism for multi-objective evolutionary algorithms

Self-adaptive mechanism for multi-objective evolutionary alg...

引用

作者： Zeng, Fanchao Low, Malcolm Yoke Hean Decraene, James Zhou, Suiping Cai, Wentong Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Nanyang Avenue Singapore 639798 Singapore

ISBN: (纸本)9789881701282

Evolutionary algorithms can efficiently solve multi-objective optimization problems (MOPs) by obtaining diverse and near-optimal solution sets. However, the performance of multi-objective evolutionary algorithms (MOEAs) is often limited by the suitability of their corresponding parameter settings with respect to different optimization problems. The tuning of the parameters is a crucial task which concerns resolving the conflicting goals of convergence and diversity. Moreover, parameter tuning is a time-consuming trial-and-error optimization process which restricts the applicability of MOEAs to provide real-time decision support. To address this issue, we propose a self-adaptive mechanism (SAM) to exploit and optimize the balance between exploration and exploitation during the evolutionary search. This "explore first and exploit later" approach is addressed through the automated and dynamic adjustment of the distribution index of the simulated binary crossover (SBX) operator. Our experimental results suggest that SAM can produce satisfactory results for different problem sets without having to predefine/pre-optimize the MOEA's parameters. SAM can effectively alleviate the tedious process of parameter tuning thus making on-line decision support using MOEA more feasible.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

A Deep Learning Approach to Geographical Candidate Selection through Toponym Matching 20

A Deep Learning Approach to Geographical Candidate Selection...

引用

28th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL GIS 2020

作者： Ardanuy, Mariona Coll Hosseini, Kasra McDonough, Katherine Krause, Amrey Van Strien, Daniel Nanni, Federico Alan Turing Institute London United Kingdom Edinburgh Parallel Computing Centre Edinburgh United Kingdom British Library London United Kingdom

ISBN: (纸本)9781450380195

Recognizing toponyms and resolving them to their real-world referents is required to provide advanced semantic access to textual data. This process is often hindered by the high degree of variation in toponyms. Candidate selection is the task of identifying the potential entities that can be referred to by a previously recognized toponym. While it has traditionally received little attention, candidate selection has a significant impact on downstream tasks (i.e. entity resolution), especially in noisy or non-standard text. In this paper, we introduce a deep learning method for candidate selection through toponym matching, using state-of-the-art neural network architectures. We perform an intrinsic toponym matching evaluation based on several datasets, which cover various challenging scenarios (cross-lingual and regional variations, as well as OCR errors) and assess its performance in the context of geographical candidate selection in English and Spanish. © 2020 Owner/Author.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Unravel the rotational and translational behavior of a single squirmer in flexible polymer solutions at different Reynolds numbers

arXiv

引用

arXiv 2025年

作者： Zhou, Yuan Qi, Kai De Corato, Marco Stratford, Kevin Pagonabarraga, Ignacio 2020 X-Lab Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences Shanghai200050 China College of Materials Science and Opto-Electronic Technology University of Chinese Academy of Sciences Beijing100049 China Batochime Avenue Forel 2 Lausanne1015 Switzerland University of Zaragoza Zaragoza Spain Edinburgh Parallel Computing Centre The University of Edinburgh The King’s Buildings EdinburghEH9 3JZ United Kingdom Departament de Física de la Matèria Condensada Universitat de Barcelona C. Martí Franquès 1 Barcelona08028 Spain Universitat de Barcelona Barcelona08028 Spain

Microorganisms, such as bacteria and algae, thrive in complex environments and their behavior in fluids holds significant importance for various medical and industrial applications. By conducting Lattice Boltzmann (LB) simulations, the transport and rotational properties of a generic squirmer are investigated in solutions embedded with flexible polymer chains at different Reynolds numbers. The interplay of activity and heterogeneously distributed polymers have profound influences on these properties. Remarkable enhancements of up to three orders of magnitude in the rotational motion, along with apparent decays in self-propelling velocities, are observed for squirmers with nonzero active stresses. These extraordinary phenomena stem from the squirmer-polymer mechanical and hydrodynamic interactions. Specifically, polymer wrapping occurs in front of a pusher, while numerous polymers are absorbed in the rear of a puller. Both mechanisms enhance the rotational motion and simultaneously impede translations through forces and torques arising from direct contacts or asymmetric local flows induced by polymers. The source dipole flow fields generated by a neutral swimmer rapidly advect polymers to the rear, leaving no apparent impacts on its rotational and transport properties. The influences of Reynolds number Re (Re=0.8 and 0.04) and squirmer-polymer boundary conditions (no-slip and repulsive) on the dynamics are addressed. In short, the no-slip boundary condition results in more profound effects on both rotational and translational properties at Re = 0.8. However, at Re = 0.04, the disparity between the two boundary conditions diminishes due to the heightened fluid viscous drag, which impedes direct contacts between squirmers and polymers. Our results reveal the relevance of system heterogeneity and highlight the essential role of squirmer-polymer mechanical and hydrodynamic interactions in shaping the behavior of swimmers in viscoelastic fluids. These findings offer valua

关键词： Reynolds number

来源：评论

学校读者我要写书评

暂无评论

Latent Block Regression Model 1

引用

17th Conference of the International Federation of Classification Societies, IFCS 2022

作者： Boutalbi, Rafika Labiod, Lazhar Nadif, Mohamed Institute for Parallel and Distributed Systems Analytic Computing University of Stuttgart Stuttgart Germany Centre Borelli UMR 9010 Université Paris Cité Paris France

ISBN: (数字)9783031090349

ISBN: (纸本)9783031090332

When dealing with high dimensional sparse data, such as in recommender systems,co-clusteringturnsouttobemorebeneficialthanone-sidedclustering,even if one is interested in clustering along one dimension only. Thereby, co-clusterwise is a natural extension of clusterwise. Unfortunately, all of the existing approaches do not consider covariates on both dimensions of a data matrix. In this paper, we propose a Latent Block Regression Model (LBRM) overcoming this limit. For inference, we propose an algorithm performing simultaneously co-clustering and regression where a linear regression model characterizes each block. Placing the estimate of the model parameters under the maximum likelihood approach, we derive a Variational Expectation–Maximization (VEM) algorithm for estimating the model’s parameters. The finality of the proposed VEM-LBRM is illustrated through simulated datasets. © 2023, The Author(s).

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Tentative time warp

引用

3rd International Conference on parallel Processing, Euro-Par 1997

作者： Kalantery, Nasser Centre for Parallel Computing University of Westminster 115 New Cavendish St London W1M 8JS United Kingdom

ISBN: (纸本)9783540634409

The Time-Warp machine, has emerged as the most effective parallel execution environment for discrete event simulation applications where parallelism or sequentiality of programmed interactions cannot be determined at program design stage. In this paper a new and more efficient implementation of the machine, the Tentative Time Warp algorithm, is introduced. In this implementation the number of cancellation messages are reduced;the need for searching the event list prior to propagation of rollbacks is eliminated (in primary rollbacks) or minimised(in secondary rollbacks);a more balanced and efficient event ordering structure, with O(1) event cancellation characteristic, is introduced and tentative cancellation, as opposed to eager or lazy cancellation, is supported. Detailed design of the data structures and empirical measurement of event ordering and cancellation costs, compared to the classic Time-Warp implementation, are presented.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

On the Treatment of Non-Functional Properties of Dynamic Distributed Software Architectures 14

On the Treatment of Non-Functional Properties of Dynamic Dis...

引用

14th International Conference on parallel and Distributed computing Systems, PDCS 2001

作者： Rosa, Nelson S. Cunha, Paulo R.F. Justo, George R.R. Centre of Informatics Federal University of Pernambuco Pernambuco Recife50732-970 Brazil Centre for Parallel Computing University of Westminster LondonWIM 8JS United Kingdom

ISBN: (纸本)9781618395740

One of key methods to increase availability of distributed systems is to allow dynamic changes to place at runtime without to stop the entire system. A critical task carried out during such changes consists of verifying and preserving the functional properties of the system. However, as important as to preserve the integrity of functional aspects, non-functional properties (e.g., security and performance) must also be preserved when modifications occur. We present a formal approach for specifying non-functional properties of dynamic distributed systems. This approach allows formal verification to be performed before a change is committed. 'The paper illustrates our approach with an example of a dynamic client-server application. © (2001) by the International Society for Computers and Their Applications All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Big data and machine learning framework for clouds and its usage for text classification

Big data and machine learning framework for clouds and its u...

引用

作者： Pintye, István Kail, Eszter Kacsuk, Péter Lovas, Róbert Budapest Hungary Centre for Parallel Computing University of Westminster London United Kingdom John von Neumann Faculty of Informatics Óbuda University Budapest Hungary

Reference architectures for big data and machine learning include not only interconnected building blocks but important considerations (among others) for scalability, manageability and usability issues as well. Leveraging on such reference architectures, the automated deployment of distributed toolsets and frameworks on various clouds is still challenging due to the diversity of technologies and protocols. The paper focuses particularly on the widespread Apache Spark cluster with Jupyter as the particularly addressed framework, and the Occopus cloud-agnostic orchestrator tool for automating its deployment and maintenance stages. The presented approach has been demonstrated and validated with a new, promising text classification application on the Hungarian academic research infrastructure, the OpenStack-based MTA Cloud. The paper explains the concept, the applied components, and illustrates their usage with real use-case measurements. © 2020 John Wiley & Sons, Ltd.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Improving performance with serialisation 2

Improving performance with serialisation

引用

2nd Euromicro Workshop on parallel and Distributed Processing, PDP 1994

作者： Ribeiro Justo, G.R. Welch, Peter H. Centre for Parallel Computing University of Westminster LondonW1M 8JS United Kingdom Computing Laboratory University of Kent Kent CanterburyCT2 7NF United Kingdom

ISBN: (纸本)0818653701

In our excitement over the amount of the MIPS and MFLOPS that are now at our disposal, we must not forget the powerful benefits of good software engineering. parallelism simplifies and clarifies the development of complex systems (even if it does not make them go faster!), and clearly therefore should be exploited. However, to configure our design to a particular architecture, we have sometimes to sacrifice some degree of parallelism by merging (serialising) simple (fine-grained) processes into more complex (coarsegrained) processes which are more efficient. In this paper, we present results that show how serialisation can be used as (low-level) optimisation by improving performance and saving space (code and workspace). © 1994 IEEE.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：