@article {847, title = {A Brief Review of the Automation of Dependency Satisfaction With in Microservices Architectures}, journal = {Journal of Digital information Management}, volume = {22}, year = {2024}, month = {09/2024}, pages = {99-107}, type = {Research}, chapter = {99}, abstract = {

Accelerated advances in network speed, re- liability, and security have increased the demand for soft- ware and services to move from being stored and pro- cessed locally on users{\textquoteright} devices to being managed by third parties that can be accessed through the network. This has led to the need to develop new software archi- tectures and software architectures that meet these new requirements. One example of software architecture is the recent emergence of a microservices architecture to meet online service providers{\textquoteright} maintenance and scalability requirements. Microservices is an architecture style that focuses on breaking down a system into small, lightweight services that are intentionally created to perform a highly cohesive business function, and it is an evolution of the traditional service-oriented architecture style. The practi- cal projection of microservices architecture in informa- tion engineering is several small applications that work together to provide an integrated service that appears to the external medium as a single application. Each of these applications has its own independent source code and deals with data sources that are different from the rest. As a result, it has an independent development team. Partial applications depend on each other to accomplish their functions, and therefore, any modification to one of the services will affect the work of the rest of the ser- vices; in large applications that require keeping the sys- tem always available, we must perform the process of publishing updates for parts of the system without stop- ping it completely, so we must monitor the impact of modi- fications and forecast system status before new updates are deployed. In achieving this prediction, we must know the dependencies between different services to arrive at a cognitive model representing the dependencies between services or applications.

}, doi = {http://www.dline.info/jdim/wp-content/uploads/3.pdf}, url = {https://10.0.23.137/jdim/2024/22/3/99-107}, author = {Ammar Esrawi and Bassel Alkhatib} } @article {846, title = {Can ChatGPT Predict Stock Market Price Movements?}, journal = {Journal of Digital Information Management}, volume = {22}, year = {2024}, month = {09/2024}, pages = {91-98}, type = {Research}, chapter = {91}, abstract = {

Accelerated advances in network speed, re- liability, and security have increased the demand for soft- ware and services to move from being stored and pro- cessed locally on users{\textquoteright} devices to being managed by third parties that can be accessed through the network. This has led to the need to develop new software archi- tectures and software architectures that meet these new requirements. One example of software architecture is the recent emergence of a microservices architecture to meet online service providers{\textquoteright} maintenance and scalability requirements. Microservices is an architecture style that focuses on breaking down a system into small, lightweight services that are intentionally created to perform a highly cohesive business function, and it is an evolution of the traditional service-oriented architecture style. The practi- cal projection of microservices architecture in informa- tion engineering is several small applications that work together to provide an integrated service that appears to the external medium as a single application. Each of these applications has its own independent source code and deals with data sources that are different from the rest. As a result, it has an independent development team. Partial applications depend on each other to accomplish their functions, and therefore, any modification to one of the services will affect the work of the rest of the ser- vices; in large applications that require keeping the sys- tem always available, we must perform the process of publishing updates for parts of the system without stop- ping it completely, so we must monitor the impact of modi- fications and forecast system status before new updates are deployed. In achieving this prediction, we must know the dependencies between different services to arrive at a cognitive model representing the dependencies between services or applications.

}, doi = {https://10.0.23.137/jdim/2024/22/3/91-98}, url = {http://www.dline.info/jdim/wp-content/uploads/2.pdf}, author = {Ammar Esrawi and Bassel Alkhatib} } @article {749, title = {ASR Features Extraction Using MFCC And LPC: A Comparative Study-}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {06/2023}, pages = {39-49}, type = {Research}, chapter = {39}, abstract = {

The field of Automatic Speaker Recognition (ASR) is an important and open field for researchers and scientists, especially as it has become essential in facilitating the work we do in our daily lives. Such as digital authentication and electronic transactions, and consider It as a secure environment to authenticate users{\textquoteright} access to their accounts. Many technologies have been developed in the field of recognition but so far, there is no complete tool or method for speaker identification, the most important step in ASR is the extraction of voice features. Many methods and tools can be used to extract the speaker{\textquoteright}s vocal characteristics (voice features), which in turn will identify the user and recognize his voice spectrum through the phonetic linguistic message. In this paper, two methods will be studied, each using a different technique MFCC, which uses a logarithmic scale, and LPC, which uses a linear scale. The method used in ASR should have minimal error because it is an important authentication technology like a fingerprint, where two different people cannot have the same voice spectral range (voiceprint).

}, doi = {https://doi.org/10.6025/jdim/2023/21/2/39-49}, url = {http://www.dline.info/download.php?sn=3757}, author = {Bassel Alkhatib and Mohammad Madian Kamal Eddin} } @article {757, title = {ASR Features Extraction Using MFCC and LPC: A Comparative Study-}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {09-2022}, pages = {79-89}, type = {Research}, chapter = {79}, abstract = {

The field of Automatic Speaker Recognition (ASR) is an important and open field for researchers and scientists, especially as it has become essential in facilitating the work we do in our daily lives. Many technologies have been developed in the recognition field. Such as digital authentication and electronic transactions; consider It a secure environment to authenticate user{\textquoteright}s access to their accounts. Still, so far, there is no complete tool or method for speaker identification, the most crucial step in ASR is the extraction of voice features. Many techniques and tools can extract the speaker{\textquoteright}s vocal characteristics (voice features), identifying the user and recognising his voice spectrum through the phonetic and linguistic message. In this paper, two methods will be studied, each using a different technique MFCC, which uses a logarithmic scale, and LPC, which uses a linear scale. The method used in ASR should have a minimal error because it is a crucial authentication technology like a fingerprint, where two different people cannot have the same voice spectral range (voiceprint).

}, doi = {https://doi.org/10.6025/jdim/2022/20/3/79-89}, url = {http://www.dline.info/download.php?sn=3566}, author = {Mohammad Madian Kamal Eddin and Bassel Alkhatib} } @article {755, title = {Deep Learning Model CNN With LSTM For Speaker Recognition}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {12/2022}, pages = {131-147}, type = {Research}, chapter = {131}, abstract = {

Speech recognition is one of the most important research fields nowadays because of its necessity in our daily lives and to raise the fields of security to the highest level, It{\^a}{\texteuro}{\texttrademark}s a task of speech processing, and our main scope in this paper is on speaker verification, which is to identify persons from their voices where the process depends on digitizing the sound waves into a form that allows the system to deal with it. The verification process is based on the characteristics of the speaker{\textquoteright}s voice (voice biometrics) and sends it to a further process to extract the features of that voice using the feature extraction method and using AI techniques to perform the task of identification. MFCC is used for the task of features extraction and obtains the spectrogram of a given voice signal where it represents a bank of information about the voice and sends it to the CNN model for further processing for training the model on that signal to verify if the voice belongs to a user in the system or it{\^a}{\texteuro}{\texttrademark}s a new enrollment.

}, author = {Bassel Alkhatib and Mohammad Madian and Kamal Eddin} } @article {762, title = {Public Key Cryptosystem and Binary Edwards Curves on the Ring}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {03/2022}, pages = {25-30}, type = {Research}, chapter = {25}, abstract = {

\ Let be a finite ring of characteristic 2, where e2 = e and n is a positive integer. Let (a, d) 2 ( )2, such that a and d + a2 + a are invertible in , we study the binary Edwards curve over this ring, denoted by and we give a bijection between this curve and produces two binary Edwards curves defined on the finite field . Afterthat we study the addition law of binary Edwards curves over the ring . We end this work with cryptography applications, ElGamal twisted Edwards curve cryptosystem and Cramer-Shoup twisted Edwards curve cryptosystem.

}, doi = {https://doi.org/10.6025/jdim/2022/20/1/25-30}, url = {http://www.dline.info/download.php?sn=3450}, author = {Moha ben taleb Elhamam} } @article {790, title = {Information Security Risk Management of Research Information Systems: A hybrid approach of Fuzzy FMEA, AHP, TOPSIS and Shannon Entropy-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {12/2019}, pages = {321-336}, type = {Research}, chapter = {321}, abstract = {

The purpose of this paper is to implement information security risk management (ISRM) in research information systems (RIS). Appropriate identification and assessment of risks in different aspects such as software, communications, and human resources for RIS{\textquoteright}s besides providing efficient and effective preventive and corrective actions are other aims of this study. Furthermore, continual improvement of risk response processes in information technology environment is another aim of this study.\  In this study, potential risks of information security are identified using failure mode and effects analysis (FMEA). Also, detected failure modes are evaluated by multi-criteria decision-making method (MCDM) using a hybrid method of fuzzy logic, analytic hierarchy process (AHP), Shannon entropy scoring method, and technique for order preference by similarity to the ideal solution (TOPSIS). The result of this paper shows that information security software potential risks assessment by the proposed model is more accurate and reliable than non-fuzzy models. Unauthorized access to view or change the stored information of the server is the risk with the most important priority identified by MCDM approach. Confidentiality of information is more important than other information security criteria. Furthermore, failure modes in the category of the main server and internet have more priority in comparison to others.

}, doi = {https://doi.org/10.6025/jdim/2019/17/6/321-336}, url = {http://dline.info/fpaper/jdim/v17i6/jdimv17i6_2.pdf}, author = {M. J. Ershadi and Mehrdad Forouzandeh} } @article {706, title = {Viscovery: Trend Tracking in Opinion Forums based on Dynamic Topic Models}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2019}, month = {02/2019}, type = {Research}, chapter = {13-24}, doi = {https://doi.org/10.6025/jdim/2019/1/13-24}, author = {Ignacio Espinoza and Marcelo Mendoza and Pablo Ortega and Daniel Rivera and Fernanda Weiss} } @article {809, title = {Viscovery: Trend Tracking in Opinion Forums based on Dynamic Topic Models-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {02/2019}, pages = {13-24}, type = {Research}, chapter = {13}, abstract = {

Opinions in forums and social networks are released by millions of people due to the increasing number of users that use Web 2.0 platforms to opine about brands and organizations. For enterprises or government agencies it is almost impossible to track what people say producing a gap between user needs/ expectations and organizations actions.

}, doi = {https://doi.org/10.6025/jdim/2019/17/1/13-24}, url = {http://dline.info/fpaper/jdim/v17i1/jdimv17i1_2.pdf}, author = {Ignacio Espinoza and Marcelo Mendoza, and Pablo Ortega and Daniel Rivera, and Fernanda Weiss} } @article {668, title = {Performance Measure and Analysis of MPLS and conventional IP network through VoIP: Effect in Video and Audio transmission}, journal = {Journal of Networking Technology}, volume = {9}, year = {2018}, month = {06/2018}, pages = {56-65}, type = {Research}, author = {Jawad Oubaha and Abderrahmane Ez-zahout} } @article {474, title = {Building consistent UML models for better model driven engineering}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {289 - 300}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85036620073\&partnerID=40\&md5=3f141768de4df003a8dd47e8ece70abb}, author = {Allaki, D. and Dahchour, M. and En-nouaary, A.} } @article {476, title = {High level mammographic information fusion for real world ontology population}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {259 - 271}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85036660676\&partnerID=40\&md5=8f5bfd1dfc3fb6b38f1340484f42e5a9}, author = {Salem, Y.B. and Idodi, R. and Ettabaa, K.S. and Hamrouni, K. and Solaiman, B.} } @article {549, title = {Exploring government uses of social media through Twitter sentiment analysis}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {290 - 301}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006868159\&partnerID=40\&md5=11144532b5f9c5b4092fdc815b6c7878}, author = {Chen, H.M. and Franks, P.C. and Evans, L.} } @article {448, title = {Implementing and evaluating a smart-M3 platform-based multi-vendor micropayment system pilot in the context of small business}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {44 - 51}, abstract = {Today, micropayment systems usage is highly topical. For example, applications of mobile micropayment systems are widely used and are well known by the public. The objective of this study was to implement a micropayment system pilot based on an interoperability enabling platform (in this case, Smart-M3) for small businesses with restricted resources, scarce labor force, and a growing number of products and vendors. In these small and medium-sized enterprise (SME) contexts, piloting systems of this kind is usually problematic because of its immediate impact on the core business and monetary transactions that are essential for SMEs. An account-based system was considered an appropriate starting point for the micropayment system pilot. The applicability of the Smart-M3 platform was then validated by the implementation of the system. Lastly, a summative evaluation was carried out by interviewing direct stakeholders, to enrich the observations from the validation. The results of the study show that the implemented system provides small businesses with opportunities to reduce costs and more efficiently use resources, adding new devices and systems, new ways to produce services, andreal-time tracking of the sales process, as well as utilization of the data collected from the system. From the customers{\textquoteright} point of view, the efficient use of resources may lead to more competitive prices of the products and services. Micropayment system usage can also be seen as a starting point for improved user experience, includingsafety, efficiency, and ease of use.}, keywords = {Electronic payment system, Micropayment, Multi-vendor, Smart-M3 platform}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900390339\&partnerID=40\&md5=0dbddde65f1c4cabb8e7e74284b24fe5}, author = {Rohunen, A. and Etel{\"a}per{\"a}, M. and Liukkunen, K. and Tulppo, T. and Chan, K.W.} } @article {224, title = {Editorial preface: Special issue on context-aware and mobile multimedia databases and services}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {2 - 3}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84861465089\&partnerID=40\&md5=7b82f006c7ffa103ca31e784f7cd8bf8}, author = {Grigoras, R. and Charvillat, V. and Chbeir, R. and Kosch, H. and Bailer, W. and Boll, S. and Brunie, L. and Cao, Y. and Delgado, J. and Granitzer, M. and Hausenblas, M. and Eidenberger, H. and Klamma, R. and Lux, M. and Marques, O. and Oria, V. and Plesca, C. and Pr{\'e}teux, F. and Sedes, F. and Spaniol, M. and Ternier, S. and Wolpers, M.} } @article {226, title = {A framework for enhancing non context-driven XML search}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {167 - 174}, abstract = {A data element specifies one of the characteristics of its parent element. Therefore, the context of a data element is determined by its parent. Non context driven search engines build relationships between data nodes based solely on their labels and proximity to one another while overlooking their contexts. Therefore, they may return faulty answers. This paper investigates the pitfalls and limitations of non context-driven XML search engines, which caused by overlooking elements{\textquoteright} contexts. We propose a generic context-driven search framework, which could be used as a layer on top of the frameworks of non context-driven search systems.}, keywords = {Contextdriven search system, Keyword search, XML, XML search engine}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960686613\&partnerID=40\&md5=a8d61dbc9c63c15c9ce19f500d97fabe}, author = {Taha, K. and Elmasri, R.} } @article {205, title = {Maximizing mobile multimedia adhoc networks lifetime using a distributed cooperation mechanism}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {352 - 357}, abstract = {Energy conservation is a critical issue in wireless mul tihop ad-hoc networks, which have nodes powered by batteries only. One major metric for energy conservation is that all nodes participate in relaying requests which may be opposite to its interest but can be a solution for extending the network lifetime. We proposed a distributed algorithm which gurabtuees a cooperation between the nodes in func tion of their energy provision. We focus in this paper on the exploitation of nodes mobility. Experiments results show the impact of nodes mobility on the behavior of our proposed algorithm.}, keywords = {Distributed algorithm, Mobile ad hoc network, Nodes mobility}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960685343\&partnerID=40\&md5=e4fa9baab9e0df89a5c694d24960476e}, author = {Bahi, J.M. and Eskandar, M. and Mostefaoui, A.} } @article {155, title = {Accessing heritage documents according to space criteria within digital libraries}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {102 - 117}, abstract = {Local cultural heritage document collections are characterized by contents strongly attached to a territory and its associated land history. Our contribution aims at enhancing such a content retrieval process efficiently each time a query includes geographic criteria. We propose a unified model for a formal representation of geographic information. This geographic model allows space features to be described independently of their representation mode (text, graphics) in the documents. We have developed a prototype implementing geographic Information Extraction (IE) and geographic Information Retrieval (IR) processes. We process geographic IE with semantic techniques combined to classic IE approaches. Then, we implement geographic IR with intersections researching algorithms: these algorithms search for all geocoded entities in the documents collections indexes which intersect any entity in the user{\textquoteright}s query. This paper focuses on IR and Visualization proposals relying on the geospatial characteristics of cultural heritage corpora.}, keywords = {Cultural heritage, Digital libraries, Geographic information retrieval and visualization, Geographic model, Non-structured documents}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849092298\&partnerID=40\&md5=199c3f9b17bf1a325e0c3fcc90160b17}, author = {Marquesuza{\`a}, C. and Etcheverry, P. and Sallaberry, C. and Baziz, M.} } @article {115, title = {An actor like data model for a parallel DBMS}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {262 - 271}, abstract = {We present in this paper the new concept of "actor databases" (DB-Act) being studied at the INI institute (Act21 project) where we are developing a parallel main memory database system based on an actor like data model. To achieve data distribution we use a Scalable Distributed Data Structures (SDDS) called "distributed Compact Trie Hashing" (CTH*) currently in development at the same project. Transaction management and recovery techniques are adapted for the combination of actors and SDDS in Act21. An adaptation of the nested transaction model to the actor paradigm is presented, as well as a recovery techniques using a fuzzy checkpointing tailored to the SDDS needs.}, keywords = {Actor paradigm, Parallel DBMS, Recovery, Scalable distributed data structures}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70449395027\&partnerID=40\&md5=62e63e876a6d33c10455c63bda2b977e}, author = {Hidouchi, W.K. and Ezegour, D.} } @article {137, title = {Behavioral similarities for collaborative recommendations}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2008}, pages = {442 - 448}, abstract = {Recommender systems contribute to the personalization of resources on web sites and information retrieval systems. These systems use different mining techniques to generate predictions corresponding to the needs of users. In this paper, we present a hybrid recommender system using a userbased approach, that combines predictions based on web usage patterns and rating data. We suggest a new technique that takes into account common usage patterns in order to compute correlations between users and select neighborhoods, without using any rating data. Unlike classical predictive systems that use directly mining techniques in order to suggest recommendations (like the Longest Common Subsequences technique or the frequent sequential patterns mining), the originality of our usage based technique is not to harness the discovered patterns to recommend resources, but to assess similarities of navigational users profiles. Recommendations are performed in a following step. The performance of our system is tested without and by combining predictions of both navigational based technique and classical collaborative filtering, in terms of accuracy and robustness. The experimentation put forward the impact of the navigational based technique on the performance of the hybrid recommender system in terms of precision and robustness. The tests show that the more the navigational based technique is involved in the recommendation process, the more the best predictions are accurate.}, keywords = {Collaborative filtering system, Recommender system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77955227289\&partnerID=40\&md5=c1516b14dc70e7dac89d3e8bef4af7a1}, author = {Esslimani, I. and Brun, A. and Boyer, A.} } @article {145, title = {Query planning in the PORDaS P2P database system}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {307 - 314}, abstract = {Computational science is a rapidly growing multidisciplinary field that has a need for scalable, distributed, and efficient data management. In our research, we see the peer-to-peer (P2P) paradigm a possible solution to some of the problems in distributed data management. P2P has already proved to be suitable in contexts like file sharing, distributed computations, and distributed search. In our research we are aiming at using P2P to solve some problems in the domain of distributed databases. In this paper we 1) present PORDaS, a distributed DBMS based on P2P techniques, 2) describe query processing and query planning in PORDaS, and 3) present results from an experimental evaluation of different query planning variants.}, keywords = {Data grid, Distributed databases, Peer-to-peer, Query processing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349991902\&partnerID=40\&md5=ac29e0f628f2878d089fa8c43f3eb0de}, author = {N{\o}rv{\r a}g, K. and Eide, E. and Standal, O.H.} } @article {139, title = {Rate control scheme based on cauchy R-D optimization model for H.264/AVC under low delay constraint}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {180 - 188}, abstract = {The motivation of this work is based on the observation that Cauchy distribution provides more accurate estimates of rate and distortion characteristics of video sequences than the previously used distribution such as Laplacian distribution. In this paper, we propose a new rate control scheme for H.264 low-delay video transmission using Cauchy rate-distortion optimization model. Our proposed method uses the Lagrange Multiplier technique to optimize the cost function, and be able to find the rate and distortion model subject to the target bit rate constraint resulting in the optimum choice of quantization step sizes. Model parameters are estimated using statistical linear regression analysis. The target number of bits for each frame is determined according to their buffer status, the number of bits use in the previous frame, and basic unit complexity. The proposed scheme has been implemented on H.264 video coder. Simulation results show that the proposed rate control algorithm achieves, on the average, an improvement in PSNR for up to 1.68dB with lesser number of frames skipped as compared with the default H.264 JM8.6 rate control scheme.}, keywords = {Cauchy distribution, Lagrange multiplier technique, Linear regression analysis, Low delay, Rate control}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449205119\&partnerID=40\&md5=60340eb5bbe6774b89e2d6c72f1c7181}, author = {Eiamjumrus, N. and Aramvith, S.} } @article {161, title = {Restricted continuous KNN queries on road networks with caching enhancement}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2008}, pages = {38 - 50}, abstract = {Using a Global Positioning System (GPS) in the car navigation system enables the driver to perform a wide range of queries, from locating the car position, to finding a route from a source to a destination, or dynamically selecting the best route in real time. With spatial network databases (SNDB), objects are restricted to move on pre-defined paths (e.g., roads) that are specified by an underlying network. In our previous work, we proposed a novel approach, termed Progressive incremental Network Expansion (PINE), to efficiently Support several spatial queries. In this work, we utilize our developed PINE system to efficiently support Restricted Continuous K Nearest Neighbors (RCKNNs) queries. RCKNN continously finds the K nearest objects to a query point an a given path that are within a specified distance bound. Our solution addresses a new type of query that is plausible to many applications where the answer to the query not only depends an the distances of the nearest neighbors, but also on the user ar application needs. By distinguishing between two types of split points, we reduce the number of computations required to retreive the RCKNNs of moving object. We futher define a caching model to expedite RCKNN query response time.}, keywords = {Navigation system, Network databases, Spatial databases}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849106703\&partnerID=40\&md5=cc8d24f89ed2e864614cd064ddf33afc}, author = {Safar, M. and Ebrahimi, D. and Jane, M.M.F. and Nadarajan, R.} } @article {142, title = {Robust video watermarking based on dual-plane correlation for immunity to rotation, scale, translation, and random distortion}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2008}, pages = {161 - 167}, abstract = {A robust video watermarking method is described that can embed watermarks immune to not only rotation, scaling, and translation but also to random geometric distortion and any of their combinations. It can detect watermarks without any search for canceling the effect of random distortion. Rotation, scale, and translation are canceled by searching for the angle, size, and origin of the original picture. The search for the angle and size is combinatorial but is independent of the search for the origin. That is, the angle and size of the target picture can be restored without restoring the picture{\textquoteright}s origin. Furthermore, the search for the origin is divided into horizontal and vertical searches that can be carried out independently. The number of searches is thus drastically reduced, making the processing speed high enough for practical application. Experimental evaluation using actual video samples demonstrated that the proposed method can embed watermarks immune to all four types of transformations.}, keywords = {Random distortion, RST, Survivability, Video watermarking}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-67949090393\&partnerID=40\&md5=66e6b7ff3c851392463bf9ef0b6f2ae3}, author = {Atomori, Y. and Echizen, I. and Dainaka, M. and Nakayama, S. and Yoshiura, H.} } @article {74, title = {Analysis of the data quality of audio descriptions of environmental sounds}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):9Export Date: 10 July 2014}, month = {2007}, pages = {48 - 54}, abstract = {In this paper we perform statistical data analysis of a broad set of state-of-the-art audio features and low-level MPEG-7 audio descriptors. The investigation comprises data analysis to reveal redundancies between state-of-the-art audio features and MPEG-7 audio descriptors. We introduce a novel measure to evaluate the information content of a descriptor in terms of variance. Statistical data analysis reveals the amount of variance contained in a feature. It enables identification of independent and redundant features. This approach assists in efficient selection of orthogonal features for content-based retrieval. We believe that a good feature should provide descriptions with high variance for the underlying data. Combinations of features should consist of decorrelated features in order to increase expressiveness of the descriptions. Although MPEG-7 is a popular and widely used standard for multimedia description, only few investigations do exist that address analysis of the data quality of low-level MPEG-7 descriptions.}, keywords = {Audio descriptors, Audio features, MPEG-7 descriptors, Multimedia content retrieval}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44849119790\&partnerID=40\&md5=8ed62cb5e71bdeccf00462d93d30e2db}, author = {Mitrovic, D. and Zeppelzauer, M. and Eidenberger, H.} } @article {79, title = {Biological model for information retrieval}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {123 - 129}, abstract = {Heuristic methods based on biological aspects have been successfully used in many computer science areas of research, including information retrieval (IR). This let us ask: why there is no biological environment for the problem of information retrieval. In this paper, we tried to introduce a new biological environment and model for information retrieval that broad the modeling concept from the mathematical formula that simulates the basic elements of IR problem to their dual schemas in biology. It{\textquoteright}s a new way of thinking of, and dealing with, the problem of information retrieval.}, keywords = {Biological environment, Biological model, Genetic algorithms, Information retrieval}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350691855\&partnerID=40\&md5=22f8442d6b340f89f18dd39e3c99ed99}, author = {Girgis, M.R. and Aly, A.E.-M.A. and Latef, B.A.A. and El-Gamil, B.R.} } @article {77, title = {Contextualizing multimedia semantics towards personalised eLearning}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {62 - 67}, abstract = {Recent developments of the Internet and the World Wide Web (WWW) have resulted in the proliferation of multi-media, resources and learning with existing multimedia web resources on the Web is becoming more prevalent and important. While recent standardization efforts in eLearning such as LOM, SCORM, and IMS Learning Design work towards learning content description, packaging, and delivery; existing eLearning solutions still lack the ability to adequately use multi-media resources to provide a learner with personalised learning resources. Effective use of multimedia for web-based learning provides quality interactive learning experience, but current techniques does not adequately provide a semantic approach for organising multimedia resources. With evolving trend in learning through the use of web technology, eLearning systems are expected to provide personalised learning resources for effective learning. We have accordingly proposed a way of organising existing multimedia resources based on contexts towards providing a truly personalised eLearning experience. This paper presents a framework for achieving context-based multimedia semantic annotation and organisation towards personalised learning.}, keywords = {Multimedia technology, Web based learning, WWW}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44849139810\&partnerID=40\&md5=bef7d9f2dbe792bb21840530e2dbb14d}, author = {Eze, E. and Ishaya, T. and Wood, D.M.} } @article {111, title = {A real time S-box construction using arithmetic modulo prime numbers}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2007}, pages = {354 - 360}, abstract = {This paper proposes an implementation of the inverse function of the Advanced Encryption Standard using the field of prime numbers instead of the Galois Field originally proposed by Rijndael. The paper will show that the former approach is simpler and requires less execution time and implementation circuitry compared to the latter. The authors analyzed several implementations of the inverse function for the S-Box using various approaches in search for an optimal one. In particular, simulation was used to analyze performances of algorithms for computing the inverse function based on: the arithmetic modulo a power-of-two; arithmetic modulo a power-of-two plus one; and arithmetic modulo a prime number. The simulation revealed that the modulo a prime number approach has the best performance. Furthermore, the analysis revealed that using this approach may enhance security relative to the original approach. The proposed implementation will provide a better alternative that can be embedded in many systems.}, keywords = {Diffusion, Hardware implementation, Modulo prime arithmetic, Parallel execution, Pipelining, VHDL}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149096383\&partnerID=40\&md5=a1fe3d6b0e1b163d7545da8586d0fc0f}, author = {Abuelyman, E.S. and El-Affendi, M.A.} } @article {100, title = {Social search with missing data: Which ranking algorithm?}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {249 - 261}, abstract = {Online social networking tools are extremely popular, but can miss potential discoveries latent in the social {\textquoteright}fabric{\textquoteright}. Matchmaking services which can do naive profile matching with old database technology are too brittle in the absence of key data, and even modern ontological markup, though powerful, can be onerous at data-input time. In this paper, we present a system called BuddyFinder which can automatically identify buddies who can best match a user{\textquoteright}s search requirements specified in a term-based query, even in the absence of stored user-profiles. We deploy and compare five statistical measures, namely, our own CORDER, mutual information (MI), phi-squared, improved MI and Z score, and two TF/IDF based baseline methods to find online users who best match the search requirements based on {\textquoteright}inferred profiles{\textquoteright} of these users in the form of scavenged web pages. These measures identify statistically significant relationships between online users and a term-based query. Our user evaluation on two groups of users shows that BuddyFinder can find users highly relevant to search queries, and that CORDER achieved the best average ranking correlations among all seven algorithms and improved the performance of both baseline methods.}, keywords = {Instant messaging, Ranking algorithms, Relation discovery, Social software}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350629888\&partnerID=40\&md5=a263e560496728c004285a55b37a4e27}, author = {Zhu, J. and Eisenstadt, M. and Gon{\c c}alves, A. and Denham, C. and Uren, V. and Song, D.} } @article {49, title = {Editorial}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {158}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33749407706\&partnerID=40\&md5=797926d82d7289fb4e88f4899809bc04}, author = {Pichappan, P. and El-Qawasmeh, E.} } @article {48, title = {Providing support for interaction with consistent multimedia presentations}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {124 - 130}, abstract = {Multimedia presentations are generally specified in terms of spatial and temporal relations between the media objects involved. Creation of these presentations, and interactions with them during their play-out, require an effective mechanism for handling the specifications dynamically. These specifications could result in inconsistencies, which need to be checked and resolved. Moreover, consistent presentations could become inconsistent due to interactions during the playout. Our main contribution is the design of an algorithm which aids in resolving these consistency issues dynamically and efficiently. The other salient features of our approach are a new composite spatio-temporal operator and an effective relaxation policy. We have developed a prototype which helps to study the effectiveness of the proposed approach. Thus, this paper presents an interactive multimedia presentation mechanism, which maintains a consistent and complete set of constraints during authoring and play-out of the presentation.}, keywords = {Completeness checking, Consistency checking, Distributed multimedia presentations, Spatio-temporal relations}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649102725\&partnerID=40\&md5=6d8bb6f8d9dff4f2b87372209551154a}, author = {Elias, S. and Easwarakumar, K.S. and Mathew, L. and Chbeir, R.} } @article {33, title = {RDF-based peer-to-peer based ontology editing}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {50 - 55}, abstract = {The evolution of the Semantic Web has accelerated the need for ontologies. There is a need to build new ontologies and to extend and merge existing ontologies. To achieve this we need software tools to edit and build ontologies. Our paper describes software to develop a protocol for collaborative ontology editing based on RDF and using a Peer-to-Peer (P2P) networking architecture. The protocol allows for the implementation a voting mechanism embedded into the RDF data itself, using a mixed initiative design for notification. This is implemented as extensions to an ontology browser called OntoRama. The P2P approach is compared to the classic ontology editing approaches and the special requirements of the ontology editing environment are discussed. The protocol, design, implementation and architecture for ontology update are also elaborated.}, keywords = {Network protocol, Ontology, P2P network architecture, RDF data, Semantic web}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748271282\&partnerID=40\&md5=6e01c9d91afd3edb7ba6d4f2ba608881}, author = {Becker, P. and Eklund, P. and Roberts, N.} }