A singular integral of the composite operator
We establish the Poincare-type inequalities for the composition of the homotopy operator and the projection operator. We also obtain some estimates for the integral of the composite operator with a singular density.

title: A note on a nonlocal boundary value problems
abstract: A nonlocal boundary value problems for a second-order ordinary differential equation is considered in this note. An existence result is obtained by the help of the coincidence degree theory.

title: Positive solutions of three-point boundary value problems for the one-dimensional p-laplacian with infinitely many singularities
abstract: We consider thesingular three-point boundary value problems 
(φp(y′))′ + a(t)f(y(t)) = 0, 0 < t < 1, y′(0) = 0, y(1) = βy(ƞ), 
where φp(s) = |s|p−2s, p ≥ 2, 0 < β < 1, 0 < η < 1, f ϵ C([0, + ∞), [0, + ∞)), a: [0,1] → [0, + ∞), andhas countably many singularities in [0, frsol|1/2). We show that there exist countably many positive solutions by using the fixed-point index theory.

title: Note on third-order boundary value problem for differential equations with deviating arguments
abstract: A third-order boundary value problem for differential equations with deviating arguments is considered in this note. An existence result is obtained by the help of the well-known Leray-Schauder Alternative. Also, a uniqueness result is given.

title: Positive solutions of a nonlinear three-point boundary value problem
abstract: In this paper, by using Krasnoselskii's fixed point theorem in a cone, we study the existence of single and multiple positive solutions to the three-point boundary value problem (BVP)y''(t)+a(t)f(y(t))=0,0

title: Scheduling via reinforcement
abstract: Scheduling of a job shop in the presence of limited resources is a challenging decision making process. It is a problem of allocation of different resources to meet various shop needs (or to satisfy the constraints). Past research has had only limited success in properly handling this resource problem. In this paper a detailed analysis of the scheduling process, within an AI framework, is proposed and this highlights the deficiencies in current techniques. It is suggested that the central problem is how to have a global perspective in the scheduling process. In order to deal with the underlying problem, the concept of ‘reinforcement planning’ is proposed. This method builds a reinforcement schedule and uses it to refine out a detailed schedule by inter-level analysis and communication. Based on this idea a scheduling system called RESS-I has been implemented to automatically construct the job shop schedule.

title: A Formal Specification for Web Services Composition and Verification
abstract: Due to the promising features of Web services, their deployment and research are booming. Among them, various techniques for Web service composition have been developed. In this paper, we propose a new composition framework. We use automata to describe behaviors of Web services. Each of underlying Web services can interact with others through asynchronous messages passing according to its interaction role (client or server). All these messages are recorded by a virtual global observer and the observation result is just the composition conversation of Web services. We also develop a formal a top-down verification mechanism on this framework and provide some realizable conditions for a successful composition

title: Esub8: A novel tool to predict protein subcellular localizations in eukaryotic organisms
abstract: BackgroundSubcellular localization of a new protein sequence is very important and fruitful for understanding its function. As the number of new genomes has dramatically increased over recent years, a reliable and efficient system to predict protein subcellular location is urgently needed.ResultsEsub8 was developed to predict protein subcellular localizations for eukaryotic proteins based on amino acid composition. In this research, the proteins are classified into the following eight groups: chloroplast, cytoplasm, extracellular, Golgi apparatus, lysosome, mitochondria, nucleus and peroxisome. We know subcellular localization is a typical classification problem; consequently, a one-against-one (1-v-1) multi-class support vector machine was introduced to construct the classifier. Unlike previous methods, ours considers the order information of protein sequences by a different method. Our method is tested in three subcellular localization predictions for prokaryotic proteins and four subcellular localization predictions for eukaryotic proteins on Reinhardt's dataset. The results are then compared to several other methods. The total prediction accuracies of two tests are both 100% by a self-consistency test, and are 92.9% and 84.14% by the jackknife test, respectively. Esub8 also provides excellent results: the total prediction accuracies are 100% by a self-consistency test and 87% by the jackknife test.ConclusionsOur method represents a different approach for predicting protein subcellular localization and achieved a satisfactory result; furthermore, we believe Esub8 will be a useful tool for predicting protein subcellular localizations in eukaryotic organisms.

title: Demand flow network
abstract: This paper had brought up the conceptual model of demand flow network (DFN) on the basis of supply chains theories. The DFN model, DFN value model and DFN core competency model had also been established and analyzed separately in accordance with related theory. The application of DFN theory also had been studied

title: Identifying comparative sentences in text documents
abstract: This paper studies the problem of identifying comparative sentences in text documents. The problem is related to but quite different from sentiment/opinion sentence identification or classification. Sentiment classification studies the problem of classifying a document or a sentence based on the subjective opinion of the author. An important application area of sentiment/opinion identification is business intelligence as a product manufacturer always wants to know consumers' opinions on its products. Comparisons on the other hand can be subjective or objective. Furthermore, a comparison is not concerned with an object in isolation. Instead, it compares the object with others. An example opinion sentence is "the sound quality of CD player X is poor". An example comparative sentence is "the sound quality of CD player X is not as good as that of CD player Y". Clearly, these two sentences give different information. Their language constructs are quite different too. Identifying comparative sentences is also useful in practice because direct comparisons are perhaps one of the most convincing ways of evaluation, which may even be more important than opinions on each individual object. This paper proposes to study the comparative sentence identification problem. It first categorizes comparative sentences into different types, and then presents a novel integrated pattern discovery and supervised learning approach to identifying comparative sentences from text documents. Experiment results using three types of documents, news articles, consumer reviews of products, and Internet forum postings, show a precision of 79% and recall of 81%. More detailed results are given in the paper.