Loading...
Search for: information-analysis
0.006 seconds

    Text steganography by changing words spelling

    , Article 2008 10th International Conference on Advanced Communication Technology, Phoenix Park, 17 February 2008 through 20 February 2008 ; Volume 3 , 2008 , Pages 1912-1913 ; 17389445 (ISSN); 9788955191356 (ISBN) Shirali Shahreza, M ; Sharif University of Technology
    2008
    Abstract
    One of the important issues in security fields is hidden exchange of information. There are different methods for this purpose such as cryptography and steganography. Steganography is a method of hiding data within a cover media so that other individuals fail to realize their existence. In this paper a new method for steganography in English texts is proposed. In this method the US and UK spellings of words substituted in order to hide data in an English text. For example "color" has different spelling in UK (colour) and US (color). Therefore the data can be hidden in the text by substituting these words  

    A new evaluation method for ontology alignment measures

    , Article 1st Asian Semantic Web Conference, ASWC 2006, Beijing, 3 September 2006 through 7 September 2006 ; Volume 4185 LNCS , 2006 , Pages 249-255 ; 03029743 (ISSN); 3540383298 (ISBN); 9783540383291 (ISBN) Bagheri Hariri, B ; Abolhassani, H ; Sharif University of Technology
    Springer Verlag  2006
    Abstract
    Various methods using different measures have been proposed for ontology alignment. Therefore, it is necessary to evaluate the effectiveness of such measures to select better ones for more quality alignment. Current approaches for comparing these measures, are highly dependent on alignment frameworks, which may cause unreal results. In this paper, we propose a framework independent evaluation method, and discuss results of applying it to famous existing string measures. © Springer-Verlag Berlin Heidelberg 2006  

    The stretched network: Properties, routing, and performance

    , Article Journal of Information Science and Engineering ; Volume 24, Issue 2 , 2008 , Pages 361-378 ; 10162364 (ISSN) Shareghi, P ; Sarbazi Azad, H ; Sharif University of Technology
    2008
    Abstract
    In this paper, we study a class of interconnection networks for multiprocessors, called the Stretched-G network, which is based on a base graph G by replacing each edge of the base network with an array of processors. Two interesting features of the proposed topology are its area-efficient VLSI layout and superior scalability over the underlying base network while preserving most of its desirable properties. We conduct a general study on the topological properties of stretched networks. We first obtain their basic topological parameters and derive some embedding results. We then present optimal routing and broadcasting algorithms for such networks. We also present a unified approach to... 

    Improving mobile banking security using steganography

    , Article 4th International Conference on Information Technology-New Generations, ITNG 2007, Las Vegas, NV, 2 April 2007 through 4 April 2007 ; 2007 , Pages 885-887 ; 0769527760 (ISBN); 9780769527765 (ISBN) Shirali Shahreza, M ; Sharif University of Technology
    2007
    Abstract
    Upon development of m-commerce as one of the new branches of e-commerce, m-banking has emerged as one of the main divisions of m-commerce. As the m-banking was received very well, it has embarked upon supply of various services based on different systems and with the aid of various services such as the Short Messaging Service (SMS). However, in spite of its advantages, m-banking is facing some challenges as well. One of these challenges is the issue of security of this system. This paper presents a method for increasing security of the information requested by users with the use of steganography method. In this method, instead of direct sending of the information, it is hidden in a picture... 

    Collage steganography

    , Article 5th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2006. In conjunction with 1st IEEE/ACIS International Workshop on Component-Based Software Engineering, Software Architecture and Reuse, COMSAR 2006, Honolulu, HI, 10 July 2006 through 12 July 2006 ; Volume 2006 , 2006 , Pages 316-321 ; 0769526136 (ISBN); 9780769526133 (ISBN) Shirali Shahreza, M ; Shirali Shahreza, S ; Sharif University of Technology
    2006
    Abstract
    Establishing hidden communication is an important subject of discussion that has gained increasing importance nowadays with the development of the Internet. One of the methods introduced for establishing hidden communication is steganography. Methods of steganography have been mostly applied on images while the major characteristic of these methods is the change in the structure and features of the images so as not to be identifiable by human users. However, on the other hand, many methods have been proposed for breaking and extracting information (steganalysis) for these methods. This paper presents a method for hiding information in images by changing the appearance of the picture instead... 

    A comparative study of mutual information analysis under a Gaussian assumption

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 25 August 2009 through 27 August 2009, Busan ; Volume 5932 LNCS , 2009 , Pages 193-205 ; 03029743 (ISSN) ; 3642108377 (ISBN) Moradi, A ; Mousavi, N ; Paar, C ; Salmasizadeh, M ; Sharif University of Technology
    Abstract
    In CHES 2008 a generic side-channel distinguisher, Mutual Information, has been introduced to be independent of the relation between measurements and leakages as well as between leakages and data processed. Assuming a Gaussian model for the side-channel leakages, correlation power analysis (CPA) is capable of revealing the secrets efficiently. The goal of this paper is to compare mutual information analysis (MIA) and CPA when leakage of the target device fits into a Gaussian assumption. We first theoretically examine why MIA can reveal the correct key guess amongst other hypotheses, and then compare it with CPA proofs. As our theoretical comparison confirms and shown recently in ACNS 2009... 

    Cost derivation of a dyadic supply chain with time lag information sharing

    , Article 37th International Conference on Computers and Industrial Engineering 2007, Alexandria, 20 October 2007 through 23 October 2007 ; Volume 3 , 2007 , Pages 1709-1714 ; 9781627486811 (ISBN) Sajadifar, S. M ; Haji, R ; Shenas, N. Y ; Sharif University of Technology
    2007
    Abstract
    In this paper we consider a dyadic supply chain consisting of one warehouse and one retailer with information exchange. We assume that the demand process to the retailer is a Poisson process and transportation times are constant. The retailer applies continuous review (R,Q)-policy. When the retailer's inventory position reaches R+s she sends information about her customer demand and inventory activities to the supplier. The supplier receives this information after a constant time lag. The supplier starts with m initial batches (of size Q), and places an order in a batch of size Q to an outside source immediately after receiving the information from the retailer. In this paper using the idea... 

    Fuzzy trust inference in trust graphs and its application in semantic web social networks

    , Article 2006 World Automation Congress, WAC'06, Budapest, 24 June 2006 through 26 June 2006 ; 2006 ; 1889335339 (ISBN); 9781889335339 (ISBN) Lesani, M ; Bagheri, S ; Sharif University of Technology
    IEEE Computer Society  2006
    Abstract
    People generate information or get it from the others. When one gets information from the others it is important to get it from trusted ones. Each individual in a society can get the information he needs form his trusted friends but there are also many other people in the society that he or she indirectly trusts and can benefit from their information. The idea of benefiting from the indirectly trusted people can well be employed in social networks where finding trusted people can be automated. There should be a feature for users to specify how much they trust a friend and a mechanism to infer the trust in the society trust graph from one user to another that is not directly a friend of the... 

    A new method for real-time steganography

    , Article 8th International Conference on Signal Processing, ICSP 2006, Guilin, 16 November 2006 through 20 November 2006 ; Volume 4 , 2006 ; 0780397371 (ISBN); 9780780397378 (ISBN) Shirali Shahreza, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2006
    Abstract
    The hidden, real-time sending and display of information, esp. in public places, has since long received attention and faced many challenges. Therefore, different methods have been proposed so far for hiding information in different cover media. In this paper I propose a new method for the real-time hiding of information without need to any storage cover media. This method is based on the real-time hiding of information in output screens of the instrument (such as screens shown by the monitor). This method of steganography is very similar to the two discussions of image steganography and video steganography. The idea suggested in this paper was simulated on a PC computer by using the Pascal... 

    Adaptive fault-tolerant data flooding for energy-aware sensor networks

    , Article 2nd International Conference on Intelligent Sensing and Information Processing, ICISIP'05, Chennai, 4 January 2005 through 7 January 2005 ; Volume 2005 , 2005 , Pages 83-87 ; 0780388402 (ISBN); 9780780388406 (ISBN) Karzand, M ; Ghannad Rezaie, M ; Shah Mansouri, V ; Sharif University of Technology
    2005
    Abstract
    Flooding technique is widely using to manipulate sensor network essential activities such as synchronization, data gathering, network query and in-network information processing. Reliable and low latency data broadcasting is the primary goal in design of appropriate quality of service aware flooding algorithm. This paper proposes a new error-rate adaptive reliable data flooding strategy. Energy consumption which it the main limitation in sensor network, has been considered in optimal presented scheme. Also the tradeoff between reliability, power consumption and latency has been cared to achieve the finest devise. The simulation results have shown significant enhancement in quality of data... 

    Efficient symmetry reduction for an actor-based model

    , Article 2nd International Conference on Distributed Computing and Internet Technology, ICDCIT 2005, Bhubaneswar, 22 December 2005 through 24 December 2005 ; Volume 3816 LNCS , 2005 , Pages 494-507 ; 03029743 (ISSN); 3540309993 (ISBN); 9783540309994 (ISBN) Jaghoori, M. M ; Sirjani, M ; Mousavi, M. R ; Movaghar, A ; Sharif University of Technology
    2005
    Abstract
    Symmetry reduction is a promising technique for combatting state space explosion in model checking. The problem of finding the equivalence classes, i.e., the so-called orbits, of states under symmetry is a difficult problem known to be as hard as graph isomorphism. In this paper, we show how we can automatically find the orbits in an actor-based model, called Rebeca, without enforcing any restriction on the modeler. The proposed algorithm solves the orbit problem for Rebeca models in polynomial time. As a result, the simple actor-based Rebeca language can be utilized efficiently for modeling and verification of systems, without involving the modeler with the details of the verification... 

    Network vulnerability analysis through vulnerability take-grant model (VTG)

    , Article 7th International Conference on Information and Communications Security, ICICS 2005, Beijing, 10 December 2005 through 13 December 2005 ; Volume 3783 LNCS , 2005 , Pages 256-268 ; 03029743 (ISSN); 3540309349 (ISBN); 9783540309345 (ISBN) Shahriari, H. R ; Sadoddin, R ; Jalili, R ; Zakeri, R ; Omidian, A. R ; Sharif University of Technology
    2005
    Abstract
    Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a fact, exploiting most of vulnerabilities result in access rights alteration. In this paper, we propose a new vulnerability analysis method based on the Take-Grant protection model. We extend the initial Take-Grant model to address the notion of vulnerabilities and introduce the vulnerabilities rewriting rules to specify how the protection state of the system can be changed by exploiting vulnerabilities. Our analysis is based on a bounded polynomial algorithm, which generates the closure of the Take-Grant graph... 

    Traffic information use modeling in the context of a developing country

    , Article Periodica Polytechnica Transportation Engineering ; Volume 33, Issue 1-2 , 2005 , Pages 125-137 ; 03037800 (ISSN) Mamdoohi, A. R ; Kermanshah, M ; Sharif University of Technology
    Technical University of Budapest  2005
    Abstract
    The use of traffic information in the form of radio reports, as a solution to the problem of congestion, is one of the issues, which are of particular importance for large cities like Tehran. In this study, factors affecting the use of traffic information in the context of a developing country are examined for commuters in the city of Tehran using ordered logit models. Results based on the particular survey designed for this purpose are compared to those of a developed country. Regarding the use of information in the form of listening to the radio traffic reports, the models show that older commuters, commuters who adjust their departure time according to traffic conditions (those who are... 

    An imperialist competitive algorithm for service composition and optimal selection in cloud manufacturing

    , Article 5th International Symposium on Computational and Business Intelligence, ISCBI 2017, 11 August 2017 through 14 August 2017 ; 2017 , Pages 129-133 ; 9781538617717 (ISBN) Akbaripour, H ; Houshmand, M ; Kerdegari, A ; Sharif University of Technology
    Abstract
    Cloud manufacturing is an emerging service-oriented manufacturing paradigm that integrates and manages distributed manufacturing resources through which complex manufacturing demands with a high degree of customization can be fulfilled. The process of Service Composition and Optimal Selection (SCOS) is an important issue for practical implementation of cloud manufacturing. In this paper, a new Mixed Integer Programming (MIP) model for solving the SCOS with transportation consideration has been proposed. This model minimizes both manufacturing and transportation costs subject to some constraints such as necessity of transportation between manufacturing resources and the requirements specified... 

    Providing RS participation for geo-distributed data centers using deep learning-based power prediction

    , Article 2nd International Congress on High-Performance Computing and Big Data Analysis, TopHPC 2019, 23 April 2019 through 25 April 2019 ; Volume 891 , 2019 , Pages 3-17 ; 18650929 (ISSN); 9783030334949 (ISBN) Taheri, S ; Goudarzi, M ; Yoshie, O ; Sharif University of Technology
    Springer  2019
    Abstract
    Nowadays, geo-distributed Data Centers (DCs) are very common, because of providing more energy efficiency, higher system availability as well as flexibility. In a geo-distributed cloud, each local DC responds to the specific portion of the incoming load which distributed based on different Geographically Load Balancing (GLB) policies. As a large yet flexible power consumer, the local DC has a great impact on the local power grid. From this point of view, a local DC is a good candidate to participate in the emerging power market such as Regulation Service (RS) opportunity, that brings monetary benefits both for the DC as well as the grid. However, a fruitful collaboration requires the DC to... 

    Providing RS participation for geo-distributed data centers using deep learning-based power prediction

    , Article 2nd International Congress on High-Performance Computing and Big Data Analysis, TopHPC 2019, 23 April 2019 through 25 April 2019 ; Volume 891 , 2019 , Pages 3-17 ; 18650929 (ISSN) ; 9783030334949 (ISBN) Taheri, S ; Goudarzi, M ; Yoshie, O ; Sharif University of Technology
    Springer  2019
    Abstract
    Nowadays, geo-distributed Data Centers (DCs) are very common, because of providing more energy efficiency, higher system availability as well as flexibility. In a geo-distributed cloud, each local DC responds to the specific portion of the incoming load which distributed based on different Geographically Load Balancing (GLB) policies. As a large yet flexible power consumer, the local DC has a great impact on the local power grid. From this point of view, a local DC is a good candidate to participate in the emerging power market such as Regulation Service (RS) opportunity, that brings monetary benefits both for the DC as well as the grid. However, a fruitful collaboration requires the DC to... 

    Cost differential for deciding about installing information sharing technology in a two-echelon inventory system

    , Article IIE Annual Conference and Expo 2007 - Industrial Engineering's Critical Role in a Flat World, Nashville, TN, 19 May 2007 through 23 May 2007 ; 2007 , Pages 1139-1144 Haji, R ; Sajadifar, M ; Sharif University of Technology
    2007
    Abstract
    We consider a dyadic supply chain. Retailer applies (R,Q)-policy. Supplier starts with m initial batches of size Q and places an order of the same size to an outside source. The supplier can select one of the two following cases. Case 1, whenever the retailer places an order, the supplier will also place an order. Case 2, whenever the retailer's inventory position reaches R+s, the supplier will place an order. This paper derives the cost differential between these cases for any value of s, which enables the supply chain managers to decide whether to install an information sharing technology