Optimization Design of the Multi-Layer Cross-Sectional Layout of An Umbilical Based on the GA-GLM

Marine umbilical is one of the key equipment for subsea oil and gas exploitation,which is usually integrated by a great number of different functional components with multi-layers.The layout of these components directly affects manufacturing,operation and storage performances of the umbilical.For the multi-layer cross-sectional layout design of the umbilical,a quantifiable multi-objective optimization model is established according to the operation and storage requirements.Considering the manufacturing factors,the multi-layering strategy based on contact point identification is introduced for a great number of functional components.Then,the GA-GLM global optimization algorithm is proposed combining the genetic algorithm and the generalized multiplier method,and the selection operator of the genetic algorithm is improved based on the steepest descent method.Genetic algorithm is used to find the optimal solution in the global space,which can converge from any initial layout to the feasible layout solution.The feasible layout solution is taken as the initial value of the generalized multiplier method for fast and accurate solution.Finally,taking umbilicals with a great number of components as examples,the results show that the cross-sectional performance of the umbilical obtained by optimization algorithm is better and the solution efficiency is higher.Meanwhile,the multi-layering strategy is effective and feasible.The design method proposed in this paper can quickly obtain the optimal multi-layer cross-sectional layout,which replaces the manual design,and provides useful reference and guidance for the umbilical industry.

Development of Fixture Layout Optimization for Thin-Walled Parts:A Review

An increasing number of researchers have researched fixture layout optimization for thin-walled part assembly during the past decades.However,few papers systematically review these researches.By analyzing existing literature,this paper summarizes the process of fixture layout optimization and the methods applied.The process of optimization is made up of optimization objective setting,assembly variation/deformation modeling,and fixture layout optimization.This paper makes a review of the fixture layout for thin-walled parts according to these three steps.First,two different kinds of optimization objectives are introduced.Researchers usually consider in-plane variations or out-of-plane deformations when designing objectives.Then,modeling methods for assembly variation and deformation are divided into two categories:Mechanism-based and data-based methods.Several common methods are discussed respectively.After that,optimization algorithms are reviewed systematically.There are two kinds of optimization algorithms:Traditional nonlinear programming and heuristic algorithms.Finally,discussions on the current situation are provided.The research direction of fixture layout optimization in the future is discussed from three aspects:Objective setting,improving modeling accuracy and optimization algorithms.Also,a new research point for fixture layout optimization is discussed.This paper systematically reviews the research on fixture layout optimization for thin-walled parts,and provides a reference for future research in this field.

Web Layout Design of Large Cavity Structures Based on Topology Optimization

Large cavity structures are widely employed in aerospace engineering, such as thin-walled cylinders, blades andwings. Enhancing performance of aerial vehicles while reducing manufacturing costs and fuel consumptionhas become a focal point for contemporary researchers. Therefore, this paper aims to investigate the topologyoptimization of large cavity structures as a means to enhance their performance, safety, and efficiency. By usingthe variable density method, lightweight design is achieved without compromising structural strength. Theoptimization model considers both concentrated and distributed loads, and utilizes techniques like sensitivityfiltering and projection to obtain a robust optimized configuration. The mechanical properties are checked bycomparing the stress distribution and displacement of the unoptimized and optimized structures under the sameload. The results confirm that the optimized structures exhibit improved mechanical properties, thus offering keyinsights for engineering lightweight, high-strength large cavity structures.

Simulation Method and Feature Analysis of Shutdown Pressure Evolution During Multi-Cluster Fracturing Stimulation

Multistage multi-cluster hydraulic fracturing has enabled the economic exploitation of shale reservoirs,but the interpretation of hydraulic fracture parameters is challenging.The pressure signals after pump shutdown are influenced by hydraulic fractures,which can reflect the geometric features of hydraulic fracture.The shutdown pressure can be used to interpret the hydraulic fracture parameters in a real-time and cost-effective manner.In this paper,a mathematical model for shutdown pressure evolution is developed considering the effects of wellbore friction,perforation friction and fluid loss in fractures.An efficient numerical simulation method is established by using the method of characteristics.Based on this method,the impacts of fracture half-length,fracture height,opened cluster and perforation number,and filtration coefficient on the evolution of shutdown pressure are analyzed.The results indicate that a larger fracture half-length may hasten the decay of shutdown pressure,while a larger fracture height can slow down the decay of shutdown pressure.A smaller number of opened clusters and perforations can significantly increase the perforation friction and decrease the overall level of shutdown pressure.A larger filtration coefficient may accelerate the fluid filtration in the fracture and hasten the drop of the shutdown pressure.The simulation method of shutdown pressure,as well as the analysis results,has important implications for the interpretation of hydraulic fracture parameters.

GNN Representation Learning and Multi-Objective Variable Neighborhood Search Algorithm for Wind Farm Layout Optimization

With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the route network design problem,the expressive capability and search performance of the algorithm on multi-objective problems remain unexplored.In this paper,the wind farm layout optimization problem is defined.Then,a multi-objective algorithm based on Graph Neural Network(GNN)and Variable Neighborhood Search(VNS)algorithm is proposed.GNN provides the basis representations for the following search algorithm so that the expressiveness and search accuracy of the algorithm can be improved.The multi-objective VNS algorithm is put forward by combining it with the multi-objective optimization algorithm to solve the problem with multiple objectives.The proposed algorithm is applied to the 18-node simulation example to evaluate the feasibility and practicality of the developed optimization strategy.The experiment on the simulation example shows that the proposed algorithm yields a reduction of 6.1% in Point of Common Coupling(PCC)over the current state-of-the-art algorithm,which means that the proposed algorithm designs a layout that improves the quality of the power supply by 6.1%at the same cost.The ablation experiments show that the proposed algorithm improves the power quality by more than 8.6% and 7.8% compared to both the original VNS algorithm and the multi-objective VNS algorithm.

Optimizing Memory Access Efficiency in CUDA Kernel via Data Layout Technique

Over the past decade, Graphics Processing Units (GPUs) have revolutionized high-performance computing, playing pivotal roles in advancing fields like IoT, autonomous vehicles, and exascale computing. Despite these advancements, efficiently programming GPUs remains a daunting challenge, often relying on trial-and-error optimization methods. This paper introduces an optimization technique for CUDA programs through a novel Data Layout strategy, aimed at restructuring memory data arrangement to significantly enhance data access locality. Focusing on the dynamic programming algorithm for chained matrix multiplication—a critical operation across various domains including artificial intelligence (AI), high-performance computing (HPC), and the Internet of Things (IoT)—this technique facilitates more localized access. We specifically illustrate the importance of efficient matrix multiplication in these areas, underscoring the technique’s broader applicability and its potential to address some of the most pressing computational challenges in GPU-accelerated applications. Our findings reveal a remarkable reduction in memory consumption and a substantial 50% decrease in execution time for CUDA programs utilizing this technique, thereby setting a new benchmark for optimization in GPU computing.

Scheduling a Single-Arm Multi-Cluster Tool With a Condition-Based Cleaning Operation

As wafer circuit widths shrink less than 10 nm,stringent quality control is imposed on the wafer fabrication processes. Therefore, wafer residency time constraints and chamber cleaning operations are widely required in chemical vapor deposition, coating processes, etc. They increase scheduling complexity in cluster tools. In this paper, we focus on scheduling single-arm multi-cluster tools with chamber cleaning operations subject to wafer residency time constraints. When a chamber is being cleaned, it can be viewed as processing a virtual wafer. In this way, chamber cleaning operations can be performed while wafer residency time constraints for real wafers are not violated. Based on such a method, we present the necessary and sufficient conditions to analytically check whether a single-arm multi-cluster tool can be scheduled with a chamber cleaning operation and wafer residency time constraints. An algorithm is proposed to adjust the cycle time for a cleaning operation that lasts a long cleaning time.Meanwhile, algorithms for a feasible schedule are also derived.And an algorithm is presented for operating a multi-cluster tool back to a steady state after the cleaning. Illustrative examples are given to show the application and effectiveness of the proposed method.

Semantic Document Layout Analysis of Handwritten Manuscripts

A document layout can be more informative than merely a document’s visual and structural appearance.Thus,document layout analysis(DLA)is considered a necessary prerequisite for advanced processing and detailed document image analysis to be further used in several applications and different objectives.This research extends the traditional approaches of DLA and introduces the concept of semantic document layout analysis(SDLA)by proposing a novel framework for semantic layout analysis and characterization of handwritten manuscripts.The proposed SDLA approach enables the derivation of implicit information and semantic characteristics,which can be effectively utilized in dozens of practical applications for various purposes,in a way bridging the semantic gap and providingmore understandable high-level document image analysis and more invariant characterization via absolute and relative labeling.This approach is validated and evaluated on a large dataset ofArabic handwrittenmanuscripts comprising complex layouts.The experimental work shows promising results in terms of accurate and effective semantic characteristic-based clustering and retrieval of handwritten manuscripts.It also indicates the expected efficacy of using the capabilities of the proposed approach in automating and facilitating many functional,reallife tasks such as effort estimation and pricing of transcription or typing of such complex manuscripts.

A Spacecra Equipment Layout Optimization Method for Diverse and Competitive Design

The spacecraequipment layout optimization design(SELOD)problems with complicated performance con-straints and diversity are studied in this paper.The previous literature uses the gradient-based algorithm to obtain optimized non-overlap layout schemes from randomly initialized cases eectively.However,these local optimal solutions are too dicult to jump out of their current relative geometry relationships,signi􀀀cantly limiting their further improvement in performance indicators.Therefore,considering the geometric diversity of layout schemes is put forward to alleviate this limitation.First,similarity measures,including modi􀀀ed cosine similarity and gaussian kernel function similarity,are introduced into the layout optimization process.Then the optimization produces a set of feasible layout candidates with the most remarkable dierence in geometric distribution and the most representative schemes are sampled.Finally,these feasible geometric solutions are used as initial solutions to optimize the physical performance indicators of the spacecra,and diversi􀀀ed layout schemes of spacecraequipment are generated for the engineering practice.The validity and eectiveness of the proposed methodology are demonstrated by two SELOD applications.

Application of a Parallel Adaptive Cuckoo Search Algorithm in the Rectangle Layout Problem

The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter strategy and a parallel communication strategy are proposed to further improve the Cuckoo Search(CS)algorithm.This strategy greatly improves the convergence speed and accuracy of the algorithm and strengthens the algorithm’s ability to jump out of the local optimal.This paper compares the optimization performance of Parallel Adaptive Cuckoo Search(PACS)with CS,Parallel Cuckoo Search(PCS),Particle Swarm Optimization(PSO),Sine Cosine Algorithm(SCA),Grey Wolf Optimizer(GWO),Whale Optimization Algorithm(WOA),Differential Evolution(DE)and Artificial Bee Colony(ABC)algorithms by using the CEC-2013 test function.The results show that PACS algorithmoutperforms other algorithms in 20 of 28 test functions.Due to the superior performance of PACS algorithm,this paper uses it to solve the problem of the rectangular layout.Experimental results show that this scheme has a significant effect,and the material utilization rate is improved from89.5%to 97.8%after optimization.

Advanced surface coil layout with intrinsic noise cancellation properties for surface-NMR applications

A recent study demonstrated that in small-scale prepolarized surface nuclear magnetic resonance(SNMR-PP)measurements with a footprint of a few square meters,customized PP switch-off ramps can serve as an efficient excitation mechanism,eliminating the requirement for a conventional oscillating excitation pulse.This approach enables the detection of short relaxation signals from the unsaturated soil zone and can,therefore,be used to directly provide soil moisture and pore geometry information.Because ultimately such small-scale SNMR-PP setups are intended for a mobile application,it is necessary to develop strategies that allow for speedy measurement progress and do not require noise cancellation protocols based on reference stations.Hence,we developed a new concentric figure-of-eight(cFOE)loop layout that combines the direction independence of a circular loop with the intrinsic noise cancellation properties of a classical FOE-loop.This approach significantly decreases the measurement time because suitable signal-to-noise ratios are reached much faster compared to a classical circular loop and will bring us one step further toward fast and non-invasive soil moisture mapping applications.

A Chaotic Local Search-Based Particle Swarm Optimizer for Large-Scale Complex Wind Farm Layout Optimization

Wind energy has been widely applied in power generation to alleviate climate problems.The wind turbine layout of a wind farm is a primary factor of impacting power conversion efficiency due to the wake effect that reduces the power outputs of wind turbines located in downstream.Wind farm layout optimization(WFLO)aims to reduce the wake effect for maximizing the power outputs of the wind farm.Nevertheless,the wake effect among wind turbines increases significantly as the number of wind turbines increases in the wind farm,which severely affect power conversion efficiency.Conventional heuristic algorithms suffer from issues of low solution quality and local optimum for large-scale WFLO under complex wind scenarios.Thus,a chaotic local search-based genetic learning particle swarm optimizer(CGPSO)is proposed to optimize large-scale WFLO problems.CGPSO is tested on four larger-scale wind farms under four complex wind scenarios and compares with eight state-of-the-art algorithms.The experiment results indicate that CGPSO significantly outperforms its competitors in terms of performance,stability,and robustness.To be specific,a success and failure memories-based selection is proposed to choose a chaotic map for chaotic search local.It improves the solution quality.The parameter and search pattern of chaotic local search are also analyzed for WFLO problems.

The Evolution of Landscape Layout Concept of Lingnan Taoist Zuting Temples in the Qing Dynasty

The replacement of Lingnan Taoist Zuting Temples from Lingbao Sect to Quanzhen Sect in the Qing Dynasty has led to the change of the layout of Taoist temples on Luofu Mountain. Through literature review, field research, image comparison and other research methods, the paper explores how the layout of the Taoist temples on Luofu Mountain evolved from the Four Taoist Temples in the Gehong period to the Five Taoist Temples in the Qing Dynasty under the influence of different Taoist ideologies, aiming to explore the cultural implications of the evolution of the layout of Lingnan Taoism Zuting Temple in the Qing Dynasty.

HSCA-Net: A Hybrid Spatial-Channel Attention Network in Multiscale Feature Pyramid for Document Layout Analysis

Document images often contain various page components and complex logical structures,which make document layout analysis task challenging.For most deep learning-based document layout analysis methods,convolutional neural networks(CNNs)are adopted as the feature extraction networks.In this paper,a hybrid spatial-channel attention network(HSCA-Net)is proposed to improve feature extraction capability by introducing attention mechanism to explore more salient properties within document pages.The HSCA-Net consists of spatial attention module(SAM),channel attention module(CAM),and designed lateral attention connection.CAM adaptively adjusts channel feature responses by emphasizing selective information,which depends on the contribution of the features of each channel.SAM guides CNNs to focus on the informative contents and capture global context information among page objects.The lateral attention connection incorporates SAM and CAM into multiscale feature pyramid network,and thus retains original feature information.The effectiveness and adaptability of HSCA-Net are evaluated through multiple experiments on publicly available datasets such as PubLayNet,ICDAR-POD,and Article Regions.Experimental results demonstrate that HSCA-Net achieves state-of-the-art performance on document layout analysis task.

“十三五”国家重点研发计划“林业资源培育及高效利用技术创新”重点专项布局与实施成效分析

“十三五”国家科技计划改革构建了全新的国家重点研发计划,设置“林业资源培育及高效利用技术创新”重点专项对林业科技创新进行支持。在揭示林业资源培育及高效利用调控机制、提升主要人工林单位生产力和提高资源利用效率等方面进行布局,按照基础研究、关键技术研究和技术集成示范进行“产业链布局创新链、一体化组织实施”。截止到2022年,专项已经执行结束并顺利完成项目综合绩效评价。以“十三五”国家重点研发计划“林业资源培育及高效利用技术创新”重点专项为主题,总结并分析专项实施背景、立项情况并介绍专项实施成效,为今后林业科技资源配置和组织管理提供参考。

城市洪涝应急响应能力评价及优化研究

在气候变化和全球化的背景下,极端降水事件及其导致的洪涝灾害频发。为准确评估暴雨内涝影响下的城市应急服务水平,基于InfoWorks ICM构建了城区内涝模型,利用ArcGIS中的最快路径法评估了医疗、公安、消防的空间可达性,利用基尼系数评估了公共应急服务相对幼儿园分布的合理性,采用最大覆盖算法对医疗、公安、消防的分布进行了优化,并基于研究区的情况进行了分析。结果显示:研究区的医疗、公安、消防相对幼儿园的基尼系数随着降雨重现期的增加而增大;对研究区的医疗、公安、消防分布优化前,这些部门的分布不尽合理,其15 min内的应急服务可达性不能满足应急救援要求,研究区应急响应资源相对幼儿园缺失严重,相对来说,医疗应急响应缺失最为严重;对研究区的医疗、公安、消防分布优化后,这些部门相对于幼儿园的基尼系数普遍在0.400以下,医疗和公安的应急服务即使在百年一遇洪涝加晚高峰情景下仍可以在15 min内覆盖40%的研究区面积,消防可覆盖70%的研究区面积,医疗、公安、消防的分布相对合理。本研究为中国城市洪涝灾害应急响应能力评价提供参考。

面向三重版图曝光约束的详细布线算法

在进一步缩小特征尺寸的问题上,三重版图曝光技术(triplepatterninglithography,TPL)发挥着重要的作用.针对TPL中的版图分解问题,提出了一种基于TPL约束的详细布线算法.将版图分解问题转化为满足同色间距约束和最小间距约束的详细布线问题,使用网格编码的方法来满足2种间距约束;利用与2种间距约束相结合的Hannan网格来提升布线资源的利用率以及布线的速度;结合多源迪杰斯特拉算法进行多端线网的最短路径搜索;最后将布线结果进行版图分解,实现最小化冲突数量和缝合点数量的目标.算法在2.20 GHzCPU和32 GB内存的Ubuntu20.04环境下运行,使用2018年ISPD详细布线比赛的测试集.实验结果表明,与普通详细布线相比,可降低约60%的冲突数量以及70%的缝合点数量.

面向线束预装配的多约束线束布局方法研究

线束由一组线束段按树状结构连接而成,是飞机汽车等产品中连接各电气设备的接线部件。为提高安装效率,复杂线束需要在线束工装板图上进行预安装,即根据角度、距离、交叉、边界等工艺约束在工装板上摆放线束,是一个多约束下的线束布局问题。通过借鉴图布局算法,将线束布局转换为优化问题,并采用随机梯度下降法SGD每次随机挑选一对线束段进行优化,逐步迭代收敛。因为线束段是长度不变的刚体,所以移动一根线束段时会带动相连的其他线束段,进而导致SGD迭代过程出现震荡,难以收敛。通过提出双向传递的线束段移动算法,在保证线束段能移动到目标位置的同时尽量少相连线束段的变动。使用合成线束案例和某真实飞机线束案例进行有效性验证,结果表明各工艺约束能均能得到满足,符合线束预装配的生产要求。

综合公园空间布局优化的模型构建及实证分析

综合公园作为重要且稀缺的城市公共资源,其合理布局对城市存量更新背景下优化公园体系、增进民生福祉具有重要意义。布局优化模型常用于解决公共服务设施布局问题,新重力P中值模型是一种综合多目标导向、设施供需匹配关系和复杂约束条件的布局优化方法。在辨析新重力P中值模型的基础上,综合考虑供给主体差异和模型求解难度,构建出面向城市综合公园布局优化的改进新重力P中值模型,主要修正内容如下:(1)通过细化供给主体,改良规模分配规则,改进新重力P中值模型未考虑现有公园和新建公园服务供给差异性的局限;(2)引入遗传算法寻优,解决非线性、多约束的复杂设施布局问题,实现模型求解以促进模型在公园实际规划中的推广应用。以苏州市中心城区为例,以多源数据为支撑,将研究尺度下沉至居住区尺度,实证结果表明模型优化后居民至邻近综合公园最大出行成本、平均出行成本和可达性基尼系数等指标均有改善,综合公园空间布局更为合理。研究结果可为综合公园布局规划提供有效决策工具,为公园绿地的精准化布局提供参考。

我国畜牧业空间集聚特征及演化趋势分析

畜牧业区域优化合理布局是农业供给侧改革以及高质量发展的必然要求,该文利用全国各省畜产品产量面板数据,采用空间自相关方法分析畜牧业地理集聚特征,并对其形成原因进行剖析。研究发现:中国畜牧业呈现明显的集聚特征,各省份畜牧业发展受邻近省份发展的影响较为显著;产业空间集聚呈现非均衡特征,东、中部以“高-高”集聚为主,西部以“低-低”集聚特征为主;畜牧业布局相对稳定,未来一段时间内将继续保持现状。基于此,该文提出推动适度规模经营,发展专业化、市场化、一体化产业链,完善畜牧业配套体系等政策建议。