Quantum Dot in Z-shaped Graphene Nanoribbon

Stimulated by recent advances in isolating graphene, we discovered that quantum dot can be trapped in Z-shaped graphene nanoribbon junciton. The topological structure of the junction can confine electronic states completely. By varying junction length, we can alter the spatial confinement and the number of discrete levels within the junction. In addition, quantum dot can be realized regardless of substrate induced static disorder or irregular edges of the junction. This device can be used to easily design quantum dot devices. This platform can also be used to design zero-dimensional functional nanoscale electronic devices using graphene ribbons.Comment: 4 pages, 3 figure

Non-Abelian Collective Excitations in Unlinearized Quark-Gluon Plasma Media

We study the effect of unlinearized medium on the collective excitations in quark-gluon plasma. We present two kinds of non-Abelian oscillation solutions which respectively correspond to weakly and strongly nonlinear coupling of field components in color space. We also show that the weakly nonlinear solution is similar to Abelian-like one but has the frequency shift, which is of order $g^2T$, from eigenfrequency.Comment: 7 page

Near-Infrared Super Resolution Imaging with Metallic Nanoshell Particle Chain Array

We propose a near-infrared super resolution imaging system without a lens or a mirror but with an array of metallic nanoshell particle chain. The imaging array can plasmonically transfer the near-field components of dipole sources in the incoherent and coherent manners and the super resolution images can be reconstructed in the output plane. By tunning the parameters of the metallic nanoshell particle, the plasmon resonance band of the isolate nanoshell particle red-shifts to the near-infrared region. The near-infrared super resolution images are obtained subsequently. We calculate the field intensity distribution at the different planes of imaging process using the finite element method and find that the array has super resolution imaging capability at near-infrared wavelengths. We also show that the image formation highly depends on the coherence of the dipole sources and the image-array distance.Comment: 15 pages, 6 figure

Finite temperature calculations for the bulk properties of strange star using a many-body approach

We have considered a hot strange star matter, just after the collapse of a supernova, as a composition of strange, up and down quarks to calculate the bulk properties of this system at finite temperature with the density dependent bag constant. To parameterize the density dependent bag constant, we use our results for the lowest order constrained variational (LOCV) calculations of asymmetric nuclear matter. Our calculations for the structure properties of the strange star at different temperatures indicate that its maximum mass decreases by increasing the temperature. We have also compared our results with those of a fixed value of the bag constant. It can be seen that the density dependent bag constant leads to higher values of the maximum mass and radius for the strange star.Comment: 21 pages, 2 tables, 12 figures Astrophys. (2011) accepte

An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects

[EN] This paper addresses a sequence dependent setup times no-wait flowshop with learning and forgetting effects to minimize total flowtime. This problem is NP-hard and has never been considered before. A position-based learning and forgetting effects model is constructed. Processing times of operations change with the positions of corresponding jobs in a schedule. Objective increment properties are deduced and based on them three accelerated neighbourhood construction heuristics are presented. Because of the simplicity and excellent performance shown in flowshop scheduling problems, an iterated greedy heuristic is proposed. The proposed iterated greedy algorithm is compared with some existing algorithms for related problems on benchmark instances. Comprehensive computational and statistical tests show that the presented method obtains the best performance among the compared methods. (C) 2018 Elsevier Inc. All rights reserved.This work is supported by the National Natural Science Foundation of China (Nos. 61572127, 61272377), the Collaborative Innovation Center of Wireless Communications Technology and the Key Natural Science Fund for Colleges and Universities in Jiangsu Province (No. 12KJA630001). Ruben Ruiz is partially supported by the Spanish Ministry of Economy and Competitiveness(MINECO), under the project "SCHEYARD - Optimization of Scheduling Problems in Container Yards" with reference DPI2015-65895-R.Li, X.; Yang, Z.; Ruiz García, R.; Chen, T.; Sui, S. (2018). An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects. Information Sciences. 453:408-425. https://doi.org/10.1016/j.ins.2018.04.038S40842545

Epidemiology of invasive group B streptococcal disease in infants from urban area of South China, 2011–2014

YesBackground: Group B Streptococcus (GBS) is a leading cause of morbidity and mortality in infants in both developed and developing countries. To our knowledge, only a few studies have been reported the clinical features, treatment and outcomes of the GBS disease in China. The severity of neonatal GBS disease in China remains unclear. Population-based surveillance in China is therefore required. Methods: We retrospectively collected data of <3 months old infants with culture-positive GBS in sterile samples from three large urban tertiary hospitals in South China from Jan 2011 to Dec 2014. The GBS isolates and their antibiotic susceptibility were routinely identified in clinical laboratories in participating hospitals. Serotyping and multi-locus sequence typing (MLST) were also conducted for further analysis of the neonatal GBS disease. Results: Total 70 cases of culture-confirmed invasive GBS infection were identified from 127,206 live births born in studying hospitals, giving an overall incidence of 0.55 per 1000 live births (95% confidence interval [CI] 0.44–0.69). They consisted of 49 with early-onset disease (EOD, 0.39 per 1000 live births (95% CI 0.29–0.51)) and 21 with late-onset disease (LOD, 0.17 per 1000 live births (95% CI 0.11–0.25)). The incidence of EOD increased significantly over the studying period. Five infants (4 EOD and 1 LOD) died before discharge giving a mortality rate of 7.1% and five infants (7.1%, 2 EOD and 3 LOD) had neurological sequelae. Within 68 GBS isolates from GBS cases who born in the studying hospitals or elsewhere, serotype III accounted for 77.9%, followed by Ib (14.7%), V (4.4%), and Ia (2.9%). MLST analysis revealed the presence of 13 different sequence types among the 68 GBS isolates and ST-17 was the most frequent sequence type (63.2%). All isolates were susceptible to penicillin, ceftriaxone, vancomycin and linezolid, while 57.4% and 51.5% were resistant to erythromycin and clindamycin, respectively. Conclusions: This study gains the insight into the spectrum of GBS infection in south China which will facilitate the development of the guidance for reasonable antibiotics usage and will provide evidence for the implementation of potential GBS vaccines in the future.Supported by medical and health science and technology projects of Health and Family Planning Commission of Guangzhou Municipality (grant number 20151A010034) and Guangdong provincial science and technology planning projects (grant number 2014A020212520)

Multi-Queue Request Scheduling for Profit Maximization in IaaS Clouds

[EN] In cloud computing, service providers rent heterogeneous servers from cloud providers, i.e., Infrastructure as a Service (IaaS), to meet requests of consumers. The heterogeneity of servers and impatience of consumers pose great challenges to service providers for profit maximization. In this article, we transform this problem into a multi-queue model where the optimal expected response time of each queue is theoretically analyzed. A multi-queue request scheduling algorithm framework is proposed to maximize the total profit of service providers, which consists of three components: request stream splitting, requests allocation, and server assignment. A request stream splitting algorithm is designed to split the arriving requests to minimize the response time in the multi-queue system. An allocation algorithm, which adopts a one-step improvement strategy, is developed to further optimize the response time of the requests. Furthermore, an algorithm is developed to determine the appropriate number of required servers of each queue. After statistically calibrating parameters and algorithm components over a comprehensive set of random instances, the proposed algorithms are compared with the state-of-the-art over both simulated and real-world instances. The results indicate that the proposed multi-queue request scheduling algorithm outperforms the other algorithms with acceptable computational time.This work was supported in part by the National Key Research and Development Program of China under Grant 2017YFB1400800, in part by the National Natural Science Foundation of China under Grants 61872077 and 61832004, and in part by the Collaborative InnovationCenter of Wireless Communications Technology. The work of Quan Z. Sheng was supported in part by Australian Research Council Future Fellowship under Grant FT140101247 and in part by Discovery Project under Grant DP180102378. The work of Ruben Ruiz was supported in part by the Spanish Ministry of Science, Innovation, and Universities through the project OPTEP-Port Terminal Operations Optimization under Grant RTI2018-094940-B-I00 financed with FEDER fundsWang, S.; Li, X.; Sheng, QZ.; Ruiz García, R.; Zhang, J.; Beheshti, A. (2021). Multi-Queue Request Scheduling for Profit Maximization in IaaS Clouds. IEEE Transactions on Parallel and Distributed Systems. 32(11):2838-2851. https://doi.org/10.1109/TPDS.2021.3075254S28382851321