Let H, K be infinite dimensional complex Hilbert spaces, and A, B be factor von Neumann algebras on H and K, respectively. It is shown that every surjective map completely preserving Jordan 1-＊-zero-product from A to...Let H, K be infinite dimensional complex Hilbert spaces, and A, B be factor von Neumann algebras on H and K, respectively. It is shown that every surjective map completely preserving Jordan 1-＊-zero-product from A to B is a nonzero scalar multiple of either a linear＊-isomorphism or a conjugate linear ＊-isomorphism.展开更多
Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Anneal...Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The pa- per outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing (QoSR) in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time.展开更多
By characterizing the bijections preserving orthogonality of idempotents in both directions on the infinite dimensional complete indefinite inner product spaces,we obtain the concrete form of surjective maps completel...By characterizing the bijections preserving orthogonality of idempotents in both directions on the infinite dimensional complete indefinite inner product spaces,we obtain the concrete form of surjective maps completely preserving indefinite Jordan 1-†-zero product between†-standard operator algebras.Our results show that such maps are nonzero constant multiple of isomorphisms or conjugate isomorphisms.展开更多
Regularized minimization problems with nonconvex, nonsmooth, even non-Lipschitz penalty functions have attracted much attention in recent years, owing to their wide applications in statistics, control,system identific...Regularized minimization problems with nonconvex, nonsmooth, even non-Lipschitz penalty functions have attracted much attention in recent years, owing to their wide applications in statistics, control,system identification and machine learning. In this paper, the non-Lipschitz ?_p(0 < p < 1) regularized matrix minimization problem is studied. A global necessary optimality condition for this non-Lipschitz optimization problem is firstly obtained, specifically, the global optimal solutions for the problem are fixed points of the so-called p-thresholding operator which is matrix-valued and set-valued. Then a fixed point iterative scheme for the non-Lipschitz model is proposed, and the convergence analysis is also addressed in detail. Moreover,some acceleration techniques are adopted to improve the performance of this algorithm. The effectiveness of the proposed p-thresholding fixed point continuation(p-FPC) algorithm is demonstrated by numerical experiments on randomly generated and real matrix completion problems.展开更多
This paper first reflects the sales stability of dishes by defining the calculation method of average profit and selects appropriate dishes based on the relationship between profits.Then,according to the greedy algori...This paper first reflects the sales stability of dishes by defining the calculation method of average profit and selects appropriate dishes based on the relationship between profits.Then,according to the greedy algorithm,the daily replenishment quantity can be optimized into six complete knapsack problems.Finally,the genetic algorithm can solve the selection frequency and weight of each dish.The calculation results show that the maximum profit of the supermarket is 1102.2189 yuan.展开更多
基金Supported by the National Natural Science Foundation of China(Grant No.11501401)
文摘Let H, K be infinite dimensional complex Hilbert spaces, and A, B be factor von Neumann algebras on H and K, respectively. It is shown that every surjective map completely preserving Jordan 1-＊-zero-product from A to B is a nonzero scalar multiple of either a linear＊-isomorphism or a conjugate linear ＊-isomorphism.
基金Supported by the National Natural Science Foundation of China (No.60472104), the Natural Science Research Program of Jiangsu Province (No.04KJB510094).
文摘Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The pa- per outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing (QoSR) in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time.
文摘By characterizing the bijections preserving orthogonality of idempotents in both directions on the infinite dimensional complete indefinite inner product spaces,we obtain the concrete form of surjective maps completely preserving indefinite Jordan 1-†-zero product between†-standard operator algebras.Our results show that such maps are nonzero constant multiple of isomorphisms or conjugate isomorphisms.
基金supported by National Natural Science Foundation of China(Grant Nos.11401124 and 71271021)the Scientific Research Projects for the Introduced Talents of Guizhou University(Grant No.201343)the Key Program of National Natural Science Foundation of China(Grant No.11431002)
文摘Regularized minimization problems with nonconvex, nonsmooth, even non-Lipschitz penalty functions have attracted much attention in recent years, owing to their wide applications in statistics, control,system identification and machine learning. In this paper, the non-Lipschitz ?_p(0 < p < 1) regularized matrix minimization problem is studied. A global necessary optimality condition for this non-Lipschitz optimization problem is firstly obtained, specifically, the global optimal solutions for the problem are fixed points of the so-called p-thresholding operator which is matrix-valued and set-valued. Then a fixed point iterative scheme for the non-Lipschitz model is proposed, and the convergence analysis is also addressed in detail. Moreover,some acceleration techniques are adopted to improve the performance of this algorithm. The effectiveness of the proposed p-thresholding fixed point continuation(p-FPC) algorithm is demonstrated by numerical experiments on randomly generated and real matrix completion problems.
文摘This paper first reflects the sales stability of dishes by defining the calculation method of average profit and selects appropriate dishes based on the relationship between profits.Then,according to the greedy algorithm,the daily replenishment quantity can be optimized into six complete knapsack problems.Finally,the genetic algorithm can solve the selection frequency and weight of each dish.The calculation results show that the maximum profit of the supermarket is 1102.2189 yuan.
