Direitos sociais e Bolsa Família na ordem constitucional brasileira: virtudes e fragilidades de um "meta-direito"

Apesar de uma Constituição carregada de direitos sociais visando à transformação da sociedade brasileira, foi somente a partir de 2003 que o país ganhou destaque internacional nas ações de combate à pobreza e desigualdade, tornando-se uma referência. O grande protagonista teria sido o Programa Bolsa Família (PBF), um programa de transferência de renda condicionada que, combinado aos direitos sociais, teria permitido o alívio imediato de situações de extrema pobreza, mas também o desenvolvimento do capital humano atingindo resultados positivos multidimensionais nos seus mais de 10 anos de existência. Tal processo iniciou um debate acerca da necessidade de institucionalizar o programa como uma política de Estado, que para alguns interlocutores significaria transformar o PBF em um “direito” aos moldes dos direitos sociais, impondo uma obrigação aos governos futuros. Diante disso, este trabalho busca identificar, do ponto de vista jurídico e comparado aos direitos sociais, quais as vantagens e desvantagens do PBF na sua configuração atual. Compondo o movimento que busca compreender o papel do direito nas políticas públicas, adotando uma abordagem intra e interdisciplinar, e uma perspectiva funcional; a reflexão é alicerçada em três “eixos”: a cidadania, a judicialização e a vinculação orçamentária. Esse “tripé” foi escolhido em função da estrutura constitucional acerca dos direitos sociais, que em uma leitura funcional representam uma obrigação de fazer ao Estado para a concretização de uma noção de cidadania abrangente; uma dotação orçamentária vinculativa, garantido que parte da receita será destinada a ações de cumprimento dessas obrigações; e os instrumentos para adjudicação, permitindo a exigência dessas ações estatais pelos cidadãos. Assim, este trabalho não buscar descrever ou tentar prescrever a natureza ou alcance das obrigações que a transformação do PBF em direito geraria ao Estado; mas sim refletir sobre as vantagens e desvantagens dessa eventual mudança do programa diante das características estruturais do país, do modelo de sociedade abstratamente desenhado na lei maior e de nossa cultura jurídica acerca dos direitos sociais.

Técnicas de controlo não-linear baseadas em Redes Neuronais: do algoritmo à implementação

O presente trabalho analisa soluções de controlo não-linear baseadas em Redes Neuronais e apresenta a sua aplicação a um caso prático, desde o algoritmo de treino até à implementação física em hardware. O estudo inicial do estado da arte da utilização das Redes Neuronais para o controlo leva à proposta de soluções iterativas para a definição da arquitectura das mesmas e para o estudo das técnicas de Regularização e Paragem de Treino Antecipada, através dos Algoritmos Genéticos e à proposta de uma forma de validação dos modelos obtidos. Ao longo da tese são utilizadas quatro malhas para o controlo baseado em modelos, uma das quais uma contribuição original, e é implementado um processo de identificação on-line, tendo por base o algoritmo de treino Levenberg-Marquardt e a técnica de Paragem de Treino Antecipada que permite o controlo de um sistema, sem necessidade de recorrer ao conhecimento prévio das suas características. O trabalho é finalizado com um estudo do hardware comercial disponível para a implementação de Redes Neuronais e com o desenvolvimento de uma solução de hardware utilizando uma FPGA. De referir que o trabalho prático de teste das soluções apresentadas é realizado com dados reais provenientes de um forno eléctrico de escala reduzida.

Meta, tracer - MOF with traceability

The following document proposes a traceability solution for model-driven development. There as been already previous work done in this area, but so far there has not been yet any standardized way for exchanging traceability information, thus the goal of this project developed and documented here is not to automatize the traceability process but to provide an approach to achieve traceability that follows OMG standards, making traceability information exchangeable between tools that follow the same standards. As such, we propose a traceability meta-model as an extension of MetaObject Facility (MOF)1. Using MetaSketch2 modeling language workbench, we present a modeling language for traceability information. This traceability information then can be used for tool cooperation. Using Meta.Tracer (our tool developed for this thesis), we enable the users to establish traceability relationships between different traceability elements and offer a visualization for the traceability information. We then demonstrate the benefits of using a traceability tool on a software development life cycle using a case study. We finalize by commenting on the work developed.

Bullying: a violência entre adolescentes em contexto escolar: uma meta-análise

O bullying diz respeito a um tipo de violência exercida entre pares em contexto escolar, quando um aluno agride o outro de modo repetitivo, sem razão, causando-lhe danos intencionalmente, havendo uma desigualdade de poder entre eles. A realidade é que os jovens de hoje são os adultos de amanhã, logo os condutores da sociedade onde vivem e o fato de estarem envolvidos em bullying, deixa-nos muito preocupados em relação ao futuro. A presente dissertação tem como objetivo descrever de que forma o fenómeno bullying tem expressão na população adolescente, em contexto escolar. Metodologicamente, recorremos à meta-análise para integrar os resultados de estudos já realizados sobre o bullying e extrair novas conclusões. Os resultados sugerem: a existência de alunos adolescentes envolvidos em bullying, inclusivamente nas escolas da Região Autónoma da Madeira; os tipos de bullying sinalizados como existentes são: o verbal, o físico, o sexual, o psicológico, o social e, ainda, o cyberbullying; as agressões mais frequentes são as físicas e as verbais; as agressões ocorrem maioritariamente nos recreios, sala de aula, corredores e cantina; os diferentes perfis dos envolvidos; as diversas consequências para os intervenientes; os variados modos de intervenção em bullying.

Meta-theories in research: positivism, postmodernism, and critical realism

No scholar or researcher is able to provide robust evidence that counters the scant reflection on metatheory – mostly ontology and epistemology – underlying management studies in general, and industrial marketing and purchasing research in particular. This paper is a contribution to the indispensable discussion of metatheoretical alternatives in research, and most importantly, the strengths and shortcomings thereof, and respective implications on research questions, objectives, and findings.

WAMM: wiki aided meta modelling

All over the world, organizations are becoming more and more complex, and there’s a need to capture its complexity, so this is when the DEMO methodology (Design and Engineering Methodology for Organizations), created and developed by Jan L. G. Dietz, reaches its potential, which is to capture the structure of business processes in a coherent and consistent form of diagrams with their respective grammatical rules. The creation of WAMM (Wiki Aided Meta Modeling) platform was the main focus of this thesis, and had like principal precursor the idea to create a Meta-Editor that supports semantic data and uses MediaWiki. This prototype Meta-Editor uses MediaWiki as a receptor of data, and uses the ideas created in the Universal Enterprise Adaptive Object Model and the concept of Semantic Web, to create a platform that suits our needs, through Semantic MediaWiki, which helps the computer interconnect information and people in a more comprehensive, giving meaning to the content of the pages. The proposed Meta-Modeling platform allows the specification of the abstract syntax i.e., the grammar, and concrete syntax, e.g., symbols and connectors, of any language, as well as their model types and diagram types. We use the DEMO language as a proofof-concept and example. All such specifications are done in a coherent and formal way by the creation of semantic wiki pages and semantic properties connecting them.

Implementação do algoritmo (RTM) para processamento sísmico em arquiteturas não convencionais

With the growth of energy consumption worldwide, conventional reservoirs, the reservoirs called "easy exploration and production" are not meeting the global energy demand. This has led many researchers to develop projects that will address these needs, companies in the oil sector has invested in techniques that helping in locating and drilling wells. One of the techniques employed in oil exploration process is the reverse time migration (RTM), in English, Reverse Time Migration, which is a method of seismic imaging that produces excellent image of the subsurface. It is algorithm based in calculation on the wave equation. RTM is considered one of the most advanced seismic imaging techniques. The economic value of the oil reserves that require RTM to be localized is very high, this means that the development of these algorithms becomes a competitive differentiator for companies seismic processing. But, it requires great computational power, that it still somehow harms its practical success. The objective of this work is to explore the implementation of this algorithm in unconventional architectures, specifically GPUs using the CUDA by making an analysis of the difficulties in developing the same, as well as the performance of the algorithm in the sequential and parallel version

Algoritmo evolutivo paralelo para o problema de atribuição de localidades a anéis em redes sonet/sdh

The telecommunications play a fundamental role in the contemporary society, having as one of its main roles to give people the possibility to connect them and integrate them into society in which they operate and, therewith, accelerate development through knowledge. But as new technologies are introduced on the market, increases the demand for new products and services that depend on the infrastructure offered, making the problems of planning of telecommunication networks become increasingly large and complex. Many of these problems, however, can be formulated as combinatorial optimization models, and the use of heuristic algorithms can help solve these issues in the planning phase. This paper proposes the development of a Parallel Evolutionary Algorithm to be applied to telecommunications problem known in the literature as SONET Ring Assignment Problem SRAP. This problem is the class NP-hard and arises during the physical planning of a telecommunication network and consists of determining the connections between locations (customers), satisfying a series of constrains of the lowest possible cost. Experimental results illustrate the effectiveness of the Evolutionary Algorithm parallel, over other methods, to obtain solutions that are either optimal or very close to it

Desenvolvimento de um modelo computacional para a ampliação do atendimento do Programa de Acessibilidade Especial Porta a Porta - PRAE

Worldwide, the demand for transportation services for persons with disabilities, the elderly, and persons with reduced mobility have increased in recent years. The population is aging, governments need to adapt to this reality, and this fact could mean business opportunities for companies. Within this context is inserted the Programa de Acessibilidade Especial porta a porta PRAE, a door to door public transportation service from the city of Natal-RN in Brazil. The research presented in this dissertation seeks to develop a programming model which can assist the process of decision making of managers of the shuttle. To that end, it was created an algorithm based on methods of generating approximate solutions known as heuristics. The purpose of the model is to increase the number of people served by the PRAE, given the available fleet, generating optimized schedules routes. The PRAE is a problem of vehicle routing and scheduling of dial-a-ride - DARP, the most complex type among the routing problems. The validation of the method of resolution was made by comparing the results derived by the model and the currently programming method. It is expected that the model is able to increase the current capacity of the service requests of transport

Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético

Techniques of optimization known as metaheuristics have achieved success in the resolution of many problems classified as NP-Hard. These methods use non deterministic approaches that reach very good solutions which, however, don t guarantee the determination of the global optimum. Beyond the inherent difficulties related to the complexity that characterizes the optimization problems, the metaheuristics still face the dilemma of xploration/exploitation, which consists of choosing between a greedy search and a wider exploration of the solution space. A way to guide such algorithms during the searching of better solutions is supplying them with more knowledge of the problem through the use of a intelligent agent, able to recognize promising regions and also identify when they should diversify the direction of the search. This way, this work proposes the use of Reinforcement Learning technique - Q-learning Algorithm - as exploration/exploitation strategy for the metaheuristics GRASP (Greedy Randomized Adaptive Search Procedure) and Genetic Algorithm. The GRASP metaheuristic uses Q-learning instead of the traditional greedy-random algorithm in the construction phase. This replacement has the purpose of improving the quality of the initial solutions that are used in the local search phase of the GRASP, and also provides for the metaheuristic an adaptive memory mechanism that allows the reuse of good previous decisions and also avoids the repetition of bad decisions. In the Genetic Algorithm, the Q-learning algorithm was used to generate an initial population of high fitness, and after a determined number of generations, where the rate of diversity of the population is less than a certain limit L, it also was applied to supply one of the parents to be used in the genetic crossover operator. Another significant change in the hybrid genetic algorithm is the proposal of a mutually interactive cooperation process between the genetic operators and the Q-learning algorithm. In this interactive/cooperative process, the Q-learning algorithm receives an additional update in the matrix of Q-values based on the current best solution of the Genetic Algorithm. The computational experiments presented in this thesis compares the results obtained with the implementation of traditional versions of GRASP metaheuristic and Genetic Algorithm, with those obtained using the proposed hybrid methods. Both algorithms had been applied successfully to the symmetrical Traveling Salesman Problem, which was modeled as a Markov decision process