Design and economic analysis of solar home system for urban areas of Mogadishu using homer software

In this century of enhanced progress by various spaces, some African states are still challenging lack of energy due to scarcity in some places. The most used energy (generation of electricity) is hydropower because heat and fuel are still on some scale. This problem comes about in less efficiency and financial decay of some nations such as Somalia which is among the country at very high speed in progress, the grid lines from distant places are stack and they are rare matched to the required of power in all areas of the nation, especially in remote or urban areas where each household needs electricity utilization instead of utilizing local, conventional and lighting at domestic. This issue can be illuminated utilizing other elective sources of renewable energy for provincial electrification such as Photovoltaic systems. Hence, this project basically focuses on the design of SHS that incorporate financial assessment and utilize of an individual SHS of 200W, so that the satisfaction of the people and the targets of the country can be effectively achieved. Under this project, the dedicated on the investigation of power utilization based on single house household family SHS has been taking a case study of one village in Mogadishu Somalia named Heliwaa placed in Benaadir region. The survey was conducted by assessing the average major load conditions for consecutive hours per day based on photovoltaic capacity. The purpose of this study was achieved the optimal size of the photovoltaic panel and the battery capacity that can be used to power the home. Ultimately, designed project and cost will be compared to other private sector electricity cost, it means which one is more reliable and economically for electricity generation. Therefore according to, the findings the cost of energy is 2.614 in $/KWh which is lower than the private sector. This was considered optimum solution. In this project the design and simulation tasks was achieved through the assistance of HOMER software. The electrification and economics information on combination of photovoltaic systems, in the form of SHS and other renewable energy like stand-alone systems, to provide a reliable and economic system

An introduction to loopoids

We discuss a concept of loopoid as a non-associative generalization of (Brandt) groupoid. We introduce and study also an interesting class of more general objects which we call semiloopoids. A differential version of loopoids is intended as a framework for Lagrangian discrete mechanics.Comment: 9 pages, proceedings of LOOPS'1

A Fourier analytic approach to the problem of mutually unbiased bases

We give an entirely new approach to the problem of mutually unbiased bases (MUBs), based on a Fourier analytic technique in additive combinatorics. The method provides a short and elegant generalization of the fact that there are at most $d+1$ MUBs in \Co^d. It may also yield a proof that no complete system of MUBs exists in some composite dimensions -- a long standing open problem.Comment: 11 page

Systems of mutually unbiased Hadamard matrices containing real and complex matrices

We use combinatorial and Fourier analytic arguments to prove various non-existence results on systems of real and com- plex unbiased Hadamard matrices. In particular, we prove that a complete system of complex mutually unbiased Hadamard ma- trices (MUHs) in any dimension cannot contain more than one real Hadamard matrix. We also give new proofs of several known structural results in low dimensions

Representations of (2,n)(2,n)-semigroups by multiplace functions

We describe the representations of $(2,n)$-semigroups, i.e. groupoids with $n$ binary associative operations, by partial $n$-place functions and prove that any such representation is a union of some family of representations induced by Schein's determining pairs.Comment: 17 page

Representations of Menger (2,n)(2,n)-semigroups by multiplace functions

Investigation of partial multiplace functions by algebraic methods plays an important role in modern mathematics were we consider various operations on sets of functions, which are naturally defined. The basic operation for $n$-place functions is an $(n+1)$-ary superposition $[ ]$, but there are some other naturally defined operations, which are also worth of consideration. In this paper we consider binary Mann's compositions \op{1},...,\op{n} for partial $n$-place functions, which have many important applications for the study of binary and $n$-ary operations. We present methods of representations of such algebras by $n$-place functions and find an abstract characterization of the set of $n$-place functions closed with respect to the set-theoretic inclusion

R.A.Fisher, design theory, and the Indian connection

Design Theory, a branch of mathematics, was born out of the experimental statistics research of the population geneticist R. A. Fisher and of Indian mathematical statisticians in the 1930s. The field combines elements of combinatorics, finite projective geometries, Latin squares, and a variety of further mathematical structures, brought together in surprising ways. This essay will present these structures and ideas as well as how the field came together, in itself an interesting story.Comment: 11 pages, 3 figure

The existence of circular Florentine arrays

AbstractA κ × n circular Florentine array is an array of n distinct symbols in gk circular rows such that 1.(1) each row contains every symbol exactly once, and2.(2) for any pair of distinct symbols (a, b) and for any integer m from 1 to n − 1 there is at most one row in which b occurs m steps to the right of a.For each positive integer n = 2, 3, 4,…, define Fc(n) to be the maximum number such that an Fc(n) × n circular Florentine array exists.From the main construction of this paper for a set of mutually orthogonal Latin squares (MOLS) having an additional property, and from the known results on the existence/nonexistence of such MOLS obtained by others, it is now possible to reduce the gap between the upper and lower bounds on Fc(n) for infinitely many additional values of n not previously covered. This is summarized in the table for all odd n up to 81