Peking University

Functionality-specific vulnerabilities, which mainly occur in Application Programming Interfaces (APIs) with specific functionalities, are crucial for software developers to detect and avoid. When detecting individual functionality-specific vulnerabilities, the existing two categories of approaches are ineffective because they consider only the API bodies and are unable to handle diverse implementations of functionality-equivalent APIs. To effectively detect functionality-specific vulnerabilities, we propose APISS, the first approach to utilize API doc strings and signatures instead of API bodies. APISS first retrieves functionality-equivalent APIs for APIs with existing vulnerabilities and then migrates Proof-of-Concepts (PoCs) of the existing vulnerabilities for newly detected vulnerable APIs. To retrieve functionality-equivalent APIs, we leverage a Large Language Model for API embedding to improve the accuracy and address the effectiveness and scalability issues suffered by the existing approaches. To migrate PoCs of the existing vulnerabilities for newly detected vulnerable APIs, we design a semi-automatic schema to substantially reduce manual costs. We conduct a comprehensive evaluation to empirically compare APISS with four state-of-the-art approaches of detecting vulnerabilities and two state-of-the-art approaches of retrieving functionality-equivalent APIs. The evaluation subjects include 180 widely used Java repositories using 10 existing vulnerabilities, along with their PoCs. The results show that APISS effectively retrieves functionality-equivalent APIs, achieving a Top-1 Accuracy of 0.81 while the best of the baselines under comparison achieves only 0.55. APISS is highly efficient: the manual costs are within 10 minutes per vulnerability and the end-to-end runtime overhead of testing one candidate API is less than 2 hours. APISS detects 179 new vulnerabilities and receives 60 new CVE IDs, bringing high value to security practice.

Tremendous amount of RNA sequencing data have been produced by large consortium projects such as TCGA and GTEx, creating new opportunities for data mining and deeper understanding of gene functions. While certain existing web servers are valuable and widely used, many expression analysis functions needed by experimental biologists are still not adequately addressed by these tools. We introduce GEPIA (Gene Expression Profiling Interactive Analysis), a web-based tool to deliver fast and customizable functionalities based on TCGA and GTEx data. GEPIA provides key interactive and customizable functions including differential expression analysis, profiling plotting, correlation analysis, patient survival analysis, similar gene detection and dimensionality reduction analysis. The comprehensive expression analyses with simple clicking through GEPIA greatly facilitate data mining in wide research areas, scientific discussion and the therapeutic discovery process. GEPIA fills in the gap between cancer genomics big data and the delivery of integrated information to end users, thus helping unleash the value of the current data resources. GEPIA is available at http://gepia.cancer-pku.cn/.

The way that information propagates in neural networks is of great importance. In this paper, we propose Path Aggregation Network (PANet) aiming at boosting information flow in proposal-based instance segmentation framework. Specifically, we enhance the entire feature hierarchy with accurate localization signals in lower layers by bottom-up path augmentation, which shortens the information path between lower layers and topmost feature. We present adaptive feature pooling, which links feature grid and all feature levels to make useful information in each level propagate directly to following proposal subnetworks. A complementary branch capturing different views for each proposal is created to further improve mask prediction. These improvements are simple to implement, with subtle extra computational overhead. Yet they are useful and make our PANet reach the 1st place in the COCO 2017 Challenge Instance Segmentation task and the 2nd place in Object Detection task without large-batch training. PANet is also state-of-the-art on MVD and Cityscapes.

We have converted nanoscale mechanical energy into electrical energy by means of piezoelectric zinc oxide nanowire (NW) arrays. The aligned NWs are deflected with a conductive atomic force microscope tip in contact mode. The coupling of piezoelectric and semiconducting properties in zinc oxide creates a strain field and charge separation across the NW as a result of its bending. The rectifying characteristic of the Schottky barrier formed between the metal tip and the NW leads to electrical current generation. The efficiency of the NW-based piezoelectric power generator is estimated to be 17 to 30%. This approach has the potential of converting mechanical, vibrational, and/or hydraulic energy into electricity for powering nanodevices.

We discuss the theoretical bases that underpin the automation of the computations of tree-level and next-to-leading order cross sections, of their matching to parton shower simulations, and of the merging of matched samples that differ by light-parton multiplicities. We present a computer program, MadGraph5 aMC@NLO, capable of handling all these computations — parton-level fixed order, shower-matched, merged — in a unified framework whose defining features are flexibility, high level of parallelisation, and human intervention limited to input physics quantities. We demonstrate the potential of the program by presenting selected phenomenological applications relevant to the LHC and to a 1-TeV e + e − collider. While next-to-leading order results are restricted to QCD corrections to SM processes in the first public version, we show that from the user viewpoint no changes have to be expected in the case of corrections due to any given renormalisable Lagrangian, and that the implementation of these are well under way.

The Review summarizes much of particle physics and cosmology. Using data from previous editions, plus 2,873 new measurements from 758 papers, we list, evaluate, and average measured properties of gauge bosons and the recently discovered Higgs boson, leptons, quarks, mesons, and baryons. We summarize searches for hypothetical particles such as supersymmetric particles, heavy bosons, axions, dark photons, etc. Particle properties and search limits are listed in Summary Tables. We give numerous tables, figures, formulae, and reviews of topics such as Higgs Boson Physics, Supersymmetry, Grand Unified Theories, Neutrino Mixing, Dark Energy, Dark Matter, Cosmology, Particle Detectors, Colliders, Probability and Statistics. Among the 118 reviews are many that are new or heavily revised, including a new review on Neutrinos in Cosmology.Starting with this edition, the Review is divided into two volumes. Volume 1 includes the Summary Tables and all review articles. Volume 2 consists of the Particle Listings. Review articles that were previously part of the Listings are now included in volume 1.The complete Review (both volumes) is published online on the website of the Particle Data Group (http://pdg.lbl.gov) and in a journal. Volume 1 is available in print as the PDG Book. A Particle Physics Booklet with the Summary Tables and essential tables, figures, and equations from selected review articles is also available.The 2018 edition of the Review of Particle Physics should be cited as: M. Tanabashi et al. (Particle Data Group), Phys. Rev. D 98, 030001 (2018).

Abstract Black carbon aerosol plays a unique and important role in Earth's climate system. Black carbon is a type of carbonaceous material with a unique combination of physical properties. This assessment provides an evaluation of black‐carbon climate forcing that is comprehensive in its inclusion of all known and relevant processes and that is quantitative in providing best estimates and uncertainties of the main forcing terms: direct solar absorption; influence on liquid, mixed phase, and ice clouds; and deposition on snow and ice. These effects are calculated with climate models, but when possible, they are evaluated with both microphysical measurements and field observations. Predominant sources are combustion related, namely, fossil fuels for transportation, solid fuels for industrial and residential uses, and open burning of biomass. Total global emissions of black carbon using bottom‐up inventory methods are 7500 Gg yr −1 in the year 2000 with an uncertainty range of 2000 to 29000. However, global atmospheric absorption attributable to black carbon is too low in many models and should be increased by a factor of almost 3. After this scaling, the best estimate for the industrial‐era (1750 to 2005) direct radiative forcing of atmospheric black carbon is +0.71 W m −2 with 90% uncertainty bounds of (+0.08, +1.27) W m −2 . Total direct forcing by all black carbon sources, without subtracting the preindustrial background, is estimated as +0.88 (+0.17, +1.48) W m −2 . Direct radiative forcing alone does not capture important rapid adjustment mechanisms. A framework is described and used for quantifying climate forcings, including rapid adjustments. The best estimate of industrial‐era climate forcing of black carbon through all forcing mechanisms, including clouds and cryosphere forcing, is +1.1 W m −2 with 90% uncertainty bounds of +0.17 to +2.1 W m −2 . Thus, there is a very high probability that black carbon emissions, independent of co‐emitted species, have a positive forcing and warm the climate. We estimate that black carbon, with a total climate forcing of +1.1 W m −2 , is the second most important human emission in terms of its climate forcing in the present‐day atmosphere; only carbon dioxide is estimated to have a greater forcing. Sources that emit black carbon also emit other short‐lived species that may either cool or warm climate. Climate forcings from co‐emitted species are estimated and used in the framework described herein. When the principal effects of short‐lived co‐emissions, including cooling agents such as sulfur dioxide, are included in net forcing, energy‐related sources (fossil fuel and biofuel) have an industrial‐era climate forcing of +0.22 (−0.50 to +1.08) W m −2 during the first year after emission. For a few of these sources, such as diesel engines and possibly residential biofuels, warming is strong enough that eliminating all short‐lived emissions from these sources would reduce net climate forcing (i.e., produce cooling). When open burning emissions, which emit high levels of organic matter, are included in the total, the best estimate of net industrial‐era climate forcing by all short‐lived species from black‐carbon‐rich sources becomes slightly negative (−0.06 W m −2 with 90% uncertainty bounds of −1.45 to +1.29 W m −2 ). The uncertainties in net climate forcing from black‐carbon‐rich sources are substantial, largely due to lack of knowledge about cloud interactions with both black carbon and co‐emitted organic carbon. In prioritizing potential black‐carbon mitigation actions, non‐science factors, such as technical feasibility, costs, policy design, and implementation feasibility play important roles. The major sources of black carbon are presently in different stages with regard to the feasibility for near‐term mitigation. This assessment, by evaluating the large number and complexity of the associated physical and radiative processes in black‐carbon climate forcing, sets a baseline from which to improve future climate forcing estimates.

Abstract The Review summarizes much of particle physics and cosmology. Using data from previous editions, plus 2,143 new measurements from 709 papers, we list, evaluate, and average measured properties of gauge bosons and the recently discovered Higgs boson, leptons, quarks, mesons, and baryons. We summarize searches for hypothetical particles such as supersymmetric particles, heavy bosons, axions, dark photons, etc. Particle properties and search limits are listed in Summary Tables. We give numerous tables, figures, formulae, and reviews of topics such as Higgs Boson Physics, Supersymmetry, Grand Unified Theories, Neutrino Mixing, Dark Energy, Dark Matter, Cosmology, Particle Detectors, Colliders, Probability and Statistics. Among the 120 reviews are many that are new or heavily revised, including a new review on Machine Learning, and one on Spectroscopy of Light Meson Resonances. The Review is divided into two volumes. Volume 1 includes the Summary Tables and 97 review articles. Volume 2 consists of the Particle Listings and contains also 23 reviews that address specific aspects of the data presented in the Listings. The complete Review (both volumes) is published online on the website of the Particle Data Group (pdg.lbl.gov) and in a journal. Volume 1 is available in print as the PDG Book. A Particle Physics Booklet with the Summary Tables and essential tables, figures, and equations from selected review articles is available in print, as a web version optimized for use on phones, and as an Android app.

AUTORES: Daniel J Klionsky1745,1749*, Kotb Abdelmohsen840, Akihisa Abe1237, Md Joynal Abedin1762, Hagai Abeliovich425,
\nAbraham Acevedo Arozena789, Hiroaki Adachi1800, Christopher M Adams1669, Peter D Adams57, Khosrow Adeli1981,
\nPeter J Adhihetty1625, Sharon G Adler700, Galila Agam67, Rajesh Agarwal1587, Manish K Aghi1537, Maria Agnello1826,
\nPatrizia Agostinis664, Patricia V Aguilar1960, Julio Aguirre-Ghiso784,786, Edoardo M Airoldi89,422, Slimane Ait-Si-Ali1376,
\nTakahiko Akematsu2010, Emmanuel T Akporiaye1097, Mohamed Al-Rubeai1394, Guillermo M Albaiceta1294,
\nChris Albanese363, Diego Albani561, Matthew L Albert517, Jesus Aldudo128, Hana Alg€ul1164, Mehrdad Alirezaei1198,
\nIraide Alloza642,888, Alexandru Almasan206, Maylin Almonte-Beceril524, Emad S Alnemri1212, Covadonga Alonso544,
\nNihal Altan-Bonnet848, Dario C Altieri1205, Silvia Alvarez1497, Lydia Alvarez-Erviti1395, Sandro Alves107,
\nGiuseppina Amadoro860, Atsuo Amano930, Consuelo Amantini1554, Santiago Ambrosio1458, Ivano Amelio756,
\nAmal O Amer918, Mohamed Amessou2089, Angelika Amon726, Zhenyi An1538, Frank A Anania291, Stig U Andersen6,
\nUsha P Andley2079, Catherine K Andreadi1690, Nathalie Andrieu-Abadie502, Alberto Anel2027, David K Ann58,
\nShailendra Anoopkumar-Dukie388, Manuela Antonioli832,858, Hiroshi Aoki1791, Nadezda Apostolova2007,
\nSaveria Aquila1500, Katia Aquilano1876, Koichi Araki292, Eli Arama2098, Agustin Aranda456, Jun Araya591,
\nAlexandre Arcaro1472, Esperanza Arias26, Hirokazu Arimoto1225, Aileen R Ariosa1749, Jane L Armstrong1930,
\nThierry Arnould1773, Ivica Arsov2120, Katsuhiko Asanuma675, Valerie Askanas1924, Eric Asselin1867, Ryuichiro Atarashi794,
\nSally S Atherton369, Julie D Atkin713, Laura D Attardi1131, Patrick Auberger1787, Georg Auburger379, Laure Aurelian1727,
\nRiccardo Autelli1992, Laura Avagliano1029,1755, Maria Laura Avantaggiati364, Limor Avrahami1166, Suresh Awale1986,
\nNeelam Azad404, Tiziana Bachetti568, Jonathan M Backer28, Dong-Hun Bae1933, Jae-sung Bae677, Ok-Nam Bae409,
\nSoo Han Bae2117, Eric H Baehrecke1729, Seung-Hoon Baek17, Stephen Baghdiguian1368,
\nAgnieszka Bagniewska-Zadworna2, Hua Bai90, Jie Bai667, Xue-Yuan Bai1133, Yannick Bailly884,
\nKithiganahalli Narayanaswamy Balaji473, Walter Balduini2002, Andrea Ballabio316, Rena Balzan1711, Rajkumar Banerjee239,
\nG abor B anhegyi1052, Haijun Bao2109, Benoit Barbeau1363, Maria D Barrachina2007, Esther Barreiro467, Bonnie Bartel997,
\nAlberto Bartolom e222, Diane C Bassham550, Maria Teresa Bassi1046, Robert C Bast Jr1273, Alakananda Basu1798,
\nMaria Teresa Batista1578, Henri Batoko1336, Maurizio Battino970, Kyle Bauckman2085, Bradley L Baumgarner1909,
\nK Ulrich Bayer1594, Rupert Beale1553, Jean-Fran¸cois Beaulieu1360, George R. Beck Jr48,294, Christoph Becker336,
\nJ David Beckham1595, Pierre-Andr e B edard749, Patrick J Bednarski301, Thomas J Begley1135, Christian Behl1419,
\nChristian Behrends757, Georg MN Behrens406, Kevin E Behrns1627, Eloy Bejarano26, Amine Belaid490,
\nFrancesca Belleudi1041, Giovanni B enard497, Guy Berchem706, Daniele Bergamaschi983, Matteo Bergami1401,
\nBen Berkhout1441, Laura Berliocchi714, Am elie Bernard1749, Monique Bernard1354, Francesca Bernassola1880,
\nAnne Bertolotti791, Amanda S Bess272, S ebastien Besteiro1351, Saverio Bettuzzi1828, Savita Bhalla913,
\nShalmoli Bhattacharyya973, Sujit K Bhutia838, Caroline Biagosch1159, Michele Wolfe Bianchi520,1378,1381,
\nMartine Biard-Piechaczyk210, Viktor Billes298, Claudia Bincoletto1314, Baris Bingol350, Sara W Bird1128, Marc Bitoun1112,
\nIvana Bjedov1258, Craig Blackstone843, Lionel Blanc1183, Guillermo A Blanco1496, Heidi Kiil Blomhoff1812,
\nEmilio Boada-Romero1297, Stefan B€ockler1464, Marianne Boes1423, Kathleen Boesze-Battaglia1835, Lawrence H Boise286,287,
\nAlessandra Bolino2063, Andrea Boman693, Paolo Bonaldo1823, Matteo Bordi897, J€urgen Bosch608, Luis M Botana1308,
\nJoelle Botti1375, German Bou1405, Marina Bouch e1038, Marion Bouchecareilh1331, Marie-Jos ee Boucher1901,
\nMichael E Boulton481, Sebastien G Bouret1926, Patricia Boya133, Micha€el Boyer-Guittaut1345, Peter V Bozhkov1141,
\nNathan Brady374, Vania MM Braga469, Claudio Brancolini1997, Gerhard H Braus353, Jos e M Bravo-San Pedro299,393,508,1374,
\nLisa A Brennan322, Emery H Bresnick2022, Patrick Brest490, Dave Bridges1939, Marie-Agn es Bringer124, Marisa Brini1822,
\nGlauber C Brito1311, Bertha Brodin631, Paul S Brookes1872, Eric J Brown352, Karen Brown1690, Hal E Broxmeyer480,
\nAlain Bruhat486,1339, Patricia Chakur Brum1893, John H Brumell446, Nicola Brunetti-Pierri315,1171,
\nRobert J Bryson-Richardson781, Shilpa Buch1777, Alastair M Buchan1819, Hikmet Budak1022, Dmitry V Bulavin118,505,1789,
\nScott J Bultman1792, Geert Bultynck665, Vladimir Bumbasirevic1470, Yan Burelle1356, Robert E Burke216,217,
\nMargit Burmeister1750, Peter B€utikofer1473, Laura Caberlotto1987, Ken Cadwell896, Monika Cahova112, Dongsheng Cai24,
\nJingjing Cai2099, Qian Cai1018, Sara Calatayud2007, Nadine Camougrand1343, Michelangelo Campanella1700,
\nGrant R Campbell1525, Matthew Campbell1249, Silvia Campello556,1876, Robin Candau1769, Isabella Caniggia1983,
\nLavinia Cantoni560, Lizhi Cao116, Allan B Caplan1656, Michele Caraglia1051, Claudio Cardinali1043, Sandra Morais Cardoso1579, Jennifer S Carew208, Laura A Carleton874, Cathleen R Carlin101, Silvia Carloni2002,
\nSven R Carlsson1267, Didac Carmona-Gutierrez1643, Leticia AM Carneiro312, Oliana Carnevali971, Serena Carra1318,
\nAlice Carrier120, Bernadette Carroll900, Caty Casas1324, Josefina Casas1116, Giuliana Cassinelli324, Perrine Castets1462,
\nSusana Castro-Obregon214, Gabriella Cavallini1841, Isabella Ceccherini568, Francesco Cecconi253,555,1884,
\nArthur I Cederbaum459, Valent ın Ce~na199,1281, Simone Cenci1323,2064, Claudia Cerella444, Davide Cervia1996,
\nSilvia Cetrullo1478, Hassan Chaachouay2028, Han-Jung Chae187, Andrei S Chagin634, Chee-Yin Chai626,628,
\nGopal Chakrabarti1502, Georgios Chamilos1601, Edmond YW Chan1142, Matthew TV Chan181, Dhyan Chandra1003,
\nPallavi Chandra548, Chih-Peng Chang818, Raymond Chuen-Chung Chang1653, Ta Yuan Chang345, John C Chatham1434,
\nSaurabh Chatterjee1910, Santosh Chauhan527, Yongsheng Che62, Michael E Cheetham1263, Rajkumar Cheluvappa1783,
\nChun-Jung Chen1153, Gang Chen598,1676, Guang-Chao Chen9, Guoqiang Chen1078, Hongzhuan Chen1077, Jeff W Chen1514,
\nJian-Kang Chen370,371, Min Chen249, Mingzhou Chen2104, Peiwen Chen1823, Qi Chen1674, Quan Chen172,
\nShang-Der Chen138, Si Chen325, Steve S-L Chen10, Wei Chen2125, Wei-Jung Chen829, Wen Qiang Chen979, Wenli Chen1113,
\nXiangmei Chen1133, Yau-Hung Chen1157, Ye-Guang Chen1250, Yin Chen1447, Yingyu Chen953,955, Yongshun Chen2135,
\nYu-Jen Chen712, Yue-Qin Chen1145, Yujie Chen1208, Zhen Chen339, Zhong Chen2123, Alan Cheng1702,
\nChristopher HK Cheng184, Hua Cheng1728, Heesun Cheong814, Sara Cherry1836, Jason Chesney1703,
\nChun Hei Antonio Cheung817, Eric Chevet1359, Hsiang Cheng Chi140, Sung-Gil Chi656, Fulvio Chiacchiera308,
\nHui-Ling Chiang958, Roberto Chiarelli1826, Mario Chiariello235,567,577, Marcello Chieppa835, Lih-Shen Chin290,
\nMario Chiong1285, Gigi NC Chiu878, Dong-Hyung Cho676, Ssang-Goo Cho650, William C Cho982, Yong-Yeon Cho105,
\nYoung-Seok Cho1064, Augustine MK Choi2095, Eui-Ju Choi656, Eun-Kyoung Choi387,400,685, Jayoung Choi1563,
\nMary E Choi2093, Seung-Il Choi2116, Tsui-Fen Chou412, Salem Chouaib395, Divaker Choubey1574, Vinay Choubey1936,
\nKuan-Chih Chow822, Kamal Chowdhury730, Charleen T Chu1856, Tsung-Hsien Chuang827, Taehoon Chun657,
\nHyewon Chung652, Taijoon Chung978, Yuen-Li Chung1194, Yong-Joon Chwae18, Valentina Cianfanelli254,
\nRoberto Ciarcia1775, Iwona A Ciechomska886, Maria Rosa Ciriolo1876, Mara Cirone1042, Sofie Claerhout1694,
\nMichael J Clague1698, Joan Cl aria1457, Peter GH Clarke1687, Robert Clarke361, Emilio Clementi1045,1398, C edric Cleyrat1781,
\nMiriam Cnop1366, Eliana M Coccia574, Tiziana Cocco1459, Patrice Codogno1375, J€orn Coers271, Ezra EW Cohen1533,
\nDavid Colecchia235,567,577, Luisa Coletto25, N uria S Coll123, Emma Colucci-Guyon516, Sergio Comincini1829,
\nMaria Condello578, Katherine L Cook2073, Graham H Coombs1929, Cynthia D Cooper2076, J Mark Cooper1395,
\nIsabelle Coppens601, Maria Tiziana Corasaniti1387, Marco Corazzari485,1884, Ramon Corbalan1566,
\nElisabeth Corcelle-Termeau251, Mario D Cordero1899, Cristina Corral-Ramos1289, Olga Corti507,1109, Andrea Cossarizza1767,
\nPaola Costelli1993, Safia Costes1518, Susan L Cotman721, Ana Coto-Montes946, Sandra Cottet566,1688, Eduardo Couve1301,
\nLori R Covey1015, L Ashley Cowart762, Jeffery S Cox1536, Fraser P Coxon1427, Carolyn B Coyne1846, Mark S Cragg1919,
\nRolf J Craven1679, Tiziana Crepaldi1995, Jose L Crespo1300, Alfredo Criollo1285, Valeria Crippa558, Maria Teresa Cruz1576,
\nAna Maria Cuervo26, Jose M Cuezva1277, Taixing Cui1907, Pedro R Cutillas987, Mark J Czaja27, Maria F Czyzyk-Krzeska1572,
\nRuben K Dagda2068, Uta Dahmen1404, Chunsun Dai800, Wenjie Dai1187, Yun Dai2059, Kevin N Dalby1940,
\nLuisa Dalla Valle1822, Guillaume Dalmasso1340, Marcello D’Amelio557, Markus Damme188, Arlette Darfeuille-Michaud1340,
\nCatherine Dargemont950, Victor M Darley-Usmar1433, Srinivasan Dasarathy205, Biplab Dasgupta202, Srikanta Dash1254,
\nCrispin R Dass242, Hazel Marie Davey8, Lester M Davids1560, David D avila227, Roger J Davis1731, Ted M Dawson604,
\nValina L Dawson606, Paula Daza1898, Jackie de Belleroche470, Paul de Figueiredo1180,1182,
\nRegina Celia Bressan Queiroz de Figueiredo135, Jos e de la Fuente1023, Luisa De Martino1775,
\nAntonella De Matteis1171, Guido RY De Meyer1443, Angelo De Milito631, Mauro De Santi2002,

BACKGROUND: Type 2 diabetes mellitus is the leading cause of kidney failure worldwide, but few effective long-term treatments are available. In cardiovascular trials of inhibitors of sodium-glucose cotransporter 2 (SGLT2), exploratory results have suggested that such drugs may improve renal outcomes in patients with type 2 diabetes. METHODS: ), a doubling of the serum creatinine level, or death from renal or cardiovascular causes. Prespecified secondary outcomes were tested hierarchically. RESULTS: The trial was stopped early after a planned interim analysis on the recommendation of the data and safety monitoring committee. At that time, 4401 patients had undergone randomization, with a median follow-up of 2.62 years. The relative risk of the primary outcome was 30% lower in the canagliflozin group than in the placebo group, with event rates of 43.2 and 61.2 per 1000 patient-years, respectively (hazard ratio, 0.70; 95% confidence interval [CI], 0.59 to 0.82; P = 0.00001). The relative risk of the renal-specific composite of end-stage kidney disease, a doubling of the creatinine level, or death from renal causes was lower by 34% (hazard ratio, 0.66; 95% CI, 0.53 to 0.81; P<0.001), and the relative risk of end-stage kidney disease was lower by 32% (hazard ratio, 0.68; 95% CI, 0.54 to 0.86; P = 0.002). The canagliflozin group also had a lower risk of cardiovascular death, myocardial infarction, or stroke (hazard ratio, 0.80; 95% CI, 0.67 to 0.95; P = 0.01) and hospitalization for heart failure (hazard ratio, 0.61; 95% CI, 0.47 to 0.80; P<0.001). There were no significant differences in rates of amputation or fracture. CONCLUSIONS: In patients with type 2 diabetes and kidney disease, the risk of kidney failure and cardiovascular events was lower in the canagliflozin group than in the placebo group at a median follow-up of 2.62 years. (Funded by Janssen Research and Development; CREDENCE ClinicalTrials.gov number, NCT02065791.).

High-throughput experimental technologies often identify dozens to hundreds of genes related to, or changed in, a biological or pathological process. From these genes one wants to identify biological pathways that may be involved and diseases that may be implicated. Here, we report a web server, KOBAS 2.0, which annotates an input set of genes with putative pathways and disease relationships based on mapping to genes with known annotations. It allows for both ID mapping and cross-species sequence similarity mapping. It then performs statistical tests to identify statistically significantly enriched pathways and diseases. KOBAS 2.0 incorporates knowledge across 1327 species from 5 pathway databases (KEGG PATHWAY, PID, BioCyc, Reactome and Panther) and 5 human disease databases (OMIM, KEGG DISEASE, FunDO, GAD and NHGRI GWAS Catalog). KOBAS 2.0 can be accessed at http://kobas.cbi.pku.edu.cn.

The Compact Muon Solenoid (CMS) detector is described. The detector operates at the Large Hadron Collider (LHC) at CERN. It was conceived to study proton-proton (and lead-lead) collisions at a centre-of-mass energy of 14 TeV (5.5 TeV nucleon-nucleon) and at luminosities up to 1034 cm−2 s−1 (1027 cm−2 s−1). At the core of the CMS detector sits a high-magnetic-field and large-bore superconducting solenoid surrounding an all-silicon pixel and strip tracker, a lead-tungstate scintillating-crystals electromagnetic calorimeter, and a brass-scintillator sampling hadron calorimeter. The iron yoke of the flux-return is instrumented with four stations of muon detectors covering most of the 4π solid angle. Forward sampling calorimeters extend the pseudorapidity coverage to high values (|η| ≤ 5) assuring very good hermeticity. The overall dimensions of the CMS detector are a length of 21.6 m, a diameter of 14.6 m and a total weight of 12500 t.

Introduced in 2017, the GEPIA (Gene Expression Profiling Interactive Analysis) web server has been a valuable and highly cited resource for gene expression analysis based on tumor and normal samples from the TCGA and the GTEx databases. Here, we present GEPIA2, an updated and enhanced version to provide insights with higher resolution and more functionalities. Featuring 198 619 isoforms and 84 cancer subtypes, GEPIA2 has extended gene expression quantification from the gene level to the transcript level, and supports analysis of a specific cancer subtype, and comparison between subtypes. In addition, GEPIA2 has adopted new analysis techniques of gene signature quantification inspired by single-cell sequencing studies, and provides customized analysis where users can upload their own RNA-seq data and compare them with TCGA and GTEx samples. We also offer an API for batch process and easy retrieval of the analysis results. The updated web server is publicly accessible at http://gepia2.cancer-pku.cn/.

Abstract The Review summarizes much of particle physics and cosmology. Using data from previous editions, plus 3,324 new measurements from 878 papers, we list, evaluate, and average measured properties of gauge bosons and the recently discovered Higgs boson, leptons, quarks, mesons, and baryons. We summarize searches for hypothetical particles such as supersymmetric particles, heavy bosons, axions, dark photons, etc. Particle properties and search limits are listed in Summary Tables. We give numerous tables, figures, formulae, and reviews of topics such as Higgs Boson Physics, Supersymmetry, Grand Unified Theories, Neutrino Mixing, Dark Energy, Dark Matter, Cosmology, Particle Detectors, Colliders, Probability and Statistics. Among the 120 reviews are many that are new or heavily revised, including a new review on High Energy Soft QCD and Diffraction and one on the Determination of CKM Angles from B Hadrons. The Review is divided into two volumes. Volume 1 includes the Summary Tables and 98 review articles. Volume 2 consists of the Particle Listings and contains also 22 reviews that address specific aspects of the data presented in the Listings. The complete Review (both volumes) is published online on the website of the Particle Data Group (pdg.lbl.gov) and in a journal. Volume 1 is available in print as the PDG Book. A Particle Physics Booklet with the Summary Tables and essential tables, figures, and equations from selected review articles is available in print and as a web version optimized for use on phones as well as an Android app.

The China Health and Retirement Longitudinal Study (CHARLS) is a nationally representative longitudinal survey of persons in China 45 years of age or older and their spouses, including assessments of social, economic, and health circumstances of community-residents. CHARLS examines health and economic adjustments to rapid ageing of the population in China. The national baseline survey for the study was conducted between June 2011 and March 2012 and involved 17 708 respondents. CHARLS respondents are followed every 2 years, using a face-to-face computer-assisted personal interview (CAPI). Physical measurements are made at every 2-year follow-up, and blood sample collection is done once in every two follow-up periods. A pilot survey for CHARLS was conducted in two provinces of China in 2008, on 2685 individuals, who were resurveyed in 2012. To ensure the adoption of best practices and international comparability of results, CHARLS was harmonized with leading international research studies in the Health and Retirement Study (HRS) model. Requests for collaborations should be directed to Dr Yaohui Zhao (yhzhao@nsd.edu.cn). All data in CHARLS are maintained at the National School of Development of Peking University and will be accessible to researchers around the world at the study website. The 2008 pilot data for CHARLS are available at: http://charls.ccer.edu.cn/charls/. National baseline data for the study are expected to be released in January 2013.

The International League Against Epilepsy (ILAE) Classification of the Epilepsies has been updated to reflect our gain in understanding of the epilepsies and their underlying mechanisms following the major scientific advances that have taken place since the last ratified classification in 1989. As a critical tool for the practicing clinician, epilepsy classification must be relevant and dynamic to changes in thinking, yet robust and translatable to all areas of the globe. Its primary purpose is for diagnosis of patients, but it is also critical for epilepsy research, development of antiepileptic therapies, and communication around the world. The new classification originates from a draft document submitted for public comments in 2013, which was revised to incorporate extensive feedback from the international epilepsy community over several rounds of consultation. It presents three levels, starting with seizure type, where it assumes that the patient is having epileptic seizures as defined by the new 2017 ILAE Seizure Classification. After diagnosis of the seizure type, the next step is diagnosis of epilepsy type, including focal epilepsy, generalized epilepsy, combined generalized, and focal epilepsy, and also an unknown epilepsy group. The third level is that of epilepsy syndrome, where a specific syndromic diagnosis can be made. The new classification incorporates etiology along each stage, emphasizing the need to consider etiology at each step of diagnosis, as it often carries significant treatment implications. Etiology is broken into six subgroups, selected because of their potential therapeutic consequences. New terminology is introduced such as developmental and epileptic encephalopathy. The term benign is replaced by the terms self-limited and pharmacoresponsive, to be used where appropriate. It is hoped that this new framework will assist in improving epilepsy care and research in the 21st century.

UNLABELLED: : Visualizing genes' structure and annotated features helps biologists to investigate their function and evolution intuitively. The Gene Structure Display Server (GSDS) has been widely used by more than 60 000 users since its first publication in 2007. Here, we reported the upgraded GSDS 2.0 with a newly designed interface, supports for more types of annotation features and formats, as well as an integrated visual editor for editing the generated figure. Moreover, a user-specified phylogenetic tree can be added to facilitate further evolutionary analysis. The full source code is also available for downloading. AVAILABILITY AND IMPLEMENTATION: Web server and source code are freely available at http://gsds.cbi.pku.edu.cn. CONTACT: gaog@mail.cbi.pku.edu.cn or gsds@mail.cbi.pku.edu.cn SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

This paper studies the problem of embedding very large information networks into low-dimensional vector spaces, which is useful in many tasks such as visualization, node classification, and link prediction. Most existing graph embedding methods do not scale for real world information networks which usually contain millions of nodes. In this paper, we propose a novel network embedding method called the ``LINE,'' which is suitable for arbitrary types of information networks: undirected, directed, and/or weighted. The method optimizes a carefully designed objective function that preserves both the local and global network structures. An edge-sampling algorithm is proposed that addresses the limitation of the classical stochastic gradient descent and improves both the effectiveness and the efficiency of the inference. Empirical experiments prove the effectiveness of the LINE on a variety of real-world information networks, including language networks, social networks, and citation networks. The algorithm is very efficient, which is able to learn the embedding of a network with millions of vertices and billions of edges in a few hours on a typical single machine. The source code of the LINE is available online\footnote{\url{https://github.com/tangjianpku/LINE}}.

High-resolution representations are essential for position-sensitive vision problems, such as human pose estimation, semantic segmentation, and object detection. Existing state-of-the-art frameworks first encode the input image as a low-resolution representation through a subnetwork that is formed by connecting high-to-low resolution convolutions in series (e.g., ResNet, VGGNet), and then recover the high-resolution representation from the encoded low-resolution representation. Instead, our proposed network, named as High-Resolution Network (HRNet), maintains high-resolution representations through the whole process. There are two key characteristics: (i) Connect the high-to-low resolution convolution streams in parallel and (ii) repeatedly exchange the information across resolutions. The benefit is that the resulting representation is semantically richer and spatially more precise. We show the superiority of the proposed HRNet in a wide range of applications, including human pose estimation, semantic segmentation, and object detection, suggesting that the HRNet is a stronger backbone for computer vision problems. All the codes are available at https://github.com/HRNet.

Deploying convolutional neural networks (CNNs) on embedded devices is difficult due to the limited memory and computation resources. The redundancy in feature maps is an important characteristic of those successful CNNs, but has rarely been investigated in neural architecture design. This paper proposes a novel Ghost module to generate more feature maps from cheap operations. Based on a set of intrinsic feature maps, we apply a series of linear transformations with cheap cost to generate many ghost feature maps that could fully reveal information underlying intrinsic features. The proposed Ghost module can be taken as a plug-and-play component to upgrade existing convolutional neural networks. Ghost bottlenecks are designed to stack Ghost modules, and then the lightweight GhostNet can be easily established. Experiments conducted on benchmarks demonstrate that the proposed Ghost module is an impressive alternative of convolution layers in baseline models, and our GhostNet can achieve higher recognition performance (e.g. 75.7% top-1 accuracy) than MobileNetV3 with similar computational cost on the ImageNet ILSVRC-2012 classification dataset. Code is available at https://github.com/huawei-noah/ghostnet.