A preliminary discussion on the bio-metallogenesis of Tl deposits in the low-temperature minerogenetic province of southwestern China

Starting with the research status of bio-metallogenesis of Tl deposits and their geology, this work deals with the geological background of Tl enrichment and mineralization and the mechanism of bio- metal-logenesis of Tl deposits, as exemplified by Tl deposits in the low-temperature minerogenetic province. This research on the bio-metallogenesis of Tl deposits is focused on the correlations between bio-enrichment and Tl, the enrichment of Tl in micro-paleo-animals in rocks and ores, bio-fossil casts in Tl-rich ores, the involvement of bio-sulfur in minerogenesis and the enrichment of bio-genetic organic carbon in Tl ores. Thallium deposits have experienced two ore-forming stages: syngenetic bio- en-richment and epigenetic hydrothermal reworking (or transformation). Owing to the intense epigenetic hydrothermal reworking, almost no bio-residues remain in syngenetically bio-enriched Tl ores, thereby the Tl deposits display the characteristics of hydrothermally reoworked deposits.

Delegation, Arbitration and High-Level Service Discovery as Key Elements of a Software Infrastructure for Pervasive Computing

The dream of pervasive computing is slowly becoming a reality. A number of projects around the world are constantly contributing ideas and solutions that are bound to change the way we interact with our environments and with one another. An essential component of the future is a software infrastructure that is capable of supporting interactions on scales ranging from a single physical space to intercontinental collaborations. Such infrastructure must help applications adapt to very diverse environments and must protect people's privacy and respect their personal preferences. In this paper we indicate a number of limitations present in the software infrastructures proposed so far (including our previous work). We then describe the framework for building an infrastructure that satisfies the abovementioned criteria. This framework hinges on the concepts of delegation, arbitration and high-level service discovery. Components of our own implementation of such an infrastructure are presented.

TYPICAL: A Knowledge Representation System for Automated Discovery and Inference

TYPICAL is a package for describing and making automatic inferences about a broad class of SCHEME predicate functions. These functions, called types following popular usage, delineate classes of primitive SCHEME objects, composite data structures, and abstract descriptions. TYPICAL types are generated by an extensible combinator language from either existing types or primitive terminals. These generated types are located in a lattice of predicate subsumption which captures necessary entailment between types; if satisfaction of one type necessarily entail satisfaction of another, the first type is below the second in the lattice. The inferences make by TYPICAL computes the position of the new definition within the lattice and establishes it there. This information is then accessible to both later inferences and other programs (reasoning systems, code analyzers, etc) which may need the information for their own purposes. TYPICAL was developed as a representation language for the discovery program Cyrano; particular examples are given of TYPICAL's application in the Cyrano program.

On Genetic Programming and Knowledge Discovery in Transcriptome

Rowland, J. J. (2004) On Genetic Programming and Knowledge Discovery in Transcriptome Data. Proc. IEEE Congress on Evolutionary Computation, Portland, Oregon. pp 158-165. ISBN 0-7803-8515-2

The acquisition of phonology in a dynamical model of human information processing: a preliminary account

The problem of the acquisition of first language phonology is dealt with within the general information-processing perspective. In this sense, language acquisition is viewed as a process of biologically founded pattern formation due to information exchanges between an adult and a child. Moreover, the process is cognitive in that the child, as a goal-seeking and error correcting individual, undertakes an intricate task of compressing a huge variety of linguistic stimuli in order to build an effective information code. It is further assumed that the basic mechanism which leads to the establishment of fully articulate linguistic ability is that of simulation. The mechanism works through a compression of a set of initial variables (i.e. initial conditions) into a minimum length algorithm and a subsequent construction of an integrated system of language-specific attractors. It is only then that the language user is capable of participating in an information transaction in a fully developed manner.

Some preliminary conjunctural thoughts on countercultures

The article is devoted to analysis of various countercultures aspects. The Author hypothesizes that the forms of contemporary politics are the result of two fundamentally interrelated strategic vectors. First is built upon a politics of ressentiment, setting “ordinary” folks against the socio‐cultural elite which constututed to the “new right” movement. Second vector is originated of counterculture of the 1960s. The author states that counterculture exists without a singular identity. It is a space of hybridity and heterogenity. On the other hand counterculture is related to the concept of contemporary ambivalence as well it transforms of affective experience of everyday life. Another feature of counterculture is connected with the conviction that counterculture stands against of dominant culture. Also the author puts counterculture movements against various aspects of new american modernity including reconstruction of the practice of the hegemony, as well as through popular culture and reconstruction of the „left” and „right” idelogy and practice.

Typability and Type Checking in the Second-Order Λ-Calculus Are Equivalent and Undecidable (Preliminary Draft)

We consider the problems of typability[1] and type checking[2] in the Girard/Reynolds second-order polymorphic typed λ-calculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pure λ -terms. These problems have been considered and proven to be decidable or undecidable for various restrictions and extensions of System F and other related systems, and lower-bound complexity results for System F have been achieved, but they have remained "embarrassing open problems"[3] for System F itself. We first prove that type checking in System F is undecidable by a reduction from semi-unification. We then prove typability in System F is undecidable by a reduction from type checking. Since the reverse reduction is already known, this implies the two problems are equivalent. The second reduction uses a novel method of constructing λ-terms such that in all type derivations, specific bound variables must always be assigned a specific type. Using this technique, we can require that specific subterms must be typable using a specific, fixed type assignment in order for the entire term to be typable at all. Any desired type assignment may be simulated. We develop this method, which we call "constants for free", for both the λK and λI calculi.