BACKGROUND The RD(50) (exposure concentration producing a 50% respiratory rate decrease) test evaluates airborne chemicals for sensory irritation and has become an American Society for Testing and Materials (ASTM) standard method. Past studies reported good correlations (R(2)) between RD(50)s and the occupational exposure limits, particularly threshold limit values (TLVs). OBJECTIVE The main ...

Given a sequence of n elements, the All Nearest Smaller Values (ANSV) problem is to nd, for each element in the sequence, the nearest element to the left (right) that is smaller, or to report that no such element exists. Time and work optimal algorithms for this problem are known on all the PRAM models 4, 6], but the running time of the best previous hypercube algorithm 9] is optimal only when ...

Recent adaptive memory and evolutionary metaheuristics for mixed integer programming have included proposals for introducing inequalities and target objectives to guide the search. These guidance approaches are useful in intensification and diversification strategies related to fixing subsets of variables at particular values, and in strategies that use linear programming to generate trial solu...

The paper examined the value system in Philippine firms against the backdrop of Eastern-Western cultural dynamics in East Asia. The Asian milieu presents co-existence of cultural stasis and unease -balance and tension between Eastern values and Western ideas. Successful Asian countries demonstrated their ability to blend conflicting cultures and highlight certain values in order to promote nati...

Solving mixed integer linear programming (MILP) problems is a difficult task due to the parallel use of both integer and non-integer values. One of the most widely used solution is to solve the problem in the real space and they apply additional iteration steps (so-called cutting-plane algorithms or Gomory’s cuts) to narrow down the solution to the optimal integer solution. The ABS class of alg...

The newest, and asymptotically the fastest known integer factorisation algorithm is the number eld sieve. The area in which the number eld sieve has the greatest capacity for improvement is polynomial selection. The best known polynomial selection method nds quadratic polynomials. In this paper we examine the smoothness properties of integer values taken by these polynomials. Given a quadratic ...

The Fortran subroutine MISQP solves mixed-integer nonlinear programming problems by a modified sequential quadratic programming (SQP) method. Under the assumption that integer variables have a smooth influence on the model functions, i.e., that function values do not change drastically when inor decrementing an integer value, successive quadratic approximations are applied. The algorithm is sta...

The Fortran subroutine MISQP solves mixed-integer nonlinear programming problems by a modified sequential quadratic programming (SQP) method. Under the assumption that integer variables have a smooth influence on the model functions, i.e., that function values do not change drastically when inor decrementing an integer value, successive quadratic approximations are applied. The algorithm is sta...