Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 59 for “"decomposable"”.
-
Bishop's Condition Beta and Decomposable Operators
This thesis considers the notions of decomposable operators in the sense of C. Foias, and a certain analytic condition--called condition ((beta))--due to Errett Bishop. It is shown that the concepts are related, and that each can be used to study the other. In particular, it is shown how Bishop's …
-
Isomorphism classes of almost completely decomposable groups
… and isomorphism classes of almost completely decomposable groups. In Chapter 2 we introduce the concept of almost completely decomposable groups and sum up their most important facts. A local group is an almost completely decomposable group with a primary regulator quotient. A uniform group is …
-
Coset Types and Tight Subgroups of Almost Completely Decomposable Groups
A completely decomposable group is a direct sum of subgroups of the rationals. An almost completely decomposable group is a torsion free abelian group that contains a completely decomposable group as subgroup of finite index. Tight subgroups are maximal subgroups (with respect to set inclusion) …
-
GPU-based Lagrangian heuristic for multidimensional assignment problems with decomposable costs
… relaxation technique to solve the MAPs with decomposable costs. But the major contribution was an efficient parallelization of this algorithm on a graphics processing unit (GPU) based programming architecture. Bigger problems with larger data sets were solved by using multiple processors with …
-
Simplicial Complexes and a Partial Classification of Almost Completely Decomposable Torsion Free Abelian Groups
The thesis treats the problem of how different two quasi-isomorphic groups can be.
-
A distributional analysis of healthcare financing in a developing country : a Nigerian case study applying a decomposable Gini index
The policy motivation for this research is primarily to investigate how in the direct absence of significant third-party financing mechanisms and government subsidies, direct purchase of healthcare affects the relative abilities of households to meet their other financial obligations after paying …
-
Form, finance, and use over time
… of buildings as being comprised of nearly decomposable systems of different lifespans. A nearly decomposable system is a system in which the links and relationships between the elements of it are stronger than its relationships to the elements of other systems. Nearly decomposable systems …
-
Implementação de um algoritmo dual para a otimização de sistemas decomponíveis
This work deals with the optimization of decomposable systems. A decomposable mathematical programming problem is proposed ans its solution is achieved by means of dual coordination. Two basic concepts arising in large scale mathematical programming are used: outer linearization and relaxation. A …
-
representations of hecke algebra of type a
… In the second part, we give some examples of decomposable Specht modules for the Hecke algebra HC,−1(Sn). These modules are indexed by partitions of the form (a, 3, 1b), where a, b are even. Finally, we find a new family of decomposable Specht modules for FSn when char(F) = 2.
-
Generalized Rank Invariant : Structure, Möbius Inversion, and Persistence Diagram
… connected subposets. We prove that for interval-decomposable modules, this diagram faithfully recovers the barcode, thereby establishing the generalized rank as a complete invariant in tame settings.Several explicit examples, including zigzag modules and non-interval-decomposable cases, …
-
Combinatorial aspects of polytope slices
… PG C Rd be the edge polytope of G. We call PG decomposable if PG decomposes into integral polytopes PG+ and PG- via a hyperplane, and we give an algorithm which determines the decomposability of an edge polytope. Based on a sequence of papers by Ohsugi and Hibi, we prove that when PG is …
-
Decomposition of general queueing network models. An investigation into the implementation of hierarchical decomposition schemes of general closed queueing network models using the principle of minimum relative entropy subject to fully decomposable constraints.
… of minimum relative entropy given fully decomposable subset and aggregate utilization, mean queue length and flow-balance constraints. This principle is used, in conjuction with asymptotic connections to infinite capacity queues, to derive new closed form approximations for the …
-
ΠΟΛΥΚΡΙΤΗΡΙΑΚΗ ΑΡΙΣΤΟΠΟΙΗΣΗ ΑΠΟΣΥΝΘΕΣΙΜΟΥ ΚΑΤΑ LAGRANGE ΣΥΣΤΗΜΑΤΟΣ
… OF GROUP MULTIOBJECTIVE OPTIMIZATION OFLAGRANGE DECOMPOSABLE SYSTEM IN THE PROCESS OF PRODUCTION OF BENZENE. THE GENERAL CASE, IN WHICH THE LOCAL DECISION MAKERS OF SYBSYSTEMS GENERALLY USE THEIR OWN VIEWS TO WEIGH THE DIFFERENT CRITERIA IN RELATION TO THEIR CRITERIA AND ALLCONSTRAINTS ARE …
-
Self Dual Codes and the Indecomposable Building Blocks
<p>Just like prime numbers are to integers, indecomposable codes are to self dual codes. This paper gives an explicit listing of the first few families of binary self dual codes, up to length 16. Binary self dual codes that are decomposable are given as a composition of indecomposable codes. The …
-
Bayesian Optimization Algorithm: From Single Level to Hierarchy
… the basic BOA to solve problems that are not decomposable on a single level, but that can still be solved by decomposition over multiple levels of difficulty. Hierarchical BOA extends BOA by incorporating those features for robust and scalable optimization of hierarchically decomposable …
-
Reflexivity, elementary operators and cohomology
… lattice L which imply alg L , is strongly rank decomposable. Let S be either a reflexive subspace or a bimodule of a reflexive algebra. We find some conditions such that T has a rank one summand in S and S has strong rank decomposability. Let S ( L ) be the set of all operators on H that …
-
Time Series Learning With Probabilistic Network Composites
… multi-strategy learning. Its focus is on decomposable, concept learning problems for classification of spatiotemporal sequences. Systematic methods of task decomposition using attribute- driven methods, especially attribute partitioning, are investigated. This leads to a novel and …
-
Aspectos computacionais de um algoritmo primal de direções viáveis para sistemas decomponíveis
… algorithm is studied to optimize non-linear decomposable systems. In the course of these studies some known results are formalized and proved, and economical interpretations are developed. A criterion is derived to detect the different hability of the pertubation functions involved in the …
-
Combinatorial designs and their automorphism groups
… by Furedi that every Steiner triple system is decomposable into triangles. Although this conjecture is expected to remain open for some time, it is possible to prove it for a number of standard constructions. It is further shown that for sufficiently large <i>v</i>, the number of Steiner triple …
-
The Politics of Expertise and the Articulation of Authority in Democracy: Cognitive Style and Intelligibility in the Education of Problem-Solving and Professional Decision-Making in the Domain of Law
… the theorizing of what are referred to as “quasi-decomposable” problems. By “quasi-decomposable,” it is meant that the challenge of computational complexity is derived from the nature and character of discourse in which the demands of intelligent specification are necessarily deferred as an …
Page 1 of 3