We show that the infinite percolating cluster (with density P∞) of central-force networks is composed of: a fractal stress-bearing backbone (PB) and; rigid but unstressed “dangling ends” which occupy a finite volume-fraction of the lattice (PD). Near the rigidity threshold p∗, there is then a first-order transition in P∞ = PD +PB, while PB , is second-order with exponent β ′ A new mean field th...

incorporation of functional foods and nutraceuticals such as carotenoids which suffer from poor water solubility and low bioavailability into nano-sized delivery systems can improve their solubility, stability and oral bioavailability. the aim of this study was to prepare β-carotene nanodispersion and investigate the effects of preparation parameters by means of response surface methodology usi...

The purpose of this paper is to examine the multidisciplinary design optimization (MDO) of a reentry vehicle. In this paper, optimization of a RV based on, minimization of heat flux integral and minimization of axial force coefficient integral and maximization of static margin integral along reentry trajectory is carried out. The classic optimization methods are not applicable here due to the c...

The Poisson ratio v of a polycrystalline aggregate was calculated for both the face-centered cubic and the body-centered cubic cases. A general two-body central-force interatomatic potential was used. Deviations of v from 0.25 were verified. A lower value of v is predicted for the f.c.c. case than for the b.c.c. case. Observed values of v for twenty-three cubic elements are discussed in terms o...

When the only force acting on a particle is always directed towards a fixed point, the motion is called central force motion. This type of motion is particularly relevant when studying the orbital movement of planets and satellites. The laws which govern this motion were first postulated by Kepler and deduced from observation. In this lecture, we will see that these laws are a consequence of Ne...

In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive search. These smaller parts comprise a combination of choosing a method to select a task to be scheduled and a method to allocate resources, including time, to the selected task. We use reduced Variable Neighbourhood Sea...