Smarandache mukti-squares

A theorem of Drinfel'd (Drinfel'd (1993)) classifies the Poisson homogeneous spaces of a Poisson Lie group (G,πG) via a special class of Lagrangian subalgebras of the Drinfel'd double of its Lie bialgebra. This result is extended in Liu et al. (1998) to a classification of the Poisson homogeneous spaces of a Poisson groupoid (G⇉P, πG) via a special class of Dirac structures in the Courant algebroid defined by the corresponding Lie bialgebroid. It is hence natural to ask what corresponds via these classifications, or extensions of them, to arbitrary Dirac structures in the Drinfel'd double or the Courant algebroid associated to a Poisson group(oid). We show in this thesis that there is a bigger class of Dirac structures that fits in this correspondence. They correspond naturally to Dirac homogeneous spaces of the Poisson group(oid). Dirac Lie groups and Dirac groupoids have been defined by Ortiz (2009) as a generalization of Poisson Lie groups, Poisson groupoids and presymplectic groupoids. We prove in an alternative manner the existence of a natural Lie bialgebra associated to a Dirac Lie group, and we find good candidates for the infinitesimal data of a Dirac groupoid; a square of morphisms of Lie algebroids associated to the multiplicative Dirac structure. These objects generalize simultaneously the Lie bialgebroid of Poisson groupoids and the IM-2-forms associated to presymplectic groupoids (Bursztyn et al. (2004)). We show also the existence of a Courant algebroid associated to these algebroids. This Courant algebroid structure is induced in a natural way by the ambient standard Courant algebroid TG ×G T*G and is isomorphic to the Courant algebroid AG ×P A*G in the Poisson case. We show that Dirac homogeneous spaces of Dirac Lie groups (respectively Dirac groupoids) correspond to certain classes of Dirac structures in the Drinfel'd double of the Lie bialgebra (respectively in the Courant algebroid). These results generalize the classification theorems in Drinfel'd (1993) and Liu et al. (1998). Along the way, we study involutive multiplicative foliations on Lie groupoids and show when and how there is a natural groupoid structure defined on the leaf spaces in the set of objects and the set of units of the Lie groupoid. This is a fact that is always true in the Lie group case, where a multiplicative foliation is automatically the left and right invariant image of an ideal in the Lie algebra, i.e., the leaves are the cosets of a normal subgroup of the Lie group.

An exploration into the assessment of hip extension strength and its importance for performance in professional soccer.

Analysis of covariance (ancova) is a technique that combines features of analysis of variance and regression which is used to increase precision (accuracy) of the experiment. Ancova can be used for any experimental design include Graeco Latin square design. Graeco Latin square design is a combination of two orthogonal Latin square. Two Latin square are orthogonal if they are combined, the same pair of symbols occurs no more than once in the composite square. Application ancova on Graeco Latin square design in the field of agriculture is given to observe the effect of different fertilizer dose towards outcome of corn production. In this experiment there are three blocking factors (soil pH, soil slopes, and corn varieties) and two variable concomitant (quantity of corn plant and quantity of baby corn). The result shows that both of concomitant variables effect are significant. Ancova is better than anova, it can see from the coefficient of variation ancova less than anova, so precision (accuracy) of the experiment is increase. That is why concomitant variable can’t be ignored from the experiment. Keywords : Analysis of Covariance (ancova), Analysis of Variance (anova), Analysis Regression, Graeco Latin square design, Orthogonal.

This paper considers the deployment of frequency-hopped OFDMA at the downlink of a cellular system. Each user in the cell is assigned a number of subcarriers by the base-station, which change every OFDM symbol according to deterministic hopping patterns. The construction of the hopping patterns is based on orthogonal Latin squares, that guarantee orthogonal intra-cell multiple access and randomize the inter-cell interference. Properties of Latin squares are derived, which enable us to evaluate analytically the performance of two coded modulation schemes, namely TCM and BICM. Our results demonstrate the effect of the channel parameters, the hopping pattern selection, the interleaver depth and the inter-cell interference on the performance of a coded FH-OFDMA system.

The cosmic stories : beginning, evolution, and present days of the universe

The extension of radix-4 algorithm to radix-16 to achieve the high throughput of 2.59 giga- samples/s for WPAN's.We are also reformulating radix-16 algorithm to achieve low-complexity and low area cost and high performance. Radix -16 FFT is obtained by cascaded the radix -4 butterfly units. It facilitates low-complexity realization of radix-16 butterfly operation and high operation speed due to its optimized pipelined structure. Besides, a new three-stage multiplier for twiddle factor multiplication is also proposed, which has lower area and power consumption than conventional complex multipliers. Equipped with those new performance-boosting techniques, overall the proposed radix-16 FFT processor is area-efficient with high data processing rate and hardware utilization efficiency. The control circuit of the proposed simplified radix-24 FFT SDF architecture is simpler than that of the direct radix-16 FFT SDF structure. The multiplier cost of the proposed FFT architecture is less than that of the previous FFT structures in 256-point FFT applications. The throughput of the proposed FFT processor is one sample per clock. Although the radix-16 FFT algorithm has Less computational complexity, the control circuit of the direct radix-16 SDF architecture for implementing radix-16 FFT is very complex. Thus, the efficient simplified radix-24 SDF structure, which is described in the next section, will be applied to radix-16 FFT algorithm.

This thesis describes the extension of the coordination chemistry of triazacyclohexanes to new copper complexes and to new ligands with similar coordination geometry, i.e. the orthoamides 13-alkyl-1,5,9-triazatricyclo[7.3.1.05,13 ]-tridecanes (RTATC) and unsymmetrically substituted triazacyclohexanes. By treatment of the literature known [TATC]+ cation with Li, Na, or K alkylating reagents several new RTATC (R = Ph, Bz, CH2SiMe3, 4-Bu-PhCH2) have been prepared and characterized. With these and the previously known ligands HTATC and MeTATC complexes of Cr(III), Fe(III), Cu(II), and Zn(II) have been made and their properties have been compared with those of the analogous 1,3,5-trialkyl-1,3,5-triazacyclohexane (R3TAC) complexes. It shows that the structural, chemical, and physical properties of the RTATC complexes are quite similar to those of the R3TAC complexes. [(R3TAC)Cu(PPh3)]BF4 complexes with R = iPr, Bz, Cy, and (S)-PhMeCH have been prepared and characterized. The Cu(I) complexes are diamagnetic and therefore ideal for NMR spectroscopical analysis. The η3-coordination of the ligand can be deduced from the discrimination of the endoand exo-protons of the TACring, which are in fast exchange in the free ligand. From the form of the ring signals a more symmetrical η3-coordination for the Pr3TAC complex and a slightly distorted η3-coordination for the Bz3TAC complex can be expected. This could be verified by x-ray crystal structures of both complexes. A new Cu(II) complex was found when excess Me3TAC was reacted with CuCl2: (Me3TAC)2CuCl2. The unusual coordination geometry leads to a slow reduction to Cu(I). A crystal structure of the reduction product revealed an unusual [Cu2Cl4] 2−. It shows the first Cu-Cu cuprophilic interaction in an anion which must be stronger than the electrostatic repulsion within the dianion. Synthesis of triazacyclohexanes with a mixture of two amines in a suitable solvent such as ethanol or exploitation of equilibria between R3TAC and R ′NH2 above 100 ◦C yields mixtures of unsymmetrically substituted R2R′TAC which could be separated by various methods below 100◦C. The pure and dry unsymmetrical R2R′TAC are stable at room temperature and even at higher temperatures for short periods and can best be identified by their very characteristic 13C NMR signals for the ring carbon atoms. This way a couple of examples for basically three different types of unsymmetrically substituted R2R′TAC could be prepared: simple R2R′TAC with small hydrocarbon substituents (Me2BzTAC, Me2OctTAC), R2(R′X)TAC with a substituent bearing a functional group (Me2(EtOH)TAC, Me2(EtCN)TAC), and two triazacyclohexanes linked by a short bridge R2TAC-R’-R2TAC (Me2TAC-CH2PhCH2Me2TAC), Bu2TAC-CH2PhCH2Bu2TAC).

In this contribution we report on three recent advances in modularity optimization, namely: 1. The randomized greedy (RG) family of modularity optimization al- gorithms are state-of-the-art graph clustering algorithms which are near optimal, fast, and scalable. 2. The extension of the RG family to multi-level clustering. 3. A new entropy based cluster index which allows the detection of the proper clustering levels and of stable core clusters at each level. Last, but not least, several marketing applications of these algorithms for customer enablement and empowerment are discussed: e.g. the detec- tion of low-level cluster structures from retail purchase data, the analy- sis of the co-usage structure of scientific documents for detecting multi- level category structures for scientific libraries, and the analysis of social groups from the friend relation of social network sites.

The deformational and metamorphic history of the Georgetown Inlier, North Queensland: implications for the 1.7 to 1.5 Ga tectonic evolution of northeastern Proterozoic Australia

To investigate characteristics and formation mechanism of transtentional structures developed in Linnan subsag of the Bohai Bay basin,more than 30 3-D seismic sections have been interpreted,temporal and spatial distributions of extension rates have been estimated and analyzed,and the planar distribution of faults in three stages,Es3-Es1,Ed and Ng-Nm,have been plotted.2-D linear elastic numerical models have been established to simulate the stress field of the above mentioned three stages,using finite element software FEPG.The results reveal that,the maximum principal stress and maximum shear stress in the northeast of Linnan subsag are larger than those in the southwest; from Es3 to Nm,all the maximum principal stress and maximum shear stress decrease gradually; the shear stresses are larger than tensile ones on the boundary of numerical model at all the three stages,while the ratio of shear to tensile stress increases gradually.Through the study,dynamical mechanism of tense-shearing structure developed in Linnan subsag can be quantified,which is helpful to study the time and ways of Tanlu fault and Lanliao fault effects on Huimin depression or even on Bohai Bay basin.

In this thesis, we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts. In the first one, we reason about two logics for computations, GCTL* and MCTL*, which are useful to describe a correct execution of monolithic closed systems. In the second one, instead, we focus on two logics for strategies, SL and mATL*, which are useful to formalize several interesting properties about interactive plays in multi-entities systems modeled as multi-agent games. In the “Logics for Computations” part, we first study the immersion of the idea of graded quantifications into the temporal-logic framework. In first order logic, existential and universal quantifiers express the concepts of the existence of at least one individual object satisfying a formula, or that all individual objects satisfy a formula. In other logics, these quantifiers have been generalized to express that, for a given non-negative integer n, at least n or all but n individuals satisfy a particular formula. Here, we consider GCTL, a temporal logic with graded path quantifiers, which allows to describe properties like “there exist at least n different classes of computational fluxes in which a system reaches a predetermined state”, where the classes over paths are computed by means of a predetermined equivalence relation. More precisely, we uniformly extend the classic concept of graded quantifiers from states to paths, through the use of a concept of path equivalence with respect to a given path formula. About this logic, in particular, we study the expressiveness and succinctness relationships with respect to GµCalculus and the complexity of the satisfiability problem, which results to be ExpTime-Complete. This research is partially based on the works [BMM09] “Graded Computation Tree Logic” and [BMM10] “Graded Computation Tree Logic with Binary Coding” published, respectively, in the proceedings of the “IEEE Symposium on Logic in Computer Science, 2009” and “EACSL Annual Conference on Computer Science Logic, 2010”. Preliminary results can be also found in [Mog07]. Furthermore, we consider special quantifiers over substructures, which allow to select, using parametric criteria, small critical parts of a system to be successively verified. In literature, there are some attempts to define a logic that allows to modify the underlying structure under exam and then to verify on it some assigned property. However, as far as we know, none of them is able to select minimal submodels of a given property describing the criteria on which then execute the verification process. Here, we base our work on the search of a new operator that merges the concept of quantifiers on structures with that one derived by a generalization of the concept of pruning. The results of this work, is a class of three different extensions of CTL* with minimal model quantifiers, which we name MCTL*. Regarding these logics, we study several reductions among them, as well as the satisfiability problem that we prove to be highly undecidability, i.e., Σ_1^1-Hard, for two out of the three cases. This research is partially based on the work [MM09] “Branching-Time Temporal Logics with Minimal Model Quantifiers” published in the proceedings of the “International Conference on Developments in Language Theory, 2009”. In the “Logics for Strategies” part, we first study the problem of defining a new specification language through which it is possible to express several important properties of multi-entities systems that are neither expressible using classical monolithic temporal logics, such as CTL*, nor using two-agent-teams temporal logics, such as ATL*. In literature, we can found some proposal of logics that try to achieve this goal, but unfortunately, none of them succeeds completely on all the aspects. Among them, one of the most important attempts is CHP-SL, a logics in which one can use variables over strategies. However, this logic has a deep weakness, since it does not allow to describe games with more than two players and even two-players concurrent games. Here, we introduce SL, a logic with a syntax similar in some aspects to the first order logic, in which the strategies of the agent building the game are treated as first order objects on which we can quantify. This logic generalizes CHP-SL, by allowing the specification of the correct behavior of multi-agent concurrent games. In SL, for example, we are able to express very complex but useful Nash equilibria that are not expressible with CHP-SL. We enlighten that Nash equilibrium is one of the most important concepts in game theory. For the introduced logic, we solve two problems left open in the work on CHP-SL. Precisely, we show that the related model-checking problem is 2ExpTime-Complete, thus not harder of the same problem for several subsumed logics, while we prove that its satisfiability problem is highly undecidable, i.e., Σ_1^1-Hard. This research is partially based on the work [MMV10a] “Reasoning About Strategies” published in the proceedings of the “IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010”. Finally, we consider the concept of relentful strategic reasoning, i.e., a formalism that expresses the ability of a strategy to be used not only to achieve a first given goal, but also to change its final goal in dependence of the history of the play. In the context of planning, memoryful quantification, i.e., quantification over computations that does not lose information about the past along the time, is one of the principal way to express the fact that a system is able to achieve a desired result, and shift to a different goal if some event happens. However, this kind of quantification was not considered before in the context of multi-agent planning. Here, we introduce mATL*, a fusion of the classic alternating temporal logic ATL* with memoryful quantification, with the aim of covering the previous idea. About this logics, we prove that, although it is equivalent to ATL*, it is exponentially more succinct. Nevertheless, we prove that both the model-checking and the satisfiability problems remain 2ExpTime-Complete, as for ATL*. This research is partially based on the work [MMV10b] “Relentful Strategic Reasoning in Alternating-Time Temporal Logic” published in the proceedings of the “International Conference on Logic for Programming Artificial Intelligence and Reasoning, 2010”.

The a4a initiative aims to provide timely and cost effective advice for the circa. 250 fish stocks that,\nthrough the EU Data Collection Framework, will have at least 10 years of data by the year 2020. Current\nprocesses for assessing the state of and managing fish stocks are intensive processes, each stock\nrequiring the attention of one or more stock assessment scientist to produce preliminary catch advice,\nwhich is subsequently reviewed by one or two committees before the final catch advice is published.\nIngrained in the development of these processes has been the development of more and more complex\nstock assessment models which typically require highly skilled personnel to set up and run.

Let Q be a quasigroup. For $$\alpha ,\beta \in S_Q$$ let $$Q_{\alpha ,\beta }$$ be the principal isotope $$x*y = \alpha (x)\beta (y)$$ . Put $$\mathbf a(Q)= |\{(x,y,z)\in Q^3;$$ $$x(yz)) = (xy)z\}|$$ and assume that $$|Q|=n$$ . Then $$\sum _{\alpha ,\beta }\mathbf a(Q_{\alpha ,\beta })/(n!)^2 = n^2(1+(n-1)^{-1})$$ , and for every $$\alpha \in S_Q$$ there is $$\sum _\beta \mathbf a(Q_{\alpha ,\beta })/n! = n(n-1)^{-1}\sum _x(f_x^2-2f_x+n)\ge n^2$$ , where $$f_x=|\{y\in Q;$$ $$ y = \alpha (y)x\}|$$ . If G is a group and $$\alpha $$ is an orthomorphism, then $$\mathbf a(G_{\alpha ,\beta })=n^2$$ for every $$\beta \in S_Q$$ . A detailed case study of $$\mathbf a(G_{\alpha ,\beta })$$ is made for the situation when $$G = \mathbb Z_{2d}$$ , and both $$\alpha $$ and $$\beta $$ are “natural” near-orthomorphisms. Asymptotically, $$\mathbf a(G_{\alpha ,\beta })>3n$$ if G is an abelian group of order n. Computational results: $$\mathbf a(7) = 17$$ and $$\mathbf a(8) \le 21$$ , where $$\mathbf a(n) = \min \{\mathbf a(Q);$$ $$ |Q|=n\}$$ . There are also determined minimum values for $$\mathbf a(G_{\alpha ,\beta })$$ , G a group of order $$\le 8$$ .

Agriculture extension and advisory services is a multidisciplinary discipline based on human interaction seeking to improve the livelihoods of farming communities and individuals by providing information and technologies. The training of extension staff is important as it has a bearing on their effectiveness in the office and in the field. This study sought to determine the HRD activities in agricultural extension and advisory services in the public and private sector. The study was done in 5 counties in Kenya and a total of 440 agricultural extension agents were sampled from the public and private extension service. HRD activities focused on formal and in-service training. 68 % of the respondents had attended formal education to improve their education with the majority 63.5 percent, having trained at the diploma level from certificate level while 21.1 % had undergone training at the degree level from diploma level. The main areas of specialization were Agricultural education (34.1 %), General agriculture (28.1 %) and Horticulture (11.7 %). The inclusion of non-agricultural areas of specialization such as Sustainable development and Strategic planning and management show the multidisciplinary nature of agriculture. Inservice courses attended were in the form of short courses, seminars, or workshops. These were clustered in five general areas; Crop Management, Management, Agricultural Economics, Agricultural Extension, and Animal Science. Most respondents (40.9 percent) had undergone training in Crop management which covered various crop enterprises from breeding to postharvest management. The shift of agricultural policy toward business orientation is reflected in 13.0 % the respondents specializing in Agricultural Economics. These HRD activities show commitment of agricultural extension providers to improve the competencies of their staff to deliver effective services to farmers. The wide range of formal and in-service courses attended also reflects the need to meet the management and technical requirements of a pluralistic and demand driven extension service.

Abstract. This study analyses the relationship between disaggregated credit extension and financial distress in South Africa. Of particular interest is to isolate the components of disaggregated credit extension that show a strong relationship with the measure of financial distress. The empirical results reveal that aggregate total domestic credit extension is robustly positively correlated with the composite indicator of financial distress, while there is a mixed relationship between the components of disaggregated credit extension and the composite indicator of financial distress. In particular, the study finds that total domestic credit extension, instalment sale credit, loans and advances to households, investments and total loans and advances are highly correlated with the composite indicator of financial distress. Therefore,the study conjures that these components could be aggregated into a single measure of credit extension that could be usedfor financial stability purposes in South Africa. Keywords. Disaggregated credit extension, Financial distress. JEL. C32, E44, E51, G21.