A framework to integrate software behavior into dynamic probabilistic risk assessment

Software plays an increasingly important role in modern safety-critical systems. Although, research has been done to integrate software into the classical probabilistic risk assessment (PRA) framework, current PRA practice overwhelmingly neglects the contribution of software to system risk. Dynamic probabilistic risk assessment (DPRA) is considered to be the next generation of PRA techniques. DPRA is a set of methods and techniques in which simulation models that represent the behavior of the elements of a system are exercised in order to identify risks and vulnerabilities of the system. The fact remains, however, that modeling software for use in the DPRA framework is also quite complex and very little has been done to address the question directly and comprehensively. This paper develops a methodology to integrate software contributions in the DPRA environment. The framework includes a software representation, and an approach to incorporate the software representation into the DPRA environment SimPRA. The software representation is based on multi-level objects and the paper also proposes a framework to simulate the multi-level objects in the simulation-based DPRA environment. This is a new methodology to address the state explosion problem in the DPRA environment. This study is the first systematic effort to integrate software risk contributions into DPRA environments.     

Furan–thiophene copolymers: Electrosynthesis and electrochemical behavior

The electrochemical copolymerization of furan and thiophene was performed at a constant electrode potential in a binary solvent system consisting of boron trifluoride/ethyl ether and an additional amount of ethyl ether (molar ratio = 1 : 2). The obtained homopolymers and copolymers were characterized with cyclic voltammetry and infrared spectroscopy. The influence of the applied electropolymerization potential and the monomer feed ratio of furan and thiophene on the copolymers was investigated. The furan–thiophene copolymers showed good stability of the redox activity in an acetonitrile‐based electrolyte solution. © 2007 Wiley Periodicals, Inc. J Appl Polym Sci 2008     

Multi-indicator Active Queue Management Method

A considerable number of applications are running over IP networks. This increased the contention on the network resource, which ultimately results in congestion. Active queue management (AQM) aims to reduce the serious consequences of network congestion in the router buffer and its negative effects on network performance. AQM methods implement different techniques in accordance with congestion indicators, such as queue length and average queue length. The performance of the network is evaluated using delay, loss, and throughput. The gap between congestion indicators and network performance measurements leads to the decline in network performance. In this study, delay and loss predictions are used as congestion indicators in a novel stochastic approach for AQM. The proposed method estimates the congestion in the router buffer and then uses the indicators to calculate the dropping probability, which is responsible for managing the router buffer. The experimental results, based on two sets of experiments, have shown that the proposed method outperformed the existing benchmark algorithms including RED, ERED and BLUE algorithms. For instance, in the first experiment, the proposed method resides in the third-place in terms of delay when compared to the benchmark algorithms. In addition, the proposed method outperformed the benchmark algorithms in terms of packet loss, packet dropping, and packet retransmission. Overall, the proposed method outperformed the benchmark algorithms because it preserves packet loss while maintaining reasonable queuing delay.     

Smart home security: challenges,issues and solutions at different IoT layers

The Journal of Supercomputing - The Internet of Things is a rapidly evolving technology in which interconnected computing devices and sensors share data over the network to decipher different...     

Enhancing power transfer capability through flexible AC transmission system devices:a review

Global demand for power has significantly increased, but power generation and transmission capacities have not increased proportionally with this demand. As a result, power consumers suffer from variou...     

PDQ: Parallel Distance Queries for deformable meshes

This paper presents a new algorithm to efficiently maintain Bounding-Volume Hierarchies (BVHs) for fast distance queries with deformable polygon meshes using multi-core architectures. The method involves inflating the bounding volumes in an efficient manner to guarantee the enclosure of the deformable model within the BVH at all times. This is done at low additional computation and memory cost without significantly degrading the quality of the BVH and also in a fashion that allows a simple parallel implementation. Additionally, to facilitate fast queries specifically for deforming meshes, we propose a novel algorithm for the bottom-up construction of BVHs that results in much faster distance queries.     

Home Automation Using Augmented Reality (HAAR)

Wireless Personal Communications - The development of Smart Home Controllers has seen rapid growth in recent years, especially for smart devices, that can utilize the Internet of Things (IoT)....     

Artificial intelligence in cyber security: research advances,challenges, and opportunities

Artificial Intelligence Review - In recent times, there have been attempts to leverage artificial intelligence (AI) techniques in a broad range of cyber security applications. Therefore, this paper...     

Improving cache locking performance of modern embedded systems via the addition of a miss table at the L2 cache level

To confer the robustness and high quality of service, modern computing architectures running real-time applications should provide high system performance and high timing predictability. Cache memory is used to improve performance by bridging the speed gap between the main memory and CPU. However, the cache introduces timing unpredictability creating serious challenges for real-time applications. Herein, we introduce a miss table (MT) based cache locking scheme at level-2 (L2) cache to further improve the timing predictability and system performance/power ratio. The MT holds information of block addresses related to the application being processed which cause most cache misses if not locked. Information in MT is used for efficient selection of the blocks to be locked and victim blocks to be replaced. This MT based approach improves timing predictability by locking important blocks with the highest number of misses inside the cache for the entire execution time. In addition, this technique decreases the average delay per task and total power consumption by reducing cache misses and avoiding unnecessary data transfers. This MT based solution is effective for both uniprocessors and multicores. We evaluate the proposed MT-based cache locking scheme by simulating an 8-core processor with 2 levels of caches using MPEG4 decoding, H.264/AVC decoding, FFT, and MI workloads. Experimental results show that in addition to improving the predictability, a reduction of 21% in mean delay per task and a reduction of 18% in total power consumption are achieved for MPEG4 (and H.264/AVC) by using MT and locking 25% of the L2. The MT results in about 5% delay and power reductions on these video applications, possibly more on applications with worse cache behavior. For the FFT and MI (and other) applications whose code fits inside the level-1 instruction (I1) cache, the mean delay per task increases only by 3% and total power consumption increases by 2% due to the addition of the MT.