@article {763, title = {Learning from Web Searching: Enhancing Users{\textquoteright} Experiences with NaviWeb Mobile System-}, journal = {https://www.dline.info/jdim}, volume = {19}, year = {2021}, month = {12/2021}, pages = {113-124}, type = {Research}, chapter = {113}, doi = {https://doi.org/10.6025/jdim/2021/19/4/113-124}, url = {http://www.dline.info/download.php?sn=3367}, author = {Shaden Al Marshad and Jawad Berri} } @article {777, title = {LCHREP: Layer and Cluster based Hierarchical Routing and Energy Optimization Protocol in Wireless Sensor Networks-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {08/2020}, pages = {139-150}, type = {Research}, chapter = {139}, abstract = {

\ In this work, we propose a new hierarchical routing protocol called LCHREP (Layer and Cluster based Hierarchical Routing and Energy Optimization Protocol) that aims to minimizing energy consumption for wireless sensors network. LCHREP uses clusters formed on a layers and also uses multihop between these different layers. Results of simulations indicate that the proposed protocol allows better remaining energy after clusters heads selection, less amount of energy consumed in terms of sending packets. It allows also to reduce the number of nodes failed, and therefore to keep more nodes alive after sending packets.

}, doi = {https://doi.org/10.6025/jdim/2020/18/4/139-150}, url = {http://dline.info/fpaper/jdim/v18i4/jdimv18i4_2.pdf}, author = {Akli ABBAS and Mourad Amad and Fatma AMOKRANE} } @article {818, title = {A Log Based Update of Replicated Profiles in Decentralized Social Networks-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/2018}, pages = {230-245}, type = {Research}, chapter = {230}, abstract = {

Decentralized Social Networks are proposed to provide more privacy guarantee\  to the users. They avoid storing data in central servers. The profiles are important and critical objects of this type of network. They are stored in the user{\textquoteright}s devices. In order to ensure more availability, every profile is replicated in several devices. The different copies of any given profile stored in different devices are correctly updated with all the writes that happened in any single copy. Since the profiles undergo frequent writes, an important network load is generated during the update process. In this paper, we propose an update model based on the use of a log file to store the writ s. This reduces the size of the data exchanged between the devices storing the same profiles. Simulation results show that the proposed model is globally satisfactory.

}, doi = {https://doi.org/10.6025/jdim/2018/16/5/230-245}, url = {http://dline.info/fpaper/jdim/v16i5/jdimv16i5_3.pdf}, author = {Lyes Badis, and Mourad Amad and Djamil A{\"\i}ssani} } @article {698, title = {A Log Based Update of Replicated Profiles in Decentralized Social Networks}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/2018}, pages = {230-245}, type = {Research}, chapter = {230}, doi = {https://doi.org/10.6025/jdim/2018/5/230-245}, author = {Lyes Badis and Mourad Amad and Djamil A{\"\i}ssani} } @article {438, title = {A leakage monitoring system of pipeline in heating network}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {462 - 469}, abstract = {Supervisory control and data acquisition system (SCADA) is used to monitor the operating data of heating network. But it can do data acquisition and some simple operations only. So in this paper with the data collected by SCADA a leakage monitoring system of pipeline in heating network is designed by the Matble graphical user interface program (GUI). The theoretical basis of this monitoring is the heating network pressure graph theory and the theory of genetic algorithm. With the theory of genetic algorithm the data col-lected by SCADA could be optimized. The optimization avoid the erroneous data which due to measurement error. With the heating network graph theory the leakage monitoring system of pipeline could identify if there is a leakage in the operating conditions in heating pipe network. In the leakage monitoring system, the first step is to collect the initial data which optimized by genetic algorithm as a standard data and these data are stored as a fixed value. After that this system collects the real-time data of heating network and optimizes these data. Finally, the system compares the optimizing real-time data and the fixed value to determine whether there is a leakage. With the experiment the monitoring system which designed in this paper is proved to be very useful in leakage discrimination.}, keywords = {Genetic Algorithm, Heating Network, MATLAB, Pressure Graph}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892175513\&partnerID=40\&md5=1c08ed8b399411798f88e31b5dd14cec}, author = {Xianliang, Y. and Lianlian, J. and Songling, W.} } @article {324, title = {Low overhead geometric on-demand routing protocol for mobile ad hoc networks}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {114 - 120}, abstract = {At present, Mobile Ad Hoc Networks (MANET) have become a hot research field, in view that the mobile nodes have the characteristics of mobility, limited energy, limited storage space and so on. Thus to design a simple and high-efficiency routing protocol is an important issue. AODV routing protocol can resolve the routing problem of Mobile Ad Hoc Networks, but it still has many shortcomings, such that it uses flooding method to broadcast messages and finds the route, which cause heavy network overhead and other problems. In this paper, in order to resolve the low efficiency of simple flooding, we first analyze AODV routing protocol briefly. After that we propose an improved routing broadcast algorithm-GAODV, which aims to restrict the forwarding nodes within a local area through the geometrical routing, and prevent from flooding the control packet in the whole network. Simulation results show that the G-AODV effectively reduces network overhead and the end to end delay. Moreover, it also significantly improves the effectiveness of protocol and the overall performance of the network.}, keywords = {AODV, Flooding, Geometrical routing, Mobile ad hoc network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866448629\&partnerID=40\&md5=1ddb21882f2996c7fdd5e7fbfd1511cb}, author = {Su, C. and Zheng, L. and Si, X. and Shang, F.} } @article {286, title = {Locality preserving scheme of text databases representative in distributed information retrieval systems}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {193 - 198}, abstract = {This paper proposes an efficient and effective "Locality Preserving Mapping" scheme that allows text databases representatives to be mapped onto a global information retrieval system such as Peer-to-Peer Information Retrieval Systems (P2PIR). The proposed approach depends on using Locality Sensitive Hash functions (LSH), and approximate min-wise independent permutations to achieve such task. Experimental evaluation over real data, along with comparison between different proposed schemes (with different parameters) will be presented in order to show the performance advantages of such schemes.}, keywords = {Locality preserving mapping, Peer-to-Peer systems, Text analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855374323\&partnerID=40\&md5=f56ad390368eb3d75500b51f46ddceb5}, author = {Hassan, M. and Al-Lahham, Y.A.} } @article {260, title = {LTSC-128: Stream cipher based on the intractable Shortest Vector Problem in Lattice}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {27 - 32}, abstract = {LTSC-128 is a high secure stream cipher based on the hardness of the Shortest Vector Problem in Lattice space. The cipher is based on vectors multiplication over finite fieldo, wnhoetrerea these vectors are represented by polynomials to enhance the performance of keystream generation. The key size is 128 bits and there is no attack faster than exhaustive key search has been identified. The experimental results showed that the encryption rate of LTSC-128 is about 50Mbit/second. LTSC-128 cTipher co has additional feature that its performance can be inpcrroecaesdedure by applying multithreading technique on multi-core processors. The multithreaded version of LTSC-128 has achieved better encryption rate of 71Mbit/second on dual-core processor.}, keywords = {Encryption, Lattice, Multithreading, NP-hard problem, Shortest Vector Problem, Stream cipher}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960657199\&partnerID=40\&md5=b4fe242766b77ba21be7e3f6815f31d7}, author = {Suwais, K. and Samsudin, A.} } @article {150, title = {Learning transfer rules for machine translation from parallel corpora}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2008}, pages = {285 - 293}, abstract = {In this paper we present JETCAT, a Japanese-English transfer-based machine translation system. Our main research contribution is that the transfer rules are not handcrafted but are learnt automatically from a parallel corpus. The system has been implemented in Amzi! Prolog, which offers scalability for large rule bases, full Unicode support for Japanese characters, and several APIs for the seamless integration of the translation functionality into common office environments. As a first user interface we have developed a translation environment under Microsoft Word. The dynamic nature of our system allows for an easy customization of the rule base according to the user{\textquoteright}s personal preferences by simply post-editing the translation results, which leads to an automatic update. The user interface for Microsoft Word also provides the possibility for the user to display token lists, parse trees, and transfer rules, which makes JETCAT also a very useful tool for language students.}, keywords = {Japanese-English translation, Language transfer rules}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349984013\&partnerID=40\&md5=b27c9c795bbe154aace0b228c131a68e}, author = {Winiwarter, W.} } @article {109, title = {A layered MIMO OFDM system with channel equalization}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {361 - 363}, abstract = {This paper proposes a simple and efficient method for layered MIMO-OFDM system with channel equalization. Temporal variations in the channel are due to Doppler spread, a sign of relative motion between transmitter and receiver. Results are simulated in both Rayleigh channel and additive white Gaussian noise (AWGN) channel. Decision feedback equalizer (DFE) with recursive least square (RLS) algonthm is used for channel equalization. Different type of Layered structure is applied to MIMO-OFDM system and their performance is evaluated. Different modulations schemes are used with same number of transmit and receive antennas. Simulation results are shown for both vertical and horizontal coded layered structure MIMO-OFDM systems with different modulation schemes and different number of transmit antennas.}, keywords = {Graphsdecomposition algorithm, VDM, Vienna development method}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149122041\&partnerID=40\&md5=36ef5a9a09db5af4163b13d382aab433}, author = {Noori, K. and Haider, S.A.} } @article {81, title = {Linguistic decision analysis based technology project assessment}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {142 - 151}, abstract = {The problem considered in this paper is that of selecting, from a set of proposals or a subset of projects to be undertaken. Technology project assessment is influenced by a large number of factors, and many times it is hard to measure them in numbers or an objectively way. This paper addresses this by presenting a method for identifying and assessing key project characteristics, which are crucial for a technology project{\textquoteright}s assessment. Fistly, this paper builds a new set of indicators of technology project assessment after analysing the process of it. Secondly, this paper introduces two aggregation operators in the technology project to deal with two situations of technology project assessment respectively, including linguistic and subjective information and pair comparison of preference relation. The methods consist of a number of well-defined steps, which are described in detail. Finally, examples show that the proposed methods with the linguistic decision analysis are useful and provide an understanding way for the decision maker.}, keywords = {Aggregation operator, Linguistic decision analysis, Project assessment, Technology project management}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350651772\&partnerID=40\&md5=e8ae7484b3a035c6754606f8fb3b691b}, author = {Pang, X.-L. and Feng, Y.-Q. and Wei-Jiang} }