In recent years, the emergence of various social networks has led to the growth of social network users. However, activity in such networks depends on the level of trust that users have in each other. Therefore, trust is essential and important issue in these networks, especially when users interact with each other. In this article, we examine this issue and provide a method to evaluate it. It is not easy to measure the accuracy of trust for users who interact with social networks. Here, interactions are virtual. In this article, we have used the adaptive neuro-fuzzy inference system to evaluate trustworthiness by considering different personality attributes of users such as reliability, availability, interest, patience and adaptability. Using these features as input and based on the adaptive neuro-fuzzy inference system, we evaluated the trustworthiness of users in social network. The proposed adaptive neuro-fuzzy inference system is expandable because in this system, trust can be defined as a set of one or more personality attributes. Epinions social network dataset is also used to simulate and validate the proposed method. In the proposed method, the absolute mean value of error is less than 0.0095 and the value of F-score is more than 0.9884. Based on the obtained results and compared to the previous methods, the proposed adaptive neuro-fuzzy inference system shows an acceptable accuracy for evaluating the trustworthiness of users. تفاصيل المقالة

Provision of high-quality services to end users in a cost-effective way with minimum energy consumption is one of the main challenges facing cloud service providers. Accordingly, this paper presents an energy-efficient scheduling strategy in a QOS-Aware and cost-effective manner for real-time workflow programs in cloud environment. The proposed approach utilizes dynamic voltage and frequency scaling technique on multi-core nonhomogeneous processors to fill the gaps within time schedule. The aim is to develop an energy-aware strategy which, besides yielding accurate results, maintains the high quality of the delivered services in a standard and financially-rational manner. The proposed scheduling algorithm is compared with other basic strategies in terms of different service quality requirements. The performed experiments demonstrate that the proposed approach outperforms existing methods and can be vowed as a promising scheduling strategy. تفاصيل المقالة

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified machines so that makespan can be minimized. Open shop scheduling problem has very large and complex solution space and so is one of NP-Problems. Till now, different algorithms have been presented for open shop scheduling problem. In this paper, we have used combined genetics algorithm as a strategy for solving scheduling open shop problem and compared proposed algorithm with DGA algorithm. Results show that the proposed algorithm has better effectiveness than DGA algorithm. تفاصيل المقالة

With recent developments in communication technologies, it is possible to access information any time and in any place; however, mobile environments bring forward certain requirements and exclusive challenges including low connection speeds and bandwidth limitations. Thus, we need to consider mobile limitations when using web services. Providing services and limited resource allocation to users and at the same time maintaining performance and quality is a challenging and somewhat difficult task. In this paper, an architecture is introduced and described for showing the mobile agent request process in mobile environments. A mathematical model is introduced for performance analysis; however, the main challenge is the state space explosion in Markov Chain, which complicates the relations. Hence, a model has been suggested using Stochastic Colored Petri Nets that encompasses two sections. A case study performed on mobile networks and the results of implementation are compared with the proposed method. Therefore, by using the proposed method, it is easy to analyze the effect of network limitations and connection methods on performance. تفاصيل المقالة

Job Shop scheduling problem has significant importance in many researching fields such as production management and programming and also combined optimizing. Job Shop scheduling problem includes two sub-problems: machine assignment and sequence operation performing. In this paper combination of particle swarm optimization algorithm (PSO) and gravitational search algorithm (GSA) have been presented for solving Job Shop Scheduling problem with criteria of minimizing the maximal completion time of all the operations, which is denoted by Makespan. In this combined algorithm, first gravitational search algorithm finds best mass with minimum spent time for a job and then particle swarm Optimization algorithm is performed for optimal processing all jobs.experimental results show that proposed algorithm for solving job shop scheduling problem, especially for solving larger problem presents better efficiency. Combined proposed algorithm has been named GSPSO. تفاصيل المقالة

توسعه کاربر نهایی (EUD) یک حوزه تحقیقاتی پویا در علوم کامپیوتر است که بر توانمندسازی کاربران نهایی برای ایجاد و اصلاح نرم‌افزار از طریق رویکردهای مختلف تمرکز دارد و دائماً با روش‌ها و ابزارهای جدید در حال تکامل است. برای افزایش مشارکت کاربر نهایی، پژوهشها، توسعه ابزارهای کاربر پسند برای کاربران نهایی به منظور طراحی رابط کاربری، به علاوۀ کد منبع نهایی که از تجزیه و تحلیل و تبدیل خودکار این رابط کاربری به دست می‌آید، را پیشنهاد می‌کنند. برنامه نویسی زبان طبیعی کنترل شده از ویرایش محدود شده ای از یک زبان طبیعی برای کدنویسی استفاده می کند. این رویکرد دسترسی به برنامه نویسی را از طریق فراهم کردن امکان کدنویسی به زبانی آشنا توسط کاربران نهایی و درعین حال حفظ دقت و وضوح لازم، افزایش می دهد. این پژوهش توسعه زبان CNUIML و تولید یک ویرایشگر برای آن را با استفاده از Xtext بررسی کرده و به خطاهای نحوی و تولید کد مقصد با استفاده از Xtext و Xtend می پردازد. زبان CNUIML برای توصیف رابط های برنامه کاربردی تحت وب، با تمرکز بر نیازهای سیستم و نگرانی های کاربر نهایی مورد بهره بردای قرار می گیرد. برنامه های کاربردی وب از صفحات و فرم های به هم پیوسته تشکیل شده اند که درختی از اشیاء را شکل می دهند. متا مدل یک برنامه وب شامل فرم، فرم فرعی، آیتم داده و محدوده دامنه و نوع مقادیر است. هر برنامه مجموعه ای از فرم ها با انواع مقادیر و دامنه های خاص هر یک است. تفاصيل المقالة