<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>vol. 4, nº 6, december 2017</title>
<link>https://reunir.unir.net/handle/123456789/11818</link>
<description/>
<pubDate>Mon, 04 Nov 2024 18:25:35 GMT</pubDate>
<dc:date>2024-11-04T18:25:35Z</dc:date>
<item>
<title>IJIMAI Editor's Note - Vol. 4 Issue 6</title>
<link>https://reunir.unir.net/handle/123456789/11838</link>
<description>IJIMAI Editor's Note - Vol. 4 Issue 6
Verdú, Elena
The International Journal of Interactive Multimedia and Artificial Intelligence provides an interdisciplinary forum in which scientists and professionals can share their research results and report new advances on Artificial Intelligence and Interactive Multimedia techniques. The research works presented in this regular issue are based on various topics of interest, among which are included: nature inspired optimization algorithms, multi-agent systems, fast motion estimation, handwritten recognition, supervised and unsupervised machine learning methods, or web mining.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-13T11:30:41Z
No. of bitstreams: 1
ijimai20174_6_0_pdf_12161.pdf: 147971 bytes, checksum: c5a7d2b3e319393a8721eb48888c6806 (MD5); Made available in DSpace on 2021-09-13T11:30:41Z (GMT). No. of bitstreams: 1
ijimai20174_6_0_pdf_12161.pdf: 147971 bytes, checksum: c5a7d2b3e319393a8721eb48888c6806 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11838</guid>
</item>
<item>
<title>A System to Generate SignWriting for Video Tracks Enhancing Accessibility of Deaf People</title>
<link>https://reunir.unir.net/handle/123456789/11837</link>
<description>A System to Generate SignWriting for Video Tracks Enhancing Accessibility of Deaf People
González-Crespo, Rubén; Pelayo García-Bustelo, B. Cristina; Verdú, Elena; Martínez, M A
Video content has increased much on the Internet during last years. In spite of the efforts of different organizations and governments to increase the accessibility of websites, most multimedia content on the Internet is not accessible. This paper describes a system that contributes to make multimedia content more accessible on the Web, by automatically translating subtitles in oral language to SignWriting, a way of writing Sign Language. This system extends the functionality of a general web platform that can provide accessible web content for different needs. This platform has a core component that automatically converts any web page to a web page compliant with level AA of WAI guidelines. Around this core component, different adapters complete the conversion according to the needs of specific users. One adapter is the Deaf People Accessibility Adapter, which provides accessible web content for the Deaf, based on SignWritting. Functionality of this adapter has been extended with the video subtitle translator system. A first prototype of this system has been tested through different methods including usability and accessibility tests and results show that this tool can enhance the accessibility of video content available on the Web for Deaf people.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-13T11:17:15Z&#13;
No. of bitstreams: 1&#13;
ijimai20174_6_15_pdf_19885.pdf: 509388 bytes, checksum: bc6be8da5a02719f674e16c04bab1b44 (MD5); Made available in DSpace on 2021-09-13T11:17:15Z (GMT). No. of bitstreams: 1&#13;
ijimai20174_6_15_pdf_19885.pdf: 509388 bytes, checksum: bc6be8da5a02719f674e16c04bab1b44 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11837</guid>
</item>
<item>
<title>Design and Evaluation of a Short Version of the User Experience Questionnaire (UEQ-S)</title>
<link>https://reunir.unir.net/handle/123456789/11836</link>
<description>Design and Evaluation of a Short Version of the User Experience Questionnaire (UEQ-S)
Schrepp, Martin; chewski, Jörg Thomas; Hinderks, Andreas
The user experience questionnaire (UEQ) is a widely used questionnaire to measure the subjective impression of users towards the user experience of products. The UEQ is a semantic differential with 26 items. Filling out the UEQ takes approximately 3-5 minutes, i.e. the UEQ is already reasonably efficient concerning the time required to answer all items. However, there exist several valid application scenarios, where filling out the entire UEQ appears impractical. This paper deals with the creation of an 8 item short version of the UEQ, which is optimized for these specific application scenarios. First validations of this short version are also described.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-13T10:56:52Z
No. of bitstreams: 1
ijimai20174_6_14_pdf_20309.pdf: 457030 bytes, checksum: bc76f2abf4aa050ebab15c606d08c73d (MD5); Made available in DSpace on 2021-09-13T10:56:52Z (GMT). No. of bitstreams: 1
ijimai20174_6_14_pdf_20309.pdf: 457030 bytes, checksum: bc76f2abf4aa050ebab15c606d08c73d (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11836</guid>
</item>
<item>
<title>Segmentation of Arabic Handwritten Documents into Text Lines using Watershed Transform</title>
<link>https://reunir.unir.net/handle/123456789/11835</link>
<description>Segmentation of Arabic Handwritten Documents into Text Lines using Watershed Transform
Boulid, Youssef; Souhar, Abdelghani; Ouagague, Mly.; Ameur, E
A crucial task in character recognition systems is the segmentation of the document into text lines and especially if it is handwritten. When dealing with non-Latin document such as Arabic, the challenge becomes greater since in addition to the variability of writing, the presence of diacritical points and the high number of ascender and descender characters complicates more the process of the segmentation. To remedy with this complexity and even to make this difficulty an advantage since the focus is on the Arabic language which is semi-cursive in nature, a method based on the Watershed Transform technique is proposed. Tested on «Handwritten Arabic Proximity Datasets» a segmentation rate of 93% for a 95% of matching score is achieved.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-13T10:51:23Z
No. of bitstreams: 1
ijimai20174_6_13_pdf_11239.pdf: 1353036 bytes, checksum: ffcce3415d0c31442b4104c5c76f7780 (MD5); Made available in DSpace on 2021-09-13T10:51:23Z (GMT). No. of bitstreams: 1
ijimai20174_6_13_pdf_11239.pdf: 1353036 bytes, checksum: ffcce3415d0c31442b4104c5c76f7780 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11835</guid>
</item>
<item>
<title>Smart Algorithms to Control a Variable Speed Wind Turbine</title>
<link>https://reunir.unir.net/handle/123456789/11834</link>
<description>Smart Algorithms to Control a Variable Speed Wind Turbine
Farhane, Nabil; Boumhidi, Ismail; Boumhidi, Jaouad
In this paper, a robust adaptive fuzzy neural network sliding mode (AFNNSM) control design is proposed to maximize the captured energy for a variable speed wind turbine and to minimize the efforts of the drive shaft. Fuzzy neural network (FNN) is used to improve the mathematical system model, by the prediction of model unknown function, which is used by the Sliding mode control approach (SMC) and enables a lower switching gain to be used despite the presence of large uncertainties. As a result, the used robust control action did not exhibit any chattering behavior. This FNN is trained on-line using the backpropagation algorithm (BP). The particle swarm optimization (PSO) algorithm is used in this study to optimize the learning rate of BP algorithm in order to improve the network performance in term of the speed of convergence. The stability is shown by the Lyapunov theory and the trajectory tracking errors converge to zero without any oscillatory behavior. Simulations illustrate the effectiveness of the designed method.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-13T10:43:59Z
No. of bitstreams: 1
ijimai20174_6_12_pdf_81478.pdf: 1496037 bytes, checksum: f1e3ef80abdee2cdabe29b7c46f95756 (MD5); Made available in DSpace on 2021-09-13T10:43:59Z (GMT). No. of bitstreams: 1
ijimai20174_6_12_pdf_81478.pdf: 1496037 bytes, checksum: f1e3ef80abdee2cdabe29b7c46f95756 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11834</guid>
</item>
<item>
<title>Workforce Optimization for Bank Operation Centers: A Machine Learning Approach</title>
<link>https://reunir.unir.net/handle/123456789/11833</link>
<description>Workforce Optimization for Bank Operation Centers: A Machine Learning Approach
Serengil, Sefik Ilkin; Ozpinar, Alper
Online Banking Systems evolved and improved in recent years with the use of mobile and online technologies, performing money transfer transactions on these channels can be done without delay and human interaction, however commercial customers still tend to transfer money on bank branches due to several concerns. Bank Operation Centers serve to reduce the operational workload of branches. Centralized management also offers personalized service by appointed expert employees in these centers. Inherently, workload volume of money transfer transactions changes dramatically in hours. Therefore, work-force should be planned instantly or early to save labor force and increase operational efficiency. This paper introduces a hybrid multi stage approach for workforce planning in bank operation centers by the application of supervised and unsu-pervised learning algorithms. Expected workload would be predicted as supervised learning whereas employees are clus-tered into different skill groups as unsupervised learning to match transactions and proper employees. Finally, workforce optimization is analyzed for proposed approach on production data.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-13T10:14:09Z
No. of bitstreams: 1
ijimai20174_6_11_pdf_19584.pdf: 815676 bytes, checksum: 43290b32a9ba0d1337a9b70ad38cf8d9 (MD5); Made available in DSpace on 2021-09-13T10:14:09Z (GMT). No. of bitstreams: 1
ijimai20174_6_11_pdf_19584.pdf: 815676 bytes, checksum: 43290b32a9ba0d1337a9b70ad38cf8d9 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11833</guid>
</item>
<item>
<title>Supporting Multi-agent Coordination and Computational Collective Intelligence in Enterprise 2.0 Platform</title>
<link>https://reunir.unir.net/handle/123456789/11832</link>
<description>Supporting Multi-agent Coordination and Computational Collective Intelligence in Enterprise 2.0 Platform
Taghezout, Noria; Reguieg, Seddik
In this paper, we propose a novel approach utilizing a professional Social network (Pro Social Network) and a new coordination protocol (CordiNet). Our motivation behind this article is to convince Small and Medium Enterprises managers that current organizations have chosen to use Enterprise 2.0 tools because these latter have demonstrated remarkable innovation as well as successful collaboration and collective intelligence. The particularity of our work is that is allows employer to share diagnosis and fault repair procedures on the basis of some modeling agents. In fact, each enterprise is represented by a container of agents to ensure a secured and confidential information exchange between intra employers, and a central main container to connect all enterprises’ containers for a social information exchange. Enterprise’s container consists of a Checker Enterprise Agent (ChEA), a Coordinator Enterprise Agent (CoEA) and a Search Enterprise Agent (SeEA). Whereas the central main container comprises its proper agents such as Selection Agent (SA), and a Supervisor Agent (SuA). JADE platform is used to allow agents to communicate and collaborate. The FIPA-ACL performatives have been extended for this purpose. We conduct some experiments to demonstrate the feasibility of our approach.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-13T10:08:53Z
No. of bitstreams: 1
ijimai20174_6_10_pdf_13892.pdf: 2147249 bytes, checksum: d940e70e5881c9b47c6583531959eba7 (MD5); Made available in DSpace on 2021-09-13T10:08:53Z (GMT). No. of bitstreams: 1
ijimai20174_6_10_pdf_13892.pdf: 2147249 bytes, checksum: d940e70e5881c9b47c6583531959eba7 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11832</guid>
</item>
<item>
<title>Combining Fuzzy AHP with GIS and Decision Rules for Industrial Site Selection</title>
<link>https://reunir.unir.net/handle/123456789/11831</link>
<description>Combining Fuzzy AHP with GIS and Decision Rules for Industrial Site Selection
Taibi, Aissa; Atmani, Baghdad
This study combines Fuzzy Analytic Hierarchy Process (FAHP), Geographic Information System (GIS) and Decision rules to provide decision makers with a ranking model for industrial sites in Algeria. A ranking of the suitable industrial areas is a crucial multi-criteria decision problem based on socio-economical and technical criteria as on environmental considerations. Fuzzy AHP is used for assessment of the candidate industrial sites by combining fuzzy set theory and analytic hierarchy process (AHP). The decision rule base serves as a filter that performs criteria pre-treatment involving a reduction of their numbers. GIS is used to overlay, generate criteria maps and for visualizing ranked zones on the map. The rank of a zone so obtained is an index that guides decision-makers to the best utilization of the zone in future.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-13T10:03:15Z
No. of bitstreams: 1
ijimai20174_6_9_pdf_25718.pdf: 2057289 bytes, checksum: 2cdd1ca51b0dd44f43624715f32ec2e2 (MD5); Made available in DSpace on 2021-09-13T10:03:15Z (GMT). No. of bitstreams: 1
ijimai20174_6_9_pdf_25718.pdf: 2057289 bytes, checksum: 2cdd1ca51b0dd44f43624715f32ec2e2 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11831</guid>
</item>
<item>
<title>Anomaly based Intrusion Detection using Modified Fuzzy Clustering</title>
<link>https://reunir.unir.net/handle/123456789/11826</link>
<description>Anomaly based Intrusion Detection using Modified Fuzzy Clustering
Harish, B S; Kumar, S V A
This paper presents a network anomaly detection method based on fuzzy clustering. Computer security has become an increasingly vital field in computer science in response to the proliferation of private sensitive information. As a result, Intrusion Detection System has become an indispensable component of computer security. The proposed method consists of three steps: Pre-Processing, Feature Selection and Clustering. In pre-processing step, the duplicate samples are eliminated from the sample set. Next, principal component analysis is adopted to select the most discriminative features. In clustering step, the network samples are clustered using Robust Spatial Kernel Fuzzy C-Means (RSKFCM) algorithm. RSKFCM is a variant of traditional Fuzzy C-Means which considers the neighbourhood membership information and uses kernel distance metric. To evaluate the proposed method, we conducted experiments on standard dataset and compared the results with state-of-the-art methods. We used cluster validity indices, accuracy and false positive rate as performance metrics. Experimental results inferred that, the proposed method achieves better results compared to other methods.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-10T10:48:18Z
No. of bitstreams: 1
ijimai20174_6_8_pdf_14933.pdf: 892561 bytes, checksum: 8609d74a869467482d52129a57756be0 (MD5); Made available in DSpace on 2021-09-10T10:48:18Z (GMT). No. of bitstreams: 1
ijimai20174_6_8_pdf_14933.pdf: 892561 bytes, checksum: 8609d74a869467482d52129a57756be0 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11826</guid>
</item>
<item>
<title>Heuristics Considering UX and Quality Criteria for Heuristics</title>
<link>https://reunir.unir.net/handle/123456789/11825</link>
<description>Heuristics Considering UX and Quality Criteria for Heuristics
Schön, Eva-Maria; Thomaschewski, Jörg; Bader, Frederik
Heuristic evaluation is a cheap tool with which one can take qualitative measures of a product’s usability. However, since the methodology was first presented, the User Experience (UX) has become more popular but the heuristics have remained the same. In this paper, we analyse the current state of heuristic evaluation in terms of heuristics for measuring the UX. To do so, we carried out a literature review. In addition, we had a look at different heuristics and mapped them with the UX dimensions of the User Experience Questionnaire (UEQ). Moreover, we proposed a quality model for heuristic evaluation and a list of quality criteria for heuristics.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-10T10:38:40Z&#13;
No. of bitstreams: 1&#13;
ijimai20174_6_7_pdf_74071.pdf: 438337 bytes, checksum: ec06a6b8ded9a8a8adba84030672a4ba (MD5); Made available in DSpace on 2021-09-10T10:38:40Z (GMT). No. of bitstreams: 1&#13;
ijimai20174_6_7_pdf_74071.pdf: 438337 bytes, checksum: ec06a6b8ded9a8a8adba84030672a4ba (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11825</guid>
</item>
<item>
<title>A Topic Modeling Guided Approach for Semantic Knowledge Discovery in e-Commerce</title>
<link>https://reunir.unir.net/handle/123456789/11824</link>
<description>A Topic Modeling Guided Approach for Semantic Knowledge Discovery in e-Commerce
Anoop, V S; Asharaf, S
The task of mining large unstructured text archives, extracting useful patterns and then organizing them into a knowledgebase has attained a great attention due to its vast array of immediate applications in business. Businesses thus demand new and efficient algorithms for leveraging potentially useful patterns from heterogeneous data sources that produce huge volumes of unstructured data. Due to the ability to bring out hidden themes from large text repositories, topic modeling algorithms attained significant attention in the recent past. This paper proposes an efficient and scalable method which is guided by topic modeling for extracting concepts and relationships from e-commerce product descriptions and organizing them into knowledgebase. Semantic graphs can be generated from such a knowledgebase on which meaning aware product discovery experience can be built for potential buyers. Extensive experiments using proposed unsupervised algorithms with e-commerce product descriptions collected from open web shows that our proposed method outperforms some of the existing methods of leveraging concepts and relationships so that efficient knowledgebase construction is possible.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-10T10:03:40Z
No. of bitstreams: 1
ijimai20174_6_6_pdf_86078.pdf: 855397 bytes, checksum: 73bde5096266e8180b4adc9ba7893928 (MD5); Made available in DSpace on 2021-09-10T10:03:40Z (GMT). No. of bitstreams: 1
ijimai20174_6_6_pdf_86078.pdf: 855397 bytes, checksum: 73bde5096266e8180b4adc9ba7893928 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11824</guid>
</item>
<item>
<title>N-grams Based Supervised Machine Learning Model for Mobile Agent Platform Protection against Unknown Malicious Mobile Agents</title>
<link>https://reunir.unir.net/handle/123456789/11823</link>
<description>N-grams Based Supervised Machine Learning Model for Mobile Agent Platform Protection against Unknown Malicious Mobile Agents
Bagga, Pallavi; Hans, Rahul; Sharma, Vipul
From many past years, the detection of unknown malicious mobile agents before they invade the Mobile Agent Platform has been the subject of much challenging activity. The ever-growing threat of malicious agents calls for techniques for automated malicious agent detection. In this context, the machine learning (ML) methods are acknowledged more effective than the Signature-based and Behavior-based detection methods. Therefore, in this paper, the prime contribution has been made to detect the unknown malicious mobile agents based on n-gram features and supervised ML approach, which has not been done so far in the sphere of the Mobile Agents System (MAS) security. To carry out the study, the n-grams ranging from 3 to 9 are extracted from a dataset containing 40 malicious and 40 non-malicious mobile agents. Subsequently, the classification is performed using different classifiers. A nested 5-fold cross validation scheme is employed in order to avoid the biasing in the selection of optimal parameters of classifier. The observations of extensive experiments demonstrate that the work done in this paper is suitable for the task of unknown malicious mobile agent detection in a Mobile Agent Environment, and also adds the ML in the interest list of researchers dealing with MAS security.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-10T09:51:53Z
No. of bitstreams: 1
ijimai20174_6_5_pdf_30833.pdf: 1429461 bytes, checksum: 45aa6e8dd850207a23654d5b48998143 (MD5); Made available in DSpace on 2021-09-10T09:51:53Z (GMT). No. of bitstreams: 1
ijimai20174_6_5_pdf_30833.pdf: 1429461 bytes, checksum: 45aa6e8dd850207a23654d5b48998143 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11823</guid>
</item>
<item>
<title>Multi-agent Systems for Arabic Handwriting Recognition</title>
<link>https://reunir.unir.net/handle/123456789/11822</link>
<description>Multi-agent Systems for Arabic Handwriting Recognition
Boulid, Youssef; Souhar, Abdelghani; Elyoussfi Elkettani, Mohamed
This paper aims to give a presentation of the PhD defended by Boulid Youssef on December 26th, 2016 at University Ibn Tofail, entitled “Arabic handwritten recognition in an offline mode”. The adopted approach is realized under the multi agent paradigm. The dissertation was held in Faculty of Science Kénitra in a publicly open presentation. After the presentation, Boulid was awarded with the highest grade (Très honorable avec félicitations de jury).
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-10T09:42:40Z
No. of bitstreams: 1
ijimai20174_6_4_pdf_18367.pdf: 254854 bytes, checksum: 5c3871677035a3a73992fdc60c8d8763 (MD5); Made available in DSpace on 2021-09-10T09:42:40Z (GMT). No. of bitstreams: 1
ijimai20174_6_4_pdf_18367.pdf: 254854 bytes, checksum: 5c3871677035a3a73992fdc60c8d8763 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11822</guid>
</item>
<item>
<title>A Novel Hybrid Approach for Fast Block Based Motion Estimation</title>
<link>https://reunir.unir.net/handle/123456789/11821</link>
<description>A Novel Hybrid Approach for Fast Block Based Motion Estimation
Arora, Shaifali; Khanna, Kavita; Rajpal, Navin
The current work presents a novel hybrid approach for motion estimation of various video sequences with a purpose to speed up the entire process without affecting the accuracy. The method integrates the dynamic Zero motion pre-judgment (ZMP) technique with Initial search centers (ISC) along with half way search termination and Small diamond search pattern. Calculation of the initial search centers has been shifted after the process of zero motion pre-judgment unlike most the previous approaches so that the search centers for stationary blocks need not be identified. Proper identification of ISC dismisses the need to use any fast block matching algorithm (BMA) to find the motion vectors (MV), rather a fixed search pattern such as small diamond search pattern is sufficient to use. Half way search termination has also been incorporated into the algorithm which helps in deciding whether the predicted ISC is the actual MV or not which further reduced the number of computations. Simulation results of the complete hybrid approach have been compared to other standard methods in the field. The method presented in the manuscript ensures better video quality with fewer computations.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-10T09:03:57Z
No. of bitstreams: 1
ijimai20174_6_3_pdf_76601.pdf: 1871630 bytes, checksum: ee27d175a812428bf1021e57fad48cc2 (MD5); Made available in DSpace on 2021-09-10T09:03:57Z (GMT). No. of bitstreams: 1
ijimai20174_6_3_pdf_76601.pdf: 1871630 bytes, checksum: ee27d175a812428bf1021e57fad48cc2 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11821</guid>
</item>
<item>
<title>A Solution Generator Algorithm for Decision Making based Automated Negotiation in the Construction Domain</title>
<link>https://reunir.unir.net/handle/123456789/11820</link>
<description>A Solution Generator Algorithm for Decision Making based Automated Negotiation in the Construction Domain
Mahmoud, Moamin; Ahmad, Mohd Sharifuddin; Idrus, Arazi; Yahya, Azani; Husen, Hapsa
In this paper, we present our work-in-progress of a proposed framework for automated negotiation in the construction domain. The proposed framework enables software agents to conduct negotiations and autonomously make value-based decisions. The framework consists of three main components which are, solution generator algorithm, negotiation algorithm, and conflict resolution algorithm. This paper extends the discussion on the solution generator algorithm that enables software agents to generate solutions and rank them from 1st to nth solution for the negotiation stage of the operation. The solution generator algorithm consists of three steps which are, review solutions, rank solutions, and form ranked solutions. For validation purpose, we present a scenario that utilizes the proposed algorithm to rank solutions. The validation shows that the algorithm is promising, however, it also highlights the conflict between different parties that needs further negotiation action.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-10T08:15:29Z
No. of bitstreams: 1
ijimai20174_6_2_pdf_84357.pdf: 1197109 bytes, checksum: 4733f9742396fe97686c9256c5442711 (MD5); Made available in DSpace on 2021-09-10T08:15:29Z (GMT). No. of bitstreams: 1
ijimai20174_6_2_pdf_84357.pdf: 1197109 bytes, checksum: 4733f9742396fe97686c9256c5442711 (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11820</guid>
</item>
<item>
<title>Nature Inspired Range Based Wireless Sensor Node Localization Algorithms</title>
<link>https://reunir.unir.net/handle/123456789/11819</link>
<description>Nature Inspired Range Based Wireless Sensor Node Localization Algorithms
Arora, Sankalap; Kaur, Ranjit
Localization is one of the most important factors highly desirable for the performance of Wireless Sensor Network (WSN). Localization can be stated as the estimation of the location of the sensor nodes in sensor network. In the applications of WSN, the data gathered at sink node will be meaningless without localization information of the nodes. Due to size and complexity factors of the localization problem, it can be formulated as an optimization problem and thus can be approached with optimization algorithms. In this paper, the nature inspired algorithms are used and analyzed for an optimal estimation of the location of sensor nodes. The performance of the nature inspired algorithms viz. Flower pollination algorithm (FPA), Firefly algorithm (FA), Grey Wolf Optimization (GWO) and Particle Swarm Optimization (PSO) for localization in WSN is analyzed in terms of localization accuracy, number of localized nodes and computing time. The comparative analysis has shown that FPA is more proficient in determining&#13;
the coordinates of nodes by minimizing the localization error as compared to FA, PSO and GWO.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-09-10T07:48:10Z
No. of bitstreams: 1
ijimai20174_6_1_pdf_64773.pdf: 5349860 bytes, checksum: 3dd346a6f5c9dec7e98d980163d4170c (MD5); Made available in DSpace on 2021-09-10T07:48:11Z (GMT). No. of bitstreams: 1
ijimai20174_6_1_pdf_64773.pdf: 5349860 bytes, checksum: 3dd346a6f5c9dec7e98d980163d4170c (MD5)
</description>
<guid isPermaLink="false">https://reunir.unir.net/handle/123456789/11819</guid>
</item>
</channel>
</rss>
