Antiviral software systems (AVSs) have problems in identifying polymorphic variants of viruses without explicit signatures for such variants. Alignment-based techniques from bioinformatics may provide a novel way to g...Antiviral software systems (AVSs) have problems in identifying polymorphic variants of viruses without explicit signatures for such variants. Alignment-based techniques from bioinformatics may provide a novel way to generate signatures from consensuses found in polymorphic variant code. We demonstrate how multiple sequence alignment supplemented with gap penalties leads to viral code signatures that generalize successfully to previously known polymorphic variants of JS. Cassandra virus and previously unknown polymorphic variants of W32.CTX/W32.Cholera and W32.Kitti viruses. The implications are that future smart AVSs may be able to generate effective signatures automatically from actual viral code by varying gap penalties to cover for both known and unknown polymorphic variants.展开更多
Nonconvex penalties including the smoothly clipped absolute deviation penalty and the minimax concave penalty enjoy the properties of unbiasedness, continuity and sparsity,and the ridge regression can deal with the co...Nonconvex penalties including the smoothly clipped absolute deviation penalty and the minimax concave penalty enjoy the properties of unbiasedness, continuity and sparsity,and the ridge regression can deal with the collinearity problem. Combining the strengths of nonconvex penalties and ridge regression（abbreviated as NPR）, we study the oracle property of the NPR estimator in high dimensional settings with highly correlated predictors, where the dimensionality of covariates pn is allowed to increase exponentially with the sample size n. Simulation studies and a real data example are presented to verify the performance of the NPR method.展开更多
Recently,reform on charges against dangerous driving has stirred up debate among the public.A new stipulation by China’s Supreme People’s court which took effect on May 1 granted judges the discretion to decide whet...Recently,reform on charges against dangerous driving has stirred up debate among the public.A new stipulation by China’s Supreme People’s court which took effect on May 1 granted judges the discretion to decide whether someone caught driving under the influence of alcohol should be held criminal responsible by taking into account how drunk the person is,road conditions and the seriousness of damages.展开更多
On August 28, 2005, China＇s highest legislature adopted the Law on Penalties in Respect to Public Security Management （hereinafterrefen＇ed to as the Public Security Penalties Law for short）. The Law, adopted at th...On August 28, 2005, China＇s highest legislature adopted the Law on Penalties in Respect to Public Security Management （hereinafterrefen＇ed to as the Public Security Penalties Law for short）. The Law, adopted at the 17th meeting of the Standing Committee of the Tenth National People＇s Congress, shall become effective for implementation on March 1, 2006 to replace the Regulations on Penalties in Respect to Public： Security Management （Herein after referred to as the Public Security Penalties Regulations for short） that has been in practice for 18 years.展开更多
A new traffic regulation that penalizes drivers for running yellow lights has stirred up contro- versy since it took effect on January 1, 2013. Under the new regulation, the strictest to date in China, drivers running...A new traffic regulation that penalizes drivers for running yellow lights has stirred up contro- versy since it took effect on January 1, 2013. Under the new regulation, the strictest to date in China, drivers running a yellow traffic light will have six points deducted from the 12 points allocated to their driver＇s licenses. Previously, drivers were docked only three points for driv- ing through red light.展开更多
Capacitated facility location problem(CFLP)is a classical combinatorial optimization problem that has various applications in operations research,theoretical computer science,and management science.In the CFLP,we have...Capacitated facility location problem(CFLP)is a classical combinatorial optimization problem that has various applications in operations research,theoretical computer science,and management science.In the CFLP,we have a potential facilities set and a clients set.Each facility has a certain capacity and an open cost,and each client has a spliitable demand that need to be met.The goal is to open some facilities and assign all clients to these open facilities so that the total cost is as low as possible.The CFLP is NP-hard(non-deterministic polynomial-hard),and a large amount of work has been devoted to designing approximation algorithms for CFLP and its variants.Following this vein,we introduce a new variant of CFLP called capacitated uniform facility location problem with soft penalties(CUFLPSP),in which the demand of each client can be partially rejected by paying penalty costs.As a result,we present a linear programming-rounding(LP-rounding)based 5.5122-approximation algorithm for the CUFLPSP.展开更多
In the k-product uncapacitated facility location problem with penalties,we are given a set of demand points where clients are located and a set of potential sites where facilities with unlimited capacities can be open...In the k-product uncapacitated facility location problem with penalties,we are given a set of demand points where clients are located and a set of potential sites where facilities with unlimited capacities can be opened.There are k different kinds of products to be supplied by a set of open facilities.Each open facility can supply only a distinct product with a non-negative fixed cost determined by the product it wants to supply.Each client is either supplied with k kinds of products by a set of k different open facilities or completely rejected.There is a non-negative service cost between each pair of locations and also a penalty cost for each client if its service is rejected.These service costs are assumed to be symmetric and satisfy the triangle inequality.The goal is to select a set of clients to reject their service and then choose a set of facilities to be opened to service the remaining clients so that the total cost of opening facilities,servicing the clients,and the penalty is minimized.We address two different integer programs to describe the problem.Based on the linear programming rounding technique,we propose a(2k+1)-approximation algorithm for this problem.展开更多
The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general forms of the pen...The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general forms of the penalties by Beale and Small and the stronger penalties by Tomlin, describes the modifications of these penalties used for the method of bounded variables. The same examples from Petersen are taken and the satisfactory results are shown in comparison with those obtained by Tomlin.展开更多
Because governments have introduced policies involving incentives and penalties to promote the recycling of plastic waste,it is important to understand the impact of such incentives and penalties on the willingness of...Because governments have introduced policies involving incentives and penalties to promote the recycling of plastic waste,it is important to understand the impact of such incentives and penalties on the willingness of stakeholders to participate.In this study,government is included as a player,alongside waste collectors and recyclers,in a tripartite evolutionary game model of plastic waste recycling.The study explores the evolutionary equilibrium and performs a simulation analysis to elucidate the effect of government incentives and penalties on the willingness of other players to participate in recycling.Three conclusions are drawn from this research.First,an increase in incentives or in penalties increases the probability that collectors and recyclers will participate in the recycling process.Second,policy support incentives encourage collectors and recyclers to participate in plastic waste recycling earlier than subsidy incentives do.Finally,recyclers are more sensitive than collectors to government-imposed penalties.展开更多
The extant literature offers extensive support for the significant role played by institutions in financial markets,but implicit regulation and monitoring have yet to be examined.This study fills this void in the lite...The extant literature offers extensive support for the significant role played by institutions in financial markets,but implicit regulation and monitoring have yet to be examined.This study fills this void in the literature by employing unique Chinese datasets to explore the implicit regulation and penalties imposed by the Chinese government in regulating the initial public offering(IPO) market.Of particular interest are the economic consequences of underwriting IPO deals for client firms that violate regulatory rules in China's capital market.We provide evidence to show that the associated underwriters' reputations are impaired and their market share declines.We further explore whether such negative consequences result from a market disciplinary mechanism or a penalty imposed by the government.To analyze the possibility of a market disciplinary mechanism at work,we investigate(1) the market reaction to other client firms whose IPO deals were underwritten by underwriters associated with a violation at the time the violation was publicly disclosed and(2) the under-pricing of IPO deals undertaken by these underwriters after such disclosure.To analyze whether the government imposes an implicit penalty,we examine the application processing time for future IPO deals underwritten by the associated underwriters and find it to be significantly longer than for IPO deals underwritten by other underwriters.Overall,there is little evidence to suggest that the market penalizes underwriters for the rule-violating behavior of their client firms in China.Instead,the Chinese government implicitly penalizes them by imposing more stringent criteria on and lengthening the processing time of the IPO deals they subsequently underwrite.展开更多
As a classic NP-hard problem in machine learning and computational geometry,the k-means problem aims to partition the given dataset into k clusters according to the minimal squared Euclidean distance.Different from k-...As a classic NP-hard problem in machine learning and computational geometry,the k-means problem aims to partition the given dataset into k clusters according to the minimal squared Euclidean distance.Different from k-means problem and most of its variants,fuzzy k-means problem belongs to the soft clustering problem,where each given data point has relationship to every center point.Compared to fuzzy k-means problem,fuzzy k-means problem with penalties allows that some data points need not be clustered instead of being paid penalties.In this paper,we propose an O(αk In k)-approximation algorithm based on seeding algorithm for fuzzy k-means problem with penalties,whereαinvolves the ratio of the maximal penalty value to the minimal one.Furthermore,we implement numerical experiments to show the effectiveness of our algorithm.展开更多
Making profits is not the only goal for central SOE executives as they face repercussions for failure to reduce emissions The State-Owned Assets Supervisionand Administration Commission(SASAC),which supervises
If you’re thinking of slapping someone in public,not only do you have anger issues to deal with,but now you could be on the receiving end of a hefty fine. In a bid to clamp down on public vio- lence,a growing number ...If you’re thinking of slapping someone in public,not only do you have anger issues to deal with,but now you could be on the receiving end of a hefty fine. In a bid to clamp down on public vio- lence,a growing number of grassroots police authorities around China are experimenting with a new fistfight prevention policy. Simply put,the core of the policy is to com- pile a so-called"fistfight cost sheet,"which lists the specific punishment for those who involve themselves in fistfights as opposed to previous relevant statutes,such as the Law on Administrative Penalty,which are vague. Police are hoping this initiative will help to curb public violence due to its financial deterrent.展开更多
This paper investigates the ordering policy for the newsvendor problem with customer balking and penalties for balking and stockout. Our analysis is based on the assumption that only the mean and the variance of the d...This paper investigates the ordering policy for the newsvendor problem with customer balking and penalties for balking and stockout. Our analysis is based on the assumption that only the mean and the variance of the demand distribution are known. In contrast to the existing research, we provide a new tradeoff tool as a replacement of the traditional one to weigh the holding cost and the goodwill cost segment： the balking penalty cost and the stockout penalty cost. Specifically, in addition to the stockout penalty, we also introduce the balking penalty, provide a new proof of the optimality of robust ordering policy to guarantee that the lower bound of expected profit obtained by us is tight, and get an robust optimal order quantity which is an exact solution but not an approximate one as before. Numerical experiments are conducted to illustrate the effect of penalties for balking and stockout.展开更多
This article addresses the problem of scheduling n jobs with a common due date on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties.We investigate the problem under the conditions t...This article addresses the problem of scheduling n jobs with a common due date on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties.We investigate the problem under the conditions that the uptimes follow an exponential distribution,and the objective measure in detail is to minimize the expected sum of the absolute deviations of completion times from the common due date.We proceed to study in two versions (the downtime follows an exponential distribution or is a constant entailed for the repeat model job),one of which is the so-called preempt- resume version,the other of which is the preempt-repeat version.Three terms of work have been done.(i)Formulations and Preliminaries.A few of necessary definitions,relations and basic facts are established.In particular,the conclusion that the expectation of the absolute deviation of the completion time about a job with deterministic processing time t from a due date is a semi-V-shape function in t has been proved.(ii) Properties of Optimal Solutions.A few characteristics of optimal solutions are established.Most importantly,the conclusion that optimal solutions possess semi-V- shape property has been proved.(iii) Algorithm.Some computing problems on searching for optimal solutions are discussed.展开更多
According to the risk management and reputation insurance theory of corporate social responsibility, corporate donations can help a company to repair its reputation after a crisis.This study uses a propensity score ma...According to the risk management and reputation insurance theory of corporate social responsibility, corporate donations can help a company to repair its reputation after a crisis.This study uses a propensity score matching–difference in difference(PSM + DID) methodology to investigate the charitable donation activities of companies that have been subject to regulatory penalties.The analysis of a sample of A-share listed companies in the 2004–2016 period shows that companies significantly increase their charitable donations after regulatory penalties, but this effect weakens over time.Further analysis reveals that non-state-owned companies, companies with higher ownership concentrations, and companies receiving severer penalties are more motivated to make donations after regulatory penalties.By studying the reputation repair behavior of companies that have been subject to regulatory penalties, this study offers further support for the risk management and reputation insurance theory of corporate social responsibility.It also enriches our understanding of companies’ active responses to regulatory penalties and provides insights into companies’ motives for making charitable donations.展开更多
In this paper,we consider the parallel-machine customer order scheduling with delivery time and submodular rejection penalties.In this problem,we are given m dedicated machines in parallel and n customer orders.Each o...In this paper,we consider the parallel-machine customer order scheduling with delivery time and submodular rejection penalties.In this problem,we are given m dedicated machines in parallel and n customer orders.Each order has a delivery time and consists of m product types and each product type should be manufactured on a dedicated machine.An order is either rejected,in which case a rejection penalty has to be paid,or accepted and manufactured on the m dedicated machines.The objective is to find a solution to minimize the sum of the maximum delivery completion time of the accepted orders and the penalty of the rejected orders which is determined by a submodular function.We design an LP rounding algorithm with approximation ratio of n+1 for this problem.展开更多
This paper provides an overview of judicial decisions on lawsuits against regulatory penalties imposed on nonprofessional taxi drivers and ride-hailing platform operators in China and the European Union （especially G...This paper provides an overview of judicial decisions on lawsuits against regulatory penalties imposed on nonprofessional taxi drivers and ride-hailing platform operators in China and the European Union （especially Germany）. Despite strikingly different facts in these cases, courts in both China and the EU are frequently called upon to rule on similar legal issues, including the applicability of old regulatory rules to new forms of transport services, the regulatory bar for the operation of emerging transport models, and the proper intensity of competition in taxi markets. The comparison of such cases suggests that for deciding the regulatory schemes of the innovative economy of transport services, the judicial system is not better suited than the regulatory system, especially the regulatory authority of the central government. Moreover, an experimental regulatory approach with minimum standards is arguably a feasible option that can fit with the emerging nature of innovative businesses.展开更多
We study a problem called the k-means problem with penalties(k-MPWP),which is a natural generalization of the typical k-means problem.In this problem,we have a set D of client points in R^(d),a set F of possible cente...We study a problem called the k-means problem with penalties(k-MPWP),which is a natural generalization of the typical k-means problem.In this problem,we have a set D of client points in R^(d),a set F of possible centers in R^(d),and a penalty cost Pj>O for each point j∈D.We are also given an integer k which is the size of the center point set.We want to find a center point set S■F with size k,choose a penalized subset of clients P■D,and assign every client in D\P to its open center.Our goal is to minimize the sum of the squared distances between every point in D\P to its assigned centre point and the sum of the penalty costs for all clients in P.By using the multi-swap local search technique and under the fixed-dimensional Euclidean space setting,we present a polynomial-time approximation scheme(PTAS)for the k-MPWP.展开更多
Most material distribution-based topology optimization methods work on a relaxed form of the optimization problem and then push the solution toward the binary limits.However,when benchmarking these methods,researchers...Most material distribution-based topology optimization methods work on a relaxed form of the optimization problem and then push the solution toward the binary limits.However,when benchmarking these methods,researchers use known solutions to only a single form of benchmark problem.This paper proposes a comparison platform for systematic benchmarking of topology optimization methods using both binary and relaxed forms.A greyness measure is implemented to evaluate how far a solution is from the desired binary form.The well-known ZhouRozvany(ZR)problem is selected as the benchmarking problem here,making use of available global solutions for both its relaxed and binary forms.The recently developed non-penalization Smooth-edged Material Distribution for Optimizing Topology(SEMDOT),well-established Solid Isotropic Material with Penalization(SIMP),and continuation methods are studied on this platform.Interestingly,in most cases,the grayscale solutions obtained by SEMDOT demonstrate better performance in dealing with the ZR problem than SIMP.The reasons are investigated and attributed to the usage of two different regularization techniques,namely,the Heaviside smooth function in SEMDOT and the power-law penalty in SIMP.More importantly,a simple-to-use benchmarking graph is proposed for evaluating newly developed topology optimization methods.展开更多
文摘Antiviral software systems (AVSs) have problems in identifying polymorphic variants of viruses without explicit signatures for such variants. Alignment-based techniques from bioinformatics may provide a novel way to generate signatures from consensuses found in polymorphic variant code. We demonstrate how multiple sequence alignment supplemented with gap penalties leads to viral code signatures that generalize successfully to previously known polymorphic variants of JS. Cassandra virus and previously unknown polymorphic variants of W32.CTX/W32.Cholera and W32.Kitti viruses. The implications are that future smart AVSs may be able to generate effective signatures automatically from actual viral code by varying gap penalties to cover for both known and unknown polymorphic variants.
基金Supported by the National Natural Science Foundation of China(Grant No.11401340)China Postdoctoral Science Foundation(Grant No.2014M561892)+1 种基金the Foundation of Qufu Normal University(Grant Nos.bsqd2012041xkj201304)
文摘Nonconvex penalties including the smoothly clipped absolute deviation penalty and the minimax concave penalty enjoy the properties of unbiasedness, continuity and sparsity,and the ridge regression can deal with the collinearity problem. Combining the strengths of nonconvex penalties and ridge regression（abbreviated as NPR）, we study the oracle property of the NPR estimator in high dimensional settings with highly correlated predictors, where the dimensionality of covariates pn is allowed to increase exponentially with the sample size n. Simulation studies and a real data example are presented to verify the performance of the NPR method.
文摘Recently,reform on charges against dangerous driving has stirred up debate among the public.A new stipulation by China’s Supreme People’s court which took effect on May 1 granted judges the discretion to decide whether someone caught driving under the influence of alcohol should be held criminal responsible by taking into account how drunk the person is,road conditions and the seriousness of damages.
文摘On August 28, 2005, China＇s highest legislature adopted the Law on Penalties in Respect to Public Security Management （hereinafterrefen＇ed to as the Public Security Penalties Law for short）. The Law, adopted at the 17th meeting of the Standing Committee of the Tenth National People＇s Congress, shall become effective for implementation on March 1, 2006 to replace the Regulations on Penalties in Respect to Public： Security Management （Herein after referred to as the Public Security Penalties Regulations for short） that has been in practice for 18 years.
文摘A new traffic regulation that penalizes drivers for running yellow lights has stirred up contro- versy since it took effect on January 1, 2013. Under the new regulation, the strictest to date in China, drivers running a yellow traffic light will have six points deducted from the 12 points allocated to their driver＇s licenses. Previously, drivers were docked only three points for driv- ing through red light.
基金supported by the National Natural Science Foundation of China(Nos.11971349,12071442,12371320,and 12371318).
文摘Capacitated facility location problem(CFLP)is a classical combinatorial optimization problem that has various applications in operations research,theoretical computer science,and management science.In the CFLP,we have a potential facilities set and a clients set.Each facility has a certain capacity and an open cost,and each client has a spliitable demand that need to be met.The goal is to open some facilities and assign all clients to these open facilities so that the total cost is as low as possible.The CFLP is NP-hard(non-deterministic polynomial-hard),and a large amount of work has been devoted to designing approximation algorithms for CFLP and its variants.Following this vein,we introduce a new variant of CFLP called capacitated uniform facility location problem with soft penalties(CUFLPSP),in which the demand of each client can be partially rejected by paying penalty costs.As a result,we present a linear programming-rounding(LP-rounding)based 5.5122-approximation algorithm for the CUFLPSP.
基金supported by the National Natural Science Foundation of China(No.11971252)。
文摘In the k-product uncapacitated facility location problem with penalties,we are given a set of demand points where clients are located and a set of potential sites where facilities with unlimited capacities can be opened.There are k different kinds of products to be supplied by a set of open facilities.Each open facility can supply only a distinct product with a non-negative fixed cost determined by the product it wants to supply.Each client is either supplied with k kinds of products by a set of k different open facilities or completely rejected.There is a non-negative service cost between each pair of locations and also a penalty cost for each client if its service is rejected.These service costs are assumed to be symmetric and satisfy the triangle inequality.The goal is to select a set of clients to reject their service and then choose a set of facilities to be opened to service the remaining clients so that the total cost of opening facilities,servicing the clients,and the penalty is minimized.We address two different integer programs to describe the problem.Based on the linear programming rounding technique,we propose a(2k+1)-approximation algorithm for this problem.
文摘The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general forms of the penalties by Beale and Small and the stronger penalties by Tomlin, describes the modifications of these penalties used for the method of bounded variables. The same examples from Petersen are taken and the satisfactory results are shown in comparison with those obtained by Tomlin.
基金the National Natural Science Foundation of China(Grant No:71532015).
文摘Because governments have introduced policies involving incentives and penalties to promote the recycling of plastic waste,it is important to understand the impact of such incentives and penalties on the willingness of stakeholders to participate.In this study,government is included as a player,alongside waste collectors and recyclers,in a tripartite evolutionary game model of plastic waste recycling.The study explores the evolutionary equilibrium and performs a simulation analysis to elucidate the effect of government incentives and penalties on the willingness of other players to participate in recycling.Three conclusions are drawn from this research.First,an increase in incentives or in penalties increases the probability that collectors and recyclers will participate in the recycling process.Second,policy support incentives encourage collectors and recyclers to participate in plastic waste recycling earlier than subsidy incentives do.Finally,recyclers are more sensitive than collectors to government-imposed penalties.
基金supported by the National Social Science Fund(Grant No.08CJY009)the National Natural Science Fund(Grant Nos.70732002 and 70602011)+1 种基金support from the IAPHD Project of Nanjing Universitythe Institute of Accounting and Finance of Shanghai University of Finance and Economics,Research Project 985 of the Institute of Economic Transition and Development of Nanjing University,and the discussion at the 2009 winter seminar at City University of Hong Kong
文摘The extant literature offers extensive support for the significant role played by institutions in financial markets,but implicit regulation and monitoring have yet to be examined.This study fills this void in the literature by employing unique Chinese datasets to explore the implicit regulation and penalties imposed by the Chinese government in regulating the initial public offering(IPO) market.Of particular interest are the economic consequences of underwriting IPO deals for client firms that violate regulatory rules in China's capital market.We provide evidence to show that the associated underwriters' reputations are impaired and their market share declines.We further explore whether such negative consequences result from a market disciplinary mechanism or a penalty imposed by the government.To analyze the possibility of a market disciplinary mechanism at work,we investigate(1) the market reaction to other client firms whose IPO deals were underwritten by underwriters associated with a violation at the time the violation was publicly disclosed and(2) the under-pricing of IPO deals undertaken by these underwriters after such disclosure.To analyze whether the government imposes an implicit penalty,we examine the application processing time for future IPO deals underwritten by the associated underwriters and find it to be significantly longer than for IPO deals underwritten by other underwriters.Overall,there is little evidence to suggest that the market penalizes underwriters for the rule-violating behavior of their client firms in China.Instead,the Chinese government implicitly penalizes them by imposing more stringent criteria on and lengthening the processing time of the IPO deals they subsequently underwrite.
基金Higher Educational Science and Technology Program of Shandong Province(No.J17KA171)Natural Science Foundation of Shandong Province(No.ZR2020MA029).
文摘As a classic NP-hard problem in machine learning and computational geometry,the k-means problem aims to partition the given dataset into k clusters according to the minimal squared Euclidean distance.Different from k-means problem and most of its variants,fuzzy k-means problem belongs to the soft clustering problem,where each given data point has relationship to every center point.Compared to fuzzy k-means problem,fuzzy k-means problem with penalties allows that some data points need not be clustered instead of being paid penalties.In this paper,we propose an O(αk In k)-approximation algorithm based on seeding algorithm for fuzzy k-means problem with penalties,whereαinvolves the ratio of the maximal penalty value to the minimal one.Furthermore,we implement numerical experiments to show the effectiveness of our algorithm.
文摘Making profits is not the only goal for central SOE executives as they face repercussions for failure to reduce emissions The State-Owned Assets Supervisionand Administration Commission(SASAC),which supervises
文摘If you’re thinking of slapping someone in public,not only do you have anger issues to deal with,but now you could be on the receiving end of a hefty fine. In a bid to clamp down on public vio- lence,a growing number of grassroots police authorities around China are experimenting with a new fistfight prevention policy. Simply put,the core of the policy is to com- pile a so-called"fistfight cost sheet,"which lists the specific punishment for those who involve themselves in fistfights as opposed to previous relevant statutes,such as the Law on Administrative Penalty,which are vague. Police are hoping this initiative will help to curb public violence due to its financial deterrent.
文摘This paper investigates the ordering policy for the newsvendor problem with customer balking and penalties for balking and stockout. Our analysis is based on the assumption that only the mean and the variance of the demand distribution are known. In contrast to the existing research, we provide a new tradeoff tool as a replacement of the traditional one to weigh the holding cost and the goodwill cost segment： the balking penalty cost and the stockout penalty cost. Specifically, in addition to the stockout penalty, we also introduce the balking penalty, provide a new proof of the optimality of robust ordering policy to guarantee that the lower bound of expected profit obtained by us is tight, and get an robust optimal order quantity which is an exact solution but not an approximate one as before. Numerical experiments are conducted to illustrate the effect of penalties for balking and stockout.
基金the National Natural Science Foundation of China (Grant No.10471096)
文摘This article addresses the problem of scheduling n jobs with a common due date on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties.We investigate the problem under the conditions that the uptimes follow an exponential distribution,and the objective measure in detail is to minimize the expected sum of the absolute deviations of completion times from the common due date.We proceed to study in two versions (the downtime follows an exponential distribution or is a constant entailed for the repeat model job),one of which is the so-called preempt- resume version,the other of which is the preempt-repeat version.Three terms of work have been done.(i)Formulations and Preliminaries.A few of necessary definitions,relations and basic facts are established.In particular,the conclusion that the expectation of the absolute deviation of the completion time about a job with deterministic processing time t from a due date is a semi-V-shape function in t has been proved.(ii) Properties of Optimal Solutions.A few characteristics of optimal solutions are established.Most importantly,the conclusion that optimal solutions possess semi-V- shape property has been proved.(iii) Algorithm.Some computing problems on searching for optimal solutions are discussed.
基金financial support from the China National Social Science Foundation Key Research Project (Project No.17ZDA086)
文摘According to the risk management and reputation insurance theory of corporate social responsibility, corporate donations can help a company to repair its reputation after a crisis.This study uses a propensity score matching–difference in difference(PSM + DID) methodology to investigate the charitable donation activities of companies that have been subject to regulatory penalties.The analysis of a sample of A-share listed companies in the 2004–2016 period shows that companies significantly increase their charitable donations after regulatory penalties, but this effect weakens over time.Further analysis reveals that non-state-owned companies, companies with higher ownership concentrations, and companies receiving severer penalties are more motivated to make donations after regulatory penalties.By studying the reputation repair behavior of companies that have been subject to regulatory penalties, this study offers further support for the risk management and reputation insurance theory of corporate social responsibility.It also enriches our understanding of companies’ active responses to regulatory penalties and provides insights into companies’ motives for making charitable donations.
基金the National Natural Science Foundation of China(No.11971146)the Natural Science Foundation of Hebei Province of China(Nos.A2019205089 and A2019205092)+1 种基金Hebei Province Foundation for Returnees(No.CL201714)the Graduate Innovation Grant Program of Hebei Normal University(No.CXZZSS2022053).
文摘In this paper,we consider the parallel-machine customer order scheduling with delivery time and submodular rejection penalties.In this problem,we are given m dedicated machines in parallel and n customer orders.Each order has a delivery time and consists of m product types and each product type should be manufactured on a dedicated machine.An order is either rejected,in which case a rejection penalty has to be paid,or accepted and manufactured on the m dedicated machines.The objective is to find a solution to minimize the sum of the maximum delivery completion time of the accepted orders and the penalty of the rejected orders which is determined by a submodular function.We design an LP rounding algorithm with approximation ratio of n+1 for this problem.
文摘This paper provides an overview of judicial decisions on lawsuits against regulatory penalties imposed on nonprofessional taxi drivers and ride-hailing platform operators in China and the European Union （especially Germany）. Despite strikingly different facts in these cases, courts in both China and the EU are frequently called upon to rule on similar legal issues, including the applicability of old regulatory rules to new forms of transport services, the regulatory bar for the operation of emerging transport models, and the proper intensity of competition in taxi markets. The comparison of such cases suggests that for deciding the regulatory schemes of the innovative economy of transport services, the judicial system is not better suited than the regulatory system, especially the regulatory authority of the central government. Moreover, an experimental regulatory approach with minimum standards is arguably a feasible option that can fit with the emerging nature of innovative businesses.
基金the National Natural Science Foundation of China(No.12131003)Beijing Natural Science Foundation Project(No.Z200002)+2 种基金the Natural Sciences and Engineering Research Council of Canada(No.06446)the National Natural Science Foundation of China(Nos.11771386 and 11728104)the National Natural Science Foundation of China(No.11871081)。
文摘We study a problem called the k-means problem with penalties(k-MPWP),which is a natural generalization of the typical k-means problem.In this problem,we have a set D of client points in R^(d),a set F of possible centers in R^(d),and a penalty cost Pj>O for each point j∈D.We are also given an integer k which is the size of the center point set.We want to find a center point set S■F with size k,choose a penalized subset of clients P■D,and assign every client in D\P to its open center.Our goal is to minimize the sum of the squared distances between every point in D\P to its assigned centre point and the sum of the penalty costs for all clients in P.By using the multi-swap local search technique and under the fixed-dimensional Euclidean space setting,we present a polynomial-time approximation scheme(PTAS)for the k-MPWP.
文摘Most material distribution-based topology optimization methods work on a relaxed form of the optimization problem and then push the solution toward the binary limits.However,when benchmarking these methods,researchers use known solutions to only a single form of benchmark problem.This paper proposes a comparison platform for systematic benchmarking of topology optimization methods using both binary and relaxed forms.A greyness measure is implemented to evaluate how far a solution is from the desired binary form.The well-known ZhouRozvany(ZR)problem is selected as the benchmarking problem here,making use of available global solutions for both its relaxed and binary forms.The recently developed non-penalization Smooth-edged Material Distribution for Optimizing Topology(SEMDOT),well-established Solid Isotropic Material with Penalization(SIMP),and continuation methods are studied on this platform.Interestingly,in most cases,the grayscale solutions obtained by SEMDOT demonstrate better performance in dealing with the ZR problem than SIMP.The reasons are investigated and attributed to the usage of two different regularization techniques,namely,the Heaviside smooth function in SEMDOT and the power-law penalty in SIMP.More importantly,a simple-to-use benchmarking graph is proposed for evaluating newly developed topology optimization methods.
