Abstract:
We introduce an Ishikawa iterative scheme by the viscosity approximate method for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of a nonexpansive mapping in Hilbert space. Then, we prove some strong convergence theorems which extend and generalize S. Takahashi and W. Takahashi's results (2007). 1. Introduction Let be a real Hilbert space and let be a nonempty closed convex subset of . Let be a bifunction from to , where is the set of real numbers. The equilibrium problem for is to find such that The set of solutions of (1.1) is denoted by . Given a mapping , let for all . Then, if and only if for all . Numerous problems in physics, optimization, and economics reduce to find a solution of (1.1); for more details, see [1, 2]. Recall that a self-mapping of a closed convex subset of is nonexpansive [3] if there holds that We denote the set of fixed points of by . There are some methods for approximation of fixed points of a nonexpansive mapping. In 2000, Moudafi [4] introduced the viscosity approximation method for nonexpansive mappings (see [5] for further developments in both Hilbert and Banach spaces). Some methods have been proposed to solve the equilibrium problem; see, for instance, [1, 2, 6, 7]. Recently, Combettes and Hirstoaga [6] introduced an iterative scheme of finding the best approximation to the initial data when is nonempty and proved a strong convergence theorem. S. Takahashi and W. Takahashi [7] introduced a Mann iterative scheme by the viscosity approximation method for finding a common element of the set of solution (1.1) and the set of fixed points of a nonexpansive mapping in a Hilbert space and proved a strong convergence theorem. On the other hand, Ishikawa [8] introduced the following iterative process defined recursively by where the initial guess is taking in arbitrarily, and are sequences in the interval . In this paper, motivated by the ideas in [4–8], we introduce an Ishikawa iterative scheme by the viscosity approximation method for finding a common element of the set of solution (1.1) and the set of fixed points of a nonexpansive mapping in a Hilbert space. Starting with an arbitrary , define sequences , and by where and . We will prove in Section 3 that if the sequences , and of parameters satisfy appropriate conditions, then the sequences , and generated by (1.4) converge strongly to . The results in this paper extend and generalize S. Takahashi and W. Takahashi's results [7]. 2. Preliminaries Let be a real Hilbert space with inner product , and norm and let be a

Abstract:
The title compound, Pr(SO4)(OH), obtained under hydrothermal conditions, consists of PrIII ions coordinated by nine O atoms from six sulfate groups and three hydroxide anions. The bridging mode of the O atoms results in the formation of a three-dimensional framework, stabilized by two O—H...O hydrogen-bonding interactions.

Abstract:
It is well known that a construction project is the process of resource consumption. Especially for large project, more kinds of resources are involved and the amount is very huge. In construction process of a project, the resource is limited and the time is very urgent, so for large scale project management there are some important subjects such as how to effectively distribute resources between each activities and how to effectively utilize limited resources. Therefore, it's of great importance to optimize the allocation of construction resource. This paper analyzes existing problems of resource allocation for large scale project, such as shortest construction duration with limited resource and resource leveling with stationary construction duration. Based on that, the corresponding mathematical optimization model is established and solution method on the basis of genetic algorithm is given. Comparing with traditional methods, better results are given when genetic algorithm is used, which can not only compress project duration in maximum, but also reasonably arrange activity starting time in uncritical path, and adjust the order of resource in different activities, to lower the peak of dynamic resource distribution curve as much as possible and to make resource consumption be in equilibrium state. Application in an engineering case shows that genetic algorithm can solve relative problems of resource allocation optimization in network planning for large-scale project very well and will be widely used in project optimization.

Abstract:
We study generalized Levitin-Polyak well-posedness of vector equilibrium problems with functional constraints as well as an abstract set constraint. We will introduce several types of generalized Levitin-Polyak well-posedness of vector equilibrium problems and give various criteria and characterizations for these types of generalized Levitin-Polyak well-posedness.

Abstract:
We study generalized Levitin-Polyak well-posedness of vector equilibrium problems with functional constraints as well as an abstract set constraint. We will introduce several types of generalized Levitin-Polyak well-posedness of vector equilibrium problems and give various criteria and characterizations for these types of generalized Levitin-Polyak well-posedness.

Abstract:
This paper describes the support for multicast and vlan(virtual LAN) on bcm5695 switch chip , analyzes the advantage of lay3 switch comparing router on LAN, discusses and resolves the difficulty of routing on vlan through hardware address table, and presents the implemention of software.

Abstract:
Principle of electron holography and a new method for producing the electrostatio field specimen are presented. Some dielectric particles supported by a thin carbon film, for example, polystarene latex spheres, 0.31 m in diameter, will become a charged body during the observation in electron microscope because of electrostatic accumulation. Obviously, under the electron beam, the spheres of radius r, acquire a stationary positive charge Q and the resulting field can be simply modelled by that of point charge Q. With the field model, the electrostatic field distribution were observed and the sizes of the charged objects are determined by electron holography.

Abstract:
Domain adaptation learning is a novel effective technique to address pattern classification, in which the prior information for training a learning model is unavailable or insufficient. To minimize the distribution discrepancy between the source domain and target domain is one of the key factors. However, domain adaptation learning may not work well when only considering to minimize the distribution mean discrepancy between source domain and target domain. In the paper, we design a novel domain adaptation learning method based on structure risk minimization model, called DAKSVM (kernel support vector machine for domain adaptation) with respect to support vector machine (SVM) and least-square DAKSVM (LSDAKSVM) with respect to least-square SVM (LS-SVM), respectively to effectively minimize both the distribution mean discrepancy and the distribution scatter discrepancy between source domain and target domain in some reproduced kernel Hilbert space, which is then used to improve the classification performance. Experimental results on artificial and real world problems show the superior or comparable effectiveness of the proposed approach compared to related approaches.

Abstract:
In this paper, one-dimensional scattering centre extraction of radar targets is reviewed. A new classifier based on fuzzy distribution is proposed, which is very much suitable for one-dimensional scattering centre classification. The fuzzy classifier does not require the feature vectors to have the same dimension and allows the training samples to be flexibly chosen for different test samples. Theoretical analysis and simulation results show that the proposed fuzzy classifier can efficiently solve the problem of radar target recognition using one-dimensional scattering centres.