| 11. |
|
|
| 12. |
|
|
| 13. |
- Abbey-Lee, Robin N., et al.
(författare)
-
The Influence of Rearing on Behavior, Brain Monoamines, and Gene Expression in Three-Spined Sticklebacks
- 2018
-
Ingår i: Brain, behavior, and evolution. - Basel : S. Karger AG. - 0006-8977 .- 1421-9743. ; 91:4, s. 201-213
-
Tidskriftsartikel (refereegranskat)abstract
- The causes of individual variation in behavior are often not well understood, and potential underlying mechanisms include both intrinsic and extrinsic factors, such as early environmental, physiological, and genetic differences. In an exploratory laboratory study, we raised three-spined sticklebacks (Gasterosteus aculeatus) under 4 different environmental conditions (simulated predator environment, complex environment, variable social environment, and control). We investigated how these manipulations related to behavior, brain physiology, and gene expression later in life, with focus on brain dopamine and serotonin levels, turnover rates, and gene expression. The different rearing environments influenced behavior and gene expression, but did not alter monoamine levels or metabolites. Specifically, compared to control fish, fish exposed to a simulated predator environment tended to be less aggressive, more exploratory, and more neophobic; and fish raised in both complex and variable social environments tended to be less neophobic. Exposure to a simulated predator environment tended to lower expression of dopamine receptor DRD4A, a complex environment increased expression of dopamine receptor DRD1B, while a variable social environment tended to increase serotonin receptor 5-HTR2B and serotonin transporter SLC6A4A expression. Despite both behavior and gene expression varying with early environment, there was no evidence that gene expression mediated the relationship between early environment and behavior. Our results confirm that environmental conditions early in life can affect phenotypic variation. However, the mechanistic pathway of the monoaminergic systems translating early environmental variation into observed behavioral responses was not detected.
|
|
| 14. |
- Abdul-Sattar Aljabery, Firas, et al.
(författare)
-
Treatment and prognosis of patients with urinary bladder cancer with other primary cancers: a nationwide population-based study in the Bladder Cancer Data Base Sweden (BladderBaSe)
- 2020
-
Ingår i: BJU International. - : Wiley. - 1464-4096 .- 1464-410X. ; 126:5, s. 625-632
-
Tidskriftsartikel (refereegranskat)abstract
- Objective To study how patients with urinary bladder cancer (UBC) with previous or concomitant other primary cancers (OPCs) were treated, and to investigate their prognosis. Patients And Methods Using nationwide population-based data in the Bladder Cancer Data Base Sweden (BladderBaSe), we analysed the probability of treatment with curative intent, and UBC-specific and overall survival (OS) in patients with UBC diagnosed in the period 1997-2014 with or without OPC. The analyses considered the patient's characteristics, UBC tumour stage at diagnosis, and site of OPC. Results There were 38 689 patients, of which 9804 (25%) had OPCs. Those with synchronous OPCs more often had T2 and T3 tumours and clinically distant disease at diagnosis than those with UBC only. Patients with synchronous prostate cancer, female genital cancer and lower gastro-intestinal cancer were more often treated with curative intent than patients with UBC only. When models of survival were adjusted for age at diagnosis, marital status, education, year of diagnosis, Charlson Comorbidity Index and T-stage, UBC-specific survival was similar to patients with UBC only, but OS was lower for patients with synchronous OPC, explained mainly by deaths in OPC primaries with a bad prognosis. Conclusions OPC is common in patients with UBC. Treatment for UBC, after or in conjunction with an OPC, should not be neglected and carries just as high a probability of success as treatment in patients with UBC only. The needs of patients with UBC and OPC, and optimisation of their treatment considering their complicated disease trajectory are important areas of research.
|
|
| 15. |
- Abdulhadi, Nadia M. Noor, et al.
(författare)
-
Doctors' and nurses' views on patient care for type 2 diabetes : an interview study in primary health care in Oman
- 2013
-
Ingår i: Primary Health Care Research and Development. - : Cambridge University Press. - 1463-4236 .- 1477-1128. ; 14:3, s. 258-269
-
Tidskriftsartikel (refereegranskat)abstract
- Aim: This study aimed at exploring the experiences of primary health-care providers of their encounters with patients with type 2 diabetes, and their preferences and suggestions for future improvement of diabetes care. Background: Barriers to good diabetes care could be related to problems from health-care providers' side, patients' side or the healthcare system of the country. Treatment of patients with type 2 diabetes has become a huge challenge in Oman, where the prevalence has increased to high levels. Method: Semi-structured interviews were conducted with 26 health-care professionals, 19 doctors and seven nurses, who worked in primary health care in Oman. Qualitative content analysis was applied. Findings: Organizational barriers and barriers related to patients and healthcare providers were identified. These included workload and lack of teamwork approach. Poor patients' management adherence and influence of culture on their attitudes towards illness were identified. From the providers' side, language barriers, providers' frustration and aggressive attitudes towards the patients were reflected. Decreasing the workload, availability of competent teams with diabetes specialist nurses and continuity of care were suggested. Furthermore, changing professional behaviours towards a more patient-centred approach and need for health education to the patients, especially on self-management, were addressed. Appropriate training for health-care providers in communication skills with emphasis on self-care education and individualization of care according to each patient's needs are important for improvement of diabetes care in Oman.
|
|
| 16. |
- Abdulla, Parosh Aziz, et al.
(författare)
-
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
- 2013
-
Ingår i: Tools and Algorithms for the Construction and Analysis of Systems. - Berlin, Heidelberg : Springer Berlin Heidelberg.
-
Konferensbidrag (refereegranskat)abstract
- We present a technique for automatically verifying safety properties of concurrent programs, in particular programs which rely on subtle dependen- cies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage collection. Our technique addresses the joint challenges of infinite-state specifications, an unbounded num- ber of threads, and an unbounded heap managed by explicit memory allocation. Our technique builds on the automata-theoretic approach to model checking, in which a specification is given by an automaton that observes the execution of a program and accepts executions that violate the intended specification. We extend this approach by allowing specifications to be given by a class of infinite-state au- tomata. We show how such automata can be used to specify queues, stacks, and other data structures, by extending a data-independence argument. For verifica- tion, we develop a shape analysis, which tracks correlations between pairs of threads, and a novel abstraction to make the analysis practical. We have imple- mented our method and used it to verify programs, some of which have not been verified by any other automatic method before.
|
|
| 17. |
- Abdulla, Parosh Aziz, et al.
(författare)
-
Automatic fence insertion in integer programs via predicate abstraction
- 2012
-
Ingår i: Static Analysis. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642331244 - 9783642331251 ; , s. 164-180
-
Konferensbidrag (refereegranskat)abstract
- We propose an automatic fence insertion and verification framework for concurrent programs running under relaxed memory. Unlike previous approaches to this problem, which allow only variables of finite domain, we target programs with (unbounded) integer variables. The problem is difficult because it has two different sources of infiniteness: unbounded store buffers and unbounded integer variables. Our framework consists of three main components: (1) a finite abstraction technique for the store buffers, (2) a finite abstraction technique for the integer variables, and (3) a counterexample guided abstraction refinement loop of the model obtained from the combination of the two abstraction techniques. We have implemented a prototype based on the framework and run it successfully on all standard benchmarks together with several challenging examples that are beyond the applicability of existing methods.
|
|
| 18. |
- Abdulla, Parosh Aziz, et al.
(författare)
-
Counter-Example Guided Fence Insertion under TSO
- 2012
-
Ingår i: TACAS 2012. - Berlin, Heidelberg : Springer. - 9783642287558 - 9783642287565
-
Konferensbidrag (refereegranskat)abstract
- We give a sound and complete fence insertion procedure for concurrentfinite-state programs running under the classical TSO memory model. Thismodel allows “write to read” relaxation corresponding to the addition of an unboundedstore buffer between each processor and the main memory. We introducea novel machine model, called the Single-Buffer (SB) semantics, and show thatthe reachability problem for a program under TSO can be reduced to the reachabilityproblem under SB. We present a simple and effective backward reachabilityanalysis algorithm for the latter, and propose a counter-example guided fence insertionprocedure. The procedure is augmented by a placement constraint thatallows the user to choose places inside the program where fences may be inserted.For a given placement constraint, we automatically infer all minimal setsof fences that ensure correctness. We have implemented a prototype and run itsuccessfully on all standard benchmarks together with several challenging examplesthat are beyond the applicability of existing methods.
|
|
| 19. |
- Abdulla, Parosh Aziz, 1961-, et al.
(författare)
-
Flatten and Conquer : A Framework for Efficient Analysis of String Constraints
- 2017
-
Ingår i: SIGPLAN notices. - New York, NY, USA : ACM. - 0362-1340 .- 1558-1160. - 9781450349888 ; 52:6, s. 602-617, s. 602-617
-
Tidskriftsartikel (refereegranskat)abstract
- We describe a uniform and efficient framework for checking the satisfiability of a large class of string constraints. The framework is based on the observation that both satisfiability and unsatisfiability of common constraints can be demonstrated through witnesses with simple patterns. These patterns are captured using flat automata each of which consists of a sequence of simple loops. We build a Counter-Example Guided Abstraction Refinement (CEGAR) framework which contains both an under-and an over-approximation module. The flow of information between the modules allows to increase the precision in an automatic manner. We have implemented the framework as a tool and performed extensive experimentation that demonstrates both the generality and efficiency of our method.
|
|
| 20. |
- Abdulla, Parosh Aziz, et al.
(författare)
-
Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO
- 2013
-
Ingår i: Tools and Algorithms for the Construction and Analysis of Systems. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642367410 - 9783642367427 ; , s. 530-536
-
Konferensbidrag (refereegranskat)abstract
- We introduce MEMORAX, a tool for the verification of control state reachability (i.e., safety properties) of concurrent programs manipulating finite range and integer variables and running on top of weak memory models. The verification task is non-trivial as it involves exploring state spaces of arbitrary or even infinite sizes. Even for programs that only manipulate finite range variables, the sizes of the store buffers could grow unboundedly, and hence the state spaces that need to be explored could be of infinite size. In addition, MEMORAX in- corporates an interpolation based CEGAR loop to make possible the verification of control state reachability for concurrent programs involving integer variables. The reachability procedure is used to automatically compute possible memory fence placements that guarantee the unreachability of bad control states under TSO. In fact, for programs only involving finite range variables and running on TSO, the fence insertion functionality is complete, i.e., it will find all minimal sets of memory fence placements (minimal in the sense that removing any fence would result in the reachability of the bad control states). This makes MEMORAX the first freely available, open source, push-button verification and fence insertion tool for programs running under TSO with integer variables.
|
|
