用于生命之树重建的数据集

由中国科学院计算机网络信息中心、中国科学院植物研究所、深圳市中国科学院仙湖植物园“三方两地”共同合作研究建设的“达尔文树”——分子数据分析应用环境(DarwinTree——Molecular Data Analysis and Application Environment),从中国陆地植物发育系统框架的研究出发,逐步推动解决生命之树构建过程中存在的技术难题,探索利用基因和基因组信息构建生命之树的策略和方法,研究和开发DNA序列信息自动采集和生命之树自动生成技术(Automatic Reconstruction of The Tree of Life),建立生命之树信息平台及其利用体系,为最终在我国建立具有国际影响的,能很好地兼容物种分类、地理分布、形态性状、化石信息以及DNA信息的物种库(Species Bank)创造条件。DarwinTree旨在为科研人员提供数据和分析并举的工作平台,该平台将承担数据汇集和面向实际科研工作应用的双重作用。本文发布的数据集包括:(1)DarwinTree基础数据集:来自国际公共序列数据的标记处理得到的分子标记数据及其与任意阶元物种分类名称对应的统计数据集;(2)DarwinTree自测序数据集:面向中国陆地植物研究的补充测序序列数据;(3)DarwinTree中国维管植物进化数据集:已构建的中国维管植物属系统发育树的数据(Generic tree of Chinese vascular plants)。

不等式、集合、几何起码常识凸显课本一系列重大错误——让2300年都无人能识的直线段一下子暴露出来

2300年初等几何一直认定相互平行且距离为0的直线必重合相等,等长的直线段必有合同关系;然而集合与几何起码常识凸显直线A沿本身伸缩或平移后就≠A了,有等长直线段a与b,a的元点多于b的元点使a不可≌b——从一侧面显示2300年＂点无大小＂公理并非＂不容置疑＂（坚持＂点无大小＂就无法解释图形a与b的＂像素＂点为何不一样多？）.人类自识无理数2500年来一直认定各已知正数x的对应x2均是已知正数,然而除了弱智者谁都能懂的道理凸显R有＂更无理＂正数x的对应x2是R外数.指出初等数学对无穷数列的认识一直存在极重大缺陷与错误.不知函数关系与该关系中的函数是两根本不同概念使中学有违反最起码数学常识＂u-v=0的含义是u=v＂的错误.

广义连续统假设的新形式

用超限基数的序型集与序数集同浓（即可１—１对应）来提供广义连续统假设的一种新形式．证明了对任一超限基数Ｋ，恒有｜Ｔ（Ｋ）｜＝２Ｋ．其中Ｔ（Ｋ）为Ｋ的序型集．

The Counting Problem of an Order N-group of Set

In this paper, we discuss the counting prob lem of an order n-group of set (A 1,A 2,…,A n) which satisfies ∪ni=1A i=｛a 1,a 2,…,a m｝ and one of the following: (1) ∩ni=1A i=Φ; (2) ∩ni=1A i=｛b 1,b 2,…,b k｝;(3) ∩ni=1A 1｛b 1,b 2,…,b k｝; (4) A i≠Φ (i=1,2,…,k). We solve these problems by element analytical meth od.

The Semimodularity of Cardinal Power of Posets

Let X,Y be any posets,the semimodularity of cardinal power Yx with base Y and exponent X is studied. Some necessary or sufficient conditions for Yx to be semimodular are gaven,

ω_1-OrdinalDefinable Setsand ChangsModelC

In this paper,we first introduce the notions of ω\-1 ordinal definable sets and hereditarily ω\-1 ordinal definable sets. Then we present some properties of the universe HOD 1 of hereditarily ω\-1 ordinal definable sets. Finally,using forcing method,we reveal some consistent relationship between HOD 1 and Changs model C.

The Direct Product of Graded Finite Posets

A new concept Graded Finite Poset is proposed in this paper. Through discussing some basic properties of it, we come to that the direct product of graded finite posets is connected if and only if every graded finite poset is connected. The graded function of a graded finite poset is unique if and only if the graded finite poset is connected.

Results of Associated Implication Algebra on a Partial Ordered Set

Some sufficient and necessary conditions that implication algebra on a partial ordered set is associated implication algebra are obtained, and the relation between lattice H implication algebra and associated implication algebra is discussed. Also, the concept of filter is proposed with some basic properties being studied.

IBM大型机VSE／VSAM数据文件浅析

ＩＢＭ大型机ＶＳＥ／ＶＳＡＭ数据文件浅析农业银行广东省分行电脑部陈龙虚拟存取方法（ＶＳＡＭ）是ＩＢＭ公司推出的用于ＥＳ９０００大型机操作系统ＶＳＥ／ＥＳＡ（ＶｉｍｕａｌＳｔｏｒａｇｅＥｘ－ｔｅｎｄｅｄ／ＥｎｔｅｒｐｒｉｓｅＳｙｓｔｅｍｓＡｒｃｈｉｔｅ...

Quality Control and Analysis of Global Gauge-Based Daily Precipitation Dataset from 1980 to 2009

A series of quality control(QC) procedures were performed on a gauge-based global daily precipitation dataset from the Global Telecommunication System(GTS) for the period 1980-2009.A new global daily precipitation(NGDP) dataset was constructed by applying those QC procedures to eliminate erroneous records.The NGDP dataset was evaluated using the NOAA Climate Prediction Center Merged Analysis of Precipitation(CMAP) and the Global Precipitation Climatology Project(GPCP) precipitation datasets.The results showed that the frequency distribution and spatial distribution pattern of NGDP had a nice match with those from the CMAP and GPCP datasets.The global mean correlation coefficients with the CMAP and GPCP data increased from 0.24 for original GTS precipitation data to about 0.70 for NGDP data.Correspondingly,the root mean square errors(RMSE) decreased from 12 mm per day to 1 mm per day.The interannual variabilities of NGDP monthly precipitation are consistent with the CMAP and GPCP datasets in Asia.Meanwhile,the seasonal variabilities for most land areas on the Earth of NGDP dataset are also consistent with the CMAP and GPCP precipitation products.

Research on Multidimensional Data Model in Data Warehouse

Data structure and semantics of the traditional data model cannot effectively represent the data warehouse, it is difficult to effectively support online analytical processing （referred to as OLAP）. This paper is propose a new multidimensional data model based on the partial ordering and mapping. The data model can fully express the complex data structure and semantics of data warehouse, and provide an OLAP operation as the core of the operation of algebra, support structure in levels of complex aggregation operation sequence, which can effectively support the application of OLAE The data model supports the concept of aggregation function constraint, and provides constraint mechanism of the hierarchy aggregation function.

Management Procedures for Data Collected via Intelligent Transportation Systems

Addressing transportation planning, operation and investment challenges requires increasingly sophisticated data and information management strategies. ITS （intelligent transportation systems） and CV （connected vehicle） technologies represent a new approach to capturing and using needed transportation data in real time or near real time. In the case of Michigan, several ITS programs have been launched successfully, but independently of each other. The objective of this research is to evaluate and assess all important factors that will influence the collection, management and use of ITS data, and recommend strategies to develop integrated, dynamic and adaptive data management systems for state transportation agencies.

Comparative Analysis of EEG Signals Based on Complexity Measure

The aim of this study is to identify the functions and states of the brains according to the values of the complexity measure of the EEG signals. The EEG signals of 30 normal samples and 30 patient samples are collected. Based on the preprocessing for the raw data, a computational program for complexity measure is compiled and the complexity measures of all samples are calculated. The mean value and standard error of complexity measure of control group is as 0.33 and 0.10, and the normal group is as 0.53 and 0.08. When the confidence degree is 0.05, the confidence interval of the normal population mean of complexity measures for the control group is (0.2871,0.3652), and (0.4944,0.5552) for the normal group. The statistic results show that the normal samples and patient samples can be clearly distinguished by the value of measures. In clinical medicine, the results can be used to be a reference to evaluate the function or state, to diagnose disease, to monitor the rehabilitation progress of the brain.

On a Class of Subspace Lattices

Let V n(q) be the n dimensional vector space over the finite field with q elements, K a k dimensional subspace and C the set of the subspaces S such that S∩K≠=O .We show that C is Sperner and unimodal and point out all maximum sized antichains in C .For the Whitney number W m of C , we show that W m 2 qW m 1 W m+1 has nonnegative coefficients as a polynomial in q and that W 0W nW 1W n 1 W 2… .

LACK-OF-FIT TESTS BASED ON WEIGHTED RATIO OF RESIDUALS AND VARIANCES

This article proposes a new lack-of-test based on the weighted ratio of residuals and variances for partially linear regression models. The large and small sampling properties of the proposed test are established. The testing procedure is illustrated via several examples. Simulation studies show that the testing procedures are powerful even in small samples. An application of the test to a real data set is presented.

Design of Service-Oriented Architecture for Spatial Data Integration and Its Application in Building Web-based GIS Systems

In this paper we propose a service-oriented architecture for spatial data integration (SOA-SDI) in the context of a large number of available spatial data sources that are physically sitting at different places, and develop web-based GIS systems based on SOA-SDI, allowing client applications to pull in, analyze and present spatial data from those available spatial data sources. The proposed architecture logically includes 4 layers or components; they are layer of multiple data provider services, layer of data in-tegration, layer of backend services, and front-end graphical user interface (GUI) for spatial data presentation. On the basis of the 4-layered SOA-SDI framework, WebGIS applications can be quickly deployed, which proves that SOA-SDI has the potential to reduce the input of software development and shorten the development period.

Chaos and null systems

A dynamical system is called a null system, if the topological sequence entropy along any strictly increasing sequence of non-negative integers is 0. Let 0≦p≦q≦1. A dynamical system is Dqp chaotic, if there is an uncountable subset in which any two different points have trajectory approaching time set with lower density p and upper density q. In this paper, we show that there is a null system which is also D3/41/4 chaotic.

k-Torsionfree Modules with Respect to Cotilting Modules

Let A and F be left and right Noetherian rings and ∧ωr a cotilting bimodule. A necessary and sufficient condition for a finitely generated A-module to be ω-k-torsionfree is given and the extension closure of Tω^i is discussed. As applications, we give some results of ∧ωr related to l.id（ω） ≤ k.

A Remark on WaUman Compactification of Locales

In this note, we prove that the Banaschewski-Mulvey＇s compact regular reflection construction of locales is isomorphic to the Johnstone Wallman compcactification of locales. We show that a subfit semi-normal locale is normal, but the converse is not true in general. Furthermore, we generalize the main result in .

On the size of the intersection of two Lucas sequences of distinct type Ⅱ

Let a and b be positive integers, with a not perfect square and b > 1. Recently, He, Togband Walsh proved that the Diophantine equation x2-a((bk-1)/(b-1))2=1 has at most three solutions in positive integers. Moreover, they showed that if max{a,b} > 4.76·1051, then there are at most two positive integer solutions (x,k). In this paper, we sharpen their result by proving that this equation always has at most two solutions.