Realizations and LP

LP can be seen as a logic of knowledge with justifications. See [S. Artemov, The logic of justification, The Review of Symbolic Logic 1 (4) (2008) 477–513] for a recent comprehensive survey of justification logics generally. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikka-style logic of knowledge S4, in which they are not explicitly present. Justifications, however, are far from unique. There are many ways of realizing each theorem of S4 in the logic LP. If the machinery of justifications is to be applied to artificial intelligence, or better yet, to everyday reasoning, we will need to work with whatever justifications we may have at hand—one version may not be interchangeable with another, even though they realize the same S4 formula. In this paper we begin the process of providing tools for reasoning about justifications directly. The tools are somewhat complex, but in retrospect this should not be surprising. Among other things, we provide machinery for combining two realizations of the same formula, and for replacing subformulas by equivalent subformulas. (The second of these is actually weaker than just stated, but this is not the place for a detailed formulation.) The results are algorithmic in nature—semantics for LP plays no role. We apply our results to provide a new algorithmic proof of Artemov’s Realization Theorem itself. This paper is a much extended version of [M.C. Fitting, Realizations and LP, in: S. Artemov, A. Nerode (Eds.), Logical Foundations of Computer Science—New York ’07, in: Lecture Notes in Computer Science, vol. 4514, Springer-Verlag, 2007, pp. 212–223].     

On intuitionistic modal and tense logics and their classical companion logics: Topological semantics and bisimulations

We take the well-known intuitionistic modal logic of Fischer Servi with semantics in bi-relational Kripke frames, and give the natural extension to topological Kripke frames. Fischer Servi’s two interaction conditions relating the intuitionistic pre-order (or partial-order) with the modal accessibility relation generalize to the requirement that the relation and its inverse be lower semi-continuous with respect to the topology. We then investigate the notion of topological bisimulation relations between topological Kripke frames, as introduced by Aiello and van Benthem, and show that their topology-preserving conditions are equivalent to the properties that the inverse relation and the relation are lower semi-continuous with respect to the topologies on the two models. The first main result is that this notion of topological bisimulation yields semantic preservation w.r.t. topological Kripke models for both intuitionistic tense logics, and for their classical companion multi-modal logics in the setting of the Gödel translation. After giving canonical topological Kripke models for the Hilbert-style axiomatizations of the Fischer Servi logic and its classical companion logic, we use the canonical model in a second main result to characterize a Hennessy–Milner class of topological models between any pair of which there is a maximal topological bisimulation that preserve the intuitionistic semantics.     

A granularity-based framework of deduction, induction, and abduction

In this paper, we propose a granularity-based framework of deduction, induction, and abduction using variable precision rough set models proposed by Ziarko and measure-based semantics for modal logic proposed by Murai et al. The proposed framework is based on α-level fuzzy measure models on the basis of background knowledge, as described in the paper. In the proposed framework, deduction, induction, and abduction are characterized as reasoning processes based on typical situations about the facts and rules used in these processes. Using variable precision rough set models, we consider β-lower approximation of truth sets of nonmodal sentences as typical situations of the given facts and rules, instead of the truth sets of the sentences as correct representations of the facts and rules. Moreover, we represent deduction, induction, and abduction as relationships between typical situations.     

A hybrid method for pricing European options based on multiple assets with transaction costs

The problem of pricing European options based on multiple assets with transaction costs is considered. These options include, for example, quality options and options on the minimum of two or more risky assets. The value of these options is the solution of a nonlinear parabolic partial differential equation subject to a final condition given by the payoff function associated with the option. A computationally efficient method to solve this final-value problem is proposed. This method is based on an asymptotic expansion of the required solution with respect to the parameters related to the transaction costs followed by the numerical solution of the linear partial differential equations obtained at each order in perturbation theory. The numerical solution of these linear problems involves an implicit finite-difference scheme for the parabolic equation and the use of the fast Fourier sine transform to solve the resulting elliptic problems. Numerical results obtained on test problems with the method proposed here are shown and discussed.     

Optimal design and fabrication of SMS fiber temperature sensor for liquid

Single-mode/multi-mode/single-mode (SMS) fiber sensors are optimally designed and used as high sensitivity temperature sensors in special temperature range. It is shown that the width of multi-mode fiber is a key factor influencing the performance of as-fabricated temperature sensors, which can be effectively controlled in the fabrication process by monitoring the output power of SMS fiber during wet acid etching process. As-fabricated temperature sensors show promising potential applications for precisely monitoring chemical reaction temperature in chemistry and biomedicine fields.     

Wavelength and beam launching effects on silica optical fiber in local area networks

In this paper, we report the modal dispersion of silica graded-index optical fibers as a function of the input mode parameters and lunching conditions in local area network (LAN) context. In that, we examine the mode-depending parameters, namely, modal delay, modal attenuation and mode-coupling effects as a function of wavelength. We show that the number of excited mode groups depends strongly on the spot beam radius when the fiber is excited with an axial Gaussian beam where we find an optimal axial diameter exciting only two mode groups. We present a comparison of the number of excited mode groups, the optimal spot radius beam, the signal penalty and the 3-dB baseband bandwidth enhancement for the optimal axial launching compared with full mode excitation, offset launching and mode-field matched axial launching.     

Modal correction for fiber-coupling efficiency in free-space optical communication systems through atmospheric turbulence

High-speed free-space optical communication systems have recently used fiber-optical components. The coupling efficiency with which the received laser beam can be coupled into a single-mode fiber is noticeably limited by atmospheric turbulence due to the degradation of its spatial coherence. Fortunately, adaptive optics (AO) can alleviate this limitation by partially correcting the turbulence-distorted wavefront. The coupling efficiency improvement provided by Zernike modal AO correction is numerically evaluated. It is found that the first 3-20 corrected polynomials can considerably improve the fiber-coupling efficiency. The improvement brought by AO is compared with that brought by a coherent fiber array. Finally, a hybrid technique that integrates AO and a coherent fiber array is proposed. Results show that the hybrid technique outperforms each of the two above-mentioned techniques.     

Differential quadrature method (DQM) and Boubaker Polynomials Expansion Scheme (BPES) for efficient computation of the eigenvalues of fourth-order Sturm-Liouville problems

The differential quadrature method (DQM) and the Boubaker Polynomials Expansion Scheme (BPES) are applied in order to compute the eigenvalues of some regular fourth-order Sturm-Liouville problems. Generally, these problems include fourth-order ordinary differential equations together with four boundary conditions which are specified at two boundary points. These problems concern mainly applied-physics models like the steady-state Euler-Bernoulli beam equation and mechanicals non-linear systems identification. The approach of directly substituting the boundary conditions into the discrete governing equations is used in order to implement these boundary conditions within DQM calculations. It is demonstrated through numerical examples that accurate results for the first kth eigenvalues of the problem, where k = 1, 2, 3, … , can be obtained by using minimally 2(k + 4) mesh points in the computational domain. The results of this work are then compared with some relevant studies.     

Homotopy analysis method for the asymmetric laminar flow and heat transfer of viscous fluid between contracting rotating disks

The present work investigates the effects of the disks contracting, rotation, heat transfer and different permeability on the viscous fluids and temperature distribution between two heated contracting rotating disks. Two cases are considered. For the first case, we neglect the viscous dissipation effects in the energy equation and reduce the Navier-Stokes equations and energy equation into nonlinear coupled ODEs by introducing the Von Kármán type similarity transformations. The effects of various physical parameters like expansion ratio, Prandtl number, Reynolds number and rotation ratio on the velocity and temperature are discussed in detail. The second and more general case is that we consider the viscous dissipation in the energy equation. Under this assumption, the energy equation is reduced to a ordinary differential equation including the Eckert number, whose solution also is solved by HAM.     

Deviation Matrix,Laurent Series and Blackwell Optimality in Countable State Markov Decision Processes

This paper presents a recurrent condition on Markov decision processes with a countable state space and bounded rewards. The condition is sufficient for the existence of a Blackwell optimal stationary policy, having the Laurent series expansion with continuous coefficients. It is so relaxed that the Markov chain corresponding to a stationary policy may have countably many periodic recurrent classes. Our method finds the deviation matrix in an explicit form.