A Study of Text Mining Framework for Automated Classification of Software Requirements in Enterprise Systems

abstract: Text Classification is a rapidly evolving area of Data Mining while Requirements Engineering is a less-explored area of Software Engineering which deals the process of defining, documenting and maintaining a software system's requirements. When researchers decided to blend these two streams in, there was research on automating the process of classification of software requirements statements into categories easily comprehensible for developers for faster development and delivery, which till now was mostly done manually by software engineers - indeed a tedious job. However, most of the research was focused on classification of Non-functional requirements pertaining to intangible features such as security, reliability, quality and so on. It is indeed a challenging task to automatically classify functional requirements, those pertaining to how the system will function, especially those belonging to different and large enterprise systems. This requires exploitation of text mining capabilities. This thesis aims to investigate results of text classification applied on functional software requirements by creating a framework in R and making use of algorithms and techniques like k-nearest neighbors, support vector machine, and many others like boosting, bagging, maximum entropy, neural networks and random forests in an ensemble approach. The study was conducted by collecting and visualizing relevant enterprise data manually classified previously and subsequently used for training the model. Key components for training included frequency of terms in the documents and the level of cleanliness of data. The model was applied on test data and validated for analysis, by studying and comparing parameters like precision, recall and accuracy.Dissertation/ThesisMasters Thesis Engineering 201

Exploration of the High Entropy Alloy Space as a Constraint Satisfaction Problem

High Entropy Alloys (HEAs), Multi-principal Component Alloys (MCA), or Compositionally Complex Alloys (CCAs) are alloys that contain multiple principal alloying elements. While many HEAs have been shown to have unique properties, their discovery has been largely done through costly and time-consuming trial-and-error approaches, with only an infinitesimally small fraction of the entire possible composition space having been explored. In this work, the exploration of the HEA composition space is framed as a Continuous Constraint Satisfaction Problem (CCSP) and solved using a novel Constraint Satisfaction Algorithm (CSA) for the rapid and robust exploration of alloy thermodynamic spaces. The algorithm is used to discover regions in the HEA Composition-Temperature space that satisfy desired phase constitution requirements. The algorithm is demonstrated against a new (TCHEA1) CALPHAD HEA thermodynamic database. The database is first validated by comparing phase stability predictions against experiments and then the CSA is deployed and tested against design tasks consisting of identifying not only single phase solid solution regions in ternary, quaternary and quinary composition spaces but also the identification of regions that are likely to yield precipitation-strengthened HEAs.Comment: 14 pages, 13 figure

Thermodynamic Bond Graphs and the Problem of Thermal Inertance

It is shown that an isolated thermal inertance does not obey the second law of thermodynamics. Consequently, such an element should not be used in physical systems theory. To eliminate the structural gap in the thermal domain of current physical systems theory, a new framework is introduced using Bond Graph concepts. These Thermodynamic Bond Graphs are the result of synthesis of methods used in thermodynamics and in mechanics

A decision-making methodology for selecting trigeneration systems

The paper considers the selection of a cogeneration system as a multicriteria decision-making problem, which involves economical, technical, thermodynamic and environmental issues. Taking into account the preference information given by the Decision-Maker (DM) about the weight of each criterion, a ranked set of alternatives is obtained by solving a discrete optimization problem based on the Tchebycheff metric. The problem definition, the structure and the solution algorithms are described. The DM can identify the most favorable alternatives in a finite number of steps. The method is illustrated with the help of an example