Local energy trading in microgrids is one of the emerging concepts area distribution networks. A proper business model required to manage local trading. The pricing mechanism crucial because agreed price determines benefits Designing a with specific objective considering privacy agents and respecting physical network constraints challenging task. This article proposes decentralized algorithm fo...

OBJECTIVE To investigate the internal validity of a food-frequency questionnaire (FFQ) developed for a case-control study of prostate cancer in southeast China. DESIGN A comprehensive questionnaire comprising a quantitative FFQ and a short food habit questionnaire (SFHQ) was developed and modified from previous cancer and nutritional studies. The Goldberg formula (ratio of energy intake (EI) ...

Collections of objects such as images are often presented visually in a grid because it is a compact representation that lends itself well for search and exploration. Most grid layouts are sorted using very basic criteria, such as date or filename. In this work we present a method to arrange collections of objects respecting an arbitrary distance measure. Pairwise distances are preserved as muc...

Motivated by comparative genomics, Chen et al. [9] introduced the Maximum Duo-preservation String Mapping (MDSM) problem in which we are given two strings s1 and s2 from the same alphabet and the goal is to find a mapping π between them so as to maximize the number of duos preserved. A duo is any two consecutive characters in a string and it is preserved in the mapping if its two consecutive ch...

Large-scale electronic structure calculations usually involve huge nonlinear eigenvalue problems. A method for solving these problems without employing expensive eigenvalue decompositions of the Fock matrix is presented in this work. The sparsity of the input and output matrices is preserved at every iteration, and the memory required by the algorithm scales linearly with the number of atoms of...

Abstrecr-Given a sliceable floorplan and cell sizes, Otten and Stockmeyer [12], [13] presented an algorithm to find an optimal implementation for each cell. We consider a generalized optimal sizing problem on a set of slicing trees related to an adjacency graph. For computation efficiency, we combine the tree enumeration and sizing procedures in a unified algorithm where floorplan trees and siz...

This paper presents the 169 permitted relations between two rectangles whose sides are parallel to the axes of some orthogonal basis in a 2-dimensional Euclidean space. Elaborating rectangle algebra just like interval algebra, it defines the concept of convexity as well as the ones of weak preconvexity and strong precon­ vexity. It introduces afterwards the fundamen­ tal operations of intersect...

Genetic algorithm is a soft computing method that works on set of solutions. These solutions are called chromosome and the best one is the absolute solution of the problem. The main problem of this algorithm is that after passing through some generations, it may be produced some chromosomes that had been produced in some generations ago that causes reducing the convergence speed. From another r...