Results 51 to 60 of about 1,794,096 (279)

Calpain small subunit homodimerization is robust and calcium‐independent

open access: yesFEBS Letters, EarlyView.
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy   +4 more
wiley   +1 more source

Complexity vs Energy: Theory of Computation and Theoretical Physics [PDF]

open access: yes, 2013
This paper is a survey dedicated to the analogy between the notions of {\it complexity} in theoretical computer science and {\it energy} in physics. This analogy is not metaphorical: I describe three precise mathematical contexts, suggested recently, in ...
Manin, Yuri I.
core   +1 more source

Teaching computer programming: impact of Brown and Wilson's didactical principles

open access: yesFrontiers in Computer Science, 2023
This research studies the effects of the application of didactics to the teaching of computer programming, focusing on programming skills in the Python computer language.
Hector Belmar, Hector Belmar
doaj   +1 more source

A methionine‐lined active site governs carbocation stabilization and product specificity in a bacterial terpene synthase

open access: yesFEBS Letters, EarlyView.
This study reveals a unique active site enriched in methionine residues and demonstrates that these residues play a critical role by stabilizing carbocation intermediates through novel sulfur–cation interactions. Structure‐guided mutagenesis further revealed variants with significantly altered product profiles, enhancing pseudopterosin formation. These
Marion Ringel   +13 more
wiley   +1 more source

COMPUTER SCIENCE TEACHERS’ READINESS TO DEVELOP AND USE COMPUTER DIDACTIC GAMES IN EDUCATIONAL PROCESS

open access: yesІнформаційні технології і засоби навчання, 2020
The paper reports research on computer science teachers’ readiness to develop computer didactic games and implement them into the educational process. Today’s teacher of computer science has to acquire and improve professional competencies in line with ...
Роман Семенович Гуревич   +4 more
doaj   +1 more source

NAPC: A Neural Algorithm for Automated Passenger Counting in Public Transport on a Privacy-Friendly Dataset

open access: yesIEEE Open Journal of Intelligent Transportation Systems, 2022
Real-time load information in public transport is of high importance for both passengers and service providers. Neural algorithms have shown a high performance on various object counting tasks and play a continually growing methodological role in ...
Robert Seidel   +4 more
doaj   +1 more source

Crucial parameters for precise copy number variation detection in formalin‐fixed paraffin‐embedded solid cancer samples

open access: yesMolecular Oncology, EarlyView.
This study shows that copy number variations (CNVs) can be reliably detected in formalin‐fixed paraffin‐embedded (FFPE) solid cancer samples using ultra‐low‐pass whole‐genome sequencing, provided that key (pre)‐analytical parameters are optimized.
Hanne Goris   +10 more
wiley   +1 more source

New Trends in Quantum Computing

open access: yes, 1996
Classical and quantum information are very different. Together they can perform feats that neither could achieve alone, such as quantum computing, quantum cryptography and quantum teleportation.
Brassard, Gilles
core   +2 more sources

Fast learning without synaptic plasticity in spiking neural networks

open access: yesScientific Reports
Spiking neural networks are of high current interest, both from the perspective of modelling neural networks of the brain and for porting their fast learning capability and energy efficiency into neuromorphic hardware. But so far we have not been able to
Anand Subramoney   +4 more
doaj   +1 more source

SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS

open access: yesForum of Mathematics, Sigma, 2017
A celebrated result of Rödl and Ruciński states that for every graph $F$ , which is not a forest of stars and paths of length 3, and fixed number of colours
LUCA GUGELMANN   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy