二进式园形化学元素周期表的设计及规律

二进式园形化学元素周期表，是为了解决周期表结构不紧凑、不能全面反映元素性质变化规律而设计的；它比其它形式的周期表具有更多的规律，对元素性质的研究更加广泛。

商周时期大型院落式建筑比较研究

商周时期大型院落式建筑可分为"堂庑一体式"、"堂厢分离式"和"二进式"三类。"堂庑一体式"是商代大型院落建筑的典型形制,"堂厢分离式"是周代流行的典型院落形制,二者在主体殿堂的形制、柱网结构、门与台阶的设置、堂外廊柱、围墙、回廊、门塾的位置、庭院空间等方面,均有明显的差异。"二进式"院落则介于以上两型之间,具有商代和周代大型院落建筑的双重因素。

地方资源在高校思政课教学中运用路径模式的探索

充分挖掘和运用各种优质地方资源,有利于丰富思政课的课程资源,提升思政课的课程魅力,真正提高思政课的实效性和针对性。以"常州三杰"资源为例,探索和实践了"一通二进三位四式"的运用路径模式,对高校思政课充分运用地方资源具有一定的借鉴意义。

二项马鞍山市科技计划项目通过验收

2004年11月12日马鞍山市科技局组织有关专家在中冶华天工程技术有限公司对中冶华天工程技术有限公司(原中冶集团马鞍山钢铁设计研究总院)承担的2002年度马鞍山市科技计划“上向流曝气生物滤池处理污水”项目和2003年度马鞍山市科技计划“蓄热式二段步进梁加热炉”项目进行了检查与验收，

Binary Bell Polynomials,Bilinear Approach to Exact Periodic Wave Solutions of(2+l)-Dimensional Nonlinear Evolution Equations

In the present letter, we get the appropriate bilinear forms of （2 ＋ 1）-dimensional KdV equation, extended （2 ＋ 1）-dimensional shallow water wave equation and （2 ＋ 1）-dimensional Sawada -Kotera equation in a quick and natural manner, namely by appling the binary Bell polynomials. Then the Hirota direct method and Riemann theta function are combined to construct the periodic wave solutions of the three types nonlinear evolution equations. And the corresponding figures of the periodic wave solutions are given. Furthermore, the asymptotic properties of the periodic wave solutions indicate that the soliton solutions can be derived from the periodic wave solutions.

Binary Bell Polynomials Approach to Generalized Nizhnik-Novikov-Veselov Equation

The elementary and systematic binary Bell polynomials method is applied to the generalized NizhnikNovikov-Veselov (GNNV) equation.The bilinear representation,bilinear B&cklund transformation,Lax pair and infiniteconservation laws of the GNNV equation are obtained directly,without too much trick like Hirota’s bilinear method.

AN LBP-BASED MULTI-SCALE ILLUMINATION PREPROCESSING METHOD FOR FACE RECOGNITION

It is one of the major challenges for face recognition to minimize the disadvantage of il- lumination variations of face images in different scenarios. Local Binary Pattern (LBP) has been proved to be successful for face recognition. However, it is still very rare to take LBP as an illumination preprocessing approach. In this paper, we propose a new LBP-based multi-scale illumination pre- processing method. This method mainly includes three aspects: threshold adjustment, multi-scale addition and symmetry restoration/neighborhood replacement. Our experiment results show that the proposed method performs better than the existing LBP-based methods at the point of illumination preprocessing. Moreover, compared with some face image preprocessing methods, such as histogram equalization, Gamma transformation, Retinex, and simplified LBP operator, our method can effectively improve the robustness for face recognition against illumination variation, and achieve higher recog- nition rate.

A retinal blood vessel extraction algorithm based on CART decision tree and improved AdaBoost

This paper presents a supervised learning algorithm for retinal vascular segmentation based on classification and regression tree (CART) algorithm and improved adptive bosting (AdaBoost). Local binary patterns (LBP) texture features and local features are extracted by extracting,reversing,dilating and enhancing the green components of retinal images to construct a 17-dimensional feature vector. A dataset is constructed by using the feature vector and the data manually marked by the experts. The feature is used to generate CART binary tree for nodes,where CART binary tree is as the AdaBoost weak classifier,and AdaBoost is improved by adding some re-judgment functions to form a strong classifier. The proposed algorithm is simulated on the digital retinal images for vessel extraction (DRIVE). The experimental results show that the proposed algorithm has higher segmentation accuracy for blood vessels,and the result basically contains complete blood vessel details. Moreover,the segmented blood vessel tree has good connectivity,which basically reflects the distribution trend of blood vessels. Compared with the traditional AdaBoost classification algorithm and the support vector machine (SVM) based classification algorithm,the proposed algorithm has higher average accuracy and reliability index,which is similar to the segmentation results of the state-of-the-art segmentation algorithm.

Complete Focal Plane Compression Based on CMOS Image Sensor Using Predictive Coding

In this paper, a CMOS image sensor(CIS) is proposed, which can accomplish both decorrelation and entropy coding of image compression directly on the focal plane. The design is based on predictive coding for image decorrelation. The predictions are performed in analog domain by 2×2 pixel units. Both the prediction residuals and original pixel values are quantized and encoded in parallel. Since the residuals have a peak distribution around zero,the output codewords can be replaced by the valid part of the residuals' binary mode. The compressed bit stream is accessible directly at the output of CIS without extra disposition. Simulation results show that the proposed approach achieves a compression rate of 2. 2 and PSNR of 51 on different test images.

Novel similarity measures for face representation based on local binary pattern

The successful face recognition based on local binary pattern(LBP)relies on the effective extraction of LBP features and the inferring of similarity between the extracted features.In this paper,we focus on the latter and propose two novel similarity measures for the local matching methods and the holistic matching methods respectively.One is Earth Mover's Distance with Hamming and Lp ground distance(EMD-HammingLp),which is a cross-bin dissimilarity measure for LBP histograms.The other is IMage Hamming Distance(IMHD),which is a dissimilarity measure for the whole LBP images.Experiments on FERET database show that the proposed two similarity measures outperform the state-of-the-art Chi-square similarity measure for extraction of LBP features.

Elevating the flexibility and operability of dividing-wall distillation columns via feed thermal condition adjustment

Because of the complicated interplay between the prefractionator and main distillation column involved,the black-hole problem might occur and prohibit the assignment of four specifications to dividing-wall distillation columns(DWDCs)(e.g., the three main product compositions plus an impurity ratio in the intermediate product), which lowers terribly process flexibility and operability. In this paper, a feed thermal condition adjustment strategy, achieved by the installation of a pre-heater in feed pipeline, is employed to eliminate the black-hole problem and serve to enhance process flexibility and operability. Through the strong influence to the overall mass and energy balance of the DWDC, the feed thermal condition adjustment can alter the interlinking flows between the thermally coupled prefractionator and main distillation column and work effectively to coordinate their relationship. A DWDC separating a benzene, toluene, and o-xylene mixture is chosen to ascertain the feasibility of the philosophy proposed. The static and dynamic studies demonstrate that the feed thermal condition adjustment is an effective way to refine process design and can completely eliminate the black-hole problem and elevate consequently process flexibility and operability.

A Ternary 4-Point Approximating Subdivision Scheme

In this paper, the author presents a class of stationary ternary 4-point approximating symmetrical subdivision algorithm that reproduces cubic polynomials. By these subdivision algorithms at each refinement step, new insertion control points on a finer grid are computed by weighted sums of already existing control points. In the limit of the recursive process, data is defined on a dense set of point, The objective is to find an improved subdivision approximating algorithm which has a smaller support and a higher approximating order. The author chooses a ternary scheme because the best way to get a smaller support is to pass from the binary to ternary or complex algorithm and uses polynomial reproducing propriety to get higher approximation order. Using the cardinal Lagrange polynomials the author has proposed a 4-point approximating ternary subdivision algorithm and found that a higher regularity of limit function does not guarantee a higher approximating order. The proposed 4-point ternary approximation subdivision family algorithms with the mask a have the limit function in C2 and have approximation order 4. Also the author has demonstrated that in this class there is no algorithm whose limit function is in C3. It can be seen that this stationary ternary 4-point approximating symmetrical subdivision algorithm has a lower computational cost than the 6-point binary approximation subdivision algorithm for a greater range of points.

Path PPI: an integrated dataset of human pathways and protein-protein interactions

Integration of pathway and protein-protein interaction(PPI) data can provide more information that could lead to new biological insights. PPIs are usually represented by a simple binary model, whereas pathways are represented by more complicated models. We developed a series of rules for transforming protein interactions from pathway to binary model, and the protein interactions from seven pathway databases, including PID, Bio Carta, Reactome, Net Path, INOH, SPIKE and KEGG, were transformed based on these rules. These pathway-derived binary protein interactions were integrated with PPIs from other five PPI databases including HPRD, Int Act, Bio GRID, MINT and DIP, to develop integrated dataset(named Path PPI). More detailed interaction type and modification information on protein interactions can be preserved in Path PPI than other existing datasets. Comparison analysis results indicate that most of the interaction overlaps values(OAB) among these pathway databases were less than 5%, and these databases must be used conjunctively. The Path PPI data was provided at http://proteomeview. hupo.org.cn/Path PPI/Path PPI.html.

THE OPTIMAL LINEAR SECRET SHARING SCHEME FOR ANY GIVEN ACCESS STRUCTURE

Any linear code can be used to construct a linear secret sharing scheme.In this paper,it is shown how to decide optimal linear codes(i.e.,with the biggest information rate)realizing a given access structure over finite fields.It amounts to solving a system of quadratic equations constructed from the given access structure and the corresponding adversary structure.The system becomes a linear system for binary codes.An algorithm is also given for finding the adversary structure for any given access structure.

A test of an early-type contact binary model by comparing the relations obtained from theory with those from observations

Contact binary systems,including massive,middle-mass and low-mass systems,have been observed.It is necessary to construct the evolutionary model for contact binary systems with all different masses.The model introduced by Huang,Song and Bi indicates some special and unique understandings of the physical processes occurring in the contact binaries.It is necessary to test whether this model can be applied to the early-type contact binaries.The best way to test a theoretical model is to know whether this model can explain the observational phenomena of such binaries.For this aim,a comparison is performed for the relations of mass-luminosity,mass-radius,and the distribution in the HR diagram obtained from the model introduced by Huang et al.and those from the astronomical observations.A good result is obtained by the comparison.This means the model can be used in calculating the evolution of early-type contact binaries,and can explain the observational phenomena of such binaries.

Contact binaries:I.An inspection of the HSB contact binary model by comparison of relationships obtained from theoretical light curves with that from astronomical observations

The light curve is one of the most important photometric characteristics of variable stars,which can supply physical information about many stars.So,light curves are the best candidate to inspect a theoretical model of binaries.One important feature of the light curve is the difference of two light minima of the light curve,namely the difference between the primary eclipse depth and the secondary eclipse depth(DED).In this paper,the secondary eclipse depths of theoretical and observational light curves are studied.Firstly,a method to calculate the theoretical light curves of an eclipsing binary with non-spherical components is proposed,which can be put into the HSB contact binary model [Huang R Q,et al.Chin J Astron Astrophys,2007,7:235-244;Song H F,et al.Chin J Astron Astrophys,2007,7:539-550].Theoretical light curves and the DED of the binary can be obtained at every evolutionary phase.The relationships of DED with mass and luminosity are presented and show special features for the contact binaries.Secondly,a large amount of observational data is collected,from which 11 massive,intermediate-mass contact binaries and 9 low-mass contact binaries are chosen and the two relationships are obtained using theoretical light curves.Finally,in order to check whether the HSB contact binary model can be used in contact binary systems with massive,intermediate-mass and low-mass components,a comparison is performed for the above mentioned relationships obtained from theoretical light curves with those from the astronomical observations.The results show a good agreement for contact binary systems with all different masses.

Some 3-adic congruences for binomial sums

We prove some 3-adic congruences for binomial sums,which were conjectured by Zhi-Wei Sun.For example,for any integer m≡1（mod 3）and any positive integer n,we have v3（1/n ∑n-1X k=0 1/mk 2k/ k〉））≥min{3（n）,3（m-1）-1},where 3（n）denotes the 3-adic order of n.In our proofs,we use several auxiliary combinatorial identities and a series converging to 0 over the 3-adic field.

A construction of hyperbent functions with polynomial trace form

This paper presents a construction of infinite classes of binary and p-ary hyperbent functions of polynomial trace form,based on finding a zero of a Kloosterman sum.