ARTICLE | doi:10.20944/preprints202205.0398.v1
Subject: Computer Science And Mathematics, Information Systems Keywords: Generative Software Development; Code Generation; Complexty Space
Online: 30 May 2022 (11:32:07 CEST)
This survey proposed an evaluation model to analyze and examine different approaches to generativity. In addition to problem domain concepts, the following concepts were used to define this model: Complexity and complexity management, and Systematics view to achieve unified and integrated insight into disparate evaluation criteria. The research's approach to the said concepts is first introduced. Then, the evaluation model is presented.
ARTICLE | doi:10.20944/preprints202102.0260.v3
Subject: Computer Science And Mathematics, Discrete Mathematics And Combinatorics Keywords: Feature Selection; Discrete Data; Heuristics; Running average
Online: 7 December 2021 (11:28:35 CET)
By applying a running average (with a window-size= d), we could transform Discrete data to broad-range, Continuous values. When we have more than 2 columns and one of them is containing data about the tags of classification (Class Column), we could compare and sort the features (Non-class Columns) based on the R2 coefficient of the regression for running averages. The parameters tuning could help us to select the best features (the non-class columns which have the best correlation with the Class Column). “Window size” and “Ordering” could be tuned to achieve the goal. this optimization problem is hard and we need an Algorithm (or Heuristics) for simplifying this tuning. We demonstrate a novel heuristics, Called Simulated Distillation (SimulaD), which could help us to gain a somehow good results with this optimization problem.
Subject: Computer Science And Mathematics, Algebra And Number Theory Keywords: Semantic Complexity; Semantics; Text Complexity; Readability Formulae
Online: 6 September 2021 (13:33:34 CEST)
Simple measures often couldn’t count a deep complexity. In the case of semantic complexity, conventional readability formulas share a common style, a common sort of achievements and a common borders of limitation: These formulas lack a semantics-aware approach and as a result, a precise measurement of semantic complexity couldn’t be done. In this paper, we introduce DASTEX, a novel semantics-aware complexity measure for semantic complexity of text. By DASTEX, a new layer of complexity analysis are opened for NLP, cognitive and computational tasks. This measure benefits from an intuitionistic underlying formal model which consider semantic as a lattice of intuitions. This yields to a well-defined definition for semantic of a text and its complexity. DASTEX is a practical analysis method upon this formal model. So a complete suite of idea, model and method are prepared to result in a simple but yet deep measure for semantic complexity of text. The evaluation of the proposed approach is done by 4 Experiments. The results show DASTEX is capable of measuring the semantic complexity of text in 6 application-tasks.
ARTICLE | doi:10.20944/preprints202104.0028.v1
Subject: Computer Science And Mathematics, Algebra And Number Theory Keywords: Software Engineering; Model; Model-Driven; Model Driven Development; MDD; MDA
Online: 1 April 2021 (14:47:55 CEST)
In Model-Driven Development (MDD), the models, their generation, and imposing changes on them (model transformation) are used for the development of software. Models provide a framework to start from the imagination and abstraction to create and accomplish the final system. Models create a slow and steady transition from whatness to howness, i.e. from the natural path of the generation of software. For supporting this path, the Logic and Functionality of software must be changeable during its evolution. Here we provide a brief introduction to the concept of Model Driven Development.
CASE REPORT | doi:10.20944/preprints202103.0430.v1
Subject: Computer Science And Mathematics, Algebra And Number Theory Keywords: Queue-Systems; SAN model; Mobius tool; Simulation
Online: 16 March 2021 (14:58:52 CET)
There is a case about a system comprising two queues of M/M(a)/1/K with a due date with FCFS service policy in each queue. Using the methods of simulation and mathematical analysis, the solution diagrams were illustrated for the fixed due date Ɵ=1 second at the phase of due date up to the commencement of the service, limited capacity K1=5 and K2=4, for both scenarios of different service management rate resulted. For the analytical solution, first, a SAN model from the system was created in the Mobius tool. For simulation, a java discrete systems simulation code was used. Adjustment of the initial values, selection of the scenarios for service rate, the number of the consumers in the simulation, etc. were all carried out in the simulation code.
REVIEW | doi:10.20944/preprints202103.0204.v1
Subject: Computer Science And Mathematics, Discrete Mathematics And Combinatorics Keywords: Hybrid Automata; Formal Modeling; Discrete State; Continuous State; Formal Methods
Online: 5 March 2021 (21:45:11 CET)
In this paper, Hybrid Automata, which is a formal model for hybrid systems, has been introduced. A summary of its theory is presented and some of its special and important classes are listed and some properties that can be studied and checked for it are mentioned. Finally, the purposes of use, the most widely used areas, and the tools that provide H.A. Support are addressed.
ARTICLE | doi:10.20944/preprints202103.0651.v1
Subject: Computer Science And Mathematics, Algebra And Number Theory Keywords: Abstraction; Complexity Management; Patterns; Generative Patterns
Online: 25 March 2021 (17:29:09 CET)
According to many researchers, Abstraction is the basis of mathematics, computing, counting devices, and computer science and engineering. What is more, all of the above deal with complexity management in some way, and abstraction is the most basic mechanism of complexity management.Generative software development - whether in the sense of empowering humans by machine to create software or in the sense of reusing products - has been and is one of the serious concerns and goals of software engineering. The interesting thing is that in both views of generativity, the main issue is still, in a way, complexity management: whether this complexity management is to achieve diversity and reuse management (Czarnecki’s approach) or to Structuring from existing structures (the approach of Alexander and his followers in an object-oriented society).In this article, we will first look at complexity and its various definitions. The definitions that show, despite the different perspectives on complexity in different disciplines and domains, all point in one direction. We will conclude that complexity is rooted in multiplicity. In the following, we will formally define complexity. In the following discussion, we will look at the generative patterns of software development, and then we will look at the complexity management patterns at seven levels.In this article, the author has tried to maintain a comprehensive approach to complexity and to consider the approaches of different domains to complexity.