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

VOX model: application of voxel-based packing algorithm on cementitious composites with 3D irregular-shape particles

引用

MATERIALS AND STRUCTURES 2020年第4期53卷 75-75页

作者： Tian, Zushi Tian, Ye Ye, Hailong Jin, Xianyu Jin, Nanguo Zhejiang Univ Coll Civil Engn & Architecture Hangzhou Peoples R China Univ Hong Kong Dept Civil Engn Pokfulam Hong Kong Peoples R China

The internal structure of composite materials is usually composed of a continuous matrix with dispersed particles. To simulate the spatial distribution of particles, the random sequential addition algorithm (RSA) is commonly used. The RSA using continuous geometric function is difficult to achieve a high packing density in allowable computer time and time-consuming in the case of irregularly shaped aggregates, such as in mortar and concrete systems. In this work, a geometrical model, named as VOX, is introduced to deal with 3D irregularly shaped particles. The model applies the voxel-based overlap determination in the RSA to improve the efficiency and packing density. Also, the model is applicable to the complex boundary conditions of any geometry and provides high-quality triangle meshes valuable for finite element analysis. The mortar and concrete cubes with real-shape particles are simulated, in which the packing density is increased to 65% and 51%, respectively. The VOX model successfully packs over 150,000 real-shape aggregates into the steel cage in a full-size reinforced concrete beam model on a desktop machine. Particle shape significantly affects the packing density in the RSA and the sphericity is recommended as an indicator. The particles with higher sphericity can achieve denser packing under the same effort of attempts. Real-shape gravel used in this study behaves similarly with regular octahedron because of the similar sphericity.

关键词： packing algorithm Irregular particle Voxel Aggregate

来源：评论

学校读者我要写书评

暂无评论

An investigation of sphere packed shell-side columns using a digital packing algorithm

引用

COMPUTERS & CHEMICAL ENGINEERING 2007年第12期31卷 1715-1724页

作者： Caulkin, R. Ahmad, A. Fairweather, M. Jia, X. Williams, R. A. Univ Leeds Sch Proc Environm & Mat Engn Inst Particle Sci & Engn Leeds LS2 9JT W Yorkshire England

This paper on the fundamental structural properties of shell-side packed columns presents an investigative study using a novel packing algorithm with the aim of validation against experimental results. The novel contribution in the predictive approach employed is the digitalisation of particles, container and packing space to generate complex life-like stochastic packing structures of particulate systems at relatively high speed (when compared to traditional vector-based approaches) which are comparable with experimentally packed beds without need for further conversion. of numerical data. A variety of packed column simulations, comprising more complex beds than often seen in the literature, namely shell-side beds with increasing complexity of internal structure and packed with spherical particles, have been undertaken and the resulting averaged numerical data compared like-for-like with experimental results with key trends reproduced. The overall aim of this work is to demonstrate the usefulness of the technique and associated computer code as an engineering aide for research, design and optimisation of the performance of packed bed systems of any geometric complexity in terms of packing structure, as well as to highlight possible areas for further development of the code. (c) 2007 Elsevier Ltd. All rights reserved.

关键词： digitalisation shell-side beds packing algorithm packed columns

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ON THE packing algorithm FOR ANTI-SEU OF FPGA BASED ON TRIPLE MODULAR REDUNDANCY AND THE NUMBERS OF FAN-OUTS OF THE NET

引用

Journal of Electronics(China) 2014年第4期31卷 284-289页

作者： Cui Xiuhai Yang Haigang Peng Yu Peng Xiyuan Automatic Test and Control Institute Harbin Institute of Technology Institute of Electronics Chinese Academy of Sciences

Static Random Access Memory(SRAM) based Field Programmable Gate Array(FPGA) is widely applied in the field of aerospace, whose anti-SEU(Single Event Upset) capability becomes more and more important. To improve anti-FPGA SEU capability, the registers of the circuit netlist are tripled and divided into three categories in this study. By the packing algorithm, the registers of triple modular redundancy are loaded into different configurable logic block. At the same time, the packing algorithm considers the effect of large fan-out nets. The experimental results show that the algorithm successfully realize the packing of the register of Triple Modular Redundancy(TMR). Comparing with Timing Versatile packing(TVPACK), the algorithm in this study is able to obtain a 11% reduction of the number of the nets in critical path, and a 12% reduction of the time delay in critical path on average when TMR is not considered. Especially, some critical path delay of circuit can be improved about 33%.

关键词： Field Programmable Gate Array (FPGA) Triple Modular Redundancy (TMR) packing algorithm Fan-outs of the net Critical path delayCLC number:TN473

来源：评论

学校读者我要写书评

暂无评论

An Efficient FPGA packing algorithm Based on Simple Dual-Output Basic Logic Elements

An Efficient FPGA Packing Algorithm Based on Simple Dual-Out...

引用

IEEE 8th International Conference on ASIC

作者： Liu, Ying Jiang, Xianyang Sun, Shilei Wang, Gaofeng Wuhan Univ Sch Phys Sci & Technol Wuhan Hubei Peoples R China Chinese Acad Sci Comp Technol Inst Beijing Peoples R China Wuhan Univ Inst Microelect & Informat Technol Wuhan Hubei Peoples R China

ISBN: (纸本)9781424438686

Logic packing is an important procedure in an FPGA CAD flow. To get a more efficient mapping performance, a simple dual-output BLE based packing algorithm called WHUpakcer is presented. WHUpacker takes advantages of the dual-output BLE different from the popular one used in previous studies. This new BLE has a simpler and more refined architecture by contrast to the popular one and thus introduces a more efficient cluster mapping. Upon the experimental results on two sets of benchmarks, WHUpacker demonstrates better performance up to 12% than both P-T-Vpack and T-Vpack(1).

关键词： packing algorithm FPGA CAD flow cluster technology mapping

来源：评论

学校读者我要写书评

暂无评论

A general packing algorithm based on single-sequence

A general packing algorithm based on single-sequence

引用

International Conference on Communications, Circuits and Systems

作者： Zhu, XK Zhuang, CW Kajitani, Y JEDAT Innovat Inc Wakamatsu Ku Kitakyushu Fukuoka 8080135 Japan

ISBN: (纸本)0780386477

The Single-Sequence (SS) is simply a sequence of integers 1, 2, 3, ..., n. But it leads a unique set of ABLR-relations (above, below, left-of, right-of) that hold among n objects on a plane. Direct Relation Set (DRS) is to represent the direct ABLR-relations among rooms. It can be reused for any packing under the same floorplan. In this paper we analyze the relation between DRS and SS, and propose a general packing algorithm based on SS. It can update each room's coordinates on the fly. As. a feature of SS, this algorithm covers all possible placements, if our objective is in bounding-box area minimization. Experimental results showed that the proposed algorithm is pretty fast and efficient compared with the performances attained by conventional algorithms.

关键词： packing algorithm placement EDA

来源：评论

学校读者我要写书评

暂无评论

A Novel Delay-Aware packing algorithm for FPGA Architecture Using RFET 67

A Novel Delay-Aware Packing Algorithm for FPGA Architecture ...

引用

67th IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)

作者： Lu, Sheng Shang, Liuting Jung, Sungyong Zhang, Yichen Pan, Chenyun Univ Texas Arlington Dept Elect Engn Arlington TX 76019 USA

ISBN: (纸本)9798350387186;9798350387179

Reconfigurable devices are gaining increasing attention as a viable alternative and supplementary solution to traditional CMOS technology. In this paper, we develop a more efficient 2-input look-up table (LUT) based on the reconfigurable field-effect transistors (RFETs), leading to a smaller transistor usage and a smaller critical path delay. The cells are organized into regular matrices, known as MClusters, with a fixed interconnection pattern to replace LUTs in field-programmable gate arrays (FPGAs). To improve the efficiency of utilizing this structure, we design a SAT-based delay-aware packing algorithm to better utilize logical gates for the MCluster structure. Finally, we combine this algorithm with FPGA simulation tools to form a comprehensive benchmarking flow. A series of benchmark tests show that under the optimal design, up to 35% and 30% reduction can be achieved in delay and energy-delay product (EDP), respectively, compared to the traditional CMOS FPGAs.

关键词： Reconfigurable FET field-programmable gate arrays look-up table partitioning algorithm packing algorithm technology mapping performance benchmarking

来源：评论

学校读者我要写书评

暂无评论

An Enhanced packing algorithm for FPGA Architectures without Local Crossbar 15

An Enhanced Packing Algorithm for FPGA Architectures without...

引用

15th IEEE International Conference on ASIC, ASICON 2023

作者： Wang, Yuanqi Shi, Kaichuang Wang, Lingli Fudan University State Key Laboratory of ASIC and System Shanghai China

ISBN: (纸本)9798350312980

In the EDA process of FPGA, VTR (Verilog-to-Routing) is a commonly used open-source CAD tool in the academic community, and VPR (Versatile Place and Route) is the back-end process of VTR. The packing algorithm in VPR is a seed-based architecture-aware algorithm, which has strong versatility. However, the packing density is low for CLB architectures without local crossbar interconnect in the commercial FPGAs, which results in long critical path delays in circuits. To solve this problem, this paper optimizes the packing algorithm in VPR by adding a virtual crossbar in CLB, aiming to improve the internal utilization of each CLB and decrease the critical path delay of the circuit. The experimental result shows that it can reduce the average number of packed CLBs by 56.51% and the average critical path delay by 9.14% after the packing algorithm enhancement. © 2023 IEEE.

关键词： CLB Crossbar FPGA packing algorithm

来源：评论

学校读者我要写书评

暂无评论

packing algorithm for Pre-cut Timbers using Metaheuristics

引用

Procedia CIRP 2022年 112卷 6-10页

作者： Takashi Tanizaki Ryohei Yamashita Graduate School of Kindai University 1 Takaya-Umenobe Higashi-Hiroshima 739-2116 Japan

In recent years, many wooden houses in Japan are built using pre-cut timbers. Pre-cut timber is material for residential buildings, such as roofs, floors, and pillars, whose joints have been pre-processed. As the number of carpenters has decreased, the demand for pre-cut timber has increased. However, since the number of pre-cut timber production factories decrease, improving the productivity of those factories is an urgent issue. From this background, we are developing an algorithm for packing formation support systems to improve packing work productivity. In this paper, we propose the algorithm for packing formation of pre-cut timbers using the iterative local search with Or-opt, and discuss numerical experiments results.

关键词： pre-cut timber packing algorithm metaheuristics

来源：评论

学校读者我要写书评

暂无评论

A novel mesh algorithm to improve the packing efficiency of irregular-shaped particles in simulating cement paste's microstructure

引用

POWDER TECHNOLOGY 2025年 449卷

作者： Gao, Peng Liu, Hongjie Li, Jingzhe Yu, Yang Xie, Faquan Lu, Haijun Hu, Yanbo Yang, Yonggan Zhan, Binggen Yu, Qijun Hefei Univ Technol Coll Civil Engn Tunxi Rd 193 Hefei 230009 Anhui Prov Peoples R China Hefei Univ Technol Anhui Key Lab Civil Engn Struct & Mat Hefei 230009 Anhui Prov Peoples R China Hefei Univ Technol Engn Res Ctr Low carbon Technol & Equipment Cement Minist Educ Hefei 230009 Anhui Prov Peoples R China Anhui Key Lab Green & Low Carbon Technol Cement Mf Hefei 230009 Peoples R China Hefei Univ Technol Sch Automot & Transportat Engn Hefei 230009 Anhui Prov Peoples R China Hefei Univ Technol Anhui Res Ctr Low Carbon Technol Cement Based Mat Hefei 230009 Anhui Prov Peoples R China Anhui Conch Cement Co Ltd Wuhu 241000 Anhui Prov Peoples R China

Irregular-shaped particle packing is important to simulate the cement paste microstructure. However, the efficiency of current packing models is relatively low. This study proposes a novel packing algorithm named the Mesh Optimization packing (MOP) model inspired by the VOX and extent overlap box (EOB) methods. The MOP model's performance in terms of accuracy, uniformity, and randomness were evaluated. Meanwhile, compared to the Anm model 2.0 and the VOX model, the MOP model excels in simulating the initial microstructure of cement paste with high cement volume fractions. When the cement volume fraction is 56.03 %, the VOX model requires 124.68 h, while the MOP model only takes 18.80 h. By adding uniform-thickness shells to irregular-shaped particles, the MOP model integrates with the HYMOSTRUC3D-E model to simulate the evolution and uniaxial stretching process of the cement paste microstructure. This innovative modelling approach offers a promising solution for future simulations of cement paste microstructure.

关键词： packing algorithm Cement paste microstructure Irregular-shaped particle HYMOSTRUC3D-E

来源：评论

学校读者我要写书评

暂无评论

The development of a simulation model of the dense packing of large particulate assemblies

引用

POWDER TECHNOLOGY 2004年第1-2期141卷 155-160页

作者： Sobolev, K Amirjanov, A Univ Autonoma Nuevo Leon Inst Ingn Civil Monterrey Mexico European Univ Lefke Dept Comp Engn Lefke Cyprus

The dense packing of particulate assemblies is an enduring theoretical and practical problem. In spite of its apparent simplicity, this problem still remains challenging. Recent progress in the performance of computers boosted the development and realization of a number of effective packing algorithms. Yet, because of the complexity of the problem, many of existing methods have difficulties in handling large numbers of particles. A simulation model is proposed to overcome this. The model assumes that the centers of the spheres are randomly generated at the intersections of a cubic lattice. The largest possible spheres are packed first;subsequent spheres are limited by the set of minimum diameters, which is specified by the constraints imposed by two major parameters imitating the compaction gradient: a reduction coefficient and the number of packing trials. Importantly, the packing arrangements are not defined by the initially specified particle size distribution (as considered by many existing packing algorithms), but rather the most dense particle size distribution, along with the corresponding value of packing degree, is generated by the proposed model. Based on these criteria, a very fast algorithm was developed for simulating of the dense packing of large assemblies of particulate, spherical material (in the order of millions of particles). Using this approach, the influence of geometrical parameters and model variables on the degree of packing and the corresponding distribution of particles was studied. (C) 2004 Elsevier B.V. All rights reserved.

关键词： simulation model packing algorithm packing degree particle size distribution particulate material initially pre-packed state

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：