On the Dilemma of Contemporary Liberal Theory of Moral Rights for Penalty Justification——Exemplified by the Right to Personal Liberty

Contemporary liberal theory on moral rights argues that moral rights associated with personal liberty constitute a strong constraint on the boundaries of state power.Therefore,the core issue of the penalty justification is not the purpose of the penalty,but the reason for the penalty to refrain from infringing on the moral rights of individuals.In order to justify the penal system,scholars have explored solutions such as limiting the content of rights,waiving rights,and finally rights forfeiture.However,the concept of rights forfeiture cannot be reasonably integrated into the framework of the liberal theory of moral rights.The failure of these attempts stems from the patchwork understanding of rights presupposed by the liberal theory of moral rights.There is another systematic way of understanding rights that offers a better justification.Individual rights are not an independent non-derivative moral justification,and both individual rights and the penal power of the state are only part of a specific(realistic or ideal)system of rules that collectively serve certain values.The real question of penalty justification is not why the punishment does not infringe on the moral rights of individuals,but whether the overall institutional arrangements,including the penal system,are justifiable for all citizens,including the punished.

A Credit Card Fraud Model Prediction Method Based on Penalty Factor Optimization AWTadaboost

With the popularity of online payment, how to perform creditcard fraud detection more accurately has also become a hot issue. And withthe emergence of the adaptive boosting algorithm (Adaboost), credit cardfraud detection has started to use this method in large numbers, but thetraditional Adaboost is prone to overfitting in the presence of noisy samples.Therefore, in order to alleviate this phenomenon, this paper proposes a newidea: using the number of consecutive sample misclassifications to determinethe noisy samples, while constructing a penalty factor to reconstruct thesample weight assignment. Firstly, the theoretical analysis shows that thetraditional Adaboost method is overfitting in a noisy training set, which leadsto the degradation of classification accuracy. To this end, the penalty factorconstructed by the number of consecutive misclassifications of samples isused to reconstruct the sample weight assignment to prevent the classifierfrom over-focusing on noisy samples, and its reasonableness is demonstrated.Then, by comparing the penalty strength of the three different penalty factorsproposed in this paper, a more reasonable penalty factor is selected.Meanwhile, in order to make the constructed model more in line with theactual requirements on training time consumption, the Adaboost algorithmwith adaptive weight trimming (AWTAdaboost) is used in this paper, so thepenalty factor-based AWTAdaboost (PF_AWTAdaboost) is finally obtained.Finally, PF_AWTAdaboost is experimentally validated against other traditionalmachine learning algorithms on credit card fraud datasets and otherdatasets. The results show that the PF_AWTAdaboost method has betterperformance, including detection accuracy, model recall and robustness, thanother methods on the credit card fraud dataset. And the PF_AWTAdaboostmethod also shows excellent generalization performance on other datasets.From the experimental results, it is shown that the PF_AWTAdaboost algorithmhas better classification performance.

Efficient Optimal Routing Algorithm Based on Reward and Penalty for Mobile Adhoc Networks

Mobile adhoc networks have grown in prominence in recent years,and they are now utilized in a broader range of applications.The main challenges are related to routing techniques that are generally employed in them.Mobile Adhoc system management,on the other hand,requires further testing and improvements in terms of security.Traditional routing protocols,such as Adhoc On-Demand Distance Vector(AODV)and Dynamic Source Routing(DSR),employ the hop count to calculate the distance between two nodes.The main aim of this research work is to determine the optimum method for sending packets while also extending life time of the network.It is achieved by changing the residual energy of each network node.Also,in this paper,various algorithms for optimal routing based on parameters like energy,distance,mobility,and the pheromone value are proposed.Moreover,an approach based on a reward and penalty system is given in this paper to evaluate the efficiency of the proposed algorithms under the impact of parameters.The simulation results unveil that the reward penalty-based approach is quite effective for the selection of an optimal path for routing when the algorithms are implemented under the parameters of interest,which helps in achieving less packet drop and energy consumption of the nodes along with enhancing the network efficiency.

Using Hybrid Penalty and Gated Linear Units to Improve Wasserstein Generative Adversarial Networks for Single-Channel Speech Enhancement

Recently,speech enhancement methods based on Generative Adversarial Networks have achieved good performance in time-domain noisy signals.However,the training of Generative Adversarial Networks has such problems as convergence difficulty,model collapse,etc.In this work,an end-to-end speech enhancement model based on Wasserstein Generative Adversarial Networks is proposed,and some improvements have been made in order to get faster convergence speed and better generated speech quality.Specifically,in the generator coding part,each convolution layer adopts different convolution kernel sizes to conduct convolution operations for obtaining speech coding information from multiple scales;a gated linear unit is introduced to alleviate the vanishing gradient problem with the increase of network depth;the gradient penalty of the discriminator is replaced with spectral normalization to accelerate the convergence rate of themodel;a hybrid penalty termcomposed of L1 regularization and a scale-invariant signal-to-distortion ratio is introduced into the loss function of the generator to improve the quality of generated speech.The experimental results on both TIMIT corpus and Tibetan corpus show that the proposed model improves the speech quality significantly and accelerates the convergence speed of the model.

Property Study of Daily Consecutive Penalty Provision in Environment Laws of Taiwan Region

For the person violating prevention and control measures or has caused pollution, environment laws all set penalty provision. Moreover, for the person still does not improve within limited period, there is daily consecutive penalty provision. For that legal properties of these daily consecutive penalty provisions are administrative order penalty or administrative execution penalty,judicial practice in Taiwan always has different views. The target of ＂daily consecutive penalty＇ is compelling doers to fulfill their obligations or improve illegal state by continuously increasing property burden of obligor. The emphasis is fulfilling future responsibility or improving future,but not punishing the past violations. To realize the target of com- pelling obligor to improve,we should take administrative compulsory execution means. So, for the property of daily consecutive penalty,we should cleady position daily consecutive penalty as administrative execution penalty,and not only its penalty target has difference with administrative order penalty, but also made way and law enforcement focus are different from administrative order penalty.

Exactness of penalization for exact minimax penalty function method in nonconvex programming

The exact minimax penalty function method is used to solve a noncon- vex differentiable optimization problem with both inequality and equality constraints. The conditions for exactness of the penalization for the exact minimax penalty function method are established by assuming that the functions constituting the considered con- strained optimization problem are invex with respect to the same function η （with the exception of those equality constraints for which the associated Lagrange multipliers are negative these functions should be assumed to be incave with respect to η）. Thus, a threshold of the penalty parameter is given such that, for all penalty parameters exceeding this threshold, equivalence holds between the set of optimal solutions in the considered constrained optimization problem and the set of minimizer in its associated penalized problem with an exact minimax penalty function. It is shown that coercivity is not suf- ficient to prove the results.

General Exact Penalty Functions in Integer Programming

In this paper, the general exact penalty functions in integer programming were studied. The conditions which ensure the exact penalty property for the general penalty function with one penalty parameter were given and a general penalty function with two parameters was proposed.

Method for electromagnetic detection satellites scheduling based on genetic algorithm with alterable penalty coefficient

The electromagnetic detection satellite （EDS） is a type of earth observation satellites （EOSs）. The Information collected by EDSs plays an important role in some fields, such as industry, science and military. The scheduling of EDSs is a complex combinatorial optimization problem. Current research mainly focuses on the scheduling of imaging satellites and SAR satellites, but little work has been done on the scheduling of EDSs for its specific characteristics. A multi-satellite scheduling model is established, in which the specific constrains of EDSs are considered, then a scheduling algorithm based on the genetic algorithm （GA） is proposed. To deal with the specific constrains of EDSs, a penalty function method is introduced. However, it is hard to determine the appropriate penalty coefficient in the penalty function. Therefore, an adaptive adjustment mechanism of the penalty coefficient is designed to solve the problem, as well as improve the scheduling results. Experimental results are used to demonstrate the correctness and practicability of the proposed scheduling algorithm.

Cross the chasm from the immediate execution of death penalty to the death sentence with a reprieve --- Interpretation of the ＂not to execute immediately＂

Retaining the death penalty and strict restricting the application of the death penalty is now a basic criminal policy in China, and from the judicial level, the key to the restriction of the death penalty is to study what lenient sentencing discretion the criminal has to constitute ＂not to execute immediately＂ when he has reached the standard of the immediate execution of the death penalty, to cross the chasm from the immediate execution of the death penalty to the death sentence with a reprieve. The basic process of the sentencing is to establish a baseline punishment on the basis of the social harmfulness of the activities of the criminal, and then measure the profits and losses according to the offender＇s personal danger. Therefore, although the social harmfulness of the activities of the criminal reaches the standard of the ＂most heinous crimes＂, due to the existence of the fault of the victim, active compensation for the victim, and the motives of the small blames and other lenient sentencing discretions, the criminal＇s danger has not reached the degree of ＂flagrance＂. Apply the death sentence with a two-year reprieve and even the life imprisonment generally. If there are some strict sentencing discretions, such as ＂the crime means is extremely cruel＂, carefully consider the use of the immediate execution of the death penalty. Under the circumstances of the concurrence of the sentencing, carry on the overall consideration based on the comprehensive measurement of various circumstances of the sentencing.

Novel Discrete Particle Swarm Optimization Based on Huge Value Penalty for Solving Engineering Problem

For the purpose of solving the engineering constrained discrete optimization problem, a novel discrete particle swarm optimization（DPSO） is proposed. The proposed novel DPSO is based on the idea of normal particle swarm optimization（PSO）, but deals with the variables as discrete type, the discrete optimum solution is found through updating the location of discrete variable. To avoid long calculation time and improve the efficiency of algorithm, scheme of constraint level and huge value penalty are proposed to deal with the constraints, the stratagem of reproducing the new particles and best keeping model of particle are employed to increase the diversity of particles. The validity of the proposed DPSO is examined by benchmark numerical examples, the results show that the novel DPSO has great advantages over current algorithm. The optimum designs of the 100-1 500 mm bellows under 0.25 MPa are fulfilled by DPSO. Comparing the optimization results with the bellows in-service, optimization results by discrete penalty particle swarm optimization（DPPSO） and theory solution, the comparison result shows that the global discrete optima of bellows are obtained by proposed DPSO, and confirms that the proposed novel DPSO and schemes can be used to solve the engineering constrained discrete problem successfully.

A DUAL-RELAX PENALTY FUNCTION APPROACH FOR SOLVING NONLINEAR BILEVEL PROGRAMMING WITH LINEAR LOWER LEVEL PROBLEM

The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.

Yield penalty of maize(Zea mays L.) under heat stress in different growth stages: A review

Maize(Zea mays L.) can exhibit yield penalties as a result of unfavorable changes to growing conditions. The main threat to current and future global maize production is heat stress. Maize may suffer from heat stress in all of the growth stages, either continuously or separately. In order to manage the impact of climate driven heat stress on the different growth stages of maize, there is an urgent need to understand the similarities and differences in how heat stress affects maize growth and yield in the different growth stages. For the purposes of this review, the maize growth cycle was divided into seven growth stages, namely the germination and seedling stage, early ear expansion stage, late vegetative growth stage before flowering, flowering stage, lag phase, effective grain-filling stage, and late grain-filling stage. The main focus of this review is on the yield penalty and the potential physiological changes caused by heat stress in these seven different stages. The commonalities and differences in heat stress related impacts on various physiological processes in the different growth stages are also compared and discussed. Finally, a framework is proposed to describe the main influences on yield components in different stages, which can serve as a useful guide for identifying management interventions to mitigate heat stress related declines in maize yield.

THE RISK MODEL OF THE EXPECTED DISCOUNTED PENALTY FUNCTION WITH CONSTANT INTEREST FORCE

In this article, the expected discounted penalty function Фδ,α （u） with constant interest δ and ＂discounted factor＂ exp（-αTδ） is considered. As a result, the integral equation of Фδ,α （u） is derived and an exact solution for Фδ,α （0） is found. The relation between the joint density of the surplus immediately prior to ruin, and the deficit at ruin and the density of the surplus immediately prior to ruin is then obtained based on analytical methods.

NONLINEAR PROGRAMMING VIA AN EXACT PENALTY FUNCTION：CONVERGENCE RATE ANALYSIS

The algorithm proposed by T. F. Colemen and A. R. Conn is improved in this paper, and the improved algorithm can solve nonlinear programming problem with quality constraints. It is shown that the improved algorithm possesses global convergence, and under some conditions, it possesses locally supperlinear convergence.

Superconvergence of nonconforming finite element penalty scheme for Stokes problem using L^2 projection method

A modified penalty scheme is discussed for solving the Stokes problem with the Crouzeix-Raviart type nonconforming linear triangular finite element. By the L^2 projection method, the superconvergence results for the velocity and pressure are obtained with a penalty parameter larger than that of the classical penalty scheme. The numerical experiments are carried out to confirm the theoretical results.

Convergence of Online Gradient Method with Penalty for BP Neural Networks

Online gradient method has been widely used as a learning algorithm for training feedforward neural networks. Penalty is often introduced into the training procedure to improve the generalization performance and to decrease the magnitude of network weights. In this paper, some weight boundedness and deterministic con- vergence theorems are proved for the online gradient method with penalty for BP neural network with a hidden layer, assuming that the training samples are supplied with the network in a fixed order within each epoch. The monotonicity of the error function with penalty is also guaranteed in the training iteration. Simulation results for a 3-bits parity problem are presented to support our theoretical results.

Optimal congestion control algorithm for ad hoc networks: Penalty function-based approach

In this paper, based on the inherent characteristic of the contention relation between flows in ad hoc networks, we introduce the notion of the link＇s interference set, extend the utility maximization problem representing congestion control in wireline networks to ad hoc networks, apply the penalty function approach and the subgradient method to solve this problem, and propose the congestion control algorithm Penalty function-based Optical Congestion Control （POCC） which is implemented in NS2- simulator. Specifically, each link transmits periodically the information on its congestion state to its interference set; the set ; the sermon at each source adjusts the transmission rate based on the optimal tradeoffbetween the utility value and the congestion level which the interference set of the links that this session goes though suffers from. MATLAB-based simulation results showed that POCC can approach the globally optimal solution. The NS2-based simulation results showed that POCC outperforms default TCP and ATCP to achieve efficient and fair resource allocation in ad hoc networks.

EXPECTED DISCOUNTED PENALTY FUNCTION OF ERLANG(2) RISK MODEL WITH CONSTANT INTEREST

The purpose of this paper is to consider the expected value of a discounted penalty due at ruin in the Erlang（2） risk process under constant interest force. An integro-differential equation satisfied by the expected value and a second-order differential equation for the Laplace transform of the expected value are derived. In addition, the paper will present the recursive algorithm for the joint distribution of the surplus immediately before ruin and the deficit at ruin. Finally, by the differential equation, the defective renewal equation and the explicit expression for the expected value are given in the interest-free case.

Elastoplastic analysis of solid structures using penalty-based couple stress finite element method within framework of Cosserat continuum

To obviate the complexities of the straight forward couple stress finite element method,the penalty-based couple stress finite element method(named PcouFEM)within the framework of the Cosserat continuum is utilized to obtain the approximate solution by relaxing the C1 continuity.To examine the performance of the PcouFEM,three well known numerical examples are investigated.For the analysis on stress concentration around the circular hole of the plane strain specimen,it was found that as long as the penalty factor G_(c) is not less than 5 times the shear modulus of the classical continuum G(i.e.,G_(c)≥5G),the stress concentration factors calculated by the PcouFEM with the reduced integration scheme agree well with the analytical solutions.For the strain localization analysis in the uniaxial compression test,it was observed that by applying the PcouFEM,the pathologically mesh-dependent problem associated with the conventional FEM can be alleviated or even removed,and based on numerical simulations,it is recommended to define 5G≤G_(c)≤10G from the perspective of numerical accuracy.For the soil slope subjected to an eccentric load through the rigid strip footing,it was found that the mesh-dependent problem of the shear band simulation can be largely alleviated by applying the PcouFEM.

THE CONVERGENCE OF APPROACH PENALTY FUNCTION METHOD FOR APPROXIMATE BILEVEL PROGRAMMING PROBLEM

In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem. the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel programming. The presented algorithm is completely different from existing methods. That convergence for this algorithm is proved.