More stories

  • in

    Game theory and economics show how to steer evolution in a better direction

    Human behavior drives the evolution of biological organisms in ways that can profoundly adversely impact human welfare. Understanding people’s incentives when they do so is essential to identify policies and other strategies to improve evolutionary outcomes. In a new study publishing November 16thin the open access journal, PLOS Biology, researchers led by Troy Day at Queens University and David McAdams at Duke University bring the tools of economics and game theory to evolution management.
    From antibiotic-resistant bacteria that endanger our health to control-resistant crop pests that threaten to undermine global food production, we are now facing the harmful consequences of our failure to efficiently manage the evolution of the biological world. As Day explains, “By modelling the joint economic and evolutionary consequences of people’s actions we can determine how best to incentivize behavior that is evolutionarily desirable.”
    The centerpiece of the new analysis is a simple mathematical formula that determines when physicians, farmers, and other “evolution managers” will have sufficient incentive to steward the biological resources that are under their control, trading off the short-term costs of stewardship against the long-term benefits of delaying adverse evolution.
    For instance, when a patient arrives in an urgent-care facility, screening them to determine if they are colonized by a dangerous superbug is costly, but protects future patients by allowing superbug carriers to be isolated from others. Whether the facility itself gains from screening patients depends on how it weighs these costs and benefits.
    The researchers take the mathematical model further by implementing game theory, which analyzes how individuals’ decisions are interconnected and can impact each other — such as physicians in the same facility whose patients can infect each other or corn farmers with neighboring fields. Their game-theoretic analysis identifies conditions under which outcomes can be improved through policies that change incentives or facilitate coordination.
    “In the example of antibiotic-resistant bacteria, hospitals could go above and beyond to control the spread of superbugs through methods like community contact tracing,” McAdams says. “This would entail additional costs and, alone, a hospital would likely not have an incentive to do so. But if every hospital took this additional step, they might all collectively benefit from slowing the spread of these bacteria. Game theory gives you a systematic way to think through those possibilities and maximize overall welfare.”
    “Evolutionary change in response to human interventions, such as the evolution of resistance in response to drug treatment or evolutionary change in response to harvesting, can have significant economic repercussions,” Day adds. “We determine the conditions under which it is economically beneficial to employ costly strategies that limit evolution and thereby preserve the value of biological resources for longer.”
    Story Source:
    Materials provided by PLOS. Note: Content may be edited for style and length. More

  • in

    Mathematicians derive the formulas for boundary layer turbulence 100 years after the phenomenon was first formulated

    Turbulence makes many people uneasy or downright queasy. And it’s given researchers a headache, too. Mathematicians have been trying for a century or more to understand the turbulence that arises when a flow interacts with a boundary, but a formulation has proven elusive.
    Now an international team of mathematicians, led by UC Santa Barbara professor Björn Birnir and the University of Oslo professor Luiza Angheluta, has published a complete description of boundary layer turbulence. The paper appears in Physical Review Research, and synthesizes decades of work on the topic. The theory unites empirical observations with the Navier-Stokes equation — the mathematical foundation of fluid dynamics — into a mathematical formula.
    This phenomenon was first described around 1920 by Hungarian physicist Theodore von Kármán and German physicist Ludwig Prandtl, two luminaries in fluid dynamics. “They were honing in on what’s called boundary layer turbulence,” said Birnir, director of the Center for Complex and Nonlinear Science. This is turbulence caused when a flow interacts with a boundary, such as the fluid’s surface, a pipe wall, the surface of the Earth and so forth.
    Prandtl figured out experimentally that he could divide the boundary layer into four distinct regions based on proximity to the boundary. The viscous layer forms right next to the boundary, where turbulence is damped by the thickness of the flow. Next comes a transitional buffer region, followed by the inertial region, where turbulence is most fully developed. Finally, there is the wake, where the boundary layer flow is least affected by the boundary, according to a formula by von Kármán.
    The fluid flows quicker farther from the boundary, but its velocity changes in a very specific manner. Its average velocity increases in the viscous and buffer layers and then transitions to a logarithmic function in the inertial layer. This “log law,” found by Prandtl and von Kármán, has perplexed researchers, who worked to understand where it came from and how to describe it.
    The flow’s variation — or deviation from the mean velocity — also displayed peculiar behavior across the boundary layer. Researchers sought to understand these two variables and derive formulas that could describe them. More

  • in

    Researchers develop rapid computer software to track pandemics as they happen

    Researchers at Georgia State University have created lightning-fast computer software that can help nations track and analyze pandemics, like the one caused by COVID-19, before they spread like wildfire around the globe.
    The group of computer science and mathematics researchers says its new software is several orders of magnitude faster than existing computer programs and can process more than 200,000 novel virus genomes in less than two hours. The software then builds a clear visual tree of the strains and where they are spreading. This provides information that can be invaluable for countries making early decisions about lockdowns, quarantines, social distancing and testing during infectious disease outbreaks.
    “The future of infectious outbreaks will no doubt be heavily data driven,” said Alexander Zelikovsky, a Georgia State computer science professor who worked on the project.
    The new software was co-created with Pavel Skums, assistant professor of computer science, Mark Grinshpon, principal senior lecturer of mathematics and statistics, Daniel Novikov, a computer science Ph.D. student, and two former Georgia State Ph.D. students — Sergey Knyazev (now a postdoctoral scholar at the University of California at Los Angeles) and Pelin Icer (now a postdoctoral scholar at Swiss Federal Institute of Technology, ETH Zürich).
    Their paper describing the new approach, “Scalable Reconstruction of SARS-CoV-2 Phylogeny with Recurrent Mutations,” was published in the Journal of Computational Biology.
    “The COVID-19 pandemic has been an unprecedented challenge and opportunity for scientists,” said Skums, who noted that never before have researchers around the world sequenced so many complete genomes of any virus. The strains of SARS-CoV-2 are uploaded onto the free global GISAID database (https://www.gisaid.org/hcov19-variants/), where they can be data-mined and studied by any scientist. Zelikovsky, Skums and their colleagues analyzed more than 300,000 different GISAID strains for their new work. More

  • in

    A nanoantenna for long-distance, ultra-secure communication

    Information storage and transfer in the manner of simple ones and zeros — as in today’s classical computer technologies — is insufficient for quantum technologies under development. Now, researchers from Japan have fabricated a nanoantenna that will help bring quantum information networks closer to practical use.
    In a study recently published in Applied Physics Express, researchers from Osaka University and collaborating partners have substantially enhanced photon-to-electron conversion through a metal nanostructure, which is an important step forward in the development of advanced technologies for sharing and processing data.
    Classical computer information is based on simple on/off readouts. It’s straightforward to use a technology known as a repeater to amplify and retransmit this information over long distances. Quantum information is based on comparatively more complex and secure readouts, such as photon polarization and electron spin. Semiconductor nanoboxes known as quantum dots are materials that researchers have proposed for storing and transferring quantum information. However, quantum repeater technologies have some limitations — for example, current ways to convert photon-based information to electron-based information are highly inefficient. Overcoming this information conversion and transfer challenge is what the researchers at Osaka University aimed to address.
    “The efficiency of converting single photons into single electrons in gallium arsenide quantum dots — common materials in quantum communication research — is currently too low,” explains lead author Rio Fukai. “Accordingly, we designed a nanoantenna — consisting of ultra-small concentric rings of gold — to focus light onto a single quantum dot, resulting in a voltage readout from our device.”
    The researchers enhanced photon absorption by a factor of up to 9, compared with not using the nanoantenna. After illuminating a single quantum dot, most of the photogenerated electrons weren’t trapped there, and instead accumulated in impurities or other locations in the device. Nevertheless, these excess electrons gave a minimal voltage readout that was readily distinguished from that generated by the quantum dot electrons, and thus didn’t disrupt the device’s intended readout.
    “Theoretical simulations indicate that we can improve the photon absorption by up to a factor of 25,” says senior author Akira Oiwa. “Improving the alignment of the light source and more precisely fabricating the nanoantenna are ongoing research directions in our group.”
    These results have important applications. Researchers now have a means of using well-established nano-photonics to advance the prospects of upcoming quantum communication and information networks. By using abstract physics properties such as entanglement and superposition, quantum technology could provide unprecedented information security and data processing in the coming decades.
    Story Source:
    Materials provided by Osaka University. Note: Content may be edited for style and length. More

  • in

    Research team makes considerable advance in brain-inspired computing

    While AI is often perceived by the public to be affiliated with software, researchers in Han Wang’s Emerging Nanoscale Materials and Device Lab at USC Ming Hsieh Department of Electrical and Computer Engineering and the Mork Family Department of Chemical, focus on improving AI and machine learning performance through hardware. The lab, whose work is concentrated on neuromorphic computing or brain-inspired computing, has new research that introduces hardware improvements by harnessing a quality known as “randomness” or “stochasticity.” Their research now published in Nature Communications, contradicts the perception of randomness as a quality that will negatively impact computation results and demonstrates the utilization of finely controlled stochastic features in semiconductor devices to improve performing optimization.
    In the brain, randomness plays an important role in human thought or computation. It is born from billions of neurons that spike in response to input stimuli and generate a lot of signals that may or may not be relevant. The decision-making process perhaps is the best-studied example of how our brain makes use of randomness. It allows the brain to take a detour from past experiences and explore a new solution when making a decision, especially to a challenging and unpredictable situation.
    “Neurons exhibit stochastic behavior, which can help certain computational functions” said a USC PhD student Jiahui Ma and a lead author Xiaodong Yan (both equally contributed as first authors). The team wanted to emulate neurons as much as possible and designed a circuit to solve combinatorial optimization problems, which are one of the most important tasks for computers to complete.
    The thinking is that for computers to do this efficiently, they need to behave more like the human brain (on super steroids) in terms of how they process stimuli and information, as well as make decisions.
    In much simpler terms, we need computers to converge on the best solution among all possibilities. Says the researchers, “The randomness introduced in the new device demonstrated in this work can prevent it from getting stuck at a not-so-viable solution, and instead continue to search until it finds a close-to-optimal result.” This is particularly important for optimization problems, says corresponding author Professor Wang, “If one can dynamically tune the randomness features, the machine for performing optimization can work more efficiently as we desire.”
    The researchers achieve this dynamic “tuning” by creating a specialized device, a hetero-memristor. Unlike transistors which are logic switches inside a regular computer chip, the hetero-memristor combines memory and computation together. Memristors have been developed prior, normally with two-terminal structure. The Viterbi team’s innovation is in adding a third electrical terminal and modulating its voltage to activate the neuron-like device and to dynamically tune the stochastic features in its output, much like one heats up a pot of water and dynamically adjusts the temperature to control the activity of the water molecules, hence enabling the so-called simulated “cooling.” This provides a level of control that earlier memristors do not have.
    The researchers say, “This method emulates the stochastic properties of neuron activity.” In fact, neuron activity is perceived to be random, but may follow a certain probability pattern. The hetero-memristors they developed introduce such probability-governed randomness into a neuromorphic computing circuit by the reconfigurable tuning of the device’s intrinsic stochastic property.
    This is thus a more sophisticated building block for creating computers that can tackle sophisticated optimization problems, which can potentially be more efficient. What’s more they can consume less power.
    The full research team includes Xiaodong Yan, Jiahui, Ma Tong Wu, Aoyang Zhang, Jiangbin Wu, Matthew Chin, Zhihan Zhang, Madan Dubey, Wei Wu, Mike Shuo-Wei Chen, Jing Guo, & Han Wang.
    Research was done in collaboration with the Army Research Laboratory, the University of Florida and Georgia Tech.
    Story Source:
    Materials provided by University of Southern California. Original written by Amy Blumenthal. Note: Content may be edited for style and length. More

  • in

    Big data privacy for machine learning just got 100 times cheaper

    Rice University computer scientists have discovered an inexpensive way for tech companies to implement a rigorous form of personal data privacy when using or sharing large databases for machine learning.
    “There are many cases where machine learning could benefit society if data privacy could be ensured,” said Anshumali Shrivastava, an associate professor of computer science at Rice. “There’s huge potential for improving medical treatments or finding patterns of discrimination, for example, if we could train machine learning systems to search for patterns in large databases of medical or financial records. Today, that’s essentially impossible because data privacy methods do not scale.”
    Shrivastava and Rice graduate student Ben Coleman hope to change that with a new method they’ll present this week at CCS 2021, the Association for Computing Machinery’s annual flagship conference on computer and communications security. Using a technique called locality sensitive hashing, Shirvastava and Coleman found they could create a small summary of an enormous database of sensitive records. Dubbed RACE, their method draws its name from these summaries, or “repeated array of count estimators” sketches.
    Coleman said RACE sketches are both safe to make publicly available and useful for algorithms that use kernel sums, one of the basic building blocks of machine learning, and for machine-learning programs that perform common tasks like classification, ranking and regression analysis. He said RACE could allow companies to both reap the benefits of large-scale, distributed machine learning and uphold a rigorous form of data privacy called differential privacy.
    Differential privacy, which is used by more than one tech giant, is based on the idea of adding random noise to obscure individual information.
    “There are elegant and powerful techniques to meet differential privacy standards today, but none of them scale,” Coleman said. “The computational overhead and the memory requirements grow exponentially as data becomes more dimensional.”
    Data is increasingly high-dimensional, meaning it contains both many observations and many individual features about each observation.
    RACE sketching scales for high-dimensional data, he said. The sketches are small and the computational and memory requirements for constructing them are also easy to distribute.
    “Engineers today must either sacrifice their budget or the privacy of their users if they wish to use kernel sums,” Shrivastava said. “RACE changes the economics of releasing high-dimensional information with differential privacy. It’s simple, fast and 100 times less expensive to run than existing methods.”
    This is the latest innovation from Shrivasta and his students, who have developed numerous algorithmic strategies to make machine learning and data science faster and more scalable. They and their collaborators have: found a more efficient way for social media companies to keep misinformation from spreading online, discovered how to train large-scale deep learning systems up to 10 times faster for “extreme classification” problems, found a way to more accurately and efficiently estimate the number of identified victims killed in the Syrian civil war, showed it’s possible to train deep neural networks as much as 15 times faster on general purpose CPUs (central processing units) than GPUs (graphics processing units), and slashed the amount of time required for searching large metagenomic databases.
    The research was supported by the Office of Naval Research’s Basic Research Challenge program, the National Science Foundation, the Air Force Office of Scientific Research and Adobe Inc.
    Story Source:
    Materials provided by Rice University. Original written by Jade Boyd. Note: Content may be edited for style and length. More

  • in

    Researchers train computers to predict the next designer drugs

    UBC researchers have trained computers to predict the next designer drugs before they are even on the market, technology that could save lives.
    Law enforcement agencies are in a race to identify and regulate new versions of dangerous psychoactive drugs such as bath salts and synthetic opioids, even as clandestine chemists work to synthesize and distribute new molecules with the same psychoactive effects as classical drugs of abuse.
    Identifying these so-called “legal highs” within seized pills or powders can take months, during which time thousands of people may have already used a new designer drug.
    But new research is already helping law enforcement agencies around the world to cut identification time down from months to days, crucial in the race to identify and regulate new versions of dangerous psychoactive drugs.
    “The vast majority of these designer drugs have never been tested in humans and are completely unregulated. They are a major public health concern to emergency departments across the world,” says UBC medical student Dr. Michael Skinnider, who completed the research as a doctoral student at UBC’s Michael Smith Laboratories.
    A Minority Report for new designer drugs
    Dr. Skinnider and his colleagues used a database of known psychoactive substances contributed by forensic laboratories around the world to train an artificial intelligence algorithm on the structures of these drugs. The algorithm they used, known as a deep neural network, is inspired by the structure and function of the human brain. More

  • in

    Ultra-large single-crystal WS2 monolayer

    As silicon based semiconducting technology is approaching the limit of its performance, new materials that may replace or partially replace silicon in technology is highly desired. Recently, the emergence of graphene and other two-dimensional (2D) materials offers a new platform for building next generation semiconducting technology. Among them, transition metal dichalcogenides (TMDs), such as MoS2, WS2, MoSe2, WSe2, as most appealing 2D semiconductors.
    A prerequisite of building ultra-large-scale high-performance semiconducting circuits is that the base materials must be a single-crystal of wafer-scale, just like the silicon wafer used today. Although great efforts have been dedicated to the growth of wafer-scale single-crystals of TMDs, the success was very limited until now.
    Distinguished Professor Feng Ding and his research team from the Center for Multidimensional CarbonMaterials (CMCM), within the Institute for Basic Science (IBS) at UNIST, in cooperation with researcher at Peking University (PKU), Beijing Institute of Technology, and Fudan University, reported the direct growth of 2-inch single-crystal WS2 monolayer films very recently. Besides the WS2, the research team also demonstrated the growth of single-crystal MoS2, WSe2, and MoSe2 in wafer scale as well.
    The key technology of epitaxially grown a large sing-crystal is to ensure that all small single-crystal grown on a substrate are uniformly aligned. Because TMDs has non-centrosymmetric structure or the mirror image of a TMD with respect to an edge of it has opposite alignment, we must break such a symmetry by carefully design the substrate. Based on theoretical calculations, the authors proposed a mechanisms of “dual-coupling-guided epitaxy growth” for experimental design. The WS2-sapphireplane interaction as the first driving force, leading to two preferred antiparallel orientations of the WS2 islands. The coupling between WS2 and sapphire step-edge is the second driving force and it will break the degeneracy of the two antiparallel orientations. Then all the TMD single crystals grown on a substrate with step edges are all unidirectional aligned and finally, the coalescence of these small single-crystals leads to a large single-crystal of the same size of the substrate.
    “This new dual-coupling epitaxy growth mechanism is new for controllable materials growth. In principle, it allows us realize to grow all 2D materials into large-area single crystals if proper substrate was found.” Says Dr. Ting Cheng, the co-first author of the study. “We have considered how to choose proper substrates theoretically. First, the substrate should have a low symmetry and, secondly, more step edges are preferred.” emphasizes Professor Feng Ding, the corresponding author of the study.
    “This is a major step forward in the area of 2D materials based device. As the successful growth of wafer-scale single-crystal 2D TMDs on insulators beyond graphene and hBN on transition metal substrates, our study provide the required keystone of 2D semiconductors in high-end applications of electronic and optical devices,” explains professor Feng Ding.
    Story Source:
    Materials provided by Institute for Basic Science. Note: Content may be edited for style and length. More