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

2008 Conference on Human System Interactions

作者： Bartczak, Tomasz Paszczynski, Stanislaw Univ Comp Technol & Management Dept Distributed Syst Rzeszow Poland

ISBN: (纸本)9781424415427

In this paper, algorithms which could improve the transmission band for computer networks has been presented. The paper presents the idea and implementation of a mobile agent which could the improve transmission band in a computer network, especially for HTTP files. As a result, the number of transmitted packets (frames) has been reduced several times and transmission efficiency has been improved.

关键词： transmission efficiency packing algorithm data compression agent technology AJAX technology

来源：评论

学校读者我要写书评

暂无评论

Mixed Non-Rectangular Block packing for Non-Manhattan Layout Architectures

Mixed Non-Rectangular Block Packing for Non-Manhattan Layout...

引用

12th International Symposium on Quality Electronic Design (ISQED)

作者： Wu, Meng-Chen Chen, Hung-Ming Jou, Jing-Yang Natl Chiao Tung Univ Dept Elect Engn Hsinchu 300 Taiwan Natl Chiao Tung Univ Inst Elect Hsinchu 300 Taiwan

ISBN: (纸本)9781612849140

Non-Manhattan structures, such as the X and Y architectures, propose different flavors in reducing the use of physical resources, such as total wirelength and number of vias. However, in order to take full advantage of these structures, we need to develop new tools for these architectures, especially for early stages in physical design. In this paper, we propose the packing algorithm with isosceles right triangular and trapezoidal blocks using the B*-tree representation. Our approach can be further applied to packing with any block which can be divided into rectangles and isosceles right triangles. Experimental results based on the modified MCNC benchmarks show that the average area usage is above 95% and the run time of our proposed algorithm is comparable when performing rectangular and non-rectangular block packing with original B*-tree.

关键词： algorithm design and analysis B*-tree representation Benchmark testing Computer architecture Equations Integrated circuits Mathematical model Shape integrated circuit layout isosceles right triangular mixed nonrectangular block packing modified MCNC benchmark nonManhattan layout architectures packing algorithm trapezoidal blocks

来源：评论

学校读者我要写书评

暂无评论

Lattice approaches to packed column simulations

引用

Particuology 2008年第6期6卷 404-411页

作者： Richard Caulkin Mike Fairweather Richard A. Williams Institute of Particle Science and Engineering School of ProcessEnvironmental and Materials EngineeringUniversity of Leeds

This work presents a review of the findings into the ability of a digitally based particle packing algorithm, called DigiPac, to predict bed structure in a variety of packed columns, for a range of generic pellet shapes frequently used in the chemical and process engineering industries. Resulting macroscopic properties are compared with experimental data derived from both invasive and non-destructive measurement techniques. Additionally, fluid velocity distributions, through samples of the resulting bed structures, are analysed using lattice Boltzmann method （LBM） simulations and are compared against experimental data from the literature.

关键词： packing algorithm Bed structure Packed columns Macroscopic properties Lattice Boltzmann simulations

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Obtaining soil-water characteristic curves by numerical modeling of drainage in particulate media

引用

COMPUTERS AND GEOTECHNICS 2016年 74卷 196-210页

作者： Sattari, A. Shoarian Toker, N. K. Univ Kiel Inst Geosci Kiel Germany Middle E Tech Univ Dept Civil Engn TR-06531 Ankara Turkey

Soil-water characteristic curve (SWCC) is widely used for obtaining mechanical and hydraulic properties of unsaturated soils, such as shear strength, deformation, permeability, and flow. An innovative approach, where a meso-scale medium is generated based on particle size distribution and void ratio of non-plastic soils, for estimating the drying SWCC is developed. With application of the finite difference and Newton-Raphson (Jacobian) approximations, the air-entry pressures of pore bodies in inter-particle medium (micro-scale) are determined and implemented in drainage simulation of the medium. The volumes of drained pore bodies and subsequently developed liquid bridges after each suction iteration are calculated and plotted. Eventually, homogeneity of the developed packing algorithm, parametric study, comparison of the simulated drying SWCC to experimental and estimation results as well as computational performance of the developed MATALB code is presented and discussed. It is shown that, the proposed method results in much superior approximation of SWCC in comparison to the two major estimation methods (Arya and Paris, 1981;Fredlund and Wilson, 1997) and due to its accuracy and time efficiency, the algorithm can even be a viable option for replacing the tedious experimental methods. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Unsaturated soils Soil-water characteristic curve packing algorithm Pore network Numerical modeling

来源：评论

学校读者我要写书评

暂无评论

Modified collective rearrangement sphere-assembly algorithm for random packings of nonspherical particles: Towards engineering applications

引用

POWDER TECHNOLOGY 2014年 253卷 311-324页

作者： Bertei, A. Chueh, C-C Pharoah, J. G. Nicolella, C. Univ Pisa Dept Civil & Ind Engn I-56126 Pisa Italy Queens RMC Fuel Cell Res Ctr Kingston ON K7L 5L9 Canada Queens Univ Kingston ON K7L 3N6 Canada

A modified collective rearrangement algorithm, based on the sphere-assembly representation of the particle shape, is presented for simulating random packings of nonspherical particles and arbitrary shapes. Compared to other collective rearrangement methods, the modification introduced by this algorithm consists in i) avoiding the particle-to-container shrinking procedure by allowing particles to sequentially settle down and ii) in a stability constraint applied to all the particles in the packing. The coupling of these criteria ensures that all the particles are stable and contacting each other, allowing for an unambiguous detection of contacts, which is important in the evaluation of the effective properties desired in many engineering applications, such as percolation thresholds and effective conductivity. The effect of the internal parameters of the algorithm is investigated, showing that random close packings can be obtained. The algorithm is applied to simulate packings of rigid ellipsoids and cylinders with different aspect ratios, which are compared with simulation results provided by other packing algorithms, showing the consistency of our method. Simulations of inter-penetrating particles, mixtures of particles with different shapes and packings of agglomerates are shown, which confirm the applicability of the method to a broad range of packing problems of practical interest and, in particular, for fuel cell applications. (C) 2013 Elsevier B.V. All rights reserved.

关键词： packing algorithm Random packing Simulation Nonspherical particles Fuel cells Agglomerates

来源：评论

学校读者我要写书评

暂无评论

An efficient morphology generation and level set representation of cementitious microstructures with arbitrarily shaped aggregates and cracks via extended finite elements

引用

COMPUTERS & STRUCTURES 2018年 206卷 122-144页

作者： Huang, Junjie Wuhan Univ Sch Civil Engn Wuhan 430072 Hubei Peoples R China

Concrete has a random and complex microstructure, the mesh generation of which could be challenging and time-consuming. This research presents a numerical procedure for morphology generation and level set representation of realistic cementitious microstructures without meshing the internal material interfaces. Central to the proposed numerical method is the exploitation of a vector level set function in the description of arbitrarily shaped aggregate inclusions, which allows bypassing the orthogonal projection operation on the inclusion interface as well as the determination of the outward normal. The proposed level set method is then coupled to the extended finite element method to simulate crack propagation in cement-based materials. To realistically simulate the microstructure of concrete, an improved approach that is capable of reproducing the complex geometric shape and surface texture of aggregates is proposed. To enhance the computational efficiency, a packing algorithm that mimics the settling of soil particles and enables dense aggregate packing patterns is developed to speed up the process of placing the generated aggregates into representative volume elements. After that, a series of numerical experiments are conducted to evaluate the accuracy and efficiency of the new technique. The evaluation demonstrates the effectiveness and potential of the proposed method. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Cementitious microstructures Aggregate inclusions Level set method Extended finite element method Fractional Brownian motion packing algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimization of demand-related packaging sizes using a p-median approach

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2016年第5-8期87卷 2259-2268页

作者： Brinker, Jan Gunduz, Halil Ibrahim Rhein Westfal TH Aachen Dept Mech Theory & Dynam Machines Kackertstr 16-18 D-52072 Aachen Germany Rhein Westfal TH Aachen German Univ Technol Dept Logist Tourism & Serv Management POB 1816 Muscat 130 Oman

The determining of efficient packaging sizes is a key factor in saving material and transportation costs and also in reducing packaging waste. By analyzing the range of items and their contribution to sales-relevant order structures of a globally operating mail order company, a simplified packing algorithm is proposed. In combination with well-known methodologies, this heuristic provides near optimal solutions improving current packaging of eCommerce companies. It is shown that simple, practical heuristics are sufficient to achieve average material savings of more than 10 %. In order to find efficient packaging sizes, a set of them is generated by discretization of packaging dimensions. Given the set of orders and the set of packaging sizes, a p-median approach is applied to find a specified number of optimal, demand-related packaging sizes.

关键词： Efficient packaging packing algorithm Linear optimization p-median problem Container loading problem

来源：评论

学校读者我要写书评

暂无评论

New algorithms for virtual reconstruction of heterogeneous microstructures

引用

COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING 2018年 338卷 275-298页

作者： Yang, Ming Nagarajan, Anand Liang, Bowen Soghrati, Soheil Ohio State Univ Dept Mech & Aerosp Engn Columbus OH 43210 USA Ohio State Univ Dept Mat Sci & Engn 116 W 19Th Ave Columbus OH 43210 USA

A new set of algorithms is introduced for the virtual reconstruction of heterogeneous material microstructures, in which morphologies of embedded particles/fibers are explicitly represented. As a pre-processing phase, a shape library containing morphologies of heterogeneities, parameterized in terms of Non-Uniform Rational B-Splines (NURBS), is extracted from digital data such as micro-computed tomography images. Two packing algorithms are then introduced to reconstruct an initial (raw) periodic microstructure: In the first approach, a set of hierarchical bounding boxes approximating particle shapes are employed to check for overlap. The second approach, which is specialized for fibrous microstructures, uses the NURBS representation of fiber centerlines during the packing process. An optimization phase is applied to build the final microstructural model, relying either on the Genetic algorithm to selectively eliminate some of the inclusions or their sequential relocation within the raw microstructure. The objective functions of this optimization phase are designed to replicate the target statistical microstructural descriptors such as the volume fraction, size distribution, and spatial arrangement of inclusions. Several example problems are presented to show the application of these algorithms for synthesizing various heterogeneous microstructures, as well as their finite element modeling and simulation. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Microstructure reconstruction NURBS Heterogeneous material packing algorithm Mesh generation CISAMR

来源：评论

学校读者我要写书评

暂无评论

Modified algorithm for generating high volume fraction sphere packings

引用

COMPUTATIONAL PARTICLE MECHANICS 2015年第2期2卷 161-172页

作者： Rosello Valera, Roberto Perez Morales, Irvin Vanmaercke, Simon Recarey Morfa, Carlos Arguelles Cortes, Lucia Diaz-Guzman Casanas, Harold Univ Cent Marta Abreu Las Villas UCLV UCLV CIMNE Classroom Ctr Res Computat & Numer Methods Engn CIMCNI Carretera Camajuani Km 5 1-2 Santa Clara 54830 Villa Clara Cuba Katholieke Univ Leuven Div Mechatron Biostat & Sensors MeBioS B-3001 Leuven Belgium Univ Cent Marta Abreu Las Villas UCLV Fac Math Phys & Comp Sci Santa Clara 54830 Villa Clara Cuba

Advancing front packing algorithms have proven to be very efficient in 2D for obtaining high density sets of particles, especially disks. However, the extension of these algorithms to 3D is not a trivial task. In the present paper, an advancing front algorithm for obtaining highly dense sphere packings is presented. It is simpler than other advancing front packing methods in 3D and can also be used with other types of particles. Comparison with respect to other packing methods have been carried out and a significant improvement in the volume fraction (VF) has been observed. Moreover, the quality of packings was evaluated with indicators other than VF. As additional advantage, the number of generated particles with the algorithm is linear with respect to time.

关键词： packing algorithm Volume fraction Discrete Element Method packing quality analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：