Quantitative structure-property relationship studies on n-octanol/water partitioning coefficients of PCDD/Fs

Based on some fundamental quantum chemical descriptors computed by PM3 Hamiltonian, by the use of partial least-squares (PLS) analysis, a significant quantitative structure-property relationship (QSPR) model for logK(ow) of polychlorinated dibenzo-p-dioxins and dibenzo-p-furans (PCDD/Fs) was obtained. The QSPR can be used for prediction. The intermolecular dispersive interactions and thus the bulkness of the PCDD/Fs are the main factors affecting the logK(ow). The more chlorines in the PCDD/F molecule, the greater the logK(ow) values. (C) 2001 Elsevier Science Ltd. All rights reserved.

A differential recursive scheme for suppression of Peak to average power ratio for OFDM

A differential recursive scheme for suppression of Peak to average power ratio (PAPR) for Orthogonal frequency division multiplexing (OFDM) signal is proposed in this thesis. The pseudo-randomized modulating vector for the subcarrier series is differentially phase-encoded between successive components in frequency domain first, and recursion manipulates several samples of Inverse fast Fourier transformation (IFFT) output in time domain. Theoretical analysis and experimental result exhibit advantage of differential recursive scheme over direct output scheme in PAPR suppression. And the overall block diagram of the scheme is also given.

The Category-Theoretic Solution of Recursive Domain Equations

Recursive specifications of domains plays a crucial role in denotational semantics as developed by Scott and Strachey and their followers. The purpose of the present paper is to set up a categorical framework in which the known techniques for solving these equations find a natural place. The idea is to follow the well-known analogy between partial orders and categories, generalizing from least fixed-points of continuous functions over cpos to initial ones of continuous functors over $\omega $-categories. To apply these general ideas we introduce Wand's ${\bf O}$-categories where the morphism-sets have a partial order structure and which include almost all the categories occurring in semantics. The idea is to find solutions in a derived category of embeddings and we give order-theoretic conditions which are easy to verify and which imply the needed categorical ones. The main tool is a very general form of the limit-colimit coincidence remarked by Scott. In the concluding section we outline how compatibility considerations are to be included in the framework. A future paper will show how Scott's universal domain method can be included too.

facilitating formal specification acquisition by using recursive functions on context-free languages

Although formal specification techniques are very useful in software development, the acquisition of formal specifications is a difficult task. This paper presents the formal specification language LFC, which is designed to facilitate the acquisition and validation of formal specifications. LFC uses context-free languages for syntactic aspect and relies on a new kind of recursive functions, i.e. recursive functions on context-free languages, for semantic aspect of specifications. Construction and validation of LFC specifications are machine-aided. The basic ideas behind LFC, the main aspects of LFC, and the use of LFC and illustrative examples are described.

combining cfg and recursive functions to get a new language

We propose a new functional programming language(FPL) which differs in some aspects from most well known FPLs[l].We descrihc the prohlmm domain,the language,explain why we need it.