A PV installation framework concerning electricity variable rates

This paper assesses building integrated photovoltaic (BIPV) installation parameters based on the profit generated by a photovoltaic system. It takes into consideration a home building case study and it investigates its monthly energy demand based on a specific location and a typical occupancy. The capability of a photovoltaic (PV) system to generate more profit occurs when solar intensity is maximum while the electric energy price is at its highest rate. The paper traces a framework that encompasses different aspects such as energy demand, energy price, and solar intensity. This framework identifies profit alternatives according to different installation parameters. A tool that predicts a PV installation hourly electric energy production is developed. The profit generated is simulated for home buildings located in Beirut (Lebanon) and Xihua (China), both at 33.8° latitude north. The paper highlights a new approach for BIPV installations, taking into account weather conditions, energy demand, and electric energy utility rates.     

A single-phase algorithm for mining high utility itemsets using compressed tree structures

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+ algorithms.     

塑料挤出型材车间公用工程设计

鉴于当今人们对塑料门窗需求量的增大，通过对5个塑料挤出型材车间的设计，将其公用工程设计整理成文，总结出塑料挤出型材车间的采暖通风设计，压缩空气系统设计，制冷系统设计的较详尽的方案，以供有关设计技术人员参考。     

Anisotropic mesh adaption by metric‐driven optimization

We describe a Gauss–Seidel algorithm for optimizing a three‐dimensional unstructured grid so as to conform to a given metric. The objective function for the optimization process is based on the maximum value of an elemental residual measuring the distance of any simplex in the grid to the local target metric. We analyse different possible choices for the objective function, and we highlight their relative merits and deficiencies. Alternative strategies for conducting the optimization are compared and contrasted in terms of resulting grid quality and computational costs. Numerical simulations are used for demonstrating the features of the proposed methodology, and for studying some of its characteristics. Copyright © 2004 John Wiley & Sons, Ltd.     

Mesh data structure selection for mesh generation and FEA applications

The data structure representing a mesh and the operators to create and query such a database play a crucial role in the performance of mesh generation and FE analysis applications. The design of such a database must balance the conflicting requirements of compactness and computational efficiency. In this article, 10 different mesh representations are reviewed for linear tetrahedral and hexahedral meshes. A methodology for calculating the storage and computational costs of mesh representations is presented and the 10 data structures are analysed. Also, a system for ranking different data structures based on their computational and storage costs is devised and the various mesh representations are ranked according to this measure. Copyright © 2002 John Wiley & Sons, Ltd.     

A bidding decision index for construction contractors

Results from applying the model on a sample of contractors, the majority of whom were international and operating in Egypt, reinforces the credibility of the developed methodology, claim the authors.     

Renewable energy in competitive electricity markets

A restructured electricity system may undervalue renewable energy. We remain wary of unregulated markets, but urge the renewable energy community to begin considering how they could adapt to increasing customer choice.     

不锈钢网架(壳)技术及其应用

本文总结了多年来不锈钢网架的研究成果 ,并介绍了部分不锈钢网架的工程应用     

The meaning(s) of conditionals: Conditional probabilities, mental models, and personal utilities.

[Correction Notice: An erratum for this article was reported in Vol 29(6) of Journal of Experimental Psychology: Learning, Memory, and Cognition (see record 2007-16865-001). On page 684, Table 4, all correlations should have been identified as having a pp then q") as indicating a high conditional probability P(q|p). Participants estimated the probability that a given conditional is true (Experiments 1A, 1B, and 3) or judged whether a conditional was true or false (Experiments 2 and 4) given information about the frequencies of the relevant truth table cases. Judgments were strongly influenced by the ratio of pq to p?q cases, supporting the conditional probability account. In Experiments 1A, 1B, and 3, judgments were also affected by the frequency of pq cases, consistent with a version of mental model theory. Experiments 3 and 4 extended the results to thematic conditionals and showed that the pragmatic utility associated with believing a statement also affected the degree of belief in conditionals but not in logically equivalent quantified statements. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Distributed multi-join query processing in data grids

Query processing in data grids is a difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. Applying join operations on remote relations in data grids is a unique and interesting problem. However, to the best of our knowledge, little is done to date on multi-join query processing in data grids. An approach for processing multi-join queries is proposed in this paper. Firstly, a relation-reduction algorithm for reducing the sizes of operand relations is presented in order to minimize data transmission cost among grid nodes. Then, a method for scheduling computer nodes in data grids is devised to parallel process multi-join queries. Thirdly, an innovative method is developed to efficiently execute join operations in a pipeline fashion. Finally, a complete algorithm for processing multi-join queries is given. Analytical and experimental results show the effectiveness and efficiency of the proposed approach.