On the Bayesian inductive processes
On the behaviour of learning algorithms in a changing environment with application to data network routing problem
On the comparison of some fuzzy clustering methods for privacy preserving data mining: Towards the development of specific information loss measures
Policy makers and researchers require raw data collected from agencies and companies for their analysis. Nevertheless, any transmission of data to third parties should satisfy some privacy requirements in order to avoid the disclosure of sensitive information. The areas of privacy preserving data mining and statistical disclosure control develop mechanisms for ensuring data privacy. Masking methods are one of such mechanisms. With them, third parties can do computations with a limited risk of disclosure....
On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.
On the construction and evaluation of subjective classifications
On the distributed decision-making complexity of the minimum vertex cover problem
On the General Motion-Planning Problem with Two Degrees of Freedom.
On the Hopfield algorithm. Foundations and examples.
On the k-reversibility of finite automata.
On the learning of weights in some aggregation operators: the weigthed mean and OWA operators.
We study the determination of weights for two types of aggregation operators: the weighted mean and the OWA operator. We assume that there is at our disposal a set of examples for which the outcome of the aggregation operator is known. In the case of the OWA operator, we compare the results obtained by our method with another one in the literature. We show that the optimal weighting vector is reached with less cost.
On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space.
On the orthogonalization of arbitrary Boolean formulae.
On the singular decomposition of matrices.
On the size of minimal unsatisfiable formulas.
On the Threshold of Bounded Pseudo-Distances.
On the viability of an algebraic approach to non-monotonic reasoning.
One implementation of PL prover algorithm
Ontologies and soft computing in flexible querying
Operating on formal concept abstraction.
The subject of this paper regards a procedure to obtain the abstract form of concepts, directly from their most natural form, thus these can be efficiently learned and the possibility of operating formally on them is reached. The achievement of said type of form results also useful to compute conceptual parameters symbolic and numerical in nature.
Optimal Allocation of Renewable Energy Parks: A Two–stage Optimization Model
Applied research into Renewable Energies raises complex challenges of a technological, economical or political nature. In this paper, we address the techno−economical optimization problem of selecting locations of wind and solar Parks to be built in Egypt, such that the electricity demand is satisfied at minimal costs. Ultimately, our goal is to build a decision support tool that will provide private and governmental investors into renewable energy systems, valuable insights to make informed short...