Consequences of the formation of Cooper-pairs near oxygen-deficient sites

In this investigation we consider the formation of Cooper pairs near the oxygen-deficient sites in Y-Ba-Cu-O ceramic superconductors which would give rise to an energy-dependent potential as seen by conduction charge carriers. It is shown that Cooper pairs could be formed under such conditions, resulting in a supercurrent. We use the Bogoliubov transformation technique to calculate the energy gap, the energy difference, and the transition temperature of the model superconductor using certain data obtained from previous experiments. Numerical analysis shows that the superconducting current can be explained by the presence of such oscillating Cooper pairs.     

Persistence of nonprotein seed amino acid s-(β-carboxyethyl)-cysteine in young leaves ofCalliandra rubescens Ecological implications

The insecticidal nonprotein amino acid S-(-carboxyethyl)-cysteine (S-CEC) is the major free amino acid in the seeds of severalCalliandra spp. where it accounts for up to 2.9 % of dry weight. Lesser amounts of other related S-containing amino acids and an array of nonprotein imino acids derived from pipecolic acid are other constituents. High concentrations of imino acids, which also show insecticidal activity, are maintained in the mature leaves, but sulfur compounds are lacking. In this study the disappearance of S-CEC from the germinating seeds and young seedlings ofC. rubescens was monitored over time. After 10 weeks, S-CEC continues to be found in high concentrations in the stems and new leaves. As young leaves mature, sulfur compounds quickly decrease in concentration. Traces of S-CEC are found in new leaves of plants up to nine months after germination. Whether high concentration of S-CEC in young leaves is due to transportation from the seed or de novo synthesis is unclear. The ecological implications are discussed.     

α-Tocopherol alteration of soybean antiherbivory toTrichoplusia ni larvae

The antioxidant vitamin E, -tocopherol, was tested as a candidate elicitor of alterable antiherbivory in soybean plants against cabbage looper larvae. Although a nonspecific antioxidant, vitamin E proved elicitory to the involved sulfhydryl-dependent receptor-energy transducer protein in soybean plasma membrane. Effects of -tocopherol were dependent on dosage, time, and space in the plant. The observed elicited effects were all decreases in herbivory. The best negative phytochemical correlate of looper feeding was the percentage of increased total HPLC peak area of extractables from elicited as compared to nonelicited leaves. Some specific compounds, e.g., glyceollins, were quantitatively major components of the total profile of secondary metabolites.     

基于无秩树自动机的信息抽取技术研究

针对目前基于网页结构的信息抽取方法的缺陷,提出了一种基于无秩树自动机的信息抽取技术,其核心思想是通过将结构化(半结构化)文档转换成无秩树,然后利用(k,l)-contextual树构造样本自动机,依据树自动机接收和拒绝状态来对网页进行数据的抽取.该方法充分利用结构,依托树自动机将传统的以单一结构途径的信息抽取方法与文法推理原则相结合,得到信息抽取规则.实验结果表明,该方法与同类抽取方法相比在准确率、召回率以及抽取所需时间上均有所提高.     

一种细胞核内DNA物质含量准确测量及回归校正新方法

在定量细胞学研究中,细胞核内DNA物质含量的准确测量是癌症筛查与病理诊断的必要前题与最重要依据。由于算法、设备、环境等因素的影响,在对细胞核的数字显微图像进行处理与分析、测量DNA物质含量时会产生较大的误差。本文提出了一种基于数学形态学和k近邻回归算法的DNA物质含量校正新方法。该方法首先利用膨涨算法对细胞核分割掩码进行处理,从而对DNA物质含量的测量进行空间校正;然后采用k近邻回归算法,充分利用细胞核的形态、纹理等特征参数所蕴含的信息,从而对DNA物质含量进行光学回归校正。实验表明,该方法能够显著提高DNA物质含量测量的准确性和可信度,对提高病理诊断的特异性与敏感性都有积极的意义。     

αB-spline: a linear singular blending B-spline

A linear singular blending (LSB) technique can enhance the shape—control capability of the B-spline. This capability is derived from the blending parameters defined at the B-spline control vertices and blends LSB line segments or bilinear surface patches with the B-spline curve or surface. Varying the blending parameters between zero and unity applies tension for reshaping. The reshaped curve or surface retains the same smoothness properties as the original B-spline; it possesses the same strict parametric continuities. This is different from the -spline, which introduces additional control to the B-spline by imposing geometrical continuities to the joints of curve segments or surface patches. For applications in which strict parametric continuities cannot be compromised, LSB provides an intuitive way to introduce tension to the B-spline.     

ADAPTIVE RANKS CLONE AND k‐NEAREST NEIGHBOR LIST–BASED IMMUNE MULTI‐OBJECTIVE OPTIMIZATION

Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS‐based algorithms typically exploit the immune system's characteristics of learning and adaptability to solve some complicated problems. Although, several AIS‐based algorithms have proposed to solve multi‐objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one‐off deletion could not obtain excellent diversity in the final population; therefore, a k‐nearest neighbor list (where k is the number of objectives) is established and maintained to eliminate the solutions in the archive population. The k‐nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product of k‐nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well‐known and frequently used multi‐objective problems and two many‐objective problems with 4, 6, and 8 objectives. Compared with five other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time.     

An inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities

In this paper, we investigate an inexact hybrid projection-proximal method for solving a class of generalized mixed variational inequalities in Hilbert spaces. We construct a general inexact hybrid projection-proximal point algorithm, in which an inexact relaxed proximal point step is followed by a suitable orthogonal projection onto a hyperplane. Under some suitable conditions concerned with the pseudomonotone set-valued mapping T, the nonsmooth convex function f and the step size λ_k, we prove the convergence of the inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities in Hilbert spaces.     

Prevalence and personality correlates of Facebook bullying among university undergraduates

The purpose of the present study was to examine the prevalence of cyber-bullying through Facebook in a sample of 226 Greek university undergraduates, and to explore whether big five personality characteristics, narcissism, as well as attitudes toward Facebook, technological knowledge and skills were predictive of such behavior. Participants completed a self-report questionnaire measuring the above constructs. Results indicated that almost one third of the sample reported Facebook bullying engagement at least once during the past month, with male students reporting more frequent involvement than females. Bullying through Facebook was predicted by low Agreeableness and more time spent on Facebook only for males, whereas for females none of the studied variables predicted engagement in Facebook bullying. Findings are discussed in terms of prevention and intervention strategies.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.