We prove tight bounds for crossing numbers of hypercube and cube connected cyc1es (CCC) graphs.

An autotopism of a Latin square is a triple (a,b,c) of permutations such that the Latin square is mapped to itself by permuting its rows by a, columns by b, and symbols by c. Let Atp(n) be the set of all autotopisms of Latin squares of order n. Whether a triple (a,b,c) of permutations belongs to Atp(n) depends only on the cycle structures of a, b, and c. We establish a number of necessary condi...

Mobile agents operating in networked environments face threats from other agents as well as from the hosts (i.e., network sites) they visit. A black hole is a harmful host that destroys incoming agents without leaving any trace. To determine the location of such a harmful host is a dangerous but crucial task, called black hole search. The most important parameter for a solution strategy is the ...

ion layer dimension: target-specific aggregation and filtering of information which allows the selective hiding of company-internal information while offering to expose CBP relevant information to partners Fig. 3: Cross-organisational Business Process (CBP) Framework (Greiner and Jäkel 2007) The modelling level dimension incorporates three modelling levels: The Business level represents the bus...

Given the central role of simulation in procesor design and research, an accurate, validated, and easily modified simulation model is extremely desirable. Prior work proposed a modeling methodology with the claim that it allows rapid construction of flexible validated models. In this paper, we present our experience using this methodology to construct a flexible validated model of Intel’s Itani...

1.0 Introduction ..........................................................................................................................................................2 2.0 Relevant Topics in Sound and Acoustics ............................................................................................................... 2.1 Sound...............................................................

In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...

Background: The aim of this retrospective study is to investigate the cumulative live birth rate (CLBR) following one or more completed in vitro fertilization (IVF) cycles (up to 6 cycles) stratified by maternal age and type of infertility. Materials and Methods: In this retrospective study, five hundred forty-seven women who received 736 fresh ovarian stimulation/embryo transfer cycles between...