A5048854124- semigroups and automata theory
- ATP Synthase and ATPases Research
- Photosynthetic Processes and Mechanisms
- Mitochondrial Function and Pathology
- Computability, Logic, AI Algorithms
- DNA and Biological Computing
- Algorithms and Data Compression
- Logic, programming, and type systems
- Advanced Algebra and Logic
- Mathematics, Computing, and Information Processing
- Angiogenesis and VEGF in Cancer
- Machine Learning and Algorithms
- Photoreceptor and optogenetics research
- Algal biology and biofuel production
- Natural Language Processing Techniques
- Cancer, Hypoxia, and Metabolism
- Formal Methods in Verification
- Parallel Computing and Optimization Techniques
- Monoclonal and Polyclonal Antibodies Research
- Ubiquitin and proteasome pathways
- Advanced Database Systems and Queries
- Coding theory and cryptography
- graph theory and CDMA systems
- Multimedia Communication and Technology
- Light effects on plants
University of Leeds
2014-2025
Eau de Paris (France)
2018
University of Nebraska–Lincoln
2015
Arizona State University
2011
Nuffield Health
2011
University of California, Berkeley
1986-2008
Glasgow Caledonian University
2004-2008
HUN-REN Szegedi Biológiai Kutatóközpont
2008
Institute of Biophysics
2008
West Virginia High Technology Consortium Foundation
2007
A model of protection mechanisms in computing systems is presented and its appropriateness argued. The “safety” problem for under this to determine a given situation whether subject can acquire particular right an object. In restricted cases, it be shown that decidable, i.e. there algorithm system configuration safe. general, surprisingly weak assumptions, cannot decided if Various implications fact are discussed.
Molecular recognition reagents are key tools for understanding biological processes and used universally by scientists to study protein expression, localisation interactions. Antibodies remain the most widely of such many show excellent performance, although some poorly characterised or have stability batch variability issues, supporting use alternative binding proteins as complementary applications. Here we report on Affimer research reagents. We selected 12 diverse molecular targets...
A new algorithm for recognizing and parsing arbitrary context-free languages is presented, several results are given on the computational complexity of these problems. The both practical theoretical interest. It conceptually simple allows a variety efficient implementations, which worked out in detail. Two versions run faster than cubic time. Surprisingly close connections between Cocke-Kasami-Younger Earley algorithms established reveal that two “almost” identical.
A number of operations which either preserve sets accepted by one-way stack automata or deterministic are presented. For example, sequential transduction preserves the former; set complementation, latter. Several solvability questions also considered.
The response of the photosynthetic apparatus in green alga Dunaliella salina, to irradiance stress was investigated. Cells were grown under physiological conditions at 500 millimoles per square meter second (control) and irradiance-stress 1700 incident intensity (high light, HL). In control cells, light-harvesting antenna photosystem I (PSI) contained 210 chlorophyll a/b molecules. It reduced 105 HL-grown cells. dominant form II (PSII) PSII(alpha)(about 63% total PSII) containing >250...
Compilation consists of two parts, recognition and translation. A mathematical model is presented which embodies salient features many modern compiling techniques. The model, called the stack automaton, has desirable feature being deterministic in nature. This device generalized to a nondeterministic (nondeterministic automaton) particular instances this more general are noted. Sets accepted by automata recursive. Each set linear bounded automaton some nonerasing automaton. context-sensitive...
Phaseic acid (PA) and dihydrophaseic (DPA) are the major metabolites observed when (S)-2-(14)C-abscisic (ABA) is fed to 14-day excised primary bean leaves (Phaseolus vulgaris L. cv. Red Kidney). The distribution of (14)C in which were wilted after feeding ABA appears be same as that unwilted leaves. A reduction relative specific radioactivities two wilting, compared with measured plants, indicated these continue formed endogenously wilting. Estimates endogenous levels showed they rose from...
Determining the relative execution frequency of program regions is essential for many important optimization techniques, including register allocation, function inlining, and instruction scheduling. Estimates derived from profiling with sample inputs are generally regarded as most accurate source this information; static (compile-time) estimates considered to be distinctly inferior. If were shown competitive, however, their convenience would outweigh minor gains profiling, they provide a...
A glnB gene is identified in the cyanobacterium Synechococcus sp. PCC 7942, and its product found to be covalently modified as a result of imbalance electron transfer photosynthesis, where photosystem II favored over I. The was cloned sequenced encode polypeptide 112 amino acid residues, whose sequence shows high degree similarity Escherichia coli regulatory protein, PII. In E. coli, PII involved signal transduction transcriptional post-translational regulation nitrogen assimilation....
A model of protection mechanisms in computing systems is presented and its appropriateness demonstrated. The "safety" problem for under our to determine a given situation whether subject can acquire particular right an object. In restricted cases, one show that this decidable, i.e., there algorithm system configuration safe. general, surprisingly weak assumptions, cannot decide if Various implications fact are discussed.
article Free AccessOn the Covering and Reduction Problems for Context-Free Grammars Authors: James N. Gray IBM Thomas J. Watson research Center, P.O. Box 218, Yorktown Heights, NY University of California, Berkeley, California CaliforniaView Profile , Michael A. Harrison Department Computer Science, Authors Info & Claims Journal ACMVolume 19Issue 4Oct. 1972 pp 675–698https://doi.org/10.1145/321724.321732Published:01 October 1972Publication History 60citation633DownloadsMetricsTotal...
Previous article Next On the Classification of Boolean Functions by General Linear and Affine GroupsMichael A. HarrisonMichael Harrisonhttps://doi.org/10.1137/0112026PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] E. Artin, Geometric algebra, Interscience Publishers, Inc., New York-London, 1957x+214 MR0082463 (18,553e) 0077.02101 Google Scholar[2] Robert L. Ashenhurst, The application counting techniques, Proceedings Association for Computing...
A parsing method for strict deterministic grammars is presented and a technique using it to parse any language indicated. An important characterization of the trees established. This used prove iteration theorems (strict) languages, hence proving that certain sets are not in these families becomes comparatively straightforward. It shown every grammar LR(0) equivalent bounded right context (1, 0) grammar. Thus rigorous proofs deterministic, LR ( k ), languages coextensive first time.