Springer.Com
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
9<HTOFPA=Hjdjfd>
34 Computer Science Springer News 6/2008 springer.com/booksellers P. Abrahamsson, VTT, Finland; R. Baskerville, W. Abramowicz, Poznan University of Economics, R. Adams, Nanaimo, BC, Canada; S. Gibson, Georgia State University, Atlanta, GA, USA; Poznan, Poland; D. Fensel, STI Innsbruck, Austria University of Victoria, VIC, Canada; S. Müller Arisona, K. Conboy, Lero, NUI Galway, Ireland; B. Fitzgerald, (Eds.) University of California, Santa Barbara, CA, USA (Eds.) L. Morgan, X. Wang, Lero, University of Limerick, Ireland (Eds.) Business Information Systems Transdisciplinary Digital Art. Agile Processes in Software 11th International Conference, Sound, Vision and the New BIS 2008, Innsbruck, Austria, Screen Engineering and Extreme May 5–7, 2008, Proceedings Programming Digital Art Weeks and Interactive Futures 2006/2007, Zürich, Switzerland and Victoria, 9th International Conference, XP 2008, BC, Canada, Selected Papers Limerick, Ireland, June 11–14, 2008, This book contains the refereed proceedings of the 11th International Conference on Business Proceedings Information Systems, BIS 2008, held in Innsbruck, Austria, in May 2008. This volume collects selected papers from the The 41 revised full papers were carefully reviewed past two instances of Digital Art Weeks (Zurich, This book constitutes the refereed proceedings and selected inclusion in the book. The contri- Switzerland) and Interactive Futures (Victoria, BC, of the 8th International Conference on Agile butions cover research trends as well as current Canada), two parallel festivals of digital media art. Processes in Software Engineering and eXtreme achievements and cutting edge developments in The work represented in Transdisciplinary Digital Programming, XP 2008, held in Limerick, Ireland, the area of modern business information systems. Art is a confirmation of the vitality and breadth in June 2008. -
Balloons Could Outperform Spacecraft by Surfing the Stratosphere. We Go
AVIATION WORKFORCE 40 SPACE POWER 34 ROBOTICS 12 Attract the best and brightest Meet ROSA, the Roll Out Solar Array The case for telepresence at Mars Satellite envy Balloons could outperform spacecraft by surfi ng the stratosphere. We go deep on one company’s plan. PAGE 24 OCTOBER 2017 | A publication of the American Institute of Aeronautics and Astronautics | aerospaceamerica.aiaa.org CALL FOR TECHNICAL BRIEFINGS The AIAA Defense and Security Forum (AIAA DEFENSE 2018) brings together the contractor, acquisition, and R&D communities for classifi ed and unclassifi ed discussions of critical technical, programmatic, and policy topics in a SECRET/NoFORN unbiased, nonpartisan environment. Nearly 200 experts will present the latest innovative technological breakthroughs that will integrate with current and next-generation defense systems. Advanced Prototypes Aerospace and Defense Computing Systems Countermeasures Directed Energy Weapons Estimation, Guidance, Navigation and Control Hypersonic Systems and Technologies Innovative Concepts and Technologies Missile Defense Robotic and Unmanned Weapon Systems Space Systems Strategic Missile Systems – Ground Based Strategic Missile Systems – Sea Based Deterrent Survivability Systems and Decision Analysis for National Security Tactical Missiles Weapon System Performance Analysis, Modeling and Simulation Weapon System Test and Evaluation Abstract Deadline: 30 November 2017 FEATURES | October 2017 MORE AT aerospaceamerica.aiaa.org 16 34 24 Ka-boom! Unrolling innovation Stratosphere surfi ng How a mission to smash a spacecraft Meet the solar array that could One company says its balloons can do into a moonlet may help defend Earth disrupt the spacecraft market. from asteroids and comets. what conventional satellites can do, By Debra Werner and then some. -
Using CMMI Together with Agile Software Development
Information and Software Technology 58 (2015) 20–43 Contents lists available at ScienceDirect Information and Software Technology journal homepage: www.elsevier.com/locate/infsof Using CMMI together with agile software development: A systematic review ⇑ Fernando Selleri Silva a,b, , Felipe Santana Furtado Soares a,c, Angela Lima Peres a,d, Ivanildo Monteiro de Azevedo a,b, Ana Paula L.F. Vasconcelos a,b, Fernando Kenji Kamei a,e, Silvio Romero de Lemos Meira a,c a Center of Informatics (CIn), Federal University of Pernambuco (UFPE), Recife, PE, Brazil b Computer Science Course (FACET), Mato Grosso State University (UNEMAT), Barra do Bugres, MT, Brazil c Recife Center of Advanced Studies and Systems (C.E.S.A.R), Recife, PE, Brazil d Cesmac University Center, Maceió, AL, Brazil e Federal Institute of Alagoas (IFAL), Arapiraca, AL, Brazil article info abstract Article history: Background: The search for adherence to maturity levels by using lightweight processes that require low Received 18 April 2014 levels of effort is regarded as a challenge for software development organizations. Received in revised form 21 August 2014 Objective: This study seeks to evaluate, synthesize, and present results on the use of the Capability Matu- Accepted 27 September 2014 rity Model Integration (CMMI) in combination with agile software development, and thereafter to give an Available online 6 October 2014 overview of the topics researched, which includes a discussion of their benefits and limitations, the strength of the findings, and the implications for research and practice. Keywords: Methods: The method applied was a Systematic Literature Review on studies published up to (and Software process improvement including) 2011. -
Markovian Bulk-Arrival and Bulk-Service Queues with General State-Dependent Control
Queueing Systems (2020) 95:331–378 https://doi.org/10.1007/s11134-020-09660-0 Markovian bulk-arrival and bulk-service queues with general state-dependent control Anyue Chen1,2 · Xiaohan Wu1 · Jing Zhang3 Received: 17 March 2019 / Revised: 25 May 2020 / Published online: 5 July 2020 © The Author(s) 2020 Abstract We study a modified Markovian bulk-arrival and bulk-service queue incorporating general state-dependent control. The stopped bulk-arrival and bulk-service queue is first investigated, and the relationship between this stopped queue and the full queueing model is examined and exploited. Using this relationship, the equilibrium behaviour for the full queueing process is studied and the probability generating function of the equilibrium distribution is obtained. Queue length behaviour is also examined, and the Laplace transform of the queue length distribution is presented. The important ques- tions regarding hitting times and busy period distributions are answered in detail, and the Laplace transforms of these distributions are presented. Further properties regard- ing the busy period distributions including expectation and conditional expectation of busy periods are also explored. Keywords Bulk-arrival and bulk-service queues · State-dependent control · Equilibrium distribution · Queue length distributions · Busy period distributions Mathematics Subject Classification Primary 60J27; Secondary 60J80 B Anyue Chen [email protected]; [email protected] Xiaohan Wu [email protected] Jing Zhang [email protected] 1 Department of Mathematics, The Southern University of Science and Technology, Shenzhen 518055, Guangdong, China 2 Department of Mathematical Sciences, The University of Liverpool, Liverpool L69 7ZL, UK 3 Institute for Data and Decision Analytics, The Chinese University of Hong Kong, Shenzhen 518172, Guangdong, China 123 332 Queueing Systems (2020) 95:331–378 1 Introduction Markovian queues occupy a significant niche in applied probability. -
A Framework for Maturing in Agile Software Development
The Journal of Systems and Software 102 (2015) 88–108 Contents lists available at ScienceDirect The Journal of Systems and Software journal homepage: www.elsevier.com/locate/jss Progressive Outcomes: A framework for maturing in agile software development Rafaela Mantovani Fontana a,b,∗, Victor Meyer Jr. a, Sheila Reinehr a, Andreia Malucelli a a Pontifical Catholic University of Paraná (PUCPR), R. Imaculada Conceição, 1155, Prado Velho, 80215-901 Curitiba, PR, Brazil b Federal University of Paraná (UFPR), R. Dr. Alcides Vieira Arcoverde, 1225, Jd. das Américas, 81520-260 Curitiba, PR, Brazil article info abstract Article history: Maturity models are used to guide improvements in the software engineering field and a number of maturity Received 25 August 2014 models for agile methods have been proposed in the last years. These models differ in their underlying Revised 2 December 2014 structure prescribing different possible paths to maturity in agile software development, neglecting the Accepted 15 December 2014 fact that agile teams struggle to follow prescribed processes and practices. Our objective, therefore, was to Availableonline22December2014 empirically investigate how agile teams evolve to maturity, as a means to conceive a theory for agile software Keywords: development evolvement that considers agile teams nature. The complex adaptive systems theory was used Maturity as a lens for analysis and four case studies were conducted to collect qualitative and quantitative data. As a Agile software development result, we propose the Progressive Outcomes framework to describe the agile software development maturing Software process improvement process. It is a framework in which people have the central role, ambidexterity is a key ability to maturity, Complex adaptive systems and improvement is guided by outcomes agile teams pursue, instead of prescribed practices. -
Agile Processes in Software Engineering and Extreme
Juan Garbajosa · Xiaofeng Wang Ademar Aguiar (Eds.) Agile Processes in Software Engineering and Extreme Programming LNBIP 314 19th International Conference, XP 2018 Porto, Portugal, May 21–25, 2018 Proceedings Lecture Notes in Business Information Processing 314 Series Editors Wil M. P. van der Aalst RWTH Aachen University, Aachen, Germany John Mylopoulos University of Trento, Trento, Italy Michael Rosemann Queensland University of Technology, Brisbane, QLD, Australia Michael J. Shaw University of Illinois, Urbana-Champaign, IL, USA Clemens Szyperski Microsoft Research, Redmond, WA, USA More information about this series at http://www.springer.com/series/7911 Juan Garbajosa • Xiaofeng Wang Ademar Aguiar (Eds.) Agile Processes in Software Engineering and Extreme Programming 19th International Conference, XP 2018 Porto, Portugal, May 21–25, 2018 Proceedings Editors Juan Garbajosa Ademar Aguiar Technical University of Madrid University of Porto Madrid, Madrid Porto Spain Portugal Xiaofeng Wang Free University of Bozen-Bolzano Bolzano Italy ISSN 1865-1348 ISSN 1865-1356 (electronic) Lecture Notes in Business Information Processing ISBN 978-3-319-91601-9 ISBN 978-3-319-91602-6 (eBook) https://doi.org/10.1007/978-3-319-91602-6 Library of Congress Control Number: 2018944291 © The Editor(s) (if applicable) and The Author(s) 2018. This book is an open access publication. Open Access This book is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. -
OPEN SOURCE ARCHIVE Towards Open and Sustainable Digital Archives
OPEN SOURCE ARCHIVE Towards open and sustainable digital archives Liisa Uosukainen (ed.) Publisher: Mikkeli University of Applied Sciences Publication serie: A Research Reports - Tutkimuksia ja raportteja 94 University of Appl ied Sciences OPEN SOURCE ARCHIVE Towards open and sustainable digital archives Liisa Uosukainen (ed.) MIKKELI UNIVERSITY OF APPLIED SCIENCES MIKKELI 2014 A: RESEARCH REPORTS - TUTKIMUKSIA JA RAPORTTEJA 94 1 © Authors and Mikkeli University of Applied Sciences Cover picture: Manu Eloaho Cover layout: Advertising agency Nitro ID Layout and printing: Tammerprint Oy ISBN: 978-951-588-455-8 (nid.) ISBN: 978-951-588-456-5 (PDF) ISSN: 1795-9438 (nid.) [email protected] 2 CONTENTS Authors 4 Questions, sources And contexts – digitAl Archiving As A fAcilitAtor in AcQuiring new informAtion And providing services 5 A winning model built At mAmk: tAilored services from A common plAtform 8 two ApproAches to digitAl long-term storAge And preservAtion At the nAtionAl Archives of sweden (nAs) And the chAllenge of file formAt stAndArds 24 An open source Archiving system for mAnAging business Archives 45 working together with fedorA commons: sustAinAble digitAl repository solutions 51 the hArmonizAtion of digitAl contents: benefits And reQuirements 54 web-ApplicAtion development in the open source Archive project 63 ArchivAl ui – An old relic or modern And novel? 72 open source in mAmk’s it educAtion 78 open movement – A megAtrend of our time 86 3 AuThOrS Alm Olli, Master of Arts, Information Services and Development Manager, Central Archives for Finnish Business Records Awre Chris, BSc (Hons) Biochemistry, MSc Information Science, Head of Information Management, University of Hull and Co-chair, Fedora UK & Ireland Fedora User Group Drake Karl-Magnus, Ph.D. -
A Bibliography on Semi-Markov Processes BIBLIOGRAPHY 004
CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector A bibliography on semi-Markov processes BIBLIOGRAPHY 004 Jozef L. Teugels (*) INTRODUCTION At the appearance of this bibliography we want to thank warmly all those who have helped compiling this edition by sending us titles of publications, preprints, reprints and other re- levant information. Especially Cheong C. Kong and Jos H.A. de Smit have contributed at an early stage. All publications by the same author have been arranged by the year of publication. This will be convenient if in the future we should decide to publish a supplement to this bibliography. The present version contains about 600 papers written by some 300 authors. We have indicated to the best of our kwowledge where a publication has been reviewed or summarized. We write ST for Statistical Theory and Method Abstracts, MR for Mathematical Reviews and Zbl for Zentralblatt fiir Mathematik und ihre Grenzgebiete. The first number refers to the volume and the second to the number of the page (for Zbl) or review/abstract (for ST and MR). Thus MR 27-1999 refers to review number" 1999 of volume 27 of Mathe- matical Reviews.. We follow MR in our abbreviations and transliterations for the names of journals. The reader's attention is drawn on translations made of journals published in Russian. The index volumes of MR should be consulted. New information can always be forwarded to the author. BIBLIOGRAPHY Akimov A.P. and Pogosjan I.A. Andronov A.M. and Gertsbakh I.G. On structural reservation systems with repair and cold reser- On properties of multidimensional functionals on semi-Mar- vation 1974 kov processes with finite state space. -
Measuring Coding Challenge Competence with APPS
Measuring Coding Challenge Competence With APPS Dan Hendrycks∗ Steven Basart* Saurav Kadavath Mantas Mazeika Akul Arora UC Berkeley UChicago UC Berkeley UIUC UC Berkeley Ethan Guo Collin Burns Samir Puranik Horace He UC Berkeley UC Berkeley UC Berkeley Cornell Dawn Song Jacob Steinhardt UC Berkeley UC Berkeley Abstract While programming is one of the most broadly applicable skills in modern society, modern machine learning models still cannot code solutions to basic problems. Despite its importance, there has been surprisingly little work on evaluating code generation, and it can be difficult to accurately assess code generation performance rigorously. To meet this challenge, we introduce APPS, a benchmark for code gen- eration. Unlike prior work in more restricted settings, our benchmark measures the ability of models to take an arbitrary natural language specification and generate sat- isfactory Python code. Similar to how companies assess candidate software devel- opers, we then evaluate models by checking their generated code on test cases. Our benchmark includes 10;000 problems, which range from having simple one-line solutions to being substantial algorithmic challenges. We fine-tune large language models on both GitHub and our training set, and we find that the prevalence of syntax errors is decreasing exponentially as models improve. Recent models such as GPT-Neo can pass approximately 20% of the test cases of introductory problems, so we find that machine learning models are now beginning to learn how to code. As the social significance of automatic code generation increases over the coming years, our benchmark can provide an important measure for tracking advancements. -
Modeling an M/M/1 Queue with Unreliable Service and a Working Vacation
Modeling an M/M/1 Queue with unreliable service and a working vacation by Joshua K. Patterson Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy The University of Texas at Arlington May, 2019 i Modeling an M/M/1 Queue with unreliable service and a working vacation by Joshua K. Patterson Department of Mathematics The University of Texas at Arlington Abstract We define the new term ’unreliable service’ where the service itself is unreliable (i.e. may fail). We discuss how this differs from the current literature, and give examples showing just how common this phenomena is in many real-world scenarios. We first consider the classic M/M/1 queue with unreliable service and find some striking similarities with the well studied M/M/1 derivation. Next, we consider the M/M/1 queue with unreliable service and a working vacation. In each of these cases, surprising explicit results are found including positive recurrence conditions, the stationary queue length distribution, and a decomposition of both the queue length and waiting time. We also purpose a number of ideas for future research based on this newly defined phenomenon. ii Acknowledgements I would like to thanks my advisor Professor Andrzej Korzeniowski for his expertise and vast knowledge of queue theory and stochastic processes, the history of these topics, and major contributors therein. In addition, I would like to extend my gratitude towards my committee members, Drs. Suvra Pal, Shan Sun-Mitchell, and Jonghyun Yun. I would also like to acknowledge my mother, Brenda; father, Ken; grandmother, Brenda; step-grandfather, James; aunt, Amy; uncle, Brad; brothers Michael, Aaron; and step-brother David for their ongoing love and support from the very beginning–and I mean the very beginning. -
A Complete Bibliography of Publications in Statistics and Probability Letters: 1990–1999
A Complete Bibliography of Publications in Statistics and Probability Letters: 1990{1999 Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 22 March 2018 Version 1.06 Title word cross-reference (N;d) [WC97]. (n; f; k) [CCH99]. 0 <r<1=2 [San91]. 1 [MH96]. 2 [EK96b, Ete99, SN96]. 2β [PP92b]. 2k [Kou96c]. 2m [Arc98a]. 3k [Kou96c]. 4 [Kab99]. 5 [Shi99]. a [PP92a]. A [Brz96, MH90]. α [AM94a, Alb97, CR92, Lie99, Mas96, Sam94, Sap99, Sha93, ZW97a, ZW97b]. L¯ [BS96a]. X¯ [KT93]. β [Hil99]. modn [DH97]. c [R¨us96]. C(α) [Wei92]. χ2 [Cha90d]. D [BH90, Brz96, Cha99c, CJ98, Kou96b, Kou96f, MZ97, Sch97c, Won95, MV95b]. D[0; 1] [BP93]. D+ [Fie90]. δ [Fal94, Kau95]. E [Brz95, Brz96, MZ97]. E(XjX + W )[Beh99].ER [Koz96]. [Bor96, Wu92]. F [Ext91, Run93, Sil96a, Zog94]. F α [Bal94]. G [Imh97, Won95, Kra98]. I0 [Fie90, RT93]. k [BP99b, BCQY97, BGP94, CSC93, Cha90b, CAGM98, HMG98, HT91, NNR97, PA90, PAT90, RC94, SB95a, SS95, Tso96, Vas90]. k(≥ 2) [MvdM97]. K × K × K [EZ99]. L [Abr93, BSW97, Brz96, Don98, Ger93, GR93a, PJ94, RW94, Sha91, Xia95]. 1 2 P p L [Lin95, Web92]. L (0; 1) [OS98]. L1 [AM94b, BW97, Dav93, EH99b, Hub97, KP94b, LM92, ST96]. L2 [LH98a]. L1 [CAGM98]. Lp [Ahm97, Che96, GKL96, Leb96, Wu90, Hei93]. Lq [Joh91]. Ls [FPMP97]. λ3 [HK91]. M [Arc94b, Arc98b, BlZ93, BKR92, Cro94, Fer98, Gen98, Jon94, LZ91, RZ92a, RC94, WW90b, Zha97a, Bo98, Che97b, GB96, Sco93, Wan99d, Wie96]. -
Continuous-Service M/M/1 Queuing Systems
Article Continuous-Service M/M/1 Queuing Systems Song Chew Department of Mathematics and Statistics, Southern Illinois University Edwardsville, Edwardsville, IL 62026, USA; [email protected]; Tel.: +1-618-650-3016 Received: 29 March 2019; Accepted: 24 April 2019; Published: 28 April 2019 Abstract: In this paper, we look into a novel notion of the standard M/M/1 queueing system. In our study, we assume that there is a single server and that there are two types of customers: real and imaginary customers. Real customers are regular customers arriving into our queueing system in accordance with a Poisson process. There exist infinitely many imaginary customers residing in the system. Real customers have service priority over imaginary customers. Thus, the server always serves real (regular) customers one by one if there are real customers present in the system. After serving all real customers, the server immediately serves, one at a time, imaginary customers residing in the system. A newly arriving real customer presumably does not preempt the service of an imaginary customer and hence must wait in the queue for their service. The server immediately serves a waiting real customer upon service completion of the imaginary customer currently under service. All service times are identically, independently, and exponentially distributed. Since our systems are characterized by continuous service by the server, we dub our systems continuous-service M/M/1 queueing systems. We conduct the steady-state analysis and determine common performance measures of our systems. In addition, we carry out simulation experiments to verify our results. We compare our results to that of the standard M/M/1 queueing system, and draw interesting conclusions.