10,529 research outputs found
An Update in Guillain-Barré Syndrome
Guillain-Barré syndrome (GBS) was first described in 1916 (Guillain G, 1916) and is approaching its 100th anniversary. Our knowledge of the syndrome has hugely expanded since that time. Once originally considered to be only demyelinating in pathology we now recognise both axonal and demyelinating subtypes. Numerous triggering or antecedent events including infections are recognised and GBS is considered an immunological response to these. GBS is now considered to be a clinical syndrome of an acute inflammatory neuropathy encompassing a number of subtypes with evidence of different immunological mechanisms. Some of these are clearly understood while others remain to be fully elucidated. Complement fixing antibodies against peripheral nerve gangliosides alone and in combination are increasingly recognised as an important mechanism of nerve damage. New antibodies against other nerve antigens such as neurofascin have been recently described. Research databases have been set up to look at factors associated with prognosis and the influence of intravenous immunoglobulin (IvIg) pharmacokinetics in therapy. Exciting new studies are in progress to examine a possible role for complement inhibition in the treatment of the syndrome
Determination of Transgene Copy Number by Real-Time Quantitative PCR
Efficient methods to characterize transgenic plants are important to quickly understand the state of the transformant. Determining transgene copy number is an important step in transformant characterization and can differentiate between complex and simple transformation events. This knowledge can be extremely useful when determining what future experiments and uses the transgenic lines can be utilized for. The method described here uses real-time quantitative PCR to determine the transgene copy number present in the genome of the transformant. Specifically, this method measures the relative transgene copy number by comparing it with an endogenous gene with a known copy number. This method is a quick alternative to the Southern blot, a method that is commonly used to determine gene copy number, and is effective when screening large numbers of transformants
Global Standards in Action: Insights from Anti-Money Laundering Regulation
As organizations have come under the increasing influence of global rules of all sorts, organization scholars have started studying the dynamics of global regulation. The purpose of this article is to identify and evaluate the contribution to this interdisciplinary field by the âStockholm Centre for Organisational Researchâ. The latterâs key proposition is that while global regulation often consists of voluntary best practice rules it can nevertheless become highly influential under certain conditions. We assess how innovative this approach is using as a benchmark the state of the art in another field of relevance to the study of global regulation, i.e. âInternational Relationsâ. Our discussion is primarily theoretical but we draw on the case of global anti-money laundering regulation to illustrate our arguments and for inspirations of how to further elaborate the approach
Second-line agents in myositis: 1-year factorial trial of additional immunosuppression in patients who have partially responded to steroids.
Ciclosporin and MTX are used in idiopathic inflammatory myopathies (DM and PM) when patients incompletely respond to glucocorticoids. Their effectiveness is unproved in randomized controlled trials (RCTs). We evaluated their benefits in a placebo-controlled factorial RCT
Instrumentation-related uncertainty of reflectance and transmittance measurements with a two-channel spectrophotometer
Spectrophotometers are operated in numerous fields of science and industry for a variety of applications. In order to provide confidence for the measured data, analyzing the associated uncertainty is valuable. However, the uncertainty of the measurement results is often unknown or reduced to sample-related contributions. In this paper, we describe our approach for the systematic determination of the measurement uncertainty of the commercially available two-channel spectrophotometer Agilent Cary 5000 in accordance with the Guide to the expression of uncertainty in measurements. We focus on the instrumentation-related uncertainty contributions rather than the specific application and thus outline a general procedure which can be adapted for other instruments. Moreover, we discover a systematic signal deviation due to the inertia of the measurement amplifier and develop and apply a correction procedure. Thereby we increase the usable dynamic range of the instrument by more than one order of magnitude. We present methods for the quantification of the uncertainty contributions and combine them into an uncertainty budget for the device. © 2017 Author(s)
Reference Distorted Prices
I show that when consumers (mis)perceive prices relative to reference prices,
budgets turn out to be soft, prices tend to be lower and the average quality of
goods sold decreases. These observations provide explanations for decentralized
purchase decisions, for people being happy with a purchase even when they have
paid their evaluation, and for why trade might affect high quality local firms
'unfairly'
Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
Constraint programming is a paradigm wherein relations between variables are
stated in the form of constraints. Many real life problems come from uncertain and dynamic
environments, where the initial constraints and domains may change during its execution.
Thus, the solution found for the problem may become invalid. The search forrobustsolutions
for constraint satisfaction problems (CSPs) has become an important issue in the Âżeld of
constraint programming. In some cases, there exists knowledge about the uncertain and
dynamic environment. In other cases, this information is unknown or hard to obtain. In
this paper, we consider CSPs with discrete and ordered domains where changes only involve
restrictions or expansions of domains or constraints. To this end, we model CSPs as weighted
CSPs (WCSPs) by assigning weights to each valid tuple of the problem constraints and
domains. The weight of each valid tuple is based on its distance from the borders of the
space of valid tuples in the corresponding constraint/domain. This distance is estimated by
a new concept introduced in this paper: coverings. Thus, the best solution for the modeled
WCSP can be considered as a most robust solution for the original CSP according to these
assumptionsThis work has been partially supported by the research projects TIN2010-20976-C02-01 (Min. de Ciencia e Innovacion, Spain) and P19/08 (Min. de Fomento, Spain-FEDER), and the fellowship program FPU.Climent AunĂ©s, LI.; Wallace, RJ.; Salido Gregorio, MA.; Barber SanchĂs, F. (2013). Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings. Artificial Intelligence Review. 1-26. https://doi.org/10.1007/s10462-013-9420-0S126Climent L, Salido M, Barber F (2011) Reformulating dynamic linear constraint satisfaction problems as weighted csps for searching robust solutions. In: Ninth symposium of abstraction, reformulation, and approximation (SARA-11), pp 34â41Dechter R, Dechter A (1988) Belief maintenance in dynamic constraint networks. In: Proceedings of the 7th national conference on, artificial intelligence (AAAI-88), pp 37â42Dechter R, Meiri I, Pearl J (1991) Temporal constraint networks. Artif Intell 49(1):61â95Fargier H, Lang J (1993) Uncertainty in constraint satisfaction problems: a probabilistic approach. In: Proceedings of the symbolic and quantitative approaches to reasoning and uncertainty (EC-SQARU-93), pp 97â104Fargier H, Lang J, Schiex T (1996) Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge. In: Proceedings of the 13th national conference on, artificial intelligence, pp 175â180Fowler D, Brown K (2000) Branching constraint satisfaction problems for solutions robust under likely changes. In: Proceedings of the international conference on principles and practice of constraint programming (CP-2000), pp 500â504Goles E, MartĂnez S (1990) Neural and automata networks: dynamical behavior and applications. Kluwer Academic Publishers, DordrechtHays W (1973) Statistics for the social sciences, vol 410, 2nd edn. Holt, Rinehart and Winston, New YorkHebrard E (2006) Robust solutions for constraint satisfaction and optimisation under uncertainty. PhD thesis, University of New South WalesHerrmann H, Schneider C, Moreira A, Andrade Jr J, Havlin S (2011) Onion-like network topology enhances robustness against malicious attacks. J Stat Mech Theory Exp 2011(1):P01,027Larrosa J, Schiex T (2004) Solving weighted CSP by maintaining arc consistency. Artif Intell 159:1â26Larrosa J, Meseguer P, Schiex T (1999) Maintaining reversible DAC for Max-CSP. J Artif Intell 107(1):149â163Mackworth A (1977) On reading sketch maps. In: Proceedings of IJCAIâ77, pp 598â606Sam J (1995) Constraint consistency techniques for continuous domains. These de doctorat, Ăcole polytechnique fĂ©dĂ©rale de LausanneSchiex T, Fargier H, Verfaillie G (1995) Valued constraint satisfaction problems: hard and easy problems. In: Proceedings of the 14th international joint conference on, artificial intelligence (IJCAI-95), pp 631â637Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278â285Verfaillie G, Jussien N (2005) Constraint solving in uncertain and dynamic environments: a survey. Constraints 10(3):253â281Wallace R, Freuder E (1998) Stable solutions for dynamic constraint satisfaction problems. In: Proceedings of the 4th international conference on principles and practice of constraint programming (CP-98), pp 447â461Wallace RJ, Grimes D (2010) Problem-structure versus solution-based methods for solving dynamic constraint satisfaction problems. In: Proceedings of the 22nd international conference on tools with artificial intelligence (ICTAI-10), IEEEWalsh T (2002) Stochastic constraint programming. In: Proceedings of the 15th European conference on, artificial intelligence (ECAI-02), pp 111â115William F (2006) Topology and its applications. Wiley, New YorkWiner B (1971) Statistical principles in experimental design, 2nd edn. McGraw-Hill, New YorkYorke-Smith N, Gervet C (2009) Certainty closure: reliable constraint reasoning with incomplete or erroneous data. J ACM Trans Comput Log (TOCL) 10(1):
Development of intuitive rules: Evaluating the application of the dual-system framework to understanding children's intuitive reasoning
This is an author-created version of this article. The original source of publication is Psychon Bull Rev. 2006 Dec;13(6):935-53
The final publication is available at www.springerlink.com
Published version: http://dx.doi.org/10.3758/BF0321390
The Eliza effect and its dangers: from demystification to gender critique
This essay provides a gender critique of the Eliza effect. It delineates the way in which the Eliza effect is operationalised in AI research even as it is ostensibly demystified, for example in the writings of Douglas Hofstadter and Joseph Weizenbaum. It then exposes the gendered assumptions embedded in the nomenclature used to name this misperception of the computer as having capabilities equivalent to the human. It traces the genealogy of that nomenclature back through Weizenbaumâs ELIZA, to George Bernard Shawâs Pygmalion. A close reading of the play is deployed in order to reveal the structural inequities of gender, class, and who or what gets to be human, that are both explored in the play and encoded in the operation and operationalisations of the Eliza effect. It concludes by attending to that operation and operationalisation in relation to todayâs Virtual Personal Assistantâs, and makes a case for the importance of critique in order to expose the inequitable structures of power obscured and compounded by the Eliza effect â both its name, and that which it names
- âŠ