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

District-level validation of a shoeboxing simplification algorithm to speed-up Urban Building Energy Modeling simulations

引用

APPLIED ENERGY 2023年第1期349卷

作者： Battini, Federico Pernigotto, Giovanni Gasparella, Andrea Free Univ Bozen Bolzano Competence Ctr Mt Innovat Ecosyst Bolzano Italy Free Univ Bozen Bolzano Fac Engn Bolzano Italy Piazza Univ 5 I-39100 Bolzano Italy

The "shoeboxing" algorithm is a simplification approach capable of converting a building of any shape into a representative shoebox, with the aim of speeding-up Urban Building Energy Modeling simulations. The procedure works towards accurately predicting both annual energy needs and hourly thermal loads, going beyond the preliminary assessment of buildings' thermal performance at city-scale. Furthermore, the simplification has been particularly developed to work with buildings of complex geometry considering adjacencies and obstructions. After a first validation performed for stand-alone buildings, in this paper, the capabilities of the algorithm are evaluated at district-level on fictional parametrically generated layouts and in different climatic conditions. As a whole, the shoeboxing algorithm properly predicted both heating and cooling needs at building-level in all the considered climatic conditions, yielding annual differences within & PLUSMN;10% and & PLUSMN;20%, respectively for cooling and heating. Moreover, both annual and hourly deviations showed to be similar in the different climates considered, suggesting that the simplification can be reliably employed worldwide. Finally, the thermal simulation time has been reduced up to 36 times.

关键词： Urban building energy modeling simplification algorithm Building energy modeling Shoebox EnergyPlus

来源：评论

学校读者我要写书评

暂无评论

Point cloud simplification algorithm based on particle swarm optimization for online measurement of stored bulk grain

引用

International Journal of Agricultural and Biological Engineering 2016年第1期9卷 71-78页

作者： Shao Qing Xu Tao Yoshino Tatsuo Zhao Yujie Yang Wenting Zhu Hang School of Mechanical Science and Engineering Jilin UniversityChangchun 130022China Jilin Academy of Agricultural Machinery Changchun 130022China

The simplification of 3D laser scanning point cloud is an important step of surface reconstruction and volume estimation of bulk grain in *** study presented an adaptive simplification algorithm based on particle swarm optimization(PSO).It introduced PSO into the average distance method,a conventional simplification *** basic idea of this algorithm was to adaptively determine the optimal point reducing intervals of scanning lines according to original point cloud density by *** using the 3D point cloud scanned from bulk grain surface in granary,the proposed algorithm was *** with the average distance method,the proposed algorithm obtained more evenly distributed point set,smaller reduction ratio(6.96%)and higher volume estimation accuracy(relative error was less than 3‰).The 3D laser scanner(GSLS003,Jilin University and SkyViTech Co.,Ltd.,Hangzhou,China)used in this study could scan the complete picture of the grain surface in a granary in one time,so the acquired point cloud data do not have to be *** the good simplification performance and capability of updating the reducing interval at any moment,the proposed algorithm and the 3D laser scanner could be used to realize online real-time measurement of stored bulk grain volume in granary.

关键词： point cloud simplification algorithm particle swarm optimization(PSO) 3D laser scanning large object stored grain

来源：评论

学校读者我要写书评

暂无评论

Joint simplification of Various Types of Spatial Objects While Preserving Topological Relations

引用

AUTOMATIC CONTROL AND COMPUTER SCIENCES 2024年第7期58卷 946-956页

作者： Yakimova, O. P. Murin, D. M. Gorshkov, V. G. Demidov Yaroslavl State Univ Yaroslavl 150003 Russia

Cartographic generalization includes the selection of objects and phenomena, as well as their simplification (generalization), to be shown in the map while preserving the main typical traits, characteristics, and correlations by the criteria set by the user in the request. These criteria include the problem being solved and the scale of the displayed map. Various map transformations can change the relationships between objects, especially since it is common practice to simplify each type of spatial object independently (first the administrative boundaries, then the road network, populated localities, hydrographic network, etc.). The solution of topological conflicts is one of the key problems of generalizing digital map. A great deal of attention has been paid to the solution of this problem since the start of studies in this domain. The consideration of coverings and mesh structures confines the more general problem of managing topological conflicts to solve topological conflicts within a mesh cell. This study proposes a new geometric simplification algorithm. Its feature consists of the joint simplification of a set of spatial objects of various types while preserving their topological relations. The only parameter of the proposed algorithm is the minimal size of the detail shown in the map. Usually, this size is equal to one millimeter in the target map scale. Step one of the algorithm is the construction of a special mesh data structure. This structure is used to form, for each spatial object, a sequence of cells, to which points of this object belong. If a cell contains points of only one object, the object is geometrically simplified within the bounding cell using the sleeve-fitting algorithm. If a cell contains points of several objects, the geometric simplification is done using a special topology-preserving procedure.

关键词： simplification algorithm topological relationships mesh data structure spatial data consistent cartographic generalization

来源：评论

学校读者我要写书评

暂无评论

Rapid assessment of slope deformation in 3D point cloud considering feature-based simplification and deformed area extraction

引用

MEASUREMENT SCIENCE AND TECHNOLOGY 2023年第5期34卷 055201-055201页

作者： He, Leping Yan, Zhongmin Hu, Qijun Xiang, Bo Xu, Hongbiao Bai, Yu Southwest Petr Univ Sch Civil Engn & Geomat Chengdu 610500 Peoples R China Sichuan Highway Planning Survey & Design Inst Co L Chengdu 610041 Peoples R China Southwest Petr Univ Sch Mechatron Engn Chengdu 610500 Peoples R China

Calculating deformation values and determining deformation areas are essential for slope monitoring and safety management. Recently, terrestrial laser scanning has been widely used for deformation monitoring due to to its speed and efficiency. However, handling a large amount of point cloud data to obtain the deformed area is still challenging. To rapidly evaluate slope deformation information, this study proposes a simplification algorithm for point cloud data based on multi-parameter feature preservation. The proposed method retains feature points (i.e. inflection points and edge points) and simplifies data with the octree structure. In addition, a method based on cloud-to-mesh for displacement is used where the winding number is introduced for the signed function. Next, the deformed area over the level of detection is extracted using density-based spatial clustering for applications with a noise clustering algorithm. To verify the reduction method, two types of slope field data are used for experiments. The results reveal that the proposed point cloud approach is superior to the conventional algorithms. Furthermore, the highway slope in Mianyang is selected as a case study to validate the performance of the proposed method. The entire monitoring area is stable with a deformation of approximately 0.43 mm, and only four regions are deformed over the study period. When the mean displacement value is considered in different deformation regions, the minimum deformation is -82.02 mm and the maximum deformation is 85.31 mm. Moreover, comparative experiments on deformation calculation are conducted and reveal the superior performance of the proposed method.

关键词： terrestrial laser scanning displacement calculation simplification algorithm deformed area

来源：评论

学校读者我要写书评

暂无评论

simplification of Hyperelastic Constitutive Model and Finite Element Analysis of Thermoplastic Polyurethane Elastomers

引用

MACROMOLECULAR THEORY AND SIMULATIONS 2020年第4期29卷 2000009-2000009页

作者： Wang, Yingzhu Luo, Weiang Huang, Junwen Peng, Chaohua Wang, Hongchao Yuan, Conghui Chen, Guorong Zeng, Birong Dai, Lizong Xiamen Univ Fujian Prov Key Lab Fire Retardant Mat Coll Mat Xiamen 361005 Peoples R China

In this work, the simplified hyperelastic constitutive model and finite element analysis of thermoplastic polyurethane elastomers (TPUs) under uniaxial tension are studied. Based on a series of classical strain energy density function of hyperelastic materials, a "one-step" transformation algorithm from standard test data to the simplest constitutive model is proposed and a three-parameter simplified constitutive model is obtained. The simplified model has a high accuracy on the experimentally determined load-displacement curve with fitting errors of 0.95%, 0.81%, and 0.98% to three TPUs comprising different hard segment contents of 15.19, 22.54, and 38.51 wt%, respectively. By combining the simplified hyperelastic constitutive model with the finite element analysis, the mechanical behavior of TPUs in uniaxial tensile state is predicted accurately. The simplification algorithm and simulation method may be applicable to other hyperelastic materials with more complex shapes and working conditions and have certain practical engineering guiding significance for the subsequent material selection, design, and production.

关键词： finite element analysis hyperelastic constitutive model simplification algorithm thermoplastic polyurethane elastomers uniaxial tension

来源：评论

学校读者我要写书评

暂无评论

Equivalent State of Finite Automata and Its Judgment Theorem 18

Equivalent State of Finite Automata and Its Judgment Theorem

引用

2nd International Conference on algorithms, Computing and Systems (ICACS)

作者： Yue Xingyan Hao Peifeng Lin Zhao Northeastern Univ Software Coll Shenyang Liaoning Peoples R China

ISBN: (纸本)9781450365093

Automata theory is an important tool in modern computer science, playing a role in compiler and many other engineering fields. This paper first analyzes the automata theory. For sake of enhancing the mathematical logicality of automata theory and to carry out the further research on the equivalent state of finite automata, we modify and optimize the basic concept of automata theory. Next, this paper defines the string set of state, in order to formalize the concept of equivalent state. According to these basic concepts, we advance several judgment theorems of equivalent state, which can explain the effectiveness of the simplification algorithms of finite automata, and complete their proofs. Finally, we also introduce a merging based simplification algorithm for finite automata, which is the direct application of one of the judgment theorems above.

关键词： formal language finite automata equivalent state simplification algorithm transition function

来源：评论

学校读者我要写书评

暂无评论

Automatic Combination Technology of Fuzzy CPN for OWL-S Web Services in Supercomputing Cloud Platform

引用

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 2017年第7期31卷 1759010-1759010页

作者： Deng, Ziyun Zhang, Jing He, Tingqin Changsha Commerce & Tourism Coll Changsha 410116 Hunan Peoples R China Hunan Univ Coll Elect & Informat Engn Changsha 410082 Hunan Peoples R China Hunan Univ Coll Informat Sci & Engn Changsha 410082 Hunan Peoples R China

Supercomputing Cloud Platform (SCP) provides a simple online Web way for computer aided engineering (CAE) simulation on supercomputer "Tianhe No.1." We develop SCP prototype by using service-oriented architecture (SOA). Fuzzy colored Petri nets (FCPN) is selected as the automatic combination technology for the Ontology Web Language for Services (OWL-S) in our SCP. To build the dependency relation graphs among Web services in our SCP, we put forward some definitions of semantic threshold similarity for Web services. Based on these definitions, we propose a generation algorithm to build the FCPN dependency relation graph based on semantic similarity of Web services, and analyze an example about this algorithm. Also, we design an algorithm to simplify the FCPN dependency relation graph for fast responding the user's requirements. The research works of this paper (SCP prototype) have been applied in real world, and we show the engineering design and application at the end. We will further research the service verification, transaction model and exception recovery mechanism in the future.

关键词： Supercomputing Cloud Platform (SCP) Ontology Web Language for Services (OWL-S) fuzzy colored Petri nets (FCPN) generation algorithm simplification algorithm

来源：评论

学校读者我要写书评

暂无评论

Simplified Recommendation algorithm Based on Content and Clustering in E-commerce

Simplified Recommendation Algorithm Based on Content and Clu...

引用

7th International Conference on MEMS, NANO and Smart Systems (ICMENS 2011)

作者： Xu, Bing Yu, Yonghai Zhejiang Univ Technol Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9783037853122

With the prosperity of e-commerce, more and more people willing to perform web shopping, the traditional recommendation algorithm makes the quality of system decreased dramatically in this situation. To solve this problem, we present a simplified recommendation algorithm that combines the content and clustering techniques to calculate the customer's nearest neighbor. Experimental results show the efficiency of our algorithm.

关键词： content-based clustering E-commerce recommendation simplification algorithm

来源：评论

学校读者我要写书评

暂无评论

SIMPLIPOLY: CURVATURE-BASED POLYGONAL CURVE simplification

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 2011年第4期21卷 417-429页

作者： Chuon, Chansophea Guha, Sumanta Janecek, Paul Nguyen Duc Cong Song Asian Inst Technol Comp Sci & Informat Management Program Sch Engn & Technol Klongluang 12120 Pathumthani Thailand

A curvature-based algorithm to simplify a polygonal curve is described, together with its implementation. The so-called SimpliPoly algorithm uses Bezier curves to approximate pieces of the input curve, and assign curvature estimates to vertices of the input polyline from curvature values computed for the Holier approximations. The a Ut hors' implementation of SimpliPoly is interactive and available freely on-line. Additionally, a third-party implementation of SimpliPoly as a plug-in for the GNU Blender 3D modeling software is available. Empirical comparisons indicate that SimpliPoly performs as well as the widely-used Douglas-Peucker algorithm in most situations, and significantly better, because it is curvature driven, in applications where it is necessary to preserve local features.

关键词： Curvature curve simplification Douglas-Peucker level of detail polygonal curve polyline simplification algorithm SimpliPoly

来源：评论

学校读者我要写书评

暂无评论

A Knowledge simplification of a uncertain System Based on Information Consistency

A Knowledge Simplification of a uncertain System Based on In...

引用

1st International Conference on High Performance Structures and Materials Engineering

作者： Zeng, Huanglin Zeng, Xiaohui Zhou, Ling Sichuan Univ Sci & Engn Dept Elect Eng Chengtu 643000 Peoples R China Chengdu Univ Informat Technol Dept Com Engn Chengdu 610225 Peoples R China

ISBN: (纸本)9783037850756

Based on knowledge equivalent classification of an uncertain system, from view of the knowledge coordinating relations and dependence of condition attributes and the decision attributes in an information universe, a new concept of information consistency of a database is presented to simplify knowledge of an uncertain system. A basic algorithm and realization of knowledge simplification on the information consistency of a database is suggested in this paper. It is more legible and convenient for knowledge simplification by way of the information consistency of a database than the idea of knowledge dependence. The feasibility of the proposed approaches of knowledge simplification and reasoning decision rules is validated by some of example of a classic CTR car knowledge representation system with a large-scale database here.

关键词： An uncertain information system Data mining knowledge dependence consistency simplification algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：