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

Electric load forecasting: evaluating the novel hierarchical neuro-fuzzy BSP model

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2004年第2期26卷 131-142页

作者： Vellasco, MMBR Pacheco, MAC Neto, LSR de Souza, FJ Pontificia Univ Catolica Rio de Janeiro Dept Elect Engn ICA Appl Computat Intelligence Lab BR-22453000 Rio de Janeiro Brazil Operador Nacl Sistema Eletr Rio De Janeiro Brazil Univ Estado Rio De Janeiro Dept Syst & Comp Engn Rio De Janeiro Brazil

This paper introduces a new hybrid neuro-fuzzy model, called HNFB, and evaluates its performance in short-term load forecasting. To this end, two Brazilian electric power companies were used as case studies. A total of three intelligent forecasting systems were tested and compared: neural networks, neuro-fuzzy, and neural/neuro-fuzzy systems. As input variables, the experiments made use of historical load series and of additional variables that influence the load behavior, such as the temperature, the comfort index and the consumption profile. The results reveal the potential of the proposed neuro-fuzzy and neural/neuro-fuzzy models for load forecasting, when compared with neural networks;the mean absolute percentage errors varied between 0.44 and 1.95%, depending on the case study at hand. (C) 2004 Elsevier Ltd. All rights reserved.

关键词： neuro-fuzzy systems electric load forecasting binary space partitioning

来源：评论

学校读者我要写书评

暂无评论

HULK - Simple and fast generation of structured hexahedral meshes for improved subsurface simulations

引用

COMPUTERS & GEOSCIENCES 2017年 99卷 159-170页

作者： Jansen, Gunnar Sohrabi, Reza Miller, Stephen A. Univ Neuchatel Lab Geotherm & Geodynam CHYN Ctr Hydrogeol & Geotherm CH-2000 Neuchatel Switzerland

Short for Hexahedra from Unique Location in (K)convex Polyhedra - HULK is a simple and efficient algorithm to generate hexahedral meshes from generic STL files describing a geological model to be used in simulation tools based on the finite element, finite volume or finite difference methods. Using binary space partitioning of the input geometry and octree refinement on the grid, a successive increase in accuracy of the mesh is achieved. We present the theoretical basis as well as the implementation procedure with three geological models with varying complexity, providing the basis on which the algorithm is evaluated. HULK generates high accuracy discretizations with cell counts suitable for state-of-the-art subsurface simulators and provides a new method for hexahedral mesh generation in geological settings.

关键词： Hexahedral mesh binary space partitioning Octree refinement Geological model FEM/FVM/FDM STereoLithography

来源：评论

学校读者我要写书评

暂无评论

Deferred, self-organizing BSP trees

Deferred, self-organizing BSP trees

引用

23rd Annual Conference of the Eurographics-Association

作者： Ar, S Montag, G Tal, A Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures is the choice of cutting planes. Rather than base these choices solely on the properties of the scene, we propose using information about how the tree is used in order to determine its structure. We demonstrate how this leads to the creation of BSP trees that are small, do not require much preprocessing time, and respond very efficiently to sequences of collision queries.

关键词： binary space partitioning collision detection ray-shooting walkthrough self-organizing data structares deferred data structures

来源：评论

学校读者我要写书评

暂无评论

Scale Virtual Worlds Through Dynamic Load Balancing 10

Scale Virtual Worlds Through Dynamic Load Balancing

引用

14th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications (DS-RT 2010)

作者： Liu, Huaiyu Bowman, Mic Intel Corp Intel Labs Hillsboro OR 97124 USA

ISBN: (纸本)9780769542515

Dynamic load balancing holds the potential to scale virtual worlds flexibly by dynamic allocation of hardware to match load. In this paper, we study the benefits and overheads of space based load partitioning, in particular, distributed binary space partitioning (BSP). Our evaluation is based on OpenSimulator, a virtual world system compatible with Second Life (R) viewers. Our work reveals that although simple and effective, distributed BSP has several limitations and suffers from high overhead. We then analyze the fundamental reasons of these limitations. To overcome the limitations, we argue that it is necessary to break away from the simulator-centric architecture used in today's virtual worlds, and present potential new directions.

关键词： virtual worlds distrbuted simulation load balancing binary space partitioning

来源：评论

学校读者我要写书评

暂无评论

An Improved QPSO Algorithm Based on Entire Search History 14

An Improved QPSO Algorithm Based on Entire Search History

引用

International Symposium Distributed Computing and Applications Business Engineering and Science

作者： Zhao, Ji Fu, Yi Mei, Juan Res Ctr Environm Sci & Engn Wuxi Peoples R China Jiangnan Univ Sch IoT Engn Wuxi Peoples R China

ISBN: (纸本)9781467365932

An improved QPSO algorithm based on entire search history (ESH-QPSO) is proposed. ESH-QPSO is an integration of the entire search history scheme and a standard quantum-behaved particle swarm optimization (QPSO). It guarantees that all updated positions are not re-visited before, which helps prevent premature convergence. The entire search history scheme partitions the continuous search space into sub-regions by using BSP tree. The partitioned sub-region servers as mutation range such that the corresponding mutation is adaptive and parameter-less. When sub-regions are formulated as which certain overlap exists between adjacent sub-regions, this allows particle move from a sub-region to another with better fitness. Compared with other traditional algorithms, the experiment results on 8 standard testing functions show that the proposed algorithm is superior regarding the optimization of multimodal and unimodal functions, with enhancement in both convergence speed and precision those demonstrate the effectiveness of the algorithm.

关键词： quantum-behaved particle swarm optimization entire search history adaptive mutate binary space partitioning

来源：评论

学校读者我要写书评

暂无评论

Improved Partitioned Shadow Volumes Method of Real-Time Rendering Using Balanced Trees 9th

Improved Partitioned Shadow Volumes Method of Real-Time Rend...

引用

9th International Conference on Computational Collective Intelligence (ICCCI)

作者： Choros, Kazimierz Suder, Tomasz Wroclaw Univ Sci & Technol Fac Comp Sci & Management Wyb Wyspianskiego 27 PL-50370 Wroclaw Poland

ISBN: (纸本)9783319670775;9783319670768

Shadows are probably one of the most important factors of the 3D scene. They enhance realism and comprehension of rendered images. They are usually generated with some variation of shadow volumes or shadow mapping, although recently a new algorithm called Partitioned Shadow Volumes appeared. The paper presents an improved version of the Partitioned Shadow Volumes algorithm, dedicated for the static scenes, that optimizes the speed of shadowing by using binary space partitioning heuristics to generate more optimal ternary object partitioning tree. There is an obvious trade-off between ternary object partitioning tree building time and the rendering time, but the tests have shown that the proposed modification can significantly speed up the rendering time of scenes when the light position and shadow caster model do not frequently change.

关键词： Real-time rendering 3D graphics Partitioned Shadow Volumes Shadow mapping Precomputed lighting Static shadows binary space partitioning Rendering time

来源：评论

学校读者我要写书评

暂无评论

COMPRESSION AND PROGRESSIVE RETRIEVAL OF MULTI-DIMENSIONAL SENSOR DATA 23

COMPRESSION AND PROGRESSIVE RETRIEVAL OF MULTI-DIMENSIONAL S...

引用

23rd Congress of the International-Society-for-Photogrammetry-and-Remote-Sensing (ISPRS)

作者： Lorkowski, P. Brinkhoff, T. Jade Univ Wilhelmshaven Oldenburg Elsfleth IAPG Ofener Str 16-19 D-26121 Oldenburg Germany

Since the emergence of sensor data streams, increasing amounts of observations have to be transmitted, stored and retrieved. Performing these tasks at the granularity of single points would mean an inappropriate waste of resources. Thus, we propose a concept that performs a partitioning of observations by spatial, temporal or other criteria (or a combination of them) into data segments. We exploit the resulting proximity (according to the partitioning dimension(s)) within each data segment for compression and efficient data retrieval. While in principle allowing lossless compression, it can also be used for progressive transmission with increasing accuracy wherever incremental data transfer is reasonable. In a first feasibility study, we apply the proposed method to a dataset of ARGO drifting buoys covering large spatio-temporal regions of the world's oceans and compare the achieved compression ratio to other formats.

关键词： Continuous Phenomena Discrete Observations binary space partitioning

来源：评论

学校读者我要写书评

暂无评论

Wavelet Based Image Compression Using Soft Computing Techniques

Wavelet Based Image Compression Using Soft Computing Techniq...

引用

1st International Conference on Advancements in Automation and Control (ICAAC)

作者： Ilango, S. Sudhakar Seenivasagam, V. Sri Krishna Coll Engn & Technol Dept CSE Coimbatore Tamil Nadu India Natl Engn Coll Dept CSE Kovilpatti Tamil Nadu India

ISBN: (纸本)9783038351245

The Wavelet Transform is a multi-resolution transform, that is, it allows a form of time-frequency analysis (or translation-scale in wavelet speak). When using the Fourier transform the result is a very precise analysis of the frequencies contained in the signal, but no information on when those frequencies occurred. The wavelet based image compression algorithms are used widely compared with other conventional compression algorithms. The wavelet coding based on the coefficient selection and sub band level. In this paper we have used two wavelets such as spherical and geometric wavelets. The spherical representation is a hierarchical description of how total energy gets distributed within each wavelet sub band. In the proposed method, we used fuzzy quantization technique for coefficient selection in the spherical wavelet. The other scheme introduces binary space partitioning scheme and geometric wavelet, where the existing pruning method of binary space partitioning is replaced by the genetic algorithm. We had another experiment with geometric wavelet with Artificial Bee Colony (ABC) algorithm. The experimental results for all the three methods are discussed in this paper. The advantages of these methods are the improved PSNR values at high and medium bit rates.

关键词： Fuzzy quantization binary space partitioning Genetic algorithm ABC algorithm

来源：评论

学校读者我要写书评

暂无评论

AN IMPLICIT REGULARIZATION for 3D BUILDING ROOFTOP MODELING USING AIRBORNE LIDAR DATA 22

AN IMPLICIT REGULARIZATION for 3D BUILDING ROOFTOP MODELING ...

引用

22nd Congress of the International Society for Photogrammetry and Remote Sensing: Imaging a Sustainable Future, ISPRS 2012

作者： Sohn, Gunho Jwa, Yoonseok Jung, Jaewook Brian Kim, Heungsik GeoICT Lab Geomatics Engineering Program Earth and Space Science and Engineering Department York University Toronto Canada

This paper proposes a new algorithm to generalize noisy polylines comprising a rooftop model by maximizing a shape regularity (orthogonality, symmetricity and directional simplications). The nature of remotely sensed data including airborne LiDAR often produce errors in localizing salient features (corners, lines and planes) due to weak contrast, occlusions, shadows and object complexity. A generalization or regularization process is well known algorithm for eliminating erroneous vertices while preserving significant information on rooftop shapes. Most of existing regularization methods achieves this goal base on a local process such as if-then rules due to lacking global objective functions or mainly focusing on minimising residuals between boundary observations and models. In this study, we implicitly derive rules to generate local hypothetical models. Those hypothesized models produce possible drawings of regular patterns that given rooftop vectors can possibly generate by combining global and local analysis of line directions and their connections. A final optimal model is globally selected through a gradient descent optimization. A BSP (binary Tree partitioning)-tree was used to produce initial rooftop vectors using ISPRS WGIII/4's benchmarking test sites in Veihngen. The proposed regularization algorithm was applied to reduce modelling errors produced by BSP-tree. An evaluation demonstrates the proposed algorithm is promising for updating of building database.

关键词： 3D Rooftop Modeling binary space partitioning LIDAR Minimum Description Length Regularization

来源：评论

学校读者我要写书评

暂无评论

Multi-Domain Level Generation and Blending with Sketches via Example-Driven BSP and Variational Autoencoders 20

Multi-Domain Level Generation and Blending with Sketches via...

引用

15th International Conference on the Foundations of Digital Games

作者： Snodgrass, Sam Sarkar, Anurag Modlai Copenhagen Denmark Northeastern Univ Boston MA USA

ISBN: (纸本)9781450388078

Procedural content generation via machine learning (PCGML) has demonstrated its usefulness as a content and game creation approach, and has been shown to be able to support human creativity. An important facet of creativity is combinational creativity or the recombination, adaptation, and reuse of ideas and concepts between and across domains. In this paper, we present a PCGML approach for level generation that is able to recombine, adapt, and reuse structural patterns from several domains to approximate unseen domains. We extend prior work involving example-driven binary space partitioning for recombining and reusing patterns in multiple domains, and incorporate Variational Autoencoders (VAEs) for generating unseen structures. We evaluate our approach by blending across 7 domains and subsets of those domains. We show that our approach is able to blend domains together while retaining structural components. Additionally, by using different groups of training domains our approach is able to generate both 1) levels that reproduce and capture features of a target domain, and 2) levels that have vastly different properties from the input domain.

关键词： procedural content generation level blending level generation binary space partitioning variational autoencoder PCGML

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：