Loading...
Search for:
moalemi--aref-hossein
0.122 seconds
Total 1513 records
Simulation and Construction Ocean Energy Harvesting Device (wave and Current) by Use Piezoelectric Elements
, M.Sc. Thesis Sharif University of Technology ; Abbaspour, Madjid (Supervisor) ; Tabeshpour, Mohammad Reza (Supervisor)
Abstract
One of the unusual features of some ceramic materials is the piezoelectric effect. The piezoelectric effect results from the linear electromechanical interaction between the mechanical and electrical states in crystalline materials with no inversion symmetry. The piezoelectric effect is a reversible process: materials exhibiting the piezoelectric effect (the internal generation of electrical charge resulting from an applied mechanical force) also exhibit the reverse piezoelectric effect, the internal generation of a mechanical strain resulting from an applied electrical field. In the last decades, many research has been done on the use of these materials for the self-charging low-power...
Deep Learning-Based Intrusion Detection Systems in Industrial Control Systems
, M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza (Supervisor) ; Ahmadi, Siavash (Co-Supervisor)
Abstract
With the spread of threats against industrial control systems, preserving the security of these systems faces serious challenges. On the other hand, with the increase of communication between industrial control networks and external communication networks, the entry points of these networks have also increased and this exposes them to IP network threats. Beside that, traditional attacks on these systems, which generally occur by infiltrating the internal network, are also constantly changing and becoming more complex. These attacks mainly have a phase of hiding the attack from the monitoring systems, which eliminates the possibility of identifying the attacker's operations to a great extent...
New Achievable Rates In Frequency Hopped Spread Spectrum Systems
, M.Sc. Thesis Sharif University of Technology ; Marvasti, Farrokh (Supervisor)
Abstract
In this dissertation, we investigate the frequency hopped spread spectrum systems which are extensively used in many communication systems. We derive the capacity region of Synchronous Frequency Hopped Multiple Access (FHMA) channels (for any kind of noisy or nonselective fading environment) by using the side information which exists in the multi‐user detection. We assume that random hopping patterns are used by all the transmitters, and the common receiver knows the hopping patterns. We also compute the capacities of FHMA with and without power control for AWGN and noiseless MFSK (in particular BFSK) modulated systems and compare the ...
A Secure and Efficient Digital Signature Based on Polar Codes
, M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza (Supervisor)
Abstract
Regarding to the emergence of quantum computers and advances in the large scale implementation of them, exploiting hard problems of coding theory is of great importance.This family of problems, like those of lattices, has an acceptable resistance against classic and quantum attacks. Thus, they can be replaced with hard problems in number theory and algebra. Increasing dominance of cyberspace made us highly dependent to it. Consequently, preparing tools and methods to mitigate future threats is necessary. Digital signatures constitute an important family of cryptographic primitives. Code-based digital signatures are mostly suffering from two main drawbacks: large public key and long time of...
A misbehavior‐tolerant multipath routing protocol for wireless Ad hoc networks [electronic resource]
, Article International Journal of Research in Wireless Systems (IJRWS) ; Vol. 2, Issue 9, pp. , Sep. 2013 ; Pakravan, Mohammad Reza ; Aref, Mohammad Reza ; Sharif University of Technology
Abstract
Secure routing is a major key to service maintenance in ad hoc networks. Ad hoc nature exposes the network to several types of node misbehavior or attacks. As a result of the resource limitations in such networks nodes may have a tendency to behave selfishly. Selfish behavior can have drastic impacts on network performance. We have proposed a Misbehavior-Tolerant Multipath Routing protocol (MTMR) which detects and punishes all types of misbehavior such as selfish behavior, wormhole, sinkhole and grey-hole attacks. The protocol utilizes a proactive approach to enforce cooperation. In addition, it uses a novel data redirection method to mitigate the impact of node misbehavior on network...
Calculation of the Energy Release Rate of Nano-Cracks in FCC Materials Via the Many Body Atomic Scale FEM
, M.Sc. Thesis Sharif University of Technology ; Mohammadi Shodja, Hossein (Supervisor)
Abstract
Since the classical continuum theory fails to deal with the problems associated with defects, stress concentrators, and relevant deformation phenomena in solids, alternative approaches that can detect the atomistic nature of materials' fracture are required. The deficiency of the capture the size effect which yields delusively high values for some components of the stress field right on the edge of the stress concentrators, and its weakness in describing the complex interaction between small inhomogeneities, cracks and the like when they are only a few nanometers apart, are among some of the disadvantages of the classical approach. In recent years, however, atomistic methods are emerging to...
Multi Stage Multi-Secret Sharing Schemes
, M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza (Supervisor)
Abstract
The subject of Secret Sharing refers to the methods that a secret information is shared (by a dealer) among a number of parties, so called participants, each having one or more shares, such that the predefined subsets of the participants, called authorized subsets, are able to regenerate the secret using their shares. A more general scheme which is called Multi Stage Secret Sharing (MSSS) is to share multiple secrets among the participants such that the authorized subsets can reconstruct the secrets in the consecutive stages; in these schemes, in addition to the individual shares, the dealer should provide the participants with a number of public values regarding the secrets. A Multi-Secret...
Achievable Rates for Relay Networks with “Partial Decode and Forward” Strategy
,
Ph.D. Dissertation
Sharif University of Technology
;
Aref, Mohammad Reza
(Supervisor)
Abstract
“Decode and Forward” is one of coding strategies used in relay channel and networks in which each relay in the network decodes the transmitted message by the sender and other relays in the network and then re-encode and transmit it to the other relays and the receiver in the network. This process results in the cooperation between the relays and the sender to remove the uncertainty of the receiver about the transmitted message. “irregular encoding-successive decoding”, “regular encoding-backward decoding” and “regular encoding-sliding window decoding” are different methods usually used in “Decode and Forward” strategy. “partial decode and forward” is a generalized form of “decode and...
Analysis of Key Agreement in Secure Networks from the View of Information Theory
, M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza (Supervisor)
Abstract
In this thesis the problem of simultaneously generating multiple keys among multiple terminals is investigated. After providing a survey on the related works and exploiting the problem of sharing a common secret key and a private key among three terminals, we introduce a new source model which we call it the Four-Terminal model. We consider the problem of generating three kinds of keys among legitimate terminals and investigate the problem under two different scenarios, Backward and Forward scenarios, which depend on the kind of restrictions imposed on the usage of the public channel. We derive an achievable region for the backward scenario, using the combination of superposition coding and...
On the Capacity and Cooperative Strategies in Information Networks
,
Ph.D. Dissertation
Sharif University of Technology
;
Aref, Mohammad Reza
(Supervisor)
Abstract
Due to the remarkable growth in using communication networks such as ad-hoc, wireless and sensor networks, studying the building blocks of these networks (e.g., relay channel and interference channel) from information theoretic viewpoint and investigating cooperative strategies have recently received considerable attention. Also, owing to wide range of applications, state-dependent channels have been widely studied. In this dissertation, at first, we consider a state-dependent relay channel (SD-RC). For the cases wherein channel states are available causally or non-causally at different nodes, we propose new achievable rates for this channel using compress-and-forward strategy. Also we...
On the Capacity of Information Networks Utilizing Cognition and Cooperative Strategies
, Ph.D. Dissertation Sharif University of Technology ; Aref, Mohammad Reza (Supervisor)
Abstract
Interference management is one of the key issues in wireless networks wherein multiple source-destination pairs share the same medium and frequency band and interfere with each other. The exponentially growth in the number of wireless systems and services results in the spectrum shortage which has emerged the technologies that increase the spectral efficiency. Providing the users with cognition equipments in these networks enables them to sense the medium and use the obtained data to adapt their transmissions to cooperate with other users and improve their own rates as well as the others which results in the cognitive radio technology. In order to access the full potential of this technology,...
Analysis of Secret Key Agreement in The Channel Model with Side Information
, M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza (Supervisor)
Abstract
In this thesis, the problem of secret key agreement in the channel model with side information is studiedx. In order to investigate the problem, we consider three models according to the different ways of side information availability which are the state-dependent broadcast channel; the state-dependent broadcast channel in presence of public channel and the state-dependent wiretap channel with degraded versions of the channel state information.For the problem of secret key agreement in broadcast channels, two models, the state-dependent wiretap channel and state-dependent three receivers broadcast channel, are considered. We obtain inner and outer bounds of the secret key capacity region for...
Coordination in Cooperative Networks and Secret Key Agreement Using Common Information
, M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza (Supervisor)
Abstract
In order to utilize cooperative resources of a network, we have to investigate cooperative networks and strategies. Information theory, by introducing different concepts such as coordination and common information, gives us a suitable tool to study cooperative networks and using their resources. In this thesis, we investigate coordination and secret key agreement in cooperative networks. Our study consists of two parts. In the first part, we consider coordination and its applications in cooperative networks. For this purpose, we introduce the triangular multiterminal network as a proper model for studying empirical coordination in multiterminal networks and establish an inner and outer...
A Dynamic Programming Approach for Network Air Cargo Revenue Management
, M.Sc. Thesis Sharif University of Technology ; Modarres, Mohammad (Supervisor)
Abstract
This research aims to establish a novel approach to meet the capacity utilization challenge of the freight forwarders in order to maximize the expected revenue in a cargo network. The two-dimensional cargo capacities are assumed to be stochastic and limited in each leg. A stochastic dynamic programming model is developed to demonstrate the maximization of expected revenue over a finite planning horizon, in which each fare class request is to be either accepted or rejected. Although the main problem is computationally intractable due to multidimensional state variable, it can be decomposed into one-dimensional capacity control sub-problems for each leg. A heuristic algorithm is developed to...
When is it possible to simulate a DMC channel from another?
, Article 2013 IEEE Information Theory Workshop, ITW 2013 ; Sept , 2013 , Page(s): 1 - 5 ; 9781479913237 (ISBN) ; Yassaee, M. H ; Aref, M. R ; Gohari, A
2013
Abstract
In this paper, we study the problem of simulating a DMC channel from another DMC channel. We assume that the input to the channel we are simulating is i.i.d. and that the transmitter and receivers are provided with common randomness at limited rates. We prove bounds for simulating point-to-point, MAC and broadcast channels. As a special case, we recover the achievability part of the result of Cuff for point-to-point channel simulation via a noiseless link and shared randomness
A Theoretic Analysis of Energy Constrained Systems: Energy Transfering and Harvesting Systems
, M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza (Supervisor)
Abstract
Energy Harvesting has been appeared as an approach in order to make the green communications possible. In Energy Harvesting systems, nodes extract energy from the nature to extend their lifetimes. The harvested energy can also be used for the purpose of communication and specially for the transmission process. Compared to the conventional batterypowered systems, the Energy Harvesting systems have access to an unbounded source of energy (like vibration absorption devices, water mills, wind turbines, microbial fuel cells, solar cells, thermo-electric generators, piezoelectric cells, etc). However, the diffused nature of this energy makes it difficult to be used for communication. In this work,...
9-Round attack on AES-256 by a 6-round property
, Article Proceedings - 2010 18th Iranian Conference on Electrical Engineering, ICEE 2010, 11 May 2010 through 13 May 2010 ; 2010 , Pages 226-230 ; 9781424467600 (ISBN) ; Soleimany, H ; Aref, M ; Sharif University of Technology
2010
Abstract
In this paper, we propose a new 6-round Related-Key Impossible Differential property of AES-256 and two related-key impossible differential attacks on 7 and 9 round AES-256, based on the proposed property. The overall complexity of the proposed 7 round attack is decreased by the factor 217. This is for the first time that a Related-Key Impossible Differential attack on 9-round AES-256 is successful. Also this is the first related-key attack on 9-round AES-256 that needs only 2 keys. Although the data and time complexities of the attack are approximately code book and exhaustive search, but we think the proposed property will be useful in future research like boomerang and rectangle attacks
An achievable rate region for a class of broadcast-relay networks
, Article IEEE Information Theory Workshop 2010, ITW 2010, 6 January 2010 through 8 January 2010, Cairo ; 2010 ; 9781424463725 (ISBN) ; Ghabeli, L ; Aref, M ; Sharif University of Technology
2010
Abstract
In this paper we define Broadcast Relay Networks (BRN) with two relays. There are a transmitter, two relays and two receivers in the network. We find an achievable rate region for it by considering full cooperation between relays. We use symmetric relaying method at relays and Marton's broadcast code construction for the transmitter.We will show that Kramer's rate region for Broadcast Relay Channel (BRC), Ghabeli's rate for symmetric two-relay network, and Marton's rate region for Broadcast Channel are special cases of our achievable rate region
Improved related-key boomerang cryptanalysis of AES-256
, Article 2010 International Conference on Information Science and Applications, ICISA 2010, 21 April 2010 through 23 April 2010 ; April , 2010 ; 9781424459438 (ISBN) ; Sharifi, A ; Aref, M ; Sharif University of Technology
2010
Abstract
A specific class of differential cryptanalytic approach, known as Related Key Boomerang Attack, has been successfully applied to several symmetric cryptographic primitives in particular encryption schemes such as Advanced Encryption Standard (AES). In this paper, we propose a new related-key boomerang attack on 8-round AES-256, a couple of ones on 9-round following the work of Gorski et al. In the first one, we attacked 8-round AES-256 with the time complexity of 279 and the data complexity of 259. The extended 8-round attack on 9-round AES-256 is more efficient than previous attacks from both time and data complexity perspectives
Developing an integrated revenue management and customer relationship management approach in the hotel industry
, Article Journal of Revenue and Pricing Management ; Volume 14, Issue 2 , March , 2015 , Pages 97-119 ; 14766930 (ISSN) ; Modarres, M ; Aref, S ; Sharif University of Technology
Palgrave Macmillan Ltd
2015
Abstract
Revenue management (RM) and customer relationship management (CRM) are the standard strategies of many hotels to increase their profitability. Although the objectives and time horizons of RM and CRM are different, they can be considered as complimentary business strategies. However, the integration has received little attention both practically and theoretically. In this study, we develop an approach to jointly make the capacity allocation and overbooking decisions considering CRM strategies over a hotel network. Hotel customers are divided based on their lifetime value into two major groups of occasional and loyal customers. Price discounts and room availability guarantee (RAG) are offered...