检索结果-内蒙古大学图书馆

Foundations of e-Democracy

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Shapiro, Ehud Department of Computer Science & Applied Math Weizmann Institute of Science Rehovot Israel

The Internet revolution of democracy, which will transform earthly representative democracies by employing the communication and collaboration capabilities of the Internet, has yet to come. Here, we enlist the wisdom of our forefathers to lead the way. By consulting the 1789 Declaration of the Rights of Man and of the Citizen, we distill core values of democracy and derive from them requirements for the foundations of e-democracy. Building these foundations can usher the urgently-needed revolution of democracy. Copyright © 2017, The Authors. All rights reserved.

关键词：

Building a Good Team: Secretary Problems and the Supermodular Degree 17

学校读者我要写书评

暂无评论

Building a Good Team: Secretary Problems and the Supermodula...

Annual ACM-Society for Industrial and applied mathmatics Symposium on Discrete Algorithms

作者： Moran Feldman Rani Izsak Department of Mathematics and Computer Science The Open University of Israel Department of Computer Science and Applied Math. Weizmann Institute of Science

ISBN: (纸本)9781510836358

In the (classical) SECRETARY PROBLEM, one has to hire the best among n candidates. The candidates are interviewed, one at a time, at a uniformly random order, and one has to decide on the spot, whether to hire a candidate or continue interviewing. It is well known that the best candidate can be hired with a probability of 1/e (Dynkin, 1963). Recent works extend this problem to settings in which multiple candidates can be hired, subject to some constraint. Here, one wishes to hire a set of candidates maximizing a given objective set function. Almost all extensions considered in the literature assume the objective set function is either linear or submodular. Unfortunately, real world functions might not have either of these properties. Consider, for example, a scenario where one hires researchers for a project. Indeed, it can be that some researchers can substitute others for that matter. However, it can also be that some combinations of researchers result in synergy (see, e.g., Woolley et al., science 2010, for a study on collective intelligence). The first phenomenon can be modeled by a submoudlar set function, while the latter cannot. In this work, we study the secretary problem with an arbitrary non-negative monotone valuation function, subject to a general matroid constraint. One can prove that, generally, only very poor results can be obtained for this class of objective functions. We tackle this hardness by combining the following: (1) Parametrizing our algorithms by the supermodular degree of the objective function (defined by Feige and Izsak, ITCS 2013), which, roughly speaking, measures the distance of a function from being submodular. (2) Suggesting an (arguably) natural model that permits approximation guarantees that are polynomial in the supermodular degree (as opposed to the standard model which allows only exponential guarantees). Our algorithms learn the input by running a non-trivial estimation algorithm on a portion of it whose size depends on the s

关键词： secretary Objective function algorithms Function solidification Matroid candidate species Standard model Researchers Nonnegative

Global burden of 369 diseases and injuries in 204 countries and territories, 1990–2019: a systematic analysis for the Global Burden of Disease Study 2019

学校读者我要写书评

暂无评论

The Lancet 2020年第10258期396卷 1204-1222页

作者： Abbafati, Cristiana Abbas, Kaja M. Abbasi, Mohammad Abbasifard, Mitra Abbasi-Kangevari, Mohsen Abbastabar, Hedayat Abd-Allah, Foad Abdelalim, Ahmed Abdollahi, Mohammad Abdollahpour, Ibrahim Abedi, Aidin Abedi, Parisa Abegaz, Kedir Hussein Abolhassani, Hassan Abosetugn, Akine Eshete Aboyans, Victor Abrams, Elissa M. Abreu, Lucas Guimarães Abrigo, Michael R.M. Abu Haimed, Abdulaziz Khalid Abualhasan, Ahmed Abu-Gharbieh, Eman Abu-Raddad, Laith Jamal Abushouk, Abdelrahman I. Acebedo, Alyssa Ackerman, Ilana N. Adabi, Maryam Adair, Tim Adamu, Abdu A. Adebayo, Oladimeji M. Adedeji, Isaac Akinkunmi Adekanmbi, Victor Adelson, Jaimie D. Adeoye, Abiodun Moshood Adetokunboh, Olatunji O. Adham, Davoud Advani, Shailesh M. Afarideh, Mohsen Afshari, Mahdi Afshin, Ashkan Agardh, Emilie E. Agarwal, Gina Agasthi, Pradyumna Agesa, Kareha M. Aghaali, Mohammad Aghamir, Seyed Mohammad Kazem Agrawal, Anurag Ahmad, Tauseef Ahmadi, Alireza Ahmadi, Keivan Ahmadi, Mehdi Ahmadieh, Hamid Ahmadpour, Ehsan Ahmed, Muktar Beshir Aji, Budi Akalu, Temesgen Yihunie Akinyemi, Rufus Olusola Akinyemiju, Tomi Akombi, Blessing Akunna, Chisom Joyqueenet Alahdab, Fares Al-Aly, Ziyad Alam, Khurshid Alam, Noore Alam, Samiah Alam, Tahiya Alanezi, Fahad Mashhour Alanzi, Turki M. Albertson, Samuel B. Alcalde-Rabanal, Jacqueline Elizabeth Alema, Niguse Meles Alemu, Biresaw Wassihun Alemu, Yihun Mulugeta Alhabib, Khalid F. Alhassan, Robert Kaba Ali, Muhammad Ali, Saqib Alicandro, Gianfranco Alijanzadeh, Mehran Alinia, Cyrus Alipour, Vahid Alizade, Hesam Aljunid, Syed Mohamed Alla, François Allebeck, Peter Almadi, Majid Abdulrahman Hamad Almasi, Ali Almasi-Hashiani, Amir Almasri, Nihad A. Al-Mekhlafi, Hesham M. Almulhim, Abdulaziz M. Alonso, Jordi Al-Raddadi, Rajaa M. Altirkawi, Khalid A. Alumran, Arwa Khalid Alvis-Guzman, Nelson Alvis-Zakzuk, Nelson J. Amare, Azmeraw T. Amare, Bekalu Amini, Saeed Amini-Rarani, Mostafa Aminorroaya, Arya Amiri, Fatemeh Amit, Arianna Maever L. Amugsi, Dickson A. Amul, Gianna Gayle Herrera Anbesu, Etsay Woldu Ancuceanu, Robert Anderl Department of Juridical and Economic Studies La Sapienza University Rome Italy Department of Infectious Disease Epidemiology London School of Hygiene and Tropical Medicine London United Kingdom Social Determinants of Health Research Center Tehran Iran Department of Neurology Cairo University Cairo Egypt School of Pharmacy Tehran Iran The Institute of Pharmaceutical Sciences (TIPS) Tehran Iran Neuroscience Research Center Isfahan University of Medical Sciences Isfahan Iran Biostatistics Department Near East University Nicosia Cyprus Biostatistics and Health Informatics Madda Walabu University Bale Robe Ethiopia Research Center for Immunodeficiencies Tehran Iran Karolinska University Hospital Huddinge Sweden Department of Cardiology Dupuytren University Hospital Limoges France University of Limoges Limoges France Department of Pediatric Dentistry Federal University of Minas Gerais Belo Horizonte Brazil Department of Research Philippine Institute for Development Studies Quezon City Philippines Department of Healthcare Policy and Research Weill Cornell Medical College in Qatar Doha Qatar Harvard Medical School Boston MA United States Department of Medicine Ain Shams University Cairo Egypt Hamadan University of Medical Sciences Hamadan Iran School of Medicine Cardiff University Cardiff United Kingdom School of Laboratory Medicine and Science University College Hospital Ibadan Ibadan Nigeria Institute of Cardiovascular Diseases University of Ibadan Ibadan Nigeria Centre of Excellence for Epidemiological Modelling and Analysis Stellenbosch University Cape Town South Africa Department of Global Health Stellenbosch University Cape Town South Africa School of Health Ardabil University of Medical Science Ardabil Iran Social Behavioral Research Branch National Institute of Health Bethesda MD United States Department of Oncology Georgetown University Washington DC DC United States Department of Health Metrics Sciences School of Medicine Seattle WA

Background: In an era of shifting global agendas and expanded emphasis on non-communicable diseases and injuries along with communicable diseases, sound evidence on trends by cause at the national level is essential. The Global Burden of Diseases, Injuries, and Risk Factors Study (GBD) provides a systematic scientific assessment of published, publicly available, and contributed data on incidence, prevalence, and mortality for a mutually exclusive and collectively exhaustive list of diseases and injuries. Methods: GBD estimates incidence, prevalence, mortality, years of life lost (YLLs), years lived with disability (YLDs), and disability-adjusted life-years (DALYs) due to 369 diseases and injuries, for two sexes, and for 204 countries and territories. Input data were extracted from censuses, household surveys, civil registration and vital statistics, disease registries, health service use, air pollution monitors, satellite imaging, disease notifications, and other sources. Cause-specific death rates and cause fractions were calculated using the Cause of Death Ensemble model and spatiotemporal Gaussian process regression. Cause-specific deaths were adjusted to match the total all-cause deaths calculated as part of the GBD population, fertility, and mortality estimates. Deaths were multiplied by standard life expectancy at each age to calculate YLLs. A Bayesian meta-regression modelling tool, DisMod-MR 2.1, was used to ensure consistency between incidence, prevalence, remission, excess mortality, and cause-specific mortality for most causes. Prevalence estimates were multiplied by disability weights for mutually exclusive sequelae of diseases and injuries to calculate YLDs. We considered results in the context of the Socio-demographic Index (SDI), a composite indicator of income per capita, years of schooling, and fertility rate in females younger than 25 years. Uncertainty intervals (UIs) were generated for every metric using the 25th and 975th ordered 1000 draw value

关键词：

Heavy hitters and the structure of local privacy

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Bun, Mark Nelson, Jelani Stemmer, Uri Department of Computer Science Princeton University John A. Paulson School of Engineering and Applied Sciences Harvard University Dept. of Computer Science and Applied Math Weizmann Institute of Science

We present a new locally differentially private algorithm for the heavy hitters problem which achieves optimal worst-case error as a function of all standardly considered parameters. Prior work obtained error rates which depend optimally on the number of users, the size of the domain, and the privacy parameter, but depend sub-optimally on the failure probability. We strengthen existing lower bounds on the error to incorporate the failure probability, and show that our new upper bound is tight with respect to this parameter as well. Our lower bound is based on a new understanding of the structure of locally private protocols. We further develop these ideas to obtain the following general results beyond heavy hitters. Advanced Grouposition: In the local model, group privacy for k users degrades proportionally to ≈ √k, instead of linearly in k as in the central model. Stronger group privacy yields improved max-information guarantees, as well as stronger lower bounds (via "packing arguments"), over the central model. Building on a transformation of Bassily and Smith (STOC 2015), we give a generic transformation from any non-interactive approximate-private local protocol into a pure-private local protocol. Again in contrast with the central model, this shows that we cannot obtain more accurate algorithms by moving from pure to approximate local privacy. Copyright © 2017, The Authors. All rights reserved.

关键词： Errors

Global Software Engineering Experience through International Capstone Project Exchanges

学校读者我要写书评

暂无评论

Global Software Engineering Experience through International...

International Conference on Global Software Engineering (ICGSE)

作者： Dean Knudson Stavros Kalafatis Carsten Kleiner Stephen Zahos Barbara Seegebarth Jonas Deeterfelt Iman Avazpour Kristian Sandahl Peter Gorder Jeewani Ginige Alex Radermacher Hugo Caballero Humberto Gomez Mikael Roos Computer Science Dept. North Dakota State University Fargo ND USA ECE Department Texas A& M University College Station TX USA Computer Science Dept. Hannover University of Applied Sciences & Arts Hannover Germany Agricultural and Biological Eng. University of Illinois at Urbana-Champaign Urbana IL USA Institute of Marketing Technische Universitat Braunschweig Braunschweig Germany Linkopings universitet Linkoping SE School of IT Deakin University Burwood Australia Department of Computer and Information Science Linkoping University Linkoping SE Sweden Department of Mechanical and Aerospace Engineering Univ. of Colorado Colorado Springs CO USA Sch. of Comput. Eng. & Math. Western Sydney Univ. Sydney NSW Australia Departamento de Ingenieria Mecanica Universidad del Norte Barranquilla Colombia Department of Computer Science and Engineering Blekinge Institute of Technology (BTH) Karlskrona Sweden

Today it is very common for software systems to be built by teams located in more than one country. For example, a project team may be located in the US while the team lead resides in Sweden. How then should students be trained for this kind of work? Senior design or capstone projects offer students real-world hands-on experience but rarely while working internationally. One reason is that most instructors do not have international business contacts that allow them to find project sponsors in other countries. Another reason is the fear of having to invest a huge amount of time managing an international project. In this paper we present the general concepts related to "International Capstone Project Exchanges", the basic model behind the exchanges (student teams are led by an industry sponsor residing in a different country) and several alternate models that have been used in practice. We will give examples from projects in the US, Germany, Sweden, Australia, and Colombia. We have extended the model beyond software projects to include engineering projects as well as marketing, and journalism. We conclude with a description of an International Capstone Project Exchange website that we have developed to aid any university in establishing their own international project exchange.

关键词：

Organ-on-a-Chip: Ex vivo Dynamics of Human Glioblastoma Cells in a Microvasculature-on-a-Chip System Correlates with Tumor Heterogeneity and Subtypes (Adv. Sci. 8/2019)

学校读者我要写书评

暂无评论

Advanced science 2019年第8期6卷 1970046-1970046页

作者： Yang Xiao Dongjoo Kim Burak Dura Kerou Zhang Runchen Yan Huamin Li Edward Han Joshua Ip Pan Zou Jun Liu Ann Tai Chen Alexander O. Vortmeyer Jiangbing Zhou Rong Fan Department of Biomedical Engineering Yale University New Haven CT 06520 USA School of Computer Science Carnegie Mellon University Pittsburgh PA 15213 USA Applied Math Program Yale University New Haven CT 06520 USA Department of Neurosurgery Yale School of Medicine New Haven CT 06520 USA Department of Pathology Indiana University Health Pathology Laboratory Indianapolis IN 46202 USA Yale Comprehensive Cancer Center New Haven CT 06520 USA

Robust statistics for image deconvolution

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Lee, Matthias A. Budavári, Tamás White, Richard L. Gulian, Charles Department of Computer Science Johns Hopkins University BaltimoreMD21218 United States Department of Applied Math and Statistics Johns Hopkins University BaltimoreMD21218 United States Space Telescope Science Institute BaltimoreMD21218 United States

We present a blind multiframe image-deconvolution method based on robust statistics. The usual shortcomings of iterative optimization of the likelihood function are alleviated by minimizing the M-scale of the residuals, which achieves more uniform convergence across the image. We focus on the deconvolution of astronomical images, which are among the most challenging due to their huge dynamic ranges and the frequent presence of large noise-dominated regions in the images. We show that high-quality image reconstruction is possible even in super-resolution and without the use of traditional regularization terms. Using a robust ρ-function is straightforward to implement in a streaming setting and, hence our method is applicable to the large volumes of astronomy images. The power of our method is demonstrated on observations from the Sloan Digital Sky Survey (Stripe 82) and we briefly discuss the feasibility of a pipeline based on Graphical Processing Units for the next generation of telescope surveys. Copyright © 2017, The Authors. All rights reserved.

关键词： Iterative methods

Tractability of multivariate problems for standard and linear information in the worst case setting: Part II

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Novak, Erich Wozniakowski, Henryk Jena University Math Institute Ernst Abbe Platz 2 Jena Germany Department of Computer Science Columbia University New YorkNY10027 United States Institute of Applied Mathematics University of Warsaw ul. Banacha 2 Warszawa02-097 Poland

We study QPT (quasi-polynomial tractability) in the worst case setting for linear tensor product problems defined over Hilbert spaces. We assume that the domain space is a reproducing kernel Hilbert space so that function values are well defined. We prove QPT for algorithms that use only function values under the three assumptions: Copyright © 2017, The Authors. All rights reserved.

关键词： Vector spaces

Dynamic and recursive oil-reservoir proxy using Elman neural networks

学校读者我要写书评

暂无评论

Dynamic and recursive oil-reservoir proxy using Elman neural...

2016 IEEE ANDESCON, ANDESCON 2016

作者： Tupac, Yvan Talavera, Alvaro Rivero, Cristian Rodriguez Computer Science School Universidad Católica San Pablo Arequipa Peru Department of Engineering Universidad Del Pacífico Lima Peru Math Research Laboratory Applied to Control Universidad Nacional de Córdoba Córdoba Argentina

ISBN: (纸本)9781509025312

In this work, a reservoir simulation approximation model (proxy) based on recurrent artificial neural networks is proposed. This model is intended to obtain rates of oil, gas and water production at time t+1 from the respective production rates, average pressure and water cut at t time and the well operation points to be applied in t + 1. Also, this model is able to follow the dynamics of the reservoir system applying online learning from real production observed values. Also, this model allows perform fast and accurate production forecasting for several steps using a recursive mechanism. This model will be inserted into an oil-production control tool to find the optimal operation conditions within a forecast horizon. The obtained outcomes over the approximation tests indicate the methodology is adequate to perform production forecasts. © 2016 IEEE.

关键词： Production control