Recently, lattices - a mathematical representation of infinite discrete points in the Euclidean space, have become an effective way to describe and analyze communication systems especially system those that can be modeled as linear Gaussian vector channel model. Channel codes based on lattices are preferred due to three facts: lattice codes have simple structure, the code can achieve the limits of the channel, and they can be decoded efficiently using lattice decoders which can be considered as the Closest Lattice Point Search (CLPS). Since the time lattice codes were introduced to Multiple Input Multiple Output (MIMO) channel, Sphere Decoder (SD) has been an efficient way to implement lattice decoders. Sphere decoder offers the optimal performance at the expense of high decoding complexity especially for low signal-to-noise ratios (SNR) and for high- dimensional systems. On the other hand, linear and non-linear receivers, Minimum Mean Square Error (MMSE), and MMSE Decision-Feedback Equalization (DFE), provide the lowest decoding complexity but unfortunately with poor performance. Several studies works have been conducted in the last years to address the problem of designing low complexity decoders for the MIMO channel that can achieve near optimal performance. It was found that sequential decoders using backward tree 
search can bridge the gap between SD and MMSE. The sequential decoder provides an interesting performance-complexity trade-off using a bias term. Yet, the sequential decoder still suffers from high complexity for mid-to-high SNR values. In this work, we propose a new algorithm for Bidirectional Fano sequential Decoder (BFD) in order to reduce the mid-to-high SNR complexity. Our algorithm consists of first constructing a unidirectional Sequential Decoder based on forward search using the QL decomposition. After that, BFD incorporates two searches, forward and backward, to work simultaneously till they merge and find the closest lattice point to the received signal. We show via computer simulations that BFD can reduce the mid-to-high SNR complexity for the sequential decoder without changing the bias value.

京都大学 / 0048 / 新制・課程博士 / 博士(人間・環境学) / 甲第22546号 / 人博第949号 / 新制||人||226(附属図書館) / 2019||人博||949(吉田南総合図書館) / 京都大学大学院人間・環境学研究科相関環境学専攻 / (主査)准教授 木下 俊哉, 教授 吉田 鉄平, 教授 森成 隆夫 / 学位規則第4条第1項該当 / Doctor of Human and Environmental Studies / Kyoto University / DGAM

The subgroup commutativity degree sd(G) of a finite group G was introduced almost ten years ago and deals with the number of commuting subgroups in the subgroups lattice L(G) of G. The extremal case sd(G) = 1 detects a class of groups classified by Iwasawa in 1941 (in fact sd(G) represents a probabilistic measure which allows us to understand how far is G from the groups of Iwasawa). Among them we have sd(G) = 1 when L(G) is distributive, that is, when G is cyclic. The characterization of a cyclic group by the distributivity of its lattice of subgroups is due to a classical result of Ore in 1938. Therefore sd(G) is strongly related to structural properties of L(G). Here we introduce a new notion of probability gsd(G) in which two arbitrary sublattices S(G) and T(G) of L(G) are involved simultaneously. In case S(G) = T(G) = L(G), we find exactly sd(G). Upper and lower bounds in terms of gsd(G) and sd(G) are among our main contributions, when the condition S(G) = T(G) = L(G) is removed. Then we investigate the problem of counting the pairs of commuting subgroups via an appropriate graph. Looking at the literature, we noted that a similar problem motivated the permutability graph of non–normal subgroups ΓN (G) in 1995, that is, the graph where all proper non– normal subgroups of G form the vertex set of ΓN (G) and two vertices H and K are joined if HK = KH. The graph ΓN (G) has been recently generalized via the notion of permutability graph of subgroups Γ(G), extending the vertex set to all proper subgroups of G and keeping the same criterion to join two vertices. We use gsd(G), in order to introduce the non–permutability graph of subgroups ΓL(G) ; its vertices are now given by the set L(G) − CL(G)(L(G)), where CL(G)(L(G)) is the smallest sublattice of L(G) containing all permutable subgroups of G, and we join two vertices H, K of ΓL(G) if HK 6= KH. We finally study some classical invariants for ΓL(G) and find numerical relations between the number of edges of ΓL(G) and gsd(G).

<div>Lattices composed of bistable elements are of great significance across various fields of science and engineering due to their ability to support a class of solitary waves, called transition waves. Common with all solitary waves, transition waves carry highly concentrated energy with minimal degradation and thus have many useful engineering applications, such as extreme waveguides, bandgap transmission, vibration absorption, and energy harvesting. The rich dynamics arising from the strong nonlinearities of the constitutive bistable microstructures still have much to be unveiled for the practical implementation of the transition waves in real-world engineering structures. Especially, the quasi-particle characteristics of the transition waves can potentially address the performance limits posed by the unit cell size in linear metamaterials.</div><div><br></div><div>In this thesis, we first present an input-independent generation of transition waves in the lattices of asymmetric bistable unit cells when snap-through transitions occur at any site within the lattice. The resulting responses are invariant across the lattice except near the boundaries. These characteristics imply useful applications in broadband energy harvesting, exploiting the highly concentrated energy of the transition waves. We further observe that the inherent lattice discreteness induces dominantly monochromatic oscillatory tail following the main transition wave. This radiated energy of the tail can always be efficiently harvested through resonant transduction regardless of the input excitations. This type of bistable lattice transforms any input disturbance into an output form that can be conveniently transduced; thus, energy harvesting becomes an inherent metamaterial property of the bistable lattice.</div><div><br></div><div>To enhance the responses further for improved energy harvesting capability, we introduce engineered defects in the form of a mass impurity, inhomogeneous inter-site stiffness, and their combinations, achieving localization of energy at desired sites. Remarkably, we also observe a long-lived breather-like mode for the first time in this type of lattice. To enhance the tail motions globally across the lattice, we investigate the responses in a set of bistable lattices with the same mass and elastic densities but with different lattice spacing distances (or lattice discreteness). From the available tail energy, we observe a significant increase in the harvesting capability with the increased lattice discreteness.</div><div><br></div><div>Next, the effect of functional grading on the onsite and inter-site stiffnesses are investigated to augment the control of the transition waves in the bistable lattices. The unidirectionality still remains in the direction of decreasing stiffness, while a boomerang-like wave reversal occurs in the direction of increasing stiffness. Both the compression and rarefaction transition waves are allowed to propagate, enabling continuous transmission of the transition waves without complex resetting mechanisms, thus expanding the bistable lattices' functionality for practical applications.</div><div><br></div><div>The observed input-independent dynamics of the one-dimensional bistable lattices can be extended to higher-dimensional metastructures by allowing macrostructural flexibility. Metabeams composed of spring-joined bistable elements are subjected to in-plane sinusoidal input at the microstructural level, and the out-of-plane responses at the macrosctructural level are measured. As long as transition waves are triggered within the metabeam, the most dominant output frequency occurs near the natural frequency of the macroscopic structure regardless of the input excitations initiating the transition waves, yielding energy transfer between uncorrelated frequencies.</div><div><br></div><div>Finally, high-fidelity in-house numerical solvers are developed for the massively parallelized computation of the problems involving generic bistable architectures, addressing the problem size limit. The improved numerical solution accuracy and computational performance, compared to those of commercial solvers, provide great potential to discover new dynamics by drastically expanding the accessible analysis regimes.</div><div><br></div><div>The experiments, simulations, and theoretical contributions in this thesis illustrate the possibilities afforded by strongly nonlinear phenomena to tailor the dynamics of materials systems. Importantly, the presented results show mechanisms to affect global dynamic properties unconstrained by the unit cell size, thereby offering new routes to extreme dynamics beyond current metamaterial architectures.</div>

No description available.

<p>Data je karakterizacija raznih tipova specijalnih elemenata mreže, kao &scaron;to su kodistributivni, neutralni, skrativi, standardni, izuzetni, neprekidni, beskonačno distributivni i drugi i ti rezultati su primenjeni u strukturnim ispitivanjima algebri, posebno u mrežama kongruencija, podalgebri i slabih kongruencija algebri.&nbsp; Specijalni elementi su posebno proučavani i u bipolumrežama i dobijene su nove teoreme reprezentacije za bipolumreže. Ispitana je kolekcija svih mreža sa istim skupom i-nerazloživih elemenata, pokazano je da je ta kolekcija i sama mreža u odnosu na inkluziju i daju se karakterizacije te mreže.&nbsp; Re&scaron;avan je problem preno&scaron;enja mrežnih identiteta sa mreže podalgebri i kongruencija na mrežu slabih kongruencija. Proučavane su osobine svojstva preseka kongruencija i svojstva pro&scaron;irenja kongruencija i neke varijante tih svojstava u vezi sa mrežama slabih kongruencija. Date su karakterizacije mreže slabih kongruencija nekih posebnih klasa algebri i varijeteta, kao &scaron;to su unarne algebra, mreže, grupe, Hamiltonove algebra i druge.</p> / <p>A characterization of various types of special elements in lattices: codistributive,&nbsp; neutral, cancellable, standard, exceptional, continuous, infinitely distributive and others are given, and the results are applied in structural investigations in algebras, in particular in lattices of subalgebras, congruences and weak congruences. Special elements are investigated also in bi-semilattices and new representation theorems for bisemilattices are obtained. The collection of all lattices with the same poset of meet-irreducible elements is studied and it is proved that this collection is a lattice under inclusion and characterizations of this lattice is given.&nbsp; A problem of transferability of lattice identities from lattices of subalgebras and congruences to&nbsp; lattices of weak congruencse of&nbsp; algebras is solved. The congruence intersection property and the congruence extension property as well as various alternations of these properties are investigated in connection with weak congruence lattices. Characterizations of weak congruence lattices of special classes of algebras and varieties, as unary algebras, lattices, groups, Hamiltonian algebras and others are given.</p>

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Nuclear Engineering, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE. / Includes bibliographical references. / by Francisco Javier Carrion. / M.S.

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Nuclear Engineering, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE. / Includes bibliographical references. / by Khaled Awni Touqan. / Ph.D.

<div>We further the research in o-minimal topology by studying in full generality definable topological spaces in o-minimal structures. These are topological spaces $(X, \tau)$, where $X$ is a definable set in an o-minimal structure and the topology $\tau$ has a basis that is (uniformly) definable. Examples include the canonical o-minimal "euclidean" topology, “definable spaces” in the sense of van den Dries [17], definable metric spaces [49], as well as generalizations of classical non-metrizable topological spaces such as the Split Interval and the Alexandrov Double Circle.</div><div><br></div><div>We develop a usable topological framework in our setting by introducing definable analogues of classical topological properties such as separability, compactness and metrizability. We characterize these notions, showing in particular that, whenever the underlying o-minimal structure expands $(\mathbb{R},<)$, definable separability and compactness are equivalent to their classical counterparts, and a similar weaker result for definable metrizability. We prove the equivalence of definable compactness and various other properties in terms of definable curves and types. We show that definable topological spaces in o-minimal expansions of ordered groups and fields have properties akin to first countability. Along the way we study o-minimal definable directed sets and types. We prove a density result for o-minimal types, and provide an elementary proof within o-minimality of a statement related to the known connection between dividing and definable types in o-minimal theories.</div><div><br></div><div>We prove classification and universality results for one-dimensional definable topological spaces, showing that these can be largely described in terms of a few canonical examples. We derive in particular that the three element basis conjecture of Gruenhage [25] holds for all infinite Hausdorff definable topological spaces in o-minimal structures expanding $(\mathbb{R},<)$, i.e. any such space has a definable copy of an interval with the euclidean, discrete or lower limit topology.</div><div><br></div><div>A definable topological space is affine if it is definably homeomorphic to a euclidean space. We prove affineness results in o-minimal expansions of ordered fields. This includes a result for Hausdorff one-dimensional definable topological spaces. We give two new proofs of an affineness theorem of Walsberg [49] for definable metric spaces. We also prove an affineness result for definable topological spaces of any dimension that are Tychonoff in a definable</div><div>sense, and derive that a large class of locally affine definable topological spaces are affine.</div>

Extending an explicit result from Bridson–Conder–Reid, this work provides an algorithm for distinguishing finite quotients between cocompact triangle groups Δ ?and lattices Γ of constant curvature symmetric 2-spaces. Much of our attention will be on when these lattices are Fuchsian groups. We prove that it will suffice to take a finite quotient that is Abelian, dihedral, a subgroup of PSL(<i>n</i>,<b>F</b>_<i>q</i>) (for an odd prime power q), or an Abelian extension of one of these 3 groups. For the latter case, we will require and develop an approach for creating group extensions upon a shared finite quotient of Δ? and Γ which between them have differing degrees of smoothness. Furthermore, on the order of a finite quotient that distinguishes between ?Δ and Γ, we are able to establish an effective upperbound that is superexponential depending on the cone orders appearing in each group.<br>