this paper describes the development of a fuzzy decision support system (fdss) for the assessment of risk in e-commerce (ec) development. a web-based prototype fdss is suggested to assist ec project managers in identifying potential ec risk factors and the corresponding project risks. a risk analysis model for ec development using a fuzzy set approach is proposed and incorporated into the fdss....

A simple relaxation of two rows of a simplex tableau is a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. Recently Andersen et al. [2] and Cornu ́ejols and Margot [13] showed that the facet-defining inequalities of this set are either split cuts or intersection cuts obtained from lattice-free triangles and quadrilaterals. Throu...

COX-2 inhibitory activities of some 1,4-dihydropyridine and 5-oxo-1,4,5,6,7,8-hexahydroquinoline derivatives were modeled by quantitative structure–activity relationship (QSAR) using stepwise-multiple linear regression (SW-MLR) method. The built model was robust and predictive with correlation coefficient (R2) of 0.972 and 0.531 for training and test groups, respectively. The quality of the mod...

-An improved genetic algorithm applies the optimization procedures of protein folding through defining a new move set in lattice model. The new move set including rotation and mirror reflection is suitable for use in protein folding simulation. Through folding simulation on a simple lattice model it is found that the new move set is dramatically superior to that of the commonly used move set.

This paper proposes a new view to algorithms: Algorithms as defining dynamic systems. This view extends the traditional, deterministic view that an algorithm is a step-by-step procedure with nondeterminism. As a dynamic system can be designed by a set of its defining laws, it is also desirable to design an algorithm by a (possibly nondeterministic) set of defining laws. This observation require...

Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful application of the approach depends on the choice of an appropriate set of feature functions defining the value function, and efficient methods for generating constraints that determine the convex space of the solution...

The vector criterion and set criterion are two defining approaches of solutions for the set-valued optimization problems. In this paper, the optimality conditions of both criteria of solutions are established for the set-valued optimization problems. By using Studniarski derivatives, the necessary and sufficient optimality conditions are derived in the sense of vector and set optimization.

We consider the behavior of piecewise isometries in Euclidean spaces. We show that if n is odd and the system contains no orientation reversing isometries then recurrent orbits with rational coding are not expected. More precisely, a prevalent set of piecewise isometries do not have recurrent points having rational coding. This implies that when all atoms are convex no periodic points exist for...

We prove the existence of an algorithm that, from a finite set of polynomials defining an algebraic projective variety, computes the Chow form of its equidimensional component of the greatest dimension. Applying this algorithm, a finite set of polynomials defining the equidimensional component of the greatest dimension of an algebraic (projective or affine) variety can be computed. The complexi...

Given a combinatorial optimization problem Π and an increasing finite sequence c of natural numbers, we obtain a cardinality constrained version Πc of Π by permitting only those feasible solutions of Π whose cardinalities are members of c. We are interested in polyhedra associated with those problems, in particular in inequalities that cut off solutions of forbidden cardinality. Maurras [11] an...