With the advance of artificial intelligence and natural language processing technology, a new tool is standing out in the field of understanding and generating natural language in a sophisticated way: the Large Langua...
详细信息
Training classification models on imbalanceddata tends to result in bias towards the majority class. In this paper, we demonstrate how variable discretization and cost-sensitive logistic regression help mitigate this...
详细信息
Correction to: Nature Biotechnologyhttps://***/10.1038/s41587-024-02535-2, published online 16 January 2025. In the version of the article initially published, Sidi Chen was incorrectly associated with a present addre...
Transcriptomes provide highly informative molecular phenotypes that, combined with gene perturbation, can connect genotype to phenotype. An ultimate goal is to perturb every gene and measure transcriptome changes, how...
Transcriptomes provide highly informative molecular phenotypes that, combined with gene perturbation, can connect genotype to phenotype. An ultimate goal is to perturb every gene and measure transcriptome changes, however, this is challenging, especially in whole animals. Here, we present ‘Worm Perturb-Seq (WPS)’, a method that provides high-resolution RNA-sequencing profiles for hundreds of replicate perturbations at a time in living animals. WPS introduces multiple experimental advances combining strengths of Caenhorhabditis elegans genetics and multiplexed RNA-sequencing with a novel analytical framework, EmpirdE. EmpirdE leverages the unique power of large transcriptomic datasets and improves statistical rigor by using gene-specific empirical null distributions to identify dEGs. We apply WPS to 103 nuclear hormone receptors (NHRs) and find a striking ‘pairwise modularity’ in which pairs of NHRs regulate shared target genes. We envision the advances of WPS to be useful not only for C. elegans, but broadly for other models, including human cells.
Consider dirichlet problems of Laplace's equation in a bounded simply-connecteddomain (Formula presented.), and use the null field equation (NFE) of Green's representation formulation, where the source nodes ...
详细信息
Consider dirichlet problems of Laplace's equation in a bounded simply-connecteddomain (Formula presented.), and use the null field equation (NFE) of Green's representation formulation, where the source nodes (Formula presented.) are located on a pseudo-boundary (Formula presented.) outside (Formula presented.) but not close to its boundary (Formula presented.). Simple algorithms are proposed in this article by using the central rule for the NFE, and the normal derivatives (Formula presented.) of the solutions on the boundary (Formula presented.) can be easily obtained. These algorithms are called the discrete null field equation method (dNFEM) because the collocation equations are, indeed, the direct discrete form of the NFE. The bounds of the condition number are like those by the method of fundamental solutions (MFS) yielding the exponential growth as the number of unknowns increases. One trouble of the dNFEM is the near singularity of integrations for the solutions in boundary layers in Green's representation formulation. The traditional BEM also suffers from the same trouble. To deal with the near singularity, quadrature by expansions and the sinh transformation are often used. To handle this trouble, however, we develop two kinds of new techniques: (I) the interpolation techniques by Taylor's formulas with piecewise (Formula presented.) -degree polynomials and the Fourier series, and (II) the mini-rules of integrals, such as the mini-Simpson's and the mini-Gaussian rules. Error analysis is made for technique I to achieve optimal convergence rates. Numerical experiments are carried out for disk domains to support the theoretical analysis made. The numerical performance of the dNFEM is excellent for disk domains to compete with the MFS. The errors with (Formula presented.) can be obtained by combination algorithms, which are satisfactory for most engineering problems. In summary, the new simple dNFEM is based on the NFE, which is different from the boundary elem
作者:
GOOdMAN, MJGOOdMAN, LEMadeleineJ. Goodman
Ph.D.is Director Women's Studies Program and associate professor General Science and Women's Studies University of Hawaii. She is also principal data analyst of the Hawaii Breast Cancer Detection Project. LennE. Goodman
D. Phil.is professor of philosophy University of Hawaii. His most recent book isMonotheism: A Philosophic Inquiry into the Foundations of Natural Theology and Ethics.
Pillars of smart cities include smart environment, mobility and economy. We explore impacts on these to enhance smart cities, heading towards a smart planet. Our motivation emerges from the need to decarbonize transpo...
详细信息
Pillars of smart cities include smart environment, mobility and economy. We explore impacts on these to enhance smart cities, heading towards a smart planet. Our motivation emerges from the need to decarbonize transportation. In this context, ride-sharing companies deploy electric vehicles (EVs). These should be managed by various factors: battery demand, EV charging station location, service availability, and charging time. Ride-sharing EV s aim to maximize profits via more rides. Our paper explores game theory in AI here. We propose E-Ride-Minimax, adapting the Minimax algorithm, treating EV ride-sharing companies as players. We hypothesize one player choosing its next move via total passenger-travel distance (longer the distance, larger the profit); and another player via battery usage (ratio of total passenger-travel distance to vehicle-passenger distance: optimizing this ratio enables more travel without recharging). Experimental results reveal that rising passenger numbers yield maximum battery savings (e.g. rush hours / major events); followed by stable and falling numbers. Our findings indicate that E-Ride-Minimax can reduce battery usage in some circumstances by 64%, losing 1 % profit. This is vital, given global emphasis on climate change. It increases cost-effectiveness, consumer participation and passengers per mile; reduces energy use and greenhouse gas emissions; and thus helps decarbonize transportation.
As we increase our reliance on computer-generated information, often using it as part of our decision-making process, we must devise tools to assess the correctness of that information. Consider, for example, software...
ISBN:
(数字)9781627058346
As we increase our reliance on computer-generated information, often using it as part of our decision-making process, we must devise tools to assess the correctness of that information. Consider, for example, software embedded on vehicles, used for simulating aircraft performance, or used in medical imaging. In those cases, software correctness is of paramount importance as there"s little room for error. Software verification is one of the tools available to attain such goals. Verification is a well known and widely studied subfield of computer science and computational science and the goal is to help us increase confidence in the software implementation by verifying that the software does what it is supposed to do. The goal of this book is to introduce the reader to software verification in the context of visualization. In the same way we became more dependent on commercial software, we have also increased our reliance on visualization software. The reason is simple: visualization is the lens through which users can understand complex data, and as such it must be verified. The explosion in our ability to amass data requires tools not only to store and analyze data, but also to visualize it. This book is comprised of six chapters. After an introduction to the goals of the book, we present a brief description of both worlds of visualization (Chapter 2) and verification (Chapter 3). We then proceed to illustrate the main steps of the verification pipeline for visualization algorithms. We focus on two classic volume visualization techniques, namely, Isosurface Extraction (Chapter 4) anddirect Volume Rendering (Chapter 5). We explain how to verify implementations of those techniques and report the latest results in the field of verification of visualization techniques. The last chapter concludes the book and highlights new research topics for the future.
暂无评论