Dynamics of the Groundwater Levels in Shallow Aquifers of WRC-1 Watershed, Chargarh River Basin, Central India

Shallow unconfined aquifer in hard rock terrain generally have complicated and heterogeneous hydrogeological setup. Present study incorporates dynamics of the static groundwater levels in the Chargarh river basin, Central India, during pre-monsoon and post-monsoon season, with special reference to lithological variation. The geological formations exposed in the basin are Deccan basalt and alluvium. The average pre-monsoon and post-monsoon static water levels in the basalt formation are 12.21 mbgl to 6.14 mbgl respectively, with 6.07-meter seasonal water table fluctuation. On the other hand, average pre-monsoon and post-monsoon static water levels (SWL) in the alluvial formation are 16.84 mbgl to 4.64 mbgl respectively, with 12.20 m the water table fluctuation (WTF). The pre-monsoon SWL in alluvium is deeper as compared to the pre-monsoon SWL in basalt. Similarly, WTF in alluvium is higher than WTF in basalt. These observations are reversed to that of the general assumption, that the WTF in soft rock formations are lower as compared to WTF in hard rock terrain. This can be attributed to the excessive withdrawal of groundwater for orange cultivation and sporadic artificial recharge structures in the alluvial formation

Universal families of arcs and curves on surfaces

The main goal of this paper is to investigate the minimal size of families of curves on surfaces with the following property: a family of simple closed curves $\Gamma$ on a surface realizes all types of pants decompositions if for any pants decomposition of the surface, there exists a homeomorphism sending it to a subset of the curves in $\Gamma$. The study of such universal families of curves is motivated by questions on graph embeddings, joint crossing numbers and finding an elusive center of moduli space. In the case of surfaces without punctures, we provide an exponential upper bound and a superlinear lower bound on the minimal size of a family of curves that realizes all types of pants decompositions. We also provide upper and lower bounds in the case of surfaces with punctures which we can consider labelled or unlabelled, and investigate a similar concept of universality for triangulations of polygons, where we provide bounds which are tight up to logarithmic factors.Comment: v2: Fixed a mistake in one of the lower bound

Degenerate crossing number and signed reversal distance

The degenerate crossing number of a graph is the minimum number of transverse crossings among all its drawings, where edges are represented as simple arcs and multiple edges passing through the same point are counted as a single crossing. Interpreting each crossing as a cross-cap induces an embedding into a non-orientable surface. In 2007, Mohar showed that the degenerate crossing number of a graph is at most its non-orientable genus and he conjectured that these quantities are equal for every graph. He also made the stronger conjecture that this also holds for any loopless pseudotriangulation with a fixed embedding scheme. In this paper, we prove a structure theorem that almost completely classifies the loopless 2-vertex embedding schemes for which the degenerate crossing number equals the non-orientable genus. In particular, we provide a counterexample to Mohar's stronger conjecture, but show that in the vast majority of the 2-vertex cases, the conjecture does hold. The reversal distance between two signed permutations is the minimum number of reversals that transform one permutation to the other one. If we represent the trajectory of each element of a signed permutation under successive reversals by a simple arc, we obtain a drawing of a 2-vertex embedding scheme with degenerate crossings. Our main result is proved by leveraging this connection and a classical result in genome rearrangement (the Hannenhali-Pevzner algorithm) and can also be understood as an extension of this algorithm when the reversals do not necessarily happen in a monotone order.Comment: Appears in the Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023

Direct Growth of High Mobility and Lowâ Noise Lateral MoS2â Graphene Heterostructure Electronics

Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/138199/1/smll201604301_am.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/138199/2/smll201604301.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/138199/3/smll201604301-sup-0001-S1.pd

Computational Modeling of Molecular Structure, Assembly, and Dynamics at Nanoscale

Today, atomic simulations of biological systems and materials can reach unprecedented scales, providing in-depth insight into the structural and dynamic properties of a system of particles governed by classical equations of motion. In two main projects, the studies presented in this dissertation employ molecular dynamics simulations to study the structural and physical properties of large-scale biological and chemical complexes over microsecond timescales. (i) In the first project, the macromolecular assembly and functional flexibility of the tight junctions claudins are studied. Tight junctions mediate the epithelial transport and are composed of a network of claudin channels that seal the space between two adjacent cells and control the transport of water and small molecules. Claudins polymerize to form a network of linear strands in the cell membrane that associates laterally with a similar network in adjoining cells. The architecture of claudin assemblies is flexible and therefore enables tight junctions to maintain their barrier function throughout cellular movements and tissue rearrangements. However, this flexibility’s molecular basis remains elusive. This thesis develops an atomic model of claudin-15 strands in two parallel lipid membranes at sub-micrometer length ranges. Microseconds-long molecular dynamic simulations of claudin-15 strands showcase the strands’ flexible nature and elucidate their flexibility’s molecular nature. Furthermore, to explain the subtype-specific morphology of claudin strands, the equilibrium behavior of wild-type and mutant claudin-15 strands are compared, validating the putative model of strand flexibility, as observed in simulation trajectories. (ii) The second project in this thesis investigates the phase behavior of ternary ionic liquid electrolyte mixtures. The performance and stability of battery electrolytes are, in part, the obstacles hindering the widespread usage of advanced and renewable energy storage systems, namely, lithium batteries. Recently, ternary mixtures of ionic liquid electrolytes have shown promising performance in Li-ion and Li-air batteries. However, the large-scale organization of the electrolyte mixture—beyond the local heterogeneities—that underpins the system’s dynamic properties is unexplored. In this thesis, microseconds-long molecular dynamics simulations reveal the formation of ion-enriched macrodomains in a ternary mixture of ionic liquid, organic solvent, and Li salts. Moreover, the mixtures’ phase behavior is examined in a confined space, similar to a cell battery configuration. The simulation trajectories elucidate the molecular basis of electrolytes’ phase separation, leading to better battery performance

MICROSCOPIC DESCRIPTION OF ISOSCALAR MONOPOLE NUCLEAR EXCITATIONS WITH ACCURATE TAKING ONE-PARTIAL CONTINUUM INTO CONSIDERATION

The aim is to perform the detailed investigation of the strength functions in the oberton of the isoscalar monopole gigantic resonance taking influence of the one-partial continuum into consideration. The qualitative analysis of the oberton structure in the isoscalar monopole gigantic resonance in the nucleus with use of the realistics of the middle nucleus field and effective interaction in approximation of the random phase with accurate taking one-partial continuum into consideration has been carried out. The developed methods for analysis of the strength functions in the obertons and methods for design of the partial nucleon widths in the gigantic resonance permit to forecast the results of the experimentsAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio

CodeGrapher: an image representation method to enhance software vulnerability prediction

Contemporary software systems face a severe threat from vulnerabilities, prompting exploration of innovative solutions. Machine Learning (ML) algorithms have emerged as promising tools for predicting software vulnerabilities. However, the diverse sizes of source codes pose a significant obstacle, resulting in varied numerical vector sizes. This diversity disrupts the uniformity needed for ML models, causing information loss, increased false positives, and false negatives, diminishing vulnerability analysis accuracy. In response, we propose CodeGrapher, preserving semantic relations within source code during vulnerability prediction. Our approach involves converting numerical vector representations into image sets for ML input, incorporating similarity distance metrics to maintain vital code relationships. Using Abstract Syntax Tree (AST) representation and skip-gram embedding for numerical vector conversion, CodeGrapher demonstrates potential to significantly enhance prediction accuracy. Leveraging image scalability and resizability addresses challenges from varying numerical vector sizes in ML-based vulnerability prediction. By converting input vectors to images with a set size, CodeGrapher preserves semantic relations, promising improved software security and resilient systems

Effects of Mesolites from Moghueieh Region and their Particles Size on Performance, Blood Biochemical Parameters and Nutrient Digestibility in Broiler Chickens

In this study the effects of mesolites from Moghueieh region and their particles size on performance, blood biochemical parameters and nutrient digestibility in broiler chickens were evaluated. The experiment was conducted on a completely randomized design with three treatments: without mesolite (control) and with fine particle mesolite (passed of 1 mm sieve and stay in 0.225 mm sieve) or large particle mesolite (passed of 3.36 mm sieve and stay in 1.68 mm sieve). Mesolite added in amount of 2% in diet from 7 day of age. Results indicated that chickens fed large particle mesolite showed reduced performance and fine particle mesolite had no effect on broilers performance. When compared with the controls, body weight gains were significantly lower for birds fed diets containing large particle mesolite. Birds fed large particle mesolite showed higher feed conversion ratio. At the end of the experiment (42 day of age), control group had higher serum TG. Concentration of serum HDL in chickens fed large particle mesolite was higher than control group. Level of serum alkaline phosphatase, glucose, albumin, thyroxin, cholesterol, LDL and uric acid and digestibility of dry matter and protein were not affected by treatments

Short Topological Decompositions of Non-Orientable Surfaces

International audienceWe investigate short topological decompositions of non-orientable surfaces and provide algorithms to compute them. Our main result is a polynomial-time algorithm that for any graph embedded in a non-orientable surface computes a canonical non-orientable system of loops so that any loop from the canonical system intersects any edge of the graph in at most 30 points. The existence of such short canonical systems of loops was well known in the orientable case and an open problem in the non-orientable case. Our proof techniques combine recent work of Schaefer-Štefankovič with ideas coming from computational biology, specifically from the signed reversal distance algorithm of Hannenhalli-Pevzner. This result confirms a special case of a conjecture of Negami on the joint crossing number of two embeddable graphs. We also provide a correction for an argument of Negami bounding the joint crossing number of two non-orientable graph embeddings