We live in a world where we are exposed to everyday changes that information and communication technologies (ICT) give us impose. These changes are largely related to education, and so the introduction of ICT in universities as institutions of higher education, clearly changing the way it is implemented. The policy of "Goce Delcev" University (UGD) is to fully implement ICT in all segments of management, administration and teaching. For this purpose, several projects for e-learning implementation at UGD have been conducted. But, as much as important introduction is, the more important is the acceptance of new technologies in education. Therefore, we shall use a modified Unified Theory of Acceptance and Use of Technology (UTAUT) as the research methodology. The purpose of this paper is understanding teaching staff acceptance and use e-Learning system (ELC) and investigating the influence of seven determinants (four UTAUT determinants, 2 additional determinants and one personal "selfconfidence" determinant). A survey was administered to 92 respondents (teaching staff) to capture their perceptions of e-learning. The findings of this research show that among the seven UTAUT factors, the effort expectancy and facilitating conditions have the strongest effect of intention to use new technology. Also according to the survey, social influence and facilitating conditions are in strongest correlation with the behavioral intention and thereby the most influence on the behavior of participants for acceptance and use of the elearning system.
Conditions for the existence and representations of -, -, and -inverses which satisfy certain conditions on ranges and/or null spaces are introduced. These representations are applicable to complex matrices and involve solutions of certain matrix equations. Algorithms arising from the introduced representations are developed. Particularly, these algorithms can be used to compute the Moore-Penrose inverse, the Drazin inverse, and the usual matrix inverse. The implementation of introduced algorithms is defined on the set of real matrices and it is based on the Simulink implementation of GNN models for solving the involved matrix equations. In this way, we develop computational procedures which generate various classes of inner and outer generalized inverses on the basis of resolving certain matrix equations. As a consequence, some new relationships between the problem of solving matrix equations and the problem of numerical computation of generalized inverses are established. Theoretical results are applicable to complex matrices and the developed algorithms are applicable to both the time-varying and time-invariant real matrices.
1 January 2017 in Mathematical Problems in Engineering
The continuous planar facility location problem with the connected region of feasible solutions bounded by arcs is a particular case of the constrained Weber problem. This problem is a continuous optimization problem which has a nonconvex feasible set of constraints. This paper suggests appropriate modifications of four metaheuristic algorithms which are defined with the aim of solving this type of nonconvex optimization problems. Also, a comparison of these algorithms to each other as well as to the heuristic algorithm is presented. The artificial bee colony algorithm, firefly algorithm, and their recently proposed improved versions for constrained optimization are appropriately modified and applied to the case study. The heuristic algorithm based on modified Weiszfeld procedure is also implemented for the purpose of comparison with the metaheuristic approaches. Obtained numerical results show that metaheuristic algorithms can be successfully applied to solve the instances of this problem of up to 500 constraints. Among these four algorithms, the improved version of artificial bee algorithm is the most efficient with respect to the quality of the solution, robustness, and the computational efficiency.
Our goal is to investigate and exploit an analogy between the scaled hyperpower family (SHPI family) of iterative methods for computing the matrix inverse and the discretization of Zhang Neural Network (ZNN) models. A class of ZNN models corresponding to the family of hyperpower iterative methods for computing generalized inverses is defined on the basis of the discovered analogy. The Simulink implementation in Matlab of the introduced ZNN models is described in the case of scaled hyperpower methods of the order 2 and 3. Convergence properties of the proposed ZNN models are investigated as well as their numerical behavior.