Classification Method of Graphlike Manifold

In this paper,we give a kind of method which can easily be operated to classify the graphlike manifold with contraction.

Vehicle detection algorithm based on codebook and local binary patterns algorithms

Detecting the moving vehicles in jittering traffic scenes is a very difficult problem because of the complex environment.Only by the color features of the pixel or only by the texture features of image cannot establish a suitable background model for the moving vehicles. In order to solve this problem, the Gaussian pyramid layered algorithm is proposed, combining with the advantages of the Codebook algorithm and the Local binary patterns(LBP) algorithm. Firstly, the image pyramid is established to eliminate the noises generated by the camera shake. Then, codebook model and LBP model are constructed on the low-resolution level and the high-resolution level of Gaussian pyramid, respectively. At last, the final test results are obtained through a set of operations according to the spatial relations of pixels. The experimental results show that this algorithm can not only eliminate the noises effectively, but also save the calculating time with high detection sensitivity and high detection accuracy.

Major factors influencing reading comprehension： A factor analysis approach

The present study attempts to identify the major factors influencing EFL reading comprehension by drawing on the data collected from questionnaire and tests. The findings indicate that reading comprehension is composed of three major components： ＂Schema＂, ＂Vocabulary＂, and ＂Motivation ＆ Purpose＂. These three components are made up of the following six factors respectively： ＂textual schema＂, ＂extra-textual schema＂, ＂vocabulary guessing＂, ＂vocabulary noticing＂, ＂motivation＂ and ＂purpose＂. Among the major components of reading comprehension, the four factors of ＂textual schema＂, ＂vocabulary guessing＂, ＂vocabulary noticing＂ and ＂motivation＂ are significantly correlated with reading comprehension.

Study on the Design Method of the Jack-up＇s X-Type Cantilever Allowable Load Nephogram

The extending of a cantilever and transverse moving of a drilling floor enable the jack-up to operate in several well positions after the Jack-up has pitched. The cantilever allowable load nephogram is the critical reference which can evaluate the jack-up's drilling ability, design the cantilever structure and instruct a jack-up manager to make the operations safe. The intent of this paper is to explore the interrelationships between the cantilever position, drilling floor and the loads including wind force, the stand set-back weight etc., through analyzing the structure and load characteristics of the x-type cantilever and the simplified mechanics model with the restriction of the maximum moment capacity of the cantilever single side beam. Referring to several typical position designs load values, the cantilever allowable load nephogram is obtained by using the suitable interpolation method. The paper gives a method for cantilever allowable load design, which is proved reliable and effective by the calculation example.

Jacquard image segmentation using Mumford-Shah model

Jacquard image segmentation is one of the primary steps in image analysis for jacquard pattern identification. The main aim is to recognize homogeneous regions within a jacquard image as distinct, which belongs to different patterns. Active contour models have become popular for finding the contours of a pattern with a complex shape. However, the performance of active contour models is often inadequate under noisy environment. In this paper, a robust algorithm based on the Mumford-Shah model is proposed for the segmentation of noisy jacquard images. First, the Mumford-Shah model is discretized on piecewise linear finite element spaces to yield greater stability. Then, an iterative relaxation algorithm for numerically solving the discrete version of the model is presented. In this algorithm, an adaptive triangular mesh is refined to generate Delaunay type triangular mesh defined on structured triangulations, and then a quasi-Newton numerical method is applied to find the absolute minimum of the discrete model. Experimental results on noisy jacquard images demonstrated the efficacy of the proposed algorithm.

Exact Solutions to a (3+1)-Dimensional Variable-Coefficient Kadomtsev-Petviashvilli Equation via the Bilinear Method and Wronskian Technique

By truncating the Painleve expansion at the constant level term,the Hirota bilinear form is obtainedfor a (3+1)-dimensional variable-coefficient Kadomtsev-Petviashvili equation.Based on its bilinear form,solitary-wavesolutions are constructed via the ε-expansion method and the corresponding graphical analysis is given.Furthermore,the exact solution in the Wronskian form is presented and proved by direct substitution into the bilinear equation.

Enhancing real-time performance via controlled actor relocation in wireless sensor and actor networks

Actors'relocation is utilized during the network initialization to enhance real-time performance of wireless sensor and actor networks(WSANs)which is an important issue of WSANs.The actor deployment problem in WSANs is proved NP-Hard whether the amount of actors is redundant or not,but to the best of our knowledge,no effective distributed algorithms in previous research can solve the problem.Thus two actor deployment strategies which need not the boundary control compared with present deployment strategies are proposed to solve this problem approximately based on the Voronoi diagram.Through simulation experiment,the results show that our distributed strategies are more effective than the present deployment strategies in terms of real-time performance,convergence time and energy consumption.

SAR imagery coding based on blocking high frequency energy matching

A new fractal image compression algorithm based on high frequency energy (HFE) partitioning andmatched domain block searching is presented to code synthetic aperture radar (SAR) imagery. In the hybridcoding algorithm, the original SAR image is decomposed to low frequency components and high frequencycomponents by wavelet transform (WT). Then the coder uses HFE of block to partition and searchthe matched domain block for each range block to code the low frequency components. For the high frequencycomponents, a modified embedded zero-tree wavelet coding algorithm is applied. Experiment resultsshow that the proposed coder obtains about 0. 3dB gain when compared to the traditional fractal coderbased on the quadtree partition. Moreover, the subjective visual quality of the reconstructed SAR imageof the proposed coder outperforms that of the traditional fractal coders in the same compression ratio(CR).

A Heuristic Approach to Fast NOVCA （Near Optimal Vertex Cover Algorithm）

This paper describes an extremely fast polynomial time algorithm, the NOVCA （Near Optimal Vertex Cover Algorithm） that produces an optimal or near optimal vertex cover for any known undirected graph G （V, E）. NOVCA is based on the idea of（l） including the vertex having maximum degree in the vertex cover and （2） rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.

On k-Star Arboricity of Graphs

A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a forest whose components are stars of order at most k ＋ 1. The k-star arboricity of a graph G,denoted by sak（ G）,is the minimum number of k-star forests needed to decompose G. In this paper,it is proved that if any two vertices of degree 3 are nonadjacent in a subcubic graph G then sa2（ G） ≤2.For general subcubic graphs G, a polynomial-time algorithm is described to decompose G into three 2-star forests. For a tree T and[Δ k, T）/k]t≤ sak（ T） ≤[Δ（ T）- 1/K]＋1,where Δ（ T） is the maximum degree of T.kMoreover,a linear-time algorithm is designed to determine whether sak（ T） ≤m for any tree T and any positive integers m and k.

图解经方初探

方以药成,药物通过合理配伍形成方剂。仲景经方,组方更为规范,探究其组方规律对于理解经方功效,提高临证经方运用水平具有重要意义。长期以来方剂学中一直将君臣佐使作为组方的一般规律,强调组方的主次结构,而忽略了中医学独特的平衡圆通观念。中医学以阴阳五行为本,河洛文化为阴阳五行术数之源,因此以河洛之理探讨经方组方规律为溯源之举。文章根据中医平衡圆通观念和河图象数思维,构建解析经方规律的五六法式图,提出“以图解方”的经方组方规律研究新方法。

再论《营造法式》中的“分心斗底槽”与“金箱斗底槽”

本文从《营造法式》图样'殿堂八铺作双槽草架侧样图'中一条小注'斗底槽准此,下双槽同'的疏证开始,指出将其通释成'’斗底槽’侧样与’双槽’侧样相同',有悖于古籍训诂中'随文释义注疏'的原则。进而指出:将'斗底'解释成'斗'的形态(回字形)的一个无法逾越的障碍,是'斗形'与条状的'槽'相悖。既然《营造法式》是以'殿阁地盘图'与'草架侧样图'配合,来描述殿堂结构,就不应当脱离殿堂结构的属性去建空中楼阁。指出:'铺作层'是殿堂结构的特征,殿阁地盘图则是描述铺作层分槽形式的图,草架侧样图中的铺作形式,则反映了槽的深度。

Jigsaw Strategy as a Cooperative Learning Technique:Focusing on the Language Learners

拼图式教学法是一种合作学习的技巧。自从此教学法创立以来,研究者和教师们一直在不同层次和不同学科的课堂上以各种各样的方式研究它。然而,本研究不同于以往的研究,其目的在于探索在大学英语课堂上能否成功地运用拼图式教学,将听、读、重复、背诵、复述以及写融为一体(即L+4R+W),完成教学任务。课堂实施拼图式教学实验后,研究者进行了问卷调查,分析了调查结果,并提出相关的看法。在英语作为外语的课堂上实施拼图式教学策略可以使语言学习者成为课堂的中心,使语言学习成为学习者之间相互依赖而不是彼此独立的活动。本研究得出的结论是:拼图式教学策略不仅是英语作为外语的课堂上以语言学习者为中心来完成学习任务的有用技巧,而且是督促学生参与课堂活动、调动学生学习热情的一种有效方式。

Detection of microRNA expressions in tissues and exfoliative cells reveals the potential role of miR-203 in oral lichen planus

Oral lichen planus （OLP） is a chronic inflammatory disorder and premalignantlesion, of which the mechanisms are still obscure. In the present study, the expression levels of miR-96/182/183 cluster, miR-203, miR-375, and miR-769-5p in both tissues and exfoliative cells of OLP patients as well as healthy volunteers were detected, differentially expressed miRNAs were identified and their correlation with OLP was evaluated by a biplot method. Experimental results show that miR-203 is significantly up-regulated in patient lesion tissues in comparison to volunteer mucosa tissues. Moreover, the contra- dictory insignificant expression changes of miR-203 as well as miR-96/182/183 cluster in comparisons of exfoliative cell samples suggest that different cell compositions in OLP lesion have distinct miRNA regulation, which accords with the histological heterogeneity of OLP. Finally, biplot analyses indicate the expression of miR-203 and miR-96/182/183 cluster are positively correlated in patient lesions. These results provide miR-203 as a molecular indicator of heterogeneity of OLP, and also a potential diagnostic biomarker or therapeutic target that deserves further studies.

Lump Solution of (2+1)-Dimensional Boussinesq Equation

A class of lump solutions of(2+1)-dimensional Boussinesq equation are obtained with the help of Maple by using Hirota bilinear method.Some contour plots with different determinant values are sequentially made to show that the corresponding lump solution tends to zero when the determinant approaches zero.The particular lump solutions with specific values of the involved parameters are plotted,as illustrative examples.

DETERMINATION OF THE DENSEST SUBGRAPH

Define the density d(G) of a graph G as (ε(G))/(v(G)). A polynomialalgorithm for finding the densest subgraph of a graph is provided. Some results related to thedensity of the densest subgraph of a graph are obtained as well.

A method for brain 3D surface reconstruction from MR images

Due to the encephalic tissues are highly irregular, three-dimensional （3D） modeling of brain always leads to compli- cated computing. In this paper, we explore an efficient method for brain surface reconstruction from magnetic reso- nance （MR） images of head, which is helpful to surgery planning and tumor localization. A heuristic algorithm is pro- posed foi＂ surface triangle mesh generation with preserved features, and the diagonal length is regarded as the heuristic information to optimize the shape of triangle. The experimental results show that our approach not only reduces the computational complexity, but also completes 3D visualization with good quality.

A Semi-Fragile Wavelet Transform Watermarking Scheme for Content Authentication of Images

A novel semi-fragile watermarking scheme for the content authentication of images using wavelet transform(WT) is presented in this paper.It is tolerant to the embedded wavelet image compression methods based on WT such as embedded zerotree wavelet(EZW) ,set partitioning in hierarchical trees(SPIHT) and embedded block coding with optimized truncation(EBCOT) in JPEG2000 to a pre-determined bit-plane,but is sensitive to all other malicious attacks.The image features are generated from the lowest-frequency(LF) subband of the original image as the embedded watermark.The watermark is embedded into the pre-determined bit-plane by adjusting the corresponding values in the given subband.In the process of watermarking authentication,we compare the image features generated from the LF subband of the received image with the embedded watermarking information(the image features of the original image) extracted from the pre-determined bit-plane in the given subband of the received image to decide whether the image is attacked maliciously or processed acceptably(the embedded wavelet compression) .The most important advantage of our watermarking scheme is that the watermark information can be extracted from the watermarked image when detecting watermark,so the received image authentication needs no information about the original image or watermark.Experimental results prove the effectiveness of our proposed watermarking scheme.