On the existence of bi-pyramidal central configurations of the n + 2-body problem with an n-gon base

Abstract. In this paper we prove the existence of central con gurations of the n + 2{body problem where n equal masses are located at the vertices of a regular n{gon and the remaining 2 masses, which are not necessarily equal, are located on the straight line orthogonal to the plane containing the n{gon passing through its center. Here this kind of central con gurations is called bi{pyramidal central con gurations. In particular, we prove that if the masses mn+1 and mn+2 and their positions satisfy convenient relations, then the con guration is central. We give explicitly those relations.

Central configurations of nested regular polyhedra for the spatial 2n–body problem

We consider 2n masses located at the vertices of two nested regular polyhedra with the same number of vertices. Assuming that the masses in each polyhedron are equal, we prove that for each ratio of the masses of the inner and the outer polyhedron there exists a unique ratio of the length of the edges of the inner and the outer polyhedron such that the configuration is central.

Central configurations of three nested regular polyhedra for the spatial 3n–body problem

Three regular polyhedra are called nested if they have the same number of vertices n, the same center and the positions of the vertices of the inner polyhedron ri, the ones of the medium polyhedron Ri and the ones of the outer polyhedron Ri satisfy the relation Ri = ri and Ri = Rri for some scale factors R > > 1 and for all i = 1, . . . , n. We consider 3n masses located at the vertices of three nested regular polyhedra. We assume that the masses of the inner polyhedron are equal to m1, the masses of the medium one are equal to m2, and the masses of the outer one are equal to m3. We prove that if the ratios of the masses m2/m1 and m3/m1 and the scale factors and R satisfy two convenient relations, then this configuration is central for the 3n–body problem. Moreover there is some numerical evidence that, first, fixed two values of the ratios m2/m1 and m3/m1, the 3n–body problem has a unique central configuration of this type; and second that the number of nested regular polyhedra with the same number of vertices forming a central configuration for convenient masses and sizes is arbitrary.

A hybrid algorithm combining metaheuristic with Monte Carlo simulation for solving the Stochastic Flow Shop problem

In this paper, a hybrid simulation-based algorithm is proposed for the StochasticFlow Shop Problem. The main idea of the methodology is to transform the stochastic problem into a deterministic problem and then apply simulation to the latter. In order to achieve this goal, we rely on Monte Carlo Simulation and an adapted version of a deterministic heuristic. This approach aims to provide flexibility and simplicity due to the fact that it is not constrained by any previous assumption and relies in well-tested heuristics.

A hybrid algorithm combining metaheuristic with Monte Carlo simulation for solving the Stochastic Flow Shop problem

In this paper, a hybrid simulation-based algorithm is proposed for the StochasticFlow Shop Problem. The main idea of the methodology is to transform the stochastic problem into a deterministic problem and then apply simulation to the latter. In order to achieve this goal, we rely on Monte Carlo Simulation and an adapted version of a deterministic heuristic. This approach aims to provide flexibility and simplicity due to the fact that it is not constrained by any previous assumption and relies in well-tested heuristics.

J2 effect and elliptic inclined periodic orbits in the collision three-body problem

The existence of a new class of inclined periodic orbits of the collision restricted three-body problem is shown. The symmetric periodic solutions found are perturbations of elliptic kepler orbits and they exist only for special values of the inclination and are related to the motion of a satellite around an oblate planet

Altered nitrogen balance and decreased urea excretion in male rats fed cafeteria diet are related to arginine availability

Hyperlipidic diets limit glucose oxidation and favor amino acid preservation, hampering the elimination of excess dietary nitrogen and the catabolic utilization of amino acids.We analyzed whether reduced urea excretion was a consequence of higherNO ; (nitrite,nitrate, and other derivatives) availability caused by increased nitric oxide production in metabolic syndrome. Rats fed a cafeteria diet for 30 days had a higher intake and accumulation of amino acid nitrogen and lower urea excretion.There were no differences in plasma nitrate or nitrite. NO and creatinine excretion accounted for only a small part of total nitrogen excretion. Rats fed a cafeteria diet had higher plasma levels of glutamine, serine, threonine, glycine, and ornithinewhen comparedwith controls,whereas arginine was lower. Liver carbamoyl-phosphate synthetase I activity was higher in cafeteria diet-fed rats, but arginase I was lower. The high carbamoyl-phosphate synthetase activity and ornithine levels suggest activation of the urea cycle in cafeteria diet-fed rats, but low arginine levels point to a block in the urea cycle between ornithine and arginine, thereby preventing the elimination of excess nitrogen as urea. The ultimate consequence of this paradoxical block in the urea cycle seems to be the limitation of arginine production and/or availability.

The problem of nitrogen disposal in the obese

Amino-N is preserved because of the scarcity and nutritional importance of protein. Excretion requires its conversion to ammonia, later incorporated into urea. Under conditions of excess dietary energy, the body cannot easily dispose of the excess amino-N against the evolutively adapted schemes that prevent its wastage; thus ammonia and glutamine formation (and urea excretion) are decreased. High lipid (and energy) availability limits the utilisation of glucose, and high glucose spares the production of ammonium from amino acids, limiting the synthesis of glutamine and its utilisation by the intestine and kidney. The amino acid composition of the diet affects the production of ammonium depending on its composition and the individual amino acid catabolic pathways. Surplus amino acids enhance protein synthesis and growth, and the synthesis of non-protein-N-containing compounds. But these outlets are not enough; consequently, less-conventional mechanisms are activated, such as increased synthesis of NO∙ followed by higher nitrite (and nitrate) excretion and changes in the microbiota. There is also a significant production of N(2) gas, through unknown mechanisms. Health consequences of amino-N surplus are difficult to fathom because of the sparse data available, but it can be speculated that the effects may be negative, largely because the fundamental N homeostasis is stretched out of normalcy, forcing the N removal through pathways unprepared for that task. The unreliable results of hyperproteic diets, and part of the dysregulation found in the metabolic syndrome may be an unwanted consequence of this N disposal conflict.

An Improved Hybrid Model for the Generic Hoist Scheduling Problem

Peer-reviewed

The continuous wavelet transform as a maximum entropy solution of the corresponding inverse problem

The continuous wavelet transform is obtained as a maximumentropy solution of the corresponding inverse problem. It is well knownthat although a signal can be reconstructed from its wavelet transform,the expansion is not unique due to the redundancy of continuous wavelets.Hence, the inverse problem has no unique solution. If we want to recognizeone solution as "optimal", then an appropriate decision criterion hasto be adopted. We show here that the continuous wavelet transform is an"optimal" solution in a maximum entropy sense.

Heuristic procedures for solving the General Assembly Line Balancing Problem with Setups (GALBPS)

The General Assembly Line Balancing Problem with Setups (GALBPS) was recently defined in the literature. It adds sequence-dependent setup time considerations to the classical Simple Assembly Line Balancing Problem (SALBP) as follows: whenever a task is assigned next to another at the same workstation, a setup time must be added to compute the global workstation time, thereby providing the task sequence inside each workstation. This paper proposes over 50 priority-rule-based heuristic procedures to solve GALBPS, many of which are an improvement upon heuristic procedures published to date.