This paper develops a method to obtain multivariate kernel functions for density estimation problems in which the function is defined on compact support. If domain-specific knowledge requires certain conditions be satisfied at boundary of support an unknown density, proposed incorporates information contained into estimators. The provides exact that satisfies conditions, even small samples. Exi...

A correction to this paper has been published: https://doi.org/10.1007/s11162-021-09646-8

The use of permutation methods for exact inference dates back to Fisher in 1935. Since then, the practicality of such methods has increased steadily with computing power. They can now easily be employed in many situations without concern for computing difficulties. We discuss the reasoning behind these methods and describe situations when they are exact and distribution-free. We illustrate thei...

Exact one-way re-formulations of the Helmholtz equation are useful for waveg-uide problems, since the resulting equations can be eeciently solved as \initial" value problems by range marching methods. Some numerical methods for these re-formulations are reviewed in this paper. This includes a switched method that avoids the singularities of the operators and the large range step methods that gi...

The purposeof this paper is twofold. First we considera class of nondiierentiablepenaltyfunctions for constrained Lipschitz programs and then we show how these penalty functions can be employed to actually solve a constrained Lipschitz program. The penalty functions considered incorporate a barrier term which makes their value go to innnity on the boundary of a perturbation of the feasible set....

By reading, you can know the knowledge and things more, not only about what you get from people to people. Book will be more trusted. As this exact statistical methods for data analysis, it will really give you the good idea to be successful. It is not only for you to be success in certain life you can be successful in everything. The success can be started by knowing the basic knowledge and do...

This paper reviews, extends and analyzes a new class of penalty methods for nonlinear optimization. These methods adjust the penalty parameter dynamically; by controlling the degree of linear feasibility achieved at every iteration, they promote balanced progress toward optimality and feasibility. In contrast with classical approaches, the choice of the penalty parameter ceases to be a heuristi...

Project management in the present time is characterized by rapid advancements in many technologies, hardly calculable risks and very tight deadlines for nearly all kinds of projects. Planning and steering of projects under these conditions turns out to be a really tough job even for the most experienced project managers. To deal responsibly with project sponsors or customers, they must consider...

In this paper, we present and compare some exact methods to resolve the network reliability problems. These problems concern all kinds of networks, such as computer, communication or power networks. When components of the network are subject to random failures, the network may or may not continue functioning after the failures of some components. The probability that the network will function i...

Number partitioning is a classical NP-hard combinatorial optimization problem, whose solution is challenging for both exact and approximative methods. This work presents a new algorithm for number partitioning, based on ideas drawn from branch-and-bound, breadth first search, and beam search. A new set of benchmark instances for this problem is also proposed. The behavior of the new method on t...