Routing algorithms for the shuffle-exchange permutation network

The Journal of Supercomputing - For a natural number n, let $$S_n$$ denote the symmetric group on n letters. Let $$\textit{SEP}_n$$ be the Cayley graph $$\text {Cay}(S_n,\{\sigma ,\sigma ^{-1},\tau...     

Optimal energy scheduling of micro-grids considering the uncertainty of solar and wind renewable resources

Journal of Scheduling - Nowadays, electricity consumption in industrial and domestic sectors is growing increasingly. In recent years, due to the expansion of consumption and increased concern...     

Linkage studies in dominant optic atrophy, Kjer type: possible evidence for heterogeneity

Dominant optic atrophy, Kjer type, is an autosomal dominant disorder causing progressive loss of visual acuity and colour vision from early childhood. The gene (OPA1) has variable expressivity, a penetrance of 0.98, and the locus has been localised to 3q28-29. We have genotyped nine British families with the disease using 12 polymorphic microsatellite markers from this region. Linkage and haplotype analysis shows the OPA1 gene to be located in a 2.3 cM interval between markers D3S1601 and D3S2748. One family showed no evidence of linkage with the chromosome 3 markers, suggesting for the first time that locus heterogeneity for this disease may exist, although exclusion for linkage is based on unaffected subjects. In addition, analysis of recombinants has enabled us to order the 12 markers along chromosome 3.     

Reliability analysis of component-level redundant topologies for solid-state fault current limiter

Experience shows that semiconductor switches in power electronics systems are the most vulnerable components. One of the most common ways to solve this reliability challenge is component-level redundant design. There are four possible configurations for the redundant design in component level. This article presents a comparative reliability analysis between different component-level redundant designs for solid-state fault current limiter. The aim of the proposed analysis is to determine the more reliable component-level redundant configuration. The mean time to failure (MTTF) is used as the reliability parameter. Considering both fault types (open circuit and short circuit), the MTTFs of different configurations are calculated. It is demonstrated that more reliable configuration depends on the junction temperature of the semiconductor switches in the steady state. That junction temperature is a function of (i) ambient temperature, (ii) power loss of the semiconductor switch and (iii) thermal resistance of heat sink. Also, results’ sensitivity to each parameter is investigated. The results show that in different conditions, various configurations have higher reliability. The experimental results are presented to clarify the theory and feasibility of the proposed approaches. At last, levelised costs of different configurations are analysed for a fair comparison.     

An image encryption method based on chaos system and AES algorithm

The Journal of Supercomputing - In this paper, a novel image encryption algorithm is proposed based on the combination of the chaos sequence and the modified AES algorithm. In this method, the...     

Pre-bent shape design of full free-form curved beams using isogeometric method and semi-analytical sensitivity analysis

In this paper, isogeometric analysis (IGA) is employed to solve the problem of a curved beam with free-form geometry, arbitrary loading, and variable flexural/axial rigidity. The main objective of the study is to develop a unified approach for full free-from curved beam problems that can be integrated with a newly developed semi-analytical sensitivity analysis to solve pre-bent shape design problems. The required set of B-spline control points are calculated using an interpolation technique based on chord-length parameterization. The one-to-one correspondence is considered for parameters of the geometry, loading, and rigidity which is proven to have extreme importance. An IGA curved beam element is suggested based on the Euler-Bernoulli beam theory for the general curvilinear coordinate. The validity and effectiveness of the proposed formulation is confirmed by application to a variety of examples. Moreover, three shape optimization examples are taken into consideration. In the first two examples, the pre-bent shapes of spiral and Tschinhausen curved beams with free-form geometry under distributed loading are obtained. In the third example, the pre-bending problem of wind turbine blades is addressed as an industrial example.     

Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NoCs

Network-on-Chip (NoC) is a preferred communication medium for massively parallel platforms. Fixed-priority based scheduling using virtual-channels is one of the promising solutions to support real-time traffic in on-chip networks. Most of the existing works regarding priority-based NoCs use a flit-level preemptive scheduling. Under such a mechanism, preemptions can only happen between the transmissions of successive flits but not during the transmission of a single flit. In this paper, we present a modified framework where the non-preemptive region of each NoC packet increases from a single flit. Using the proposed approach, the response times of certain traffic flows can be reduced, which can thus improve the schedulability of the whole network. As a result, the utilization of NoCs can be improved by admitting more real-time traffic. Schedulability tests regarding the proposed framework are presented along with the proof of the correctness. Additionally, we also propose a path modification approach on top of the non-preemptive region based method to further improve schedulability. A number of experiments have been performed to evaluate the proposed solutions, where we can observe significant improvement on schedulability compared to the original flit-level preemptive NoCs.     

Designing end-to-end resource reservations in predictable distributed embedded systems

Contemporary distributed embedded systems in many domains have become highly complex due to ever-increasing demand on advanced computer controlled functionality. The resource reservation techniques can be effective in lowering the software complexity, ensuring predictability and allowing flexibility during the development and execution of these systems. This paper proposes a novel end-to-end resource reservation model for distributed embedded systems. In order to support the development of predictable systems using the proposed model, the paper provides a method to design resource reservations and an end-to-end timing analysis. The reservation design can be subjected to different optimization criteria with respect to runtime footprint, overhead or performance. The paper also presents and evaluates a case study to show the usability of the proposed model, reservation design method and end-to-end timing analysis.     

filtering of nonlinear plants over networks

In this paper, we consider the filtering problem for Lipschitz systems in a networked environment. We assume that the measurements transmitted over the network are subject to quantization, uncertain delays and communication constraints. We first analytically demonstrate how each of the these issues affect the filtering problem. Second, we tackle the filter design as an optimization problem with LMI constraints. The optimization maximizes the Lipschitz constant and thus the region of attraction for which the filter is stable and an bound is satisfied by the error system. Copyright © 2013 John Wiley & Sons, Ltd.     

A robust digital image watermarking technique using lifting wavelet transform and firefly algorithm

In this paper, an optimized and robust digital image watermarking technique based on lifting wavelet transform (LWT) and firefly algorithm is proposed. LWT is newer and faster generation of former wavelet transforms and firefly algorithm is an efficient optimizing algorithms. In current technique, base image decomposed by LWT into 4 sub bands then the first sub band separated into non overlapping blocks. After that blocks are sorted in order of descending based on standard derivation of each block. Selecting suitable blocks for special embedding process seems to be an optimization problem due to existence of a trade-off between imperceptibility and robustness. Firefly algorithm used to solve this trade-off while selecting primary blocks causes high robustness and low imperceptibility and vice versa. For improving security, Arnold transform applied to watermark and achieved scrambled image bits used as condition for embedding process. The proposed technique evaluated by variety of attacks like additive noise, average filter, median filter, sharpening filter and some other geometric and non-geometric attacks and experimental results showed its good imperceptibility and high robustness.