Latent class (LC) analysis is used to construct empirical evidence on the existence of latent subgroups based on the associations among a set of observed discrete variables. One of the tests used to infer about the number of underlying subgroups is the bootstrap likelihood ratio test (BLRT). Although power analysis is rarely conducted for this test, it is important to identify, clarify, and spe...

It is already known that for very small edge cuts in graphs, the crossing number of the graph is at least the sum of the crossing number of (slightly augmented) components resulting from the cut. Under stronger connectivity condition in each cut component that was formalized as a graph operation called zip product, a similar result was obtained for edge cuts of any size, and a natural question ...

‘I think the next 21st century will be the century of complexity’, as Stephen Hawking predicted at the beginning of 2000, this prediction is coming true gradually with the technology development. The development of science is going through a dramatical and historical change because of the Internet, computer, and all other technologies. There are more and more complex systems existing in nature ...

We analyze the degree distribution’s cut-off in finite size scale-free networks. We show that the cut-off behavior with the number of vertices N is ruled by the topological constraints induced by the connectivity structure of the network. Even in the simple case of uncorrelated networks, we obtain an expression of the structural cut-off that is smaller that the natural cut-off obtained by means...

Cut-to-size plants are very complex systems, which are used to process several kinds of panels. The acquisition, planning, implementation and operation of these systems impose lots of challenges. To support the process from retail to operation of cut-to-size plants, a new simulation based decision support tool has been developed. This planning tool offers entirely new opportunities for system e...

For a graph G, let     max : is an edge cut of b G D D G  . For graphs G and H, a map     :V G V H   is a graph homomorphism if for each   e uv E G   ,       u v E H    . In 1979, Erdös proved by probabilistic methods that for p ≥ 2 with

Combining the computational fluid dynamics (CFD) and the design of experiments (DOE) methods, as a mixed approach in modeling was proposed so that to simultaneously benefit from the advantages of both modeling methods. The presented method was validated using a coal hydraulic classifier in an industrial scale. Effects of operating parameters including feed flow rate, solid content and baffle le...

In order to investigate chitosan and magnesium-nano fertilizers’ impact on photosynthetic pigments, protein, proline, and soluble sugar contents of sesame under irrigation cut-off treatment, a split-factorial experiment was conducted based on randomized blocks with three replications. Irrigation cut-off based on BBCH sca...