Loading...
Search for: information-retrieval
0.008 seconds
Total 80 records

    Fuzzy Adaptive Resonance Theory for content-based data retrieval

    , Article 2006 Innovations in Information Technology, IIT, Dubai, 19 November 2006 through 21 November 2006 ; 2006 ; 1424406749 (ISBN); 9781424406746 (ISBN) Milani Fard, A ; Akbari, H ; Akbarzadeh-T., M. R ; Sharif University of Technology
    2006
    Abstract
    In this paper we propose a content-based text and image retrieval architecture using Fuzzy Adaptive Resonance Theory neural network. This method is equipped with an unsupervised mechanism for dynamic data clustering to deal with incremental information without metadata such as in web environment. Results show noticeable average precision and recall over search results. © 2006 IEEE  

    Combined time and information redundancy for SEU-tolerance in energy-efficient real-time systems

    , Article IEEE Transactions on Very Large Scale Integration (VLSI) Systems ; Volume 14, Issue 4 , 2006 , Pages 323-335 ; 10638210 (ISSN) Ejlali, A ; Al-Hashimi, B. M ; Schmitz, M. T ; Rosinger, P ; Miremadi, S. G ; Sharif University of Technology
    2006
    Abstract
    Recently, the tradeoff between energy consumption and fault-tolerance in real-time systems has been highlighted. These works have focused on dynamic voltage scaling (DVS) to reduce dynamic energy dissipation and on-time redundancy to achieve transient-fault tolerance. While the time redundancy technique exploits the available slack-time to increase the fault-tolerance by performing recovery executions, DVS exploits slack-time to save energy. Therefore, we believe there is a resource conflict between the time-redundancy technique and DVS. The first aim of this paper is to propose the use of information redundancy to solve this problem. We demonstrate through analytical and experimental... 

    Towards Unsupervised Temporal Relation Extraction Between Events

    , M.Sc. Thesis Sharif University of Technology Mirroshandel, Abolghasem (Author) ; Ghassem-Sani, Gholamreza (Supervisor)
    Abstract
    Temporal relation classification is one of the contemporary demanding tasks in natural language processing. This task can be used in various applications such as question answering, summarization, and language specific information retrieval. Temporal relation classification methods can be categorized into three main groups of supervised, semi-supervised, and unsupervised (based on the type of the training data that they need). In this thesis, we have two main goals: first, improving accuracy of temporal relation learning, and second, decreasing supervision of algorithm as much as possible. For achieving these goals, three main steps are proposed. In the first step, we propose an improved... 

    Prioritizing Bug Issues in Git Hub Based on the Impact on the Most Used Parts of the Code

    , M.Sc. Thesis Sharif University of Technology Akhi, Mahdi (Author) ; Heydarnoori, Abbas (Supervisor)
    Abstract
    Prioritizing bug issue report is a critical task in the software maintenance cycle of repositories that have a large number of users and contributors. In such software, late fixing of bugs can cause the loss of users’ trust and market loss. At present, a majority of bug report prioritization is manual, in that the bug issue reports are triaged by human experts. However, new automated technologies are becoming feasible. These automated techniques have been shown to be effective in general situations, though a key weakness is that they do not use the criteria for prioritizing. Most of the state-of-the-art approaches are using machine learning algorithms to learn the different features of... 

    Syntactic tree kernels for event-time temporal relation learning

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 6562 LNAI , 2011 , Pages 213-223 ; 03029743 (ISSN) ; 9783642200946 (ISBN) Mirroshandel, S. A ; Khayyamian, M ; Ghassem Sani, G ; Sharif University of Technology
    Abstract
    Temporal relation classification is one of the contemporary demanding tasks in natural language processing. This task can be used in various applications such as question answering, summarization, and language specific information retrieval. In this paper, we propose an improved algorithm for classifying temporal relations between events and times, using support vector machines (SVM). Along with gold-standard corpus features, the proposed method aims at exploiting useful syntactic features, which are automatically generated, to improve accuracy of the classification. Accordingly, a number of novel kernel functions are introduced and evaluated for temporal relation classification. The result... 

    General bounds for the optimal value of retailers' reorder point in a two-level inventory control system with and without information sharing

    , Article International Journal of Advanced Manufacturing Technology ; Volume 48, Issue 1-4 , April , 2010 , Pages 383-393 ; 02683768 (ISSN) Yazdan Shenas, N ; Eshragh Jahromi, A ; Akhavan Niaki, S ; Sharif University of Technology
    2010
    Abstract
    In this study, an inventory system consisting of a single product, one supplier, and multiple identical retailers is considered. Each retailer replenishes inventory from the supplier according to the well known (R,Q) policy. Transit times are constant and retailers face independent Poisson demand. The supplier utilizing the retailers' information in decision making for replenishment policy with a given order size starts with m initial batches (of size Q) and places an order in a batch of size Q to an outside source when a new order is placed. In this inventory system, excess demand is backordered, delayed orders are satisfied on a first-come first-serve basis, and no partial shipment is... 

    Multiple relay channels with delays: with and without side information

    , Article GLOBECOM - IEEE Global Telecommunications Conference2009 ; Article number 5426043 , 2009 ; 9781424441488 (ISBN) Iraji, M. B ; Khosravi Farsani, R ; Aref, M. R ; Sharif University of Technology
    Abstract
    In this paper the Multiple Relay Channels (MRC) with delays, with and without channel state information (CSI) are investigated from an information theoretic point of view. For the MRC with unlimited look ahead where the relays can use the whole received block to encode, upper and lower bounds on the capacity are derived which are tight for the degraded case. For the MRC without-delay where the relays have access to the present received symbols in addition to the past symbols, the capacity of the degraded channel is established using Shannon's strategy for the channels with side information. Then we introduce the state dependent MRC with unlimited look ahead and derive a lower bound on the... 

    Using tree kernels for classifying temporal relations between events

    , Article PACLIC 23 - Proceedings of the 23rd Pacific Asia Conference on Language, Information and Computation, 3 December 2009 through 5 December 2009 ; Volume 1 , 2009 , Pages 355-364 ; 9789624423198 (ISBN) Mirroshandel, S. A ; Ghassem Sani, G. R ; Khayyamian, M ; Sharif University of Technology
    Abstract
    The ability to accurately classify temporal relations between events is an important task in a large number of natural language processing and text mining applications such as question answering, summarization, and language specific information retrieval. In this paper, we propose an improved way of classifying temporal relations, using support vector machines (SVM). Along with gold-standard corpus features, the proposed method aims at exploiting useful syntactic features, which are automatically generated, to improve accuracy of the SVM classification method. Accordingly, a number of novel kernel functions are introduced and evaluated for temporal relation classification. Our evaluations... 

    RedQueen: an online algorithm for smart broadcasting in social networks

    , Article WSDM 2017 - Proceedings of the 10th ACM International Conference on Web Search and Data Mining, 2 February 2017 ; 2017 , Pages 51-60 ; 9781450346757 (ISBN) Zarezade, A ; Upadhyay, U ; Rabiee, H. R ; Gomez Rodriguez, M ; Sharif University of Technology
    Association for Computing Machinery, Inc  2017
    Abstract
    Users in social networks whose posts stay at the top of their followers' feeds the longest time are more likely to be noticed. Can we design an online algorithm to help them decide when to post to stay at the top? In this paper, we address this question as a novel optimal control problem for jump stochastic differential equations. For a wide variety of feed dynamics, we show that the optimal broadcasting intensity for any user is surprisingly simple - it is given by the position of her most recent post on each of her follower's feeds. As a consequence, we are able to develop a simple and highly efficient online algorithm, RedQueen, to sample the optimal times for the user to post.... 

    Towards side channel secure cyber-physical systems

    , Article CSI International Symposium on Real-Time and Embedded Systems and Technologies, RTEST 2018, 9 May 2018 through 10 May 2018 ; 9-10 May , 2018 , Pages 31-38 ; 9781538614754 (ISBN) Ashrafiamiri, M ; Afandizadeh Zargari, A. H ; Farzam, S. M. H ; Bayat Sarmadi, S ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    Cyber-physical systems contain networked embedded systems. Such systems may implement cryptographic algorithms for processing and/or communication. Therefore, they can be prone to side-channel attacks. Differential power analysis is one of such attacks, which is considered among the most serious threats against cryptographic devices. Various metrics have been proposed to evaluate the resistance of different implementations against these attacks. Some of these metrics need side-channel attacks to be conducted and depend on the considered power model. Due to the vast variety of proposed side-channel attacks and power models, comprehensively evaluating a design under these metrics is commonly... 

    Private Inner product retrieval for distributed machine learning

    , Article 2019 IEEE International Symposium on Information Theory, ISIT 2019, 7 July 2019 through 12 July 2019 ; Volume 2019-July , 2019 , Pages 355-359 ; 21578095 (ISSN); 9781538692912 (ISBN) Mousavi, M. H ; Maddah Ali, M. A ; Mirmohseni, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    In this paper, we argue that in many basic algorithms for machine learning, including support vector machine (SVM) for classification, principal component analysis (PCA) for dimensionality reduction, and regression for dependency estimation, we need the inner products of the data samples, rather than the data samples themselves.Motivated by the above observation, we introduce the problem of private inner product retrieval for distributed machine learning, where we have a system including a database of some files, duplicated across some non-colluding servers. A user intends to retrieve a subset of specific size of the set of the inner product of every pair of data items in the database with... 

    Semantic web services for handling data heterogeneity in an e-business framework

    , 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 453-460 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN) Rokni Dezfouli, A ; Habibi, J ; Hassas Yeganeh, S ; Sharif University of Technology
    2008
    Abstract
    E-business requires interoperability of information systems and, therefore, standardization of information sharing. Several XML-based e-business frameworks are developed to define standards for information sharing within and between companies. These frameworks only standardize structure of messages and aren't able to define semantics. The use of Semantic Web Service (SWS) technologies has been suggested to enable more dynamic B2B integration of heterogeneous systems and partners. We present a semantic B2B mediator based on the WSMX -a SWS execution environment, to tackle heterogeneities in RosettaNet messages. We develop a rich RosettaNet ontology and use the axiomatized knowledge and rules... 

    Sensitivity analysis of the OWA operator

    , Article IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics ; Volume 38, Issue 2 , 2008 , Pages 547-552 ; 10834419 (ISSN) Zarghami, M ; Szidarovszky, F ; Ardakanian, R ; Sharif University of Technology
    2008
    Abstract
    The successful design and application of the ordered weighted averaging (OWA) method as a decision-making tool depend on the efficient computation of its order weights. The most popular methods for determining the order weights are the fuzzy linguistic quantifiers approach and the minimal variability method, which give different behavior patterns for the OWA. These two methods will be first analyzed in detail by using sensitivity analysis on the outputs of the OWA with respect to the optimism degree of the decision maker, and then the two methods will be compared. The fuzzy linguistic quantifiers approach gives more information about the behavior of the OWA outputs in comparison to the... 

    A context-aware mandatory access control model for multilevel security environments

    , Article 27th International Conference on Computer Safety, Reliability, and Security, SAFECOMP 2008, Newcastle upon Tyne, 22 September 2008 through 25 September 2008 ; Volume 5219 LNCS , 2008 , Pages 401-414 ; 03029743 (ISSN); 3540876979 (ISBN); 9783540876977 (ISBN) Jafarian, J. H ; Amini, M ; Jalili, R ; Sharif University of Technology
    2008
    Abstract
    Mandatory access control models have traditionally been employed as a robust security mechanism in multilevel security environments like military domains. In traditional mandatory models, the security classes associated with entities are context-insensitive. However, context-sensitivity of security classes may be required in some environments. Moreover, as computing technology becomes more pervasive, flexible access control mechanisms are needed. Unlike traditional approaches for access control, such access decisions depend on the combination of the required credentials of users and the context of the system. Incorporating context-awareness into mandatory access control models results in a... 

    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  

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

    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  

    Delay-aware scheduling in heterogeneous multiuser systems

    , Article 2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications, SPAWC, Cannes, 2 July 2006 through 5 July 2006 ; 2006 ; 078039710X (ISBN); 9780780397101 (ISBN) Shariatpanahi, P ; Hossein Khalaj, B ; Sharif University of Technology
    2006
    Abstract
    Adaptive scheduling schemes which consider channel conditions are examples of cross-layer design in wireless networks. Research work which has been done on optimizing the performance of scheduling systems have shown that in each time slot it is better to transmit to the users with the best channel condition. In order to realize such schemes, most of earlier works have considered perfect feedback channels to send Channel State Information (CSI) to the scheduler. However, in practical systems there are some sources of imperfectness in feedback channels such as delay and quantization error. In this paper, we consider the effect of CSI delay on the performance of such systems. A new delay-aware... 

    Event classification from the Urdu language text on social media

    , Article PeerJ Computer Science ; Volume 7 , 2021 ; 23765992 (ISSN) Awan, M. D. A ; Kajla, N. I ; Firdous, A ; Husnain, M ; Missen, M. M. S ; Sharif University of Technology
    PeerJ Inc  2021
    Abstract
    The real-time availability of the Internet has engaged millions of users around the world. The usage of regional languages is being preferred for effective and ease of communication that is causing multilingual data on social networks and news channels. People share ideas, opinions, and events that are happening globally i.e., sports, inflation, protest, explosion, and sexual assault, etc. in regional (local) languages on social media. Extraction and classification of events from multilingual data have become bottlenecks because of resource lacking. In this research paper, we presented the event classification task for the Urdu language text existing on social media and the news channels by... 

    Suggesting an integration system for image annotation

    , Article Multimedia Tools and Applications ; 2022 ; 13807501 (ISSN) Ghostan Khatchatoorian, A ; Jamzad, M ; Sharif University of Technology
    Springer  2022
    Abstract
    The number of digital images uploaded in the virtual world is rapidly growing every day. Therefore, an automatic image annotation system that can retrieve information from these images seems to be in high demand. One of the challenges in this field is the imbalanced data sets and the difficulty of successfully learning tags from them. Even if a nearly balanced data set exists for image annotation, it is unlikely to find a single learner, which could learn all tags with the same accuracy. In this paper, we suggest a novel integration system that selects an elite group of models from all existing annotation models and then combines them to take the best advantage of each model’s learning...