Scalable grid resource allocation for scientific workflows using hybrid metaheuristics

Grid infrastructure is a valuable tool for scientific users, but it is characterized by a high level of complexity which makes it difficult for them to quantify their requirements and allocate resources. In this paper, we show that resource trading is a viable and scalable approach for scientific users to consume resources. We propose the use of Grid resource bundles to specify supply and demand combined with a hybrid metaheuristic method to determine the allocation of resources in a market-based approach. We evaluate this through the application domain of scientific workflow execution on the Grid

How willing are you to accept sexual requests from slightly unattractive to exceptionally attractive imagined requestors?

This is the post print version of the article. The official published version can be accessed from the link below.In their classic study of differences in mating strategies (Clark & Hatfield, 1989), men and women demonstrated a striking difference in interest in casual sex. The current study examined the role of requestor physical attractiveness (slightly unattractive, moderately attractive and exceptionally attractive) on men's and women's willingness to accept three different requests (go out, come to apartment, go to bed) in a questionnaire study. We tested two hypotheses, using a sample of 427 men and 443 women from three countries. Hypothesis 1 states that men, relative to women, will demonstrate a greater willingness to accept the “come to apartment” and “go to bed” requests but not the “go out” request for all three levels of requestor attractiveness. This hypothesis reflects Clark and Hatfield's (1989) main findings. Hypothesis 2 states that the physical attractiveness of a potential partner will have a greater effect on women's than on men's willingness to accept all three requests, and particularly for the explicit request for casual sex. The results partially supported Hypothesis 1 and fully supported Hypothesis 2. The discussion highlights limitations of the current research and presents directions for future research

Pseudo-distances on symplectomorphism groups and applications to flux theory

Starting from a given norm on the vector space of exact 1-forms of a compact symplectic manifold, we produce pseudo-distances on its symplectomorphism group by generalizing an idea due to Banyaga. We prove that in some cases (which include Banyaga's construction), their restriction to the Hamiltonian diffeomorphism group is equivalent to the distance induced by the initial norm on exact 1-forms. We also define genuine "distances to the Hamiltonian diffeomorphism group" which we use to derive several consequences, mainly in terms of flux groups.Comment: 21 pages, no figure; v2. various typos corrected, some references added. Published in Mathematische Zeitschrif

Speech-evoked ABR: Effects of age and simulated neural temporal jitter

The speech-evoked auditory brainstem response (sABR) provides a measure of encoding complex stimuli in the brainstem, and this study employed the sABR to better understand the role of neural temporal jitter in the response patterns from older adults. In experiment 1, sABR recordings were used to investigate age-related differences in periodicity encoding of the temporal envelope and fine structure components of the response to a /da/speech token. A group of younger and a group of older adults (n = 22 per group) participated. The results demonstrated reduced amplitude of the fundamental frequency and harmonic components in the spectral domain of the recorded response of the older listeners. In experiment 2, a model of neural temporal jitter was employed to simulate in a group of young adults (n = 22) the response patterns measured from older adults. A small group of older adults (n = 7) were also tested under the jitter simulation conditions. In the young adults, the results showed a systematic reduction in the response amplitude of the most robust response components as the degree of applied jitter increased. In contrast, the older adults did not demonstrate significant response reduction when tested under jitter conditions. The overall pattern of results suggests that older adults have reduced neural synchrony for encoding periodic, complex signals at the level of the brainstem, and that this reduced synchrony can be modeled by simulating neural jitter via disruption of the temporal waveform of the stimulus

Unlocking the Fertilizer Potential of Waste-Derived Biochar

Mankind is facing a phosphorus (P) crisis. P recycling from anthropogenic waste is critical to close the P loop. Pyrolysis could be the ideal treatment for materials, such as sewage sludge (SS), producing a safe, nutrient-rich biochar product while sequestering the inherent carbon (C). However, pyrolyzed sewage sludge typically contains low levels of potassium (K) and plant available P, making the material rather unsuitable for use as fertilizer. Here, a novel treatment was investigated to produce an optimized P and K biochar fertilizer. We doped sewage sludge with a low-cost mineral (2 and 5% potassium acetate) and pyrolyzed it at 700 °C. The percentage water extractable of the total P content in biochar increased by 237 times with 5% K addition compared to the undoped biochar. After six water extractions, all of the K and 16% of P were obtained. Further optimization is feasible through adjustments of the biochar pH or doping the feedstock with other forms of K. Using X-ray absorption near-edge spectroscopy (XANES) and synchrotron X-ray fluorescence (XRF) mapping, we identified highly soluble potassium hydrogen phosphate up to 200−300 μm below the biochar surface. This simple and cost-effective modification enables the use of sewage sludge as safe biochar fertilizer with tailored P availability that also supplies K, improves soil properties, and sequesters C

Three-body collisions in Boltzmann-Uehling-Uhlenbeck theory

Aiming at a microscopic description of heavy ion collisions in the beam energy region of about 10 A GeV, we extend the Giessen Boltzmann-Uehling-Uhlenbeck (GiBUU) transport model by including a relativistic mean field, in-medium baryon-baryon cross sections and three-body collisions. The model is then compared with experimental data for central Au+Au collisions at 2-10 A GeV and central Pb+Pb collisions at 30 and 40 A GeV on the proton rapidity spectra, the midrapidity yields of $\pi^+$, $K^\pm$ and $(\Lambda+\Sigma^0)$, and the transverse mass spectra of $\pi^\pm$ and $K^\pm$. The three-body collisions increase the inverse slope parameters of the hadron $m_\perp$-spectra to a good agreement with the data.Comment: 26 pages, 9 figures, figures added, discussion extended, results not changed, version accepted in Phys. Rev.

ANALYSIS OF HUMAN MOTION WITH METHODS FROM MACHINE LEARNING

Usually, predefined kinematic parameters are investigated in biomechanical studies of human motion. In recent years, techniques of machine learning have been added to this field of research (Chau, 2001). In this study different dimension reduction methods like Principal Component Analysis (PCA) and Fourier Transformation (FT) are investigated as an alternative to common biomechanical approaches in motion analysis

On Sparsification for Computing Treewidth

We investigate whether an n-vertex instance (G,k) of Treewidth, asking whether the graph G has treewidth at most k, can efficiently be made sparse without changing its answer. By giving a special form of OR-cross-composition, we prove that this is unlikely: if there is an e > 0 and a polynomial-time algorithm that reduces n-vertex Treewidth instances to equivalent instances, of an arbitrary problem, with O(n^{2-e}) bits, then NP is in coNP/poly and the polynomial hierarchy collapses to its third level. Our sparsification lower bound has implications for structural parameterizations of Treewidth: parameterizations by measures that do not exceed the vertex count, cannot have kernels with O(k^{2-e}) bits for any e > 0, unless NP is in coNP/poly. Motivated by the question of determining the optimal kernel size for Treewidth parameterized by vertex cover, we improve the O(k^3)-vertex kernel from Bodlaender et al. (STACS 2011) to a kernel with O(k^2) vertices. Our improved kernel is based on a novel form of treewidth-invariant set. We use the q-expansion lemma of Fomin et al. (STACS 2011) to find such sets efficiently in graphs whose vertex count is superquadratic in their vertex cover number.Comment: 21 pages. Full version of the extended abstract presented at IPEC 201