Quantum cloning has been a topic of considerable interest for many years. It turns out to be quantum limit for copying an input state and is closely related to linear amplification when talking about optical cloning. It is commonly stated that it is impossible to clone. In actuallity it is possible to clone perfectly, one just needs to know the input state. As Wootters and Zurek showed it is im...

In the recent functional linguistic literature, the notion of syntactic complexity and similar concepts have received considerable attention. Yet, when trying to operationalize syntactic complexity as an independent variable in statistical research designs, it soon emerges that the notion is somewhat underdefined. I will report the results from an experiment comparing three measures of syntacti...

We use experimental methods to investigate whether pledges of commitment can improve cooperation in endogenously-formed partnerships facing a social dilemma. Treatments vary in terms of the individual’s: (1) opportunity to commit to their partner; (2) the cost of dissolving committed partnerships; and (3) the distribution of these dissolution costs between partners. Our findings show that pledg...

This paper introduces a new approach to the control of robot manipulators in a way that is safe for humans in the robot's workspace. Conceptually the robot is viewed as a tool with limited autonomy. The limited perception capabilities of automatic systems prohibits the construction of failsafe robots with the capabilities of people. Instead, the goal of our control scheme is to make the interac...

a famous theorem of schur states that for a group $g$ finiteness of $g/z(g)$‎ ‎implies the finiteness of $g'.$ the converse of schur's theorem is an interesting problem which has been considered by some‎ ‎authors‎. ‎recently‎, ‎podoski and szegedy proved the truth of the converse of schur's theorem for capable groups‎. ‎they also established an explicit bound for the index of the center of such...

we give a new proof of the well known wedderburn's little theorem (1905) that a finite‎ ‎division ring is commutative‎. ‎we apply the concept of frobenius kernel in frobenius representation theorem in finite group‎ ‎theory to build a proof‎.

we study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by devroye et. al (2011). in a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor ix_i floor$ where $x_0$, $ldots$ , $x_n$ is a sequence of i.i.d. random variables, with support in [0,...

background breast cancer (bc) is the most common cancer in iranian women. studying the mortality statistics is important to monitor the effects of screening programs or the influence of earlier diagnosis on the burden of this chronic disease. misclassification is still a problem in the iranian death registry data and about 20% of death statistics are recorded in misclassified categories. object...

We study a general framework for query rewriting in the presence of an arbitrary first-order logic ontology over a database signature. The framework supports deciding the existence of a safe-range first-order equivalent reformulation of a query in terms of the database signature, and if so, it provides an effective approach to construct the reformulation based on interpolation using standard th...