Department of Computer Science and Systems Engineering Technical University of Moldova Stefan cel Mare bd., 168 www.utm.md MD2004 Republic of Moldova Chișinău
Auto-generated profile, based on publicly available information
Vasile Moraru
Department of Computer Science and Systems Engineering Technical University of Moldova Stefan cel Mare bd., 168 www.utm.md MD2004 Republic of Moldova Chișinău
Selecting the desired ontology from a collection of available ones is essential for ontology reuse. We address the problem of evaluating, ranking and selecting ontologies according to user preferences. We exploit the Analytic Hierarchy Process (AHP) to solve the multiple-criteria decision problem and to model the preferences of the users. We use AHP to analyze the available ontologies from different perspectives and at different abstraction levels. The decision is based on the concrete end-node measurements and their relative importance at higher levels. For supporting the selection decision, we developed an ontology representation, reasoning and management system. The system applies different metrics on ontologies in order to feed the Analytic Hierarchy Process with facts. The running scenario applies our method to the task of reusing ontologies from the tourism domain.
Embedded system design is subject to many constraints with strong influence on design objectives and architectures. Designers of embedded systems need to consider the desired functionality together with cost constraints, and also with other quality metrics. The paper presents a simplified model for early estimation of system quality based on metrics such as hardware costs and operation speed. The proposed approach can be used as a method for early estimation of gain/loss in quality in the design of embedded systems. The method is suitable in the design of embedded systems and their production on a small scale.
In this paper we discuss the numerical solving of one of the well known problems related to the production systems. Namely, it is about facility location problem, which is reformulated in terms of non-convex minimization problems with quadratic constraints. After relaxation of the above problem, a model based on second-order cone programming is obtained.
The purpose of this paper is the approach of a mathematical model dedicated to planning the consecutive days off of a company’s employees. Companies must find a flexible work schedule between employees, always considering the satisfaction of work tasks as well as guaranteeing consecutive days off. The analysis is based on solving a quadratic programming problem with binary variables. The proposed method uses the properties of the circulant symmetric matrix in the researched model, which allows the transformation of the considered problems into an equivalent separable non-convex optimization problem. A practical continuous convex relaxation approach is proposed. DC Algorithm is used to solve relaxed problems. A solved numerical example is presented.
Binary quadratic programming is a classical combinatorial optimization problem that has many real-world applications. This paper presents a method for solving the quadratic programming problem with circulant matrix by reformulating and relaxing it into a separable optimization problem. The proposed method determines local suboptimal solutions. To solve the relaxing problem, the DCA algorithm it is proposed to calculate the solutions, in the general case, only local suboptimal.