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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Encrypted and Compressed Key-Value Store With Pattern-Analysis Security in Cloud Systems

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2024年 19卷 221-234页

作者： Zhang, Chen Ming, Yulong Wang, Mingyue Guo, Yu Jia, Xiaohua Hang Seng Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Beijing Normal Univ Sch Artificial Intelligence Beijing 100875 Peoples R China

With the increasing concern about data privacy and data explosion, some encrypted and compressed key-value (KV) stores have been proposed. A remarkable way to combine encryption and compression is to pack KV pairs into packs, and then compress and encrypt each pack separately. Recent research has shown that even if the data is encrypted, adversaries can still use the leaked information about data length and access frequency to launch pattern-analysis attacks. For this problem, some schemes have been proposed to protect the length and frequency distribution of packs. However, existing solutions protect such information at the cost of high storage and bandwidth overhead. In this paper, we propose an encrypted and compressed KV store with pattern-analysis security, which can resist pattern-analysis attacks with minimal overhead. We first devise a secure KV pair packing scheme, which guarantees pack length security with bounded storage overhead. Then we propose a K-indistinguishable pack frequency smoothing scheme. It can protect the distribution of pack frequency with minimal bandwidth overhead. We formally analyze the security of our design and implement our proposed secure KV storage system on Redis and RocksDB. Performance evaluation results demonstrate that our design minimizes the overhead of achieving pattern analysis security.

关键词： Encryption Compression compression key-value store packing algorithm pattern-analysis security

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Vehicles for the Service Economy: Early-stage Vehicle Concept Designs for Vehicle-based Service

引用

Procedia CIRP 2023年 119卷 746-751页

作者： Clemens Pizzinini Leonhard Langer Irénée Froissart Ahmed Elsayed Markus Lienkamp

Future vehicles are connected, autonomous and shared platforms that render a multitude of services in our everyday lives. The vehicle's driving function will ultimately converge to a commodity sourced by superstructure manufactures that develop service-oriented functionality. For the early stage vehicle concept design, this new functionality imposes a new complexity for superstructure engineers. Novel service offerings translate into new functional requirements and technical components that need to be optimally sized and positioned inside the vehicle package to increase the amount of service units that can be supplied to the customer. Today, vehicle concept design optimization only focuses on powertrain components. In this paper, we introduce a novel two-step package design optimization for vehicle superstructures. First, functional requirements are derived from service units, the smallest unit of value to the vehicle-based service customer. We then develop component weight and size regression models from data retrieved from online warehouses. Components and their installation constrains are represented by scalable containers. A combined packing heuristic and parameter optimization arranges the containers within the vehicle's available installation space and created layout alternatives. We apply this procedure to a real case study based on the aCar, a light electric utility vehicle for rural sub-Saharan Africa. This is a first step to enable superstructure manufactures to design and optimize vehicle concept designs based on service capacity.

关键词： packing algorithm vehicle-based service vehicle concept design

来源：评论

学校读者我要写书评

暂无评论

A methodology for an optimal design of ground-mounted photovoltaic power plants

引用

APPLIED ENERGY 2022年 314卷

作者： Barbon, A. Bayon-Cueli, C. Bayon, L. Carreira-Fontao, V. Univ Oviedo Dept Elect Engn Oviedo Spain Univ Oviedo Dept Math Oviedo Spain Univ Oviedo Polytech Sch Engn Gijon Oviedo Spain

A methodology for estimating the optimal distribution of photovoltaic modules with a fixed tilt angle in ground-mounted photovoltaic power plants has been described. It uses Geographic Information System, available in the public domain, to estimate Universal Transverse Mercator coordinates of the area which has been selected for the installation of the photovoltaic plant. An open-source geographic information system software, QGIS, has been used. The estimation of the solar irradiance takes into account the variations in the local cloud cover distribution. The optimization process is considered to maximize the amount of energy absorbed by the photovoltaic plant using a packing algorithm (in MathematicaT software). This packing algorithm calculates the shading between photovoltaic modules. This methodology can be applied to any photovoltaic plant. Different rack configurations and tilt angles are incorporated in the study to account for the characteristics of the irregular shape of the land. The most used rack configurations in photovoltaic plants are the 2V x 12 configuration (2 vertically modules in each row and 12 modules per row) and the 3V x 8 configuration (3 vertically consecutive modules in each row and 8 modules per row). Codes and standards have been used for the structural analysis of these rack configurations. For this purpose, the wind loads, the snow loads, the weight of the structure, the weight of the photovoltaic modules, and combinations thereof have been calculated. This analysis has been performed with AutoDesk Robot Structural Analysis software for the different rack configurations. A detailed cost analysis of the most used rack configurations in photovoltaic plants has been presented. The levelized cost of the produced electricity efficiency is calculated for each rack configuration. The methodology has been applied in Sigena I photovoltaic plant located in Northeast of Spain. The current rack configuration used in this photovoltaic plant is the

关键词： Ground-mounted photovoltaic power plant packing algorithm Rack configuration Structural analysis Cost analysis

来源：评论

学校读者我要写书评

暂无评论

Three-dimensional mesoscale modeling of concrete with convex aggregate based on motion simulation

引用

CONSTRUCTION AND BUILDING MATERIALS 2021年 277卷 122257-122257页

作者： Chen, Tao Xiao, Shiyun Dalian Univ Technol State Key Lab Coastal & Offshore Engn Dalian 116024 Liaoning Peoples R China

Numerical simulation using a mesoscale model is an effective method to determine the complex mechanical behaviors of concrete. Establishing a numerical sample with a mesostructure close to realistic concrete is crucial for mesoscale simulation. This paper presents a heuristic packing algorithm for constructing 3D random aggregate models with high aggregate content. In the algorithm, the aggregate packing problem is considered as a problem of optimizing the potential energy of the mesoscale configuration. In the initial state, all aggregate particles are randomly placed inside the specimen container;then, the particles move in the container according to the proposed motion simulation strategy until a feasible spatial configuration is obtained. The framework is suitable for various types of aggregates, including spherical, ellipsoidal, polyhedral, and mixed-type aggregates, that have a support mapping representation. In this study, numerous samples with different types of aggregates were established, and the influence of the aggregate gradation on the packing density was examined. The results verified the efficiency and robustness of the proposed algorithm. (C) 2021 Elsevier Ltd. All rights reserved.

关键词： Three-dimensional modeling Convex aggregates Collision detection Motion simulation packing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：