Weak epitaxy growth affording high-mobility thin films of disk-like organic semiconductors

Thin films of phthalocyanine compounds show weak epitaxial growth on a monodomain film of a rod-like molecule (see figure). The resulting organic electronic devices exhibit high charge carrier mobilities close to those of the single-crystal devices.

A bioaugmentation failure caused by phage infection and weak biofilm formation ability

Two biological aerated filters (BAF) were setup for ammonia removal treatment of the circulation water in a marine aquaculture. One of the BAFs was bioaugmented with a heterotrophic nitrifying bacterium, Lutimonas sp. H10, where the ammonia removal was not improved and the massive inoculation was even followed by a nitrification breakdown from day 9 to 18. The nitrification was remained stable in control BAF operated under the same conditions. Fluorescent in situ hybridization (FISH) with rRNA-targeted probes and cultivable method revealed that Lutimonas sp. H10 almost disappeared from the bioaugomented BAF within 3 d, and this was mainly due to the infection of a specific phage as revealed by flask experiment, plaque assay and transmission electron observation. Analyses of 16S rRNA gene libraries showed that bacterial groups from two reactors evolved differently and an overgrowth of protozoa was observed in the bioaugmented BAR Therefore, phage infection and poor biofilm forming ability of the inoculated strain are the main reasons for bioaugmentation failure. In addition, gazing by protozoa of the bacteria might be the reason for the nitrification breakdown in bioaugmented BAF during day 9-18.

3D Pose from Three Corresponding Points Under Weak-Perspective Projection

Model-based object recognition commonly involves using a minimal set of matched model and image points to compute the pose of the model in image coordinates. Furthermore, recognition systems often rely on the "weak-perspective" imaging model in place of the perspective imaging model. This paper discusses computing the pose of a model from three corresponding points under weak-perspective projection. A new solution to the problem is proposed which, like previous solutins, involves solving a biquadratic equation. Here the biquadratic is motivate geometrically and its solutions, comprised of an actual and a false solution, are interpreted graphically. The final equations take a new form, which lead to a simple expression for the image position of any unmatched model point.

Direct synthesis of highly ordered Fe-SBA-15 mesoporous materials under weak acidic conditions

Iron-substituted SBA-15 (Fe-SBA-15) materials have been synthesized via a simple direct hydrothermal method under weak acidic conditions. The powder X-ray diffraction (XRD), NZ sorption and transmission electron microscopy (TEM) characterizations show that the resultant materials have well-ordered hexagonal meso-structures. The diffused reflectance UV-vis and UV resonance Raman spectroscopy characterizations show that most of the iron ions exist as isolated framework species for calcined materials when the Fe/Si molar ratios are below 0.01 in the gel. The presence of iron species also has significant salt effects that can greatly improve the ordering of the mesoporous structure. Different iron species including isolated framework iron species, extraframework iron clusters and iron oxides are formed selectively by adjusting the pH values of the synthesis solutions and Fe/Si molar ratios. (c) 2005 Elsevier Inc. All rights reserved.

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.

A Formal Semantics for Weak References

A weak reference is a reference to an object that is not followed by the pointer tracer when garbage collection is called. That is, a weak reference cannot prevent the object it references from being garbage collected. Weak references remain a troublesome programming feature largely because there is not an accepted, precise semantics that describes their behavior (in fact, we are not aware of any formalization of their semantics). The trouble is that weak references allow reachable objects to be garbage collected, therefore allowing garbage collection to influence the result of a program. Despite this difficulty, weak references continue to be used in practice for reasons related to efficient storage management, and are included in many popular programming languages (Standard ML, Haskell, OCaml, and Java). We give a formal semantics for a calculus called λweak that includes weak references and is derived from Morrisett, Felleisen, and Harper’s λgc. λgc formalizes the notion of garbage collection by means of a rewrite rule. Such a formalization is required to precisely characterize the semantics of weak references. However, the inclusion of a garbage-collection rewrite-rule in a language with weak references introduces non-deterministic evaluation, even if the parameter-passing mechanism is deterministic (call-by-value in our case). This raises the question of confluence for our rewrite system. We discuss natural restrictions under which our rewrite system is confluent, thus guaranteeing uniqueness of program result. We define conditions that allow other garbage collection algorithms to co-exist with our semantics of weak references. We also introduce a polymorphic type system to prove the absence of erroneous program behavior (i.e., the absence of “stuck evaluation”) and a corresponding type inference algorithm. We prove the type system sound and the inference algorithm sound and complete.

Towards Formalizing Java's Weak References

Weak references provide the programmer with limited control over the process of memory management. By using them, a programmer can make decisions based on previous actions that are taken by the garbage collector. Although this is often helpful, the outcome of a program using weak references is less predictable due to the nondeterminism they introduce in program evaluation. It is therefore desirable to have a framework of formal tools to reason about weak references and programs that use them. We present several calculi that formalize various aspects of weak references, inspired by their implementation in Java. We provide a calculus to model multiple levels of non-strong references, where a different garbage collection policy is applied to each level. We consider different collection policies such as eager collection and lazy collection. Similar to the way they are implemented in Java, we give the semantics of eager collection to weak references and the semantics of lazy collection to soft references. Moreover, we condition garbage collection on the availability of time and space resources. While time constraints are used in order to restrict garbage collection, space constraints are used in order to trigger it. Finalizers are a problematic feature in Java, especially when they interact with weak references. We provide a calculus to model finalizer evaluation. Since finalizers have little meaning in a language without side-effect, we introduce a limited form of side effect into the calculus. We discuss determinism and the separate notion of uniqueness of (evaluation) outcome. We show that in our calculus, finalizer evaluation does not affect uniqueness of outcome.