Sharif Digital Repository

This paper suggests a method, called distributed voting, to overcome the problem of the single point of failure in a TMR system used in robotics and industrial control applications. It uses time redundancy and is based on TMR with disagreement detector feature. This method masks faults occurring in the voter where the TMR system can continue its function properly. The method has been evaluated by injecting faults into Vertex2Pro and Vertex4 Xilinx FPGAs. An analytical evolution is also performed. The results of both evaluation approaches show that the proposed method can improve the reliability and the mean time to failure (MTTF) of a TMR system by at least a factor of (2-R v(t)) where Rv(t)... 

The Pyramid network is a desirable network topology used as both software data-structure and hardware architecture. In this paper, we propose a general definition for a class of pyramid networks that are based on grid connections between the nodes in each level. Contrary to the conventional pyramid network in which the nodes in each level form a mesh, the connections between these nodes may also be according to other grid-based topologies such as the torus, hypermesh or WK-recursive. Such pyramid networks form a wide class of interconnection networks that possess rich topological properties. We study a number of important properties of these topologies for general-purpose parallel processing... 

Optical character recognition of cursive scripts present a number of challenging problems in both segmentation and recognition processes and this attracts many researches in the field of machine learning. This paper presents a novel approach based on a combination of MLP and SVM to design a trainable OCR for Persian/Arabic cursive documents. The implementation results on a comprehensive database show a high degree of accuracy which meets the requirements of commercial use. © Springer-Verlag Berlin Heidelberg 2005  

This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-to-peer network. The SkipTree supports range queries as well as single point queries which are routed in O(log n) hops. SkipTree is fully decentralized with each node being connected to O(logn) other nodes. The memory usage for maintaining the links at each node is O(log n log log n) on average and O(log2 n) in the worst case. Load balance is also guaranteed to be within a constant factor. © Springer-Verlag Berlin Heidelberg 2005  

In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying physical topology. This causes a large volume of redundant traffic in the underlying physical network as well as an extra delay in message delivery in the overlay network. Topology mismatch occurs because overlay networks are not aware of their underlying physical networks. In this paper we present a mathematical model for topology awareness of overlay networks (degree of matching between an overlay and its underlying physical network) and the efficiency of message delivery on them. We also after determining the... 

In this paper, a parallel algorithm for data clustering is presented on a multi-computer with star topology. This algorithm is fast and requires a small amount of memory per processing element, which makes it even suitable for SIMD implementation. The proposed parallel algorithm completes in O(K+S 2-T 2) steps for a clustering problem of N data patterns with M features per pattern and K clusters, where N.M = S!, K.M = T!, and M=R!, on a s-star interconnection network. © Springer-Verlag Berlin Heidelberg 2005  

In this paper, we propose extended Rebeca as a tool-supported actor-based language for modeling and verifying concurrent and distributed systems. We enrich Rebeca with a formal concept of components which integrates the message-driven computational model of actor-based languages with synchronous message passing. Components are used to encapsulate a set of internal active objects which react asynchronously to messages by means of methods and which additionally interact via a synchronous message passing mechanism. Components themselves interact only via asynchronous and anonymous messages. We present our compositional verification approach and abstraction techniques, and the theory... 

This paper presents a simulation-based environment to study fault effects in message missing failures in CAN-based systems. A CAN controller is modeled by VHDL at behavioral level and is exploited to set up a network composed of several nodes. A total of 27,000 transient faults of seven types are injected into five critical portions of the system including the bus and four portions of the CAN controller. The experimental results show that the faults affect the message sending in which more than 20% of faults cause the failure. Besides, with a heavy workload, faults that are occurred into the CAN controller and on the bus cause about 90% and 10% of all failures, respectively  

This paper presents transient and permanent fault injection into Verilog models of digital systems during the design phase by a developed simulation-based fault injection tool called INJECT. With this fault injection tool, it is possible to inject crucial fault models in all abstraction levels (such as swith-level) supported by Verilog HDL. Several fault models for injecting into Verilog models are specified and described. Analyzing the results obtained from the fault injections, using INJECT enables system designers to inform from dependable parameters, such as fault latency, propagation and coverage. As a case study, a 32-bit processor, namely DP32, has been evaluated and effects of faults... 

Recently, due to the restructuring of power systems and the high penetration level of local renewables, distribution systems have encountered with the complexity of power management. Therefore, the modern systems would be operated in a multi-agent structure which facilitates the power management as well as privacy protections of independent entities. In this structure, the distribution system is assumed to compose of several agents who independently schedule their local resources in order to maximize their own profits. Consequently, this paper provides an efficient peer-to-peer (P2P) active power management framework in a multi-agent distribution system while considering network constraints... 

Peer-to-peer (P2P) energy trading platform is an upcoming energy generation and effective energy managing strategy that rewards proactive customers (acting as prosumers) in which individuals trade energy for products and services. On the other hand, P2P trading is expected to give multiple benefits to the grid in minimizing the peak load demand, energy consumption costs, and eliminating network losses. However, installing P2P energy trading on a broader level in electrical-based networks presents a number of modeling problems in physical and virtual network layers. As a result, this article presents a thorough examination of P2P studies of energy trade literature. An overview is given with... 

By increasing the penetration level of the combined heat and power systems and demand response programs between energy consumers in the distribution network, the interaction between electricity and the natural gas network becomes more complicated. This paper proposes a peer-to-peer (P2P) energy sharing scheme for energy trading among Smart Energy Hubs (S.E. Hubs) which can trade both electrical and thermal energy with each other to reduce their cost and, reduce their dependency to gas and electricity utility companies. A two-stage energy strategy is presented. In the first stage, the S.E. Hubs total social cost is reduced by finding the optimal energy sharing profiles. And, in the second... 

This article deals with solving distributed optimization problems with equality constraints by a class of uncertain nonlinear heterogeneous dynamic multiagent systems. It is assumed that each agent with an uncertain dynamic model has limited information about the main problem and limited access to the information of the state variables of the other agents. A distributed algorithm that guarantees cooperatively solving of the constrained optimization problem by the agents is proposed. Via applying this algorithm, the agents do not need to continuously broadcast their data. It is shown that the proposed algorithm can be useful in solving resource allocation problems. IEEE