This paper presents graphic-based simulation and optimal PI controller design of a static var compensator (SVC) using MATLAB’s SIMULINK. Utilization of MATLAB software simplifies problem solving complexity and also reduces working time. In this paper, an optimal PI controller design using genetic algorithms for the SVC was demonstrated. From which satisfactory controller design results, tests a...

Decision making in supply chain context can be a difficult process due to the complexity of the models used to support this decision. We present first results of research project whom the target is to support collaboration decisions. The present study focuses on modelling the dynamics of the customer’s planning and market behaviors. We propose an aggregated model of these behaviours and associa...

Using a mobile phone while doing another activity is a common dual-task activity in our daily lives. This study examined the effect of texting on the postural stability of young adults. Twenty college students were asked to perform static and dynamic postural stability tasks. Traditional COP and multivariate multiscale entropy (MMSE) were used to assess the static postural stability and the Sta...

Being able to compute worst-case execution time bounds for tasks of an embedded software system with hard real-time constraints is crucial to ensure the correct (timing) behavior of the overall system. Any means to increase the (static) time predictability of the embedded software are of high interest – especially due to the ever-growing complexity of such software systems. In this paper we stu...

It is di cult to predict a genetic algorithm's behavior on an arbitrary problem. Combining genetic algorithm theory with practice we use the average hamming distance as a syntactic metric to derive bounds on the time convergence of genetic algorithms. Analysis of a at function provides worst case time complexity for static functions. Further, employing linearly computable runtime information, w...

This study introduces a class of region preserving space transformation (RPST) schemes for accessing high-dimensional data. The access methods in this class differ with respect to their spacepartitioning strategies. The study develops two new static partitioning schemes that can split each dimension of the space within linear space complexity. They also support an effective mechanism for handli...

This paper is part of a research on static analysis in order to predict program resources and belongs to the implicit computational complexity line of research. It presents intrinsic characterizations of the classes of functions, which are computable in NC, that is by a uniform, poly-logarithmic depth and polynomial size family of circuits, using first order functional programs. Our characteriz...

The application of Orthogonal Space-Time Block Codes (O-STBC) as the encoding scheme in the presence of “non-quasi-static” fading was considered. A simple and efficient adaptive method of channel estimation based on the interpolation of estimates acquired at the pre-amble and post-amble of framed blocks of information is developed. Moreover, the proposed method is proven, both theoretically and...

At Eurocrypt 2011, Lindell presented practical static and adaptively UC-secure commitment schemes based on the DDH assumption. Later, Blazy et al. (at ACNS 2013) improved the efficiency of the Lindell’s commitment schemes. In this paper, we present static and adaptively UC-secure commitment schemes based on the same assumption and further improve the communication and computational complexity, ...

The Software Assurance Metrics and Tool Evaluation (SAMATE) team studied thousands of warnings from static analyzers. Tools have difficulty distinguishing between the absence of a weakness and the presence of a weakness that is buried in otherwise-irrelevant code elements. This paper presents classes of these code elements, which we call “code complexities.” They have been present in software a...