Listing 1 - 8 of 8 |
Sort by
|
Choose an application
Industrial psychology --- projects [artistic concepts] --- comic books --- bravery
Choose an application
Complex analysis --- Biomathematics. Biometry. Biostatistics --- Molecular biology --- Electrical engineering --- Computer science --- Programming --- Artificial intelligence. Robotics. Simulation. Graphics --- nanotechniek --- complexe analyse (wiskunde) --- bio-informatica --- informatica --- biometrie --- KI (kunstmatige intelligentie) --- robots --- moleculaire biologie
Choose an application
The 14th international meeting on DNA computation took place in the Czech Republic in Prague, June 2-9, 2008. During the last 14 years the DNA C- puting meetings have been the key forum at the boundary between computer science, biochemistry and nanotechnology where the most recent results have been presented and their authors have met. Their scienti?c program includes mathematical foundations and theoretical study of DNA computing - or b- computing in general- and recent experimental results in DNA nanotechnology, nanoscience and nanocomputing. It continues to be one of the most exciting interdisciplinary meetings, as exempli?ed by the diverse nature of contributions in this volume. The meeting began with tutorial talks by Friedrich Simmel (Molecular - ology for Computer Scientists ), Nadrian Seeman (Structural DNA Nanote- nology ), and Yasubumi Sakakibara (Formal Grammars for DNA Compu- tion and Bioinformatics ). During the meeting, a number of excellent keynote speakers gave an up-to-date overview of di?erent aspects of DNA computing and biochemical information processing. Luca Cardelli talked about Molecules as Automata, while Niles Pierce gave an exciting talk entitled Molecular Choreography ProgrammingNucleicAcidSelf-AssemblyandDisassemblyPa- ways. Inamorebiologicaltalk,LauraLandweberdiscussedRNA-Guided,E- geneticProgrammingandRe-programmingofGenomicInformationinCiliates, and Ming Li gave an overview of Modern Homology Search. The meeting was concluded by a Nanoday with beautiful presentations by Christof Niemeyer, Kurt Gothelf, Andrew Ellington and David Pine.
Complex analysis --- Biomathematics. Biometry. Biostatistics --- Molecular biology --- Electrical engineering --- Computer science --- Programming --- Artificial intelligence. Robotics. Simulation. Graphics --- nanotechniek --- complexe analyse (wiskunde) --- bio-informatica --- informatica --- biometrie --- KI (kunstmatige intelligentie) --- robots --- moleculaire biologie
Choose an application
This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. The 20 revised full papers of the APPROX 2008 workshop were carefully reviewed and selected from 42 submissions and focus on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM 2008 is concerned with applications of randomness to computational and combinatorial problems and accounts for 27 revised full papers, also diligently reviewed and selected out of 52 workshop submissions.
Computer science --- Computer algorithms --- Statistical methods --- Computer science. --- Computer programming. --- Computers. --- Algorithms. --- Numerical analysis. --- Computer Science. --- Programming Techniques. --- Theory of Computation. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Numeric Computing. --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Mathematical analysis --- Algorism --- Algebra --- Arithmetic --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Informatics --- Science --- Mathematics. --- Mathematics --- Foundations --- Programming --- Information theory. --- Computer software. --- Computational complexity. --- Electronic data processing. --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Office practice --- Complexity, Computational --- Software, Computer --- Communication theory --- Communication --- Automation --- Computer science—Mathematics. --- Computational complexity --- Combinatorial optimization --- Discrete mathematics. --- Numerical Analysis. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis
Choose an application
Molecular computers --- Computer Science --- Biology - General --- Biology --- Engineering & Applied Sciences --- Health & Biological Sciences --- Data processing --- Computer science. --- Computers. --- Algorithms. --- Artificial intelligence. --- Bioinformatics. --- Nanotechnology. --- Computer Science. --- Computational Biology/Bioinformatics. --- Algorithm Analysis and Problem Complexity. --- Computation by Abstract Devices. --- Artificial Intelligence (incl. Robotics). --- Bio-informatics --- Biological informatics --- Information science --- Computational biology --- Systems biology --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Algorism --- Algebra --- Arithmetic --- Molecular technology --- Nanoscale technology --- High technology --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Calculators --- Cyberspace --- Informatics --- Science --- Foundations --- Life sciences --- Biomass --- Life (Biology) --- Natural history --- Computer software. --- Artificial Intelligence. --- Software, Computer --- Computational and Systems Biology. --- Theory of Computation.
Choose an application
SARS-CoV-2 has had a greater burden, as measured by rate of infection, in poorer communities within cities. For example, 55% of Mumbai slums residents had antibodies to COVID-19, 3.2 times the seroprevalence in non-slum areas of the city according to a sero-survey done in July 2020. One explanation is that government suppression was less severe in poorer communities, either because the poor were more likely to be exempt or unable to comply. Another explanation is that effective suppression itself accelerated the epidemic in poor neighborhoods because households are more crowded and residents share toilet and water facilities. We show there is little evidence for the first hypothesis in the context of Mumbai. Using location data from smart phones, we find that slum residents had nominally but not significantly (economically or statistically) higher mobility than non-slums prior to the sero-survey. We also find little evidence that mobility in non-slums was lower than in slums during lockdown, a subset of the period before the survey.
Choose an application
This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. The 20 revised full papers of the APPROX 2008 workshop were carefully reviewed and selected from 42 submissions and focus on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM 2008 is concerned with applications of randomness to computational and combinatorial problems and accounts for 27 revised full papers, also diligently reviewed and selected out of 52 workshop submissions.
Complex analysis --- Discrete mathematics --- Computer science --- Computer. Automation --- discrete wiskunde --- complexe analyse (wiskunde) --- informatica --- numerieke analyse
Choose an application
Complex analysis --- Discrete mathematics --- Computer science --- Computer. Automation --- discrete wiskunde --- complexe analyse (wiskunde) --- informatica --- numerieke analyse
Listing 1 - 8 of 8 |
Sort by
|