Made available in DSpace on 2016-04-26T20:30:26Z (GMT). No. of bitstreams: 1 Marcos Antonio Nepomuceno Feitosa.pdf: 798687 bytes, checksum: 06cd2ee0abb96c43331b9218f422e93d (MD5) Previous issue date: 2010-06-15 / This work treats about the constitutional limitations and presuppositions applied to the cumulative, non-cumulative and monophasic schemes of PIS and Cofins, from a review of the constitutional criteria pertaining to each scheme and the compatibility of the ordinary legislation with the standard of tax competence. To this end it was analyzed the concept of "revenue", of "non-cumulative" and of "section of the economical activity " adopted by the Constitution, that conflict with the used by the ordinary legislator, then pointing the main unconstitutionalities of each schemes in this work / O presente trabalho trata dos limites e pressupostos constitucionais aplicados aos regimes cumulativo, não cumulativo e monofásico do PIS e da Cofins, partindo de uma análise dos critérios constitucionais inerentes a cada um desses regimes e a compatibilidade da legislação ordinária com a norma de competência tributária. Para tanto, analisou-se o conceito de faturamento , de não cumulatividade e de setor da atividade econômica adotado pela Constituição, conflitando com o empregado pelo legislador ordinário, apontando em seguida as principais inconstitucionalidades de cada um dos regimes abordados neste trabalho

Opportunistic selection is a practically appealing technique that is often used in multi-node wireless systems such as scheduling and rate adaptation in cellular systems and opportunistic wireless local area networks, wireless sensor networks, cooperative communications, and vehicular networks. In it, each node maintains a local preference number called metric that is function of its channel gains, and the best node with the highest metric is selected. Identifying the best node is challenging as the information about a node's metric is available only locally at each node. In our work, we focus on the popular, simple, and low feedback timer scheme for selection. In it, each node sets a timer as a function of its metric and transmits a packet when the timer expires. The metric-to-timer mapping maps larger metric values to smaller timer values, which ensures that the best node's timer expires first. However, it can fail to select the best node if another node transmits a packet within D s of the transmission by the best node. In this thesis, we make three contributions to the design and understanding of the timer-based selection scheme. Firstly, we introduce feedback overhead-aware contention resolution in the timer-based selection scheme. The outcome is a novel selection scheme that is faster than the splitting scheme and more reliable than the timer-based selection scheme. We analyze and minimize the average time required by the scheme to select the best node. Secondly, we characterize the optimal metric-to-timer mapping when the number of nodes in the system is not known, as is the case in several practical deployments. When the prior distribution of the nodes is known, we propose an optimal mapping that maximizes the success probability averaged over the distribution on the number of nodes. When even the prior distribution is not known, we propose a robust mapping that maximizes the worst case average success probability over all possible probability distributions on the number of nodes. In both cases, we show that the timers can expire only at 0, D, 2D, ... in the optimal timer mapping. For the known prior case, we develop recursive techniques to effectively compute the optimal timer mapping for binomial and Poisson priors. Lastly, we consider a discrete rate adaptive system and design an optimal timer scheme to maximize the end-to-end performance measure of system throughput. We derive several novel, insightful results about the optimal mapping that culminate in an iterative algorithm to compute it. We show that the design of the selection scheme is intimately related to the rate adaptation rule and the selection policy used. In all cases, extensive benchmarking with several ad hoc schemes proposed in the literature shows the significant gains that the proposed designs can deliver.

We consider the problem of Adaptive Control of finite-dimensional, stable, Linear Time Invariant (LTI) plants. Amongst such plants, the subclass regarding which an upper bound on the order is not known or which are known to be nonminimum phase (zeros in the unstable region) pose formidable problems in their own right. On one hand, if an upper bound on the order of the plant is not known, adaptive control usually involves some form of order estimation. On the other hand, when the plant is allowed to be either minimum phase or nonminimum phase, the adaptive control problem, as is well-known, becomes considerably-less tractable. In this study, the class of unknown plants considered is such that no information is available on the upper bound of the plant order and, further, the plant may be either minimum phase or nonminimum phase. Albeit known to be stable, such plants throw myriads of challenges in the context of adaptive control. Adaptive control involving such plants has been addressed [79] in a Model Reference Adaptive Control (MRAC) framework. There, the inputs and outputs of the unknown plant are the only quantities available by measurement in terms of which any form of modeling of the unknown plant may be made. Inputs to the reference model have been taken from certain restricted classes of bounded signals. In particular, the three classes of inputs considered are piecewise continuous bounded functions which asymptotically approach • a nonzero constant, • a sinusoid, and • a sinusoid with a nonzero shift. Moreover, the control law is such that adaptation is carried out at specific instants separated by progressively larger intervals of time. The schemes there have been proved to be e-optimal in the sense of a suitably formulated optimality criterion. If, however, the reference model inputs be extended to the class of piecewise continuous bounded functions, that would compound the complexity of the adaptive control problem. Only one attempt [78] in adaptive control in such a setting has come to our notice. The problem there has been tackled by an application of the theory of Pade Approximations to time moments of an LTI system. Based on a time moments estimation procedure, a simple adaptive scheme for Single-Input Single-Output (SISO) systems with only a cascade compensator has been reported. The first chapter is essentially meant to ensure that the problem we seek to address in the field of adaptive control indeed has scope for research. Having defined Adaptive Control, we selectively scan through the literature on LTI systems, with focus on MRAC. We look out in particular for studies involving plants of which not much is known regarding their order and systems which are possibly nonminimum phase. We found no evidence to assert that the problem of adaptive control of stable LTI systems, not necessarily minimum phase and of unknown upper bound on the order, was explored enough, save two attempts involving SISO systems. Taking absence of evidence (of in-depth study) for evidence of absence, we make a case for the problem and formally state it. We preview the thesis. We set two targets before us in Chapter 2. The first is to review one of the existing procedures attacking the problem we intend to address. Since the approach is based on the notion of time moments of an LTI system, and as we are to employ Pade Approximations as a tool, we uncover these concepts to the limited extent of our requirement. The adaptive procedure, Plant Command Modifier Scheme (PCMS) [78], for SISO plants is reported in some detail. It stands supported on an algorithm specially designed to estimate the time moments of an LTI system given no more than its input and output. Model following there has been sought to be achieved by matching the first few time moments of the reference model by the corresponding ones of the overall compensated plant. The plant time moment estimates have been taken to represent the unknown plant. The second of the goals is to analyze PCMS critically so that it may serve as a forerunner to our work. We conclude the chapter after accomplishing these goals. In Chapter 3, we devise a time moment estimator for SISO systems from a perspective which is conceptually equivalent to, yet functionally different from, that appropriated in [78]. It is a recipe to obtain estimates of time moments of a system by computing time moment estimates of system input and output signals measured up to current time. Pade approximations come by handy for this purpose. The lacunae exposed by a critical examination of PCMS in Chapter 2 guide us to progressively refine the estimator. Infirmities in the control part of PCMS too have come to light on our probing into it. A few of these will be fixed by way of fabricating two exclusively cascade compensators. We encounter some more issues, traceable to the estimator, which need redressal. Instead of directly fine-tuning the estimator itself, as is the norm, we propose the idea of 'estimating' the lopsidedness of the estimator by using it on the fully known reference model. This will enable us to effect corrections and obtain admissible estimates. Next, we explore the possibility of incorporating feedback compensation in addition to the existing cascade compensation. With output error minimization in mind, we come up with three schemes in this category. In the process, we anticipate the risk of instability due to feedback and handle it by means of an instability preventer with an inbuilt instability detector. Extensive simulations with minimum and rionminimum phase unknown plants employing the various schemes proposed are presented. A systematic study of simulation results reveals a dyad of hierarchies of progressively enhanced overall performance. One is in the sequence of the proposed schemes and the other in going for matching more and more moments. Based on our experiments we pick one of the feedback schemes as the best. Chapter 4 is conceived of as a bridge between SISO and multivariable systems. A transition from SISO to Multi-Input Multi-Output (MIMO) adaptive control is not a proposition confined to the mathematics of dimension-enhancement. A descent from the MIMO to the SISO case is expected to be relatively simple, though. So to transit as smoothly and gracefully as possible, some issues have to be placed in perspective before exploring multivariable systems. We succinctly debate on the efforts in pursuit of the exact vis-a-vis the accurate, and their implications. We then set some notations and formulate certain results which serve to unify and simplify the development in the subsequent three chapters. We list a few standard results from matrix theory which are to be of frequent use in handling multivariable systems. We derive control laws for Single-Input Multi-Output (SIMO) systems in Chapter 5. Expectedly, SIMO systems display traits of observability and uncontrollability. Results of illustrative simulations are furnished. In Chapter 6, we formulate control laws for Multi-Input Single-Output (MISO) systems. Characteristics of unobservability and controllability stand out there. We present case studies. Before actually setting foot onto MIMO systems, we venture to conjecture on what to expect there. We work out all the cascade and feedback adaptive schemes for square and nonsquare MIMO systems in Chapter 7. We show that MIMO laws when projected to MISO, SIMO and SISO cases agree with the corresponding laws in the respective cases. Thus the generality of our treatment of MIMO systems over other multivariable and scalar systems is established. We report simulations of instances depicting satisfactory performance and highlight the limitations of the schemes in tackling the family of plants of unknown upper bound on the order and possibly nonminimum phase. This forms the culmination of our exercise which took off from the reported work involving SISO systems [78]. Up to the end of the 7th chapter, we are in pursuit of solutions for the problem as general as in §1.4. For SISO systems, with input restrictions, the problem has been addressed in [79]. The laws proposed there carry out adaptation only at certain discrete instants; with respect to a suitably chosen cost, the final laws are proved to be e>optimal. In Chapter 8, aided by initial suboptimal control laws, we finally devise two algorithms with continuous-time adaptation and prove their optimality. Simulations with minimum and nonminimum phase plants reveal the effectiveness of the various laws, besides throwing light on the bootstrapping and auto-rectifying features of the algorithms. In the tail-piece, we summarize the work and wind up matters reserved for later deliberation. As we critically review the present work, we decant the take-home message. A short note on applications followed by some loud thinking as a spin-off of this report will take us to finis.

L’augmentation de l’espérance de vie affecte les régimes de retraites français, fondés sur la répartition et la solidarité intergénérationnelle. Pour soutenir ce premier pilier de retraite, composé, pour un salarié du secteur privé, des régimes de base de la Sécurité sociale et des régimes complémentaires rendus légalement obligatoires de l’ARRCO et de l’AGIRC (pour les seuls salariés cadres), le recours à un deuxième pilier de retraite s’avère nécessaire. Fondé sur une gestion par capitalisation, ce pilier prend vie dans le cadre de l’entreprise. L’employeur décide de la portée de l’engagement souscrit à l’égard de son salarié : le versement d’une cotisation définie au cours de sa carrière ou celui d’une prestation viagère pendant sa retraite dont le montant est déterminé à l’avance. Si la création de régimes de retraite professionnelle relève de la liberté des entreprises, le législateur oriente leur action à travers un régime social et fiscal de faveur. Enfin, les régimes de retraite professionnelle entrent dans le champ du droit de la concurrence en vue de créer, au niveau européen, un marché unique des retraites professionnelles. Les retraites professionnelles se situent au carrefour de nombreux droits. Normes travaillistes, assurantielles, fiscales, commerciales, trouvent à s’appliquer aux côtés des dispositions des Codes de la sécurité sociale et de la mutualité. De leur articulation naissent des conflits. Leur résolution est la condition nécessaire à la création d’un cadre juridique propice au développement des retraites professionnelles. / The increase in life expectancy affects the French pension schemes, founded on principles of distribution and solidarity between generations. In order to support this first pillar of the retirement system, consisting both in a core Social Security program for employees in the private sector and in the legally mandatory supplementary schemes of ARRCO and AGIRC (only for executive-level employees), it has become necessary to turn to a second pillar. Based on management by capitalization, it becomes effective in the business framework. The employer determines the scope of the undertaking signed in favor of his employee: either the payment of a levy defined during the employee’s career or the payment of a lifetime benefit during his retirement, whose amount is determined in advance. While the creation of occupational pension schemes is up to the businesses, the legislature orients their initiatives towards a favorable social and fiscal scheme. Finally, occupational pension schemes are subject to competition law in order to create, at the European level, a unique market for occupational pension schemes. These schemes are at the crossroads of numerous branches of law. Labor law, insurance law, taw law, and commercial law are applicable along with the French “Code de la sécurité sociale” and the French “Code de la mutualité”. Conflicts stem from the linkage between all of these laws. Their resolution is the sine qua non condition to create a legal framework enabling occupational pension schemes to evolve.

<p>This study extends the existing literature on how social networks enhance the performance and sustainability of small enterprises. More specifically, the study isolates and investigates the mechanisms through which social capital helps with the growth and survival of MSMEs. The evidence presented in this study strongly suggests that an indigenous social network widely practiced in Ethiopia, the &ldquo / iqqub&rdquo / , contributes significantly to the start-up, survival and development of urban MSMEs.</p>

The objects studied in this thesis are families of cycles on schemes. A space — the Chow variety — parameterizing effective equidimensional cycles was constructed by Chow and van der Waerden in the first half of the twentieth century. Even though cycles are simple objects, the Chow variety is a rather intractable object. In particular, a good functorial description of this space is missing. Consequently, descriptions of the corresponding families and the infinitesimal structure are incomplete. Moreover, the Chow variety is not intrinsic but has the unpleasant property that it depends on a given projective embedding. A main objective of this thesis is to construct a closely related space which has a good functorial description. This is partly accomplished in the last paper. The first three papers are concerned with families of zero-cycles. In the first paper, a functor parameterizing zero-cycles is defined and it is shown that this functor is represented by a scheme — the scheme of divided powers. This scheme is closely related to the symmetric product. In fact, the scheme of divided powers and the symmetric product coincide in many situations. In the second paper, several aspects of the scheme of divided powers are discussed. In particular, a universal family is constructed. A different description of the families as multi-morphisms is also given. Finally, the set of k-points of the scheme of divided powers is described. Somewhat surprisingly, cycles with certain rational coefficients are included in this description in positive characteristic. The third paper explains the relation between the Hilbert scheme, the Chow scheme, the symmetric product and the scheme of divided powers. It is shown that the last three schemes coincide as topological spaces and that all four schemes are isomorphic outside the degeneracy locus. The last paper gives a definition of families of cycles of arbitrary dimension and a corresponding Chow functor. In characteristic zero, this functor agrees with the functors of Barlet, Guerra, Kollár and Suslin-Voevodsky when these are defined. There is also a monomorphism from Angéniol's functor to the Chow functor which is an isomorphism in many instances. It is also confirmed that the morphism from the Hilbert functor to the Chow functor is an isomorphism over the locus parameterizing normal subschemes and a local immersion over the locus parameterizing reduced subschemes — at least in characteristic zero. / QC 20100908

This dissertation studies the diversity multiplexing tradeoff and the capacity of wireless multiple-relay network. In part 1, we study the setup of the parallel Multi-Input Multi-Output (MIMO) relay network. An amplify-and-forward relaying scheme, Incremental Cooperative Beamforming, is introduced and shown to achieve the capacity of the network in the asymptotic case of either the number of relays or the power of each relay goes to infinity. In part 2, we study the general setup of multi-antenna multi-hop multiple- relay network. We propose a new scheme, which we call random sequential (RS), based on the amplify-and-forward relaying. Furthermore, we derive diversity- multiplexing tradeoff (DMT) of the proposed RS scheme for general single-antenna multiple-relay networks. It is shown that for single-antenna two-hop multiple- access multiple-relay (K > 1) networks (without direct link between the source(s) and the destination), the proposed RS scheme achieves the optimum DMT. In part 3, we characterize the maximum achievable diversity gain of the multi- antenna multi-hop relay network and we show that the proposed RS scheme achieves the maximum diversity gain. In part 4, RS scheme is utilized to investigate DMT of the general multi-antenna multiple-relay networks. First, we study the case of a multi-antenna full-duplex single-relay two-hop network, for which we show that the RS achieves the optimum DMT. Applying this result, we derive a new achievable DMT for the case of multi-antenna half-duplex parallel relay network. Interestingly, it turns out that the DMT of the RS scheme is optimum for the case of multi-antenna two parallel non-interfering half-duplex relays. Furthermore, we show that random unitary matrix multiplication also improves the DMT of the Non-Orthogonal AF relaying scheme in the case of a multi-antenna single relay channel. Finally, we study the general case of multi-antenna full-duplex relay networks and derive a new lower-bound on its DMT using the RS scheme. Finally, in part 5, we study the multiplexing gain of the general multi-antenna multiple-relay networks. We prove that the traditional amplify-forward relaying achieves the maximum multiplexing gain of the network. Furthermore, we show that the maximum multiplexing gain of the network is equal to the minimum vertex cut-set of the underlying graph of the network, which can be computed in polynomial time in terms of the number of network nodes. Finally, the argument is extended to the multicast and multi-access scenarios.

We propose multigrid methods for solving Hamilton-Jacobi-Bellman (HJB) and Hamilton-Jacobi-Bellman-Isaacs (HJBI) equations. The methods are based on the full approximation scheme. We propose a damped-relaxation method as smoother for multigrid. In contrast with policy iteration, the relaxation scheme is convergent for both HJB and HJBI equations. We show by local Fourier analysis that the damped-relaxation smoother effectively reduces high frequency error. For problems where the control has jumps, restriction and interpolation methods are devised to capture the jump on the coarse grid as well as during coarse grid correction. We will demonstrate the effectiveness of the proposed multigrid methods for solving HJB and HJBI equations arising from option pricing as well as problems where policy iteration does not converge or converges slowly.

This dissertation studies the diversity multiplexing tradeoff and the capacity of wireless multiple-relay network. In part 1, we study the setup of the parallel Multi-Input Multi-Output (MIMO) relay network. An amplify-and-forward relaying scheme, Incremental Cooperative Beamforming, is introduced and shown to achieve the capacity of the network in the asymptotic case of either the number of relays or the power of each relay goes to infinity. In part 2, we study the general setup of multi-antenna multi-hop multiple- relay network. We propose a new scheme, which we call random sequential (RS), based on the amplify-and-forward relaying. Furthermore, we derive diversity- multiplexing tradeoff (DMT) of the proposed RS scheme for general single-antenna multiple-relay networks. It is shown that for single-antenna two-hop multiple- access multiple-relay (K > 1) networks (without direct link between the source(s) and the destination), the proposed RS scheme achieves the optimum DMT. In part 3, we characterize the maximum achievable diversity gain of the multi- antenna multi-hop relay network and we show that the proposed RS scheme achieves the maximum diversity gain. In part 4, RS scheme is utilized to investigate DMT of the general multi-antenna multiple-relay networks. First, we study the case of a multi-antenna full-duplex single-relay two-hop network, for which we show that the RS achieves the optimum DMT. Applying this result, we derive a new achievable DMT for the case of multi-antenna half-duplex parallel relay network. Interestingly, it turns out that the DMT of the RS scheme is optimum for the case of multi-antenna two parallel non-interfering half-duplex relays. Furthermore, we show that random unitary matrix multiplication also improves the DMT of the Non-Orthogonal AF relaying scheme in the case of a multi-antenna single relay channel. Finally, we study the general case of multi-antenna full-duplex relay networks and derive a new lower-bound on its DMT using the RS scheme. Finally, in part 5, we study the multiplexing gain of the general multi-antenna multiple-relay networks. We prove that the traditional amplify-forward relaying achieves the maximum multiplexing gain of the network. Furthermore, we show that the maximum multiplexing gain of the network is equal to the minimum vertex cut-set of the underlying graph of the network, which can be computed in polynomial time in terms of the number of network nodes. Finally, the argument is extended to the multicast and multi-access scenarios.

Disertacijoje išnagrinėta trečiosios eilės vienmatė pseudoparabolinė lygtis su dviejų tipų nelokaliosiomis sąlygomis. Šiems uždaviniams spręsti sudarytos skirtuminės schemos, kurių stabilumas tiriamas, taikant skirtuminių operatorių su nelokaliosiomis sąlygomis spektro struktūrą. Trečiosios eilės vienmatėms ir dvimatėms pseudoparabolinėms lygtims su integralinėmis sąlygomis sudarytos ir išnagrinėtos padidinto tikslumo skirtuminės schemos. Išnagrinėta dvimatė pseudoparabolinė lygtis su nelokaliosiomis integralinėmis sąlygomis viena koordinačių kryptimi. Tokiam uždaviniui spręsti pritaikytas ir išnagrinėtas lokaliai vienmatis metodas, ištirtos šio metodo stabilumo sąlygos. Taip pat išnagrinėtos: trisluoksnės skirtuminės schemos vienmatei pseudoparabolinei lygčiai su įvairiomis, taip pat ir nelokaliosiomis, sąlygomis; trisluoksnių išreikštinių skirtuminių schemų stabilumo sąlygos. / The thesis analyzes the third-order one-dimensional pseudoparabolic equations with two types of nonlocal conditions. The stability of difference schemes for this problem was studied using the analysis of the spectrum structure of a difference operator with nonlocal conditions. The analysis of the increased accuracy difference schemes for third-order one-dimensional and two-dimensional pseudoparabolic equations with integral conditions has been made. The thesis considers a two-dimensional pseudoparabolic equation with nonlocal integral conditions in one coordinate direction. This problem was solved by a locally one-dimensional method. The stability of a difference scheme has been investigated based on the spectrum structure. The doctoral disertation investigates three-layer difference schemes for one-dimensional pseudoparabolic equations with various, including nonlocal, conditions. Also, the conditions for the stability of three-layer explicit difference schemes have been explored.