Influence of liquid layers on energy absorption during particle impact

The influence of the thickness of a covering liquid layer and its viscosity as well as the impact velocity on energy loss during the normal impact on a flat steel wall of spherical granules with a liquid layer was studied. Free-fall experiments were performed to obtain the restitution coefficient of elastic–plastic Al2O3 granules by impact on the liquid layer, using aqueous solutions of hydroxypropyl methylcellulose with different concentrations for variation of viscosity (1–300 mPa s). In the presence of a...     

Increasing engineering students' awareness to environment through innovative teaching of mathematical modelling

This article presents the results of two studies on using aninnovative pedagogical strategy in teaching mathematical modellingand applications to engineering students. Both studies are dealingwith introducing non-traditional contexts for engineering studentsin teaching/learning of mathematical modelling and applications:environment and ecology. The aims of using these contexts were:to introduce students to some of the techniques, methodologiesand principles of mathematical modelling for ecological andenvironmental systems; to involve the students in solving real-lifeproblems adjusted to their region emphasizing the aspects ofboth survival (short term) and sustainability (long term); toencourage students to pay attention to environmental issues.On one hand, the contexts are not directly related to engineering.On the other hand, the chances are that many graduates of engineeringwill deal with mathematical modelling of environmental systemsin one way or another in their future work because nearly everyengineering activity has an impact on the environment. The firststudy is a parallel study conducted in New Zealand and Germanysimultaneously with first-year students studying engineeringmathematics. The second study is a case study of the experimentalcourse Mathematical Modelling of Survival and Sustainabilitytaught to a mixture of year 2–5 engineering students inGermany by a visiting lecturer from New Zealand. The modelsused with the students from both studies had several specialfeatures. Analysis of students’ responses to questionnaires,their comments and attitudes towards the innovative approachin teaching are presented in the article.     

On connected dominating sets of restricted diameter

A connected dominating set (CDS) is commonly used to model a virtual backbone of a wireless network. To bound the distance that information must travel through the network, we explicitly restrict the diameter of a CDS to be no more than s leading to the concept of a dominating s-club. We prove that for any fixed positive integer s it is NP-complete to determine if a graph has a dominating s  -club, even when the graph has diameter s+1$s+1$. As a special case it is NP-complete to determine if a graph of diameter two has a dominating clique. We then propose a compact integer programming formulation for the related minimization problem, enhance the approach with variable fixing rules and valid inequalities, and present computational results.     

Solving maximum clique in sparse graphs: an O(nm+n2^{d/4}) algorithm for d-degenerate graphs

We describe an algorithm for the maximum clique problem that is parameterized by the graph’s degeneracy \(d\) . The algorithm runs in \(O\left( nm+n T_d \right) \) time, where \(T_d\) is the time to solve the maximum clique problem in an arbitrary graph on \(d\) vertices. The best bound as of now is \(T_d=O(2^{d/4})\) by Robson. This shows that the maximum clique problem is solvable in \(O(nm)\) time in graphs for which \(d \le 4 \log _2 m + O(1)\) . The analysis of the algorithm’s runtime is simple; the algorithm is easy to implement when given a subroutine for solving maximum clique in small graphs; it is easy to parallelize. In the case of Bianconi-Marsili power-law random graphs, it runs in \(2^{O(\sqrt{n})}\) time with high probability. We extend the approach for a graph invariant based on common neighbors, generating a second algorithm that has a smaller exponent at the cost of a larger polynomial factor.     

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

Given a simple undirected graph, the problem of finding a maximum subset of vertices satisfying a nontrivial, interesting property Π that is hereditary on induced subgraphs, is known to be NP-hard. Many well-known graph properties meet the above conditions, making the problem widely applicable. This paper proposes a general purpose exact algorithmic framework to solve this problem and investigates key algorithm design and implementation issues that are helpful in tailoring the general framework for specific graph properties. The performance of the algorithms so derived for the maximum s-plex and the maximum s-defective clique problems, which arise in network-based data mining applications, is assessed through a computational study.     

On the behavior of solutions of the equation for components of a normal system of differential equations

We obtain necessary and sufficient conditions for the existence of a sliding mode and also for the knotting of solutions of the equation for components of a normal system of first-order differential equations.     

A cationic cysteine-hydrazide as an enrichment tool for the mass spectrometric characterization of bacterial free oligosaccharides

In Campylobacterales and related ε-proteobacteria with N-linked glycosylation (NLG) pathways, free oligosaccharides (fOS) are released into the periplasmic space from lipid-linked precursors by the bacterial oligosaccharyltransferase (PglB). This hydrolysis results in the same molecular structure as the oligosaccharide that is transferred to a protein to be glycosylated. This allowed for the general elucidation of the fOS-branched structures and monosaccharides from a number of species using standard enrichment and mass spectrometry methods. To aid characterization of fOS, hydrazide chemistry has often been used for chemical modification of the reducing part of oligosaccharides resulting in better selectivity and sensitivity in mass spectrometry; however, the removal of the unreacted reagents used for the modification often causes the loss of the sample. Here, we develop a more robust method for fOS purification and characterize glycostructures using complementary tandem mass spectrometry (MS/MS) analysis. A cationic cysteine hydrazide derivative was synthesized to selectively isolate fOS from periplasmic fractions of bacteria. The cysteine hydrazide nicotinamide (Cyhn) probe possesses both thiol and cationic moieties. The former enables reversible conjugation to a thiol-activated solid support, while the latter improves the ionization signal during MS analysis. This enrichment was validated on the well-studied Campylobacter jejuni by identifying fOS from the periplasmic extracts. Using complementary MS/MS analysis, we approximated data of a known structure of the fOS from Campylobacter concisus. This versatile enrichment technique allows for the exploration of a diversity of protein glycosylation pathways.     

On imposing connectivity constraints in integer programs

We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different applications in signal processing, machine learning, and computer vision. In this paper, we connect these applications via the generic formulation of “cooperative graph cuts”, for which we study complexity, algorithms, and connections to polymatroidal network flows. Finally, we compare the proposed algorithms empirically.