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

Sierpinski curve Julia sets for quadratic rational maps

We investigate under which dynamical conditions the Julia set of a quadratic rational map is a Sierpiński curve.

Bayesian Networks and the Value of the Evidence for the Forensic Two-Trace Transfer Problem

Forensic scientists face increasingly complex inference problems for evaluating likelihood ratios (LRs) for an appropriate pair of propositions. Up to now, scientists and statisticians have derived LR formulae using an algebraic approach. However, this approach reaches its limits when addressing cases with an increasing number of variables and dependence relationships between these variables. In this study, we suggest using a graphical approach, based on the construction of Bayesian networks (BNs). We first construct a BN that captures the problem, and then deduce the expression for calculating the LR from this model to compare it with existing LR formulae. We illustrate this idea by applying it to the evaluation of an activity level LR in the context of the two-trace transfer problem. Our approach allows us to relax assumptions made in previous LR developments, produce a new LR formula for the two-trace transfer problem and generalize this scenario to n traces.

Axiomatization of the nucl eolus of assignment games

On the domain of general assignment games (with possible reservation prices) the core is axiomatized as the unique solution satisfying two consistency principles: projection consistency and derived consistency. Also, an axiomatic characterization of the nucleolus is given as the unique solution that satisfies derived consistency and equal maximum complaint between groups. As a consequence, we obtain a geometric characterization of the nucleolus. Maschler et al. (1979) provide a geometrical characterization for the intersection of the kernel and the core of a coalitional game, showing that those allocations that lie in both sets are always the midpoint of certain bargaining range between each pair of players. In the case of the assignment game, this means that the kernel can be determined as those core allocations where the maximum amount, that can be transferred without getting outside the core, from one agent to his / her optimally matched partner equals the maximum amount that he / she can receive from this partner, also remaining inside the core. We now prove that the nucleolus of the assignment game can be characterized by requiring this bisection property be satisfied not only for optimally matched pairs but also for optimally matched coalitions. Key words: cooperative games, assignment game, core, nucleolus

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.

Generating a raster map presentation of a forest resource by solving a transportation problem

Abstract

An Improved Hybrid Model for the Generic Hoist Scheduling Problem

Peer-reviewed

A performance lower bound for quadratic timing recovery accounting for the symbol transition density

The symbol transition density in a digitally modulated signal affects the performance of practical synchronization schemes designed for timing recovery. This paper focuses on the derivation of simple performance limits for the estimation of the time delay of a noisy linearly modulated signal in the presence of various degrees of symbol correlation produced by the varioustransition densities in the symbol streams. The paper develops high- and low-signal-to-noise ratio (SNR) approximations of the so-called (Gaussian) unconditional Cramér–Rao bound (UCRB),as well as general expressions that are applicable in all ranges of SNR. The derived bounds are valid only for the class of quadratic, non-data-aided (NDA) timing recovery schemes. To illustrate the validity of the derived bounds, they are compared with the actual performance achieved by some well-known quadratic NDA timing recovery schemes. The impact of the symbol transitiondensity on the classical threshold effect present in NDA timing recovery schemes is also analyzed. Previous work on performancebounds for timing recovery from various authors is generalized and unified in this contribution.

Conditional maximum likelihood timing recovery: estimators and bounds

This paper is concerned with the derivation of new estimators and performance bounds for the problem of timing estimation of (linearly) digitally modulated signals. The conditional maximum likelihood (CML) method is adopted, in contrast to the classical low-SNR unconditional ML (UML) formulationthat is systematically applied in the literature for the derivationof non-data-aided (NDA) timing-error-detectors (TEDs). A new CML TED is derived and proved to be self-noise free, in contrast to the conventional low-SNR-UML TED. In addition, the paper provides a derivation of the conditional Cramér–Rao Bound (CRB ), which is higher (less optimistic) than the modified CRB (MCRB)[which is only reached by decision-directed (DD) methods]. It is shown that the CRB is a lower bound on the asymptotic statisticalaccuracy of the set of consistent estimators that are quadratic with respect to the received signal. Although the obtained boundis not general, it applies to most NDA synchronizers proposed in the literature. A closed-form expression of the conditional CRBis obtained, and numerical results confirm that the CML TED attains the new bound for moderate to high Eg/No.

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.

Frames: a maximum entropy statistical estimate of the inverse problem

A maximum entropy statistical treatment of an inverse problem concerning frame theory is presented. The problem arises from the fact that a frame is an overcomplete set of vectors that defines a mapping with no unique inverse. Although any vector in the concomitant space can be expressed as a linear combination of frame elements, the coefficients of the expansion are not unique. Frame theory guarantees the existence of a set of coefficients which is “optimal” in a minimum norm sense. We show here that these coefficients are also “optimal” from a maximum entropy viewpoint.

Product Line Profitability- Case Halton Indoors

Diplomityön tavoitteena on rakentaa malli kohdeyrityksen yhden strategisen liiketoimintayksikön tuoteryhmänkohtaisten kannattavuuksien selvittämiseksi yli kokotoimitusketjun. Työssä on keskitytty vain välillisiin kustannuksiin ja välittömien kustannusten osalta on luotettu toiminnanohjausjärjestelmän antamiin tietoihin. Työn lähtökohtana ja teoreettisena viitekehikkona on toimintoperustainen kustannuslaskenta, jonka periaatteita noudattaen kannattavuusmalli rakennettiin. Mallin periaatteet on esitetty työssä mutta sen tuottamia tuloksia ei ole syvemmin analysoitu. Ongelma osoittautui haasteelliseksi ja tulosten verifiointi lähes mahdottomaksi käytettyjen subjektiivisten arvioiden ja ennalta odottamattomien välittömien tuotekustannusten suurten virheiden vuoksi. Työn johtopäätöksissä keskitytään sisäisen laskentatoimen kulttuurin kehittämiseen tuotekustannuslaskennan ja yleisen kustannusvalvonnan näkökulmasta kohdeyrityksessä.