Loading...
Search for: algorithm-efficiency
0.006 seconds

    Efficient Algorithm for Network Motifs Discovery

    , M.Sc. Thesis Sharif University of Technology Hazrati, Sattar (Author) ; Izadi, Mohammad (Supervisor)
    Abstract
    Network Motifs are subgraphs that appear more frequently in real networks than randomize networks. Frequent replication of a subgraph could imply evolution, network performance or some other particular reasons. From algorithmic perspective, network motif discovery in a graph is a difficult problem. Since, at least it includes the whole graph isomorphism. Hence, for solving this problem in practice, we need computable graphs. The existing algorithms so far, have high running times and memory usages. In this thesis, we present a new algorithm called CGQ. Within this algorithm, we use both QuateXelero and G-Trie algorithms which respectively have better performance in census of real networks... 

    On pancyclicity properties of OTIS networks

    , Article 3rd International Conference on High Performance Computing and Communications, HPCC 2007, Houston, TX, 26 September 2007 through 28 September 2007 ; Volume 4782 LNCS , 2007 , Pages 545-553 ; 03029743 (ISSN); 9783540754435 (ISBN) Hoseinyfarahabady, M. R ; Sarbazi Azad, H ; Sharif University of Technology
    Springer Verlag  2007
    Abstract
    The OTIS-Network (also referred to as two-level swapped network) is composed of n clones of an n-node original network constituting its clusters. It has received much attention due to its many favorable properties such as high degree of scalability, regularity, modularity, package-ability and high degree of algorithmic efficiency. In this paper, using the construction method, we show that the OTIS-Network is Pancyclic if its basic network is Hamiltonian- connected. The study of cycle embeddings with different sizes arises naturally in the implementation of a number of either computational or graph problems such as those used for finding storage schemes for logical data structures, layout of... 

    Efficient method for simplifying and approximating the S-boxes based on power functions

    , Article IET Information Security ; Volume 3, Issue 3 , 2009 , Pages 114-118 ; 17518709 (ISSN) Farhadian, A ; Aref, M. R ; Sharif University of Technology
    2009
    Abstract
    In recently proposed cipher algorithms, power functions over finite fields and specially inversion functions play an important role in the S-box design structure. In this study, a new systematic efficient method is introduced to cryptanalyse (to simplify and approximate) such S-boxes. This method is very simple and does not need any heuristic attempt and can be considered as a quick criterion to find some simple approximations. Using this new method, some approximations can be obtained for advanced encryption standard (AES) like S-boxes, such as AES, Camellia, Shark and so on. Finally as an application of this method, a simple linear approximation for AES S-box is presented. © The... 

    Blade shape optimization of marine propeller via genetic algorithm for efficiency improvement

    , Article Proceedings of the ASME Turbo Expo ; Volume 5 , 2012 , Pages 235-242 ; 9780791844717 (ISBN) Taheri, R ; Mazaheri, K ; Sharif University of Technology
    2012
    Abstract
    In this paper, a numerical optimization method has been carried out to optimize the shape and efficiency of a propeller. For analysis of the hydrodynamic performance parameters, an extended vortex lattice method was used by implementing an open-source code which is called OpenProp. The method of optimization is a non-gradient based algorithm. After a trade-off between a few gradient-based and non-gradient based algorithms, it is found that the problem of being trapped in local optimum solutions can be easily solved by choosing nongradient based ones. Hence, modified Genetic algorithm is used to implement the so-called hydrodynamic performance analyzer code. The objective function is to... 

    Developing cross drag expressions for nanotube bundles using molecular dynamics

    , Article ASME 2011 9th International Conference on Nanochannels, Microchannels, and Minichannels, ICNMM 2011, 19 June 2011 through 22 June 2011 ; Volume 2 , June , 2011 , Pages 259-263 ; 9780791844649 (ISBN) Darbandi, M ; Khaledi Alidusti, R ; Abbaspour, M ; Abbasi, H. R ; Sabouri, M ; Schneider, G. E ; Sharif University of Technology
    2011
    Abstract
    The nonequilibrium molecular dynamics (NEMD) simulations are performed to calculation the cross drag over a nanotube located in a uniform liquid argon flow. As is known, the behavior of fluid flows in nano-scale sizes is very different from that in microscopic and macroscopic sizes. In this work, our concern is on the flow of argon molecules over a nanotube which occurs in nanoscale sizes. We calculate the cross drag enforced the nanotube at Re<10. In this regard, we use the molecular dynamics and simulate the flow of argon molecules over (6,0), (8,0) and (10,0) nanotubes. The simulations are performed at different velocities and the cross drag coefficient is computed at different Reynolds... 

    Efficient secure channel coding scheme based on low-density Lattice codes

    , Article IET Communications ; Volume 10, Issue 11 , 2016 , Pages 1365-1373 ; 17518628 (ISSN) Hooshmand, R ; Aref, M. R ; Sharif University of Technology
    Institution of Engineering and Technology  2016
    Abstract
    In this study, the authors introduce an efficient secure channel coding (joint cryptography-channel coding) scheme based on Latin square low-density lattice codes (Latin square LDLCs) over unconstrained power additive white Gaussian noise channel. They benefit the properties of Latin square LDLCs to dramatically reduce the key size of the proposed scheme while having an acceptable level of security compared with previous similar schemes. To reduce the key size, they consider two approaches: (i) saving the generating sequence of parity-check matrix of used Latin square LDLC as the part of secret key set; (ii) employing the Hermite normal form of the generator matrix of used Latin square LDLC... 

    Visiting a polygon on the optimal way to a query point

    , Article 2nd International Frontiers in Algorithmics Workshop, FAW 2008, Changsha, 19 June 2008 through 21 June 2008 ; Volume 5059 LNCS , 2008 , Pages 245-251 ; 03029743 (ISSN); 3540693106 (ISBN); 9783540693109 (ISBN) Khosravi, R ; Ghodsi, M ; Sharif University of Technology
    2008
    Abstract
    We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm for this problem based on the wavefront propagation method and also present a method to construct a subdivision of the domain to efficiently answer queries to retrieve the constrained shortest paths from a single-source to the query point. © 2008 Springer-Verlag Berlin Heidelberg  

    Identification of b-quark jets with the CMS experiment

    , Article Journal of Instrumentation ; Volume 8, Issue 4 , April , 2013 ; 17480221 (ISSN) Chatrchyan, S ; Khachatryan, V ; Sirunyan, A. M ; Tumasyan, A ; Adam, W ; Aguilo, E ; Bergauer, T ; Dragicevic, M ; Erö, J ; Fabjan, C ; Friedl, M ; Frühwirth, R ; Ghete, V. M ; Hammer, J ; Hörmann, N ; Hrubec, J ; Jeitler, M ; Kiesenhofer, W ; Knünz, V ; Krammer, M ; Krätschmer, I ; Liko, D ; Mikulec, I ; Pernicka, M ; Rahbaran, B ; Rohringer, C ; Rohringer, H ; Schöfbeck, R ; Strauss, J ; Taurok, A ; Waltenberger, W ; Walzel, G ; Widl, E ; Wulz, C. E ; Mossolov, V ; Shumeiko, N ; Suarez Gonzalez, J ; Bansal, M ; Bansal, S ; Cornelis, T ; De Wolf, E. A ; Janssen, X ; Luyckx, S ; Mucibello, L ; Ochesanu, S ; Roland, B ; Rougny, R ; Selvaggi, M ; Staykova, Z ; Van Haevermaet, H ; Van Mechelen, P ; Van Remortel, N ; Van Spilbeeck, A ; Blekman, F ; Blyweert, S ; D'Hondt, J ; Gonzalez Suarez, R ; Kalogeropoulos, A ; Maes, M ; Olbrechts, A ; Van Doninck, W ; Van Mulders, P ; Van Onsem, G. P ; Villella, I ; Clerbaux, B ; De Lentdecker, G ; Dero, V ; Gay, A. P. R ; Hreus, T ; Léonard, A ; Marage, P. E ; Mohammadi, A ; Reis, T ; Thomas, L ; Vander Marcken, G ; Vander Velde, C ; Vanlaer, P ; Wang, J ; Adler, V ; Beernaert, K ; Cimmino, A ; Costantini, S ; Garcia, G ; Grunewald, M ; Klein, B ; Lellouch, J ; Marinov, A ; McCartin, J ; Ocampo Rios, A. A ; Ryckbosch, D ; Strobbe, N ; Thyssen, F ; Tytgat, M ; Verwilligen, P ; Walsh, S ; Yazgan, E ; Zaganidis, N ; Basegmez, S ; Bruno, G ; Castello, R ; Ceard, L ; Delaere, C ; Du Pree, T ; Favart, D ; Forthomme, L ; Giammanco, A ; Hollar, J ; Lemaitre, V ; Liao, J ; Militaru, O ; Nuttens, C ; Pagano, D ; Pin, A ; Piotrzkowski, K ; Schul, N ; Vizan Garcia, J. M ; Beliy, N ; Caebergs, T ; Daubie, E ; Hammad, G. H ; Alves, G. A ; Correa Martins, M. Jr ; De Jesus Damiao, D ; Martins, T ; Pol, M. E ; Souza, M. H. G ; Aldá, W. L., Jr ; Carvalho, W ; Custódio, A ; Da Costa, E. M ; De Oliveira Martins, C ; Fonseca De Souza, S ; Matos Figueiredo, D ; Mundim, L ; Nogima, H ; Oguri, V ; Prado Da Silva, W. L ; Santoro, A ; Soares Jorge, L ; Sznajder, A ; Anjos, T. S ; Bernardes, C. A ; Dias, F. A ; Fernandez Perez Tomei, T. R ; Gregores, E. M ; Lagana, C ; Marinho, F ; Mercadante, P. G ; Novaes, S. F ; Padula, S. S ; Genchev, V ; Iaydjiev, P ; Piperov, S ; Rodozov, M ; Stoykova, S ; Sultanov, G ; Tcholakov, V ; Trayanov, R ; Vutova, M ; Dimitrov, A ; Hadjiiska, R ; Kozhuharov, V ; Litov, L ; Pavlov, B ; Petkov, P ; Bian, J. G ; Chen, G. M ; Chen, H. S ; Jiang, C. H ; Liang, D ; Liang, S ; Meng, X ; Tao, J ; Wang, J ; Wang, X ; Wang, Z ; Xiao, H ; Xu, M ; Zang, J ; Zhang, Z ; Asawatangtrakuldee, C ; Ban, Y ; Guo, S ; Guo, Y ; Li, W ; Liu, S ; Mao, Y ; Qian, S. J ; Teng, H ; Wang, D ; Zhang, L ; Zhu, B ; Zou, W ; Avila, C ; Gomez, J. P ; Gomez Moreno, B ; Osorio Oliveros, A. F ; Sanabria, J. C ; Godinovic, N ; Lelas, D ; Plestina, R ; Polic, D ; Puljak, I ; Antunovic, Z ; Kovac, M ; Brigljevic, V ; Duric, S ; Kadija, K ; Luetic, J ; Morovic, S ; Attikis, A ; Galanti, M ; Mavromanolakis, G ; Mousa, J ; Nicolaou, C ; Ptochos, F ; Razis, P. A ; Finger, M ; Finger, M., Jr ; Assran, Y ; Elgammal, S ; Ellithi Kamel, A ; Mahmoud, M. A ; Radi, A ; Kadastik, M ; Müntel, M ; Raidal, M ; Rebane, L ; Tiko, A ; Eerola, P ; Fedi, G ; Voutilainen, M ; Härkönen, J ; Heikkinen, A ; Karimäki, V ; Kinnunen, R ; Kortelainen, M. J ; Lampén, T ; Lassila-Perini, K ; Lehti, S ; Lindén, T ; Luukka, P ; Mäenpää, T ; Peltola, T ; Tuominen, E ; Tuominiemi, J ; Tuovinen, E ; Ungaro, D ; Wendland, L ; Banzuzi, K ; Karjalainen, A ; Korpela, A ; Tuuva, T ; Besancon, M ; Choudhury, S ; Dejardin, M ; Denegri, D ; Fabbro, B ; Faure, J. L ; Ferri, F ; Ganjour, S ; Givernaud, A ; Gras, P ; Hamel De Monchenault, G ; Jarry, P ; Locci, E ; Malcles, J ; Millischer, L ; Nayak, A ; Rander, J ; Rosowsky, A ; Shreyber, I ; Titov, M ; Baffioni, S ; Beaudette, F ; Benhabib, L ; Bianchini, L ; Bluj, M ; Broutin, C ; Busson, P ; Charlot, C ; Daci, N ; Dahms, T ; Dobrzynski, L ; Granier De Cassagnac, R ; Haguenauer, M ; Miné, P ; Mironov, C ; Naranjo, I. N ; Nguyen, M ; Ochando, C ; Paganini, P ; Sabes, D ; Salerno, R ; Sirois, Y ; Veelken, C ; Zabi, A ; Agram, J. L ; Andrea, J ; Bloch, D ; Bodin, D ; Brom, J. M ; Cardaci, M ; Chabert, E. C ; Collard, C ; Conte, E ; Drouhin, F ; Ferro, C ; Fontaine, J. C ; Gelé, D ; Goerlach, U ; Juillot, P ; Le Bihan, A. C ; Van Hove, P ; Fassi, F ; Mercier, D ; Beauceron, S ; Beaupere, N ; Bondu, O ; Boudoul, G ; Chasserat, J ; Chierici, R ; Contardo, D ; Depasse, P ; El Mamouni, H ; Fay, J ; Gascon, S ; Gouzevitch, M ; Ille, B ; Kurca, T ; Lethuillier, M ; Mirabito, L ; Perries, S ; Sordini, V ; Tschudi, Y ; Verdier, P ; Viret, S ; Tsamalaidze, Z ; Anagnostou, G ; Beranek, S ; Edelhoff, M ; Feld, L ; Heracleous, N ; Hindrichs, O ; Jussen, R ; Klein, K ; Merz, J ; Ostapchuk, A ; Perieanu, A ; Raupach, F ; Sammet, J ; Schael, S ; Sprenger, D ; Weber, H ; Wittmer, B ; Zhukov, V ; Ata, M ; Caudron, J ; Dietz-Laursonn, E ; Duchardt, D ; Erdmann, M ; Fischer, R ; Güth, A ; Hebbeker, T ; Heidemann, C ; Hoepfner, K ; Klingebiel, D ; Kreuzer, P ; Magass, C ; Merschmeyer, M ; Meyer, A ; Olschewski, M ; Papacz, P ; Pieta, H ; Reithler, H ; Schmitz, S. A ; Sonnenschein, L ; Steggemann, J ; Teyssier, D ; Weber, M ; Bontenackels, M ; Cherepanov, V ; Erdogan, Y ; Flügge, G ; Geenen, H ; Geisler, M ; Haj Ahmad, W ; Hoehle, F ; Kargoll, B ; Kress, T ; Kuessel, Y ; Nowack, A ; Perchalla, L ; Pooth, O ; Sauerland, P ; Stahl, A ; Aldaya Martin, M ; Behr, J ; Behrenhoff, W ; Behrens, U ; Sharif University of Technology
    Institute of Physics Publishing  2013
    Abstract
    At the Large Hadron Collider, the identification of jets originating from b quarks is important for searches for new physics and for measurements of standard model processes. A variety of algorithms has been developed by CMS to select b-quark jets based on variables such as the impact parameters of charged-particle tracks, the properties of reconstructed decay vertices, and the presence or absence of a lepton, or combinations thereof. The performance of these algorithms has been measured using data from proton-proton collisions at the LHC and compared with expectations based on simulation. The data used in this study were recorded in 2011 at s = 7 TeV for a total integrated luminosity of 5.0... 

    A novel approach for secure and fast generation of RSA public and private keys on SmartCard

    , Article Proceedings of the 8th IEEE International NEWCAS Conference, NEWCAS2010, 20 June 2010 through 23 June 2010 ; June , 2010 , Pages 265-268 ; 9781424468058 (ISBN) Bahadori, M ; Mali, M. R ; Sarbishei, O ; Atarodi, M ; Sharifkhani, M ; IEEE CAS Society ; Sharif University of Technology
    2010
    Abstract
    RSA based SmartCards have been widely used in security services such as secure data transmission in many applications over the past few years. Generation of a secure key pair which is based on finding a pair of large prime numbers is an indispensable part of creating a secure channel. This paper describes a novel approach for secure and fast key generation of the public key cryptographic algorithm of RSA. This method has been implemented on a typical SmartCard equipped with a crypto-coprocessor and a true random number generator. An efficient method for generating the large random prime numbers is proposed that considerably reduces the total time required for generating a key pair. The key... 

    Optimal placement of phasor measurement units using immunity genetic algorithm

    , Article IEEE Transactions on Power Delivery ; Volume 24, Issue 3 , 2009 , Pages 1014-1020 ; 08858977 (ISSN) Aminifar, F ; Lucas, C ; Khodaei, A ; Fotuhi Firuzabad, M ; Sharif University of Technology
    2009
    Abstract
    This paper investigates the application of immunity genetic algorithm (IGA) for the problem of optimal placement of phasor measurement units (PMUs) in an electric power network. The problem is to determine the placement sites of the minimal set of PMUs which makes the system observable. Incorporating immune operator in the canonical genetic algorithm (GA), on the condition of preserving GA's advantages, utilizes some characteristics and knowledge of the problems for restraining the degenerative phenomena during evolution, so as to improve the algorithm efficiency. This type of prior knowledge about some parts of optimal solution exists in the PMU placement problem. So, the IGA is adopted in... 

    Error control for multimedia communications in wireless sensor networks: A comparative performance analysis

    , Article Ad Hoc Networks ; Volume 10, Issue 6 , 2012 , Pages 1028-1042 ; 15708705 (ISSN) Naderi, M. Y ; Rabiee, H. R ; Khansari, M ; Salehi, M ; Sharif University of Technology
    Abstract
    The emerging multimedia applications of Wireless Sensor Network (WSNs) impose new challenges in design of algorithms and communication protocols for such networks. In the view of these challenges, error control is an important mechanism that enables us to provide robust multimedia communication and maintain Quality of Service (QoS). Despite the existence of some good research works on error control analysis in WSNs, none of them provides a thorough study of error control schemes for multimedia delivery. In this paper, a comprehensive performance evaluation of Automatic Repeat Request (ARQ), Forward Error Correction (FEC), Erasure Coding (EC), link-layer hybrid FEC/ARQ, and cross-layer hybrid... 

    Simulation and optimization of pulsating heat pipe flat-plate solar collectors using neural networks and genetic algorithm: a semi-experimental investigation

    , Article Clean Technologies and Environmental Policy ; Volume 18, Issue 7 , 2016 , Pages 2251-2264 ; 1618954X (ISSN) Jalilian, M ; Kargarsharifabad, H ; Abbasi Godarzi, A ; Ghofrani, A ; Shafii, M. B ; Sharif University of Technology
    Springer Verlag  2016
    Abstract
    This research study presents an investigation on the behavior of a Pulsating Heat Pipe Flat-Plate Solar Collector (PHPFPSC) by artificial neural network method and an optimization of the parameters of the collector by genetic algorithm. In this study, several experiments were performed to study the effects of various evaporator lengths, filling ratios, inclination angles, solar radiation, and input chilled water temperature between 9:00 A.M. to 5:00 P.M., and the output temperature of the water tank, which was the output of the system, was also measured. According to the input and output information, multilayer perceptron neural network was trained and used to predict the behavior of the...