معرفی وب سایت ایران سای - مرجع علمی فنی مهندسی
به نام خدا
برای دانلود جدیدترین مقالات ISI پایگاه‌های IEEE، Science Direct، Springer و ACM مربوط به سالهای 2012 و 2013 می توانید به وب سایت ایران سای – مرجع علمی فنی مهندسی مراجعه نمایید.
بعد از ورود به سایت و عضو شدن در آن (که به صورت رایگان انجام می‌گیرد) در بخش جستجو مقاله مورد نظر خود را جستجو کرده و دانلود نمایید. هم‌چنین اگر مقاله مورد نظر شما در بین بیش از 200 هزار مقاله سایت موجود نبود، می توانید آن را در بخش سفارش ویژه حساب کاربری خود سفارش داده و در کمتر از 24 ساعت از طریق ایمیل آن را دریافت کنید. (معمولا سفارشات ویژه در کمتر از 4 ساعت انجام می گیرند.)
به علاوه، هر گونه سوال در زمینه نحوه کار سایت و انتخاب مقاله مورد نظر را می توانید با پشتیبان آنلاین سایت مطرح کرده و با کارشناسان سایت (که برخی از آنها دارای مدرک کارشناسی ارشد و دکترا در زمینه‌های مختلف فنی مهندسی می‌باشند) در میان بگذارید. آدرس ایمیل info@iransci.ir نیز برای مطرح نمودن هر مسئله یا مشکلی در اختیار شما عزیزان قرار دارد.
منتظر انتقادات و پیشنهادات سازنده شما هستیم.
ایران سای – مرجع علمی فنی مهندسی
حامی دانش بومی ایرانیان
Tell Me More? The Effects of Mental Model Soundness on Personal
به نام خدا
Title: Tell Me More? The Effects of Mental Model Soundness on Personalizing an Intelligent Agent
Authors: Todd Kulesza, Simone Stumpf, Margaret Burnett, Irwin Kwan
Abstract: What does a user need to know to productively work with an intelligent agent? Intelligent agents and recommender systems are gaining widespread use, potentially creating a need for end users to understand how these systems operate in order to fix their agents personalized behavior. This paper explores the effects of mental model soundness on such personalization by providing structural knowledge of a music recommender system in an empirical study. Our findings show that participants were able to quickly build sound mental models of the recommender system’s reasoning, and that participants who most improved their mental models during the study were significantly more likely to make the recommender operate to their satisfaction. These results suggest that by helping end users understand a system’s reasoning, intelligent agents may elicit more and better feedback, thus more closely aligning their output with each user’s intentions.
Publish Year: 2012
Published in: CHI – ACM
موضوع: عاملهای هوشمند (Intelligent Agents) ، هوش مصنوعی (Artificial Intelligence)
لینک مشاهده مقاله در سایت ناشر
ایران سای – مرجع علمی فنی مهندسی
حامی دانش بومی ایرانیان
A survey of skyline processing in highly distributed environmen
به نام خدا
Title: A survey of skyline processing in highly distributed environments
Authors: Katja Hose Akrivi Vlachou
Abstract: During the last decades, data management and storage have become increasingly distributed. Advanced query operators, such as skyline queries, are necessary in order to help users to handle the huge amount of available data by identifying a set of interesting data objects. Skyline query processing in highly distributed environments poses inherent challenges and demands and requires non-traditional techniques due to the distribution of content and the lack of global knowledge. This paper surveys this interesting and still evolving research area, so that readers can easily obtain an overview of the state-of-the-art. We outline the objectives and the main principles that any distributed skyline approach have to fulfill, leading to useful guidelines for developing algorithms for distributed skyline processing. We review in detail existing approaches that are applicable for highly distributed environments, clarify the assumptions of each approach, and provide a comparative performance analysis. Moreover, we study the skyline variants each approach supports. Our analysis leads to taxonomy of existing approaches. Finally, we present interesting research topics on distributed skyline computation that have not yet been explored.
Publish Year: 2012
Published in: The VLDB Journal – Springer
موضوع: پردازش توزیع شده (Distributed Processing)
ایران سای – مرجع علمی فنی مهندسی
حامی دانش بومی ایرانیان
Efficient stochastic algorithms for document clustering
به نام خدا
Title: Efficient stochastic algorithms for document clustering
Authors: Rana Forsati, Mehrdad Mahdav, Mehrnoush Shamsfard, Mohammad Reza Meybodi
Abstract: Clustering has become an increasingly important and highly complicated research area for targeting useful and relevant information in modern application domains such as the World Wide Web. Recent studies have shown that the most commonly used partitioning-based clustering algorithm, the K-means algorithm, is more suitable for large datasets. However, the K-means algorithm may generate a local optimal clustering. In this paper, we present novel document clustering algorithms based on the Harmony Search (HS) optimization method. By modeling clustering as an optimization problem, we first propose a pure HS based clustering algorithm that finds near-optimal clusters within a reasonable time. Then, harmony clustering is integrated with the K-means algorithm in three ways to achieve better clustering by combining the explorative power of HS with the refining power of the K-means. Contrary to the localized searching property of K-means algorithm, the proposed algorithms perform a globalized search in the entire solution space. Addition- ally, the proposed algorithms improve K-means by making it less dependent on the initial parameters such as randomly chosen initial cluster centers, therefore, making it more stable. The behavior of the proposed algorithm is theoretically analyzed by modeling its population variance as a Markov chain. We also conduct an empirical study to determine the impacts of various parameters on the quality of clusters and convergence behavior of the algorithms. In the experiments, we apply the proposed algorithms along with K-means and a Genetic Algorithm (GA) based clustering algorithm on five different document data- sets. Experimental results reveal that the proposed algorithms can find better clusters and the quality of clusters is comparable based on F-measure, Entropy, Purity, and Average Distance of Documents to the Cluster Centroid (ADDC).
Publish Year: 2013
Published in: Information Sciences - Science Direct
موضوع: الگوریتمهای تکاملی (Evolutionary Algorithms)- (Stochastic Algorithms)
ایران سای – مرجع علمی فنی مهندسی
حامی دانش بومی ایرانیان
Increasing the efficiency of quicksort using a neural network b
به نام خدا
Title: Increasing the efficiency of quicksort using a neural network based algorithm selection model
Author: Ugur Erkin Kocamaz
Abstract: Quicksort is one of the most popular sorting algorithms it is based on a divide-and-conquer technique and has a wide acceptance as the fastest general-purpose sorting technique. Though it is successful in separating large partitions into small ones, quicksort runs slowly when it processes its small partitions, for which completing the sorting through using a different sorting algorithm is much plausible solution. This variant minimizes the overall execution time but it switches to a constant sorting algorithm at a constant cut-off point. To cope with this constancy problem, it has been suggested that a dynamic model which can choose the fastest sorting algorithm for the small partitions. The model includes continuation with quicksort so that the cut-off point is also more flexible. To implement this with an intelligent algorithm selection model, artificial neural net- works are preferred due to their non-comparison, constant-time and low-cost architecture features. In spite of the fact that finding the best sorting algorithm by using a neural net- work causes some extra computational time, the gain in overall execution time is greater. As a result, a faster variant of quicksort has been implemented by using artificial neural network based algorithm selection approach. Experimental results of the proposed algorithm and the several other fast sorting algorithms have been presented, compared and discussed.
Publish Year: 2013
Published in: Information Sciences - Science Direct
موضوع: شبکه های عصبی مصنوعی (Artificial Neural Networks)
ایران سای – مرجع علمی فنی مهندسی
حامی دانش بومی ایرانیان