We consider two–sided many–to–many matching markets in which each worker may work for multiple firms and each firm may hire multiple workers. We study individual and group manipulations in centralized markets that employ (pairwise) stable mechanisms and that require participants to submit rank order lists of agents on the other side of the market. We are interested in simple preference manipula...

in this paper, a new topology is proposed for three-phase to single-phase matrix converters, where more voltage levels are produced in the output in comparison with the conventional topologies. in addition, a new control method based on minimum error between the generated and the desired output voltages is proposed for three-phase to single-phase matrix converters. in the proposed control metho...

An intelligent strategy for the protection of AC microgrids is presented in this paper. This method was halving to an initial signal processing step and a machine learning-based forecasting step. The initial stage investigates currents and voltages with a window-based approach based on the dynamic decomposition method (DDM) and then involves the norms of the signals to the resultant DDM data. T...

For any group G, let C(G) denote the set of centralizers of G.We say that a group G has n centralizers (G is a Cn-group) if |C(G)| = n.In this note, we prove that every finite Cn-group with n ≤ 21 is soluble andthis estimate is sharp. Moreover, we prove that every finite Cn-group with|G| < 30n+1519 is non-nilpotent soluble. This result gives a partial answer to aconjecture raised by A. Ashrafi in ...

This paper deals with the problem of estimating an appropriate hand posture to grasp an object, from 2D object’s visual cues in a many-to-many (objects,grasp) configuration. A statistical learning protocol implementing vector-valued regression is adopted for both classifying the most likely grasp type and estimating the hand posture. An extensive experimental evaluation on a publicly available ...

for any group g, let c(g) denote the set of centralizers of g.we say that a group g has n centralizers (g is a cn-group) if |c(g)| = n.in this note, we prove that every finite cn-group with n ≤ 21 is soluble andthis estimate is sharp. moreover, we prove that every finite cn-group with|g| < 30n+1519 is non-nilpotent soluble. this result gives a partial answer to aconjecture raised by a. ashrafi in ...