In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

• integrate system-wide keyword search, originating from selected item • have the history infl uence the importance rating (prefer recently visited items) • visualize immediate neighborhood of relaed items • break down large lists using classifi cation by common relationships and attributes In general, the use of associations to store information was understood and accepted. Several users even ...

Hybrid systems exhibit both discrete and continuous dynamics. The system state can flow continuously, and can also jump by triggering an event (transition). As an important application in the research of hybrid systems, safety verification is concerned with whether a specified set of unsafe states can be reached by the system from the initial set. One direct approach is to compute or over-appro...

In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...

D. Molodtsov (1999) introduced the concept of a soft set as a new approach for modeling uncertainties. The aim of this work is to define special kinds of soft sets, namely soft, L-fuzzifying soft, L-soft, and L-fuzzy soft neighborhood sets and to use them in order to give an alternative characterization of categories related to topology: crisp topological, L-topological, L-fuzzifying topologica...

in this paper, the concept of countably near ps-compactness inl-topological spaces is introduced, where l is a completely distributive latticewith an order-reversing involution. countably near ps-compactness is definedfor arbitrary l-subsets and some of its fundamental properties are studied.

Spaces of convex and concave functions appear naturally in theory applications. For example, regression log-concave density estimation are important topics nonparametric statistics. In stochastic portfolio theory, on the unit simplex measure concentration capital, their gradient maps define novel investment strategies. The may also be regarded as optimal transport simplex. this paper we constru...

A. Introduction Recommendation systems are an active topic in research and industry. The technique of collaborative filtering is especially successful in generating personalized recommendations. More than a decade of research has resulted in numerous algorithms, out of which, we have chosen K-Nearest Neighborhood (K-NN) model to predict the ratings for the songs. This model is an item-based alg...