Dynamic discovery of query path on the lattice of cuboids using hierarchical data granularity and storage hierarchy

Analytical processing on multi-dimensional data is performed over data warehouse. This, in general, is presented in the form of cuboids. The central theme of the data warehouse is represented in the form of fact table. A fact table is built from the related dimension tables. The cuboid that corresponds to the fact table is called base cuboid. All possible combination of the cuboids could be generated from base cuboid using successive roll-up operations and this corresponds to a lattice structure. Some of the dimensions may have a concept hierarchy in terms of multiple granularities of data. This means a dimension is represented in more than one abstract form. Typically, neither all the cuboids nor all the concept hierarchy are required for a specific business processing. These cuboids are resided in different layers of memory hierarchy like cache memory, primary memory, secondary memory, etc. This research work dynamically finds the most cost effective path from the lattice structure of cuboids based on concept hierarchy to minimize the query access time. The knowledge of location of cuboids at different memory elements is used for the purpose.     

Lax表示的变形与Hamilton方程族的Lax表示

本文首先给出了构造演化方程族的Ｌａｘ表示的马文秀方法的一种变形，后对这一方法作了改进，使之适用于Ｈａｍｉｌｔｏｎ形式的方程族．作为应用，得到了具有非等谱Ｌａｘ表示的杨方程族．     

Generalized dressing method for the extended two-dimensional Toda lattice hierarchy and its reductions

In this paper, we solve the extended two-dimensional Toda lattice hierarchy (ex2DTLH) by the generalized dressing method developed in Liu-Lin-Jin-Zeng (2009). General Casoratian determinant solutions for this hierarchy are obtained. In particular, explicit solutions of soliton-type are formulated by using the τ-function in the form of exponential functions. The periodic reduction and one-dimensional reduction of ex2DTLH are studied by finding the constraints. Many reduced systems are shown, including the pe...     

一类非线性偏微分方程解的鞅刻划

本文以超布朗运动为工具，利用鞅刻划了一类非线性偏微分方程的正解，得到了某函数为一类非线性偏微分方程正解的充分必要鞅条件．     

THE TRANSFORMATION BETWEEN THE AKNS HIERARCHY AND THE KN HIERARCHY WITH SELF-CONSISTENT SOURCES

It is shown that the AKNS hierarchy with self-consistent sources can transform to KN hierarchy with self-consistent sources through a transformation operator and gauge transformation. Besides, there exists transformation in their conservation laws and Hamiltonian structures.     

On Grassmannian description of the constrained KP hierarchy

This note develops an explicit construction of the constrained KP hierarchy within the Sato Grassmannian framework. Useful relations are established between the kernel elements of the underlying ordinary differential operator and the eigenfunctions of the associated KP hierarchy as well as between the related bilinear concomitant and the squared eigenfunction potential.     

A general approach to fuzzy concepts

The paper proposes a flexible way to build concepts within fuzzy logic and set theory. The framework is general enough to capture some important particular cases, with their own independent interpretations, like “antitone” or “isotone” concepts constructed from fuzzy binary relations, but also to allow the two universes (of objects and attributes) to be equipped each with its own truth structure. Perhaps the most important feature of our approach is that we do not commit ourselves to any kind of logical connector, covering thus the case of a possibly non‐commutative conjunction too. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A remark on full rank perfect codes

Any full rank perfect 1-error correcting binary code of length n=2^k-1 and with a kernel of dimension n-log(n+1)-m, where m is sufficiently large, may be used to construct a full rank perfect 1-error correcting binary code of length 2^m-1 and with a kernel of dimension n-log(n+1)-k. Especially we may construct full rank perfect 1-error correcting binary codes of length n=2^m-1 and with a kernel of dimension n-log(n+1)-4 for m=6,7,…,10.This result extends known results on the possibilities for the size of a kernel of a full rank perfect code.     

Invariant Simultaneous Solutions of Evolution Equations of Integrable Hierarchies

We construct classical point symmetry groups for joint pairs of evolution equations (systems of equations) of integrable hierarchies related to the auxiliary equation of the method of the inverse problem of second order. For the two cases: the hierarchy of Korteweg--de Vries (KdV) equations and of the systems of Kaup equations, we construct simultaneous solutions invariant with respect to the symmetry group. The problem of the construction of these solutions can be reduced, respectively, to the first and second Painlevé equations depending on a parameter. The Painlevé equations are supplemented by the linear evolution equations defining the deformation of the solution of the corresponding Painlevé equation.