Contravariantly finite subcategories closed under predecessors

Let A be an Artin algebra and mod A be the category of finitely generated right A-modules. We prove that an additive full subcategory C of mod A closed under predecessors is contravariantly finite if and only if its right Ext-orthogonal is covariantly finite, or if and only if the Ext-injectives in C define a cotilting module (over the support algebra of C) or, equivalently, if and only if C is the support of the representable functors given by the Ext-injectives. (C) 2009 Elsevier Inc. All rights reserved.

Additional sensory information reduces body sway of individuals with anterior cruciate ligament injury

The purpose of this study was to investigate whether the additional sensory information could improve postural control in individuals with unilateral anterior cruciate ligament (ACL) injury. Twenty-eight individuals with unilateral ACL injury (mean age 23.6, 26 males, 2 females) and 28 healthy young control subjects (mean age 22.1 years, 26 males, 2 females) participated in this study. Postural control was evaluated with subjects single-leg standing on a force platform with eyes closed under two sensory conditions: normal sensory information and light touch to a stationary bar (applied force below 1 N). Three trials of 30 5 were performed in each single-leg stance and in each sensory condition. Mean sway amplitude and predominant frequency of center of pressure were calculated for both anterior-posterior and medial-lateral directions. Individuals with ACL injury showed greater mean sway amplitude than healthy control individuals even though the predominant frequency was similar for both groups. Additional sensory information improved postural control performance in individuals with ACL injury and healthy control, with a greater effect observed for the ACL group. Based on these results, we suggest that reduction in postural control performance in individuals with ACL injury would be due to the reduction of sensory information provided by the ACL, but when sensory information is enhanced, postural control performance improves. These results have implications for novel approaches to improve stability in individuals with ACL injury. (c) 2008 Elsevier Ireland Ltd. All rights reserved.

Factoriality and the pin-reutenauer procedure

We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. We prove that, under relatively simple hypotheses on a pseudovariety V of semigroups, the finitely generated free algebra for the largest such signature is closed under taking factors within the free pro-V semigroup on the same set of generators. Furthermore, we show that the natural analogue of the Pin-Reutenauer descriptive procedure for the closure of a rational language in the free group with respect to the profinite topology holds for the pseudovariety of all finite semigroups. As an application, we establish that a pseudovariety enjoys this property if and only if it is full.

Numbers and Languages

The thesis presents results obtained during the authors PhD-studies. First systems of language equations of a simple form consisting of just two equations are proved to be computationally universal. These are systems over unary alphabet, that are seen as systems of equations over natural numbers. The systems contain only an equation X+A=B and an equation X+X+C=X+X+D, where A, B, C and D are eventually periodic constants. It is proved that for every recursive set S there exists natural numbers p and d, and eventually periodic sets A, B, C and D such that a number n is in S if and only if np+d is in the unique solution of the abovementioned system of two equations, so all recursive sets can be represented in an encoded form. It is also proved that all recursive sets cannot be represented as they are, so the encoding is really needed. Furthermore, it is proved that the family of languages generated by Boolean grammars is closed under injective gsm-mappings and inverse gsm-mappings. The arguments apply also for the families of unambiguous Boolean languages, conjunctive languages and unambiguous languages. Finally, characterizations for morphisims preserving subfamilies of context-free languages are presented. It is shown that the families of deterministic and LL context-free languages are closed under codes if and only if they are of bounded deciphering delay. These families are also closed under non-codes, if they map every letter into a submonoid generated by a single word. The family of unambiguous context-free languages is closed under all codes and under the same non-codes as the families of deterministic and LL context-free languages.

An Eigenfunction Approach for Volatility Modeling.

In this paper, we introduce a new approach for volatility modeling in discrete and continuous time. We follow the stochastic volatility literature by assuming that the variance is a function of a state variable. However, instead of assuming that the loading function is ad hoc (e.g., exponential or affine), we assume that it is a linear combination of the eigenfunctions of the conditional expectation (resp. infinitesimal generator) operator associated to the state variable in discrete (resp. continuous) time. Special examples are the popular log-normal and square-root models where the eigenfunctions are the Hermite and Laguerre polynomials respectively. The eigenfunction approach has at least six advantages: i) it is general since any square integrable function may be written as a linear combination of the eigenfunctions; ii) the orthogonality of the eigenfunctions leads to the traditional interpretations of the linear principal components analysis; iii) the implied dynamics of the variance and squared return processes are ARMA and, hence, simple for forecasting and inference purposes; (iv) more importantly, this generates fat tails for the variance and returns processes; v) in contrast to popular models, the variance of the variance is a flexible function of the variance; vi) these models are closed under temporal aggregation.

A study on semigroup action on fuzzy subsets, inverse fuzzy automata and related topics

This thesis comprises five chapters including the introductory chapter. This includes a brief introduction and basic definitions of fuzzy set theory and its applications, semigroup action on sets, finite semigroup theory, its application in automata theory along with references which are used in this thesis. In the second chapter we defined an S-fuzzy subset of X with the extension of the notion of semigroup action of S on X to semigroup action of S on to a fuzzy subset of X using Zadeh's maximal extension principal and proved some results based on this. We also defined an S-fuzzy morphism between two S-fuzzy subsets of X and they together form a category S FSETX. Some general properties and special objects in this category are studied and finally proved that S SET and S FSET are categorically equivalent. Further we tried to generalize this concept to the action of a fuzzy semigroup on fuzzy subsets. As an application, using the above idea, we convert a _nite state automaton to a finite fuzzy state automaton. A classical automata determine whether a word is accepted by the automaton where as a _nite fuzzy state automaton determine the degree of acceptance of the word by the automaton. 1.5. Summary of the Thesis 17 In the third chapter we de_ne regular and inverse fuzzy automata, its construction, and prove that the corresponding transition monoids are regular and inverse monoids respectively. The languages accepted by an inverse fuzzy automata is an inverse fuzzy language and we give a characterization of an inverse fuzzy language. We study some of its algebraic properties and prove that the collection IFL on an alphabet does not form a variety since it is not closed under inverse homomorphic images. We also prove some results based on the fact that a semigroup is inverse if and only if idempotents commute and every L-class or R-class contains a unique idempotent. Fourth chapter includes a study of the structure of the automorphism group of a deterministic faithful inverse fuzzy automaton and prove that it is equal to a subgroup of the inverse monoid of all one-one partial fuzzy transformations on the state set. In the fifth chapter we define min-weighted and max-weighted power automata study some of its algebraic properties and prove that a fuzzy automaton and the fuzzy power automata associated with it have the same transition monoids. The thesis ends with a conclusion of the work done and the scope of further study.

Systems of Parallel Communicating Restarting Automata

In der vorliegenden Dissertation werden Systeme von parallel arbeitenden und miteinander kommunizierenden Restart-Automaten (engl.: systems of parallel communicating restarting automata; abgekürzt PCRA-Systeme) vorgestellt und untersucht. Dabei werden zwei bekannte Konzepte aus den Bereichen Formale Sprachen und Automatentheorie miteinander vescrknüpft: das Modell der Restart-Automaten und die sogenannten PC-Systeme (systems of parallel communicating components). Ein PCRA-System besteht aus endlich vielen Restart-Automaten, welche einerseits parallel und unabhängig voneinander lokale Berechnungen durchführen und andererseits miteinander kommunizieren dürfen. Die Kommunikation erfolgt dabei durch ein festgelegtes Kommunikationsprotokoll, das mithilfe von speziellen Kommunikationszuständen realisiert wird. Ein wesentliches Merkmal hinsichtlich der Kommunikationsstruktur in Systemen von miteinander kooperierenden Komponenten ist, ob die Kommunikation zentralisiert oder nichtzentralisiert erfolgt. Während in einer nichtzentralisierten Kommunikationsstruktur jede Komponente mit jeder anderen Komponente kommunizieren darf, findet jegliche Kommunikation innerhalb einer zentralisierten Kommunikationsstruktur ausschließlich mit einer ausgewählten Master-Komponente statt. Eines der wichtigsten Resultate dieser Arbeit zeigt, dass zentralisierte Systeme und nichtzentralisierte Systeme die gleiche Berechnungsstärke besitzen (das ist im Allgemeinen bei PC-Systemen nicht so). Darüber hinaus bewirkt auch die Verwendung von Multicast- oder Broadcast-Kommunikationsansätzen neben Punkt-zu-Punkt-Kommunikationen keine Erhöhung der Berechnungsstärke. Desweiteren wird die Ausdrucksstärke von PCRA-Systemen untersucht und mit der von PC-Systemen von endlichen Automaten und mit der von Mehrkopfautomaten verglichen. PC-Systeme von endlichen Automaten besitzen bekanntermaßen die gleiche Ausdrucksstärke wie Einwegmehrkopfautomaten und bilden eine untere Schranke für die Ausdrucksstärke von PCRA-Systemen mit Einwegkomponenten. Tatsächlich sind PCRA-Systeme auch dann stärker als PC-Systeme von endlichen Automaten, wenn die Komponenten für sich genommen die gleiche Ausdrucksstärke besitzen, also die regulären Sprachen charakterisieren. Für PCRA-Systeme mit Zweiwegekomponenten werden als untere Schranke die Sprachklassen der Zweiwegemehrkopfautomaten im deterministischen und im nichtdeterministischen Fall gezeigt, welche wiederum den bekannten Komplexitätsklassen L (deterministisch logarithmischer Platz) und NL (nichtdeterministisch logarithmischer Platz) entsprechen. Als obere Schranke wird die Klasse der kontextsensitiven Sprachen gezeigt. Außerdem werden Erweiterungen von Restart-Automaten betrachtet (nonforgetting-Eigenschaft, shrinking-Eigenschaft), welche bei einzelnen Komponenten eine Erhöhung der Berechnungsstärke bewirken, in Systemen jedoch deren Stärke nicht erhöhen. Die von PCRA-Systemen charakterisierten Sprachklassen sind unter diversen Sprachoperationen abgeschlossen und einige Sprachklassen sind sogar abstrakte Sprachfamilien (sogenannte AFL's). Abschließend werden für PCRA-Systeme spezifische Probleme auf ihre Entscheidbarkeit hin untersucht. Es wird gezeigt, dass Leerheit, Universalität, Inklusion, Gleichheit und Endlichkeit bereits für Systeme mit zwei Restart-Automaten des schwächsten Typs nicht semientscheidbar sind. Für das Wortproblem wird gezeigt, dass es im deterministischen Fall in quadratischer Zeit und im nichtdeterministischen Fall in exponentieller Zeit entscheidbar ist.

On fuzzy ideals and fuzzy filters of fuzzy lattices

In the literature there are several proposals of fuzzi cation of lattices and ideals concepts. Chon in (Korean J. Math 17 (2009), No. 4, 361-374), using the notion of fuzzy order relation de ned by Zadeh, introduced a new notion of fuzzy lattice and studied the level sets of fuzzy lattices, but did not de ne a notion of fuzzy ideals for this type of fuzzy lattice. In this thesis, using the fuzzy lattices de ned by Chon, we de ne fuzzy homomorphism between fuzzy lattices, the operations of product, collapsed sum, lifting, opposite, interval and intuitionistic on bounded fuzzy lattices. They are conceived as extensions of their analogous operations on the classical theory by using this de nition of fuzzy lattices and introduce new results from these operators. In addition, we de ne ideals and lters of fuzzy lattices and concepts in the same way as in their characterization in terms of level and support sets. One of the results found here is the connection among ideals, supports and level sets. The reader will also nd the de nition of some kinds of ideals and lters as well as some results with respect to the intersection among their families. Moreover, we introduce a new notion of fuzzy ideals and fuzzy lters for fuzzy lattices de ned by Chon. We de ne types of fuzzy ideals and fuzzy lters that generalize usual types of ideals and lters of lattices, such as principal ideals, proper ideals, prime ideals and maximal ideals. The main idea is verifying that analogous properties in the classical theory on lattices are maintained in this new theory of fuzzy ideals. We also de ne, a fuzzy homomorphism h from fuzzy lattices L and M and prove some results involving fuzzy homomorphism and fuzzy ideals as if h is a fuzzy monomorphism and the fuzzy image of a fuzzy set ~h(I) is a fuzzy ideal, then I is a fuzzy ideal. Similarly, we prove for proper, prime and maximal fuzzy ideals. Finally, we prove that h is a fuzzy homomorphism from fuzzy lattices L into M if the inverse image of all principal fuzzy ideals of M is a fuzzy ideal of L. Lastly, we introduce the notion of -ideals and - lters of fuzzy lattices and characterize it by using its support and its level set. Moreover, we prove some similar properties in the classical theory of - ideals and - lters, such as, the class of -ideals and - lters are closed under intersection. We also de ne fuzzy -ideals of fuzzy lattices, some properties analogous to the classical theory are also proved and characterize a fuzzy -ideal on operation of product between bounded fuzzy lattices L and M and prove some results.

Black hole partition function using the hybrid formalism of superstrings

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Algebraic geometric codes over rings

The techniques of algebraic geometry have been widely and successfully applied to the study of linear codes over finite fields since the early 1980's. Recently, there has been an increased interest in the study of linear codes over finite rings. In this thesis, we combine these two approaches to coding theory by introducing and studying algebraic geometric codes over rings.

Closed-loop model re-identification of processes under MPC with zone control

This work deals with a procedure for model re-identification of a process in closed loop with ail already existing commercial MPC. The controller considered here has a two-layer structure where the upper layer performs a target calculation based on a simplified steady-state optimization of the process. Here, it is proposed a methodology where a test signal is introduced in a tuning parameter of the target calculation layer. When the outputs are controlled by zones instead of at fixed set points, the approach allows the continuous operation of the process without an excessive disruption of the operating objectives as process constraints and product specifications remain satisfied during the identification test. The application of the method is illustrated through the simulation of two processes of the oil refining industry. (c) 2008 Elsevier Ltd. All rights reserved.

Stress responses of juvenile matrinxã (Brycon amazonicus) after transport in a closed system under different loading densities

Neste estudo, foram investigadas as densidades de carga adequadas para transporte de matrinxãs juvenis em sistema fechado com sacos plásticos. O transporte de 4h foi feito com peixes (23,5±0,4g; 11,6 (0,08cm) em jejum por 24h, em densidades de 83g L-1 (D1), 125g L-1 (D2), 168g L-1 (D3) e 206g L-1 (D4). Os peixes foram amostrados antes do transporte (AT), logo após o transporte (chegada) (DT) e 24h depois. A qualidade da água foi monitorada antes da captura dos peixes nos tanques de depuração, após o transporte nos sacos plásticos e nos tanques de recuperação. O oxigênio da água diminuiu para valores inferiores a 4mg L-1 em D2, D3 e D4, a temperatura esteve em torno de 32°C, pH 6,5-6,78, a amônia total foi de 1,09-1,7mg L-1, a amônia não-ionizada foi de 3,58-9,33 x 10³mg L-1 e alcalinidade 134-165mg CaCO3 L-1. O cortisol plasmático e a glicose sanguínea aumentaram após o transporte nos peixes em todas as densidades ensaiadas, voltando aos valores controle 24h depois. Os valores de osmolaridade não mudaram logo após o transporte, mas aumentaram 24h depois de modo igual em todas as densidades. O cloreto plasmático diminuiu na chegada, de modo inversamente proporcional à densidade de carga. O hematócrito diminuiu 24h depois da chegada dos peixes, em todas as densidades testadas, mas não houve diferença no número de eritrócitos. Não houve mortalidade até uma semana após o transporte. O matrinxã mostrou ser uma espécie tolerante a altas densidades de carga em embalagens para transporte além de suportar baixos níveis de oxigênio na água.

Activation of Selected Shoulder Muscles During Unilateral Wall and Bench Press Tasks Under Submaximal Isometric Effort

STUDY DESIGN: Controlled laboratory study. OBJECTIVE: To assess the activation of 7 shoulder muscles under 2 closed kinetic chain (CKC) tasks for the upper extremity using submaximal isometric effort, thus providing relative quantification of muscular isometric effort for these muscles across the CKC exercises, which may be applied to rehabilitation protocols for individuals with shoulder weakness. BACKGROUND: CKC exercises favor joint congruence, reduce shear load, and promote joint dynamic stability. Additionally, knowledge about glenohumeral and periscapular muscle activity elicited during CKC exercises may help clinicians to design protocols for shoulder rehabilitation. METHODS: Using surface electromyography, activation level was measured across 7 shoulder muscles in 20 healthy males, during the performance of a submaximal isometric wall press and bench press. Signals were normalized to the maximal voluntary isometric contraction, and, using paired t tests, data were analyzed between the exercises for each muscle. RESULTS: Compared to the wall press, the bench press elicited higher activity for most muscles, except for the upper trapezius. Levels of activity were usually low but were above 20% maximal voluntary isometric contraction for the serratus anterior on both tasks, and for the long head triceps brachii on the bench press. CONCLUSIONS: Both the bench press and wall press, as performed in this study, led to relatively low EMG activation levels for the muscles measured and may be considered for use in the early phases of rehabilitation. J Ort hop Sports Phys Ther 2011;41(7):520-525, Epub 2 February 2011. doi:10.2519/jospt.2011.3418

From efficiency to optimality in proportional reinsurance under group correlation

Based on our recent discovery of closed form formulae of efficient Mean Variance retentions in variable quota-share proportional reinsurance under group correlation, we analyzed the influence of different combination of correlation and safety loading levels on the efficient frontier, both in a single period stylized problem and in a multiperiod one.