Research on the Common Problems and Corresponding Solutions for the Chinese-foreign Cooperative Education Management

In this paper, we conduct research and survey on the common problems and corresponding solutions for the Chinese-foreign cooperative education management. The training objectives of cooperation in running schools only to adapt to the society and education development rule for their healthy development. According to the economic development and social needs, the Chinese-foreign cooperation in running schools of talent cultivation, mainly reflected in the advanced nature of the program. Our research proposed novel solutions to the general problems and issues need to be solved for the Chinese-foreign cooperative education management which will be meaningful.

Common Problems and Solutions for Beginners in Translation From a Psychological Perspective

With the continuous development of the translation market,more and more students are investing in the study of translation majors.However,for the education of translation majors,Chinese translation educators pay more attention to the imparting of translation theory knowledge and the cultivation of students’translation abilities.There is still room for further improvement in solving common psychological problems and cultivating the psychological qualities of translation beginners.Therefore,this article starts from the common psychological problems of translation beginners,analyzes their causes,and proposes relative solutions to help improve the level of translation psychological education in China.

VISCOSITY APPROXIMATION METHODS FOR THE SPLIT EQUALITY COMMON FIXED POINT PROBLEM OF QUASI-NONEXPANSIVE OPERATORS

Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudafi（Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis）is to find x ∈ F（U）, y ∈ F（T） such that Ax = By,（1）where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F（U） = {x ∈ H;: Ux = x} and F（T） = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in（1）, we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP（1） of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP（1） governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.

Optimisation of a Bus Network Configuration and Frequency Considering the Common Lines Problem

Public transportation network reorganisation can be a key measure in designing more efficient networks and increasing the number of passengers. To date, several authors have proposed models for the “transit route network design problem” (TRNDP), and many of them use a transit assignment model as one component. However, not all models have considered the “common lines problem,” which is an essential feature in transit network assignment and is based on the concept that the fastest way to get to a destination is to take the first vehicle arriving among an “attractive” set of lines. Thus, we sought to reveal the features of considering the common lines problem by comparing results with and without considering the problem in a transit assignment model. For comparison, a model similar to a previous one was used, formulated as a bi-level optimisation problem, the upper problem of which is described as a multi-objective problem. As a result, although the solutions with and without considering the common lines showed almost the same Pareto front, we confirmed that a more direct service is provided if the common lines problem is considered whereas a less direct service is provided if it is not. With a small network case study, we found that considering the common lines problem in the TRNDP is important as it allows operators to provide more direct services.

Problems and solutions regarding generalized functional safety in cyberspace

The common endogenous security problems in cyberspace and related attack threats have posed subversive challenges to conventional theories and methods of functional safety.In the current design of the cyber physical system(CPS),functional safety and cyber security are increasingly intertwined and inseparable,which evolve into the generalized functional safety(S&S)problem.The conventional reliability and cybersecurity technologies are unable to provide security assurance with quanti able design and veri cation metrics in response to the cyberattacks in hardware and software with common endogenous security problems,and the functional safety of CPS facilities or device has become a frightening ghost.The dynamic heterogeneity redundancy(DHR)architecture and coding channel theory(CCT)proposed by the cyberspace endogenous security paradigm could handle random failures and uncertain network attacks in an integrated manner,and its generalized robust control mechanism can solve the universal problem of quantitative design for functional safety under probability or improbability perturbation.As a generalized functional safety enabling structure,DHR opens up a new direction to solve the common endogenous security problems in the cross-disciplinary elds of cyberspace.

Further Investigation into Split Common Fixed Point Problem for Demicontractive Operators

Our contribution in this paper is to propose an iterative algorithm which does not reqmre prior knowledge of operator norm and prove strong convergence theorem for approximating a solution of split common fixed point problem of demicontractive mappings in a real Hilbert space. So many authors have used algorithms involving the operator norm for solving split common fixed point problem, but as widely known the computation of these Mgorithms may be difficult and for this reason, authors have recently started constructing iterative algorithms with a way of selecting the step-sizes such that the implementation of the algorithm does not require the calculation or estimation of the operator norm. We introduce a new algorithm for solving the split common fixed point problem for demicontractive mappings with a way of selecting the step-sizes such that the implementation of the Mgorithm does not require the calculation or estimation of the operator norm and then prove strong convergence of the sequence in real Hilbert spaces. Finally, we give some applications of our result and numerical example at the end of the paper.