Filters








12,666 Hits in 7.9 sec

The complexity of general-valued CSPs seen from the other side [article]

Clement Carbonnel, Miguel Romero, Stanislav Zivny
2021 arXiv   pre-print
The general-valued constraint satisfaction problem (VCSP) is a generalisation of the CSP concerned with homomorphisms between two valued structures.  ...  For VCSPs with restricted left-hand side valued structures, we establish the precise borderline of polynomial-time solvability (subject to complexity-theoretic assumptions) and of solvability by the k-th  ...  In particular, one of the journal referees suggested a more concise way of presenting some of the results, which shortened the paper.  ... 
arXiv:1710.03148v3 fatcat:d3hjvmkpyffmxebvafydgtrvfq

The Complexity of General-Valued CSPs Seen from the Other Side

Clement Carbonnel, Miguel Romero, Stanislav Zivny
2018 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)  
The general-valued constraint satisfaction problem (VCSP) is a generalisation of the CSP concerned with homomorphisms between two valued structures.  ...  For VCSPs with restricted left-hand side valued structures, we establish the precise borderline of polynomial-time solvability (subject to complexity-theoretic assumptions) and of solvability by the k-th  ...  Appropriate notions of cores have played an important role in the complexity classifications of left-hand side restricted CSPs [27] , right-hand side restricted CSPs [9, 7, 44] , and right-hand side  ... 
doi:10.1109/focs.2018.00031 dblp:conf/focs/Carbonnel0Z18 fatcat:thbmrv7vgjhubawdkeg2fxwr54

Launching and controlling Gaussian beams from point sources via planar transformation media

Hayrettin Odabasi, Kamalesh Sainath, Fernando L. Teixeira
2018 Physical review B  
A CSP produces a Gaussian beam and, consequently, a point source placed at the center of such metamaterial slab produces a Gaussian beam propagating away from the slab.  ...  Based on operations prescribed under the paradigm of Complex Transformation Optics (CTO) [1-5], it was recently shown in [5] that a complex source point (CSP) can be mimicked by a parity-time (PT) transformation  ...  With the source is placed outside of the slab, the study in [6] has shown how fields on one side of the slab can be interpreted as generated from an 'image' CSP on the opposite side.  ... 
doi:10.1103/physrevb.97.075105 fatcat:nt3a6pdgmncq7owmhjqu7yjmfm

CSPAutoGen

Xiang Pan, Yinzhi Cao, Shuangping Liu, Yu Zhou, Yan Chen, Tingzhe Zhou
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
Although client-side adoption of CSP is successful, server-side adoption is far behind the client side: according to a large-scale survey, less than 0.002% of Alexa Top 1M websites enabled CSP.  ...  Specifically, CSPAutoGen trains so-called templates for each domain, generates CSPs based on the templates, rewrites incoming webpages on the fly to apply those generated CSPs, and then serves those rewritten  ...  Runtime-included inline scripts are generated from other scripts at client side. Those scripts are composed of two categories: asynchronous and synchronous.  ... 
doi:10.1145/2976749.2978384 dblp:conf/ccs/PanCLZCZ16 fatcat:bquqmtc7bnhkniqkrzopg3ipny

A Critical Assessment of the Performance of Protein−Ligand Scoring Functions Based on NMR Chemical Shift Perturbations

Bing Wang, Lance M. Westerhoff, Kenneth M. Merz
2007 Journal of Medicinal Chemistry  
All scoring functions were inspected by their abilities to highly rank the native-like structures and separate them from decoy poses generated for a protein-ligand complex.  ...  Because the chemical shift perturbation (CSP) is exquisitely sensitive on the orientation of ligand inside the binding pocket, NMRScore offers an accurate and straightforward approach to score different  ...  Charles Reynolds (Johnson and Johnson) for the Glide results, Dr. David Diller (Pharmacopeia, Inc.) for the LibDock results, Dr. Alex Clark (Chemical Computing Group) for the MOE results and Dr.  ... 
doi:10.1021/jm070484a pmid:17867664 pmcid:PMC2525740 fatcat:6cebshczbjcs7kpfzlqo35fcsu

A Constraint-Based Approach for Managing Declarative Temporal Business Process Models

Andrés Jiménez-Ramírez, Irene Barba, Carmelo Del Valle
2018 Information Systems Development  
Such support becomes even more complex in many real scenarios where the management of complex temporal relations between the process activities is crucial (i.e., the temporal perspective should be managed  ...  Nonetheless, in general, offering operational support (e.g., generating possible execution traces) to declarative business process models entails more complexity when compared to imperative modeling alternatives  ...  On the other hand, the CSP module is in charge of the complex tasks, i.e., checking the correctness of models, generating traces and checking the conformance of traces.  ... 
dblp:conf/isdevel/Jimenez-Ramirez18 fatcat:2do4xuwp25dwbfw5os453gvy5a

Modeling of Combined Lead Fast Reactor and Concentrating Solar Power Supercritical Carbon Dioxide Cycles to Demonstrate Feasibility, Efficiency Gains, and Cost Reductions

Brian T. White, Michael J. Wagner, Ty Neises, Cory Stansbury, Ben Lindley
2021 Sustainability  
The LFR/CSP coupling into one cycle is modeled to find the preferred location of the LFR heat exchanger, CSP heat exchanger, sCO2-to-salt heat exchanger (C2S), turbines, and recuperators within the supercritical  ...  Solar power has innate issues with weather, grid demand and time of day, which can be mitigated through use of thermal energy storage for concentrating solar power (CSP).  ...  The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results'.  ... 
doi:10.3390/su132212428 fatcat:5o6442sqtnhcpk5p4qvmfv6clm

Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems [article]

Florian Richoux
2010 arXiv   pre-print
The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are constructed.  ...  It has been proved that for each CSP problem over a given set of relations there exists a corresponding CSP problem over graphs of unary functions belonging to the same complexity class.  ...  When we speak about F H , we call the first column the left-hand side and the other columns F H r the right-hand side.  ... 
arXiv:1011.4744v1 fatcat:5ptx3rduizfplfin4keg34iypm

Design of N-substituted Peptomer Ligands for EVH1 Domains

Jürgen Zimmermann, Ronald Kühne, Rudolf Volkmer-Engert, Thomas Jarchau, Ulrich Walter, Hartmut Oschkinat, Linda J. Ball
2003 Journal of Biological Chemistry  
The K D values obtained from our NMR titrations correlated well with those obtained from Biacore measurements for each of the ligands studied.  ...  Not surprisingly, the more weakly binding ligands cause generally weaker CSPs. Fig. 5 shows the differences in CSPs in response to the addition of different ligands.  ...  Design of N-substituted Peptomer Ligands for EVH1 Domains  ... 
doi:10.1074/jbc.m305934200 pmid:12857736 fatcat:j7slupr7hrfzffoogqoc4squb4

Structural Determinants for Selective Recognition of a Lys48-Linked Polyubiquitin Chain by a UBA Domain

Ranjani Varadan, Michael Assfalg, Shahri Raasi, Cecile Pickart, David Fushman
2005 Molecular Cell  
Thus, the selectivity of UBA2 for Lys48-linked chiometry for the Ub 2 mutants, in contrast with a 2:1 Ub 2 over other linkages arises from the proper position-UBA2:Ub 2 complex seen previously with Lys  ...  This sisting of Ile8, Leu44, and Val70. Strong perturbations were also seen in Ile13 and Thr14 (located on the side behavior is indicative of a low off rate in the complex.  ... 
doi:10.1016/j.molcel.2005.05.013 pmid:15949443 fatcat:kx6clxdrzvdedic5cxvtoh4fqi

OCL as a Constraint Generation Language

Bastian Ulke, Friedrich Steimann
2013 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems  
The constraint generation process is sensitive of the activity's variability in that immutable parts are evaluated at constraint generation time, thus reducing the generated CSP's complexity.  ...  In this work, we present a set of transformation rules that allows for the direct use of OCL assertions as input for the generation of a Constraint Satisfaction Problem (CSP) representing a particular  ...  On the other hand, as we have seen [7] , constraint size and complexity is crucial to the solving time and thus to user acceptance.  ... 
dblp:conf/models/UlkeS13 fatcat:ogoledgp5bayjoav7glakdi7za

Mimicking the Nucleosomal Context in Peptide-Based Binders of a H3K36me Reader Increases Binding Affinity while Altering the Binding Mode

Velten Horn, Seino A. K. Jongkees, Hugo van Ingen
2020 Molecules  
for the binding mode, in particular for the challenging case of H3K36me3 readers.  ...  Moreover, reader proteins of trimethyllysine K36 on the histone H3 (H3K36me3) not only bind the methyllysine but also the nucleosomal DNA.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/molecules25214951 pmid:33114657 pmcid:PMC7662849 fatcat:5oardfmtpbhwvc3j2zwpvdks5a

A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs [chapter]

Tomoyuki Yamakami
2010 Lecture Notes in Computer Science  
For the remaining degree-2 problems, in contrast, they are as hard to approximate as Holant problems, which are a generalization of counting CSPs.  ...  We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number  ...  Since such problems can be seen as complex-valued functions taking Boolean variables, we need to address a technical issue of how to handle arbitrary complex numbers and those complex-valued functions  ... 
doi:10.1007/978-3-642-17458-2_24 fatcat:x2m3s2pylvaxxirslpcie6r6qy

Solution structure of the Hop TPR2A domain and investigation of target druggability by NMR, biochemical and in silico approaches

John F. Darby, Lewis R. Vidler, Peter J. Simpson, Bissan Al-Lazikani, Stephen J. Matthews, Swee Y. Sharp, Laurence H. Pearl, Swen Hoelder, Paul Workman
2020 Scientific Reports  
of the Hop TPR2A target, with relevance to other TPR domain interactors.  ...  Owing to the importance of Hop and other tetratricopeptide repeat (TPR)-containing cochaperones in regulating Hsp90 activity, the Hsp90-TPR domain interface is an alternative site for inhibitors, which  ...  This group of CSPs is seen as the dark orange region on the right side in Fig. 4c .  ... 
doi:10.1038/s41598-020-71969-w pmid:32994435 pmcid:PMC7524759 fatcat:35oby6ixsvfnbfpx5bvc4mktxe

Conformational Dynamics and the Binding of Specific and Nonspecific DNA by the Autoinhibited Transcription Factor Ets-1

Geneviève Desjardins, Mark Okon, Barbara J. Graves, Lawrence P. McIntosh
2016 Biochemistry  
However, relative to the pronounced NMR spectroscopic changes in Ets-1 resulting from specific DNA binding, the spectra of the nonspecific DNA complexes showed conformational exchange broadening and lacked  ...  Collectively, these data support a general model in which Ets-1 interacts with nonspecific DNA via dynamic electrostatic interactions, whereas hydrogen bonding drives the formation of well-ordered complexes  ...  In contrast, the side chain of Arg409 is relatively mobile in the ΔN301/ DNA SP12 complex.  ... 
doi:10.1021/acs.biochem.6b00460 pmid:27362745 pmcid:PMC5568661 fatcat:b25jdra54rds5k6wvhmsbki6wu
« Previous Showing results 1 — 15 out of 12,666 results