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

    A novel algorithm for using GA in concept weighting for text mining

    , Article WSEAS Transactions on Computers ; Volume 5, Issue 12 , 2006 , Pages 2992-2999 ; 11092750 (ISSN) Zaefarian, R ; Akhgar, B ; Siddiqi, J. I ; Zaefarian, G ; Gruzdz, A ; Ihnatowicz, A ; Sharif University of Technology
    2006
    Abstract
    The importance of good weighting methodology in information retrieval methods - the method that affects the most useful features of a document or query representative - is examined.. Weighting features is the thing that many information retrieval systems are regarding as being of minor importance as compared to find the feature and the experiments are confirming this. There are different methods for the term weighting such as TF*IDF and Information Gain Ratio which have been used in information retrieval systems, the paper provides a brief review of the related literature. This paper explores using GA for concept weighting which is a novel application to the field of text mining It proposes... 

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

    A generalized audio identification system using adaptive filters

    , Article 26th Iranian Conference on Electrical Engineering, ICEE 2018, 8 May 2018 through 10 May 2018 ; 2018 , Pages 1641-1646 ; 9781538649169 (ISBN) Yazdanian, S ; Sameti, H ; Alidoust, A ; Sharif University of Technology
    Abstract
    From searching music with smartphones to broadcast monitoring by radio channels, audio identification systems are being used more in recent years. Design of such systems may differ when the problem domain changes, since each environment has special conflicting constraints to consider, like required speed and robustness to signal degradations. In this paper, a widely used audio identification system originally developed by Haitsma and Kalker is analyzed from a signal processing point of view and the fingerprint (audio feature) extraction method is modified. By adding a flexible filter to the fingerprint extraction method, the original system can be tuned to work in different domains. In order... 

    ISO-TimeML event extraction in persian text

    , Article 24th International Conference on Computational Linguistics - Proceedings of COLING 2012: Technical Papers, 8 December 2012 through 15 December 2012 ; December , 2012 , Pages 2931-2944 Yaghoobzadeh, Y ; Ghassem-Sani, G ; Mirroshandel, S. A ; Eshaghzadeh, M ; Sharif University of Technology
    2012
    Abstract
    Recognizing TimeML events and identifying their attributes, are important tasks in natural language processing (NLP). Several NLP applications like question answering, information retrieval, summarization, and temporal information extraction need to have some knowledge about events of the input documents. Existing methods developed for this task are restricted to limited number of languages, and for many other languages including Persian, there has not been any effort yet. In this paper, we introduce two different approaches for automatic event recognition and classification in Persian. For this purpose, a corpus of events has been built based on a specific version of ISO-TimeML for Persian.... 

    A fuzzy learning model for retrieving and learning information in visual working brain memory mechanism

    , Article 2017 25th Iranian Conference on Electrical Engineering, ICEE 2017, 2 May 2017 through 4 May 2017 ; 2017 , Pages 61-64 ; 9781509059638 (ISBN) Tajrobehkar, M ; Bagheri Shouraki, S ; Jahed, M ; Sharif University of Technology
    Abstract
    In this investigation, the idea of Visual Working Memory (VWM) mechanism modeling based on versatile fuzzy method; Active Learning method, is presented. Visual information process; retrieving and learning rely on the use of Ink Drop Spread (IDS) and Center of Gravity (COG) as spatial density convergence operators. IDS modeling is characterized by processing that uses intuitive pattern information instead of complex formulas, and it is capable of stable and fast convergence. Furthermore, because it approves that distortion in retrieving irrelative data is adaptive to avoid storing lots of repetitive external information in daily visualization. Subsequently, this distortion is analyzed via two... 

    Private function computation

    , Article 2020 IEEE International Symposium on Information Theory, ISIT 2020, 21 July 2020 through 26 July 2020 ; Volume 2020-June , 2020 , Pages 1118-1123 Tahmasebi, B ; Maddah Ali, M. A ; IEEE Information Theory Society; The Institute of Electrical and Electronics Engineers ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2020
    Abstract
    In this paper, we study the problem of private function computation, where a user wants to compute a function of some inputs, using N in mathbb{N} servers, where the function is a private combination/composition of some K in mathbb{N} public basic functions {f 1 , f 2 ,., f K }. More precisely, for some inputs W m , m [1 : M], the user's goal is to calculate hleft( {{W-m}} ight) = sumolimits-{j = 1}^J {{alpha -j}} {h-j}left( {{W-m}} ight), for some J in mathbb{N}, some scalers α j , j [1 : J], and some functions h j (.), j [1 : J], where each is an arbitrary compositions of the basic functions {f 1 , f 2 ,., f K }. The computation is done through a sequence of queries to N servers. In each... 

    Revisiting optimal rank aggregation: A dynamic programming approach

    , Article ICTIR 2015 - Proceedings of the 2015 ACM SIGIR International Conference on the Theory of Information Retrieval, 27 September 2015 through 30 September 2015 ; 2015 , Pages 353-356 ; 9781450338332 (ISBN) Tabrizi, S. A ; Dadashkarimi, J ; Dehghani, M ; Esfahani, H. N ; Shakery, A ; Sharif University of Technology
    Association for Computing Machinery, Inc  2015
    Abstract
    Rank aggregation, that is merging multiple ranked lists, is a pivotal challenge in many information retrieval (IR) systems, especially in distributed IR and multilingual IR. From the evaluation point of view, being able to calculate the upper-bound of performance of the final aggregated list lays the ground for evaluating different aggregation strategies, independently. In this paper, we propose an algorithm based on dynamic programming which, using relevancy information, obtains the aggregated list with the maximum performance that could be possibly achieved by any aggregation strategy. We also provide a detailed proof for the optimality of the result of the algorithm. Furthermore, we... 

    Private Information Retrieval for a Multi-Message Scenario with Private Side Information

    , Article IEEE Transactions on Communications ; Volume 69, Issue 5 , 2021 , Pages 3235-3244 ; 00906778 (ISSN) Siavoshani, M. J ; Shariatpanahi, S. P ; Maddah Ali, M. A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2021
    Abstract
    We consider the problem of private information retrieval (PIR), where a single user with private side information (PSI) aims to retrieve multiple files from a library stored at some servers. We assume that the side information (SI) at the user includes a subset of files stored privately. Moreover, the identity of requests and side information at the user are not revealed to any of the servers. The problem involves finding the minimum load transmitted from the servers to the user such that the requested files can be decoded with the help of received data and side information. By providing matching lower and upper bounds for certain regimes, we characterize the minimum load imposed on all the... 

    Removing noises similar to dots from persian scanned documents

    , Article ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM 2008, Guangzhou, 3 August 2008 through 4 August 2008 ; Volume 2 , 2008 , Pages 313-317 ; 9780769532905 (ISBN) Shirali Shahreza, M. H ; Shiral Shahreza, S ; Sharif University of Technology
    2008
    Abstract
    Nowadays, computer is being used in many aspects of human life. A consequence of computer is electronic documents. Computers cannot understand written documents. So, we need to convert written documents to electronic documents in order to be able to process them with computers. One of the common methods for converting written texts to electronic text is Optical Character Recognition (OCR). A lot of work has been done on English OCR, but Persian/Arabic OCR is still under development. One of the major problems in Persian/Arabic OCR is noise removal. Because dots are very important in Persian and Arabic languages and they are very similar to noises, so noise removal from Persian/Arabic... 

    Evaluation of test collection construction methods: A case study

    , Article 2008 International Conference on Information and Knowledge Engineering, IKE 2008, Las Vegas, NV, 14 July 2008 through 17 July 2008 ; January , 2008 , Pages 16-22 ; 1601320752 (ISBN); 9781601320759 (ISBN) Sheykh Esmaili, K ; Hosseini, M ; Rostami, A ; Abolhassani, H ; Sharif University of Technology
    2008
    Abstract
    Currently there is no standard test collection for evaluation of Farsi information retrieval systems. In this paper we introduce Mahak, the first complete test collection generally available for evaluating Farsi information retrieval systems. In addition, we have used different methods for constructing Mahak qrels and we have compared performance of these methods  

    Mahak: A test collection for evaluation of farsi information retrieval systems

    , Article 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007, Amman, 13 May 2007 through 16 May 2007 ; 2007 , Pages 639-644 ; 1424410312 (ISBN); 9781424410316 (ISBN) Sheykh Esmaili, K ; Abolhassani, H ; Neshati, M ; Behrangi, E ; Rostami, A ; Mohammadi Nasiri, M ; Sharif University of Technology
    2007
    Abstract
    Currently there is no standard test collection for evaluation of Farsi information retrieval systems. In this paper we introduce Mahak, the first complete test collection generally available for evaluating Farsi information retrieval systems. We also discuss our construction process in detail. As a goal, we hope that Mahak will foster the development of Farsi information retrieval systems. © 2007 IEEE  

    Multi-message private information retrieval with private side information

    , Article 2018 IEEE Information Theory Workshop, ITW 2018, 25 November 2018 through 29 November 2018 ; 2019 ; 9781538635995 (ISBN) Shariatpanahi, S. P ; Jafari Siavoshani, M ; Maddah Ali, M. A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    We consider the problem of private information retrieval (PIR) where a single user with private side information aims to retrieve multiple files from a library stored (uncoded) at a number of servers. We assume the side information at the user includes a subset of files stored privately (i.e., the server does not know the indices of these files). In addition, we require that the identity of requests and side information at the user are not revealed to any of the servers. The problem involves finding the minimum load to be transmitted from the servers to the user such that the requested files can be decoded with the help of received and side information. By providing matching lower and upper... 

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

    New method for risk management in CRM security management

    , Article Third International Conference on Information Technology: New Generations, ITNG 2006, Las Vegas, NV, 10 April 2006 through 12 April 2006 ; Volume 2006 , 2006 , Pages 440-445 ; 0769524974 (ISBN); 9780769524979 (ISBN) Seify, M ; Sharif University of Technology
    2006
    Abstract
    In an increasing competitive world, marketing survival can be depended simply on timely new information on customers and market trend. One of the most important strategies in CRM (Customer Relationship Management) is to capture enough information from customers and using this information carefully [17, 19]. Of course security of this information is very important in CRM data management [2]. Data management is a method for scheduling and controlling data saving, recovering and processing. This activity has been done continually or periodically [2]. Security level of this information depends on the security policy of the organization. CRM security policy is the directives and practices for... 

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

    Exact evaluation of a two sourcing supply chain with order splitting and information sharing

    , Article 2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008, Singapore, 8 December 2008 through 11 December 2008 ; 2008 , Pages 1835-1839 ; 9781424426300 (ISBN) Sajadifar, M ; Hendi, A. M ; Haji, R ; Sharif University of Technology
    2008
    Abstract
    We consider a single item, two-level inventory system which consisting of two suppliers and one retailer. Transportation times are constant. The retailer faces Poisson demands and applies continuous (R,Q) policy. Each supplier starts with m initial batches of size Q/2 and places an order in a batch of size Q/2 to an outside source immediately after the retailer's inventory position reaches R+s. In this paper using the idea of the one-for-one ordering policy, we derive the exact value of the expected total cost in the convergent coordinated supply chain. © 2008 IEEE  

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

    Rate-power-interference optimization in underlay OFDMA CRNs with imperfect CSI

    , Article IEEE Communications Letters ; Volume 21, Issue 7 , 2017 , Pages 1657-1660 ; 10897798 (ISSN) Robat Mili, M ; Musavian, L ; Ng, D. W. K ; Sharif University of Technology
    Abstract
    Achieving higher transmission rate while reducing transmission power and induced interference on neighboring receivers is deemed necessary for the advancement of future generation networks and is particularly challenging, since these directions could be conflicting in nature. This letter adopts a multiobjective optimization (MOOP) approach to settle the tradeoffs between these three conflicting objectives in orthogonal frequency-division multiple access-based cognitive radio networks. Besides, unlike most of the work in the literature that studied the imperfect channel side information (CSI) of the link between the secondary transmitter and the primary receiver to evaluate ergodic capacity,... 

    MDL-CW: A multimodal deep learning framework with cross weights

    , Article 2016 IEEE Conference on Computer Vision and Pattern Recognition, 26 June 2016 through 1 July 2016 ; Volume 2016-January , 2016 , Pages 2601-2609 ; 10636919 (ISSN) ; 9781467388511 (ISBN) Rastegar, S ; Soleymani Baghshah, M ; Rabiee, H. R ; Shojaee, S. M ; Sharif University of Technology
    IEEE Computer Society 
    Abstract
    Deep learning has received much attention as of the most powerful approaches for multimodal representation learning in recent years. An ideal model for multimodal data can reason about missing modalities using the available ones, and usually provides more information when multiple modalities are being considered. All the previous deep models contain separate modality-specific networks and find a shared representation on top of those networks. Therefore, they only consider high level interactions between modalities to find a joint representation for them. In this paper, we propose a multimodal deep learning framework (MDLCW) that exploits the cross weights between representation of... 

    Performance evaluation of epidemic content retrieval in DTNs with restricted mobility

    , Article IEEE Transactions on Network and Service Management ; Volume 16, Issue 2 , 2019 , Pages 701-714 ; 19324537 (ISSN) Rashidi, L ; Entezari Maleki, R ; Chatzopoulos, D ; Hui, P ; Trivedi, K. S ; Movaghar, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    In some applicable scenarios, such as community patrolling, mobile nodes are restricted to move only in their own communities. Exploiting the meetings of the nodes within the same community and the nodes within the neighboring communities, a delay tolerant network (DTN) can provide communication between any two nodes. In this paper, two analytical models based on stochastic reward nets (SRNs) are proposed to evaluate the performance of the epidemic content retrieval in such multi-community DTNs. Performance measures computed by the proposed models are the average retrieval delay and the average number of transmissions. The monolithic SRN model proposed in the first step is not scalable, in...