Search for: computer-science
0.007 seconds
Total 125 records

    Features of Cu and TiO2 in the flow of engine oil subject to thermal jump conditions

    , Article Scientific Reports ; Volume 11, Issue 1 , 2021 ; 20452322 (ISSN) Ahmad, S ; Ali, K ; Nisar, K.S ; Faridi, A. A ; Khan, N ; Jamshed, W ; Khan, T. M. Y ; Saleel, C. A ; Sharif University of Technology
    Nature Research  2021
    The recent work investigates the heat transfer attributes in the flow of engine oil which comprises of nano-particles such as Cu and TiO2. The performance of Copper and Titanium oxide is over looked in the flow of engine oil. The energy equation is amended by the features of thermal radiation, viscous dissipation, and heat generation. The mathematical model signifies the porosity, entropy generation and moving flat horizontal surface with the non-uniform stretching velocity. Quasi-linearization, which is a persuasive numerical technique to solve the complex coupled differential equations, is used to acquire the numerical solution of the problem. Flow and heat transfer aspects of Cu–TiO2 in... 

    Special issue on network-based high performance computing

    , Article Journal of Supercomputing ; 2010 , p. 1-4 ; ISSN: 09208542 Sarbazi-Azad, H ; Shahrabi, A ; Beigy, H ; Sharif University of Technology
    [No abstract available]  

    afpCOOL: a tool for antifreeze protein prediction

    , Article Heliyon ; Volume 4, Issue 7 , 2018 ; 24058440 (ISSN) Eslami, M ; Shirali Hossein Zade, R ; Takalloo, Z ; Mahdevar, G ; Emamjomeh, A ; Sajedi, R. H ; Zahiri, J ; Sharif University of Technology
    Elsevier Ltd  2018
    Various cold-adapted organisms produce antifreeze proteins (AFPs), which prevent the freezing of cell fluids by inhibiting the growth of ice crystals. AFPs are currently being recognized in various organisms, living in extremely low temperatures. AFPs have several important applications in increasing freeze tolerance of plants, maintaining the tissue in frozen conditions and producing cold-hardy plants by applying transgenic technology. Substantial differences in the sequence and structure of the AFPs, pose a challenge for researchers to identify these proteins. In this paper, we proposed a novel method to identify AFPs, using supportive vector machine (SVM) by incorporating 4 types of... 

    Performance evaluation of communication networks for parallel and distributed systems

    , Article Parallel Computing ; Volume 32, Issue 11-12 , 2006 , Pages 775-776 ; 01678191 (ISSN) Sarbazi Azad, H ; Ould Khaoua, M ; Zomaya, A. Y ; Sharif University of Technology

    Fault-tolerant routing in the star graph

    , Article Proceedings - 18th International Conference on Advanced Information Networking and Applications, AINA 2004, Fukuoka, 29 March 2004 through 31 March 2004 ; Volume 2 , 2004 , Pages 503-506 ; 0769520510 (ISBN); 9780769520513 (ISBN) Rezazad, S. M ; Sarbazi Azad, H ; Sharif University of Technology
    This paper presents a fault tolerant routing algorithm for the star graph. The algorithm is based on the concept of unsafely vectors originally proposed for binary n-cubes. Each node starts by computing a first level unsafety set,composed of the set of unreachable neighbours.It then performs some exchanges with its neighbours to determine the unsafety nodes.After that all of the nodes have the addresses of all faulty nodes. Based on the information gathered in each nodefault-tolearnt routing between a source node and a destination node is raelised  

    Using Complex Network Metrics for Evaluating the Influence of Conference and Journal Papers in Computer Science

    , M.Sc. Thesis Sharif University of Technology Habibi, Fatemeh (Author) ; Jalili, Mahdi (Supervisor)
    Journals and conferences in computer science are the major venue for publishing new achievement in the field. It is an expert opinion that a number of top conferences in computer science are even more important than journals. In this work we aim at studying this in terms of citation analysis. To this end, we took 100 top journals and 63 top conferences and extracted their citation graph through Scopus dataset. We then constructed the citation graph in which the nodes were the journals and conferences and the links corresponded to the citations of the papers. We used various measures to rank the nodes in the graph. The ranking methods included Prestige, PageRank, Eigenfactor, HITS and SALSA.... 

    Erratum to A linear genetic programming approach for the prediction of solar global radiation

    , Article Neural Computing and Applications ; Volume 23, Issue 3-4 , 2013 , Pages 1205- ; 09410643 (ISSN) Shavandi, H ; Saeidi Ramiyani, S ; Sharif University of Technology

    On hypercontractivity and the mutual information between Boolean functions

    , Article 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, Monticello, IL ; Oct , 2013 , Pages 13-19 ; 9781479934096 (ISBN) Anantharam, V ; Gohari, A. A ; Kamath, S ; Nair, C ; Sharif University of Technology
    IEEE Computer Society  2013
    Hypercontractivity has had many successful applications in mathematics, physics, and theoretical computer science. In this work we use recently established properties of the hypercontractivity ribbon of a pair of random variables to study a recent conjecture regarding the mutual information between binary functions of the individual marginal sequences of a sequence of pairs of random variables drawn from a doubly symmetric binary source  

    Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs

    , Article Theoretical Computer Science ; Volume 463 , 2012 , Pages 26-34 ; 03043975 (ISSN) Safari, M ; Sharif University of Technology
    We introduce hyper-D-width and hyper-T-width as the first stable (see Definition 3) measures of connectivity for hypergraphs. After studying some of their properties and, in particular, proposing an algorithm for computing nearly optimal hyper-T-decomposition when hyper-T-width is constant, we introduce some applications of hyper-D-width and hyper-T-width in solving hard problems such as minimum vertex cover, minimum dominating set, and multicut  

    Effect of organoclay modified binders on fatigue performance

    , Article RILEM Bookseries ; Volume 4 , 2012 , Pages 869-878 ; 22110844 (ISSN) ; 9789400745650 (ISBN) Tabatabaee, N ; Shafiee, M. H ; Scarpas, A ; Kringos, N ; Al Qadi, I. L ; Loizos, A ; Sharif University of Technology
    Organoclay modification is receiving attention as a nano-modifier for asphalt binders. Nanoparticles are able to effectively mend the damaged sites of the nanocomposite without external intervention. Particle-polymer interaction results in packing particles into developed cracks, thereby mending the cracks during patch formation. This study investigates the rheological properties of organoclay modified binders with a focus on their fatigue properties. To this end, the dissipated energy concept, the ratio of dissipated energy change and plateau value (PV) energy were examined during fatigue tests using a dynamic shear rheometer. The effects of strain level, frequency and temperature on unaged... 

    A survey of syntax and semantics frameworks of modeling languages

    , Article Proceedings of the 2009 2nd International Conference on Computer Science and Its Applications, CSA 2009 ; 2009 ; 9781424449460 (ISBN) Kamandi, A ; Habibi, J ; Sharif University of Technology
    Modeling languages as programming languages need precise and unambiguous semantics to be used appropriately, the formal semantics is significant for designing CASE tools and model verification. Several approaches have been used throughout these years to describe the semantics of modeling languages, but in spite of programming languages, these semantics frameworks are not used in large scale for modeling languages. This paper reviews the history of developments on semantics frameworks for modeling languages. © 2009 IEEE  

    Parasite cloud service providers: on-demand prices on top of spot prices

    , Article Heliyon ; Volume 5, Issue 11 , 2019 ; 24058440 (ISSN) Haghshenas, H ; Habibi, J ; Fazli, M. A ; Sharif University of Technology
    Elsevier Ltd  2019
    On-demand resource provisioning and elasticity are two of the main characteristics of the cloud computing paradigm. As a result, the load on a cloud service provider (CSP) is not fixed and almost always a number of its physical resources are not used, called spare resources. As the CSPs typically don't want to be overprovisioned at any time, they procure physical resources in accordance to a pessimistic forecast of their loads and this leads to a large amount of spare resources most of the time. Some CSPs rent their spare resources with a lower price called the spot price, which varies over time with respect to the market or the internal state of the CSP. In this paper, we assume the spot... 

    Event detection from news articles

    , Article 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 981-984 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) Sayyadi, H ; Sahraei, A ; Abolhassani, H ; Sharif University of Technology
    In this paper, we propose a new method for automatic news event detection. An event is a specific happening in a particular time and place. We propose a new model in this paper to detect news events using a label based clustering approach. The model takes advantage of the fact that news events are news clusters with high internal similarity whose articles are about an event in a specific time and place. Since news articles about a particular event may appear in several consecutive days, we developed this model to be able to distinguish such events and merge the corresponding news articles. Although event detection is propounded as a stand alone news mining task, it has also applications in... 

    Efficient parallel routing algorithms for cartesian and composition networks

    , Article 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 299-307 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) Bakhshi, M ; Bakhshi, S ; Sarbazi Azad, H ; Sharif University of Technology
    The Cartesian and Composition products are two well known graph products, also applied to interconnection networks area. The Cartesian and Composition network products possess great characteristics of fault resilience according to their high connectivity. In this paper, we study the existence and construction of parallel routing paths in these two well-known product networks. To prove the existence of certain number of parallel paths in these product networks, we need to compute their connectivity. By assuming the availability of certain number of faulty nodes, we propose some new shortest-path parallel routing algorithms. These algorithms can be used both in faulty networks and to route... 

    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
    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  

    Advances in heuristic signal processing and applications

    , Book ; Chatterjee, Amitava ; Nobahari, Hadi ; Siarry, Patrick
    Springer  2013
    There have been significant developments in the design and application of algorithms for both one-dimensional signal processing and multidimensional signal processing, namely image and video processing, with the recent focus changing from a step-by-step procedure of designing the algorithm first and following up with in-depth analysis and performance improvement to instead applying heuristic-based methods to solve signal-processing problems. In this book the contributing authors demonstrate both general-purpose algorithms and those aimed at solving specialized application problems, with a special emphasis on heuristic iterative optimization methods employing modern evolutionary and swarm... 

    Approximation behavior of Van der Pol equation: Large and small nonlinearity parameter

    , Article IMECS 2011 - International MultiConference of Engineers and Computer Scientists 2011, 16 March 2011 through 18 March 2011 ; Volume 2 , March , 2011 , Pages 1539-1544 ; 9789881925121 (ISBN) Azarkhalili, B ; Moghadas, P ; Rasouli, M ; Sharif University of Technology
    The labels mathematician, engineer, and physicist have all been used in reference to Balthazar van der Pol. The van der Pol oscillator, which we study in this paper, is a model developed by him to describe the behavior of nonlinear vacuum tube circuits in the relatively early days of the development of electronics technology. Our study in this paper will be based entirely on numerical solutions. The rigorous foundations for the analysis (e.g., the proof that the equation has a limit cycle solution which is a global attractor) date back to the work of Lienard in 1928, with later more general analysis by Levinson and others  

    White space regions

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 22 January 2011 through 28 January 2011, Novy Smokovec ; Volume 6543 LNCS , 2011 , Pages 226-237 ; 03029743 (ISSN) ; 9783642183805 (ISBN) Ehsani, S ; Fazli, M ; Ghodsi, M ; Safari, M ; Saghafian, M ; Tavakkoli, M ; Sharif University of Technology
    We study a classical problem in communication and wireless networks called Finding White Space Regions. In this problem, we are given a set of antennas (points) some of which are noisy (black) and the rest are working fine (white). The goal is to find a set of convex hulls with maximum total area that cover all white points and exclude all black points. In other words, these convex hulls make it safe for white antennas to communicate with each other without any interference with black antennas. We study the problem on three different settings (based on overlapping between different convex hulls) and find hardness results and good approximation algorithms  

    Web page classification using social tags

    , Article 2009 IEEE International Conference on Social Computing, 29 August 2009 through 31 August 2009 ; Volume 4 , 2009 , Pages 588-593 ; 9780769538235 (ISBN) Aliakbary, S ; Abolhassani, H ; Rahmani, H ; Nobakht, B ; Sharif University of Technology
    Social tagging is a process in which many users add metadata to a shared content. Through the past few years, the popularity of social tagging has grown on the web. In this paper we investigated the use of social tags for web page classification: adding new web pages to an existing web directory. A web directory is a general human-edited directory of web pages. It classifies a collection of pages into a wide range of hierarchical categories. The problem with manual construction and maintenance of web directories is the significant need of time and effort by human experts. Our proposed method is based on applying different automatic approaches of using social tags for extending web... 

    Using minimum matching for clustering with balancing constraints

    , Article 2009 Second ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM 2009, Sanya, 8 August 2009 through 9 August 2009 ; Volume 1 , 2009 , Pages 225-228 ; 9781424442461 (ISBN) Shirali Shahreza, S ; Abolhassani, H ; Shirali Shahreza, M. H ; Yangzhou University; Guangdong University of Business Studies; Wuhan Institute of Technology; IEEE SMC TC on Education Technology and Training; IEEE Technology Management Council ; Sharif University of Technology
    Clustering is a major task in data mining which is used in many applications. However, general clustering is inappropriate for many applications where some constraints should be applied. One category of these constraints is the cluster size constraint. In this paper, we propose a new algorithm for solving the clustering with balancing constraints by using the minimum matching. We compare our algorithm with the method proposed by Banerjee and Ghosh that uses stable matching and show that our algorithm converge to the final solution in fewer iterations. ©2009 IEEE