• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 48
  • 30
  • 22
  • 7
  • 3
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 134
  • 27
  • 26
  • 21
  • 21
  • 17
  • 16
  • 11
  • 11
  • 11
  • 10
  • 10
  • 9
  • 9
  • 8
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
21

Scalable Integration View Computation and Maintenance with Parallel, Adaptive and Grouping Techniques

Liu, Bin 19 August 2005 (has links)
" Materialized integration views constructed by integrating data from multiple distributed data sources help to achieve better access, reliable performance, and high availability for a wide range of applications. In this dissertation, we propose parallel, adaptive, and grouping techniques to address scalability challenges in high-performance integration view computation and maintenance due to increasingly large data sources and high rates of source updates. State-of-the-art parallel integration view computation makes the common assumption that the maximal pipelined parallelism leads to superior performance. We instead propose segmented bushy parallel processing that combines pipelined parallelism with alternate forms of parallelism to achieve an overall more effective strategy. Experimental studies conducted over a cluster of high-performance PCs confirm that the proposed strategy has an on average of 50\% improvement in terms of total processing time in comparison to existing solutions. Run-time adaptation becomes critical for parallel integration view computation due to its long running and memory intensive nature. We investigate two types of state level adaptations, namely, state spill and state relocation, to address the run-time memory shortage. We propose lazy-disk and active-disk approaches that integrate both adaptations to maximize run-time query throughput in a memory constrained environment. We also propose global throughput-oriented state adaptation strategies for computation plans with multiple state intensive operators. Extensive experiments confirm the effectiveness of our proposed adaptation solutions. Once results have been computed and materialized, it's typically more efficient to maintain them incrementally instead of full recomputation. However, state-of-the-art incremental view maintenance require O($n^2$) maintenance queries with n being the number of data sources that the view is defined upon. Moreover, they do not exploit view definitions and data source processing capabilities to further improve view maintenance performance. We propose novel grouping maintenance algorithms that dramatically reduce the number of maintenance queries to (O(n)). A cost-based view maintenance framework has been proposed to generate optimized maintenance plans tuned to particular environmental settings. Extensive experimental studies verify the effectiveness of our maintenance algorithms as well as the maintenance framework. "
22

Modélisation spatio-temporelle pour l'esca de la vigne à l'échelle de la parcelle / Spatio-temporal modelling of esca grapevine disease at vineyard scale

Li, Shuxian 16 December 2015 (has links)
L'esca de la vigne fait partie des maladies de dépérissement incurables dont l'étiologie n'est pas complément élucidée. Elle représente un des problèmes majeurs en viticulture. L'objectif général de cette thèse est d'améliorer la compréhension des processus épidémiques et des facteurs de risque. Pour ce faire, nous avons mené une étude quantitative du développement spatio-temporel de l'esca à l'échelle de la parcelle. Dans un premier temps, pour détecter d'éventuelles corrélations spatiales entre les cas de maladie, des tests statistiques non paramétriques sont appliqués aux données spatio-temporelles d'expression foliaires de l'esca pour 15 parcelles du bordelais. Une diversité de profils spatiaux, allant d'une distribution aléatoire à fortement structurée est trouvée. Dans le cas de structures très agrégées, les tests n'ont pas montré d'augmentation significative de la taille des foyers, ni de propagation secondaire locale à partir de ceps symptomatiques, suggérant un effet de l'environnement dans l'explication de cette agrégation. Dans le but de modéliser l'occurrence des symptômes foliaires, nous avons développé des modèles logistiques hiérarchiques intégrant à la fois des covariables exogènes liées à l'environnement et des covariables de voisinage de ceps déjà malades mais aussi un processus latent pour l'auto-corrélation spatio-temporelle. Les inférences bayésiennes sont réalisées en utilisant la méthode INLA (Inverse Nested Laplace Approximation). Les résultats permettent de conforter l'hypothèse du rôle significatif des facteurs environnementaux dans l'augmentation du risque d'occurrence des symptômes. L'effet de propagation de l'esca à petite échelle à partir de ceps déjà atteints situés sur le rang ou hors rang n'est pas montré. Un modèle autologistique de régression, deux fois centré, qui prend en compte de façon plus explicite la structure spatio-temporelle de voisinage, est également développé. Enfin, une méthode géostatistique d'interpolation de données de nature anisotropique atypique est proposée. Elle permet d'interpoler la variable auxiliaire de résistivité électrique du sol pour estimer à l'échelle de chaque plante de la parcelle, la réserve en eau du sol disponible pour la vigne. Les méthodes géostatistique et spatio-temporelles développées dans cette thèse ouvrent des perspectives pour identifier les facteurs de risques et prédire le développement de l'esca de la vigne dans des contextes agronomiques variés. / Esca grapevine disease is one of the incurable dieback disease with the etiology not completely elucidated. It represents one of the major threats for viticulture around the world. To better understand the underlying process of esca spread and the risk factors of this disease, we carried out quantitative analyses of the spatio-temporal development of esca at vineyard scale. In order to detect the spatial correlation among the diseased vines, the non-parametric statistical tests were applied to the spatio-temporal data of esca foliar symptom expression for 15 vineyards in Bordeaux region. Among vineyards, a large range of spatial patterns, from random to strongly structured, were found. In the vineyards with strongly aggregated patterns, no significant increase in the size of cluster and local spread from symptomatic vines was shown, suggesting an effect of the environment in the explanation of this aggregation. To model the foliar symptom occurrence, we developed hierarchical logistic regression models by integrating exogenous covariates, covariates of neighboring symptomatic vines already diseased, and also a latent process with spatio-temporal auto-correlation. The Bayesian inferences of these models were performed by INLA (Inverse Nested Laplace Approximation) approach. The results confirmed the effect of environmental factors on the occurrence risk of esca symptom. The secondary locally spread of esca from symptomatic vines located on the same row or out of row was not shown. A two-step centered auto-logistic regression model, which explicitly integrated the spatio-temporal neighboring structure, was also developed. At last, a geostatistical method was proposed to interpolate data with a particular anisotropic structure. It allowed interpolating the ancillary variable, electrical resistivity of soil, which were used to estimate the available soil water content at vine-scale. These geostatistical methods and spatio-temporal statistical methods developed in this thesis offered outlook to identify risk factors, and thereafter to predict the development of esca grapevine disease in different agronomical contexts.
23

Junção de conjuntos por similaridade explorando paralelismo multinível em GPUs / Set similarity joins exploring multilevel parallelism on GPUs

Ribeiro Junior, Sidney 29 August 2017 (has links)
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2017-10-05T11:30:17Z No. of bitstreams: 2 Dissertação - Sidney Ribeiro Junior - 2017.pdf: 1832065 bytes, checksum: 41b96bdea09ea7b5ddb6551265e0622b (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-10-05T11:30:38Z (GMT) No. of bitstreams: 2 Dissertação - Sidney Ribeiro Junior - 2017.pdf: 1832065 bytes, checksum: 41b96bdea09ea7b5ddb6551265e0622b (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2017-10-05T11:30:38Z (GMT). No. of bitstreams: 2 Dissertação - Sidney Ribeiro Junior - 2017.pdf: 1832065 bytes, checksum: 41b96bdea09ea7b5ddb6551265e0622b (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2017-08-29 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / Similarity Join is an important operation for information retrieval, near duplicate detection, data analysis etc. State-of-the-art algorithms for similarity join use a technique known as prefix filtering to reduce the amount of sets to be entirely compared by previously discarding dissimilar sets. However, prefix filtering is only effective when looking for very similar data. An alternative to speedup the similarity join when prefix filtering is not efficient is to explore parallelism. In this work we developed three multi-level fine-grained parallel algorithms for many-core architectures (such as modern Graphic Processing Units) to solve the similarity join problem. The proposed algorithms have shown speedup gains of 109x and 17x when compared with sequential (ppjoin) and parallel (fgssjoin) state-of-the-art solutions, respectively, on standard real text databases. / A Junção por Similaridade é uma operação importante no contexto de recuperação da informação, identificação de duplicatas, análise de dados etc. Os algoritmos do estado da arte que realizam a junção por similaridade utilizam uma técnica chamada filtragem por prefixo, que diminui a quantidade de pares a serem totalmente comparados ao descartar previamente pares dissimilares. No entanto, a filtragem por prefixo é eficaz apenas quando se deseja encontrar pares muito similares. Uma alternativa para melhorar o desempenho da junção por similaridade quando a filtragem por prefixo é ineficaz, é explorar paralelismo. Neste trabalho foram desenvolvidos três algoritmos com paralelismo multinível de granularidade fina para arquiteturas many-core (como as modernas Unidades de Processamento Gráfico) para resolver o problema da junção por similaridade. Os algoritmos desenvolvidos demonstraram ganhos de speedup de até 109x e 17x em relação às soluções do estado da arte sequencial (ppjoin) e paralela (fgssjoin), respectivamente, quando executado sobre bases de dados textuais padrão reais.
24

Parallelizing Set Similarity Joins

Fier, Fabian 24 January 2022 (has links)
Eine der größten Herausforderungen in Data Science ist heutzutage, Daten miteinander in Beziehung zu setzen und ähnliche Daten zu finden. Hierzu kann der aus relationalen Datenbanken bekannte Join-Operator eingesetzt werden. Das Konzept der Ähnlichkeit wird häufig durch mengenbasierte Ähnlichkeitsfunktionen gemessen. Um solche Funktionen als Join-Prädikat nutzen zu können, setzt diese Arbeit voraus, dass Records aus Mengen von Tokens bestehen. Die Arbeit fokussiert sich auf den mengenbasierten Ähnlichkeitsjoin, Set Similarity Join (SSJ). Die Datenmenge, die es heute zu verarbeiten gilt, ist groß und wächst weiter. Der SSJ hingegen ist eine rechenintensive Operation. Um ihn auf großen Daten ausführen zu können, sind neue Ansätze notwendig. Diese Arbeit fokussiert sich auf das Mittel der Parallelisierung. Sie leistet folgende drei Beiträge auf dem Gebiet der SSJs. Erstens beschreibt und untersucht die Arbeit den aktuellen Stand paralleler SSJ-Ansätze. Diese Arbeit vergleicht zehn Map-Reduce-basierte Ansätze aus der Literatur sowohl analytisch als auch experimentell. Der größte Schwachpunkt aller Ansätze ist überraschenderweise eine geringe Skalierbarkeit aufgrund zu hoher Datenreplikation und/ oder ungleich verteilter Daten. Keiner der Ansätze kann den SSJ auf großen Daten berechnen. Zweitens macht die Arbeit die verfügbare hohe CPU-Parallelität moderner Rechner für den SSJ nutzbar. Sie stellt einen neuen daten-parallelen multi-threaded SSJ-Ansatz vor. Der vorgestellte Ansatz ermöglicht erhebliche Laufzeit-Beschleunigungen gegenüber der Ausführung auf einem Thread. Drittens stellt die Arbeit einen neuen hoch skalierbaren verteilten SSJ-Ansatz vor. Mit einer kostenbasierten Heuristik und einem daten-unabhängigen Skalierungsmechanismus vermeidet er Daten-Replikation und wiederholte Berechnungen. Der Ansatz beschleunigt die Join-Ausführung signifikant und ermöglicht die Ausführung auf erheblich größeren Datenmengen als bisher betrachtete parallele Ansätze. / One of today's major challenges in data science is to compare and relate data of similar nature. Using the join operation known from relational databases could help solving this problem. Given a collection of records, the join operation finds all pairs of records, which fulfill a user-chosen predicate. Real-world problems could require complex predicates, such as similarity. A common way to measure similarity are set similarity functions. In order to use set similarity functions as predicates, we assume records to be represented by sets of tokens. In this thesis, we focus on the set similarity join (SSJ) operation. The amount of data to be processed today is typically large and grows continually. On the other hand, the SSJ is a compute-intensive operation. To cope with the increasing size of input data, additional means are needed to develop scalable implementations for SSJ. In this thesis, we focus on parallelization. We make the following three major contributions to SSJ. First, we elaborate on the state-of-the-art in parallelizing SSJ. We compare ten MapReduce-based approaches from the literature analytically and experimentally. Their main limit is surprisingly a low scalability due to too high and/or skewed data replication. None of the approaches could compute the join on large datasets. Second, we leverage the abundant CPU parallelism of modern commodity hardware, which has not yet been considered to scale SSJ. We propose a novel data-parallel multi-threaded SSJ. Our approach provides significant speedups compared to single-threaded executions. Third, we propose a novel highly scalable distributed SSJ approach. With a cost-based heuristic and a data-independent scaling mechanism we avoid data replication and recomputation. A heuristic assigns similar shares of compute costs to each node. Our approach significantly scales up the join execution and processes much larger datasets than all parallel approaches designed and implemented so far.
25

Packing Directed Joins

Williams, Aaron January 2004 (has links)
Edmonds and Giles conjectured that the maximum number of directed joins in a packing is equal to the minimum weight of a directed cut, for any weighted directed graph. This is a generalization of Woodall's Conjecture (which is still open). Schrijver found the first known counterexample to the Edmonds-Giles Conjecture, while Cornuejols and Guenin found the next two. In this thesis we introduce new counterexamples, and prove that all minimal counterexamples of a certain type have now been found.
26

Odměňování členů statutárních orgánů akciových společností / Remuneration of members of governing bodies of joint-stock companies

Vlček, Karel January 2015 (has links)
Remuneration of members of governing bodies of joint-stock companies The topic of this diploma thesis is the remuneration of members of the governing bodies of joint-stock companies under the Czech Business Corporations Act. Taking into consideration the tradition in the Czech Republic, I focused on joint-stock companies with the dualistic board system comprising of board of directors and supervisory board. This thesis mainly deals with the questions regarding the mandatory agreement on remuneration in the contract on performance of the office, the role of the general meeting and the new institute of subsidiary gratuitous office performance. In total, this thesis comprises of the introduction, six chapters, and the conclusion. The introduction is followed by the definition of basic terms, especially the definition of board member remuneration. The second chapter briefly introduces the corporate governance and focuses on the remuneration as a corporate governance instrument, which should contribute to the resolution of the agency problem between the shareholders and the management. The third chapter outlines the statutory regulation of remuneration within the contract on performance of the office and especially deals with the possibility of the agreement on remuneration outside the contract on performance of...
27

Prevalência de disfunção temporomandibular em pacientes com Síndrome de Moebius: aspectos clínicos e imaginológicos / Prevalence of temporomandibular disorders in patients with Moebius syndrome: Clinical and imaging

Felix, Valtuir Barbosa 06 July 2010 (has links)
A síndrome de Moebius (SM) é pouco freqüente e caracterizada por paralisia total ou parcial de certos pares cranianos, obrigatoriamente VI e VII, podendo associar-se a outras anormalidades. Clinicamente ocorre falta de expressão facial, hipoplasia da língua, micrognatia, lábio curto e maloclusão. Disfunção temporomandibular (DTM) não tem sido estudada em pacientes com SM. O objetivo deste estudo é conhecer a prevalência de DTM em pacientes com SM e comparar a incidência e tipo de DTM com um grupo controle. Para tanto, foi realizado um estudo clínico caso controle observacional randomizado, no Centro de Atendimento a Pacientes Especiais (CAPE) da Faculdade de Odontologia da Universidade de São Paulo (FOUSP), entre julho de 2007 e dezembro de 2009, que avaliou 101 pacientes divididos em dois grupos: Grupo de estudo (GE) composto por 36 pacientes com SM, sendo 16 do gênero masculino e 20 do gênero feminino, com idade média de 10,2 anos, variando de 3 a 18 anos de idade; e grupo controle (GC) composto por 65 pacientes sem SM e sem nenhuma deformidade crânio facial, sendo 36 do gênero masculino e 29 do gênero feminino, com idade média de 10,7 anos, variando entre 3 e 18 anos. Nossos resultados mostraram que dos 36 pacientes do GE, 20 tinham DTM ou sinal de DTM (bruxismo). Desses 20 pacientes com DTM, 15 realizaram tomografias computadorizadas de ATM (TCs). Dos 65 pacientes do GC, 8 tinham DTM ou sinal de DTM (bruxismo) e 6 concordaram em realizar as TCs. Foram obtidas imagens volumétricas multiplanares e 3D. As alterações morfológicas indicando processo degenerativo encontrado nos exames de imagem encontradas nos dois grupos foram semelhantes. Concluimos que DTM é mais freqüente em pacientes com SM e que o diagnóstico em idade tenra pode representar uma oportunidade de prevenção e tratamento precoce da doença evitando seqüelas futuras. Por esta razão a avaliação da ATM deve ser incluída no exame clínico odontológico rotineiro de pacientes com a SM. / Moebius syndrome (MS) is rare and characterized by partial or total paralysis of some cranial nerves, unavoidably VI and VII, and may be associated with other abnormalities. The clinical aspects include lack of facial expression, hypoplasia of the tongue, micrognathia, short lip and malocclusion. Temporomandibular Joint disorders (TMJ) has not been studied in patients with MS. The aim of this study is to assess the prevalence of TJD in patients with MS and to compare the incidence and type of TMJ with a control group. We conducted a case-control randomized observational clinical study at the Special Care Dentistry Center, Dental School, University of São Paulo, between July 2007 and December 2009, which evaluated 101 patients divided into two groups: Study group (SG), composed of 36 patients with MS, 16 males and 20 females, mean age 10.2 years, ranging from 3 to18 years of age, and the control group (CG) composed of 65 patients without MS and with no craniofacial deformity, 36 male and 29 female, mean age 10.7 years, ranging between 3 and 18 years. Among 36 patients of the SG, 20 had TMJ. Among them, 15 were submitted to computed tomography (CT). Of the 65 CG patients, 8 had TMJ and 6 were submitted to CTs. Volumetric multiplanar and 3D images were obtained. The morphological changes of the TMJ demonstrating the pattern of the degenerative process found in patients with SM was similar to that found in people from control group. We concluded that the prevalence of TMJ in patients with MS is higher in SM patients and the diagnosis at an early age may represent an opportunity for prevention and early treatment of disease by avoiding future sequels. For this reason the evaluation of the TMJ should be included in routine clinical dental examination of patients with MS.
28

Operadores binários para consulta de similaridade em banco de dados multimídia / Binary operators in multimidia data base

Seraphim, Enzo 18 January 2006 (has links)
Os atuais gerenciadores de banco de dados não são adequados para manipulação de dados complexos; e entre eles destacamos os dados multimídia que, para agilizar as consultas usam a operação de igualdade sobre as estruturas de indexação.Operações de igualdade são pouco utilizadas em operações que envolvem dados complexos, uma vez que, a existência de dois elementos extremamente iguais é rara. Uma classe de operadores que se adequa melhor para manipulação desses dados são os operadores por similaridade. Exemplo de operadores de seleção por similaridade são a consulta por abrangência (range queries) e consulta aos vizinhos mais próximos. Exemplificando, o operador de seleção aos vizinhos mais próximos responde a consultas como, ?selecione as cinco proteínas mais parecidas pelo alinhamento da proteína Sparc (responsável pelo câncer de pele)?. Existem muitos trabalhos desenvolvidos no sentido de prover operadores de seleção por similaridade envolvendo estruturas baseadas em árvores. Entretanto, poucos estudos têm sido realizados envolvendo a utilização de operadores diferentes da seleção, por exemplo, a junção. Um operador de junção compara pares de objetos de elementos pertencentes ao domínio dos dados, ao passo que um operador de seleção recebe uma constante para a comparação dos elementos. Podemos ter assim, três operadores de junção por similaridade: operadores de junção por abrangência, por vizinhos mais próximos e sobre os pares de vizinhos mais próximos. Exemplificando, uma consulta utilizando junção por abrangência responde a consultas do tipo: ?Selecione as proteínas contidas no vírus da Hepatite B que diferem em até duas unidades de alinhamento das contidas no vírus da Hepatite C?. Este trabalho apresenta um novo método de acesso métrico em extrema quantidade de dados bem como, formas de implementação das formas de junção em estruturas métricas / The present databases managers are not adequated for complex data manipulation and among them we point out the multimedia data that to speed up the query use the equality operation on the index structure. Equality operations are not much used in operations that involve complex data sence the presence of two elements extremely equal is rare. An operator class that better manipulates these data are the similarity operators. Selection operators by similarity are the range query and the nearest neighbors query. For example, the selection operator to the nearest neighbors answers the queries like: ?select five proteins more similar by the alignment of the Sparc protein (responsible for the skin cancer)?. There are many works developed to provide similarity by selection operators envvolving structures based in trees. However, few studies have been done involving the use of different operators selection, for example, the join. A join operator compares pairs of objects of the elements belonging to the domain of the data, whereas a selection operator receives a constant to make the comparison of the elements. We can have three similarity join operators: the range join operators, the nearest neighbor and the closest neighbors pair. For instance, a query using the range join answers these kind of queries: ?Select the proteins restrained in the Hepatitis B virus that differ up to two unities from the alignment of the protein found in the Heapatitis C virus?. This work presents a new metric access method with an extreme amount of data as well as implementations forms of the join in metric structures
29

Acordo de voto: elementos e vinculação / Voting agreements: elements and binding effects.

Carvalho, Eduardo Henrique Pinto de 27 May 2013 (has links)
Esta dissertação procura analisar os acordos de acionistas tipificados pelo art. 118 da Lei nº 6.404/76, mais especificamente, os acordos que regulam o exercício do voto e/ou o exercício do poder de controle. O interesse pelo tema é decorrente da falta de consenso da doutrina e da jurisprudência acerca do assunto, o que contribuiu fortemente para a insegurança jurídica no uso do instituto. Além disso, tal falta de consenso foi acentuada com a reforma da lei acionária pela Lei nº 10.303/01. Dessa forma, o presente trabalho busca, a partir da análise da doutrina pátria e da doutrina estrangeira, delimitar corretamente os principais conceitos acerca do acordo de voto. Com este objetivo, o presente trabalho começa com a análise das características históricas das sociedades anônimas, focada na definição de competência e interação entre os órgãos da companhia, resultando na conclusão de que no direito brasileiro, não há uma divisão fixa de competências entre os órgãos e há hierarquia entre tais órgãos, prevalecendo a assembleia geral de acionistas. Nos demais capítulos, o presente trabalho analisa: (a) o conceito de partes, estabelecendo que apenas acionistas podem ser partes em acordo de votos, (b) o objeto, reconhecendo o exercício do direito de voto e o exercício do poder de controle como objetos legítimos, admitindo-se assim a diferenciação entre acordo de comando e acordo de defesa, (c) as delimitações do objeto, demonstrando que interesse social e abuso de poder de controle são dois fortes delineadores do conteúdo dos acordos de voto, e (d) os efeitos dos acordos de voto, especificamente os acordos de defesa e os acordos de comando, vez que podem irradiar efeitos para os órgãos administrativos da companhia. Espera-se que este trabalho possa contribuir com o debate acerca do tema acordo de voto. / This dissertation endeavors an investigation on shareholders agreements set forth by Article 118 of Federal Law N. 6,404/76, more precisely, shareholders agreements that regulates the exercise of voting rights and/or the control over the company. The interest for the subject developed in view of the nonexistence of an agreement on the matter, either by the legal doctrine or the case law. Furthermore, the dissensions were heightened by the modifications Federal Law N. 10,303/01 implemented to Federal Law N. 6,404/76. In this sense, the present study pursues to correctly circumscribe the main concepts regarding voting agreements, through an analysis of Brazilian and foreign legal doctrine. With such purpose, this work starts with an examination of historical characteristics of joint-stock corporations, focusing on the definition of the powers regarding each body of the company, and on the interaction between them, coming to the conclusion that, under Brazilian law, there is no fixed partition of powers between the bodies, but there is hierarchy between them, being the shareholders meeting the prevalent body. Moreover, this dissertation investigates: (a) the concept of parties, concluding that only shareholders can be parties in voting agreements; (b) the object of shareholders agreements, recognizing the exercise of voting rights and the control over the company as lawful objects, acknowledging, therefore, the difference between commanding agreements and defense agreements; (c) the delimitations of the object, demonstrating that social interest and abuse of control over the company are two main aspects that bound the content of voting agreements; and (d) the effects of shareholders agreements, more specifically, the commanding agreements and defense agreements, considering that they may be effective over administrative bodies of the company. This work is expected to contribute with the debate regarding the matter on voting agreements.
30

Impacto da doença articular referida na funcionalidade de idosos / The impact of referred joint disease to functionality in elderly

Leite, Francine 15 March 2013 (has links)
Introdução: As doenças articulares, frequentes entre idosos, estão relacionadas ao comprometimento funcional. Objetivo: Avaliar o impacto da doença articular referida no comprometimento funcional em idosos residentes na área urbana do município de São Paulo no período entre 2000 e 2006. Métodos: Este trabalho é parte do Estudo Saúde, Bem-Estar Envelhecimento (SABE). Foram estudados 336 idosos residentes na zona urbana do município de São de Paulo, entrevistados em 2000 e em 2006, representando 162.913 idosos do município. A variável dependente do estudo foi o desenvolvimento de comprometimento funcional e a variável independente foi a doença articular referida entre 2000 e 2006, adicionalmente com as covariáveis sociodemográficas e de saúde. A relação entre as variáveis foi analisada pelo teste de Rao Scot, seguida pelo modelo de regressão logística multinomial e os cálculos do risco atribuível. Considerou-se nível de significância de 5 por cento e intervalos de confiança de 95 por cento . Resultados: No período de 6 anos, observou-se uma incidência de 47,8 por cento de dificuldade de mobilidade e 7,3 por cento de desempenhar atividades de vida diária (AVDs). A doença articular não foi associada ao comprometimento funcional. O sexo feminino foi associado à dificuldade de mobilidade e a idade avançada (70 anos ou mais) e a baixa escolaridade (até 3 anos de estudo) foram associados à dificuldade de desempenho das AVDs. Na população, 9,2 por cento do comprometimento funcional foi atribuído à doença articular. Ainda, entre os idosos que relataram a doença articular, 30,1 por cento do comprometimento funcional foi atribuído a ela. Conclusões: Apesar do impacto da doença articular no comprometimento funcional da população ser representativo, a doença articular não foi associada à incidência de comprometimento funcional nesse estudo / Introduction: The joint disease, common among the elderly, are related to functional impairment. Objective: To evaluate the impact of referred joint disease to functional impairment among elderly living in the urban area of São Paulo between 2000 and 2006. Methods: This study is part of Health Well Being Aging Study (SABE study). We studied 336 elderly residents in the urban area of São Paulo, who were interviewed in 2000 and 2006, representing 162,913 seniors. The dependent variable was functional impairment and the independent variable was joint disease development between 2000 and 2006, in addition to the sociodemographic and health covariates. The association between variables was analyzed using Rao Scot test, followed by multinomial logistic regression model and attributable risk calculations. It was considered a significance level of 5 per cent and confidence interval of 95 per cent . Results: During the 6-year-period, the incidence of mobility impairment was 47.8 per cent and incidence of activities of daily living (ADLs) disability was 7.3 per cent . The joint disease was not associated with functional impairment. Being female was associated with difficulty in mobility difficulties and advanced age (up to 70 years old) and lower education (up to 3 years) were associated with difficulty in performing ADLs. Among population, 9.2 per cent of functional impairment was attributed to joint disease. Still, among the elderly who reported joint disease, 30.1 per cent of functional impairment was attributed to it. Conclusions: despite the expressive impact of joint disease on functional impairment, it was not associated with incidence of disability in this study.

Page generated in 0.0947 seconds