دانلود و نمایش مقالات مرتبط با Graph coloring::صفحه 1
دانلود بهترین مقالات isi همراه با ترجمه فارسی 2
نتیجه جستجو - Graph coloring

تعداد مقالات یافته شده: 6
ردیف عنوان نوع
1 Towards a distributed local-search approach for partitioning large-scale social networks
به سمت یک جستجوی محلی توزیع شده برای پارتیشن بندی شبکه های اجتماعی در مقیاس بزرگ-2020
Large-scale social graph data poses significant challenges for social analytic tools to mon- itor and analyze social networks. A feasible solution is to parallelize the computation and leverage distributed graph computing frameworks to process such big data. However, it is nontrivial to partition social graphs into multiple parts so that they can be computed on distributed platforms. In this paper, we propose a distributed local search algorithm, named dLS, which enables quality and efficient partition of large-scale social graphs. With the vertex-centric computing model, dLS can achieve massive parallelism. We employ a distributed graph coloring strategy to differentiate neighbor nodes and avoid interference during the parallel execution of each vertex. We convert the original graph into a small graph, Quotient Network , and obtain local search solution from processing the Quotient Net- work , thus further improving the partition quality and efficiency of dLS. We have evaluated the performance of dLS experimentally using real-life and synthetic social graphs, and the results show that dLS outperforms two state-of-the-art algorithms in terms of partition quality and efficiency.
Keywords: Graph partitioning | Social network | Local search algorithm
مقاله انگلیسی
2 Real-time data text mining based on Gravitational Search Algorithm
داده کاوی متن در زمان واقعی بر اساس الگوریتم جستجوی گرانشی-2019
Short messages are one of the milestones on the web especially on social media (SM). Due to the widespread circulation of SM, it already turns into excessively painful capturing outmost relevant and significant information for certain users. One of the main motivations of this work is that many users may need an inclusive brief of all comments without reading the entire list of short messages for deci- sion making. In this work, mining in big social media data is formulated for the first time into a multi- objective optimization (MOO) task to extract the essence of a text. Since some users may demand the brief at any moment, several groups of dissimilar short messages are established based on graph coloring mechanism. Six interesting feature are formalized to exhibit more interactive messages. A Gravitational Search Algorithm (GSA) is employed to satisfy several important objectives for generating a concise sum- mary. The problem was picked by using the Normal Boundary Intersection (NBI) mechanism to trade-offamong different features. Additionally, to satisfy real-time needs, an inventive incremental grouping task is modelled to update the existing colors. From exhaustive experimental results, the proposed approach outperformed other strong comparative methods.
Keywords: Data text mining | Swarm Intelligence | Big-data | Gravitational search algorithm | Normal boundary intersection
مقاله انگلیسی
3 Delay sensitive and power-aware SMDP-based connection admission control mechanism in cognitive radio sensor networks
مکانیسم کنترل اتصال ورودی مبتنی بر SMDP با حساسیت و توان قدرت در شبکه های حسگر رادیو شناختی -2017
Due to the opportunistically resource usage of users in cognitive radio sensor networks (CRSNs), the avail ability of network resources is highly variable. Therefore, admission control is an essential mechanism to manage the traffic of cognitive radio users in order to satisfy the quality of service (QoS) requirements of applications. In this study, a connection admission control (CAC) mechanism is introduced to satisfy the requirements of delay sensitivity and power consumption awareness. This proposed mechanism is mod eled through a semi Markov decision process (SMDP) and a linear programming problem is derived with the aim of obtaining the optimal policy to control the traffic of CRSNs and achieving maximum reward. The number of required channels at each network state is estimated through a graph coloring approach. An end to end delay constraint is defined for the optimization problem which is inspired from Klein rock independence approximation. Furthermore, a power-aware weighting method is proposed for this mechanism. We conduct different simulation-based scenarios to investigate the performance of the pro posed mechanism. The experimental results demonstrate the efficiency of this SMDP-based mechanism in comparison to the last CAC mechanism in CRSNs.
Keywords: Cognitive radio sensor networks (CRSNs) | Admission control | Quality of service (QoS) | Semi Markov decision process (SMDP) | Graph coloring | Kleinrock independence approximation
مقاله انگلیسی
4 Graph coloring and ACO based summarization for social networks
رنگ آمیزی نمودار و خلاصه مبتنی بر ACO برای شبکه های اجتماعی-2017
Due to the increasing popularity of contents of social media platforms, the number of posts and mes sages is steadily increasing. A huge amount of data is generated daily as an outcome of the interactions between fans of the networking platforms. It becomes extremely troublesome to find the most relevant, interactive information for the subscribers. The aim of this work is to enable the users to get a pow erful brief of comments without reading the entire list. This paper opens up a new field of short text summarization (STS) predicated on a hybrid ant colony optimization coming with a mechanism of local search, called ACO-LS-STS, to produce an optimal or near-optimal summary. Initially, the graph coloring algorithm, called GC-ISTS, was employed before to shrink the solution area of ants to small sets. Evi dently, the main purpose of using the GC algorithm is to make the search process more facilitated, faster and prevents the ants from falling into the local optimum. First, the dissimilar comments are assembled together into the same color, at the same time preserving the information ratio as for an original list of comment. Subsequently, activating the ACO-LS-STS algorithm, which is a novel technique concerning the extraction of the most interactive comments from each color in a parallel form. At the end, the best summary is picked from the best color. This problem is formalized as an optimization problem utiliz ing GC and ACO-LS to generate the optimal solution. Eventually, the proposed algorithm was evaluated and tested over a collection of Facebook messages with their associated comments. Indeed, it was found that the proposed algorithm has an ability to capture a good solution that is guaranteed to be near op timal and had realized notable performance in comparison with traditional document summarization algorithms.
Keywords: Short text summarization | Social networks | Ant colony optimization | Graph coloring | Text mining | Local search
مقاله انگلیسی
5 حل مسئله رنگ آمیزی رئوس با الگوریتم سلولی مورچه
سال انتشار: 2013 - تعداد صفحات فایل pdf انگلیسی: 8 - تعداد صفحات فایل doc فارسی: 13
مسئله ی رنگ آمیزی گراف (GCP) یکی از مسائل بهینه سازی ترکیبی است که بسیار مورد مطالعه قرار گرفته است. شکل ساده ی آن رنگ آمیزی رأس نامیده می شود. که در تئوری و در عمل بسیار مهم است. الگوریتم سلولی مورچه سعی در حل مسئله رنگ آمیزی گراف- رنگ آمیزی رأس دارد. الگوریتم سلولی مورچه یک روش بهینه سازی جدید برای حل مسائل واقعی با استفاده از هردو مورد نقش تکاملی سلولی، تئوری گراف و ویژگی های بهینه سازی کلونی مورچه ها می باشد. مطالعه ی تجربی الگوریتم مورچه سلولی همچنین بر اساس معیارهای چالشی DIMACS انجام شده است. نتایج محاسباتی نشان می دهند که الگوریتم مورچه سلولی برای مسئله ی رنگ آمیزی گراف قابل انجام و قدرتمند است.
واژه های کلیدی: الگوریتم مورچه سلولی | مسئله رنگ آمیزی گراف (GCP) | تئوری گراف | مسئله رنگ آمیزی رنگ (VCP)
مقاله ترجمه شده
6 زمانبندی بدون معطلی برای قفل¬ها
سال انتشار: 0 - تعداد صفحات فایل pdf انگلیسی: 32 - تعداد صفحات فایل doc فارسی: 46
ما مسأله¬ی زمانبندی یک قفل دارای جایگاه¬های موازی را مورد بررسی قرار دادیم. ما نشان دادیم این مسأله به چه نحو با مسائل زمانبندی بازه¬ای شناخته¬شده ارتباط پیدا می¬کند. ما بر وجود زمانبندی¬های بدون معطلی تمرکز نموده و پیچیدگی انواع مختلف اینگونه مسائل را در نظر گرفتیم. بطور خاص برای یک قفل متشکل از دو جایگاه، عملی بودن راه¬حل را آزمودیم و به یک الگوریتم زمان خطی دست یافتیم. ما یک الگوریتم کارآمد برای مواردی که در آن تمامی جایگاه¬های قفل، یکسان باشند نیز ارائه نمودیم. به علاوه، ما یک روش برنامه¬ریزی پویا برای یک مورد کلی با جایگاه¬های دلخواه تعریف نموده و اثبات کردیم که این مسأله زمانیکه تعداد جایگاه¬ها جزو ورودی¬ها باشد، یک مسأله¬ی NP-کامل است.
مقاله ترجمه شده
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 347 :::::::: بازدید دیروز: 9785 :::::::: بازدید کل: 24265 :::::::: افراد آنلاین: 8