https://reunir.unir.net/handle/123456789/9768 2024-11-20T03:40:33Z https://reunir.unir.net/handle/123456789/9797 A Fault-Tolerant Mobile Computing Model Based On Scalable Replica Sati, Meenakshi; Vikash, Vivek; Bijalwan, Vishwanath; Kumari, Pinki; Raj, Manish; Balodhi, Meenu; Gairola, Priya; Bhaskar Semwal, Vijay The most frequent challenge faced by mobile user is stay connected with online data, while disconnected or poorly connected store the replica of critical data. Nomadic users require replication to store copies of critical data on their mobile machines. Existing replication services do not provide all classes of mobile users with the capabilities they require, which include: the ability for direct synchronization between any two replicas, support for large numbers of replicas, and detailed control over what files reside on their local (mobile) replica. Existing peer-to-peer solutions would enable direct communication, but suffers from dramatic scaling problems in the number of replicas, limiting the number of overall users and impacting performance. Roam is a replication system designed to satisfy the requirements of the mobile user. Roam is based on the Ward Model, replication architecture for mobile environments. Using the Ward Model and new distributed algorithms, Roam provides a scalable replication solution for the mobile user. We describe the motivation, design, and implementation of Roam and report its performance. Replication is extremely important in mobile environments because nomadic users require local copies of important data. Submitted by Administrador Re-UNIR Re-UNIR (reunir@unir.net) on 2020-02-05T11:37:47Z No. of bitstreams: 1 ijimai20142_6_7_pdf_73533.pdf: 541713 bytes, checksum: 8606a0d86a6cf45e70d2a48239d8445a (MD5); Made available in DSpace on 2020-02-05T11:37:47Z (GMT). No. of bitstreams: 1 ijimai20142_6_7_pdf_73533.pdf: 541713 bytes, checksum: 8606a0d86a6cf45e70d2a48239d8445a (MD5) https://reunir.unir.net/handle/123456789/9796 Robust Lossless Semi Fragile Information Protection in Images Dixit, Pushkar; Singh, Nishant; Prakash Gupta, Jay Internet security finds it difficult to keep the information secure and to maintain the integrity of the data. Sending messages over the internet secretly is one of the major tasks as it is widely used for passing the message. In order to achieve security there must be some mechanism to protect the data against unauthorized access. A lossless data hiding scheme is proposed in this paper which has a higher embedding capacity than other schemes. Unlike other schemes that are used for embedding fixed amount of data, the proposed data hiding method is block based approach and it uses a variable data embedding in different blocks which reduces the chances of distortion and increases the hiding capacity of the image. When the data is recovered the original image can be restored without any distortion. Our experimental results indicate that the proposed solution can significantly support the data hiding problem. We achieved good Peak signal-to-noise ratio (PSNR) while hiding large amount of data into smoother regions. Submitted by Administrador Re-UNIR Re-UNIR (reunir@unir.net) on 2020-02-05T10:54:09Z No. of bitstreams: 1 ijimai20142_6_9_pdf_92745.pdf: 736624 bytes, checksum: 9c3175c6a69ca8d74491395c5f1e0084 (MD5); Made available in DSpace on 2020-02-05T10:54:09Z (GMT). No. of bitstreams: 1 ijimai20142_6_9_pdf_92745.pdf: 736624 bytes, checksum: 9c3175c6a69ca8d74491395c5f1e0084 (MD5) https://reunir.unir.net/handle/123456789/9795 Overlap Algorithms in Flexible Job-shop Scheduling Gutiérrez, Celia The flexible Job-shop Scheduling Problem (fJSP) considers the execution of jobs by a set of candidate resources while satisfying time and technological constraints. This work, that follows the hierarchical architecture, is based on an algorithm where each objective (resource allocation, start-time assignment) is solved by a genetic algorithm (GA) that optimizes a particular fitness function, and enhances the results by the execution of a set of heuristics that evaluate and repair each scheduling constraint on each operation. The aim of this work is to analyze the impact of some algorithmic features of the overlap constraint heuristics, in order to achieve the objectives at a highest degree. To demonstrate the efficiency of this approach, experimentation has been performed and compared with similar cases, tuning the GA parameters correctly. Submitted by Administrador Re-UNIR Re-UNIR (reunir@unir.net) on 2020-02-05T09:53:40Z No. of bitstreams: 1 ijimai20142_6_5_pdf_59045.pdf: 1261543 bytes, checksum: 99c0b53045c01dc320643c3355e90a5b (MD5); Made available in DSpace on 2020-02-05T09:53:40Z (GMT). No. of bitstreams: 1 ijimai20142_6_5_pdf_59045.pdf: 1261543 bytes, checksum: 99c0b53045c01dc320643c3355e90a5b (MD5) https://reunir.unir.net/handle/123456789/9794 Our System IDCBR-MAS: from the Modelisation by AUML to the Implementation under JADE Platform Zouhair, Abdelhamid; En-Naimi, El Mokhtar; Amami, Benaissa; Boukachour, Hadhoum; Person, Patrick; Bertelle, Cyrille This paper presents our work in the field of Intelligent Tutoring System (ITS), in fact there is still the problem of knowing how to ensure an individualized and continuous learners follow-up during learning process, indeed among the numerous methods proposed, very few systems concentrate on a real time learners follow-up. Our work in this field develops the design and implementation of a Multi-Agents System Based on Dynamic Case Based Reasoning which can initiate learning and provide an individualized follow-up of learner. This approach involves 1) the use of Dynamic Case Based Reasoning to retrieve the past experiences that are similar to the learner’s traces (traces in progress), and 2) the use of Multi-Agents System. Our Work focuses on the use of the learner traces. When interacting with the platform, every learner leaves his/her traces on the machine. The traces are stored in database, this operation enriches collective past experiences. The traces left by the learner during the learning session evolve dynamically over time; the case-based reasoning must take into account this evolution in an incremental way. In other words, we do not consider each evolution of the traces as a new target, so the use of classical cycle Case Based reasoning in this case is insufficient and inadequate. In order to solve this problem, we propose a dynamic retrieving method based on a complementary similarity measure, named Inverse Longest Common Sub-Sequence (ILCSS). Through monitoring, comparing and analyzing these traces, the system keeps a constant intelligent watch on the platform, and therefore it detects the difficulties hindering progress, and it avoids possible dropping out. The system can support any learning subject. To help and guide the learner, the system is equipped with combined virtual and human tutors. Submitted by Administrador Re-UNIR Re-UNIR (reunir@unir.net) on 2020-02-05T09:30:49Z No. of bitstreams: 1 ijimai20142_6_6_pdf_27403.pdf: 1240400 bytes, checksum: 1fdcc12125021c869b3906c35623e42a (MD5); Made available in DSpace on 2020-02-05T09:30:49Z (GMT). No. of bitstreams: 1 ijimai20142_6_6_pdf_27403.pdf: 1240400 bytes, checksum: 1fdcc12125021c869b3906c35623e42a (MD5) https://reunir.unir.net/handle/123456789/9793 Reconstruction of High Resolution 3D Objects from Incomplete Images and 3D Information Pacheco, Alexander; Bolívar, Holman; Pascual Espada, Jordán; González-Crespo, Rubén To this day, digital object reconstruction is a quite complex area that requires many techniques and novel approaches, in which high-resolution 3D objects present one of the biggest challenges. There are mainly two different methods that can be used to reconstruct high resolution objects and images: passive methods and active methods. This methods depend on the type of information available as input for modeling 3D objects. The passive methods use information contained in the images and the active methods make use of controlled light sources, such as lasers. The reconstruction of 3D objects is quite complex and there is no unique solution- The use of specific methodologies for the reconstruction of certain objects it’s also very common, such as human faces, molecular structures, etc. This paper proposes a novel hybrid methodology, composed by 10 phases that combine active and passive methods, using images and a laser in order to supplement the missing information and obtain better results in the 3D object reconstruction. Finally, the proposed methodology proved its efficiency in two complex topological complex objects. Submitted by Administrador Re-UNIR Re-UNIR (reunir@unir.net) on 2020-02-05T09:03:07Z No. of bitstreams: 1 ijimai20142_6_1_pdf_16808.pdf: 1646312 bytes, checksum: 8ec7375e728da483da7df9dd33774470 (MD5); Made available in DSpace on 2020-02-05T09:03:07Z (GMT). No. of bitstreams: 1 ijimai20142_6_1_pdf_16808.pdf: 1646312 bytes, checksum: 8ec7375e728da483da7df9dd33774470 (MD5) https://reunir.unir.net/handle/123456789/9784 A Hybrid Algorithm for Recognizing the Position of Ezafe Constructions in Persian Texts Noferesti, Samira; Shamsfard, Mehrnoush In the Persian language, an Ezafe construction is a linking element which joins the head of a phrase to its modifiers. The Ezafe in its simplest form is pronounced as –e, but generally not indicated in writing. Determining the position of an Ezafe is advantageous for disambiguating the boundary of the syntactic phrases which is a fundamental task in most natural language processing applications. This paper introduces a framework for combining genetic algorithms with rule-based models that brings the advantages of both approaches and overcomes their problems. This framework was used for recognizing the position of Ezafe constructions in Persian written texts. At the first stage, the rule-based model was applied to tag some tokens of an input sentence. Then, in the second stage, the search capabilities of the genetic algorithm were used to assign the Ezafe tag to untagged tokens using the previously captured training information. The proposed framework was evaluated on Peykareh corpus and it achieved 95.26 percent accuracy. Test results show that this proposed approach outperformed other approaches for recognizing the position of Ezafe constructions. Submitted by Administrador Re-UNIR Re-UNIR (reunir@unir.net) on 2020-01-29T12:38:18Z No. of bitstreams: 1 ijimai20142_6_2_pdf_23890.pdf: 1022351 bytes, checksum: adce857ffe59b0d727675e7c6aef3966 (MD5); Made available in DSpace on 2020-01-29T12:38:18Z (GMT). No. of bitstreams: 1 ijimai20142_6_2_pdf_23890.pdf: 1022351 bytes, checksum: adce857ffe59b0d727675e7c6aef3966 (MD5) https://reunir.unir.net/handle/123456789/9776 Business and Social Behaviour Intelligence Analysis Using PSO Bhaskar, Vinay S; Kumar Singh, Abhishek; Dhruw, Jyoti; Parashar, Anubha; Sharma, Mradula The goal of this paper is to elaborate swarm intelligence for business intelligence decision making and the business rules management improvement. The paper introduces the decision making model which is based on the application of Artificial Neural Networks (ANNs) and Particle Swarm Optimization (PSO) algorithm. Essentially the business spatial data illustrate the group behaviors. The swarm optimization, which is highly influenced by the behavior of creature, performs in group. The Spatial data is defined as data that is represented by 2D or 3D images. SQL Server supports only 2D images till now. As we know that location is an essential part of any organizational data as well as business data: enterprises maintain customer address lists, own property, ship goods from and to warehouses, manage transport flows among their workforce, and perform many other activities. By means to say a lot of spatial data is used and processed by enterprises, organizations and other bodies in order to make the things more visible and self-descriptive. From the experiments, we found that PSO is can facilitate the intelligence in social and business behaviour. Submitted by Administrador Re-UNIR Re-UNIR (reunir@unir.net) on 2020-01-29T11:31:37Z No. of bitstreams: 1 ijimai20142_6_8_pdf_20898.pdf: 500686 bytes, checksum: dd75df878763aab9007877f9adc1fe92 (MD5); Made available in DSpace on 2020-01-29T11:31:37Z (GMT). No. of bitstreams: 1 ijimai20142_6_8_pdf_20898.pdf: 500686 bytes, checksum: dd75df878763aab9007877f9adc1fe92 (MD5) https://reunir.unir.net/handle/123456789/9774 Editor’s Note Herrera Viedma, Enrique 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 issue are based on various topics of interest, among which are included: 3D image reconstruction, Persian texts, usability evaluation methods, user experience, oriented matroids, flexible job-shop scheduling, business and social behavior, mobile computing and mobile devices, intelligent tutoring systems and geography optimization. Submitted by Administrador Re-UNIR Re-UNIR (reunir@unir.net) on 2020-01-29T11:17:00Z No. of bitstreams: 1 ijimai20142_6_0_pdf_17943.pdf: 142578 bytes, checksum: a845a9cb401e7a8c74764c9a489fbb94 (MD5); Made available in DSpace on 2020-01-29T11:17:00Z (GMT). No. of bitstreams: 1 ijimai20142_6_0_pdf_17943.pdf: 142578 bytes, checksum: a845a9cb401e7a8c74764c9a489fbb94 (MD5) https://reunir.unir.net/handle/123456789/9773 A REST Service for Triangulation of Point Sets Using Oriented Matroids Valero-Medina, José Antonio; Lizarazo-Salcedo, Ivan This paper describes the implementation of a prototype REST service for triangulation of point sets collected by mobile GPS receivers. The first objective of this paper is to test functionalities of an application, which exploits mobile devices’ capabilities to get data associated with their spatial location. A triangulation of a set of points provides a mechanism through which it is possible to produce an accurate representation of spatial data. Such triangulation may be used for representing surfaces by Triangulated Irregular Networks (TINs), and for decomposing complex two-dimensional spatial objects into simpler geometries. The second objective of this paper is to promote the use of oriented matroids for finding alternative solutions to spatial data processing and analysis tasks. This study focused on the particular case of the calculation of triangulations based on oriented matroids. The prototype described in this paper used a wrapper to integrate and expose several tools previously implemented in C++. Submitted by Administrador Re-UNIR Re-UNIR (reunir@unir.net) on 2020-01-29T10:58:04Z No. of bitstreams: 1 ijimai20142_6_4_pdf_14209.pdf: 1037055 bytes, checksum: 1db110570191aced8d8e7a7d12571831 (MD5); Made available in DSpace on 2020-01-29T10:58:04Z (GMT). No. of bitstreams: 1 ijimai20142_6_4_pdf_14209.pdf: 1037055 bytes, checksum: 1db110570191aced8d8e7a7d12571831 (MD5) https://reunir.unir.net/handle/123456789/9769 Usability Evaluation Methods for Special Interest Internet Information Services Schön, Eva-Maria; Hellmers, Jens; Thomaschewski, Jörg The internet provides a wide range of scientific information for different areas of research, used by the related scientific communities. Often the design or architecture of these web pages does not correspond to the mental model of their users. As a result the wanted information is difficult to find. Methods established by Usability Engineering and User Experience can help to increase the appeal of scientific internet information services by analyzing the users’ requirements. This paper describes a procedure to analyze and optimize scientific internet information services that can be accomplished with relatively low effort. It consists of a combination of methods that already have been successfully applied to practice: Personas, usability inspections, Online Questionnaire, Kano model and Web Analytics. Submitted by Administrador Re-UNIR Re-UNIR (reunir@unir.net) on 2020-01-28T13:18:47Z No. of bitstreams: 1 ijimai20142_6_3_pdf_14574.pdf: 471429 bytes, checksum: fe1b2e9b8823bf8aac9525ca52949402 (MD5); Made available in DSpace on 2020-01-28T13:18:47Z (GMT). No. of bitstreams: 1 ijimai20142_6_3_pdf_14574.pdf: 471429 bytes, checksum: fe1b2e9b8823bf8aac9525ca52949402 (MD5)