This paper summarizes the subgroup discovery method SUBARP. The discussion is to provide an intuitive understanding of the ideas underlying the method, and mathematical details are omitted.

Subgroup discovery is a popular form of supervised rule learning, applicable to descriptive and predictive tasks. In this work we study two natural extensions of classical subgroup discovery to distributed settings. In the first variant the goal is to efficiently identify global subgroups, i.e. the rules an analysis would yield after collecting all the data at a single central database. In cont...

In this paper we propose cryptosystems based on subgroup distortion in hyperbolic groups. We also include concrete examples of hyperbolic groups as possible platforms.

A technique of anaesthesia for intracranial surgery involving the use of a thiopentone drip as a supplement to nitrous oxide and oxygen was used in 166 patients who were curarized and artificially ventilated. Maintenance of immobility and unconsciousness during the operation was satisfactory. The degree of recovery at the end of operation was acceptable in that nearly 90 per cent were awake and...

a subgroup x of a group g is said to be an h -subgroup if n_g(x) ∩ x^g ≤ x for each element g belonging to g. in [m. bianchi e. a., on finite soluble groups in which normality is a transitive relation, j. group theory, 3 (2000), 147–156] the authors showed that finite groups in which every subgroup has the h -property are exactly soluble groups in which normality is a transitive relation. here ...

In this paper, we define a generalized Wielandt subgroup, local generalized Wielandt subgroup and its series for finite group and discuss its different basic properties which explain the notion of generalized Wielandt subgroup in a better way. We bound generalized Wielandt length as a function of nilpotency classes of its Sylow subgroups.

We advocate a new approach for addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the hidden symmetry subgroup problem (HSSP), which is a generalization of the well-studied hidden subgroup problem (HSP). Given a group acting on a set and an oracle whose level sets define a partition of the set, the task is to recover the subgroup of symme...

We define and discuss symmetric subgroup membership problems and their properties, including a relation to the Decision DiffieHellman problem. We modify the Cramer-Shoup framework, so that we can derive a chosen ciphertext secure cryptosystem in the standard model from symmetric subgroup membership problems. We also discuss how chosen ciphertext secure hybrid cryptosystems based on a symmetric ...