scholarly journals THE APPROACH TO MEASUREMENT OF REQUIREMENT QUALITY BY APPLICATION OF GENERALIZED PRIORITIZED FUZZY CONSTRAINT SATISFACTION PROBLEM

2021 ◽  
Vol 19 (3) ◽  
pp. 175
Author(s):  
Radomir Prodanović ◽  
Dejan Rančić ◽  
Ivan Vulić ◽  
Dušan Bogićević
Keyword(s):  
Constraint Satisfaction ◽  
Quality Evaluation ◽  
Constraint Satisfaction Problem ◽  
Quality Measurement ◽  
Development Lifecycle ◽  
Software Development Lifecycle ◽  
Fuzzy Constraint ◽  
Fuzzy Constraint Satisfaction ◽  
The Given

The requirement quality affects product development at all lifecycle stages, as well as the end product. Poorly defined requirements bring to extended deadlines, increased financial costs, even to project disruption. Current researches related to the good quality of requirements include characteristics of good requirements and the development of new elicitation techniques. Requirement quality evaluation should be tailored both to the professionals and users who defined requirements according to their needs. Therefore, the model is designed for requirement quality measurement based on the characteristics of good requirements by application of the Generalized Prioritized Fuzzy Constraint Satisfaction Problem. The model enables the participation of selected characteristics of good requirements in quality evaluation, according to priorities. The evaluator obtains information if the requirement satisfies the given quality satisfaction threshold based on the degree of fulfillment of selected characteristics of a good requirement. The model is applied to all types of requirements, as well as to the evaluation of requirements at all software development lifecycle stages.

Extending Fuzzy Constraint Satisfaction Problems

2006 ◽  
Vol 10 (4) ◽  
pp. 465-471 ◽  
Author(s):  
Yasuhiro Sudo ◽  
◽  
Masahito Kurihara ◽  
Tamotsu Mitamura ◽  
◽  
...  
Keyword(s):  
Constraint Satisfaction ◽  
Constraint Satisfaction Problem ◽  
Computation Time ◽  
Approximate Solutions ◽  
Constraint Satisfaction Problems ◽  
Test Problems ◽  
Hybrid Domain ◽  
Fuzzy Constraint ◽  
Fuzzy Constraint Satisfaction ◽  
Discrete Domains

This paper propose a new type of Fuzzy CSP (Constraint Satisfaction Problem) that have a mixture of discrete and continuous domains, and a Spread-Repair algorithm. In traditional CSP and Fuzzy CSP, values for the variables are chosen from the discrete domains. However, this is often inconvenient when one wants to express real world problems. We show that this model, called HDFCSP (Hybrid Domain Fuzzy CSP), can be solved by Spread-Repair, an extension of the well known iterative improvement algorithms. Experimental results on some test problems show that the algorithm actually has an ability of finding partial approximate solutions with high probability in a computation time much shorter than the traditional, discrete-domain FCSP.

On Considering Constraints of Different Importance in Fuzzy Constraint Satisfaction Problems

1998 ◽  
Vol 06 (05) ◽  
pp. 489-501 ◽  
Author(s):  
Vicenç Torra I Reventós
Keyword(s):  
Constraint Satisfaction ◽  
Real World ◽  
Constraint Satisfaction Problems ◽  
Human Reasoning ◽  
Fuzzy Constraints ◽  
A Value ◽  
Equal Importance ◽  
Real World Applications ◽  
Fuzzy Constraint ◽  
Fuzzy Constraint Satisfaction

Several real-world applications (e.g., scheduling, configuration, …) can be formulated as Constraint Satisfaction Problems (CSP). In these cases, a set of variables have to be settled to a value with the requirement that they satisfy a set of constraints. Classical CSPs are defined only by means of crisp (Boolean) constraints. However, as sometimes Boolean constraints are too strict in relation to human reasoning, fuzzy constraints were introduced. When fuzzy constraints are considered, human reasoning usually performs some compensation between alternatives. Thus other operators than t-norms are advisable. Besides of that, not all constraints can be considered with equal importance. In this paper we show that the WOWA operator can consider both aspects: compensation between constraints and constraints of different importance.

scholarly journals DevOps phases across Software Development Lifecycle

2021 ◽  
Author(s):  
Mayank Gokarna
Keyword(s):  
Life Cycle ◽  
Software Development ◽  
Implementation Strategy ◽  
Quality Of Services ◽  
Comprehensive Collection ◽  
Development Lifecycle ◽  
Development Life Cycle ◽  
Software Development Lifecycle ◽  
Software Development Life Cycle

DevOps is the combination of cultural mindset, practices, and tools that increases a team's ability to release applications and services at high velocity. The development and operations teams always have a conflict around the scope of responsibility. With these differences the quality and speed of delivery across software Development Life Cycle is negatively impacted. DevOps is about removing the barriers between two traditionally delimited teams, development and operations. With DevOps, these two teams work together to optimize both the productivity of developers and the reliability of operations. They strive to communicate frequently, increase efficiencies, and improve the quality of services they provide. They take full ownership for their services, often beyond where their stated roles or titles have traditionally been scoped. Transitioning to DevOps requires a change in culture and mindset first. It is quite difficult to persuade a whole company to change its culture at once. This paper aims to bring different phases of software development lifecycle into DevOps implementation strategy and presents a comprehensive collection of leading tools used across Software Development life Cycle to automate and integrate different stages of software delivery. This paper also highlights on DevOps practices which span across different phases of the Software Development Lifecycle and how those can be implemented with different tools available.

scholarly journals Threshold Treewidth and Hypertree Width

2020 ◽  
Author(s):  
Robert Ganian ◽  
Andre Schidler ◽  
Manuel Sorge ◽  
Stefan Szeider
Keyword(s):  
Constraint Satisfaction ◽  
Constraint Satisfaction Problem ◽  
Structural Parameters ◽  
Exact Methods ◽  
Fixed Parameter Tractable ◽  
Computational Costs ◽  
Fixed Parameter ◽  
Account Information ◽  
The Given ◽  
Theoretical Results

Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters is bounded by a constant, then CSP becomes solvable in polynomial time. However, here the order of the polynomial in the running time depends on the width, and this is known to be unavoidable; therefore, the problem is not fixed-parameter tractable parameterized by either of these width measures. Here we introduce an enhancement of tree and hypertree width through a novel notion of thresholds, allowing the associated decompositions to take into account information about the computational costs associated with solving the given CSP instance. Aside from introducing these notions, we obtain efficient theoretical as well as empirical algorithms for computing threshold treewidth and hypertree width and show that these parameters give rise to fixed-parameter algorithms for CSP as well as other, more general problems. We complement our theoretical results with experimental evaluations in terms of heuristics as well as exact methods based on SAT/SMT encodings.

Sign in / Sign up

Export Citation Format

Share Document