Strategy, networks and systems in the global translation services market

The globalisation of markets has led to an increased demand for language translation services that support and enable communication between economic partners. For example, technical documents, software systems, business documents and web sites all need to be translated into multiple languages for individual national markets, and the information that they contain changes periodically. This paper sets out a theoretical framework that describes the architectures of business processes within and between separate firms that are used to support the delivery and management of services. This is done by coordinating the fit between externally generated problem complexity, from customers, and the internally generated complexity of different potential network configuration solutions. The theoretical framework is an architecture of how complexity is generated and managed at the different structural levels and across the different processual stages of an industry. A case study of thebigword, a major international translation services company, illustrates how the framework is applied in practice. The case study analyses the implementation of an electronic market platform which enables the coordination of the different stakeholders involved in the translation services market. These stakeholders include translators, translation services companies and their clients in a global business network.     

非线性延迟积分微分方程单支方法的散逸性

本文研究了非线性延迟积分微分方程单支方法的散逸性．把G（c3P30）-代数稳定的单支方法应用到以上方程中,得到了在有限维空间和无限维空间的散逸性结果．文章最后,数值试验验证了本文的结论．     

一种人工鱼算法与捕鱼算法相结合的优化方法

在分析人工鱼群算法和捕鱼算法存在不足的基础上,提出了一种人工鱼群算法(AFSA)与采用捕鱼策略的优化算法(FSOA)相结合的混合算法。该算法在优化初期使用AFSA算法搜索局部最优域,而在优化后期则使用FSOA算法在优化前期所初步确定的局部最优域中搜索最优解。实验计算结果表明,该算法具有优化精度高、收敛速度快的特点。     

Global existence and nonexistence for degenerate parabolic equations with nonlinear boundary flux

In this paper, by constructing various kinds of sub- and super-solutions and using the basic properties of M-matrix, we give the necessary and sufficient conditions of global existence for nonnegative solutions to a degenerate parabolic system with completely coupled boundary conditions, which generalize the recent results of, for instance, Cui [Z. Cui, Critical curves of the non-Newtonian polytropic filtration equations coupled with nonlinear boundary conditions, Nonlinear Anal. 68 (2008) 3201–3208], Zhou–Mu [J. Zhou, C. Mu, Algebraic criteria for global existence or blow-up for a boundary coupled system of nonlinear diffusion equations, Appl. Anal. 86 (2007) 1185–1197] etc.     

The global solution for a class of systems of fractional nonlinear Schrödinger equations with periodic boundary condition

In this paper, we consider a class of systems of fractional nonlinear Schrödinger equations. We prove the existence and uniqueness of the global solution to the periodic boundary value problem by using the Faedo-Galërkin method.     

State estimation for fuzzy cellular neural networks with time delay in the leakage term, discrete and unbounded distributed delays

This paper deals with the problem of state estimation for fuzzy cellular neural networks (FCNNs) with time delay in the leakage term, discrete and unbounded distributed delays. In this paper, leakage delay in the leakage term is used to unstable the neuron states. It is challenging to develop a delay dependent condition to estimate the unstable neuron states through available output measurements such that the error-state system is globally asymptotically stable. By constructing the Lyapunov-Krasovskii functional which contains a triple-integral term, an improved delay-dependent stability criterion is derived in terms of linear matrix inequalities (LMIs). However, by using the free-weighting matrices method, a simple and efficient criterion is derived in terms of LMIs for estimation. The restriction such as the time-varying delay which was required to be differentiable or even its time-derivative which was assumed to be smaller than one, are removed. Instead, the time-varying delay is only assumed to be bounded. Finally, numerical examples and its simulations are given to demonstrate the effectiveness of the derived results.     

The convergence analysis and specification of the Population-Based Incremental Learning algorithm

In this paper, we investigate the global convergence properties in probability of the Population-Based Incremental Learning (PBIL) algorithm when the initial configuration p⁽⁰⁾ is fixed and the learning rate α is close to zero. The convergence in probability of PBIL is confirmed by the experimental results. This paper presents a meaningful discussion on how to establish a unified convergence theory of PBIL that is not affected by the population and the selected individuals.     

Global exponential stability in Lagrange sense for neutral type recurrent neural networks

In this paper, the global exponential stability in Lagrange sense for continuous neutral type recurrent neural networks (NRNNs) with multiple time delays is studied. Three different types of activation functions are considered, including general bounded and two types of sigmoid activation functions. By constructing appropriate Lyapunov functions, some easily verifiable criteria for the ultimate boundedness and global exponential attractivity of NRNNs are obtained. These results can be applied to monostable and multistable neural networks as well as chaos control and chaos synchronization.     

Global exponential stability of neural networks with discrete and distributed delays and general activation functions on time scales

By employing time scale calculus theory, free weighting matrix method and linear matrix inequality (LMI) approach, several delay-dependent sufficient conditions are obtained to ensure the existence, uniqueness and global exponential stability of the equilibrium point for the neural networks with both infinite distributed delays and general activation functions on time scales. Both continuous-time and discrete-time neural networks are described under the same framework by the reported method. Illustrated numerical examples are given to show the effectiveness of the theoretical analysis. It is noteworthy that the activation functions are assumed to be neither bounded nor monotone.     

Global data computation in chordal rings

Existing Global Data Computation (GDC) protocols for asynchronous systems are round-based algorithms designed for fully connected networks. In this paper, we discuss GDC in asynchronous chordal rings, a non-fully connected network. The virtual links approach to solve the consensus problem may be applied to GDC for non-fully connected networks, but it incurs high message overhead. To reduce the overhead, we propose a new non-round-based GDC protocol for asynchronous chordal rings with perfect failure detectors. The main advantage of the protocol is that there is no notion of rounds. Every process creates two messages initially, with one message traversing in a clockwise direction and visiting each and every process in the chordal ring. The second message traverses in a counterclockwise direction. When there is direct connection between two processes, a message is sent directly. Otherwise, the message is sent via virtual links. When the two messages return, the process decides according to the information maintained by the two messages. The perfect failure detector of a process need only detect the crash of neighboring processes, and the crash information is disseminated to all other processes. Analysis and comparison with two virtual links approaches show that our protocol reduces message complexity significantly.