Abstract Elderly people are going to be a growing number in Europe. Between one third are going to be 60 years or older at 2025. For Sweden the situation is going to be similar. A reduced muscle function could lead to complications for the individual to perform daily tasks and will lead to a higher rate for falling and getting bone fractures. The positive sides are that for men and women there are a possibility for maintaining physical function and strength even in older years. The purpose of this study was to investigate the possibility of gaining strength in M. Quadriceps femoris among five elderly people. The training schedule followed over 6 weeks of time with training sessions twice a week, training the Quadriceps muscle with one set of each training session. The result shows that for the three people that completed the study, all of them managed to gain strength. Further the study examines resistance training comparing single and multiple sets. Is there any difference in gaining strength between training programs with single set training versus multiple sets training?

The LYM property of a finite standard graded poset is one of the central notions in Sperner theory. It is known that the product of two finite standard graded posets satisfying the LYM properties may not have the LYM property again. In 1974, Harper proved that if two finite standard graded posets satisfying the LYM properties also satisfy rank logarithmic concavities, then their product also satisfies these two properties. However, Harper's proof is rather non-intuitive. Giving a natural proof of Harper's theorem is one of the goals of this thesis. The main new result of this thesis is a characterization of rank-finite standard graded LYM posets that satisfy rank logarithmic concavities. With this characterization theorem, we are able to give a new, natural proof of Harper's theorem. In fact, we prove a strengthened version of Harper's theorem by weakening the finiteness condition to the rank-finiteness condition. We present some interesting applications of the main characterization theorem. We also give a brief history of Sperner theory, and summarize all the ingredients we need for the main theorem and its applications, including a new equivalent condition for the LYM property that is a key for proving our main theorem.

The LYM property of a finite standard graded poset is one of the central notions in Sperner theory. It is known that the product of two finite standard graded posets satisfying the LYM properties may not have the LYM property again. In 1974, Harper proved that if two finite standard graded posets satisfying the LYM properties also satisfy rank logarithmic concavities, then their product also satisfies these two properties. However, Harper's proof is rather non-intuitive. Giving a natural proof of Harper's theorem is one of the goals of this thesis. The main new result of this thesis is a characterization of rank-finite standard graded LYM posets that satisfy rank logarithmic concavities. With this characterization theorem, we are able to give a new, natural proof of Harper's theorem. In fact, we prove a strengthened version of Harper's theorem by weakening the finiteness condition to the rank-finiteness condition. We present some interesting applications of the main characterization theorem. We also give a brief history of Sperner theory, and summarize all the ingredients we need for the main theorem and its applications, including a new equivalent condition for the LYM property that is a key for proving our main theorem.

In this thesis the author develops techniques to study contact structures via Riemannian geometry. The main observation is a relation between characteristic surfaces of contact structures and zero sets of solutions to certain subelliptic PDEs. This relation makes it possible to derive, under a symmetry assumption, necessary and sufficient conditions for tightness of contact structures arising from a certain class of invariant curl eigenfields. Further, it has implications in the energy relaxation of this special class of fluid flows. Specifically, the author shows existence of an energy minimizing curl eigenfield which is orthogonal to an overtwisted contact structure. It provides a counterexample to the conjecture of Etnyre and Ghrist posed in their work on hydrodynamics of contact structures.

Conventional magnetic resonance (MR) imaging has been widely applied to clinical analysis studies due to its non-invasive property. Proton MR spectroscopy complements conventional MR imaging by enabling better lesion characterization. Thus, proton MR spectroscopy is used to assist in the differential diagnosis of intracranial pathologies. LCModel is a reliable and user-friendly post-processing tool which is used to analyse absolute concentrations in our thesis. Our phantom are solution of alanine (Ala), cytosolic amino acids (AAs), lactate (Lac), and n-acetyl aspartate (NAA) in a spherical flasks of glass. We used three basis sets with difference echo time (TE) to experiment. We also performed a retrospective study of subjects with brain abscesses referred during a span of 10 years. All subjects underwent conventional MR imaging and in vivo proton MR spectroscopy, and subjects are classified four groups according to the spectrum characteristics described in the literatures. In this thesis, phantom experiments as well as GAVA simulation are included for the basis sets comparison. Then, abscesses subjects are analyzed by LCModel using these basis sets and compared with clinical diagnosis. Our result shows that using GAVA simulation as the basis sets may provide better consistency among all metabolites and thus achieve more reliable quantification of magnetic resonance spectroscopy.

With the popularization of Internet and the wide use of electronic mails, the number of spam mails grows continuously. The matter has made e-mail users feel inconvenient. If e-mail servers can be integrated with data mining and artificial intelligence techniques and learn spam rules and filter out spam mails automatically, they will help every person who is bothered by spam mails to enjoy a clear e-mail environment. In this research, we propose an architecture called union defense to oppose against the spread of spam mails. Under the architecture, we need a rule-based data mining and artificial intelligence algorithm. Rough sets theory will be a good choice. Rough sets theory was proposed by Palwak, a logician living in Poland. It is a rule-based data mining and artificial intelligence algorithm and suitable to find the potential knowledge of inexact and incomplete data out. This research developed a spam filter based on rough sets theory. It can search for the characteristic rules of spam mails and can use these rules to filter out spam mails. This system set up by this research can be appended to most of existing e-mail servers. Besides, the system support Chinese, Japanese and Korean character sets and overcome the problem that most spam filters only can deal with English mails. We can develop a rule exchange approach between e-mail servers in the future works to realize union defense.

No description available.

Thesis (Ph. D.)--University of Hong Kong, 1989.

Let G be a graph and f be a function that maps V to {0,1,2, ..., diam(G)}. Let V+ be the set of all vertices such that f(v) is positive. If for every vertex v not in V+ there exists a vertex w in V+ such that the distance between v and w is at most f(w), then f is called a dominating broadcast of G. The cost of the broadcast f is the sum of the values f(v) over all vertices v in V. The minimum cost of a dominating broadcast is called the broadcast domination number of G. A subset S of V is a multipacking if, for every v in V and for every integer k which is at least 1 and at most rad(G), the set S contains at most k vertices at distance at most k from v. The multipacking number of G is the maximum cardinality of a multipacking of G. In the first part of the thesis, we describe how linear programming can be used to give a cubic algorithm to find the broadcast domination number and multipacking number of strongly chordal graphs. Next, we restrict attention to trees, and describe linear time algorithms to compute these numbers. Finally, we introduce k-broadcast domination and k-multipacking, develop the basic theory and give a bound for the 2-broadcast domination number of a tree in terms of its order. / Graduate

published_or_final_version / Education / Master / Master of Education