To see the other types of publications on this topic, follow the link: Penalty function.
Dissertations / Theses on the topic 'Penalty function'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Penalty function.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Meini, Méndez Iván Fabio. "The penalty: function and requirements." Pontificia Universidad Católica del Perú, 2013. http://repositorio.pucp.edu.pe/index/handle/123456789/116002.
Full textAbstract:
Legitimacy of criminal sanction is originated on its own purposes pursued in a state governed by the Rule of Law. That legitimacy should include the penalty as well as security measures, bearing in mind that both are imposed to someone breaking a rule of conduct, and therefore, someone capable to do it. Reviewing penal capacity or criminal liability concepts is required because if penal capacity means the capacity to understand the reality and adjust the behavior to it, and if every legitimate criminal sanction have to be imposed to someone who have the capacity of break it, then security measures also have to be imposed only to people responsible, capable to understand rules and act in accordance. With regard to people not subject to criminal liability they are standing outside Criminal Law and punish them would be illegitimate. In this line, criminal liability should be seen not only as a crime assumption but also as a basic statement for any dialogue the state shall have with the citizens: at the level of crime itself, proceedings and sentence execution .La legitimación de la sanción penal se deriva de los fines que persigue en un Estado de derecho. Dicha legitimación debe abarcar tanto a la pena como a la medida de seguridad, y tener en cuenta que tanto la pena como la medida de seguridad se imponen a quien infringe una norma de conducta y, por tanto, a quien tiene capacidad para infringirla. Esto presupone revisar el concepto de capacidad penal o imputabilidad,pues si imputabilidad es capacidad para comprender la realidad y adecuar el comportamiento a dicha comprensión, y toda sanción penal legítima ha de imponerse a quien tiene dicha capacidad, también las medidas de seguridad han de ser impuestas solo a imputables. Los verdaderos inimputables son aquellos que están al margen del derecho penal y a quienes resulta ilegítimo imponer alguna sanción. En esta línea, la imputabilidad ha de ser vista no solo como presupuesto del delito, sino como presupuesto de cualquier diálogo que tenga el Estado con el ciudadano con respecto al delito, al proceso y a la ejecución de la pena.
2
Smith, Stephen Bevis. "Exact penalty function algorithms for constrained optimal control problems." Thesis, Imperial College London, 2011. http://hdl.handle.net/10044/1/7996.
Full text
3
Zhao, Xiaobing. "A Penalty Function-Based Dynamic Hybrid Shop Floor Control System." Diss., The University of Arizona, 2006. http://hdl.handle.net/10150/195300.
Full textAbstract:
To cope with dynamics and uncertainties, a novel penalty function-based hybrid, multi-agent shop floor control system is proposed in this dissertation. The key characteristic of the proposed system is the capability of adaptively distributing decision-making power across different levels of control agents in response to different levels of disturbance. The subordinate agent executes tasks based on the schedule from the supervisory level agent in the absence of disturbance. Otherwise, it optimizes the original schedule before execution by revising it with regard to supervisory level performance (via penalty function) and disturbance. Penalty function, mathematical programming formulations, and quantitative metrics are presented to indicate the disturbance levels and levels of autonomy. These formulations are applied to diverse performance measurements such as completion time related metrics, makespan, and number of late jobs. The proposed control system is illustrated, tested with various job shop problems, and benchmarked against other shop floor control systems. In today's manufacturing system, man still plays an important role together with the control system Therefore, better coordination of humans and control systems is an inevitable topic. A novel BDI agent-based software model is proposed in this work to replace the partial decision-making function of a human. This proposed model is capable of 1) generating plans in real-time to adapt the system to a changing environment, 2) supporting not only reactive, but also proactive decision-making, 3) maintaining situational awareness in human language-like logic to facilitate real human decision-making, and 4) changing the commitment strategy adaptive to historical performance. The general purposes human operator model is then customized and integrated with an automated shop floor control system to serve as the error detection and recovery system. This model has been implemented in JACK software; however, JACK does not support real-time generation of a plan. Therefore, the planner sub-module has been developed in Java and then integrated with the JACK. To facilitate integration of an agent, real-human, and the environment, a distributed computing platform based on DOD High Level Architecture has been used. The effectiveness of the proposed model is then tested in several scenarios in a simulated automated manufacturing environment.
4
Dew, M. C. "An exact penalty function algorithm for accurate optimisation of industrial problems." Thesis, University of Hertfordshire, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.353622.
Full text
5
Ozdaryal, Burak. "Exterior Penalty Approaches for Solving Linear Programming Problems." Thesis, Virginia Tech, 1999. http://hdl.handle.net/10919/33862.
Full textAbstract:
In this research effort, we study three exterior penalty function approaches for solving linear programming problems. These methods are an active set l2 penalty approach (ASL2), an inequality-equality based l2 penalty approach (IEL2), and an augmented Lagrangian approach (ALAG). Particular effective variants are presented for each method, along with comments and experience on alternative algorithmic strategies that were empirically investigated. Our motivation is to examine the relative performance of these different approaches based on the basic l2 penalty function in order to provide insights into the viability of these methods for solving linear programs. To test the performance of these algorithms, a set of randomly generated problems as well as a set of NETLIB test problems from the public domain are used. By way of providing a benchmark for comparisons, we also solve the test problems using CPLEX 6.0, an advanced simplex implementation. While a particular variant (ALAG2) of ALAG performed the best for randomly generated test problems, ASL2 performed the best for the NETLIB test problems. Moreover, for test problems having only equality constraints, IEL2, and ASL2 (which is a finer-tuned version of IEL2 in this case) were comparable and yielded a second-best performance in comparison with ALAG2. Furthermore, a set of problems with relatively higher density parameter values, as well as a set of low-density problems were used to determine the effect of density on the relative performances of these methods. This experiment revealed that for linear programs with a high density parameter, ASL2 is the best alternative among the tested algorithms; whereas, for low-density problems ALAG2 is the fastest method. Moreover, although our implementation was rudimentary in comparison with CPLEX, all of the tested methods attained a final solution faster than CPLEX for the set of large-scale low-density problems, sometimes as fast as requiring only 16-23% of the effort consumed by CPLEX. Average rank tests based on the computational results obtained are performed using two different statistics, that assess the speed of convergence and the quality or accuracy of the solution, in order to determine the relative effectiveness of the algorithms and to validate our conclusions. Overall, the results provide insights into selecting algorithmic strategies based on problem structure and indicate that while this class of methods is viable for computing near optimal solutions, more research is needed to design robust and competitive exterior point methods for solving linear programming problems. However, the use of the proposed variant of the augmented Lagrangian method to solve large-scale low-density linear programs is promising and should be explored more extensively.Master of Science
6
Case, Lori Michelle. "An l??1 penalty function approach to the nonlinear bilevel programming problem." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq21334.pdf.
Full text
7
Chang, Kcomt Romy Alexandra. "Constitutional function assigned to the penalty: Bases for a criminal policy plan." Pontificia Universidad Católica del Perú, 2013. http://repositorio.pucp.edu.pe/index/handle/123456789/116385.
Full textAbstract:
This article intends to analyze treatment and functions assigned to the penalty by our Peruvian Constitution and the way this legal institution is conducted at the prescribed basic penalty level (imposed by the legislator ineach type of criminal offence), the specific penalty level (imposed by the judge according to its individual characteristics in each case) and at the penitentiary enforcement level. Finally recommends some considerations for carrying out a possible legislative reform in accordance with a criminal policy plan within our constitutional framework.El presente trabajo busca efectuar un análisis en torno al tratamiento y las funciones que nuestra Constitución política asigna a la pena, y la manera como dicha institución se desarrolla en nuestro país con respectoa la pena abstracta (la impuesta por el legislador en cada tipo penal), la pena concreta (la impuesta por el juez luego de una individualización en cada casoconcreto), y su ejecución en el ámbito penitenciario. Finaliza proponiendo algunas consideraciones para una eventual reforma legislativa conforme conun plan de política criminal que se encuentre dentro del marco constitucional.
8
Bose, Gopal Krishna 1955. "Model selection : an optimal approach to constructing a penalty function in small samples." Monash University, Dept. of Econometrics and Business Statistics, 2002. http://arrow.monash.edu.au/hdl/1959.1/8728.
Full text
9
Geusa, Federica. "Temperature penalty adimensionale per piccoli e medi campi di sonde geotermiche." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017.
Find full textAbstract:
Lo scopo di questa Tesi è stato quello di contribuire allo sviluppo dei metodi di dimensionamento e di simulazione dinamica degli scambiatori verticali con il terreno mediante le g-function.
Un primo contributo è stato quello di migliorare le espressioni polinomiali delle g-function determinate da Zanchini e Lazzari (E.Zanchini, S. Lazzari, “Temperature distribution in a field of long Borehole Heat Exchangers (BHEs) subjected to a monthly averaged heat flux”, Energy 59,570-580 (2013)). Sono state perciò ricavate nuove espressioni polinomiali che, a differenza delle precedenti, possono essere sommate fra loro perché valgono a partire dallo stesso istante iniziale. Sono state quindi fornite nuove tabelle di coefficienti.
Sono state poi determinate e utilizzate, mediante combinazioni di g-function, espressioni matematiche adimensionali del temperature penalty per piccoli e medi campi di sonde geotermiche. Questa grandezza viene utilizzata nel metodo di dimensionamento ASHRAE. Bernier, Chahla e Pinel nel loro lavoro “Long-term ground-temperature changes in Geo-Exchange Systems. ASHRAE Transaction, 114(2), 342-50(2008)” hanno fornito tabelle di valori del temperature penalty adimensionale per quattro geometrie di campi sonde. Tali tabelle sono state qui ampliate, calcolando il temperature penalty per campi di sonde a linea singola (1x2, 1x3, 1x4, 1x5, 1x6, 1x7, 1x8), a linea doppia (2x1, 2x2, 2x3, 2x4, 2x5, 2x6, 2x7 e 2x8) e campi quadrati (3x3, 4x4, 5x5).
Infine, utilizzando risultati di calcolo ottenuti utilizzando l’espressione del temperature penalty adimensionale, è stata determinata, per ciascuno dei campi analizzati, una funzione polinomiale approssimata del temperature penalty in funzione del logaritmo del tempo adimensionale. Queste espressioni polinomiali, rese disponibili mediante tabelle dei coefficienti, consentono di ridurre drasticamente i tempi di calcolo nella simulazione dinamica di lungo termine dei campi di sonde considerati.
10
Soeffker, Ninja. "The Use of Probabilistic Risk Functions and Linear Penalty Functions for Hospital Evacuation Planning." Thesis, Virginia Tech, 2014. http://hdl.handle.net/10919/50918.
Full textAbstract:
In Bish et al. (2014), two approaches for the generation of hospital evacuation transportation plans were proposed: the minimization of the overall risk and the minimization of the evacuation duration. The resulting evacuation plans differ in terms of overall risk and duration, but also in the evacuation order of patients with different characteristics, the filling of hospital beds, and the assignments of the patients to the various vehicle types.
Due to the computational effort of the duration minimization, manipulations of the risk functions for the risk minimization approach were searched in this thesis such that the resulting evacuation plans approach the minimal duration without rules for the assignments of patients to vehicle types. It is possible to create risk functions such that the resulting plans have shorter durations than with the basic risk functions, but the overall risk increases and other properties of the plans change.
Furthermore, a new objective function was introduced in this thesis that minimizes an overall penalty function, where penalties are incurred for time intervals in which patients are at the evacuating hospital or being transported. The characteristics of the patients are considered by different weights in the penalty function. For the given problem instance, it is possible to choose penalty factors such that the overall risk is close to the minimal risk or to choose them such that the duration decreases. It is a simple approach with run times that are comparable to the risk minimization approach for the given problem instance.Master of Science
11
Al, hashimi Farah. "Sufficient conditions for local exactness of the exact penalty function method in nonsmooth optimization." Miami University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=miami1556652064283587.
Full text
12
Ouoba, Mahamadi. "Asymptotic expansion of the expected discounted penalty function in a two-scalestochastic volatility risk model." Thesis, Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-26100.
Full textAbstract:
In this Master thesis, we use a singular and regular perturbation theory to derive an analytic approximation formula for the expected discounted penalty function. Our model is an extension of Cramer–Lundberg extended classical model because we consider a more general insurance risk model in which the compound Poisson risk process is perturbed by a Brownian motion multiplied by a stochastic volatility driven by two factors- which have mean reversion models. Moreover, unlike the classical model, our model allows a ruin to be caused either by claims or by surplus’ fluctuation. We compute explicitly the first terms of the asymptotic expansion and we show that they satisfy either an integro-differential equation or a Poisson equation. In addition, we derive the existence and uniqueness conditions of the risk model with two stochastic volatilities factors.
13
VanDerwerken, Douglas Nielsen. "Variable Selection and Parameter Estimation Using a Continuous and Differentiable Approximation to the L0 Penalty Function." BYU ScholarsArchive, 2011. https://scholarsarchive.byu.edu/etd/2486.
Full textAbstract:
L0 penalized likelihood procedures like Mallows' Cp, AIC, and BIC directly penalize for the number of variables included in a regression model. This is a straightforward approach to the problem of overfitting, and these methods are now part of every statistician's repertoire. However, these procedures have been shown to sometimes result in unstable parameter estimates as a result on the L0 penalty's discontinuity at zero. One proposed alternative, seamless-L0 (SELO), utilizes a continuous penalty function that mimics L0 and allows for stable estimates. Like other similar methods (e.g. LASSO and SCAD), SELO produces sparse solutions because the penalty function is non-differentiable at the origin. Because these penalized likelihoods are singular (non-differentiable) at zero, there is no closed-form solution for the extremum of the objective function. We propose a continuous and everywhere-differentiable penalty function that can have arbitrarily steep slope in a neighborhood near zero, thus mimicking the L0 penalty, but allowing for a nearly closed-form solution for the beta-hat vector. Because our function is not singular at zero, beta-hat will have no zero-valued components, although some will have been shrunk arbitrarily close thereto. We employ a BIC-selected tuning parameter used in the shrinkage step to perform zero-thresholding as well. We call the resulting vector of coefficients the ShrinkSet estimator. It is comparable to SELO in terms of model performance (selecting the truly nonzero coefficients, overall MSE, etc.), but we believe it to be more intuitive and simpler to compute. We provide strong evidence that the estimator enjoys favorable asymptotic properties, including the oracle property.
14
Lee, Jong Min. "A Study on Architecture, Algorithms, and Applications of Approximate Dynamic Programming Based Approach to Optimal Control." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5048.
Full textAbstract:
This thesis develops approximate dynamic programming (ADP) strategies suitable for process control problems aimed at overcoming the limitations of MPC, which are the potentially exorbitant on-line computational requirement and the inability to consider the future interplay between uncertainty and estimation in the optimal control calculation. The suggested approach solves the DP only for the state points visited by closed-loop simulations with judiciously chosen control policies. The approach helps us combat a well-known problem of the traditional DP called 'curse-of-dimensionality,' while it allows the user to derive an improved control policy from the initial ones. The critical issue of the suggested method is a proper choice and design of function approximator. A local averager with a penalty term is proposed to guarantee a stably learned control policy as well as acceptable on-line performance. The thesis also demonstrates versatility of the proposed ADP strategy with difficult process control problems. First, a stochastic adaptive control problem is presented. In this application an ADP-based control policy shows an "active" probing property to reduce uncertainties, leading to a better control performance. The second example is a dual-mode controller, which is a supervisory scheme that actively prevents the progression of abnormal situations under a local controller at their onset. Finally, two ADP strategies for controlling nonlinear processes based on input-output data are suggested. They are model-based and model-free approaches, and have the advantage of conveniently incorporating the knowledge of identification data distribution into the control calculation with performance improvement.
15
Honkala, Keith A. "An analysis of Stokes fluid flow in a converging channel using a penalty function finite element formulation /." Online version of thesis, 1985. http://hdl.handle.net/1850/10283.
Full text
16
Madabushi, Ananth R. "Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems." Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36833.
Full textAbstract:
This research effort focuses on large-scale linear programming problems that arise in the context of solving various problems such as discrete linear or polynomial, and continuous nonlinear, nonconvex programming problems, using linearization and branch-and-cut algorithms for the discrete case, and using polyhedral outer-approximation methods for the continuous case. These problems arise in various applications in production planning, location-allocation, game theory, economics, and many engineering and systems design problems. During the solution process of discrete or continuous nonconvex problems using polyhedral approaches, one has to contend with repeatedly solving large-scale linear programming(LP) relaxations. Thus, it becomes imperative to employ an efficient method in solving these problems. It has been amply demonstrated that solving LP relaxations using a simplex-based algorithm, or even an interior-point type of procedure, can be inadequately slow ( especially in the presence of complicating constraints, dense coefficient matrices, and ill-conditioning ) in comparison with a Lagrangian Relaxation approach. With this motivation, we present a practical primal-dual subgradient algorithm that incorporates a dual ascent, a primal recovery, and a penalty function approach to recover a near optimal and feasible pair of primal and dual solutions.
The proposed primal-dual approach is comprised of three stages. Stage I deals with solving the Lagrangian dual problem by using various subgradient deflection strategies such as the Modified Gradient Technique (MGT), the Average Direction Strategy (ADS), and a new direction strategy called the Modified Average Direction Strategy (M-ADS). In the latter, the deflection parameter is determined based on the process of projecting the unknown optimal direction onto the space spanned by the current subgradient direction and the previous direction. This projected direction approximates the desired optimal direction as closely as possible using the conjugate subgradient concept. The step-length rules implemented in this regard are the Quadratic Fit Line Search Method and a new line search method called the Directional Derivative Line Search Method in which we start with a prescribed step-length and then ascertain whether to increase or decrease the step-length value based on the right-hand and left-hand derivative information available at each iteration. In the second stage of the algorithm (Stage II), a sequence of updated primal solutions is generated using some convex combinations of the Lagrangian subproblem solutions. Alternatively, a starting primal optimal solution can be obtained using the complementary slackness conditions. Depending on the extent of feasibility and optimality attained, Stage III applies a penalty function method to improve the obtained primal solution toward a near feasible and optimal solution.
We present computational experience using a set of randomly generated, structured, linear programming problems of the type that might typically arise in the context of discrete optimization.Master of Science
17
Ghosh, Jayanto K. "Finite element simulation of non-Newtonian flow in the converging section of an extrusion die using a penalty function technique." Ohio : Ohio University, 1989. http://www.ohiolink.edu/etd/view.cgi?ohiou1172094913.
Full text
18
Janušauskas, Arūnas. "Gerber-Shiu baudos funkcijos skaičiavimas Pareto žaloms." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2011. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20110709_152450-24338.
Full textAbstract:
Savo darbe mes nagrinėjame Gerber-Shiu baudos funkciją klasikiniame rizikos modelyje atveju, kai žalų dydžiai pasiskirstę pagal Pareto dėsnį. Pagrindinis uždavinys yra susikonstruoti algoritmą funkcijos reikšmių gavimui. Tiriamas Gerber-Shiu diskontuotos baudos funkcijos atvejis, kada vidinė baudos funkcija w tapačiai lygi vienetui. Dėl sudėtingos transformuoto Pareto skirstinio formos analitiškai paskaičiuoti sąsūkų nepavyko. Tam tikslui naudojamas interpoliavimas kubiniu splainu. N kartų kartodami sukonstruotą algoritmą gauname pirmąsias n sąsūkas laisvai pasirinktiems pradiniams parametrams: Pareto skirstinio laipsnio rodikliui α, pradiniam kapitalui u, santykinei draudimo priemokai θ, diskontavimo parametrui (palūkanų normai) δ ir Puasono proceso parametrui λ. Lentelių pagalba parodome funkcijos priklausomybę nuo skirtingų modeliuojančių parametrų reikšmių. Išvadose teigiame jog pasiūlytas metodas skaičiuoti Gerber-Shiu diskontuotos baudos funkciją nors ir išpildomas tačiau yra neefektyvus. Kai kuriais pradinių parametrų pasirinkimo atvejais susiduriama su tikslumo problema. Norint tiksliai paskaičiuoti funkcijos reikšmes reikia didesnių eilių transformuoto Pareto skirstinio sąsūkų, o tam reikalingi dideli resursai. Kita vertus, pradinio kapitalo u reikšmėms didėjant tikslumas didėja ženkliai.In this paper we consider Gerber-Shiu discounted penalty function in the classical risk model for Pareto claims. Our main goal is to construct an algorithm for obtaining values of the discounted penalty function (considering penalty function w=1). Due to the complicated form of the transformed Pareto distribution function we cannot obtain its convolutions analiticaly. We use numerical methods provided by Maple (cube spline) to find interpolating functions instead. Continuously applying recursive formulas we obtain first 5 interpolated convolutions. Then we calculate values of Gerber-Shiu discounted penalty function for certain arbitrary parameters: α – degree of Pareto distribution function, initial surplus u, security loading θ, discounting parameter δ and Poison process parameter λ. We present data tables and graphs of the discounted penalty function for some variations of parameters in later sections. Finally we state that the method that we use is quite complicated. For better accuracy of the discounted penalty function values one may require to get many convolutions of the transformed Pareto distribution function and that may require too great of the resources. However the quantity of the convolutions needed rapidly decreases for large values of the initial surplus u.
19
Tanil, Cagatay. "Optimal External Configuration Design Of Missiles." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12610873/index.pdf.
Full textAbstract:
The main area of emphasis in this study is to investigate the methods and technology for aerodynamic configuration sizing of missiles and to develop a software platform in MATLAB®environment as a design tool which has an ability of optimizing the external configuration of missiles for a set of flight requirements specified by the user through a graphical user interface. A genetic algorithm based optimization tool is prepared by MATLAB is expected to help the designer to find out the best external geometry candidates in the conceptual design stage. Missile DATCOM software package is employed to predict the aerodynamic coefficients needed in finding the performance merits of a missile for each external geometry candidate by integrating its dynamic equations of motion. Numerous external geometry candidates are rapidly eliminated according to objectives and constraints specified by designers, which provide necessary information in preliminary design. In this elimination, the external geometry candidates are graded according to their flight performances in order to discover an optimum solution. In the conceptual design, the most important performance objectives related to the external geometry of a missile are range, speed, maneuverability, and control effectiveness. These objectives are directly related to the equations of motion of the missile, concluding that the speed and flight range are related to the total mass and the drag-to-lift ratio acting on missile. Also, maneuverability depends on the normal force acting on missile body and mass whereas the control effectiveness is affected by pitching moment and mass moment of inertia of missile. All of the flight performance data are obtained by running a two degree-of-freedom simulation. In order to solve the resulting multi-objective optimization problem with a set of constraint of linear and nonlinear nature and in equality and inequality forms, genetic-algorithm-based methods are applied. Hybrid encoding methods in which the integer configuration variables (i.e., nose shape and control type) and real-valued geometrical dimension (i.e., diameter, length) parameters are encoded in the same individual chromosome. An external configuration design tool (EXCON) is developed as a synthesis and external sizing tool for the subsonic cruise missiles. A graphical user interface (GUI), a flight simulator and optimization modules are embedded into the tool. A numerical example, the re-configuration problem of an anti-ship cruise missile Harpoon, is presented to demonstrate the accuracy and feasibility of the conceptual design tool. The optimum external geometries found for different penalty weights of penalty terms in the cost function are compared according to their constraint violations and launch mass values. By means of using EXCON, the launch mass original baseline Harpoon is reduced by approximately 30% without deteriorating the other flight performance characteristics of the original Harpoon.
20
Asanavičiūtė, Rasa. "Gerber-Shiu diskontuota baudos funkcija žaloms pasiskirčiusioms pagal Pareto dėsnį." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20140702_192937-54640.
Full textAbstract:
Darbe gauta Gerber-Shiu diskontuotos baudos funkcijos asimptotika, kai žalos pasiskirsčiusios pagal Pareto dėsnį ir pradinis kapitalas x artėja į begalybę. Pagrindinė išraiška Gerber-Shiu diskontuotos baudos funkcijos išskaidyta į du atvejus, kai palūkanų norma nelygi ir lygi nuliui. Darbe pateikti grafikai rodo diskontuotos baudos funkcijos priklausomybę nuo įvairių Puasono modelio parametrų.The asymptotic of the Gerber-Shiu discounted penalty function in Poisson model with Pareto distributed claims is obtained. The asymptotic is obtained as initial surplus x tends to infinity. The main term of discounted penalty function has different expression in case when interest rate equal zero and when doesn't equal zero. The graphs of the Gerber-Shiu discounted penalty function in the case of Pareto claims are examined for various parameter choices.
21
Rastgoufard, Rastin. "The Interacting Multiple Models Algorithm with State-Dependent Value Assignment." ScholarWorks@UNO, 2012. http://scholarworks.uno.edu/td/1477.
Full textAbstract:
The value of a state is a measure of its worth, so that, for example, waypoints have high value and regions inside of obstacles have very small value. We propose two methods of incorporating world information as state-dependent modifications to the interacting multiple models (IMM) algorithm, and then we use a game's player-controlled trajectories as ground truths to compare the normal IMM algorithm to versions with our proposed modifications. The two methods involve modifying the model probabilities in the update step and modifying the transition probability matrix in the mixing step based on the assigned values of different target states. The state-dependent value assignment modifications are shown experimentally to perform better than the normal IMM algorithm in both estimating the target's current state and predicting the target's next state.
22
Nascimento, Clebea Araújo. "Abordagem do problema de fluxo de potência ótimo por métodos de programação não-linear via penalidade quadrática e Função Lagrangeana Aumentada." Universidade de São Paulo, 1997. http://www.teses.usp.br/teses/disponiveis/18/18133/tde-22012018-113127/.
Full textAbstract:
Neste trabalho são estudadas três metodologias de otimização não-linear: o Método da Função Lagrangeana, o Método da Função Penalidade e o Método da Função Lagrangeana Aumentada. Com o estudo da Função Lagrangeana e do Método da Função Penalidade, foi possível alcançar a formulação da Função Lagrangeana Aumentada com o objetivo de resolver problemas de programação não-linear não-convexos. Testes numéricos são apresentados para o problema não-convexo de programação não-linear conhecido como Fluxo de Potência Ótimo.In this dissertation, three nonlinear optimization methodologies are studied: the Lagrangian Function Method, the Penalty Function Method and Augmented Lagrangian Function Method. Through the studies ofthe Lagrangian Function and the Penalty function Method, it was possible to reach the formulation of the Augmented Lagrangian Function aiming to solve nonlinear nonconvex programming problems. Numerical tests are presented for the nonconvex nonlinear programming problem known as optimal power flow.
23
Kokrda, Lukáš. "Optimalizace stavebních konstrukcí s pravděpodobnostními omezeními." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2015. http://www.nusl.cz/ntk/nusl-232181.
Full textAbstract:
The diploma thesis deals with penalty approach to stochastic optimization with chance constraints which are applied to structural mechanics. The problem of optimal design of beam dimensions is modeled and solved. The uncertainty is involved in the form of random load. The corresponding mathematical model contains a condition in the form of ordinary differencial equation that is solved by finite element method. The probability condition is approximated by several types of penalty functions. The results are obtained by computations in the MATLAB software.
24
Park, Chuljin. "Discrete optimization via simulation with stochastic constraints." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/49088.
Full textAbstract:
In this thesis, we first develop a new method called penalty function with memory (PFM). PFM consists of a penalty parameter and a measure of constraint violation and it converts a discrete optimization via simulation (DOvS) problem with stochastic constraints into a series of DOvS problems without stochastic constraints. PFM determines a penalty of a visited solution based on past results of feasibility checks on the solution. Specifically, assuming a minimization problem, a penalty parameter of PFM, namely the penalty sequence, diverges to infinity for an infeasible solution but converges to zero almost surely for any strictly feasible solution under certain conditions. For a feasible solution located on the boundary of feasible and infeasible regions, the sequence converges to zero either with high probability or almost surely. As a result, a DOvS algorithm combined with PFM performs well even when optimal solutions are tight or nearly tight. Second, we design an optimal water quality monitoring network for river systems. The problem is to find the optimal location of a finite number of monitoring devices, minimizing the expected detection time of a contaminant spill event while guaranteeing good detection reliability. When uncertainties in spill and rain events are considered, both the expected detection time and detection reliability need to be estimated by stochastic simulation. This problem is formulated as a stochastic DOvS problem with the objective of minimizing expected detection time and with a stochastic constraint on the detection reliability; and it is solved by a DOvS algorithm combined with PFM. Finally, we improve PFM by combining it with an approximate budget allocation procedure. We revise an existing optimal budget allocation procedure so that it can handle active constraints and satisfy necessary conditions for the convergence of PFM.
25
Grušienė, Giedrė. "Gerber-Shiu baudos funkcija Veibulo žaloms." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20140702_193045-82748.
Full textAbstract:
Darbe apskaičiuotas Gerber-Shiu diskontuotos baudos funkcijos pagrindinis narys klasikiniame kolektyvinės rizikos modelyje, kai draudimo kompanijos žalos pasiskirsčiusios pagal Veibulo skirstinį su parametrais η = const, 0< η <1 ir σ = 1, o pradinis kompanijos turtas . Minėtojo nario asimptotika gauta pasinaudojus subeksponentinių pasiskirstymo funkcijų savybėmis. Darbe pateiktuose grafikuose pavaizduota diskontuotos baudos funkcijos pagrindinio nario priklausomybė nuo įvairių klasikinio kolektyvinės rizikos modelio parametrų.In this work the main member of the Gerber-Shiu discounted penalty function in a classic collective risk model with Weibull distribution (parameters η = const, 0< η <1 and σ = 1) is calculated. The expression of the main member is obtained by making use of properties of subexponential distribution functions. In the graphs a dependence of the main member of the Gerber-Shiu discounted penalty function on various parameters of classic collective risk model is represented.
26
Marcos, Lucas Barbosa. "Controle de sistemas lineares sujeitos a saltos Markovianos aplicado em veículos autônomos." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/18/18153/tde-27042017-085140/.
Full textAbstract:
No contexto do mundo contemporâneo, os veículos automotores estão cada vez mais integrados ao cotidiano das pessoas, sendo mais de 1 bilhão deles circulando pelo mundo. Por serem controlados por motoristas, estão sujeitos a falhas decorrentes da inerente condição humana, ocasionando acidentes, mortes e outros prejuízos. O controle autônomo de veículos tem se apresentado como alternativa na busca de redução desses prejuízos, sendo utilizado nas mais diferentes abordagens, por distintas instituições ao redor do planeta. Deste modo, torna-se uma pauta fundamental para o estudo de sistemas de controle. Este trabalho, valendo-se da descrição matemática do comportamento veicular, busca o desenvolvimento e a implementação de um método eficiente de controle autônomo de veículos voltado, principalmente, para a modelagem em espaço de estados. Considerando que mudanças de marchas, principalmente em um cenário de dirigibilidade autônoma, são ações aleatórias, o objetivo desta dissertação é utilizar estratégias de controle baseadas em sistemas lineares sujeitos a saltos Markovianos.In nowadays society, automobile vehicles are getting more and more integrated to people\'s daily activities, as there are more than 1 billion of them on the streets around the world. As they are controlled by drivers, vehicles are subjected to failures caused by human mistakes that lead to accidents, injuries and others. Autonomous vehicle control has shown itself to be an alternative in the pursuit of damage reduction, and it is applied by different institutions in many countries. Therefore, it is a main subject in the area of control systems. This paper, relying on mathematical descriptions of vehicle behavior, aims to develop and apply an efficient autonomous control method that takes into account state-space formulation. This goal will be achieved by the use of control strategies based on Markovian Jump Linear Systems that will describe the highly non-linear dynamics of the vehicle in different operation points.
27
Morales, J. M. "Structured sparsity with convex penalty functions." Thesis, University College London (University of London), 2012. http://discovery.ucl.ac.uk/1355964/.
Full textAbstract:
We study the problem of learning a sparse linear regression vector under additional conditions on the structure of its sparsity pattern. This problem is relevant in Machine Learning, Statistics and Signal Processing. It is well known that a linear regression can benefit from knowledge that the underlying regression vector is sparse. The combinatorial problem of selecting the nonzero components of this vector can be “relaxed” by regularising the squared error with a convex penalty function like the ℓ1 norm. However, in many applications, additional conditions on the structure of the regression vector and its sparsity pattern are available. Incorporating this information into the learning method may lead to a significant decrease of the estimation error. In this thesis, we present a family of convex penalty functions, which encode prior knowledge on the structure of the vector formed by the absolute values of the regression coefficients. This family subsumes the ℓ1 norm and is flexible enough to include different models of sparsity patterns, which are of practical and theoretical importance. We establish several properties of these penalty functions and discuss some examples where they can be computed explicitly. Moreover, for solving the regularised least squares problem with these penalty functions, we present a convergent optimisation algorithm and proximal method. Both algorithms are useful numerical techniques taylored for different kinds of penalties. Extensive numerical simulations highlight the benefit of structured sparsity and the advantage offered by our approach over the Lasso method and other related methods, such as using other convex optimisation penalties or greedy methods.
28
Machado, Bruno Mangini de Paula. "O condomínio edilício e o condômino com reiterado comportamento antissocial." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/2/2131/tde-02122013-083142/.
Full textAbstract:
A presente dissertação aborda a temática do condomínio edilício, examinando questões importantes e elementares deste especial instituto jurídico, e do condômino com reiterado comportamento antissocial. Para tanto, exige-se uma robusta análise do direito de propriedade e da função social, como seu elemento transformador, na medida em que esta, ao lado da peculiar estrutura jurídica do condomínio edilício, que conjuga áreas de propriedade exclusiva com áreas de propriedade comum, somada ao próprio ordenamento jurídico pátrio, impõe ao titular de unidade autônoma o cumprimento de deveres de observância obrigatória, não só para com os demais condôminos, mas principalmente em favor de toda coletividade. Tais deveres, uma vez descumpridos, ensejam a aplicação de medidas jurídicas sancionatórias gradativas em face do infrator, a iniciar por penas pecuniárias, até final expulsão da seara condominial, que poderá ocorrer na medida em que sejam reiteradas as atividades nocivas por ele desempenhadas, gerando incompatibilidade de convivência com os demais condôminos, e na hipótese de as multas aplicadas mostrarem-se inócuas como meio de interrompê-las. A expulsão do condômino antissocial do condomínio edilício pode afigurar-se, a princípio, uma radical sanção, contudo extremamente necessária como último recurso não só para a manutenção do equilíbrio psíquico, econômico e social na copropriedade, mas para assegurar a função social que o ordenamento jurídico brasileiro impõe ao direito proprietário, no qual também está inserida a propriedade em unidade autônoma condominial.This dissertation addresses the theme of condominium building, examining important issues and this legal institute special elementary, and condominium member with repeated antisocial behavior. Therefore, it requires a robust analysis of property rights and social function, as its transforming element, insofar as the social function, along with the peculiar legal structure of the condominium building, which combines exclusive proprietary areas with common property areas, in addition to its own legal system, imposes on the holder of the autonomous unit compliance with mandatory observance duties, not only with the other joint owners, but mostly in favor of the whole collectivity. Once breached such duties, it inspires the application of piecemeal legal sanctions measures in face of the offender, that starts from monetary penalties until the final expulsion of the harvest condominium, which may occur as the harmful activities are repeated by him performed, generating coexistence incompatibility with the other condominium members, and assuming that the fines shows up innocuous as a way to stop them. The expulsion of antisocial condominium member from the condominium building can seem, at first, a radical penalty, but extremely necessary as a last resort not only to maintain psychic equilibrium, social and economical in co-ownership, but to ensure the social function that the Brazilian legal system imposes on the proprietary right, which is also inserted into the stand-alone unit condominium property
29
Sena, Genicy de Araújo. "A pontencialidade educativa da pena de prestação de serviços à comunidade." reponame:Repositório Institucional do FGV, 2012. http://hdl.handle.net/10438/9788.
Full textAbstract:
Submitted by Marcia Bacha (marcia.bacha@fgv.br) on 2012-05-14T11:57:14Z
No. of bitstreams: 1
Genicy de Araujo Sena.pdf: 635187 bytes, checksum: 77bf33f3d8ae1298023ea54b8135581d (MD5)Approved for entry into archive by Marcia Bacha (marcia.bacha@fgv.br) on 2012-05-14T11:57:28Z (GMT) No. of bitstreams: 1 Genicy de Araujo Sena.pdf: 635187 bytes, checksum: 77bf33f3d8ae1298023ea54b8135581d (MD5)
Made available in DSpace on 2012-05-14T11:57:37Z (GMT). No. of bitstreams: 1 Genicy de Araujo Sena.pdf: 635187 bytes, checksum: 77bf33f3d8ae1298023ea54b8135581d (MD5) Previous issue date: 2012
Este trabalho objetiva constatar se a pena de prestação de serviços à comunidade, quando aplicada, tem um papel educativo junto ao infrator beneficiário da medida, seja como substituta da pena privativa de liberdade, após a condenação, seja como medida alternativa, após transação penal em sede do Juizado Especial Criminal. Com base no conceito de educação apresentado pelo professor Paulo Freire, busca identificar, através de entrevistas com beneficiários, se existe um trabalho conscientizador ( mediante troca de experiências e atividades educativas) desenvolvido pelas instituições receptoras dos beneficiários da medida e, se a reinserção imediata do infrator na sociedade viabiliza essa conscientização sobre a sua conduta criminosa. Assim, pretende constatar se a referida medida tem apenas um caráter punitivo ou vem desenvolvendo uma função educativa durante a sua execução.
This study aims to determine whether a sentence of community service, when applied, have an educational role by the offender as beneficiary or as a substitute for the sentence of imprisonment, upon conviction, either as an alternative, after transaction criminal headquarters of the Special Criminal Court. Based on the concept of education presented by Professor Paulo Freire, seeks to identify, through interviews with beneficiaries, if there is a work conscientizing (through an exchange of experiences and educational activities) developed by the institutions which are sent and if the immediate reintegration of the offender in society enables this awareness of their criminal conduct. So, you want to see if the measure has only a punitive or has developed an educational function during its execution.
30
Mazal, Camila Mara Nardello. "Funções penalidade para variáveis discretas e o problema de fluxo de potência ótimo reativo /." Bauru, 2019. http://hdl.handle.net/11449/191282.
Full textAbstract:
Orientador: Edméa Cássia BaptistaResumo: O problema de fluxo de potência ótimo reativo é representado matematicamente por um problema de otimização não linear, restrito, não convexo, de grande porte e com variáveis de controle contínuas e discretas. A representação dos taps dos transformadores em fase e das susceptâncias shunt dos bancos de capacitores/reatores do sistema como variáveis discretas, torna o problema mais próximo da realidade. Entretanto, problemas de otimização não linear com variáveis discretas apresentam dificuldades em sua resolução, as quais são impostas pelas variáveis discretas. Uma das técnicas para sua resolução consiste em utilizar funções penalidades para tratar as variáveis discretas. Desta forma, transforma-se o problema discreto em uma sequência de problemas contínuos, e o método primal-dual barreira logarítmica pode ser utilizado para resolver esses problemas. Neste trabalho o objetivo é analisar a convergência do método de penalidade para variáveis discretas aplicado ao problema de fluxo de potência ótimo reativo, ao se utilizar diferentes funções penalidade e a combinação delas. Testes computacionais foram realizados com um exemplo númérico e com os sistemas elétricos IEEE 14, 30 e 118 barras, utilizando o pacote de otimização KNITRO em interface com o software GAMS. Os resultados demonstram que a combinação de diferentes funções penalidade para o tratamento das variáveis discretas é promissora.
Abstract: The reactive optimal power flow problem is mathematically represented by a nonlinear, constrained, nonconvex, large scale optimization problem with continuous and discrete control variables. The representation of the in-phase transformers taps and/or the shunt susceptances of capacitor/reactor Banks of the system, as discrete variables, make the problem closer to reality. Nonlinear optimization problems with discrete variables are difficulty to solve, due to the discrete variables. One of the soluction techniques consist in using penalty functions to treat the discrete variables. Thus, the discrete problem is transformed in a sequence of continuous problems, and the primal dual logarithmic barrier method can be used to solve these problems. In this work the objective is to analyze the convergence of the penalty method for discrete variables applied to the reactive optimal power flow problem, by using different penalty functions and the mixture of them. Computational tests have been carried out with a numerical example and with the IEEE 14, 30 and 118 buses electrical systems, using the KNITRO optimization package in interface with the GAMS software. The results show that a mixture of different penalty functions for treatment of discrete variable is advantageous.
Mestre
31
Attia, N. F. "New methods of constrained optimization using penalty functions." Thesis, University of Essex, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356044.
Full text
32
Cerri, João Paulo. "Controle e filtragem para sistemas lineares discretos incertos sujeitos a saltos Markovianos." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/18/18153/tde-26082013-133045/.
Full textAbstract:
Esta tese de doutorado aborda os projetos robustos de controle e estimativa de estados para Sistemas Lineares sujeitos a Saltos Markovianos (SLSM) de tempo discreto sob a influência de incertezas paramétricas. Esses projetos são desenvolvidos por meio de extensões dos critérios quadráticos clássicos para SLSM nominais. Os critérios de custo quadrático para os SLSM incertos são formulados na forma de problemas de otimização min-max que permitem encontrar a melhor solução para o pior caso de incerteza (máxima influência de incerteza). Os projetos robustos correspondem às soluções ótimas obtidas por meio da combinação dos métodos de funções penalidade e mínimos quadrados regularizados robustos. Duas situações são investigadas: regular e estimar os estados quando os modos de operações são observados; e estimar os estados sob a hipótese de desconhecimento da cadeia de Markov. Estruturalmente, o regulador e as estimativas de estados assemelham-se às respectivas versões nominais. A recursividade é estabelecida em termos de equações de Riccati sem a necessidade de ajuste de parâmetros auxiliares e dependente apenas das matrizes de parâmetros e ponderações conhecidas.This thesis deals with recursive robust designs of control and state estimates for discretetime Markovian Jump Linear Systems (MJLS) subject to parametric uncertainties. The designs are developed considering extensions of the standard quadratic cost criteria for MJLS without uncertainties. The quadratic cost criteria for uncertain MJLS are formulated in the form of min-max optimization problems to get the best solution for the worst uncertainty case. The optimal robust schemes correspond to the optimal solution obtained by the combination of penalty function and robust regularized least-squares methods. Two cases are investigated: to control and estimate the states when the operation modes are observed; and, to estimate the states when the Markov chain is unobserved. The optimal robust LQR and Kalman-type state estimates resemble the respective nominal versions. The recursiveness is established by Riccati equations in terms of parameter and weighting matrices previously known and without extra offline computations.
33
Cerri, João Paulo. "Regulador robusto recursivo para sistemas lineares de tempo discreto no espaço de estado." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/18/18153/tde-02072009-141628/.
Full textAbstract:
Esta dissertação de mestrado aborda o problema de regulação robusta recursiva para sistemas lineares discretos sujeitos a incertezas paramétricas. Um novo funcional quadrático, baseado na combinação de função penalidade e função custo do tipo jogos, é projetado para lidar com este problema. Uma característica interessante desta abordagem é que a recursividade pode ser realizada sem a necessidade do ajuste de parâmetros auxiliares. Bastante útil para aplicações online. A solução proposta é baseada numa equação recursiva de Riccati. Também, a convergência e a estabilidade do regulador para o sistema linear incerto invariante no tempo são garantidas.This dissertation deals with robust recursive regulators for discrete-time systems subject to parametric uncertainties. A new quadratic functional based on the combination of penalty functions and game theory is proposed to solve this class of problems. An important issue of this approach is that the recursiveness can be performed without the need of adjusting auxiliary parameters. It is useful for online applications. The solution proposed is based on Riccati equation which guarantees the convergence and stability of the time-invariant system.
34
Ferris, Michael Charles. "Weak sharp minima and penalty functions in mathematical programming." Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.292969.
Full text
35
Martins, Fernanda Rocha. "As funções da pena e o sistema penitenciário brasileiro: em busca de novas alternativas." Universidade Presbiteriana Mackenzie, 2014. http://tede.mackenzie.br/jspui/handle/tede/1106.
Full textAbstract:
Made available in DSpace on 2016-03-15T19:34:07Z (GMT). No. of bitstreams: 1
Fernanda Rocha Martins.pdf: 1092270 bytes, checksum: e323954adb4b73be61bec0380187e7d7 (MD5)
Previous issue date: 2014-02-03It treats the present work about the Brazilian prison system and hence the establishments intended to serve the sentence of imprisonment, a more serious sanction that can be imposed, in the Brazilian legal system, who performs a behavior not tolerated by the rest of the community. Well, the study of prisons and their (correct) functioning necessarily lead to the study of law to punish the state and own imprisonment. Now what legitimizes the state to segregate one of its members and interfere with their way of life, imposing the restriction of certain legal rights? What do you want the state to impose a prison sentence, in other words, to segregate an individual for a certain period of time, conscious of his return to the bosom of society? Well, this thesis is dedicated, in its first two chapters, answer these questions and establish what function pen in a democratic state. From there, it becomes possible to analyze the Brazilian prison system: if the prisons are intended to serve the sentence in prison, they must necessarily be structured to achieve the function of this same penalty. The Chapters 3 and 4 are intended, in this sense, to demonstrate the current reality of the prison system, if it lends itself to the fulfillment of the function that it is intrinsic and, if not, it is possible to design public policies aimed at achieve this very purpose.
Trata o presente trabalho acerca do sistema prisional brasileiro e, portanto, dos estabelecimentos destinados ao cumprimento da pena privativa de liberdade, sanção mais grave que pode ser imposta, no ordenamento jurídico brasileiro, a quem realiza uma conduta considerada intolerável pelo resto da comunidade. Pois bem, o estudo dos estabelecimentos penais e de seu (correto) funcionamento conduz necessariamente ao estudo do Direito de punir do Estado e da própria pena de prisão. Ora, o que legitima o Estado a segregar um de seus membros e interferir em seu modo de vida, impondo a restrição de certos bens jurídicos? O que pretende o Estado ao impor uma pena de prisão, ou seja, ao segregar um individuo por determinado período de tempo, consciente de seu retorno ao seio social? Bom, a presente dissertação se dedica, em seus dois primeiros capítulos, a responder essas questões e estabelecer qual a função da pena em um Estado Democrático de Direito. A partir daí, possível se torna a análise do sistema prisional brasileiro: se os estabelecimentos penais são destinados ao cumprimento da pena de prisão, eles devem necessariamente estar estruturados de forma a alcançar a função desta mesma pena. Os capítulos 3 e 4 se destinam, neste sentido, a demonstrar a atual realidade do sistema prisional brasileiro, se ele se presta ao cumprimento da função que lhe é intrínseca e, em caso negativo, se é possível a elaboração de políticas públicas que visem a alcançar essa finalidade essencial.
36
Ponomarenko, Andrej. "Lösungsmethoden für Variationsungleichungen." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2003. http://dx.doi.org/10.18452/14841.
Full textAbstract:
Zusammenfassung Diese Arbeit ist ein Versuch, verschiedene klassische und neuere Methodender glatten bzw. nichtglatten Optimierung zu verallgemeinern und in ihrem Zusammenhang darzustellen. Als Hauptinstrument erweist sich dabei die sogenannte verallgemeinerte Kojima-Funktion. Neben reichlichen Beispielen setzen wir einen besonderen Akzent auf die Betrachtung von Variationsungleichungen, Komplementaritaetsaufgaben und der Standartaufgabeder mathematischen Programmierung. Unter natuerlichen Voraussetzungen an diese Probleme kann man u.a. Barriere-, Straf- und SQP-Typ-Methoden, die auf Newton-Verfahrenbasieren, aber auch Modelle, die sogenannte NCP-Funktionen benutzen, mittelsspezieller Stoerungen der Kojima-Funktion exakt modellieren. Daneben werdendurch explizite und natuerliche Wahl der Stoerungsparameter auch neue Methoden dieser Arten vorgeschlagen. Die Vorteile solcher Modellierungsind ueberzeugend vor allem wegen der direkt moeglichen (auf Stabilitaetseigenschaften der Kojima-Gleichung beruhendenden)Loesungsabschaetzungen und weil die entsprechenden Nullstellen ziemlich einfach als Loesungen bekannter Ersatzprobleme interpretiert werden koennen. Ein weiterer Aspekt der Arbeit besteht in der genaueren Untersuchungder "nichtglatten Faelle". Hier wird die Theorie von verschiedenen verallgemeinerten Ableitungen und dadurch entstehenden verallgemeinerten Newton-Verfahren, die im Buch "Nonsmooth Equations in Optimization" von B. Kummer und D. Klatte vorgeschlagen und untersucht wurde, intensiv benutzt. Entscheidend ist dabei, dass die benutzten verallgemeinerten Ableitungen auch praktisch angewandt werden koennen, da man sie exakt ausrechnen kann.This work attempts to generalize various classical and new methods of smooth or nonsmooth optimization and to show them in their interrelation. The main tool for doing this is the so-called generalized Kojima-function. In addition to numerous examples we specialy emphasize the consideration of variational inequalities, complementarity problems and the standard problem of mathematical programming. Under natural assumptions on these problems we can model e.g. barrier-, penalty-, and SQP-Type-methods basing on Newton methods, and also methods using the so-called NCP-function exactly by means of special perturbations of the Kojima-function. Furthermore, by the explicit and natural choice of the perturbation parameters new methods of these kinds are introduced. The benefit of such a modelling is obvious, first of all due to the direct solution estimation (basing on stability properties of the Kojima-equation) and because the corresponding zeros can easily be interpreted as solutions of known subproblems. A further aspect considered in this paper is the detailed investigation of "nonsmooth cases". The theory of various generalized derivatives and resulting generalized Newton methods, which is introduced and investigated in the book "Nonsmooth Equations in Optimization" of B. Kummer and D. Klatte, is intensely used here. The crucial point is the applicability of the used generalized derivatives in practice, since they can be calculated exactly.
37
Cornu, Julie. "Droit au procès équitable et autorité administrative." Thesis, Paris 2, 2014. http://www.theses.fr/2014PA020068/document.
Full textAbstract:
Principe trouvant une expression solennelle à l’article 6 C.E.D.H., le droit au procès équitable irradie aujourd’hui l’ensemble de notre droit interne. Dans un contexte de subjectivisation du droit, le droit administratif n’échappe pas à cette « irrésistible extension du contentieux du procès équitable » (Mme KOERING-JOULIN). Cette assertion trouve une manifestation éclatante quant aux pouvoirs de sanctions et de règlement des différends reconnus aux autorités administratives. La définition européenne du champ d’application du droit au procès équitable, suivie par la Cour de cassation et adaptée par le Conseil d’État, permet, en effet, à l'article 6 précité de faire florès en ce domaine. Ainsi, en l’état actuel de la jurisprudence administrative, le moyen tiré de la violation de cette stipulation peut utilement être invoqué à l’encontre des autorités administratives indépendantes, tant dans le cadre de leur activité répressive que contentieuse. Depuis maintenant huit ans, le respect de cette garantie s’impose à la procédure d’établissement des sanctions fiscales. A suivre cette ligne jurisprudentielle, l’extension du droit au procès équitable à l’ensemble des autorités administratives répressives voire contentieuses pourrait être la voie de l’avenir. Une telle évolution n’est toutefois pas sans soulever certaines questions. La processualisation croissante de la répression administrative, sous l’effet du droit au procès équitable, n’est-elle pas une contradiction en soi ? Ne va-t-elle pas à rebours de l’objectif initialement poursuivi par l’externalisation de la sanction ? Plus fondamentalement, l’assujettissement de l’administration aux garanties spécifiques à la procédure juridictionnelle ne participe-t-il pas au rétablissement d’une certaine confusion entre l’administration et la juridiction ? N'y a-t-il pas là renaissance, sous une forme évidemment nouvelle, de la figure que l'on croyait révolue de l'administrateur-juge ?The right to a fair trial is enshrined in the article 6§1 of the European Convention on Human Rights and irradiates now all French law. In the context of the subjectivization of the law, administrative law is also subject to this "unstoppable rise of disputes in the name of the right to a fair trial" (Mrs. KOERING-JOULIN). This assertion is particularly true regarding the powers of sanction and the settlement of disputes granted to the administrative authorities. The European definition of the right to a fair trial applied by the Court of Cassation and adapted by the Council of State allows a wide application of this right. So, given the current state of the administrative case law, the right to a fair trial can be usefully claimed against independent administrative authorities as regard either their law enforcement activities or litigation practice. And the tax administration has also been compelled to respect this fundamental right for eight years now. In line with this settled jurisprudence, the extension of the right to a fair trial to all the administrative authorities may be the way of the future. But such an evolution raises a few questions. Isn't the increasing jurisdictionalization of the administration activities as a result of the right to a fair trial an inconsistency in itself? Doesn't it go against the primary goal of the outsourcing of the administrative penalties? More fundamentally, doesn't subjecting the administrative authorities to the specific principles of court procedures participate in reinstating some confusion between administration and jurisdiction? Isn’t it the rebirth, under a new form, of the administrator-judge we thought was long gone?
38
Costa, Carlos Ednaldo Ueno. "O Método de Newton e a Função Penalidade Quadrática aplicados ao problema de fluxo de potência ótimo." Universidade de São Paulo, 1998. http://www.teses.usp.br/teses/disponiveis/18/18133/tde-27112017-145520/.
Full textAbstract:
Neste trabalho é apresentada uma abordagem do Método de Newton associado à função penalidade quadrática e ao método dos conjuntos ativos na solução do problema de Fluxo de Potência Ótimo (FPO). A formulação geral do problema de FPO é apresentada, assim como a técnica utilizada na resolução do sistema de equações. A fatoração da matriz Lagrangeana é feita por elementos ao invés das estruturas em blocos. A característica de esparsidade da matriz Lagrangeana é levada em consideração. Resultados dos testes realizados em 4 sistemas (3, 14, 30 e 118 barras) são apresentados.This work presents an approach on Newton\'s Method associated with the quadratic penalty function and the active set methods in the solution of Optimal Power Flow Problem (OPF). The general formulation of the OPF problem is presented, as will as the technique used in the equation systems resolution. The Lagrangean matrix factorization is carried out by elements instead of structures in blocks. The characteristic of sparsity of the Lagrangean matrix is taken in to account. Numerical results of tests realized in systems of 3, 14, 30 and 118 buses are presented to show the efficiency of the method.
39
Li, Bei. "Les arrhes : étude franco-chinoise." Thesis, Paris 2, 2015. http://www.theses.fr/2015PA020026/document.
Full textAbstract:
En choisissant les arrhes comme objet de comparaison entre le droit français et le droit chinois, la présente étude entend montrer le lien entre la technique juridique et la fonction juridique d'une part, la relation entre la fonction d'une institution et son régime juridique d'autre part.Le mécanisme et la fonction sont deux composantes distinctes de la convention d'arrhes. Les deux systèmes juridiques (la France et la Chine) connaissent le même mécanisme, les fonctions juridiques des arrhes s'éloignent cependant considérablement. Il y a en même temps une interdépendance entre ces deux éléments. D'une part, la fonction des arrhes détermine le rôle joue par le mécanisme. De l'autre côté, l'efficacité de la fonction juridique dépend largement du mécanisme sur lequel elle s'appuie. La divergence fonctionnelle des arrhes se répercute nécessairement sur le régime de cette convention. En premier lieu, le problème du contrôle juridique se pose dans des termes différents. En second lieu, les effets juridiques du jeu des arrhes ne sont pas les mêmes en présence de différentes fonctions. La présente étude montre la nécessité d'assurer une adéquation entre la fonction poursuivie et le régime adopté. A travers l'étude des arrhes, nous entendons survoler les deux systèmes juridiques dans leur ensemble, afin d'une part de permettre aux lecteurs français de mieux connaître le droit chinois, et d'autre part de mettre en lumière les divergences qui séparent les deux pays. L'exploitation de la jurisprudence chinoise constitue d'ailleurs une originalité marquée de la présente étudeBy choosing the earnest money as the subject of comparison, the present study tries to illustrate the relationship between the legal technique and the legal function on the one hand, between the function of a legal institution and its legal regime on the other.The technique and the function are two distinct components of the deposit. The technique of deposit is the same in the two contrary, where as its functions differs a lot. At the same time, there is an interdependance between those two elements. The function of the deposit determines the role played by the technique. In return, the efficiency of the function depends on the legal technique used. The functional difference also has an impact on the legal regime of the earnest money. Firstly, the problem of judicial control of the clause are not solved in the same way. Secondly, the legal effets produised by the contract of deposit varies according to the its different functions. The present study shows the necessity to assure the adequacy between the function of a institution and its legal regime.Through this research, we intend to provide an over view of the two legal systems, in order not only to give the french readers a complete picture about Chinese law, but also to bring to light the divergences which seperate French law and Chinese law. The massive use of the chinese courts' decisions constitute a remarquable feature of present work
40
Costa, Marina Teixeira [UNESP]. "Solução do problema de fluxo de potência ótimo com restrição de segurança e controles discretos utilizando o método primal-dual barreira logarítmica." Universidade Estadual Paulista (UNESP), 2016. http://hdl.handle.net/11449/148774.
Full textAbstract:
Submitted by Marina Teixeira Costa null (marinateixeiracosta@gmail.com) on 2017-02-14T14:27:15Z
No. of bitstreams: 1
Dissertação MARINA 12.pdf: 1807218 bytes, checksum: 95bc28b832360cf51847512b47b234d8 (MD5)Approved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-02-14T15:29:56Z (GMT) No. of bitstreams: 1 costa_mt_me_bauru.pdf: 1807218 bytes, checksum: 95bc28b832360cf51847512b47b234d8 (MD5)
Made available in DSpace on 2017-02-14T15:29:56Z (GMT). No. of bitstreams: 1 costa_mt_me_bauru.pdf: 1807218 bytes, checksum: 95bc28b832360cf51847512b47b234d8 (MD5) Previous issue date: 2016-12-16
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
O problema de Fluxo de Potência Ótimo determina a melhor condição de operação de um sistema elétrico de potência. Há diferentes classes de problemas de Fluxo de Potência Ótimo de acordo com os tipos de funções a serem otimizadas, e os conjuntos de controles e de restrições utilizados. Dentre elas, dá-se destaque ao problema de Fluxo de Potência Ótimo com Restrição de Segurança, o qual é uma importante ferramenta para os Operadores dos Sistemas de Transmissão, tanto para o planejamento operacional, quanto para a precificação da energia. Seu objetivo é minimizar os custos operacionais de geração de energia levando em consideração as restrições decorrentes da operação do sistema sob um conjunto de contingências. Ele é formulado como um problema de otimização não linear, não-convexo de grande porte, com variáveis contínuas e discretas. Neste trabalho investiga-se este problema em relação à sua formulação, dificuldades computacionais e método de solução. Para um tratamento do problema mais próximo à realidade adotam-se alguns controles como variáveis discretas, ou seja, os taps dos transformadores. Estes são tratados através de um método que penaliza a função objetivo quando as variáveis discretas assumem valores não discretos. Desta forma, o problema não linear discreto é transformado em um problema contínuo e o método Primal-Dual Barreira Logarítmica é utilizado em sua resolução. Testes computacionais são apresentados com o problema de Fluxo de Potência Ótimo com Restrição de Segurança associado ao sistema teste IEEE 14 barras em três etapas de teste. Os resultados obtidos e as comparações realizadas comprovam a eficiência do método de resolução escolhido
The Optimum Power Flow problem determines the best operating condition of an electric power system. There are different classes of Optimal Power Flow problems according to the types of functions to be optimized, and the sets of controls and constraints used. Among them, the problem of Optimal Power Flow with Security Constraint is highlighted, which is an important tool for the Transmission System operators, both for operational planning and for energy pricing. Its objective is to minimize the operational costs of power generation taking into account the constraints arising from the operation of the system under a set of contingencies. It is formulated as a nonlinear, nonconvex large optimization problem, of continuous and discrete variables. In this work, the problem in relation to its formulation, computational difficulties and solution method is investigated. For a treatment of the problem closest to the reality, some controls such as discrete variables, i.e. the taps of the transformers, are used. These are treated by a method that penalizes the objective function when the discrete variables assume non-discrete values. Thus, the discrete nonlinear problem is transformed into a continuous problem and the Primal-Dual Logarithmic Barrier method is used in its resolution. Computational tests are performed with the optimal power flow problem with security constraint associated with the test system of IEEE 14 bars in three test stages. The obtained results and the realized comparisons prove the efficiency of the chosen resolution method.
41
Lage, Guilherme Guimarães. "O fluxo de potência ótimo reativo com variáveis de controle discretas e restrições de atuação de dispositivos de controle de tensão." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/18/18154/tde-29042013-114259/.
Full textAbstract:
Este trabalho propõe um novo modelo e uma nova abordagem para resolução do problema de fluxo de potência ótimo reativo com variáveis de controle discretas e restrições de atuação de dispositivos de controle de tensão. Matematicamente, esse problema é formulado como um problema de programação não linear com variáveis contínuas e discretas e restrições de complementaridade, cuja abordagem para resolução proposta neste trabalho se baseia na resolução de uma sequência de problemas modificados pelo algoritmo da função Lagrangiana barreira modificada-penalidade-discreto. Nessa abordagem, o problema original é modificado da seguinte forma: 1) as variáveis discretas são tratadas como contínuas por funções senoidais incorporadas na função objetivo do problema original; 2) as restrições de complementaridade são transformadas em restrições de desigualdade equivalentes; e 3) as restrições de desigualdade são transformadas em restrições de igualdade a partir do acréscimo de variáveis de folga não negativas. Para resolver o problema modificado, a condição de não negatividade das variáveis de folga é tratada por uma função barreira modificada com extrapolação quadrática. O problema modificado é transformado em um problema Lagrangiano, cuja solução é determinada a partir da aplicação das condições necessárias de otimalidade. No algoritmo da função Lagrangiana barreira modificada-penalidade-discreto, uma sequência de problemas modificados é resolvida até que todas as variáveis do problema modificado associadas às variáveis discretas do problema original assumam valores discretos. Para demonstrar a eficácia do modelo proposto e a robustez dessa abordagem para resolução de problemas de fluxo de potência ótimo reativo, foram realizados testes com os sistemas elétricos IEEE de 14, 30, 57 e 118 barras e com o sistema equivalente CESP 440 kV de 53 barras. Os resultados mostram que a abordagem para resolução de problemas de programação não linear proposta é eficaz no tratamento de variáveis discretas e restrições de complementaridade.This work proposes a novel model and a new approach for solving the reactive optimal power flow problem with discrete control variables and voltage-control actuation constraints. Mathematically, such problem is formulated as a nonlinear programming problem with continuous and discrete variables and complementarity constraints, whose proposed resolution approach is based on solving a sequence of modified problems by the discrete penalty-modified barrier Lagrangian function algorithm. In this approach, the original problem is modified in the following way: 1) the discrete variables are treated as continuous by sinusoidal functions incorporated into the objective function of the original problem; 2) the complementarity constraints are transformed into equivalent inequality constraints; and 3) the inequality constraints are transformed into equality constraints by the addition of non-negative slack variables. To solve the modified problem, the non-negativity condition of the slack variables is treated by a modified barrier function with quadratic extrapolation. The modified problem is transformed into a Lagrangian problem, whose solution is determined by the application of the first-order necessary optimality conditions. In the discrete penalty- modified barrier Lagrangian function algorithm, a sequence of modified problems is successively solved until all the variables of the modified problem that are associated with the discrete variables of the original problem assume discrete values. The efectiveness of the proposed model and the robustness of this approach for solving reactive optimal power flow problems were verified with the IEEE 14, 30, 57 and 118-bus test systems and the 440 kV CESP 53-bus equivalent system. The results show that the proposed approach for solving nonlinear programming problems successfully handles discrete variables and complementarity constraints.
42
Kurfűrst, Jiří. "Optimalizace stroje s permanentními magnety na rotoru pomocí umělé inteligence." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2013. http://www.nusl.cz/ntk/nusl-233585.
Full textAbstract:
The dissertation thesis deal with the design and the optimization of the permanent magnet synchronous machine (SMPM) based on the artificial intelligence. The main target is to apply potential optimization methods on the design procedure of the machine and evaluate the effectiveness of optimization and the optimization usefulness. In general, the optimization of the material properties (NdFeB or SmCo), the efficiency maximization with given nominal input parameters, the cogging torque elimination are proposed. Moreover, the magnet shape optimization, shape of the air gap and the shape of slots were also performed. The well known Genetic algorithm and Self-Organizing migrating algorithm produced in Czech were presented and applied on the particular optimization issues. The basic principles (iterations) and definitions (penalty function and cost function) of proposed algorithms are demonstrated on the examples. The results of the vibration generator optimization (VG) with given power 7mW (0.1g acceleration) and the results of the SMPM 1,1kW (6 krpm) optimization are practically evaluated in the collaboration with industry. Proposed methods are useful for the optimization of PM machines and they are further theoretically applied on the low speed machine (10 krpm) optimization and high speed machine (120 krpm) optimization.
43
Montoya, Vivanco Yvan. "Approaches to a constitutional function on theory of crime." Pontificia Universidad Católica del Perú, 2013. http://repositorio.pucp.edu.pe/index/handle/123456789/115723.
Full textAbstract:
After presenting assumptions of neo constitutionalism impact incriminal law, this article raises the possibilities of rebuild contents of categories on crime’s theory towards fundamental principles and rights recognized (explicitly or implicitly) in the Constitution.Tras presentar los presupuestos del impacto del neoconstitucionalismo en el derecho penal, el presente artículo plantea las posibilidades de reconstruir los contenidos de las categorías de la teoría del delito hacia los principios y derechos fundamentales reconocidos (explícita o implícitamente) en la Constitución.
44
Vasconcelos, Fillipe Matos de. "Uma abordagem Lagrangiana na otimização Volt/VAr em redes de distribuição." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/18/18154/tde-06062017-072758/.
Full textAbstract:
Este projeto de pesquisa propõe desenvolver um novo modelo e uma nova abordagem para a resolução do problema da otimização Volt/VAr em redes de distribuição de energia elétrica. A otimização Volt/VAr consiste em, basicamente, determinar os ajustes das variáveis de controle tais como bancos de capacitores chaveados, transformadores com comutação de tap sob carga e reguladores de tensão, de modo a satisfazer, simultaneamente, as restrições de carga e de operação para um dado objetivo operacional. Esse problema, matematicamente, foi formulado como um problema de programação não linear, multiperíodo, e com variáveis contínuas e discretas. Algoritmos de programação não linear foram utilizados com o intuito de aproveitar as vantagens das matrizes altamente esparsas montadas ao longo do método de solução. Para utilizar tais algoritmos, as variáveis discretas são tratadas como contínuas por meio da utilização de funções senoidais que penalizam a função objetivo do problema original enquanto estas não convergirem para algum dos pontos pré-definidos no seu domínio. O caráter multiperíodo do problema, contudo, refere-se à consideração de uma restrição que relaciona os ajustes das variáveis de controle para sucessivos intervalos de tempo na medida em que limita o número de operações de chaveamento desses dispositivos para um período de 24-horas. O estudo fundamenta-se, metodologicamente, em métodos do tipo Primal-Dual Barreira-Logarítmica. Para demonstrar a eficiência do modelo proposto e a robustez dessa abordagem, a partir de dados teóricos obtidos de levantamentos bibliográficos, testes foram realizados em sistemas-teste de 10, 69 e 135 barras, e em um sistema de 442 barras do noroeste do Reino Unido. As implementações computacionais foram feitas nos softwares MATLAB, AIMMS e GAMS, utilizando o solver IPOPT como método de solução. Os resultados mostram que a abordagem proposta para a resolução do problema de programação não linear é eficaz para tratar adequadamente todas as variáveis presentes em problemas de otimização Volt/VAr.This work proposes a new model and a new approach for solving the Volt / VAr optimization problem in distribution systems. The Volt/VAr optimization consists, basically, to determine the settings of the control variables of switched capacitor banks, on-load tap changer transformers and voltage regulators, in order to satisfy both the load and operational constraints, to a given operational objective. The problem is formulated as a nonlinear programming problem, multiperiod, and with continuous and discrete variables. Nonlinear programming algorithms were used in order to take advantage of the highly sparse matrices built along the solution method. The discrete variables are treated as continuous along the solution method by means of the use of sinusoidal functions that penalize the original objective function while the control variables do not converge to any of the predefined discrete points in its domain. The multiperiod, or dynamic, characteristic of the problem, however, refers to the use of a constraint that relates the settings of the control variables for successive time intervals that limits the control devices switching operations number for a period of 24-hours. The study is based, methodologically, on Primal-Dual Logarithmic Barrier method. To demonstrate the effectiveness of the proposed model and the robustness of this approach, the data were obtained from theoretical literature surveys, and tests were performed on test-systems of 10, 69 and 135 buses, and in a 442 buses located in the Northwest of the United Kingdom. The computational implementation was accomplished in the softwares MATLAB, AIMMS and GAMS, using the IPOPT solver as solution method. The results have shown the approach for solving nonlinear programming problems is effective to appropriate cope with all the variables presented in Volt/VAr optimization problems.
45
Poole, Helen Louise. "An examination of the function of education in prisons : social, political and penal perspectives." Thesis, University of Birmingham, 2016. http://etheses.bham.ac.uk//id/eprint/6740/.
Full textAbstract:
This study aims to examine the function of education in prisons through the application of a unique analytical model. Prisoner education has become a primary focus for the rehabilitation of offenders, evidenced more recently by the announcement and abandonment of a network of privately run ‘Secure Colleges’ to replace the existing estate for young offenders. This research aims to form a better understanding of what such education provision is designed to achieve through an examination the social, political and penal context in which it has developed. Building on the work of Foucault (1979), Markus (1993) and King (1980) amongst others, the present study triangulates data from political discourse, prison architecture, and still images of prison learning spaces using an analytical model based on research findings from philosophical, sociological, penal and educational theories. The main findings of the study are that the enduring function of prison education is the control of the prisoner-class, which is highly related to the macro-management of the penal system (reducing reoffending) and economic production. The author argues such an approach ignores individual agency, and negatively impacts on approaches to prison education through the marginalisation of educational theory and pedagogic best practice.
46
Pelagia, Ioanna. "Variable selection of fixed effects and frailties for Cox Proportional Hazard frailty models and competing risks frailty models." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/variable-selection-of-fixed-effects-and-frailties-for-cox-proportional-hazard-frailty-models-and-competing-risks-frailty-models(c75c6314-f43e-4d69-a2de-942bece6a404).html.
Full textAbstract:
This thesis focuses on two fundamental topics, specifically in medical statistics: the modelling of correlated survival datasets and the variable selection of the significant covariates and random effects. In particular, two types of survival data are considered: the classical survival datasets, where subjects are likely to experience only one type of event and the competing risks datasets, where subjects are likely to experience one of several types of event. In Chapter 2, among other topics, we highlight the importance of adding frailty terms on the proposed models in order to account for the association between the survival time and characteristics of subjects/groups. The main novelty of this thesis is to simultaneously select fixed effects and frailty terms through the proposed statistical models for each survival dataset. Chapter 3 covers the analysis of the classical survival dataset through the proposed Cox Proportional Hazard (PH) model. Utilizing a Cox PH frailty model, may increase the dimension of variable components and estimation of the unknown coefficients becomes very challenging. The method proposed for the analysis of classical survival datasets involves simultaneous variable selection on both fixed effects and frailty terms through penalty functions. The benefit of penalty functions is that they identify the non-significant parameters and set them to have a zero effect in the model. Hence, the idea is to 'doubly-penalize' the partial likelihood of the Cox PH frailty model; one penalty for each term. Estimation and selection implemented through Newton-Raphson algorithms, whereas closed iterative forms for the estimation and selection of fixed effects and prediction of frailty terms were obtained. For the selection of frailty terms, penalties imposed on their variances since frailties are random effects. Based on the same idea, we further extend the simultaneous variable selection in the competing risks datasets in Chapter 4, using extended cause-specific frailty models. Two different scenarios are considered for frailty terms; in the first case we consider that frailty terms vary among different types of events (similar to the fixed effects) whereas in the second case we consider shared frailties over all the types of events. Moreover, our 'individual penalization' approach allows for one covariate to be significant for some types of events, in contrast to the frequently used 'group-penalization' where a covariate is entirely removed when it is not significant over all the events. For both proposed methods, simulation studies were conduced and showed that the proposed procedure followed for each analysis works well in simultaneously selecting and estimating significant fixed effects and frailty terms. The proposed methods are also applied to real datasets analysis; Kidney catheter infections, Diabetes Type 2 and Breast Cancer datasets. Association of the survival times and unmeasured characteristics of the subjects was studied as well as a variable selection for fixed effects and frailties implemented successfully.
47
Junior, Jony Arrais Pinto. "Seleção de covariáveis para modelos de sobrevivência via verossimilhança penalizada." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-28072009-214959/.
Full textAbstract:
A seleção de variáveis é uma importante fase para a construção de um modelo parcimonioso. Entretanto, as técnicas mais populares de seleção de variáveis, como, por exemplo, a seleção do melhor subconjunto de variáveis e o método stepwise, ignoram erros estocásticos inerentes à fase de seleção das variáveis. Neste trabalho, foram estudados procedimentos alternativos aos métodos mais populares para o modelo de riscos proporcionais de Cox e o modelo de Cox com fragilidade gama. Os métodos alternativos são baseados em verossimilhançaa penalizada e diferem dos métodos usuais de seleção de variáveis, pois têm como objetivo excluir do modelo variáveis não significantes estimando seus coeficientes como zero. O estimador resultante possui propriedades desejáveis com escolhas apropriadas de funções de penalidade e do parâmetro de suavização. A avaliação desses métodos foi realizada por meio de simulação e uma aplicação a um conjunto de dados reais foi considerada.Variable selection is an important step when setting a parsimonious model. However, the most popular variable selection techniques, such as the best subset variable selection and the stepwise method, do not take into account inherent stochastic errors in the variable selection step. This work presents a study of alternative procedures to more popular methods for the Cox proportional hazards model and the frailty model. The alternative methods are based on penalized likelihood and differ from the usual variable selection methods, since their objective is to exclude from the model non significant variables, estimating their coefficient as zero. The resulting estimator has nice properties with appropriate choices of penalty functions and the tuning parameter. The assessment of these methods was studied through simulations, and an application to a real data set was considered.
48
Nogueira, Rafael Fecury. "Pronúncia: valoração da prova e limites à motivação." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/2/2137/tde-20032013-143351/.
Full textAbstract:
O presente trabalho analisa a valoração da prova na decisão de pronúncia e os limites à sua motivação, realizando-se, inicialmente, um estudo sobre a origem dessa decisão com base em decisões de ordenamentos jurídicos passados. A regência legal da pronúncia é estudada para a compreensão de sua definição, requisitos, cognição e função que exerce no procedimento do Júri. Em relação à valoração da prova, objeto central do presente trabalho, estabelece-se um critério de decisão com base nos standards de prova da autoria ou da participação. A motivação é estudada para a verificação do funcionamento dos limites impostos pela lei a ela.This study examines the valuation of proof in the indictment decision and the justification, and where, inictially a study about the origin of this decision based on pás legal decisions. The rulership to indictment is studied to understand its definition, requirements, cognition and the function that performs the procedure os the Jury. Regardin the evidence of proof, the central object of the present study we establish a decision criterion based on the standards of proof to autorship. The justification is studied to verifythe functioning of the limits imposed by law to it
49
Svensson, Daniel. "Generaliseringsförmåga vid genetisk programmering." Thesis, University of Skövde, Department of Computer Science, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-789.
Full textAbstract:
I detta arbete undersöks hur bestraffningsmetoder för att bestraffa storleken på GP-program påverkar generaliseringsförmågan. Arbetet grundar sig på ett arbete som Cavaretta och Chellapilla gjort, där de undersöker skillnaden i generaliseringsförmåga mellan bestraffningsmetoden ”Complexity Penalty functions” och ingen bestraffningsmetod.
I detta arbete har nya experiment gjorts med ”Complexity Penalty functions” och ”Adaptive parsimony pressure”, som är en annan bestraffningsmetod. Dessa bestraffningsmetoder har undersökts i samma domän som Cavaretta och Chellapilla och ytterligare i en domän för att ge en bättre bild av hur de generaliserar.
I arbetet visar det sig att användningen av någon av bestraffningsmetoderna ”Complexity Penalty functions” och ”Adaptive parsimony pressure” oftast ger bättre generaliseringsförmåga hos GP-program. Detta motsäger det Cavaretta och Chellapilla kommer fram till i sitt arbete. ”Adaptive parsimony pressure” verkar också vara bättre på att generalisera än ”Complexity Penalty functions”.
50
Mounirou, Arouna Lukman Moctar. "Construction automatique d'images de pseudo-âges géologiques à partir d'images sismiques par minimisation d'énergie." Thesis, Bordeaux, 2018. http://www.theses.fr/2018BORD0232/document.
Full textAbstract:
A partir d’un ensemble de données interprétées et issues d’une analyse préalable par un opérateur expert (horizons, failles), l’objectif de la thèse est de proposer une segmentation d’une image sismique sous-jacente en parfaite cohérence avec les lois de la géologie. L’originalité de la démarche consistera à développer des techniques de segmentation d’images sismiques, entre autres basées sur des approches de type contours actifs, contraintes par des données interprétées en supplément de propriétés intrinsèques calculées par des procédés automatiques à partir de la donnée traitée sans nécessiter une quelconque supervision contrairement aux travaux existants. Un deuxième axe consistera à ordonnancer automatiquement les horizons (surfaces) interprétés et analyser finement chaque intervalle (le lieu existant entre deux horizons), en prenant en compte son contenu (amplitude, orientation, etc.). Tout cela aboutissant à la reconstruction du pseudo-temps géologiqueThe objective of the thesis is to propose a segmentation of an underlying seismic image in perfect coherence with the results of a preliminary analysis by an expert (horizons, faults). laws of geology. The originality of the approach will be to develop techniques for segmenting seismic images, among others based on active contour type approaches, constrained by data interpreted in addition to intrinsic properties calculated by automatic processes from the data processed without requiring any supervision in contrast to existing work. A second axis will be to automatically schedule the horizons (surfaces) interpreted and to analyze each interval (the place between two horizons) finely, taking into account its content (amplitude, orientation, etc.). All this resulted in the reconstruction of the geological pseudo-time