On the ontological expressiveness of information systems analysis and design grammars

Abstract. Information systems analysis and design (ISAD) methodologies provide facilities for describing existing or conceived real-world systems. These facilities are ontologically expressive if they are capable of describing all real-world phenomena completely and clearly. In this paper we formally examine the notion of the ontological expressiveness of a grammar and discuss some of its implications for the design and use of ISAD methodologies. We identify some generic ways in which ontological expressiveness may be undermined in a grammar and some potential consequences of these violations. We also examine ontological expressiveness within the context of some other desirable features that might be considered in the design of ISAD methodologies.     

Competitive learning and soft competition for vector quantizerdesign

The authors provide a convergence analysis for the Kohonen learning algorithm (KLA) with respect to vector quantizer (VQ) optimality criteria and introduce a stochastic relaxation technique which produces the global minimum but is computationally expensive. By incorporating the principles of the stochastic approach into the KLA, a deterministic VQ design algorithm, the soft competition scheme (SCS), is introduced. Experimental results are presented where the SCS consistently provided better codebooks than the generalized Lloyd algorithm (GLA), even when the same computation time was used for both algorithms. The SCS may therefore prove to be a valuable alternative to the GLA for VQ design     

Photoswitching of Ferroelectric Liquid Crystals Using Unsymmetrical Chiral Thioindigo Dopants: Photoinduced Inversion of the Sign of Spontaneous Polarization

A new unsymmetrical chiral thioindigo dopant 6‐[(R,R)‐2,3‐difluorooct‐1‐yloxy]‐5′‐nitro‐6′‐[(R)‐2‐octyloxy]thioindigo ( 4 ) designed to photoinvert the sign of spontaneous polarization (P_S) in a ferroelectric chiral smectic C (SmC*) liquid crystal was prepared using a synthetic approach previously developed in our laboratory. In this new “ambidextrous” design, the (R)‐2‐octyloxy side‐chain is sterically coupled to the thioindigo core and induces a positive P_S, whereas the (R,R)‐2,3‐difluorooctyloxy side‐chain is decoupled from the core and induces a larger negative P_S. In the trans form, this dopant induces a negative polarization in the SmC host (+)‐4‐(4‐methylhexyloxy)phenyl 4‐decyloxybenzoate ( PhB ). Irradiation of a 1 mol‐% mixture of 4 in PhB at λ = 510 nm caused a sign inversion of P_S, from –0.88 to +0.42 nC cm^–2 at T – T_C = –5 °C, which is consistent with an increase in the polarization power of the coupled 2‐octyloxy/thioindigo unit over that of the 2,3‐difluorooctyloxy unit, due to the increase in transverse dipole moment of the thioindigo core upon trans–cis photoisomerization. The P_S sign inversion was confirmed by a surface‐stabilized ferroelectric liquid crystal photoswitching experiment. Spectroscopic measurements on films of the doped liquid crystal mixtures showed that trans–cis photoisomerization is gradually suppressed with increasing dopant mole fraction, possibly as a result of increased dopant aggregation.     

The VLISP verified PreScheme compiler

This paper describes a verified compiler for PreScheme, the implementation language for thevlisp run-time system. The compiler and proof were divided into three parts: A transformational front end that translates source text into a core language, a syntax-directed compiler that translates the core language into a combinator-based tree-manipulation language, and a linearizer that translates combinator code into code for an abstract stored-program machine with linear memory for both data and code. This factorization enabled different proof techniques to be used for the different phases of the compiler, and also allowed the generation of good code. Finally, the whole process was made possible by carefully defining the semantics ofvlisp PreScheme rather than just adopting Scheme's. We believe that the architecture of the compiler and its correctness proof can easily be applied to compilers for languages other than PreScheme.This work was supported by Rome Laboratory of the United States Air Force, contract No. F19628-89-C-0001, through the MITRE Corporation, and by NSF and DARPA under NSF grants CCR-9002253 and CCR-9014603. Author's current address: Department of Computer Science and Engineering, Oregon Graduate Institute, P.O. Box 91000, Portland, OR 97291-1000.The work reported here was supported by Rome Laboratory of the United States Air Force, contract No. F19628-89-C-0001. Preparation of this paper was generously supported by The MITRE Corporation.This work was supported by Rome Laboratory of the United States Air Force, contract No. F19628-89-C-0001, through the MITRE Corporation, and by NSF and DARPA under NSF grants CCR-9002253 and CCR-9014603.     

The pulse distributed file system

A network of powerful personal computers, linked by a high-speed local area network, is being seen increasingly as an alternative to a traditional centralized time-sharing operating system. The PULSE project is investigating how such a system may be constructed to give the benefits of a self-sufficient personal computer to each user without losing the facilities for communication and sharing of data inherent in centralized systems. In particular, a distributed file system has been built which provides a single global UNIX

1 UNIX is a trademark of Bell Laboratories.

-like hierarchy, with a consistent appearance when accessed from any machine. Replicated copies of files are maintained to improve reliability, increase performance, and enable each machine to run stand-alone, albeit with reduced facilities.     

Fusing distributional and experiential information for measuring semantic relatedness

Models of semantic relatedness have usually focused on language-based distributional information without taking into account “experiential data” concerning the embodied sensorial source of the represented concepts. In this paper, we present an integrative cognitive model of semantic relatedness. The model – semantic family resemblance – uses a variation of the co-product as a mathematical structure that guides the fusion of distributional and experiential information. Our algorithm provides superior results in a set expansion task and a significant correlation with two benchmarks of human rated word-pair similarity datasets.     

Processing and interactive editing of huge point clouds from 3D scanners

This paper describes a new out-of-core multi-resolution data structure for real-time visualization, interactive editing and externally efficient processing of large point clouds. We describe an editing system that makes use of the novel data structure to provide interactive editing and preprocessing tools for large scanner data sets. Using the new data structure, we provide a complete tool chain for 3D scanner data processing, from data preprocessing and filtering to manual touch-up and real-time visualization. In particular, we describe an out-of-core outlier removal and bilateral geometry filtering algorithm, a toolset for interactive selection, painting, transformation, and filtering of huge out-of-core point-cloud data sets and a real-time rendering algorithm, which all use the same data structure as storage backend. The interactive tools work in real-time for small model modifications. For large scale editing operations, we employ a two-resolution approach where editing is planned in real-time and executed in an externally efficient offline computation afterwards. We evaluate our implementation on example data sets of sizes up to 63 GB, demonstrating that the proposed technique can be used effectively in real-world applications.     

Accuracy and efficacy of chest radiography in the intensive care unit

264 patients with cancer of larynx, 21 female and 234 male, had a testosterone and sex hormone binding globulin (SHBG) before the treatment in serum estimated. Because of dependence of levels of hormones the group of patients was divided into three following groups: "lower than standard", "standard", "higher than standard". The correlation between these groups and sex, age, localization of tumor, organs' advances, stage of morphological malignancy and type of cancer was reported. Anomalous values of testosterone were in male group more frequently reported. Anomalous values of SHBG were similar in male and female groups, but in the female group there was a significant majority of "lower than standard" values reported. The majority of abnormal values of testosterone and SHBG was described in groups of age higher than 50 years. There were no differences in testosterone and SHBG levels in different localization of tumors in larynx. In advanced stage T3 and T4 there were more frequent lower mean values of testosterone levels and higher values of SHBG levels in comparison to T2 stages. In tumors in G1 and G2 stages of histological malignancy higher levels of SHBG and higher mean levels of testosterone. The tumors in stage G3 the hormone levels were lowers were observed. The levels of SHBG in groups of carcinoma planoepitheliale keratodes were in 66% higher than in a group of carcinoma planoepitheliale akeratodes but in both groups the levels of testosterone were nearing the same. In group of patients with larynx cancer the negative correlation between the levels of testosterone and SHBG was not observed. Higher SHBG levels were not always accompanied by lower testosterone levels.     

Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks

This paper presents the first hierarchical Byzantine fault-tolerant replication architecture suitable to systems that span multiple wide-area sites. The architecture confines the effects of any malicious replica to its local site, reduces message complexity of wide-area communication, and allows read-only queries to be performed locally within a site for the price of additional standard hardware. We present proofs that our algorithm provides safety and liveness properties. A prototype implementation is evaluated over several network topologies and is compared with a flat Byzantine fault-tolerant approach. The experimental results show considerable improvement over flat Byzantine replication algorithms, bringing the performance of Byzantine replication closer to existing benign fault-tolerant replication techniques over wide area networks.     

User assisted separation of reflections from a single image using a sparsity prior

When we take a picture through transparent glass the image we obtain is often a linear superposition of two images: the image of the scene beyond the glass plus the image of the scene reflected by the glass. Decomposing the single input image into two images is a massively ill-posed problem: in the absence of additional knowledge about the scene being viewed there are an infinite number of valid decompositions. In this paper we focus on an easier problem: user assisted separation in which the user interactively labels a small number of gradients as belonging to one of the layers. Even given labels on part of the gradients, the problem is still ill-posed and additional prior knowledge is needed. Following recent results on the statistics of natural images we use a sparsity prior over derivative filters. This sparsity prior is optimized using the terative reweighted least squares (IRLS) approach. Our results show that using a prior derived from the statistics of natural images gives a far superior performance compared to a Gaussian prior and it enables good separations from a modest number of labeled gradients.