Time filter

Source Type

Ho Chi Minh City, Vietnam

Hieu N.N.,Duy Tan University | Nhan L.C.,Saigon University
Physica E: Low-Dimensional Systems and Nanostructures | Year: 2014

Electronic energy band structure of deformed armchair graphene nanoribbons with bond alternation is studied by the tight-binding approximation. In the presence of bond alternation, all armchair graphene nanoribbons become semiconducting with small band gap opened at center of the Brillouin zone. Under tensional strain, armchair graphene nanoribbons can become metallic at the critical values of deformation and we can control the band gap of nanoribbon by its strain. © 2014 Elsevier B.V.

Chuong T.D.,Saigon University | Kim D.S.,Pukyong National University
Mathematics of Operations Research | Year: 2016

We introduce concepts of metric regularity and metric subregularity of a positive-order for an implicit multifunction and provide new sufficient conditions for the implicit multifunctions to achieve the addressed properties. The conditions provided are presented in terms of the Fréchet/Mordukhovich coderivative of the corresponding parametric multifunction formulated the implicit multifunction. We show that such sufficient conditions are also necessary for the metric regularity/subregularity of a positive-order of the implicit multifunction when the corresponding parametric multifunction is (locally) convex and closed. In this way, we establish criteria ensuring that an implicit multifunction is Hölder-like and calm of a positive-order at a given point. As applications, we derive sufficient conditions in terms of coderivatives for a multifunction (resp., its inverse multifunction) to have the open covering property and the metric regularity/subregularity of a positive-order (resp., the Hölder-like/calm property). © 2016 INFORMS.

Thai P.-T.C.,Saigon University | Cong H.T.,Post and Telecommunications Institute of Technology
Studies in Computational Intelligence | Year: 2013

Due to the fast growths of computer networks, traffic engineering (TE) which tries to satisfy both quality of services and resource utilization requirements is an important research area. Among TE mechanisms, routing algorithm - a strategy to select paths for traffic - plays a crucial role and there have been many TE routing proposals. This paper gives a thorough study of these algorithms by presenting their key ideas and mathematical descriptions, and then by various experiments so to analyse their performances with different metrics. The paper also discusses the trend of routing algorithms and future research directions. © Springer-Verlag Berlin Heidelberg 2013.

Chuong T.D.,Saigon University
Numerical Functional Analysis and Optimization | Year: 2011

This article is devoted to developing the generalized proximal algorithm of finding efficient solutions to the vector optimization problem for a mapping from a uniformly convex and uniformly smooth Banach space to a real Banach space with respect to the partial order induced by a pointed closed convex cone. In contrast to most published literature on this subject, our algorithm does not depend on the nonemptiness of ordering cone of the space under consideration and deals with finding efficient solutions of the vector optimization problem in question. We prove that under some suitable conditions the sequence generated by our method weakly converges to an efficient solution of this problem. Copyright © Taylor & Francis Group, LLC.

Van Huan N.,Saigon University | Van Quang N.,Vinh University
Kybernetika | Year: 2012

We establish the Doob inequality for martingale difference arrays and provide a sufficient condition so that the strong law of large numbers would hold for an arbitrary array of random elements without imposing any geometric condition on the Banach space. Some corollaries are derived from the main results, they are more general than some well-known ones.

Discover hidden collaborations