Algorithm design and implementation of finite wavelet grow tree

Based on grow tree composite model, Finite Field Wavelet Grow Tree (FW-GT) was proposed in this paper. FW-GT is a novel framework to be used in data encryption enhancing data security. It is implemented by replacement operator and wavelet operator. Forward integration and inverse decomposition of FW-GT are performed by replacement, inverse wavelets and its corresponding replacement, wavelet transforms. Replacement operator joined nonlinear factor, wavelet operator completed data transformation between lower dimensional space and higher dimensional space. FW-GT security relies on the difficulty of solving nonlinear equations over finite fields. By using FW-GT, high security of data could be obtained at the cost of low computational complexity. It proved FW-GT algorithm’s correctness in this paper. The experimental result and theory analysis shows the excellent performance of the algorithm.     

Effective Relaxations and Partitioning Schemes for Solving Water Distribution Network Design Problems to Global Optimality

In this paper, we address the development of a global optimization procedure for the problem of designing a water distribution network, including the case of expanding an already existing system, that satisfies specified flow demands at stated pressure head requirements. The proposed approach significantly improves upon a previous method of Sherali et al. (1998) by way of adopting tighter polyhedral relaxations, and more effective partitioning strategies in concert with a maximal spanning tree-based branching variable selection procedure. Computational experience on three standard test problems from the literature is provided to evaluate the proposed procedure. For all these problems, proven global optimal solutions within a tolerance of 10^–4% and/or within 1$ of optimality are obtained. In particular, the two larger instances of the Hanoi and the New York test networks are solved to global optimality for the very first time in the literature. A new real network design test problem based on the Town of Blacksburg Water Distribution System is also offered to be included in the available library of test cases, and related computational results are presented.     

On the subspaces of JF and JT with non-separable dual

It is proved that every subspace of James Tree space (JT) with non-separable dual contains an isomorph of James Tree complemented in JT. This yields that every complemented subspace of JT with non-separable dual is isomorphic to JT. A new JT like space denoted as TF is defined. It is shown that every subspace of James Function space (JF) with non-separable dual contains an isomorph of TF. The later yields that every subspace of JF with non-separable dual contains isomorphs of c₀ and ?p for 2?p<∞. The analogues of the above results for bounded linear operators are also proved.     

数据专业设计标准化若干问题的思考与实践

以数据专业设计标准化为案例,对设计流程、设计模板及加速知识共享等进行了分析,提出了“聚焦设计标准化,提升设计服务水平”的理念,并探讨了在设计服务商内部推广的可行性。     

连续值域信息系统的规则提取与知识约简

研究连续值域信息系统的规则提取和知识约简，给出规则提取的完整方法和2种新的知识约简的概念，讨论各种协调集之间的关系，探讨系统允许误差变化对规则提取的影响。     

基于本体的数学知识获取与知识继承机制研究

基于本体、框架和逻辑给出了数学知识表示语言，采用了面向概念的数学知识获取方法，利用半自动的方式对数学知识进行了获取。提出了知识树的概念用于所获得的知识的管理，设计并实现了数学知识获取和管理平台。研究了数学概念知识体系结构以及概念之间的知识继承机制，并对知识继承的一致性进行了分析。在数学知识的应用方面，对基于Web的数学知识问答系统、数学智能教学系统、数学知识的多语言版本自动生成等进行了初步的探讨。     

一类可调转股价可转债的定价分析与计算

1 引言可转换债券以其独特的风险受益特性逐渐为投、融资者所接受并得到了广泛的欢迎．如今,无论在广度还是深度上,全球范围的可转债市场都已经发生了质的变化,并且日趋成熟和繁荣．中国的可转债市场在经历了十余年的沉寂之后,近两年也正进入一个高速发     

树上秘密共享体制的信息率

研究以树G为通道结构的秘密共享体制的最优信息率ρ（G）。得到了ρ（G）＝2／3的要条件。证明了ρ（G）不会介于实数区间（3／5，2／3）中，给出了以树G的阶数表示的ρ（G）的下界，求出两类具有某种结构的树的最优信息率。     

ESR方法初探树木年轮记载的气候效应

对新疆托木尔峰地区松树年轮样品的ESR研究表明,其自由基浓度N_g是树木生长速率的指示,它与季节有关。春材的N_g值普遍高于秋材,与气温、降雨量有关,但不是一一对应的关系。年轮的N_g明显地受太阳黑子活动周的影响,随着太阳周而变化,只是峰谷和峰值年要前移或后推1—2年。     

Fuzzy信息系统的Rough集理论

提出 Fuzzy信息系统的概念 ,建立 fuzzy信息系统上的 Rough集理论 ,给出 Fuzzy信息系统与经典信息系统的关系 ,讨论 Fuzzy信息系统的知识约简问题