Relevant bibliographies by topics / CSPs

Academic literature on the topic 'CSPs'

Author: Grafiati
Published: 4 June 2021
Last updated: 20 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'CSPs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "CSPs"

1

Chen, Jia-Yun, Xin-Yuan Sun, and Jian-Ming Ouyang. "Modulation of Calcium Oxalate Crystal Growth and Protection from Oxidatively Damaged Renal Epithelial Cells of Corn Silk Polysaccharides with Different Molecular Weights." Oxidative Medicine and Cellular Longevity 2020 (January 22, 2020): 1–19. http://dx.doi.org/10.1155/2020/6982948.

Full text
Abstract:
Corn silk polysaccharide (CSP0; molecular weight=124 kDa) was degraded by ultrasonication to obtain five degraded polysaccharides, namely, CSP1, CSP2, CSP3, CSP4, and CSP5, with molecular weights of 26.1, 12.2, 6.0, 3.5, and 2.0 kDa, respectively. The structures of these polysaccharides were characterized by FT-IR, 1H NMR, and 13C NMR analyses. The antioxidant activities, including scavenging ability for hydroxyl radicals and DPPH free radicals, chelation ability for Fe2+ ions, and reducing ability of CSP increased with decreased molecular weight of CSPs within 6.0 to 124 kDa. However, antioxidant activity weakened when the molecular weight of CSPs reached 3.5 and 2 kDa. CSP3 with a molecular weight of 6.0 kDa exhibited the strongest antioxidant activity. After protection with 60 μg/mL CSPs, the viability of human renal proximal tubular epithelial cells (HK-2) damaged by nano-COM crystals increased, the level of reactive oxygen species decreased, and the amount of COM crystal adhered onto the cell surface decreased. The ability of CSPs to protect cells from CaOx crystal damage was consistent with their antioxidant activity. CSPs can specifically combine with CaOx crystal to inhibit the conversion of calcium oxalate dihydrate crystal to calcium oxalate monohydrate crystal. All these results showed that the activity of CSPs was closely correlated with molecular weight. A very high or low molecular weight of CSPs was not conducive to their activity. CSPs, especially CSP3 with a molecular weight of 6.0 kDa, can be used as a potential antistone drug.
APA, Harvard, Vancouver, ISO, and other styles
2

Wemekamp-Kamphuis, Henrike H., Andreas K. Karatzas, Jeroen A. Wouters, and Tjakko Abee. "Enhanced Levels of Cold Shock Proteins in Listeria monocytogenes LO28 upon Exposure to Low Temperature and High Hydrostatic Pressure." Applied and Environmental Microbiology 68, no. 2 (February 2002): 456–63. http://dx.doi.org/10.1128/aem.68.2.456-463.2002.

Full text
Abstract:
ABSTRACT Listeria monocytogenes is a psychrotrophic food-borne pathogen that is problematic for the food industry because of its ubiquitous distribution in nature and its ability to grow at low temperatures and in the presence of high salt concentrations. Here we demonstrate that the process of adaptation to low temperature after cold shock includes elevated levels of cold shock proteins (CSPs) and that the levels of CSPs are also elevated after treatment with high hydrostatic pressure (HHP). Two-dimensional gel electrophoresis combined with Western blotting performed with anti-CspB of Bacillus subtilis was used to identify four 7-kDa proteins, designated Csp1, Csp2, Csp3, and Csp4. In addition, Southern blotting revealed four chromosomal DNA fragments that reacted with a csp probe, which also indicated that a CSP family is present in L. monocytogenes LO28. After a cold shock in which the temperature was decreased from 37�C to 10�C the levels of Csp1 and Csp3 increased 10- and 3.5-fold, respectively, but the levels of Csp2 and Csp4 were not elevated. Pressurization of L. monocytogenes LO28 cells resulted in 3.5- and 2-fold increases in the levels of Csp1 and Csp2, respectively. Strikingly, the level of survival after pressurization of cold-shocked cells was 100-fold higher than that of cells growing exponentially at 37�C. These findings imply that cold-shocked cells are protected from HHP treatment, which may affect the efficiency of combined preservation techniques.
APA, Harvard, Vancouver, ISO, and other styles
3

Ma, Chao, Yang Yue, Yan Zhang, Zhen-Ya Tian, Hong-Song Chen, Jian-Ying Guo, and Zhong-Shi Zhou. "Scanning Electron Microscopic Analysis of Antennal Sensilla and Tissue-Expression Profiles of Chemosensory Protein Genes in Ophraella communa (Coleoptera: Chrysomelidae)." Insects 13, no. 2 (February 9, 2022): 183. http://dx.doi.org/10.3390/insects13020183.

Full text
Abstract:
Ophraella communa is an efficient biocontrol agent used against the invasive weed Ambrosia artemisiifolia. It is an herbivorous insect that feeds on specific plants; the olfactory functions of this insects plays an important role in their search for host plants. There are no reports on O. communa sensilla types, morphology, or chemosensory protein (CSP) genes. In this study, we observed the external structure and distribution of antennal sensilla in adult O. communa antennae by scanning electron microscopy; moreover, we cloned 11 CSPs (CSP1–CSP11) and elucidated their tissue-expression profiles using quantitative real-time polymerase chain reaction. Six types of sensilla were identified: sensilla trichodea (including two subtypes), sensilla chaetica, sensilla basiconica (including two subtypes), sensilla styloconica, sensilla coeloconica, and Böhm bristles. Both male and female antennae had all six types of sensilla, and no sexual dimorphism was noted in sensillar types or distribution. We also found that the expression levels of CSP2, CSP3, CSP4, CSP6, and CSP7 in male and female antennae were higher than those in other tissues, which suggests that these five CSPs may be related to olfactory function in O. communa. Ultimately, our results lay the foundation for interpreting the olfactory functions of adult O. communa.
APA, Harvard, Vancouver, ISO, and other styles
4

Stübs, Dorothee, Thilo M. Fuchs, Boris Schneider, Armin Bosserhoff, and Roy Gross. "Identification and regulation of cold-inducible factors of Bordetella bronchiseptica." Microbiology 151, no. 6 (June 1, 2005): 1895–909. http://dx.doi.org/10.1099/mic.0.27785-0.

Full text
Abstract:
The expression of bacterial cold-shock proteins (CSPs) is highly induced in response to cold shock, and some CSPs are essential for cells to resume growth at low temperature. Bordetella bronchiseptica encodes five CSPs (named CspA to CspE) with significant amino acid homology to CspA of Escherichia coli. In contrast to E. coli, the insertional knock-out of a single csp gene (cspB) strongly affected growth of B. bronchiseptica independent of temperature. In the case of three of the csp genes (cspA, cspB, cspC) more than one specific transcript could be detected. The net amount of cspA, cspB and cspC transcripts increased strongly after cold shock, while no such effect could be observed for cspD and cspE. The exposure to other stress conditions, including translation inhibitors, heat shock, osmotic stress and nutrient deprivation in the stationary phase, indicated that the csp genes are also responsive to these conditions. The coding regions of all of the cold-shock genes are preceded by a long non-translated upstream region (5′-UTR). In the case of the cspB gene, a deletion of parts of this region led to a significant reduction of translation of the resulting truncated transcript, indicating a role of the 5′-UTR in translational control. The cold-shock stimulon was investigated by 2D-PAGE and mass spectrometric characterization, leading to the identification of additional cold-inducible proteins (CIPs). Interestingly, two cold-shock genes (cspC and cspD) were found to be under the negative control of the BvgAS system, the main transcriptional regulator of Bordetella virulence genes. Moreover, a negative effect of slight overexpression of CspB, but not of the other CSPs, on the transcription of the adenylate cyclase toxin CyaA of Bordetella pertussis was observed, suggesting cross-talk between the CSP-mediated stress response stimulon and the Bordetella virulence regulon.
APA, Harvard, Vancouver, ISO, and other styles
5

Wouters, Jeroen A., Marielle Mailhes, Frank M. Rombouts, Willem M. de Vos, Oscar P. Kuipers, and Tjakko Abee. "Physiological and Regulatory Effects of Controlled Overproduction of Five Cold Shock Proteins of Lactococcus lactisMG1363." Applied and Environmental Microbiology 66, no. 9 (September 1, 2000): 3756–63. http://dx.doi.org/10.1128/aem.66.9.3756-3763.2000.

Full text
Abstract:
ABSTRACT The physiological and regulatory effects of overproduction of five cold shock proteins (CSPs) of Lactococcus lactis were studied. CspB, CspD, and CspE could be overproduced at high levels (up to 19% of the total protein), whereas for CspA and CspC limited overproduction (0.3 to 0.5% of the total protein) was obtained. Northern blot analysis revealed low abundance of the cspCtranscript, indicating that the stability of cspC mRNA is low. The limited overproduction of CspA is likely to be caused by low stability of CspA since when there was an Arg-Pro mutation at position 58, the level of CspA production increased. Using two-dimensional gel electrophoresis, it was found that upon overproduction of the CSPs several proteins, including a number of cold-induced proteins ofL. lactis, were induced. Strikingly, upon overproduction of CspC induction of CspB, putative CspF, and putative CspG was also observed. Overproduction of CspB and overproduction of CspE result in increased survival when L. lactis is frozen (maximum increases, 10- and 5-fold, respectively, after 4 freeze-thaw cycles). It is concluded that in L. lactis CSPs play a regulatory role in the cascade of events that are initiated by cold shock treatment and that they either have a direct protective effect during freezing (e.g., RNA stabilization) or induce other factors involved in the freeze-adaptive response or both.
APA, Harvard, Vancouver, ISO, and other styles
6

Xu, Hongfei, Kunpeng Yan, Yaping Ding, Yuntong Lv, Jianyi Li, Fengting Yang, Xuewei Chen, Xiwu Gao, Yiou Pan, and Qingli Shang. "Chemosensory Proteins Are Associated with Thiamethoxam and Spirotetramat Tolerance in Aphis gossypii Glover." International Journal of Molecular Sciences 23, no. 4 (February 21, 2022): 2356. http://dx.doi.org/10.3390/ijms23042356.

Full text
Abstract:
Chemosensory proteins (CSPs) are a class of transporters in arthropods. Deeper research on CSPs showed that CSPs may be involved in some physiological processes beyond chemoreception, such as insect resistance to pesticides. We identified two upregulated CSPs in two resistant strains of Aphis gossypii Glover. To understand their role in the resistance of aphids to pesticides, we performed the functional verification of CSP1 and CSP4 in vivo and in vitro. Results showed that the sensitivity of the thiamethoxam-resistant strain to thiamethoxam increased significantly with the silencing of CSP1 and CSP4 by RNAi (RNA interference), and the sensitivity of the spirotetramat-resistant strain to spirotetramat increased significantly with the silencing of CSP4. Transgenic Drosophila melanogaster expressing CSPs exhibited stronger resistance to thiamethoxam, spirotetramat, and alpha-cypermethrin than the control did. In the bioassay of transgenic Drosophila, CSPs showed different tolerance mechanisms for different pesticides, and the overexpressed CSPs may play a role in processes other than resistance to pesticides. In brief, the present results prove that CSPs are related to the resistance of cotton aphids to insecticides.
APA, Harvard, Vancouver, ISO, and other styles
7

Weber, Michael H. W., Arsen V. Volkov, Ingo Fricke, Mohamed A. Marahiel, and Peter L. Graumann. "Localization of Cold Shock Proteins to Cytosolic Spaces Surrounding Nucleoids in Bacillus subtilis Depends on Active Transcription." Journal of Bacteriology 183, no. 21 (November 1, 2001): 6435–43. http://dx.doi.org/10.1128/jb.183.21.6435-6443.2001.

Full text
Abstract:
ABSTRACT Using immunofluorescence microscopy and a fusion of a cold shock protein (CSP), CspB, to green fluorescent protein (GFP), we showed that in growing cells Bacillus subtilis CSPs specifically localize to cytosolic regions surrounding the nucleoid. The subcellular localization of CSPs is influenced by the structure of the nucleoid. Decondensed chromosomes in smc mutant cells reduced the sizes of the regions in which CSPs localized, while cold shock-induced chromosome compaction was accompanied by an expansion of the space in which CSPs were present. As a control, histone-like protein HBsu localized to the nucleoids, while β-galactosidase and GFP were detectable throughout the cell. After inhibition of translation, CspB-GFP was still present around the nucleoids in a manner similar to that in cold-shocked cells. However, in stationary-phase cells and after inhibition of transcription, CspB was distributed throughout the cell, indicating that specific localization of CspB depends on active transcription and is not due to simple exclusion from the nucleoid. Furthermore, we observed that nucleoids are more condensed and frequently abnormal incspB cspC and cspB cspDdouble-mutant cells. This suggests that the function of CSPs affects chromosome structure, probably through coupling of transcription to translation, which is thought to decondense nucleoids. In addition, we found that cspB cspD and cspB cspC double mutants are defective in sporulation, with a block at or before stage 0. Interestingly, CspB and CspC are depleted from the forespore compartment but not from the mother cell. In toto, our findings suggest that CSPs localize to zones of newly synthesized RNA, coupling transcription with initiation of translation.
APA, Harvard, Vancouver, ISO, and other styles
8

LIMTHAMMAHISORN, SUTTINEE, YOLANDA J. BRADY, and COVADONGA R. ARIAS. "Gene Expression of Cold Shock and Other Stress-Related Genes in Vibrio vulniflcus Grown in Pure Culture under Shellstock Temperature Control Conditions." Journal of Food Protection 71, no. 1 (January 1, 2008): 157–64. http://dx.doi.org/10.4315/0362-028x-71.1.157.

Full text
Abstract:
Shellstock refrigeration after harvesting is recommended to prevent further increases in Vibrio vulniflcus numbers in oysters, but it could potentially induce a cold shock response in this bacterium. V. vulniflcus was incubated at 35, 25, 20, and 15°C and then subjected to 7.2 and 4°C for 1 week. A cold-adaptation response that enhanced cell culturability was observed when cells were incubated at 15°C prior to cold shock at 7.2°C. In vitro cold shock gene expression was analyzed by reverse transcriptase PCR (RT-PCR). The expression of cold shock genes csp1 and csp5 (homologous genes to cspA and cspV) remained constant, despite cold shock. However, the transcript of csp3 was constitutively expressed before and after cold shock, with a few exceptions. The synthesis of csp3 mRNA in V. vulniflcus C7184Tr (an avirulent strain) was induced only after 15°C incubation and cold shock at 4°C. The expression of csp4 was repressed after cold shock. Our data showed that the csps tested in this study are not cold inducible. The transcripts of two oxidative stress-related genes, oxyR and katG, showed different induction patterns among strains after cold shock, suggesting that V. vulniflcus cells encountered oxidative stress during cold shock.
APA, Harvard, Vancouver, ISO, and other styles
9

Mazzon, Ricardo R., Elza A. S. Lang, Carolina A. P. T. Silva, and Marilis V. Marques. "Cold Shock GenescspAandcspBfrom Caulobacter crescentus Are Posttranscriptionally Regulated and Important for Cold Adaptation." Journal of Bacteriology 194, no. 23 (September 21, 2012): 6507–17. http://dx.doi.org/10.1128/jb.01422-12.

Full text
Abstract:
ABSTRACTCold shock proteins (CSPs) are nucleic acid binding chaperones, first described as being induced to solve the problem of mRNA stabilization after temperature downshift.Caulobacter crescentushas four CSPs: CspA and CspB, which are cold induced, and CspC and CspD, which are induced only in stationary phase. In this work we have determined that the synthesis of both CspA and CspB reaches the maximum levels early in the acclimation phase. The deletion ofcspAcauses a decrease in growth at low temperature, whereas the strain with a deletion ofcspBhas a very subtle and transient cold-related growth phenotype. ThecspA cspBdouble mutant has a slightly more severe phenotype than that of thecspAmutant, suggesting that although CspA may be more important to cold adaptation than CspB, both proteins have a role in this process. Gene expression analyses were carried out usingcspAandcspBregulatory fusions to thelacZreporter gene and showed that both genes are regulated at the transcriptional and posttranscriptional levels. Deletion mapping of the long 5′-untranslated region (5′-UTR) of each gene identified a common region important for cold induction, probably via translation enhancement. In contrast to what was reported for other bacteria, these cold shock genes have no regulatory regions downstream from ATG that are important for cold induction. This work shows that the importance of CspA and CspB toC. crescentuscold adaptation, mechanisms of regulation, and pattern of expression during the acclimation phase apparently differs in many aspects from what has been described so far for other bacteria.
APA, Harvard, Vancouver, ISO, and other styles
10

Schmid, Barbara, Jochen Klumpp, Eveline Raimann, Martin J. Loessner, Roger Stephan, and Taurai Tasara. "Role of Cold Shock Proteins in Growth of Listeria monocytogenes under Cold and Osmotic Stress Conditions." Applied and Environmental Microbiology 75, no. 6 (January 16, 2009): 1621–27. http://dx.doi.org/10.1128/aem.02154-08.

Full text
Abstract:
ABSTRACT The gram-positive bacterium Listeria monocytogenes is a food-borne pathogen of both public health and food safety significance. It possesses three small, highly homologous protein members of the cold shock protein (Csp) family. We used gene expression analysis and a set of mutants with single, double, and triple deletions of the csp genes to evaluate the roles of CspA, CspB, and CspD in the cold and osmotic (NaCl) stress adaptation responses of L. monocytogenes. All three Csps are dispensable for growth at optimal temperature (37°C). These proteins are, however, required for efficient cold and osmotic stress tolerance of this bacterium. The hierarchies of their functional importance differ, depending on the environmental stress conditions: CspA>CspD>CspB in response to cold stress versus CspD>CspA/CspB in response to NaCl salt osmotic stress. The fact that Csps are promoting L. monocytogenes adaptation against both cold and NaCl stress has significant implications in view of practical food microbial control measures. The combined or sequential exposure of L. monocytogenes cells to these two stresses in food environments might inadvertently induce cross-protection responses.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "CSPs"

1

Nguyen, Van-Hau. "SAT Encodings of Finite CSPs." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-162186.

Full text
Abstract:
Boolean satisfiability (SAT) is the problem of determining whether there exists an assignment of the Boolean variables to the truth values such that a given Boolean formula evaluates to true. SAT was the first example of an NP-complete problem. Only two decades ago SAT was mainly considered as of a theoretical interest. Nowadays, the picture is very different. SAT solving becomes mature and is a successful approach for tackling a large number of applications, ranging from artificial intelligence to industrial hardware design and verification. SAT solving consists of encodings and solvers. In order to benefit from the tremendous advances in the development of solvers, one must first encode the original problems into SAT instances. These encodings should not only be easily generated, but should also be efficiently processed by SAT solvers. Furthermore, an increasing number of practical applications in computer science can be expressed as constraint satisfaction problems (CSPs). However, encoding a CSP to SAT is currently regarded as more of an art than a science, and choosing an appropriate encoding is considered as important as choosing an algorithm. Moreover, it is much easier and more efficient to benefit from highly optimized state-of-the-art SAT solvers than to develop specialized tools from scratch. Hence, finding appropriate SAT encodings of CSPs is one of the most fascinating challenges for solving problems by SAT. This thesis studies SAT encodings of CSPs and aims at: 1) conducting a comprehensively profound study of SAT encodings of CSPs by separately investigating encodings of CSP domains and constraints; 2) proposing new SAT encodings of CSP domains; 3) proposing new SAT encoding of the at-most-one constraint, which is essential for encoding CSP variables; 4) introducing the redundant encoding and the hybrid encoding that aim to benefit from both two efficient and common SAT encodings (i.e., the sparse and order encodings) by using the channeling constraint (a term used in Constraint Programming) for SAT; and 5) revealing interesting guidelines on how to choose an appropriate SAT encoding in the way that one can exploit the availability of many efficient SAT solvers to solve CSPs efficiently and effectively. Experiments show that the proposed encodings and guidelines improve the state-of-the-art SAT encodings of CSPs.
APA, Harvard, Vancouver, ISO, and other styles
2

Katsirelos, George. "A framework for experiments in CSPs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/MQ62966.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Giovanelli, Francesco. "Model Agnostic solution of CSPs with Deep Learning." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/18633/.

Full text
Abstract:
Negli ultimi anni, le tecniche di Deep Learning sono state notevolmente migliorate, permettendo di affrontare con successo numerosi problemi. Il Deep Learning ha un approccio sub-simbolico ai problemi, perciò non si rende necessario descrivere esplicitamente informazioni sulla struttura del problema per fare sì che questo possa essere affrontato con successo; l'idea è quindi di utilizzare reti neurali di Deep Learning per affrontare problemi con vincoli (CSPs), senza dover fare affidamento su conoscenza esplicita riguardo ai vincoli dei problemi. Chiamiamo questo approccio Model Agnostic; esso può rivelarsi molto utile se usato sui CSP, dal momento che è spesso difficile esprimerne tutti i dettagli: potrebbero esistere vincoli, o preferenze, che non sono menzionati esplicitamente, e che sono intuibili solamente dall'analisi di soluzioni precedenti del problema. In questi casi, un modello di Deep Learning in grado di apprendere la struttura del CSP potrebbe avere applicazioni pratiche rilevanti. In particolar modo, in questa tesi si è indagato sul fatto che una Deep Neural Network possa essere capace di risolvere il rompicapo delle 8 regine. Sono state create due diverse reti neurali, una rete Generatore e una rete Discriminatore, che hanno dovuto apprendere differenti caratteristiche del problema. La rete Generatore è stata addestrata per produrre un singolo assegnamento, in modo che questo sia globalmente consistente; la rete Discriminatore è stata invece addestrata a distinguere tra soluzioni ammissibili e non ammissibili, con l'idea che possa essere utilizzata come controllore dell'euristica. Infine, sono state combinate le due reti in un unico modello, chiamato Generative Adversarial Network (GAN), in modo che esse possano scambiarsi conoscenza riguardo al problema, con l'obiettivo di migliorare le prestazioni di entrambe.
APA, Harvard, Vancouver, ISO, and other styles
4

Kuivinen, Fredrik. "Algorithms and Hardness Results for Some Valued CSPs." Doctoral thesis, Linköpings universitet, TCSLAB - Laboratoriet för teoretisk datalogi, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-51687.

Full text
Abstract:
In the Constraint Satisfaction Problem (CSP) one is supposed to find an assignment to a set of variables so that a set of given constraints are satisfied. Many problems, both practical and theoretical, can be modelled as CSPs. As these problems are computationally hard it is interesting to investigate what kind of restrictions of the problems implies computational tractability. In this thesis the computational complexity of restrictions of two optimisation problems which are related to the CSP is studied. In optimisation problems one can also relax the requirements and ask for an approximatively good solution, instead of requiring the optimal one. The first problem we investigate is Maximum Solution (Max Sol) where one is looking for a solution which satisfies all constraints and also maximises a linear bjective function. The Maximum Solution problem is a generalisation of the well-known integer linear programming problem. In the case when the constraints are equations over an abelian group we obtain tight inapproximability results. We also study Max Sol for so-called maximal constraint languages and a partial classification theorem is obtained in this case. Finally, Max Sol over the boolean domain is studied in a setting where each variable only occurs a bounded number of times. The second problem is the Maximum Constraint Satisfaction Problem (Max CSP). In this problem one is looking for an assignment which maximises the number of satisfied constraints. We first show that if the constraints are known to give rise to an NP-hard CSP, then one cannot get arbitrarily good approximate solutions in polynomial time, unless P = NP. We use this result to show a similar hardness result for the case when only one constraint relation is used. We also study the submodular function minimisation problem (SFM) on certain finite lattices. There is a strong link between Max CSP and SFM; new tractability results for SFM implies new tractability results for Max CSP. It is conjectured that SFM is the only reason for Max CSP to be tractable, but no one has yet managed to prove this. We obtain new tractability results for SFM on diamonds and evidence which supports the hypothesis that all modular lattices are tractable.
I ett villkorsprogrammeringsproblem är uppgiften att tilldela värden till variabler så att en given mängd villkor blir uppfyllda. Många praktiska problem, så som schemaläggning och planering, kan formuleras som villkorsprogrammeringsproblem och det är därför önskvärt att ha effektiva algoritmer för att hitta lösningar till denna typ av problem. De generella varianterna av dessa problem är NP-svåra att lösa. Detta innebär att det antagligen inte finns effektiva algoritmer för problemen (om inte P = NP vilket anses vara mycket osannolikt). Av denna anledning förenklar vi problemet genom att studera restriktioner av det och ibland nöjer vi oss med approximativa lösningar. I den här avhandlingen studeras två varianter av villkorsprogrammeringsproblemet där man inte bara ska hitta en lösning utan hitta en så bra lösning som möjligt. I den första varianten är målet att hitta en tilldelning där samtliga villkor uppfylls och att en viktad summa av variablerna maximeras. Detta problem kan ses som en generalisering av det välkända linjära heltalsprogrammeringsproblemet. I den andra varianten är målet att hitta en tilldelning som uppfyller så många villkor som möjligt. Då det gäller den första varianten, då man ska hitta en lösning som uppfyller samtliga villkor som också maximerar summan av variablerna, presenteras nya resultat för ett antal specialfall. De så kallade maximala villkorsmängderna studeras och komplexiteten för ett antal av dessa bestäms. Vi studerar också en variant av problemet över den Boolska domänen då antal variabelförekomster är begränsat. I detta fall ger vi en partiell klassifikation över vilka villkorsmängder som är hanterbara och vilka som inte kan lösas effektivt. För den andra varianten, då man ska uppfylla så många villkor som möjligt, presenteras några nya effektiva algoritmer för vissa restriktioner. I dessa algoritmer löses det mer generella problemet av minimering av submodulära funktioner över vissa ändliga latticar. Vi bevisar också ett resultat som beskriver exakt när det finns effektiva algoritmer då man endast har tillgång till en typ av villkor.
APA, Harvard, Vancouver, ISO, and other styles
5

Eriksson, Leif. "Solving Temporal CSPs via Enumeration and SAT Compilation." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-162482.

Full text
Abstract:
The constraint satisfaction problem (CSP) is a powerful framework used in theoretical computer science for formulating a  multitude of problems. The CSP over a constraint language Γ (CSP(Γ)) is the decision problem of verifying whether a set of constraints based on the relations in Γ admits a satisfying assignment or not. Temporal CSPs are a special subclass of CSPs frequently encountered in AI. Here, the relations are first-order definable in the structure (Q;<), i.e the rationals with the usual order. These problems have previously often been solved by either enumeration or SAT compilation. We study a restriction of temporal CSPs where the constraint language is limited to logical disjunctions of <-, =-, ≠- and ≤-relations, and were each constraint contains at most k such basic relations (CSP({<,=,≠,≤}∨k)).   Every temporal CSP with a finite constraint language Γ is polynomial-time reducible to CSP({<,=,≠,≤}∨k) where k is only dependent on Γ. As this reduction does not increase the number of variables, the time complexity of CSP(Γ) is never worse than that of CSP({<,=,≠,≤}∨k). This makes the complexity of CSP({<,=,≠,≤}∨k) interesting to study.   We develop algorithms combining enumeration and SAT compilation to solve CSP({<,=,≠,≤}∨k), and study the asymptotic behaviour of these algorithms for different classes. Our results show that all finite constraint languages Γ first order definable over (Q;<) are solvable in O*(((1/(eln(2))-ϵk)n)^n) time for some ϵk>0 dependent on Γ. This is strictly better than O*((n/(eln(2)))^n), i.e. O*((0.5307n)^n), achieved by enumeration algorithms. Some examples of upper bounds on time complexity achieved in the thesis are CSP({<}∨2) in O*((0.1839n)^n) time, CSP({<,=,≤}∨2) in O*((0.2654n)^n) time, CSP({<,=,≠}∨3) in O*((0.4725n)^n) time and CSP({<,=,≠,≤}∨3) in O*((0.5067n)^n) time. For CSP({<}∨2) this should be compared to the bound O*((0.3679n)^n), from previously known enumeration algorithms.
APA, Harvard, Vancouver, ISO, and other styles
6

Stockman, Peter. "Upper Bounds on the Time Complexity of Temporal CSPs." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-129778.

Full text
Abstract:
The temporal constraint satisfaction problem (CSP) offers a formalized way to reason about in which order tasks should be accomplished. Using this we can model a wide set of specific problems from scheduling to AI. In this thesis we present two algorithms, Algorithm A and Algorithm B, to solve temporal CSPs focused on improving the worst case time complexity. The first algorithm solves temporal CSPs by an exhaustive search of all weak orderings. The time complexity is in , thus within a polynomial factor of the corresponding Ordered Bell Number. We also show that it can solve CSP in Allen’s algebra within a polynomial factor of the corresponding number of relations between intervals on a line, thus in   time. The second algorithm also solves temporal CSPs but where the constraints have a bounded number of disjuncts. It will assume some order and then make a backtracking search guided by the constraints. In this case the time complexity will be in . Finally we will show that this also improves the time complexity of CSP in Allen’s to .
APA, Harvard, Vancouver, ISO, and other styles
7

Batnini, Heikel. "Contraintes globales et heuristiques de recherche pour les CSPs continus." Phd thesis, Université de Nice Sophia-Antipolis, 2005. http://tel.archives-ouvertes.fr/tel-00091375.

Full text
Abstract:
Les systèmes de contraintes de distance euclidienne apparaissent dans de nombreux domaines d'applications, comme en robotique, en biochimie
moléculaire ou en CAO. Les techniques issues de la programmation par contraintes permettent de résoudre ces problèmes en combinant une technique de bissection avec des méthodes de réduction des domaines (consistances locales ou partielles). Or, ces consistances sont des méthodes systématiques qui ne prennent pas en compte les propriétés spécifiques des contraintes.

Nous présentons dans cette thèse deux approches pour la conception d'une contrainte globale pour la résolution de systèmes de contraintes de distance. La première approche est basée sur l'inférence de contraintes
redondantes directement issues de propriétés géométriques du système.
La deuxième approche est basée sur l'introduction d'un algorithme de filtrage global dédié aux systèmes d'équations de distance.
Ces travaux ont débouché sur la conception d'une
technique de décomposition de domaines qui exploite la structure particulière des contraintes de distance. Enfin, nous présentons une généralisation de cette heuristique de recherche à des contraintes numériques quelconques.
APA, Harvard, Vancouver, ISO, and other styles
8

Chakchouk, Fadoua. "Contribution à la robustesse dans les CSPs distribués par réplication locale." Thesis, Valenciennes, 2018. http://www.theses.fr/2018VALE0039/document.

Full text
Abstract:
Nous visons à garantir la résolution d’un DisCSP en présence d’un ou plusieurs agents défaillants. Les méthodes traitant la tolérance aux fautes au sein des SMAs visent la continuité du fonctionnement du système. Mais, aucune de ces méthodes n’est appliquée pour résoudre un DisCSP. La défaillance d’un agent au cours de la résolution d’un DisCSP engendre la perte d’une partie du DisCSP global, d’où l’obtention d’un résultat erroné. Donc pour obtenir les résultats attendus, il faut garantir la résolution du CSP local de l’agent défaillant. Nous proposons de répliquer les CSPs locaux des agents défaillants au sein des agents non défaillants. Cette réplication permet la résolution du CSP local de l’agent défaillant par un autre agent. Cette résolution est effectuée en fusionnant les réplicats de CSPs des agents défaillants avec les CSPs des autres agents. Cette fusion permet la conservation de la modélisation initiale du DisCSP. L’algorithme de distribution des réplicats proposé garantit que les CSPs des agents défaillants ne soient pas répliqués au sein du même agent. De cette façon, le problème conserve son aspect distribué
We aim to ensure a DisCSP resolution in presence of failed agents. Methods handling fault tolerance in MASs aim to ensure the continuity of the system operation. But, none of these methods are applied to solve a DisCSP. The failure of an agent generates the loss of a part of the DisCSP providing wrong results. Therefore, to obtain expected results, it is necessary to ensure the resolution of the failed agent local CSP.We propose to replicate the local CSPs of the failed agents within active agents. This replication allows local CSP resolution of the failed agent by another agent. The resolution is done by merging the replicates of failed agents CSPs with the CSPs of other agents. This technique conserve the initial DisCSP modeling. The proposed replicates distribution algorithm ensures that the CSPs of failed agents are not replicated within the same agent. In this way, the problem keeps its distributed aspect
APA, Harvard, Vancouver, ISO, and other styles
9

Dickinson, Joanne Helen. "Characterisation of the major cold shock protein genes (csps) of Yersinia enterocolitica." Thesis, University of Nottingham, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.395713.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nguyen, Van-Hau [Verfasser], Steffen [Akademischer Betreuer] Hölldobler, and Pedro [Akademischer Betreuer] Barahona. "SAT Encodings of Finite CSPs / Van-Hau Nguyen. Gutachter: Steffen Hölldobler ; Pedro Barahona." Dresden : Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://d-nb.info/106951814X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "CSPs"

1

Katsirelos, George. A framework for experiments in CSPs. Ottawa: National Library of Canada, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rizzo, Giuseppe. Land optimization strategy for industrial and commercial growth in Brunei Darussalam: CSPS study with SGS Economics & Planning Pty Ltd, Australia, in collaboration with Ministry of Development and Department of Economic and Planning Development. Gadong, Brunei Darussalam: Centre for Strategic and Policy Studies Brunei Darussalam, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

(Organization), ActionAid Pakistan, ed. CSOs accountability. Islamabad: Actionaid international Pakistan, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Manian, Divya. CSS essentials. Freiburg, Germany: Smashing Media GmbH, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Meitar, Moscovitz, ed. AdvancED CSS. Berkeley, CA: Friends of ED, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Core CSS. Upper Saddle River, NJ: Prentice Hall PTR, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Schmitt, Christopher. Professional CSS. New York: John Wiley & Sons, Ltd., 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lewis, Joseph R., and Meitar Moscovitz. AdvancED CSS. Berkeley, CA: Apress, 2009. http://dx.doi.org/10.1007/978-1-4302-1933-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Budd, Andy, Simon Collison, and Cameron Moll. CSS Mastery. Berkeley, CA: Apress, 2009. http://dx.doi.org/10.1007/978-1-4302-2398-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dowden, Martine, and Michael Dowden. Architecting CSS. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5750-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "CSPs"

1

Lyons, Valerie. "Justice vs Control in Cloud Computing: A Conceptual Framework for Positioning a Cloud Service Provider’s Privacy Orientation." In Palgrave Studies in Digital Business & Enabling Technologies, 79–104. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-54660-1_5.

Full text
Abstract:
Abstract The continued rise in frequency and magnitude of cloud-based privacy breaches brings to the fore the challenges experienced by cloud service providers (CSPs) in balancing the need to maximize profit with the need to maintain data privacy. With a backdrop of the ineffectiveness of regulatory approaches to protecting privacy, this chapter explores privacy from a non-regulatory perspective—instead exploring a CSP’s approach to privacy as dynamics of control and justice. We apply control theory to represent the CSP’s compliance with privacy legislation and power over data, and we apply justice theory to represent the CSP exceeding compliance. Control theories, such as social contract theory, have frequently been applied to explore privacy challenges between organizations and consumers, as too have justice theories e.g. procedural and distributive justice. However, few studies have combined these theoretical concepts to provide a balanced view of these tensions in the cloud computing landscape. Integrating concepts from these theories, we construct a framework that can help to explain and position a CSP’s privacy orientation. Four key privacy orientations emerge in our framework, namely: Risk Managers, Integrators, Citizens and Warriors. We discuss the implications of each privacy orientation for CSPs. Our framework will enable future research to further understand, explore and compare the impact and effectiveness of each privacy orientation.
APA, Harvard, Vancouver, ISO, and other styles
2

Prcovic, Nicolas. "Extremal CSPs." In Principles and Practice of Constraint Programming - CP 2005, 807–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564751_69.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Climent, Laura, Richard J. Wallace, Miguel A. Salido, and Federico Barber. "Modeling Robustness in CSPs as Weighted CSPs." In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 44–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38171-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mouhoub, Malek. "Solving Dynamic CSPs." In Advances in Artificial Intelligence, 504–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24840-8_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pang, Wanlin, and Scott D. Goodwin. "Characterizing tractable CSPs." In Advances in Artificial Intelligence, 259–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-64575-6_56.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

González, Santiago Macho, Carlos Ansótegui, and Pedro Meseguer. "Boosting Open CSPs." In Principles and Practice of Constraint Programming - CP 2006, 314–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11889205_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bistarelli, Stefano, Hélène Faxgier, Ugo Montanari, Francesca Rossi, Thomas Schiex, and Gérard Verfaillie. "Semiring-based CSPs and valued CSPs: Basic properties and comparison." In Over-Constrained Systems, 111–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61479-6_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Austrin, Per, Siavosh Benabbas, and Avner Magen. "On Quadratic Threshold CSPs." In LATIN 2010: Theoretical Informatics, 332–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12200-2_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bistarelli, Stefano, Boi Faltings, and Nicoleta Neagu. "Interchangeability in Soft CSPs." In Lecture Notes in Computer Science, 31–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36607-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rochart, Guillaume. "Explanations and Numeric CSPs." In Principles and Practice of Constraint Programming – CP 2004, 805. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30201-8_84.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "CSPs"

1

Dinur, Irit, and Gillat Kol. "Covering CSPs." In 2013 IEEE Conference on Computational Complexity (CCC). IEEE, 2013. http://dx.doi.org/10.1109/ccc.2013.29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Ruiwei, and Roland H. C. Yap. "Bipartite Encoding: A New Binary Encoding for Solving Non-Binary CSPs." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/165.

Full text
Abstract:
Constraint Satisfaction Problems (CSPs) are typically solved with Generalized Arc Consistency (GAC). A general CSP can also be encoded into a binary CSP and solved with Arc Consistency (AC). The well-known Hidden Variable Encoding (HVE) is still a state-of-the-art binary encoding for solving CSPs. We propose a new binary encoding, called Bipartite Encoding (BE) which uses the idea of partitioning constraints. A BE encoded CSP can achieve a higher level of consistency than GAC on the original CSP. We give an algorithm for creating compact bipartite encoding for non-binary CSPs. We present a AC propagator on the binary constraints from BE exploiting their special structure. Experiments on a large set of non-binary CSP benchmarks with table constraints using the Wdeg, Activity and Impact heuristics show that BE with our AC propagator can outperform existing state-of-the-art GAC algorithms (CT, STRbit) and binary encodings (HVE with HTAC).
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Hubie, Georg Gottlob, Matthias Lanzinger, and Reinhard Pichler. "Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/239.

Full text
Abstract:
Constraint satisfaction problems (CSPs) are an important formal framework for the uniform treatment of various prominent AI tasks, e.g., coloring or scheduling problems. Solving CSPs is, in general, known to be NP-complete and fixed-parameter intractable when parameterized by their constraint scopes. We give a characterization of those classes of CSPs for which the problem becomes fixed-parameter tractable. Our characterization significantly increases the utility of the CSP framework by making it possible to decide the fixed-parameter tractability of problems via their CSP formulations. We further extend our characterization to the evaluation of unions of conjunctive queries, a fundamental problem in databases. Furthermore, we provide some new insight on the frontier of PTIME solvability of CSPs. In particular, we observe that bounded fractional hypertree width is more general than bounded hypertree width only for classes that exhibit a certain type of exponential growth. The presented work resolves a long-standing open problem and yields powerful new tools for complexity research in AI and database theory.
APA, Harvard, Vancouver, ISO, and other styles
4

Eriksson, Leif, and Victor Lagerkvist. "Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/258.

Full text
Abstract:
The constraint satisfaction problem (CSP) is an important framework in artificial intelligence used to model e.g. qualitative reasoning problems such as Allen's interval algebra A. There is strong practical incitement to solve CSPs as efficiently as possible, and the classical complexity of temporal CSPs, including A, is well understood. However, the situation is more dire with respect to running time bounds of the form O(f(n)) (where n is the number of variables) where existing results gives a best theoretical upper bound 2^O(n * log n) which leaves a significant gap to the best (conditional) lower bound 2^o(n). In this paper we narrow this gap by presenting two novel algorithms for temporal CSPs based on dynamic programming. The first algorithm solves temporal CSPs limited to constraints of arity three in O(3^n) time, and we use this algorithm to solve A in O((1.5922n)^n) time. The second algorithm tackles A directly and solves it in O((1.0615n)^n), implying a remarkable improvement over existing methods since no previously published algorithm belongs to O((cn)^n) for any c. We also extend the latter algorithm to higher dimensions box algebras where we obtain the first explicit upper bound.
APA, Harvard, Vancouver, ISO, and other styles
5

Carbonnel, Clement, Miguel Romero, and Stanislav Zivny. "Point-width and Max-CSPs." In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2019. http://dx.doi.org/10.1109/lics.2019.8785660.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Huber, Anna, Andrei Krokhin, and Robert Powell. "Skew Bisubmodularity and Valued CSPs." In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973105.94.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tian, Guoyun, Yueli Liu, Pradeep Lall, R. Wayne Johnson, Sanan Abderrahman, Mike Palmer, Nokib Islam, Jeffrey Suhling, and Larry Crane. "Drop Reliability of Corner Bonded CSP in Portable Products." In ASME 2003 International Electronic Packaging Technical Conference and Exhibition. ASMEDC, 2003. http://dx.doi.org/10.1115/ipack2003-35318.

Full text
Abstract:
The use of CSPs has expanded rapidly, particularly in portable electronic products. Many CSP designs will meet the thermal cycle or thermal shock requirements for these applications. However, mechanical shock (drop) and bending requirements often necessitate the use of underfills to increase the mechanical strength of the CSP-to-board connection. Capillary flow underfills processed after reflow, provide the most common solution to improving mechanical reliability. However, capillary underfill adds board dehydration, underfill dispense, flow and cure steps and the associated equipment to the assembly process. Corner bonding provides an alternate approach. Dots of underfill are dispensed at the four corners of the CSP site after solder paste print, but before CSP placement. During reflow the underfill cures, providing mechanical coupling between the CSP and the board at the corners of the CSP. Since only small areas of underfill are used, board dehydration is not required. This paper examines the manufacturing process for corner bonding including dispense volume, CSP placement and reflow. Drop test results are then presented. A conventional, capillary process was used for comparison of drop test results. Test results with corner bonding were intermediate between complete capillary underfill and non-underfilled CSPs. Finite element modeling results for the drop test are also included.
APA, Harvard, Vancouver, ISO, and other styles
8

Tian, Guoyun, Yueli Liu, Pradeep Lall, R. Wayne Johnson, Sanan Abderrahman, Mike Palmer, Nokib Islam, Dhananjay Panchgade, Jeffrey Suhling, and Larry Crane. "Drop-Impact Reliability of Chip-Scale Packages in Handheld Products." In ASME 2003 International Mechanical Engineering Congress and Exposition. ASMEDC, 2003. http://dx.doi.org/10.1115/imece2003-42075.

Full text
Abstract:
The use of CSPs has expanded rapidly, particularly in portable electronic products. Many CSP designs will meet the thermal cycle or thermal shock requirements for these applications. However, mechanical shock (drop) and bending requirements often necessitate the use of underfills to increase the mechanical strength of the CSP-to-board connection. Capillary flow underfills processed after reflow, provide the most common solution to improving mechanical reliability. However, capillary underfill adds board dehydration, underfill dispense, flow and cure steps and the associated equipment to the assembly process. Corner bonding provides an alternate approach. Dots of underfill are dispensed at the four corners of the CSP site after solder paste print, but before CSP placement. During reflow the underfill cures, providing mechanical coupling between the CSP and the board at the corners of the CSP. Since only small areas of underfill are used, board dehydration is not required. This paper examines the manufacturing process for corner bonding including dispense volume, CSP placement and reflow. Drop test results are then presented. A conventional, capillary process was used for comparison of drop test results. Test results with corner bonding were intermediate between complete capillary underfill and non-underfilled CSPs. Finite element modeling results for the drop test are also included.
APA, Harvard, Vancouver, ISO, and other styles
9

Jonsson, Peter, and Victor Lagerkvist. "Lower Bounds and Faster Algorithms for Equality Constraints." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/247.

Full text
Abstract:
We study the fine-grained complexity of NP-complete, infinite-domain constraint satisfaction problems (CSPs) parameterised by a set of first-order definable relations (with equality). Such CSPs are of central importance since they form a subclass of any infinite-domain CSP parameterised by a set of first-order definable relations. We prove that under the randomised exponential-time hypothesis it is not possible to find c > 1 such that a CSP over an arbitrary finite equality language is solvable in O(c^n) time (n is the number of variables). Stronger lower bounds are possible for infinite equality languages where we rule out the existence of 2^o(n log n) time algorithms; a lower bound which also extends to satisfiability modulo theories solving for an arbitrary background theory. Despite these lower bounds we prove that for each c > 1 there exists an NP-hard equality CSP solvable in O(c^n) time. Lower bounds like these immediately ask for closely matching upper bounds, and we prove that a CSP over a finite equality language is always solvable in O(c^n) time for a fixed c.
APA, Harvard, Vancouver, ISO, and other styles
10

Thapper, Johan, and Stanislav Zivny. "The complexity of finite-valued CSPs." In the 45th annual ACM symposium. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2488608.2488697.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "CSPs"

1

Avis, William. Funding Mechanisms to Local CSOs. Institute of Development Studies, May 2022. http://dx.doi.org/10.19088/k4d.2022.089.

Full text
Abstract:
Civil society can be broadly defined as the area outside the family, market and state. As such, civil society encompasses a spectrum of actors with a wide range of purposes, constituencies, structures, degrees of organisation, functions, size, resource levels, cultural contexts, ideologies, membership, geographical coverage, strategies and approaches.This rapid literature review collates available literature on funding mechanisms and barriers to local CSOs gaining access to funding and the extent to which funding leads towards organisational development and sustainability. Broadly, it is asserted that in terms of funding, local CSOs often struggle to secure funding equivalent to that of INGOs and their local representatives. Kleibl & Munck (2017) reflect that indigenous non-state actors do not receive large shares of development funding. For example, only 10% of the total funding for US-funded health projects in Uganda was allocated to indigenous non-state actors.Given the diversity of CSOs and the variety of contexts, sectors they work in and the services they supply, it is challenging to summarise funding mechanisms available to local CSOs and the barriers to accessing these. Recent analyses of CSO funding report that while the total CSO funding in many contexts has continued to increase in absolute terms since 2015, its relative importance (as a share of total Overseas Development Assistance) has been decreasing (Verbrugge and Huyse, 2018). They continued that ODA funding channelled through CSOs (i.e., funding that is programmed by the donor government) remains far more important in volumes than ODA channelled directly to CSOs (which is programmed by CSOs themselves).The literature identifies three principal mechanisms by which donors provide financial support to civil society actors: a) Direct support to individual or umbrella organisations; b) Via Southern government; c) Via Intermediaries – largely Northern NGOs.
APA, Harvard, Vancouver, ISO, and other styles
2

Thibaudeau, S., and R. Currie. CSS Hudson Cruise 90031. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 1991. http://dx.doi.org/10.4095/132671.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Scarbrough, Kent, and Stephen K. Mitchell. SWAMSI: Bistatic CSAS and Target Echo Studies. Fort Belvoir, VA: Defense Technical Information Center, September 2007. http://dx.doi.org/10.21236/ada569080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hamlet, Benjamin R., Mark Sinclair Montoya, James Wallace Vickers, and Rudy Daniel Sandoval. Data Model to CSS Mappings. Office of Scientific and Technical Information (OSTI), December 2015. http://dx.doi.org/10.2172/1331519.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lie, H., B. Bos, and C. Lilley. The text/css Media Type. RFC Editor, March 1998. http://dx.doi.org/10.17487/rfc2318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Andraka, Charles E. Sandia - CSP - Dish Technology Assessment. Office of Scientific and Technical Information (OSTI), August 2018. http://dx.doi.org/10.2172/1467167.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mohan, Christopher O. CSS Modularity- The Unintended Consequences. Fort Belvoir, VA: Defense Technical Information Center, March 2011. http://dx.doi.org/10.21236/ada553061.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Candy, Jeff. CSPM (Center for the Study of Plasma Microturbulence). Office of Scientific and Technical Information (OSTI), November 2017. http://dx.doi.org/10.2172/1420164.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Stoneburner, Gary. COTS security protection profile-operating systems (CSPP-OS) :. Gaithersburg, MD: National Institute of Standards and Technology, 2003. http://dx.doi.org/10.6028/nist.ir.6985.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

V. L. Putman. Criticality Safety Basics for INL FMHs and CSOs. Office of Scientific and Technical Information (OSTI), April 2012. http://dx.doi.org/10.2172/1046072.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'CSPs' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography