Sökresultat

Filtyp

Din sökning på "*" gav 532727 sökträffar

Commutativity and Ideals in Category Crossed Products

In order to simultaneously generalize matrix rings and group graded crossed products, we introduce category crossed products. For such algebras we describe the center and the commutant of the coefficient ring. We also investigate the connection between on the one hand maximal commutativity of the coefficient ring and on the other hand nonemptyness of intersections of the coefficient ring by nonzer

Tankstreck i brödtext och rubriker : Förslag till en ny skiljeteckensnormering

Interpunktionen är en viktig del i skriftkunnigheten, men samtidigt något som såväl ovana som professionella skribenter ofta är osäkra på (Dahl 2015). I denna studie undersöker jag bruket av tankstreck, som populärt betraktats som ett missbrukat skiljetecken (Truss & Halldinger 2005, Sveriges radio 2017). Bruket ställs mot språkvårdens rekommendationer, som sällan har ursprung i empirisk forsk

Concurrent engineering in real and virtual tool production

When re-engineering a company's information system, one must have a thorough knowledge of the work process. In this article, the methodology of analysis of information creation and information flow is presented. The most important requirements are identified, and concrete solutions are given for the creation of an appropriate information system. As an illustration, a virtual toolmaking factory is

Hardness of Approximation in PSPACE and Separation Results for Pebble Games

We consider the pebble game on DAGs with bounded fan-in introduced in [Paterson and Hewitt '70] and the reversible version of this game in [Bennett '89], and study the question of how hard it is to decide exactly or approximately the number of pebbles needed for a given DAG in these games. We prove that the problem of deciding whether s pebbles suffice to reversibly pebble a DAG G is PSPACE-comple

A generalized method for proving polynomial calculus degree lower bounds

We study the problem of obtaining lower bounds for polynomial calculus (PC) and polynomial calculus resolution (PCR) on proof degree, and hence by [Impagliazzo et al. '99] also on proof size. [Alekhnovich and Razborov'03] established that if the clause-variable incidence graph of a CNF formula F is a good enough expander, then proving that F is unsatisfiable requires high PC/PCR degree. We further

Tight size-degree bounds for sums-of-squares proofs

We exhibit families of 4-CNF formulas over n variables that have sums-of-squares (SOS) proofs of unsatisfiability of degree (a.k.a. rank) d but require SOS proofs of size nΩ(d) for values of d = d(n) from constant all the way up to nδ for some universal constant δ. This shows that the nO(d) running time obtained by using the Lasserre semidefinite programming relaxations to find degree-d SOS proofs

Geoelectrical and IP imaging used for preinvestigation at a tunnel project

At a large tunnel project in Southern Sweden a number of geoelectrical and IP imaging were carried out. The tunnel is drilled through a horst with a complex geology which includes fractures, high water content and weathered zones. The measurements where carried out to compile a geologic model to use in the further planning of the project. The resistivity and IP complements each other very well sin

Hereditary hypertrophic cardiomyopathy in children and young adults—The value of reevaluating and expanding gene panel analyses

Introduction: Sudden cardiac death (SCD) and early onset cardiomyopathy (CM) in the young will always lead to suspicion of an underlying genetic disorder. Incited by the rapid advances in genetic testing for disease we have revisited families, which previously tested “gene-negative” for familial predominantly pediatric CM, in hopes of finding a causative gene variant. Methods: 10 different familie

A historical account of the role of exercise in the prevention and treatment of cancer-related lymphedema

In the absence of guidance from scientific evidence, a range of lymphedema prevention and management, guidelines were developed by relevant organizations around the world. These became publicly available, promoted and endorsed, particularly to women with breast cancer. The recommendations advised avoidance of any activity that could overload or restrict the lymphatic system and need for caution wh

Assessment of lifestyle factors helps to identify liver fibrosis due to non-alcoholic fatty liver disease in obesity

Only some individuals with obesity develop liver fibrosis due to non-alcoholic fatty liver disease (NAFLD-fibrosis). We determined whether detailed assessment of lifestyle factors in addition to physical, biochemical and genetic factors helps in identification of these patients. A total of 100 patients with obesity (mean BMI 40.0 ± 0.6 kg/m2 ) referred for bariatric surgery at the Helsinki Univers

Principles of individual and small-quantity production processes

Processes in individual and mass production are governed by certain principles which need to be taken into account as early as the conceptual design phase. A comprehensive analysis of processes in tool production has shown that production also needs to be considered in remodeling or the introduction ofconcurrent engineering. The paper discusses the principles of the manufacturing process which aff

Towards an understanding of polynomial calculus : New separations and lower bounds (extended abstract)

During the last decade, an active line of research in proof complexity has been into the space complexity of proofs and how space is related to other measures. By now these aspects of resolution are fairly well understood, but many open problems remain for the related but stronger polynomial calculus (PC/PCR) proof system. For instance, the space complexity of many standard "benchmark formulas" is

Pebble games, proof complexity, and time-space trade-offs

Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on proof space, and establishing size-space tr