In this work we introduce a concept of complexity for undirected graphs in terms the spectral analysis Laplacian operator defined by incidence matrix graph. Precisely, compute norm vector eigenvalues both graph and its complement take their product. Doing so, obtain quantity that satisfies two basic properties are expected measure complexity. First,complexity fully connected disconnected vanish...

recently tasks, as the basic units of syllabi, and the cognitive complexity, as the criterion for sequencing them, have caught many second language researchers’ attention. this study sought to explore the effect of utilizing the cognitively simple and complex tasks on high- and low-proficient efl iranian writers’ linguistic performance, i.e., fluency, accuracy, lexical complexity, and structura...

Kolmogorov in 1965 proposed two related measures of information content (alternately, measures of complexity) based on the size of a program which when processed by a suitable algorithm (machine) yields the desired object. The main emphasis was placed on a conditional complexity measure. In this paper a simple variation of the (restricted) conditional complexity measure investigated by Martin-L...

Measurability is the essential basis for management. Although the management of complexity is a central task of CIOs and IT-architects, literature has not proposed a concrete measure to quantify complexity in enterprise architectures so far. Against this background the contribution of this paper is a) the introduction of a system theoretic conceptualization of complexity in enterprise architect...

We constructively prove the existence of almost complete problems under logspace manyone reduction for some small complexity classes by exhibiting a parametrizable construction which yields, when appropriately setting the parameters, an almost complete problem for PSPACE, the class of space efficiently decidable problems, and for SUBEXP, the class of problems decidable in subexponential time. O...

Process measurement is the task of empirically and objectively assigning numbers to the properties of business processes in such a way as to describe them. Desirable attributes to study and measure include complexity, cost, maintainability, and reliability. In our work we will focus on investigating process complexity. We define process complexity as the degree to which a business process is di...

This paper studies static complexity in manufacturing systems. We enumerate factors innuencing static complexity, and deene a static complexity measure in terms of the processing requirements of parts to be produced and machine capabilities. The measure suggested for static complexity in manufacturing systems needs only the information available from production orders and process plans. The var...

The aim herein is to analyze utility-based prices and hedging strategies. The analysis is based on an explicitly solved example of a European claim written on a nontraded asset, in a model where risk preferences are exponential, and the traded and nontraded asset are diffusion processes with, respectively, lognormal and arbitrary dynamics. Our results show that a nonlinear pricing rule emerges ...