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

International Workshop on Automation of Software Test (AST)

作者： Arilo Claudio Dias Neto Guilherme Horta Travassos Systems Engineering and Computer Science Program-COPPE/UFRJ Federal University of Rio de Janeiro Rio de Janeiro Brazil

The technical literature regarding model-based testing (MBT) has several techniques with different characteristics and goals available to be applied in software projects. Besides the lack of information regarding these techniques, they could be applied together in a software project aiming at improving the testing coverage. However, this decision needs to be carefully analyzed to avoid loss of resources in a software project. Based on this scenario, this paper proposes an approach with the purpose of supporting the unique or combined selection of MBT techniques for a given software project considering two aspects: the adequacy level between MBT techniques and the software project characteristics and impact of more than one MBT technique in some testing process variables. At the end, preliminary results of an experimental evaluation are presented.

关键词： Software testing Automatic testing Software tools System testing Software quality Programming Software systems Costs Context modeling systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

Introducing Software Process Tailoring to BPMN: BPMNt

Introducing Software Process Tailoring to BPMN: BPMNt

引用

International Conference on Software and System Process (ICSSP)

作者： Raquel M. Pillat Toacy C. Oliveira Fabio L. Fonseca Systems Engineering and Computer Science Program-PESC / COPPE Federal University of Rio de Janeiro Rio de Janeiro Brazil

BPMN 2.0 is a widely used notation to model business process that has associated tools and techniques to facilitate process management, execution and monitoring. As a result using BPMN to model Software Development Process (SDP) can leverage on the BPMN's infrastructure to improve SDP quality. Nevertheless, when using BPMN to model Software Processes one can observe the lack of an important feature: means to represent process tailoring. This article introduces the BPMNt, a conservative extension to BPMN that aims at aggregating a tailoring representation mechanism as the one found at SPEM 2.0. BPMNt uses the extensibility classes already present in the BPMN meta-model. Our work also presents an example to illustrate the approach.

关键词： Software Business Unified modeling language Programming Adaptation models Standards Semantics

来源：评论

学校读者我要写书评

暂无评论

Context-based process line

Context-based process line

引用

作者： Nunes, Vanessa Werner, Claudia Santoro, Flavia Maria COPPE/UFRJ Systems Engineering and Computer Science Program P.O. Box 68511 Rio de Janeiro RJ Brazil NP2Tec and Postgraduate Information Systems Program UNIRIO Av. Pasteur 458 Urca - Rio de Janeiro RJ Brazil

ISBN: (纸本)9789898425065

Complexity and dynamism of day-to-day activities in organizations are inextricably linked, one impacting the other, increasing the challenges for constant adaptation of the way to organize work to address emerging demands. In this scenario, there are a variety of information, insight and reasoning being processed between people and systems, during process execution. We argue that process variations could be decided in real time, using context information collected. This paper presents a proposal for a business process line cycle, with a set of activities encapsulated in the form of components as central artefact. We explain how composition and adaptation of work may occur in real time and discuss a scenario for this proposal.

关键词： Enterprise resource management

来源：评论

学校读者我要写书评

暂无评论

SCENARIOTCHECK: A checklist-based reading technique for the verification of IoT scenarios

arXiv

引用

arXiv 2021年

作者： De Souza, Bruno Pedraça Travassos, Guilherme Horta Department of Systems Engineering and Computer Science Federal University of Rio de Janeiro COPPE/UFRJ Rio de Janeiro RJ Brazil

Software systems on the Internet of Things have driven the world into a new industrial revolution, bringing with it new features and concerns such as autonomy, continuous device connectivity, and interaction among systems, users, and things. Nevertheless, building these types of systems is still a problematic activity due to their specific features. Empirical studies show the lack of technologies to support the construction of IoT software systems, in which different software artifacts should be created to ensure their quality. Thus, software inspection has emerged as an alternative evidence-based method to support the quality assurance of artifacts produced during the software development cycle. However, there is no knowledge of inspection techniques applicable to IoT software systems. Therefore, this research presents SCENARIOTCHECK, a Checklist-based Reading Technique for the Verification of IoT Scenarios. The checklist has been evaluated with experimental studies. This research shows that the technique has good results regarding cost-efficiency, efficiency, and IoT software system development effectiveness. © 2021, CC BY.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Formalizing the situation of a business process activity

Formalizing the situation of a business process activity

引用

International Conference on computer Supported Cooperative Work in Design

作者： Talita da Cunha Mattos Flávia Maria Santoro Kate Revoredo Vanessa Tavares Nunes Postgraduate Information Systems Program UNIRIO Rio de Janeiro Brazil COPPE/PESC-Systems Engineering and Computer Science Program UFRJ Rio de Janeiro Brazil

Business processes are dynamic and constantly evolving. Contextual elements that had not yet been identified and represented can arise and influence the execution of each process instance in diverse manners. In this scenario, the identification of these elements is considered of great importance. This paper proposes a formalism for context associated with business processes that intends to identify the situation of an activity in order to subsidize decisions to be taken within the execution of a process.

关键词： Computational modeling Context Psychology Media Navigation

来源：评论

学校读者我要写书评

暂无评论

Categorizing network traffic in update-based protocols on scalable multiprocessors

Categorizing network traffic in update-based protocols on sc...

引用

International Symposium on Parallel Processing

作者： R. Bianchini T.J. LeBlanc J.E. Veenstra COPPE Systems Engineering UFRJ Brazil Department of Computer Science University of Rochester Rochester NY USA Silicon Graphics Inc. USA

Categorizes the coherence traffic in update-based protocols and shows that, for most applications, more than 90% of all updates generated by such a protocol are unnecessary. We identify application characteristics that generate useless update traffic, and compare the isolated and combined effects of several software and hardware techniques for eliminating useless updates. These techniques include dynamic and static hybrid protocols, a data re-mapping strategy, and coalescing write buffers. Our simulations show that these techniques are effective for different types of useless updates. Overall, software caching (where dynamic data re-mapping is performed under programmer or compiler control) has the potential to significantly increase the percentage of useful traffic in applications. When software caching is not applicable, either the static or the dynamic protocol generates the least useless traffic. Although coalescing write buffers provide great reductions in the total number of messages transferred, these buffers do not necessarily increase the percentage of useful traffic.

关键词： Telecommunication traffic Protocols Application software Traffic control Character generation Hardware Software performance Programming profession Program processors

来源：评论

学校读者我要写书评

暂无评论

Towards A Taxonomy for Ranking Knowledge in Internet of Everything

Towards A Taxonomy for Ranking Knowledge in Internet of Ever...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Viviane Cunha Farias da Costa Luiz Oliveira Jano de Souza Systems Engineering and Computer Science Program/COPPE Federal University of Rio de Janeiro Brazil Rio de Janeiro Brazil Systems Engineering and Computer Science Program/COPPE IFRJ Campus Niterói Federal Institute of Rio de Janeiro Federal University of Rio de Janeiro Brazil Rio de Janeiro Brazil

The paradigm of the Internet of Everything (IoE) adds value to Internet of Things (IoT) in connections among people, processes, data, and things. However, knowledge creation process in IoE context still requires concerns to what extent connected sensors and actuators collaborates in value created and outcomes of IoE applications. This study focuses on the requirement and design approach for identification of critical knowledge within IoE domain though a knowledge ranking approach. Existing solutions for semantic definitions and taxonomies in IoE are reviewed for this purpose. In addition, this work proposes the use of a knowledge-based taxonomy as the main driver for ranking knowledge in smart sensors as IoE enablers with a qualitative approach of its dimensions. To the best of our knowledge, this is the first work that comprehensively integrate a taxonomy concerning ranking knowledge in IoE applications.

关键词： Actuators Conferences Taxonomy Semantics Knowledge based systems Collaborative work Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Learning context to adapt business processes

Learning context to adapt business processes

引用

International Conference on computer Supported Cooperative Work in Design

作者： Juliana do E. Santo Carvalho Flavia Maria Santoro Kate Revoredo Vanessa Tavares Nunes Postgraduate Information Systems Program UNIRIO Rio de Janeiro Brazil COPPE PESC-Systems Engineering and Computer Science Program UFRJ Rio de Janeiro Brazil

ISBN: (纸本)9781467360845

Dynamic adaptation is the customization of a business process to make it applicable to a particular situation at any time of its life cycle. Adapting requires experience, and involves knowledge about various, internal and external, aspects of business. Thus, we argue for the application of adaptation rules, considering the context of a particular process instance. Furthermore, we state that a context-based adaptation environment should go beyond, and learn from decisions, as well as continuously identify new unforeseen situations (context definitions). The aim of this paper is to present a computational engine that infers the need to update situations and adaptation rules, suggesting changes to them. An application scenario is presented to discuss the usage of the proposal.

关键词： Context Itemsets Proposals Adaptation models Aircraft Runtime

来源：评论

学校读者我要写书评

暂无评论

Quantum Walks can Unitarily Represent Random Walks on Finite Graphs

arXiv

引用

arXiv 2021年

作者： de Andrade, Matheus Guedes Marquezino, Franklin Ratton, Daniel Manning College of Information and Computer Science University of Massachusetts Amherst United States Department of Computer and Systems Engineering - COPPE Federal University of Rio de Janeiro Brazil

Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any discrete-time coined quantum walk on a finite graph. This equivalence establishes a deep connection between the two processes, far stronger than simply considering quantum walks as quantum analogues of classical random walks. The present work strengthens this connection by providing a construction that establishes this equivalence in the reverse direction: a unitary time-dependent quantum walk can be constructed such that its vertex distribution is identical to the vertex distribution of any random walk on a finite graph at all time instants. The construction shown here describes a quantum walk that matches a random walk without measurements at all time steps (an otherwise trivial statement): measurement is performed in a quantum walk that evolved unitarily until a given time t such that its vertex distribution is identical to the random walk at time t. The construction procedure is general, covering both homogeneous and non-homogeneous random walks. For homogeneous random walks, unitary evolution implies time dependency for the quantum walk, since homogeneous quantum walks do not converge under arbitrary initial conditions, while a broad class of random walks does. Thus, the absence of convergence demonstrated for quantum walks in its debut comes from both time-homogeneity and unitarity, rather than unitarity alone, and our results shed light on the power of quantum walks to generate samples for arbitrary probability distributions. Finally, the construction here proposed is used to simulate quantum walks that match uniform random walks on the cycle and the torus. Copyright © 2021, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous download times in bandwidth-homogeneous BitTorrent swarms

arXiv

引用

arXiv 2021年

作者： Murai, Fabricio De Rocha, Antonio A.A. Figueiredo, Daniel R. De Souza E Silva, Edmundo A. COPPE/Systems Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil Computer Science Department Fluminense Federal University Niterói Brazil

Modeling and understanding BitTorrent (BT) dynamics is a recurrent research topic mainly due to its high complexity and tremendous practical efficiency. Over the years, different models have uncovered various phenomena exhibited by the system, many of which have direct impact on its performance. In this paper we identify and characterize a phenomenon that has not been previously observed: homogeneous peers (with respect to their upload capacities) experience heterogeneous download times. This behavior has direct impact on peer and system performance, such as high variability of download times, unfairness with respect to peer arrival order, bursty departures and content synchronization. Detailed packet-level simulations and prototype-based experiments on the Internet were performed to characterize this phenomenon. We also develop a mathematical model that accurately predicts the heterogeneous download rates of the homogeneous peers as a function of their content. In addition, we apply the model to calculate lower and upper bounds to the number of departures that occur in a burst. The heterogeneous download rates are more prevalent in unpopular swarms (very few peers). Although few works have addressed this kind of swarm, these by far represent the most common type of swarm in BT. © 2021, CC BY.

关键词： Functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：