Results 101 to 110 of about 3,671,128 (304)

Interaction of HS1BP3 with cortactin modulates TKS5 localisation, cell secretion and cancer malignancy

Molecular Oncology, EarlyView.
Here, we demonstrate that HS1BP3 interacts with Cortactin through a proline‐rich region (PRR3.1) and show that this interaction, and HS1BP3 itself, promote cancer cell proliferation and invasion. Inhibition of this interaction leads to build‐up of TKS5 in multivesicular endosomes and altered secretion of CD63 and CD9, providing an explanation for the ...
Arja Arnesen Løchen, Kristiane Søreng, Chiara Veroni, Laura Trachsel‐Moncho, Nagham Asp, Robin Gaupset, Lars Gustav Lyckander, Helene Knævelsrud, Lars Eftang, Anne Simonsen   +9 more
wiley   +1 more source

SAT-Based Optimization Framework for Electric Vehicle Charging Station Routing Under Real-World Constraints

World Electric Vehicle Journal
With the rapid adoption of electric vehicles (EVs), optimizing charging infrastructure and route planning has become increasingly crucial. Traditional methods such as Linear Programming (LP) have been widely used to address these challenges.
Shiva Sai Rama Krishna Ravipati, Srinivasa Rao Jalluri, Srikanth Kunta   +2 more
doaj   +1 more source

Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining

Molecular Oncology, EarlyView.
IGF‐1R promotes radioresistance by facilitating DNA‐PKcs recruitment to chromatin, enabling non‐homologous end‐joining (NHEJ) repair of double‐strand breaks. Inhibition or loss of IGF‐1R disrupts this recruitment to damage sites, driving compensatory reliance on microhomology‐mediated end‐joining (MMEJ) repair.
Matthew O. Ellis, Jack V. Mills, Wojciech Niedzwiedz, Valentine M. Macaulay   +3 more
wiley   +1 more source

Optimization of Boolean satisfiability solver by caching intermediate results

Труды Института системного программирования РАН, 2018
Recently, a number of dynamic analysis tools were developed that perform tainted data flow tracing and use algorithms for solving the CNF SAT problem for input data generation and path alteration.
S. Vartanov, D. Sidorov
doaj  

Explanations for SAT Solvers

, 2023
Les solveurs SAT sont devenus des outils largement utilisés pour résoudre des problèmes de décision ou d’optimisation combinatoires, dans le monde académique comme dans le monde économique. L’une des raisons de leur succès est de parcourir efficacement l’espace de recherche, que l’on peut représenter sous la forme d’un arbre.
openaire   +1 more source

Mycobacterial cell division arrest and smooth‐to‐rough envelope transition using CRISPRi‐mediated genetic repression systems

FEBS Open Bio, EarlyView.
CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point, Wafaa Achache, Janïs Laudouze, Eliana Sepulveda Ramos, Mickaël Maziero, Céline Crauste, Stéphane Canaan, Pierre Santucci   +7 more
wiley   +1 more source

Instance Assignment Coverage Feature for Operation Control of SAT Solver

International Journal of Computational Intelligence Systems
The Conflict-Driven Clause Learning (CDCL) framework integrates multiple heuristic components to solve Boolean satisfiability (SAT) problems through synergistic cooperation.
Zhihui Li, Shuwei Chen, Guanfeng Wu, Yang Xu   +3 more
doaj   +1 more source

Automatic method for searching impossible differentials and zero-correlation linear hulls of ARX block ciphers

网络与信息安全学报, 2017
Firstly,the differences and linear masks propagation equations of ARX ciphers were established.Secondly,the propagation equations were solved by SAT solver and judged valid or not.Finally,differences and linear masks were traversed to search impossible ...
Ya HAN
doaj   +1 more source

Heuristic Backtracking Algorithms for SAT

, 2003
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of formal verification, and also motivated the development of many new ...
Bhalla, A., Lynce, I., Marques-Silva, J., Sousa, J.   +3 more
core   +3 more sources

preSAT: SAT Solver Description

, 2008
This document briefly describes preSAT 1.0 , a new technique designed to efficiently solve structured CNF formulae.
Piette, Cédric, Hamadi, Youssef, Saïs, Lakhdar   +2 more
openaire   +1 more source