Search Results/Filters    

Filters

Year

Banks



Expert Group



Full-Text


Issue Info: 
  • Year: 

    2015
  • Volume: 

    1
Measures: 
  • Views: 

    149
  • Downloads: 

    83
Abstract: 

GROWTH OF SOCIAL NETWORK ANALYSIS AS AN ACADEMIC FIELD HAS COINCIDED WITH AN EXPLOSION IN POPULAR INTEREST IN SOCIAL NETWORKS. EXPERT FINDING IS ONE OF THE MOST IMPORTANT SUBJECTS FOR MINING FROM SOCIAL NETWORKS SEARCHING FOR THE RIGHT PERSONS WITH THE APPROPRIATE SKILLS AND KNOWLEDGE. THE RLS ALGORITHM EXPLOITED Q-Learning AND REFERRALS TO FIND EXPERTS IN SOCIAL NETWORK TO SEARCH EXPERT IN SOCIAL NETWORK. COMPARISON OF RLS WITH SIMPLE SEARCH ALGORITHM, REFERRAL ALGORITHM AND SNPAGERANK SHOWS INCREASE IN BOTH PRECISION AND RECALL. RLS LEARNS TO FIND NEW EXPERTS AS OLD EXPERTS SUBSTITUTE THEIR ROLE WITH NEW ONES DUE TO CHANGES IN SOCIAL NETWORK ENVIRONMENT.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 149

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 83
Journal: 

ELECTRONIC INDUSTRIES

Issue Info: 
  • Year: 

    2019
  • Volume: 

    10
  • Issue: 

    1
  • Pages: 

    61-72
Measures: 
  • Citations: 

    0
  • Views: 

    716
  • Downloads: 

    0
Abstract: 

The efficiency of networks on chip (NoC) is affected by related routing algorithms. Network congestion has a negative impact on the performance of on-chip networks due to the increased packet latency. One of the key objectives design of NoC is reliability against failure. For a NoC to be robust, achieving better performance, and tolerating faults, two key functions need to be investigated: (a) the ability to avoid congested paths and balancing the traffic workloads, and (b) the ability to tolerate faults as well as proceeding to provide system functionality against physical impairment. For this purpose, a cost model for route selection with greater reliability and less congestion has been proposed. In this model, at first a congestion-aware routing algorithm is deployed based on the Q-Learning approach to check congested areas in the network, then adjacent links are considered to deal with reliability. Finally, given the importance of the reliability, high weight is assigned to this parameter, and the path with the lowest cost is selected to forward packets. Simulation results show that the proposed approach outperforms state-of-the-art Bi-LCQ algorithm under two traffic patterns.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 716

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button