R ＆ D STRATEGIC INVESTMENT IN AN ASYMMETRICAL CASE

This article analyzes R ＆ D investment decisions in an asymmetrical case. The investment decisions share three important characteristics. First, the investment is completely irreversible. Second, there are two kinds of uncertainties over the future returns from the investment and over technology in R ＆ D process, respectively. Third, there is strategic competition in the asymmetrical case. This article presents the optimal investment threshold values and the optimal investment rule of high-efficient firm （leader）, and shows that the investment threshold values are reduced by competition of two firms. Finally, the mixed investment strategies for two firms, the probability that each firm separately exercises the option to invest, and the probability that two firms simultaneously exercise the option are given in the paper.     

DEGREE CONDITIONS FOR GRAPHS TO BE FRACTIONAL （a, b, n）-CRITICAL GRAPHS

Let G be a graph, and a and b be integers with a ≤ b. A graph G is called a fraetional （a, b, n）-critical graph if after any n vertices of G are deleted the remaining subgraph has a fractional [a, b]-factor. In this paper two degree conditions for graphs to be fractional （a, b, n）-eritical graphs are presented, and the degree conditions are sharp in some sense.     

Homology Priority Task Scheduling in μC/OS-Ⅱ Real-Time Kernel

μC/OS-Ⅱ is an open source real-time kernel adopting priority preemptive schedule strategy. Aiming at the problem of μC/OS-Ⅱ failing to support homology priority tasks scheduling, an approach for solution is proposed. The basic idea is adding round-robin scheduling strategy in its original scheduler in order to schedule homology priority tasks through time slice roundrobin. Implementation approach is given in detail. Firstly, the Task Control Block （TCB） is extended. And then, a new priority index table is created, in which each index pointer points to a set of homology priority tasks. Eventually, on the basis of reconstructing μC/OS-Ⅱ real-time kernel, task scheduling module is rewritten. Otherwise, schedulability of homology task supported by modified kernel had been analyzed, and deadline formula of created homology tasks is given. By theoretical analysis and experiment verification, the modified kernel can support homology priority tasks scheduling, meanwhile, it also remains preemptive property of original μC/OS-Ⅱ.     

Finding finer functions for partially characterized proteins by protein-protein interaction networks

Based on high-throughput data, numerous algorithms have been designed to find functions of novel proteins. However, the effectiveness of such algorithms is currently limited by some fundamental factors, including (1) the low a-priori probability of novel proteins participating in a detailed function; (2) the huge false data present in high-throughput datasets; (3) the incomplete data coverage of functional classes; (4) the abundant but heterogeneous negative samples for training the algorithms; and (5) the lack of detailed functional knowledge for training algorithms. Here, for partially characterized proteins, we suggest an approach to finding their finer functions based on protein interaction sub-networks or gene expression patterns, defined in function-specific subspaces. The proposed approach can lessen the above-mentioned problems by properly defining the prediction range and functionally filtering the noisy data, and thus can efficiently find proteins’ novel functions. For thousands of yeast and human proteins partially characterized, it is able to reliably find their finer functions (e.g., the translational functions) with more than 90% precision. The predicted finer functions are highly valuable both for guiding the follow-up wet-lab validation and for providing the necessary data for training algorithms to learn other proteins.     

AVAILABILITY ANALYSIS OF THE QUEUEING SYSTEM GI/PH/I WITH SERVER BREAKDOWNS

In the existing literature of Repairable Queueing Systems (RQS), i.e., queueing systems with server breakdowns, it is almost all assumed that interarrival times of successive customers are independent, identically exponentially distributed. In this paper, we deal with more generic system GI/PH/1 with server's exponential uptime and phase-type repair time. With matrix analysis theory, we establish the equilibrium condition and the characteristics of the system, derive the transient and stationary availability behavior of the system.     

Abnormal dielectric characteristics of PMN-32%PT single crystal under dc bias

It has been reported that the single crystal of relaxor ferroelectrics (1-x)Pb(Mg1/3Nb2/3)O3-xPbTiO3 (PMN-xPT) with the compositions near the morphotropic phase boundary (MPB, 0.28相似文献   

Applying Petri-Net-Based Reduction Approach for Verifying the Correctness of Workflow Models

0 IntroductionTobadaseyd’s o nintfhoer mflaotiwonof s ywsotrekmss t hhraovueg hbe tehne doervgealnoipzead-tion rather than based ontasks .Duetothistrend,work-flowand business process technology has been applied tovarious applications such as ERP, groupwares , E-mar-ketplaces , E-business etc . When business processes areapplied to these applications ,business processes are de-fined by process designers and business process instancesare executed by workflowengines or workflow manage-ment sys…     

Harmony Theory

To aim directly at the negative effectiveness widely existing in socio-economic sys-tems,this paper puts forward a framework of "harmony theory"which can decrease the negativeeffectiveness and guarantee systems to be stably developing.     

Diagnosis of prostate cancer by quantitative analysis of 3DMRSI data: A new model

Three-dimensional magnetic resonance spectroscopic imaging (3DMRSI) is helpful to identify prostate cancer (PC)from benign prostate hyperplasia (BPH) and to show the distribution of tumor infiltration. Combined with the (Cho + Cre)/Cit ratio, the z-score model can effectively discriminate prostate cancer from stromal benign prostate hyperplasia (sBPH) and detect small malignant lesions (SML).     

Construction of a genetic map with SRAP markers and localization of the gene responsible for the first-flower-node trait in cucumber (Cucumis sativus L.)

With an F2 population from the cross of two cucumber inbred lines, S06 and S52, sequence-related amplified polymorphism (SRAP) was used to construct a genetic linkage map in cucumber (Cucumis sativus L.). Sixty-four SRAP primer combinations generated 108 polymorphic bands in the F2 population analysis. The average of polymorphic bands produced by one primer pair was 1.5, and the maximum was 5. Using Mapmaker 3.0, a linkage map was constructed, which consisted of 77 SRAP markers distributed in nine linkage groups (LOD≥3.0) and spanned 1114.2 cM with an average interval of 14.5 cM between markers. The gene for the first-flower-node trait, termed ffn, was mapped to linkage group Ⅸ, flanked by DC1EM5 and ME7EM2A at 10.3 cM and 12.1 cM distance, respectively.