Building façades can feature different patterns depending on the architectural style, functionality, and size of buildings; therefore, reconstructing these be complicated. In particular, when semantic are reconstructed from point cloud data, uneven density noise make it difficult to accurately determine façade structure. When investigating layouts, Gestalt principles applied cluster visually si...

the robustness property can be added to dsc system at the expense of reducing performance, i.e., increasing the sum-rate. the aim of designing robust dsc schemes is to trade off between system robustness and compression efficiency. in this paper, after deriving an inner bound on the rate–distortion region for the quadratic gaussian mdc based rdsc system with two encoders, the structure of the r...

this paper presents a control strategy for fuel cell/energy storage power generation system during voltage sag conditions. the hybrid dc power sources are connected to grid using power electronic converters include dc-dc converter and grid connected voltage source inverter. the power from hybrid power sources is controlled during voltage sag by designing of control strategy for dc-dc converter....

a facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. an efficient layout contributes to the overall efficiency of operations. it’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. consequently, the efficiency of the current layout decreases or is lost and it ...

there are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. these problems will cause overestimation of process time. layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...

Let G be a finite group generated by reflections. It is shown that the elements of G can be arranged in a cycle (a "Gray. code") such that each element is obtained from the previous one by applying one of the generators. The case G = d[ ' yields a conventional binary Gray code. These generalized Gray codes provide an efficient wa), to run through the elements of any finite reflection group.