OBJECTIVE To protect minors from exposure to video games with objectionable content (eg, violence and sex), the Pan European Game Information developed a classification system for video games (eg, 18+). We tested the hypothesis that this classification system may actually increase the attractiveness of games for children younger than the age rating. PARTICIPANTS AND METHODS Participants were ...

filtering of web pages with inappropriate contents is one of the major issues in the field of intelligent network's security. having a good intelligent filtering method with high accuracy and speed is needed for any country in order to control users' access to the web. so, it has been considered by many researchers. presenting web pages in an understandable way by machines is one of the most im...

Quantum information provides fundamentally different computational resources than classical information. We prove that there is no unitary protocol able to add unknown quantum states belonging to different Hilbert spaces. This is an inherent restriction of quantum physics that is related to the impossibility of copying an arbitrary quantum state, i.e., the no-cloning theorem. Moreover, we demon...

Abstract Eve’s Testament (Greek Life of Adam and Eve 15–30) contains an expansive first-person retelling the Eden narrative in which elder remembers her younger self calling to “with a loud voice” saying, “listen me!” She then admits that when she opened mouth, “the Devil was speaking,” able quickly persuade husband eat forbidden fruit. The unparalleled decision ancient author voice primordial ...

In this paper, we obtain a forbidden-minor characterization of the class of binary gammoids M such that, for every pair of elements x, y of M, both the splitting matroid Mx,y and the element splitting matroid M ′ x,y are binary gammoids.

A connected edge-colored graphG is said to be rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors, and the rainbow connection number rc(G) ofG is the minimum number of colors that can make G rainbow-connected. We consider families F of connected graphs for which there is a constant kF such that every connected F-free graph G with...

Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of forbidden subalgebras. We also consider the subclass of strictly categorical skew lattices.

We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratic-time algorithm that decides if a given interval graph admits such an intersection representation.