Some Considerations on a Calculus with Weak References

Weak references are references that do not prevent the object they point to from being garbage collected. Most realistic languages, including Java, SML/NJ, and OCaml to name a few, have some facility for programming with weak references. Weak references are used in implementing idioms like memoizing functions and hash-consing in order to avoid potential memory leaks. However, the semantics of weak references in many languages are not clearly specified. Without a formal semantics for weak references it becomes impossible to prove the correctness of implementations making use of this feature. Previous work by Hallett and Kfoury extends λgc, a language for modeling garbage collection, to λweak, a similar language with weak references. Using this previously formalized semantics for weak references, we consider two issues related to well-behavedness of programs. Firstly, we provide a new, simpler proof of the well-behavedness of the syntactically restricted fragment of λweak defined previously. Secondly, we give a natural semantic criterion for well-behavedness much broader than the syntactic restriction, which is useful as principle for programming with weak references. Furthermore we extend the result, proved in previously of λgc, which allows one to use type-inference to collect some reachable objects that are never used. We prove that this result holds of our language, and we extend this result to allow the collection of weakly-referenced reachable garbage without incurring the computational overhead sometimes associated with collecting weak bindings (e.g. the need to recompute a memoized function). Lastly we use extend the semantic framework to model the key/value weak references found in Haskell and we prove the Haskell is semantics equivalent to a simpler semantics due to the lack of side-effects in our language.

Measurement of the differential cross section for the reaction gamman-->pi- p from deuterium.

We report a measurement of the differential cross section for the gamman-->pi- p process from the CLAS detector at Jefferson Laboratory in Hall B for photon energies between 1.0 and 3.5 GeV and pion center-of-mass (c.m.) angles (thetac.m.) between 50 degrees and 115 degrees. We confirm a previous indication of a broad enhancement around a c.m. energy ([sqrt]s) of 2.1 GeV at thetac.m.=90 degrees in the scaled differential cross section s7dsigma/dt and a rapid falloff in a center-of-mass energy region of about 400 MeV following the enhancement. Our data show an angular dependence of this enhancement as the suggested scaling region is approached for thetac.m. from 70 degrees to 105 degrees.

Ligation of cell surface GRP78 with antibody directed against the COOH-terminal domain of GRP78 suppresses Ras/MAPK and PI 3-kinase/AKT signaling while promoting caspase activation in human prostate cancer cells.

We have previously shown that treatment of prostate cancer and melanoma cells expressing GRP78 on their cell surface with antibody directed against the COOH-terminal domain of GRP78 upregulates and activates p53 causing decreased cell proliferation and upregulated apoptosis. In this report, we demonstrate that treatment of 1-LN prostate cancer cells with this antibody decreases cell surface expression of GRP78, Akt(Thr308) and Akt(Ser473) kinase activities and reduces phosphorylation of FOXO, and GSK3beta. This treatment also suppresses activation of ERK1/2, p38 MAPK and MKK3/6; however, it upregulates MKK4 activity. JNK, as determined by its phosphorylation state, is subsequently activated, triggering apoptosis. Incubation of cells with antibody reduced levels of anti-apoptotic Bcl-2, while elevating pro-apoptotic BAD, BAX and BAK expression as well as cleaved caspases-3, -7, -8 and -9. Silencing GRP78 or p53 gene expression by RNAi prior to antibody treatment abrogated these effects. We conclude that antibody directed against the COOH-terminal domain of GRP78 may prove useful as a pan suppressor of proliferative/survival signaling in cancer cells expressing GRP78 on their cell surface.

Experiencias sobre la aproximación intuitiva en geometría. Una aproximación al número Pi en la ESO

En este artículo se presentan algunas experiencias sobre la aproximación intuitiva en geometría y sus implicaciones en el cálculo aproximado del número pi en la ESO. El proceso se gradúa en torno a cuatro actividades. En las dos primeras se aproxima experimentalmente el número Pi y se pretende descubrir el grado de móviles de los alumnos para enfrentarse, desde el punto de vista intuitivo, a los procesos geométricos de aproximación. En las dos últimas se hace una estimación de Pi, en un caso encontrando una secuencia de números irracionales convergente a ese número, y el otro, a partir de una simplificación del método utilizado por Arquímedes, que permite además dar una demostración diferente de la habitual.

Las cifras de pi y el diálogo en el aula

A partir de un artículo publicado en el Faro de Vigo sobre la petisa Wislawa Szymbirska, Premio Nobel de Literatura, en el que se reproduce su poema el número pi se lleva a cabo una experiencia interdisciplinar con el departamento de lengua y literatura, cuya descripción es el objeto de este trabajo.

En el entorno de pi a través de la sección áurea

Mencionados en la relaciones fortuitas o accidentales entre pi y la sección aurea en los textos de autores se supone gran interés una nueva conexión entre ambas constantes que permitirá una aproximación a pi con un desfase de 100 milésimas, en una primera relación, y una segunda aproximación con un desfase de 1000 millonesimas.

El sorprendente número pi

Parece increíble que algo aparentemente tan sencillo como la relación entre la longitud de la circunferencia y su diámetro haya preocupado al hombre desde la más remota antigüedad hasta el presente más actual. A unos, porque han querido aprender sus cifras de memoria y, a otros, porque han querido conocer todas sus cifras con exactitud, lo cierto es que siempre el número pi ha estado presente en el pensamiento de la especie humana.

Kappa calculus and evidential strength: A note on Åqvist's logical theory of legal evidence

Lennart Åqvist (1992) proposed a logical theory of legal evidence, based on the Bolding-Ekelöf of degrees of evidential strength. This paper reformulates Åqvist's model in terms of the probabilistic version of the kappa calculus. Proving its acceptability in the legal context is beyond the present scope, but the epistemological debate about Bayesian Law isclearly relevant. While the present model is a possible link to that lineof inquiry, we offer some considerations about the broader picture of thepotential of AI & Law in the evidentiary context. Whereas probabilisticreasoning is well-researched in AI, calculations about the threshold ofpersuasion in litigation, whatever their value, are just the tip of theiceberg. The bulk of the modeling desiderata is arguably elsewhere, if one isto ideally make the most of AI's distinctive contribution as envisaged forlegal evidence research.

A class of generalized Lévy Laplacians in infinite dimensional calculus

A class of generalized Lévy Laplacians which contain as a special case the ordinary Lévy Laplacian are considered. Topics such as limit average of the second order functional derivative with respect to a certain equally dense (uniformly bounded) orthonormal base, the relations with Kuo’s Fourier transform and other infinite dimensional Laplacians are studied.

[Performance review] Carl Djerassi, Calculus

Review of a semi-staged performance of Calculus by Carl Djerassi at the Royal Institution, London on 30 September 2002.

Components of the peptidome and transcriptome persist in lin wa pi: the dried skin of the Heilongjiang brown frog Rana amurensis as used in Traditional Chinese Medicine

Although the ancient practice of traditional Chinese medicine (TCM) utilizes predominantly herbal ingredients, many of which are now the subject of intense scientific scrutiny, significant quantities of animal tissue-derived materials are also employed. Here we have used contemporary molecular techniques to study the material known as lin wa pi, the dried skin of the Heilongjiang brown frog, Rana amurensis, that is used commonly as an ingredient of many medicines, as a general tonic and as a topical antimicrobial/wound dressing. Using a simple technology that has been developed and validated over several years, we have demonstrated that components of both the skin granular gland peptidome and transcriptome persist in this material. Interrogation of the cDNA library constructed from the dried skin by entrapment and amplification of polyadenylated mRNA, using a "shotgun" primer approach and 3'-RACE, resulted in the cloning of cDNAs encoding the precursors of five putative antimicrobial peptides. Two (ranatuerin-2AMa and ranatuerin-2AMb) were obvious homologs of a previously described frog skin peptide family, whereas the remaining three were of sufficient structural novelty to be named amurins 1-3. Mature peptides were each identified in reverse phase HPLC fractions of boiling water extracts of skin and their structures confirmed by MS/MS fragmentation sequencing. Components of traditional Chinese medicines of animal tissue origin may thus contain biologically active peptides that survive the preparation procedures and that may contribute to therapeutic efficacy.

Assignment methods for incidence calculus

Incidence calculus is a mechanism for probabilistic reasoning in which sets of possible worlds, called incidences, are associated with axioms, and probabilities are then associated with these sets. Inference rules are used to deduce bounds on the incidence of formulae which are not axioms, and bounds for the probability of such a formula can then be obtained. In practice an assignment of probabilities directly to axioms may be given, and it is then necessary to find an assignment of incidence which will reproduce these probabilities. We show that this task of assigning incidences can be viewed as a tree searching problem, and two techniques for performing this research are discussed. One of these is a new proposal involving a depth first search, while the other incorporates a random element. A Prolog implementation of these methods has been developed. The two approaches are compared for efficiency and the significance of their results are discussed. Finally we discuss a new proposal for applying techniques from linear programming to incidence calculus.

A comprehensive comparison between generalized incidence calculus and Dempster-Shafer theory of evidence.

Dealing with uncertainty problems in intelligent systems has attracted a lot of attention in the AI community. Quite a few techniques have been proposed. Among them, the Dempster-Shafer theory of evidence (DS theory) has been widely appreciated. In DS theory, Dempster's combination rule plays a major role. However, it has been pointed out that the application domains of the rule are rather limited and the application of the theory sometimes gives unexpected results. We have previously explored the problem with Dempster's combination rule and proposed an alternative combination mechanism in generalized incidence calculus. In this paper we give a comprehensive comparison between generalized incidence calculus and the Dempster-Shafer theory of evidence. We first prove that these two theories have the same ability in representing evidence and combining DS-independent evidence. We then show that the new approach can deal with some dependent situations while Dempster's combination rule cannot. Various examples in the paper show the ways of using generalized incidence calculus in expert systems.