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

作者： The Anh, Pham Babiarz, Artur Czornik, Adam Niezabitowski, Michal Siegmund, Stefan Department of Mathematics Le Quy Don Technical University 236 Hoang Quoc Viet Hanoi Viet Nam Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Akademicka 16 Gliwice44-100 Poland Faculty of Mathematics Center for Dynamics Technische Universität Dresden Zellescher Weg 12-14 Dresden01069 Germany

In this paper, we establish some criteria for boundedness, stability properties, and separation of solutions of autonomous nonlinear nabla Riemann-Liouville scalar fractional difference equations. To derive these results, we prove the variation of constants formula for nabla Riemann-Liouville fractional difference equations. © 2020 John Wiley & Sons, Ltd.

关键词： Difference equations

来源：评论

学校读者我要写书评

暂无评论

Two approaches to car sequencing in the paint shop

引用

Journal of Physics: Conference Series 2021年第1期1780卷

作者： Sara Bysko Jolanta Krystek Szymon Bysko Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Gliwice Poland

The problem of car sequencing has been considered in the literature many times, but very often with the assumption of many simplifications, which meant that the discussed issue was far from the problems occurring in reality. The article presents an attempt to capture the real problem of sequencing, in particular in paint shop, because from the point of view of economic indicators, painting process is today a complex, multistage, extremely energy consuming and cost intensive operation. The main goal is therefore to minimize the number of costly changeovers of painting guns, resulting from color changes and synchronize those with periodic cleanings, forced by technological requirements. For this purpose, a buffer located in the paint shop is applied. In the paper a game-theoretic framework is presented to analyze the considered problem. Two games: Buffer Slot Assignment Game and Buffer-OutShuttle are compared with algorithms based on priority rules. Based on the performed simulations the effectivity of presented algorithms is verified using several datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Test Case Generation From Web Usage Information

引用

Procedia computer science 2021年 181卷 913-920页

作者： Jorge Esparteiro Garcia Ana C.R. Paiva Anca-Maria Bizoi Instituto Politécnico de Viana do Castelo Rua Escola Industrial e Comercial de Nun’Álvares 4900-347 Viana do Castelo Portugal INESC TEC Faculty of Engineering University of Porto Rua Dr. Roberto Frias s/n 4200-465 Porto Portugal Faculty of Automatic Control and Computer Science University Politehnica of Bucharest Splaiul Independentei 313 Bucharest Romania

In the context of SaaS (Software as a Service) where software has to be up and running 7 days a week and 24 hours a day, keeping the requirements specification and related test cases up to date can be difficult. Managing requirements in this context has additional challenges that need to be taken into account, for instance, re-prioritize requirements continuously and identify/update new dependencies among them. When requirements change, related test cases need to be updated accordingly. We claim that extracting and analyzing the usage of the SaaS can help to maintain requirements and test cases updated and contribute to improve the overall quality of the services provided. This paper presents an extension to REQAnalytics. REQAnalytics is a recommendation system that collects information about the usage of a SaaS and generates recommendations to improve the SaaS provided. The evolution involves extending the analysis performed over the sequences of functionalities (requirements) and refining the data provided for Software Requirements Specification, with the purpose of helping the requirements engineers in the requirement maintenance activities, and to improve the overall quality of the services. Furthermore, the extension presented in this paper is able to generate test cases in a regression testing context.

关键词： Requirements engineering test cases web usage recommender systems

来源：评论

学校读者我要写书评

暂无评论

Performance evaluations of a cloud computing physical machine with task reneging and task resubmission (feedback) 27th

Performance evaluations of a cloud computing physical machin...

引用

27th International Conference on computer Networks, CN 2020

作者： Kuaban, Godlove Suila Soodan, Bhavneet Singh Kumar, Rakesh Czekalski, Piotr Institute of Theoretical and Applied Informatics Polish Academy of Sciences Baltycka 5 Gliwice44-100 Poland School of Mathematics Shri Mata Vaishno Devi University KatraJammu and Kashmir182320 India Department of Computer Graphics Vision and Digital Systems Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Akademicka 16 Gliwice44-100 Poland

ISBN: (纸本)9783030507183

Cloud service providers (CSP) provide on-demand cloud computing services, reduces the cost of setting-up and scaling-up IT infrastructure and services, and stimulates shorter establishment times for start-ups that offer or use cloud-based services. Task reneging or dropping sometimes occur when a task waits in the queue longer than its timeout or execution deadline, or it is compromised and must be dropped from the queue or as an active queue management strategy to avoid tail dropping of tasks when the queues are full. Reneged or dropped tasks could be resubmitted provided they were not dropped due to security reasons. In this paper, we present a simple M/M/c/N queueing model of a cloud computing physical machine, where the interarrival times and the services times are exponentially distributed, with N buffer size and c virtual machines running in parallel. We present numerical examples to illustrate the effect of task reneging and task resubmission on the queueing delay, probability of task rejection, and the probability of immediate service. © Springer Nature Switzerland AG 2020.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Evolving the very act of reading with socio-collaborative dimensions - Ar-annotations over physical books

UPB Scientific Bulletin, Series C: Electrical Engineering an...

引用

UPB Scientific Bulletin, Series C: Electrical Engineering and computer science 2020年第2期82卷 3-14页

作者： Stănică, Iulia-Cristina Moldoveanu, Alin Alabbasi, Hesham Adnan Moldoveanu, Florica Grădinaru, Alexandru Dascălu, Maria Morar, Anca Asavei, Victor Rădoi, Mireille Faculty of Automatic Control and Computer Science University POLITEHNICA of Bucharest Romania Department of Engineering in Foreign Language University POLITEHNICA of Bucharest Romania Computer Science Department College of Education Mustansiriyah University Iraq Central University Library of Bucharest "Carol I" Romania

Revitalizing reading and modernizing books have become important issues today, when technology is everywhere around us. New means are needed to make reading and physical books attractive to all people, regardless of age, hobbies or occupation. Our current paper presents an innovative project called Lib2Life which creates a mobile application that can improve books by adding annotations and social capabilities to them. © 2020, Politechnica University of Bucharest. All rights reserved.

关键词： Annotation Digital reading Digitization

来源：评论

学校读者我要写书评

暂无评论

Preface

Lecture Notes in Networks and Systems

引用

Lecture Notes in Networks and Systems 2024年 1076 LNNS卷 v-vii页

作者： Biele, Cezary Kacprzyk, Janusz Kopeć, Wieslaw Możaryn, Jakub Owsiński, Jan W. Romanowski, Andrzej Sikorski, Marcin National Information Processing Institute Warszaw Poland Polish Academy of Sciences Systems Research Institute Warsaw Poland Polish-Japanese Academy of Information Technology Warsaw Poland Institute of Automatic Control and Robotics Faculty of Mechatronics Warsaw University of Technology Warsaw Poland Institute of Applied Computer Science Faculty of Electrical Electronic Computer and Control Engineering Lódż University of Technology LODZ Poland Department of Applied Informatics in Management Faculty of Management and Economics Gdańsk University of Technology Gdańsk Poland

来源：评论

学校读者我要写书评

暂无评论

Empirical evaluation of continuous test-driven development in industrial settings

Empirical evaluation of continuous test-driven development i...

引用

作者： Madeyski, Lech Kawalerowicz, Marcin Faculty of Computer Science and Management Wroclaw University of Science and Technology Wyb. Wyspianskiego 27 Wroclaw50-370 Poland Faculty of Electrical Engineering Automatic Control and Informatics Opole University of Technology Opole Poland

BACKGROUND: Continuous Test-Driven Development (CTDD) is, proposed by the authors, enhancement of the well-established Test-Driven Development (TDD) agile software development and design practice. CTDD combines TDD with continuous testing (CT) that essentially perform background testing. The idea is to eliminate the need to execute tests manually by a TDD-inspired developer. OBJECTIVE: The objective is to compare the efficiency of CTDD vs TDD measured by the red-to-green time (RTG time), i.e., time from the moment when the project is rendered not compiling or any of the tests is failing, up until the moment when the project compiles and all the tests are passing. We consider the RTG time to be a possible measurement of efficiency because the shorter the RTG time, the quicker the developer is advancing to the next phase of the TDD cycle. METHOD: We perform single case and small-n experiments in industrial settings presenting how our idea of Agile Experimentation materialise in practice. We analyse professional developers in a real-world software development project employing ***. We extend the contribution presented in our earlier paper by: 1) performing additional experimental evaluation of CTDD and thus collecting additional empirical evidence, 2) giving an extended, detailed example how to use and analyse both a single case and small-n experimental designs to evaluate a new practice (CTDD) in industrial settings taking into account natural constraints one may observe (e.g., a limited number of developers available for research purposes) and presenting how to reach more reliable conclusions using effect size measures, especially PEM and PAND which are more appropriate when data are not normally distributed or there is a large variation between or within phases. RESULTS: We observed reduced variance and trimmed means of the RTG time in CTDD in comparison to TDD. Various effect size measures (including ES, d-index, PEM, and PAND) indicate small, albeit non-

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Promela and Spin Formal Verification of an M-Health Medical Social Media System

Promela and Spin Formal Verification of an M-Health Medical ...

引用

2019 International Conference on Automation, Computational and Technology Management, ICACTM 2019

作者： Al-Gayar, Sarmad Monadel Sabree Goga, Nicolae Al-Habeeb, Naseer Abdulkarim Jaber Doctoral School of Automatic Control and Computers University Politehnica of Bucharest Bucharest Romania Faculty of Engineering in Foreign Languages Computer Science University Politehnica of Bucharest Bucharest Romania

ISBN: (纸本)9781538680100

The process of detecting and identifying errors early in the life-cycle of any software has many challenges. The tools used for model checking are however becoming more effective and usable because they are helping the identification of errors. This has empowered users to apply model checking to large-scale problems. The process of validating the model implementation is normally harder. We created a Promela model by using a model checker called Spin in order to verify the Medical Social Media System based on Social Oriented Networks by using M-Health technology and sensors in smartphones and bracelets for medical data acquisition, in order for it to be used in the healthcare sector in Iraq. For the Promela Model, we first described the behaviors of the Medical Social Media Systems via UML timelines. After that, we combined the UML timelines in state diagrams that were finally transformed into a Promela model and verified with the Spin model checker. © 2019 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Implementing a solution for monitoring SLA violations in Cloud

Implementing a solution for monitoring SLA violations in Clo...

引用

Dependability in Sensor, Cloud and Big Data Systems and Application (DependSys), IEEE International Conference on

作者： Andreea Floricu Razvan Buzatu Catalin Negru Florin Pop Aniello Castiglione Faculty of Automatic Control and Computer Science University POLITEHNICA of Bucharest Romania National Institute for Research and Development in Informatics - ICI Bucharest Romania University of Naples Parthenope Italy

ISBN: (数字)9781728176512

ISBN: (纸本)9781728176529

Over time, the increased use of the Internet has led to the widespread adoption of web and cloud applications. More and more applications are coming to the aid of persons or companies to make their work easier. A Service Level Agreement (SLA) gathers information about all contracted services and their expected reliability in a single document and plays a very important role when it comes to IT (Information Technology) sales. This paper examines the extent to which the SLA is complied with through a series of specific reports and graphs. The usefulness of this application is to get an overview of web services to know the frequency of situations unforeseen and the moments when they deviated from the operation in good conditions.

关键词： Cloud computing Web services Conferences Reliability Information technology Monitoring Service level agreements

来源：评论

学校读者我要写书评

暂无评论

A spectral small-gain condition for input-to-state stability of infinite networks

引用

IFAC-PapersOnLine 2020年第2期53卷 5303-5308页

作者： Christoph Kawan Andrii Mironchenko Abdalla Swikir Navid Noroozi Majid Zamani Institute of Informatics Ludwig Maximilian University Munich Germany Faculty of Computer Science and Mathematics University of Passau Germany Department of Electrical and Computer Engineering Technical University of Munich Germany Otto-von-Guericke University Magdeburg Laboratory for Systems Theory and Automatic Control Germany Computer Science Department University of Colorado Boulder USA

This paper presents a tight small-gain theorem for networks composed of infinitely many finite-dimensional subsystems. Assuming that each subsystem is exponentially input-to-state stable, we show that if the gain operator, collecting all the information about the internal Lyapunov gains, has a spectral radius less than one, the overall infinite network is exponentially input-to-state stable. We illustrate the effectiveness of our result by applying it to traffic networks.

关键词： Nonlinear systems small-gain theorems infinite-dimensional systems input-to-state stability Lyapunov methods large-scale systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：