Optimal Investment in the Development of Oil and Gas Field

Let an oil and gas field consists of clusters in each of which an investor can launch at most one project. During the implementation of a particular project, all characteristics are known, including annual production volumes, necessary investment volumes, and profit. The total amount of investments that the investor spends on developing the field during the entire planning period we know. It is required to determine which projects to implement in each cluster so that, within the total amount of investments, the profit for the entire planning period is maximum. The problem under consideration is NP-hard. However, it is solved by dynamic programming with pseudopolynomial time complexity. Nevertheless, in practice, there are additional constraints that do not allow solving the problem with acceptable accuracy at a reasonable time. Such restrictions, in particular, are annual production volumes. In this paper, we considered only the upper constraints that are dictated by the pipeline capacity. For the investment optimization problem with such additional restrictions, we obtain qualitative results, propose an approximate algorithm, and investigate its properties. Based on the results of a numerical experiment, we conclude that the developed algorithm builds a solution close (in terms of the objective function) to the optimal one

Decentralized P2P power trading mechanism for dynamic multi-energy microgrid groups based on priority matching

In order to promote the interaction among interconnected microgrids (MGs) with multiply distributed energy resources (DERs) to local energy utilization, a decentralized peer-to-peer (P2P) power trading mechanism based on priority matching is proposed. The priority indices are calculated based on scheduling results and quotations by an independent MG operator (IMO), which protect effectively the privacy and represent the bargaining willingness of MGs. According to the supply-demand ratio within a matching pair, each MG is permitted to update its quotation multi-times until the convergence or updated number limitation is reached. The clearing price of each pair is calculated by the mid-market rate (MMR) method. Because the imbalanced power is different with the autonomous scheduling in a MG at different dispatching time, the different power requirements of MGs results in the formation of the dynamic MG groups. The simulation results in an interconnected multi-microgrid system (IMMGS) with 4 MGs show the proposed decentralized P2P mechanism is reasonable and effective. (C) 2022 Published by Elsevier Ltd

A Poisson mixture model to identify changes in RNA polymerase II binding quantity using high-throughput sequencing technology

We present a mixture model-based analysis for identifying differences in the distribution of RNA polymerase II (Pol II) in transcribed regions, measured using ChIP-seq (chromatin immunoprecipitation following massively parallel sequencing technology). The statistical model assumes that the number of Pol II-targeted sequences contained within each genomic region follows a Poisson distribution. A Poisson mixture model was then developed to distinguish Pol II binding changes in transcribed region using an empirical approach and an expectation-maximization (EM) algorithm developed for estimation and inference. In order to achieve a global maximum in the M-step, a particle swarm optimization (PSO) was implemented. We applied this model to Pol II binding data generated from hormone-dependent MCF7 breast cancer cells and antiestrogen-resistant MCF7 breast cancer cells before and after treatment with 17β-estradiol (E2). We determined that in the hormone-dependent cells, ~9.9% (2527) genes showed significant changes in Pol II binding after E2 treatment. However, only ~0.7% (172) genes displayed significant Pol II binding changes in E2-treated antiestrogen-resistant cells. These results show that a Poisson mixture model can be used to analyze ChIP-seq data

Genome-wide analysis of alternative promoters of human genes using a custom promoter tiling array

<p>Abstract</p> <p>Background</p> <p>Independent lines of evidence suggested that a large fraction of human genes possess multiple promoters driving gene expression from distinct transcription start sites. Understanding which promoter is employed in which cellular context is required to unravel gene regulatory networks within the cell.</p> <p>Results</p> <p>We have developed a custom microarray platform that tiles roughly 35,000 alternative putative promoters from nearly 7,000 genes in the human genome. To demonstrate the utility of this array platform, we have analyzed the patterns of promoter usage in 17β-estradiol (E2)-treated and untreated MCF7 cells and show widespread usage of alternative promoters. Most intriguingly, we show that the downstream promoter in E2-sensitive multiple promoter genes tends to be very close to the 3'-terminus of the gene, suggesting exotic mechanisms of expression regulation in these genes.</p> <p>Conclusion</p> <p>The usage of alternative promoters greatly multiplies the transcriptional complexity available within the human genome. The fact that many of these promoters are incapable of driving the synthesis of a meaningful protein-encoding transcript further complicates the story.</p

Domain freezing in potassium dihydrogen phosphate, triglycine sulfate, and CuAlZnNi

The temperature dependence of the dielectric constant and dissipation in potassium dihydrogen phosphate (KDP), its deuterated compound (DKDP), triglycine sulfate (TGS), and TGS doped with α-alanine (LATGS) has been studied at various frequencies. It is found that the relaxation time of domain freezing in KDP and DKDP in the kHz range can be described by the Vogel-Fulcher relation. Evidence of domain freezing in TGS is presented through an analysis of relaxation time related to domain walls and a comparison between TGS and LATGS. Studies of internal friction and compliance show preliminary evidence of domain freezing in CuAlZnNi alloy. A domain-freezing model is proposed based upon the collective pinning of randomly distributed pinning centers to domain walls. Some key experiments related to domain freezing, such as (1) the Vogel-Fulcher relation for relaxation time; (2) the size effect of domain freezing; (3) two kinds of relaxation in low- and high-frequency ranges, respectively; and (4) the dependence of TF on defect density and applied field, etc., are explained.published_or_final_versio

Virtual Reality for early education : a study

This paper investigates the use of Virtual Reality (VR) as a tool for cultural heritage learning, using St Andrews Cathedral as the subject matter. As part of a module focused on local history, first year secondary school pupils in a school in the town of St Andrews took part in virtual tours of the Cathedral as it stood in the 14th Century using the Samsung Gear VR, Google Cardboard, Oculus Rift, computer screen and Xbox controller, and answered questions aimed to elicit their experiences with the various systems. The system design and implementation is presented and the findings, observations and lessons learnt from the study are discussed.Postprin

Current-density functional theory of time-dependent linear response in quantal fluids: recent progress

Vignale and Kohn have recently formulated a local density approximation to the time-dependent linear response of an inhomogeneous electron system in terms of a vector potential for exchange and correlation. The vector potential depends on the induced current density through spectral kernels to be evaluated on the homogeneous electron-gas. After a brief review of their theory, the case of inhomogeneous Bose superfluids is considered, with main focus on dynamic Kohn-Sham equations for the condensate in the linear response regime and on quantal generalized hydrodynamic equations in the weak inhomogeneity limit. We also present the results of calculations of the exchange-correlation spectra in both electron and superfluid boson systems.Comment: 12 pages, 2 figures, Postscript fil

PocketMatch: A new algorithm to compare binding sites in protein structures

Background: Recognizing similarities and deriving relationships among protein molecules is a fundamental&#xd;&#xa;requirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites. Inferring functional similarities between protein molecules by comparing their binding sites is still largely exploratory and not as yet a routine protocol. One of&#xd;&#xa;the main reasons for this is the limitation in the choice of appropriate analytical tools that can compare binding sites with high sensitivity. To benefit from the enormous amount of structural data that is being rapidly accumulated, it is essential to have high throughput tools that enable large scale binding site comparison.&#xd;&#xa;&#xd;&#xa;Results: Here we present a new algorithm PocketMatch for comparison of binding sites in a frame invariant&#xd;&#xa;manner. Each binding site is represented by 90 lists of sorted distances capturing shape and chemical nature of the site. The sorted arrays are then aligned using an incremental alignment method and scored to obtain PMScores for pairs of sites. A comprehensive sensitivity analysis and an extensive validation of the algorithm have been carried out. Perturbation studies where the geometry of a given site was retained but the residue types were changed randomly, indicated that chance similarities were virtually non-existent. Our analysis also demonstrates that shape information alone is insufficient to discriminate between diverse binding sites, unless&#xd;&#xa;combined with chemical nature of amino acids.&#xd;&#xa;&#xd;&#xa;Conclusions: A new algorithm has been developed to compare binding sites in accurate, efficient and&#xd;&#xa;high-throughput manner. Though the representation used is conceptually simplistic, we demonstrate that along&#xd;&#xa;with the new alignment strategy used, it is sufficient to enable binding comparison with high sensitivity. Novel methodology has also been presented for validating the algorithm for accuracy and sensitivity with respect to geometry and chemical nature of the site. The method is also fast and takes about 1/250th second for one comparison on a single processor. A parallel version on BlueGene has also been implemented

Extreme Food-Plant Specialisation in Megabombus Bumblebees as a Product of Long Tongues Combined with Short Nesting Seasons

© 2015 Huang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. http://creativecommons.org/licenses/by/4.0/ The attached file is the published version of the article