Loading...
Search for: world-wide-web
0.007 seconds
Total 48 records

    Web page clustering using harmony search optimization

    , Article IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2008, Niagara Falls, ON, 4 May 2008 through 7 May 2008 ; 2008 , Pages 1601-1604 ; 08407789 (ISSN) ; 9781424416431 (ISBN) Forsati, R ; Mahdavi, M ; Kangavari, M ; Safarkhani, B ; Sharif University of Technology
    2008
    Abstract
    Clustering has become an increasingly important task in modern application domains. Targeting useful and relevant information on the World Wide Web is a topical and highly complicated research area. Clustering techniques have been applied to categorize documents on web and extracting knowledge from the web. In this paper we propose novel clustering algorithms based on Harmony Search (HS) optimization method that deals with web document clustering. By modeling clustering as an optimization problem, first, we propose a pure HS based clustering algorithm that finds near global optimal clusters within a reasonable time. Then we hybridize K-means and harmony clustering to achieve better... 

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

    Web driven alert verification

    , Article 2014 11th International ISC Conference on Information Security and Cryptology, ISCISC 2014 ; Sep , 2014 , p. 180-185 Najafi, A ; Sepahi, A ; Jalili, R ; Sharif University of Technology
    Abstract
    A web attack is an attack against a web server through the HTTP Protocol. By analyzing known web attacks, we find out that each one has its own behavior. Vestiges of their behavior could be detected in non-body parts of the HTTP Protocol. Such information can be used to verify web alerts generated by Web Application Firewalls (WAFs) and Web Intrusion Detection Systems (Web IDSs). In this paper, we propose a method to verify web alerts generated by mentioned sensors. The goal of the alert verification component is to eliminate or tag alerts that do not represent successful attacks. Our approach is based on analyzing HTTP Transaction metadata, including Request method, Request Headers, Status... 

    Utilizing mixed methods research in analyzing Iranian researchers' informarion search behaviour in the web and presenting the current pattern

    , Article Iranian Journal of Information Processing Management ; Volume 31, Issue 1 , 2015 , Pages 27-57 ; 22518223 (ISSN) Asadi, M ; Hariri, N ; Sharif University of Technology
    Iranian Research Institute for Scientific Information and Documentation  2015
    Abstract
    Using mixed method research the current study has analyzed Iranian researchers' information searching behavior on the Web. Based on extracted concepts, the model of their information searching behavior was revealed. Forty-four participants, including academic staff from universities and research centers were recruited for this study selected by purposive sampling. Data were gathered from questionnaires including ten questions and semi-structured interview. Each participant's memos were analyzed using grounded theory methods adapted from Strauss & Corbin (1998). Results showed that the main objectives of subjects were doing a research, writing a paper, studying, doing assignments, downloading... 

    Using social annotations for search results clustering

    , 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 976-980 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) Aliakbary, S ; Khayyamian, M ; Abolhassani, H ; Sharif University of Technology
    2008
    Abstract
    Clustering search results helps the user to overview returned results and to focus on the desired clusters. Most of search result clustering methods use title, URL and snippets returned by a search engine as the source of information for creating the clusters. In this paper we propose a new method for search results clustering (SRC) which uses social annotations as the main source of information about web pages. Social annotations are high-level descriptions for web pages and as the experiments show, clustering based on social annotations yields good clusters with informative labels. © 2008 Springer-Verlag  

    Trust inference in web-based social networks using resistive networks

    , Article Proceedings- 3rd International Conference on Internet and Web Applications and Services, ICIW 2008, Athens, 8 June 2008 through 13 June 2008 ; 2008 , Pages 233-238 ; 9780769531632 (ISBN) Taherian, M ; Amini, M ; Jalili, R ; Sharif University of Technology
    2008
    Abstract
    By the immense growth of the Web-Based Social Networks (WBSNs), the role of trust in connecting people together through WBSNs is getting more important than ever. In other words, since the probability of malicious behavior in WBSNs is increasing, it is necessary to evaluate the reliability of a person before trying to communicate with. Hence, it is desirable to find out how much a person should trust another one in a network. The approach to answer this question is usually called trust inference. In this paper, we propose a new trust inference algorithm (Called RN-Trust) based on the resistive networks concept. The algorithm, in addition to being simple, resolves some problems of previously... 

    Towards a goal-driven method for web service choreography validation

    , Article 2016 2nd International Conference on Web Research, ICWR 2016, 27 April 2016 through 28 April 2016 ; 2016 , Pages 66-71 ; 9781509021666 (ISBN) Parsa, S ; Ebrahimifard, A ; Amiri, M. J ; Khoramabadi Arani, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2016
    Abstract
    Nowadays web services composition that presents capabilities in response to customers' complex requirements has a special importance in real businesses. However, service choreography as a form of service composition, still faces many challenges. One of the most important challenges of the choreography domain is how to validate the model based on the corresponding requirements. To this end, in this paper processes choreographies are modeled using the interaction view of BPMN 2.0 standard. Then, goal modeling is suggested to extract the requirements. For each requirement all possible valid scenarios are considered and finally using Savara tool, the requirements' scenarios are modeled and the... 

    Semantic composability measure for semantic web services

    , Article 1st Asia International Conference on Modelling and Simulation - Asia Modelling Symposium 2007, AMS 2007, 27 March 2007 through 30 March 2007 ; 2007 , Pages 88-93 ; 0769528457 (ISBN); 9780769528458 (ISBN) Paikari, E ; Habibi, J ; Yeganeh, S. H ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2007
    Abstract
    Motivated by the problem of automatically composing network accessible services, such as those on the World Wide Web, this paper proposes an approach to exploit all semantic information available for semantic web services to complete this task. For semantic web services, we propose a prioritized and limited list of other web services, with composability measure value based on feasibility of being succeeding service in a composition to fulfill the request. Due to the fact that in semantic web services, semantic information- all description and signatures- is defined by ontology language, we use some of the mapping rules to estimate a correlation between services for composability. Then we... 

    ROSE: Role-based Signed Network Embedding

    , Article 29th International World Wide Web Conference, WWW 2020, 20 April 2020 through 24 April 2020 ; 2020 , Pages 2782-2788 Javari, A ; Derr, T ; Esmailian, P ; Tang, J ; Kevin Chen-C. C ; Chunghwa Telecom; et al.; Microsoft; Quanta Computer; Taiwan Mobile; ZOOM ; Sharif University of Technology
    Association for Computing Machinery, Inc  2020
    Abstract
    In real-world networks, nodes might have more than one type of relationship. Signed networks are an important class of such networks consisting of two types of relations: positive and negative. Recently, embedding signed networks has attracted increasing attention and is more challenging than classic networks since nodes are connected by paths with multi-types of links. Existing works capture the complex relationships by relying on social theories. However, this approach has major drawbacks, including the incompleteness/inaccurateness of such theories. Thus, we propose network transformation based embedding to address these shortcomings. The core idea is that rather than directly finding the... 

    RIAL: Redundancy reducing inlining algorithm to map XML DTD to relations

    , Article 2008 International Conference on Computational Intelligence for Modelling Control and Automation, CIMCA 2008, Vienna, 10 December 2008 through 12 December 2008 ; July , 2008 , Pages 25-30 ; 9780769535142 (ISBN) Rafsanjani, A. J ; Mirian Hosseinabadi, S. H ; Sharif University of Technology
    2008
    Abstract
    XML has emerged as a common standard for data exchange over the World Wide Web. One way to manage XML data is to use the power of relational databases for storing and querying them. So the hierarchical XML data should be mapped into flat relational structure. In this paper we propose an algorithm which maps DTD to relational schema and as well as content and structure it preserves the functional dependencies during the mapping process in order to produce relations with less redundancy. This is done by categorizing functional dependencies and introducing four rules to be applied to the relations created by the hybrid inlining algorithm according to each category. These rules will reduce... 

    Process patterns for web engineering

    , Article Proceedings - International Computer Software and Applications Conference, 19 July 2010 through 23 July 2020 ; 2010 , Pages 477-486 ; 07303157 (ISSN) ; 9780769540856 (ISBN) Babanezhad, R ; Bibalan, Y. M ; Ramsin, R ; Sharif University of Technology
    Abstract
    Web Engineering has been enriched with processes and modeling languages that focus on the specific features of web-based systems, taking into account the special requirements and constraints that are associated with this specific context. Process Patterns, on the other hand, represent elements of knowledge and experience in software engineering; they also act as reusable method chunks that can be used for constructing bespoke methodologies that are tailored to fit specific project situations. We propose a set of process patterns based on current web development practices. A number of prominent web development methodologies have been studied, and a set of process patterns has been elicited... 

    On the uniform sampling of the web: An improvement on bucket based sampling

    , Article 2009 International Conference on Communication Software and Networks, ICCSN 2009, Macau, 27 February 2009 through 28 February 2009 ; 2009 , Pages 205-209 ; 9780769535227 (ISBN) Heidari, S ; Mousavi, H ; Movaghar, A ; Sharif University of Technology
    2009
    Abstract
    Web is one of the biggest sources of information. The tremendous size, the dynamicity, and the structure of the Web have made the information retrieval process of the web a challenging issue. Web Search Engines (WSEs) have started to help users with this matter. However, these types of application, to perform more effectively, always need current information about many characteristics of the Web. To determine these characteristics, one way is to use statistical sampling of the Web pages. In this kind of approaches, instead of analyzing a large number of Web pages, a rather smaller and more uniform set of Web pages is used. This research attempts to analyze the presented methods for... 

    Network reconstruction under compressive sensing

    , Article Proceedings of the 2012 ASE International Conference on Social Informatics, SocialInformatics ; 2013 , Pages 19-25 ; 9780769550152 (ISBN) Siyari, P ; Rabiee, H. R ; Salehi, M ; Mehdiabadi, M. E ; Academy of Science and Engineering (ASE) ; Sharif University of Technology
    2013
    Abstract
    Many real-world systems and applications such as World Wide Web, and social interactions can be modeled as networks of interacting nodes. However, in many cases, one encounters the situation where the pattern of the node-to-node interactions (i.e., edges) or the structure of a network is unknown. We address this issue by studying the Network Reconstruction Problem: Given a network with missing edges, how is it possible to uncover the network structure based on certain observable quantities extracted from partial measurements? We propose a novel framework called CS-NetRec based on a newly emerged paradigm in sparse signal recovery called Compressive Sensing (CS). The results demonstrate that... 

    NeSReC: A news meta-search engines result clustering tool

    , Article 2006 International Conference on Systems, Computing Sciences and Software Engineering, SCSS 2006, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2006, 4 December 2006 through 14 December 2006 ; 2007 , Pages 173-178 ; 9781402062636 (ISBN) Sayyadi, H ; Salehi, S ; Abolhassani, H ; Sharif University of Technology
    2007
    Abstract
    Recent years have witnessed an explosion in the availability of news articles on the World Wide Web. In addition, organizing the results of a news search facilitates the user(s) in overviewing the returned news. In this work, we have focused on the label-based clustering approaches for news meta-search engines, and which clusters news articles based on their topics. Furthermore, our engine for NEws meta-Search REsult Clustering (NeSReC) is implemented along. NeSReC takes queries from the users and collect the snippets of news which are retrieved by The Altavista News Search Engine for the queries. Afterwards, it performs the hierarchical clustering and labeling based on news snippets in a... 

    Multiple cell tracking algorithm assessment using simulation of spermatozoa movement

    , Article 2015 IEEE 15th International Conference on Bioinformatics and Bioengineering, BIBE 2015, 2 November 2015 through 4 November 2015 ; 2015 ; 9781467379830 (ISBN) Arasteh, A ; Vahdat, B. V ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    In this research, a web-based simulator is developed, which can be used for generating image sequences of moving spermatozoa cells. It can be used for assessment of multiple object tracking algorithms, especially Computer Aided Sperm Analysis (CASA) systems. The developed software has many useful parameters such as blurring images or adding noise and it also gives full control of sperm counts and types. To illustrate performance of the developed simulator, three parameters (spermatozoa population, standard deviation of Gaussian blur filter and noise intensity) have been swept and the results of three different multiple object tracking algorithms were compared as an application of this... 

    Multilingual CAPTCHA

    , Article ICCC 2007 - 5th IEEE International Conference on Computational Cybernetics, Gammarth, 19 October 2007 through 21 October 2007 ; 2007 , Pages 135-139 ; 1424411467 (ISBN); 9781424411467 (ISBN) Shirali Shahreza, M. H ; Shirali Shahreza, M ; Sharif University of Technology
    2007
    Abstract
    Currently, many daily human activities such as education, commerce and talks are carried out through the Internet. In cases such as the registering in websites, some hackers write programs to make automatic false enrolments which waste the resources of the website while this may even stop the entire website from working. Therefore, it is necessary to tell apart human users from computer programs which is known as CAPTCHA (Completely Automated Public Turing test to tell Computers and Human Apart). CAPTCHA methods are mainly based on the weak points of OCR (Optical Character Recognition) systems while using them are undesirable to human users. In this paper a method has been presented for... 

    Mining search engine query log for evaluating content and structure of a web site

    , Article IEEE/WIC/ACM International Conference on Web Intelligence, WI 2007, Silicon Valley, CA, 2 November 2007 through 5 November 2007 ; January , 2007 , Pages 235-241 ; 0769530265 (ISBN); 9780769530260 (ISBN) Hosseini, M ; Abolhassani, H ; Sharif University of Technology
    2007
    Abstract
    Mining search engine query log is a new method for evaluating web site link structure and information architecture. In this paper we propose a new query-URL co-clustering for a web site useful to evaluate information architecture and link structure. Firstly, all queries and clicked URLs corresponding to particular web site are collected from a query log as bipartite graph, one side for queries and the other side for URLs. Then a new content free clustering is applied to cluster queries and URLs concurrently. Afterwards, based on information entropy, clusters of URLs and queries will be used for evaluating link structure and information architecture respectively. Data sets of different web... 

    Localized CAPTCHA for illiterate people

    , Article 2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007, Kuala Lumpur, 25 November 2007 through 28 November 2007 ; 2007 , Pages 675-679 ; 1424413559 (ISBN); 9781424413553 (ISBN) Shirali Shahreza, M. H ; Shirali Shahreza, M ; Sharif University of Technology
    2007
    Abstract
    Nowadays, many daily human activities such as education, commerce, talks, etc. are carried out through the Internet. In cases such as the registering in websites, some hackers write programs to make automatic false enrolments which waste the resources of the website while this may even stop the entire website from working. Therefore, it is necessary to tell apart human users from computer programs which is known as CAPTCHA (Completely Automated Public Turing test to tell Computers and Human Apart). CAPTCHA methods are mainly based on the weak points of OCR (Optical Character Recognition) systems while using them are undesirable to human users. So the Non-OCR-Based CAPTCHA methods are... 

    Kavosh: An intelligent neuro-fuzzy search engine

    , Article 7th International Conference on Intelligent Systems Design and Applications, ISDA'07, Rio de Janeiro, 22 October 2007 through 24 October 2007 ; November , 2007 , Pages 597-602 ; 0769529763 (ISBN); 9780769529769 (ISBN) Milani Fard, A ; Ghaemi, R ; Akbarzadeh-T., M. R ; Akbari, H ; Sharif University of Technology
    2007
    Abstract
    In this paper we propose a neuro-fuzzy architecture for Web content taxonomy using hybrid of Adaptive Resonance Theory (ART) neural networks and fuzzy logic concept. The search engine called Kavosh1 is equipped with unsupervised neural networks for dynamic data clustering. This model was designed for retrieving images without metadata and in estimating resemblance of multimedia documents; however, in this work only text mining method is implemented. Results show noticeable average precision and recall over search results. © 2007 IEEE  

    Introducing a framework to create telephony speech databases from direct ones

    , Article 14th International Conference on Systems Signals and Image Processing, IWSSIP 2007 and 6th EURASIP Conference Focused on Speech and Image Processing, Multimedia Communications and Services, EC-SIPMCS 2007, Maribor, 27 June 2007 through 30 June 2007 ; November , 2007 , Pages 327-330 ; 9789612480295 (ISBN) Momtazi, S ; Sameti, H ; Vaisipour, S ; Tefagh, M ; Sharif University of Technology
    2007
    Abstract
    A Comprehensive speech database is one of the important tools for developing speech recognition systems; these tools are necessary for telephony recognition, too. Although adequate databases for direct speech recognizers exist, there is not an appropriate database for telephony speech recognizers. Most methods suggested for solving this problem are based on building new databases which tends to consume much time and many resources; or they used a filter which simulates circuit switch behavior to transform direct databases to telephony ones, in this case resulted databases have many differences with real telephony databases. In this paper we introduce a framework for creating telephony speech...