Balancing Bounded Treewidth Circuits

Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size $n^{O(1)}$ and treewidth $O(\log^i n)$ can be simulated by a circuit of width $O(\log^{i+1} n)$ and size $n^c$, where $c = O(1)$, if $i=0$, and $c=O(\log \log n)$ otherwise. For our main construction, we prove that multiplicatively disjoint arithmetic circuits of size $n^{O(1)}$ and treewidth $k$ can be simulated by bounded fan-in arithmetic formulas of depth $O(k^2\log n)$. From this we derive the analogous statement for syntactically multilinear arithmetic circuits, which strengthens a theorem of Mahajan and Rao. As another application, we derive that constant width arithmetic circuits of size $n^{O(1)}$ can be balanced to depth $O(\log n)$, provided certain restrictions are made on the use of iterated multiplication. Also from our main construction, we derive that Boolean bounded fan-in circuits of size $n^{O(1)}$ and treewidth $k$ can be simulated by bounded fan-in formulas of depth $O(k^2\log n)$. This strengthens in the non-uniform setting the known inclusion that $SC^0 \subseteq NC^1$. Finally, we apply our construction to show that {\sc reachability} for directed graphs of bounded treewidth is in $LogDCFL$

Computing with cells: membrane systems - some complexity issues.

Membrane computing is a branch of natural computing which abstracts computing models from the structure and the functioning of the living cell. The main ingredients of membrane systems, called P systems, are (i) the membrane structure, which consists of a hierarchical arrangements of membranes which delimit compartments where (ii) multisets of symbols, called objects, evolve according to (iii) sets of rules which are localised and associated with compartments. By using the rules in a nondeterministic/deterministic maximally parallel manner, transitions between the system configurations can be obtained. A sequence of transitions is a computation of how the system is evolving. Various ways of controlling the transfer of objects from one membrane to another and applying the rules, as well as possibilities to dissolve, divide or create membranes have been studied. Membrane systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems once future biotechnology gives way to a practical bio-realization. In this paper we survey some interesting and fundamental complexity issues such as universality vs. nonuniversality, determinism vs. nondeterminism, membrane and alphabet size hierarchies, characterizations of context-sensitive languages and other language classes and various notions of parallelism

Information needs after stroke: What to include and how to structure it on a website. A qualitative study using focus groups and card sorting

Background: Use of the Internet to obtain health and other information is increasing. Previous studies have identified the specific information needs of people with stroke but not in relation to the Internet. People with aphasia (PwA) may face barriers in accessing the Internet: Navigating websites requires an ability to categorise information and this ability is often impaired in PwA. The website categorisation preferences of people with stroke and with aphasia have not yet been reported. Aims: This study aimed: (a) to determine what information people who have had a stroke would like to see on a website about living with stroke; (b) to determine the most effective means of structuring information on the website so that it is accessible to people with stroke; and c) to identify any differences between people with and without aphasia in terms of preferences for structuring information on the website. Methods & Procedures: Participants were recruited from a hospital's Stroke Database. Focus groups were used to elicit what information participants wanted on a website about living with stroke. The themes raised were depicted on 133 cards. To determine the most effective way of structuring information on the website, and whether there were any differences in preferences between PwA and PwoA, participants used a modified closed card-sorting technique to sort the cards under website categories. Outcomes & Results: A total of 48 people were invited, and 12 (25%) agreed to take part. We ran three focus groups: one with PwA (n = 5) and two with people without aphasia (PwoA) (n = 3, n = 4). Participants wanted more information about stroke causes and effects (particularly emotional issues), roles of local agencies, and returning to previous activities (driving, going out). All participants completed the card-sorting exercise. Few cards (6%) were categorised identically by everyone. Cards relating to local agencies and groups were not consistently categorised together. Cards relating to emotions were segregated. The categorisation preferences for PwA were more fragmented than those for PwoA: 60% of PwA agreed on the categorisation of 51% of the cards, whereas 60% of PwoA agreed on the categorisation of 76% of the cards. Conclusions: Information needs covered all stages of the stroke journey. The card sorting was accessible to everyone, and provided evidence of structuring preferences and of some of the categorisation difficulties faced by PwA. More research is needed on what an accessible website looks like for PwA

The Computational Complexity of Knot and Link Problems

We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc unknotting problem} is in {\bf NP}. We also consider the problem, {\sc unknotting problem} of determining whether two or more such polygons can be split, or continuously deformed without self-intersection so that they occupy both sides of a plane without intersecting it. We show that it also is in NP. Finally, we show that the problem of determining the genus of a polygonal knot (a generalization of the problem of determining whether it is unknotted) is in {\bf PSPACE}. We also give exponential worst-case running time bounds for deterministic algorithms to solve each of these problems. These algorithms are based on the use of normal surfaces and decision procedures due to W. Haken, with recent extensions by W. Jaco and J. L. Tollefson.Comment: 32 pages, 1 figur

Distinguishing sequences for partially specified FSMs

Distinguishing Sequences (DSs) are used inmany Finite State Machine (FSM) based test techniques. Although Partially Specified FSMs (PSFSMs) generalise FSMs, the computational complexity of constructing Adaptive and Preset DSs (ADSs/PDSs) for PSFSMs has not been addressed. This paper shows that it is possible to check the existence of an ADS in polynomial time but the corresponding problem for PDSs is PSPACE-complete. We also report on the results of experiments with benchmarks and over 8 * 106 PSFSMs. © 2014 Springer International Publishing

The Pathway to Low Outlier Status in Venous Thromboembolism Events: An Analysis of Pancreatic Surgery in ACS NSQIP

Introduction: Our institution’s hepatopancreaticobiliary service (HPBS) is a high-volume pancreatic surgery service, which has demonstrated consistently low rates of symptomatic venous thromboembolism (VTE) compared to similar institutions as reported by NSQIP. We sought to determine if the HPBS’s regimented multimodal VTE prophylaxis pathway plays a role in achieving consistently low VTE rates. Methods: We queried the ACS NSQIP Participant User File and our institution’s data from 2011-2016 for major pancreatic operations. We used Chi-squared analysis to compare the HPBS and national patient populations, and created a matched dataset based on preoperative patient factors. Univariate and multivariate analyses were performed on both the aggregate and matched data to determine independent risk factors for symptomatic VTE formation. Results: Among 36,435 NSQIP patients, 850 (2.3%) received surgery by the HPBS. VTE rates were significantly lower for the HPBS (2.0%) compared to the national cohort (3.5%) (p=0.018); this significance was seen in the matched cohort as well (p=0.040). Upon multivariate analysis, having an operation performed by the HPBS independently conferred lower odds of VTE formation in both the aggregate (OR=0.572, p=0.024) and matched (OR=0.530, p=0.041) cohorts. Discussion: The HPBS had statistically lower rates of symptomatic VTE compared to the national cohort as reported by NSQIP. We identified an independent protective effect of the HPBS on VTE formation, which we believe to be due, at least in part, to adherence to a high risk VTE prophylaxis pathway. This pathway could serve as a model for other institutions hoping to improve their VTE rates

Refining complexity analyses in planning by exploiting the exponential time hypothesis

The use of computational complexity in planning, and in AI in general, has always been a disputed topic. A major problem with ordinary worst-case analyses is that they do not provide any quantitative information: they do not tell us much about the running time of concrete algorithms, nor do they tell us much about the running time of optimal algorithms. We address problems like this by presenting results based on the exponential time hypothesis (ETH), which is a widely accepted hypothesis concerning the time complexity of 3-SAT. By using this approach, we provide, for instance, almost matching upper and lower bounds onthe time complexity of propositional planning.Funding Agencies|National Graduate School in Computer Science (CUGS), Sweden; Swedish Research Council (VR) [621-2014-4086]</p

САМОПОГЛОЩЕНИЕ ИЗЛУЧЕНИЯ НА ДЛИНЕ ВОЛНЫ 213 нм ПРИ ЛАЗЕРНОМ ВОЗДЕЙСТВИИ НА РОГОВИЦУ ГЛАЗА

The laser ablation efficiency of cornea at 213 nm radiation was investigated and optimized. It is shown that self-absorption of radiation at 213 nm in a thin cloud of ablated material takes place and strongly influences the ablation efficiency. Ablation products are being blown out in the lateral direction along the cornea surface, as a result of which the pulse fluence at the pit boundary Fbnd is more than the threshold fluence Fth. As a consequence, a pit radius rbnd is less than a laser beam radius rth corresponding to the threshold fluence Fth that should be taken into account in planning ablation surgery at 213 nm radiation. Исследована и оптимизирована эффективность лазерной абляции роговицы глаза УФ-излучением с длиной волны 213 нм. Показано, что самопоглощение лазерного излучения 213 нм в тонком облаке испаренного материала сильно влияет на эффективность абляции. Продукты абляции выбрасываются в боковом направлении вдоль поверхности роговицы, в результате чего плотность энергии импульса на границе абляционной лунки Fbnd выше, чем пороговая плотность энергии Fth. Как следствие, радиус лунки rbnd меньше радиуса rth  лазерного луча, соответствующего пороговой плотности энергии импульса Fth, что необходимо учитывать при планировании абляционной хирургии глаза излучением 213 нм.

ОЦЕНКА ЭФФЕКТИВНОГО КОЭФФИЦИЕНТА ПОГЛОЩЕНИЯ РОГОВИЦЫ ГЛАЗА НА ДЛИНЕ ВОЛНЫ 213 НМ ИЗ АБЛЯЦИОННЫХ ИЗМЕРЕНИЙ

It is shown experimentally that a cornea represents a 213 nm UV inhomogeneous material both at depth and around a surface in relation to UV effective absorption coefficient and local laser depth ablation rate, which should be taken into account for a more exact planning of a profile of removed cornea collagen material during eye vision correction. Экспериментально показано, что роговица глаза для УФ-излучения (213 нм) представляет собой неоднородный материал как по глубине, так и вдоль поверхности, в отношении эффективного коэффициента поглощения и локальной скорости абляционного удаления материала роговицы, что необходимо учитывать для более точного планирования профиля удаляемого коллагена роговицы при операциях коррекции зрения.

Spatial Dynamics Of Vertical And Horizontal Intergovernmental Collaboration

Although researchers have made progress in understanding motivations behind local government collaboration, there is little research that explores the spatial dynamics of such interactions. Does the idea of collaboration travel horizontally, passed from neighbor to neighbor, or is vertical leadership from state, county, or regional actors more important in influencing local governments’ decisions to share resources and functions? What factors influence local governments’ choices to collaborate with their neighbors versus a regional entity, county, or state government? In this article, we investigate the importance of vertical and horizontal influences when local governments decide to collaborate around land use planning. Using data from a survey of Michigan local government officials, we take a spatial statistical approach to answering this question. We find widespread evidence of collaboration at multiple scales, and observe patterns of both horizontal and vertical influence. We also find that contextual factors help to explain these patterns of collaboration.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/112248/1/juaf12139.pd