02502nas a2200145 4500008004100000245010000041210006900141260001200210300001100222490000700233520203100240100001802271700002102289856004602310 2024 eng d00aA Brief Review of the Automation of Dependency Satisfaction With in Microservices Architectures0 aBrief Review of the Automation of Dependency Satisfaction With i c09/2024 a99-1070 v223 a

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’ 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’ 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.

1 aEsrawi, Ammar1 aAlkhatib, Bassel uhttps://10.0.23.137/jdim/2024/22/3/99-10702449nas a2200145 4500008004100000245005400041210005300095260001200148300001000160490000700170520203100177100001802208700002102226856005602247 2024 eng d00aCan ChatGPT Predict Stock Market Price Movements?0 aCan ChatGPT Predict Stock Market Price Movements c09/2024 a91-980 v223 a

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’ 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’ 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.

1 aEsrawi, Ammar1 aAlkhatib, Bassel uhttp://www.dline.info/jdim/wp-content/uploads/2.pdf01594nas a2200145 4500008004100000245006900041210006700110260001200177300001000189490000700199520114200206100002101348700003201369856004701401 2023 eng d00aASR Features Extraction Using MFCC And LPC: A Comparative Study-0 aASR Features Extraction Using MFCC And LPC A Comparative Study c06/2023 a39-490 v213 a

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' 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’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).

1 aAlkhatib, Bassel1 aEddin, Mohammad, Madian Kam uhttp://www.dline.info/download.php?sn=375701653nas a2200145 4500008004100000245006900041210006700110260001200177300001000189490000700199520120100206100003201407700002101439856004701460 2022 eng d00aASR Features Extraction Using MFCC and LPC: A Comparative Study-0 aASR Features Extraction Using MFCC and LPC A Comparative Study c09-2022 a79-890 v203 a

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'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'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).

1 aEddin, Mohammad, Madian Kam1 aAlkhatib, Bassel uhttp://www.dline.info/download.php?sn=356601591nas a2200157 4500008004100000245006200041210006200103260001200165300001200177490000700189520114100196100002101337700002101358700001701379856003701396 2022 eng d00aDeep Learning Model CNN With LSTM For Speaker Recognition0 aDeep Learning Model CNN With LSTM For Speaker Recognition c12/2022 a131-1470 v203 a

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’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'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’s a new enrollment.

1 aAlkhatib, Bassel1 aMadian, Mohammad1 aEddin, Kamal uhttps://dline.info/newl/node/75500989nas a2200133 4500008004100000245006600041210006600107260001200173300001000185490000700195520057700202100002900779856004700808 2022 eng d00aPublic Key Cryptosystem and Binary Edwards Curves on the Ring0 aPublic Key Cryptosystem and Binary Edwards Curves on the Ring c03/2022 a25-300 v203 a

 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.

1 aElhamam, Moha, ben taleb uhttp://www.dline.info/download.php?sn=345001967nas a2200145 4500008004100000245014000041210006900181260001200250300001200262490000700274520143900281100002001720700002501740856005601765 2019 eng d00aInformation Security Risk Management of Research Information Systems: A hybrid approach of Fuzzy FMEA, AHP, TOPSIS and Shannon Entropy-0 aInformation Security Risk Management of Research Information Sys c12/2019 a321-3360 v173 a

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’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.

1 aErshadi, M., J.1 aForouzandeh, Mehrdad uhttp://dline.info/fpaper/jdim/v17i6/jdimv17i6_2.pdf00502nas a2200157 4500008004100000245007800041210006900119260001200188490000700200100002200207700002100229700001800250700001900268700002000287856003700307 2019 eng d00aViscovery: Trend Tracking in Opinion Forums based on Dynamic Topic Models0 aViscovery Trend Tracking in Opinion Forums based on Dynamic Topi c02/20190 v191 aEspinoza, Ignacio1 aMendoza, Marcelo1 aOrtega, Pablo1 aRivera, Daniel1 aWeiss, Fernanda uhttps://dline.info/newl/node/70600883nas a2200181 4500008004100000245007900041210006900120260001200189300001000201490000700211520035700218100002200575700000500597700001800602700000500620700002000625856005600645 2019 eng d00aViscovery: Trend Tracking in Opinion Forums based on Dynamic Topic Models-0 aViscovery Trend Tracking in Opinion Forums based on Dynamic Topi c02/2019 a13-240 v173 a

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.

1 aEspinoza, Ignacio1 a1 aOrtega, Pablo1 a1 aWeiss, Fernanda uhttp://dline.info/fpaper/jdim/v17i1/jdimv17i1_2.pdf00481nas a2200133 4500008004100000245012600041210006900167260001200236300001000248490000600258100001800264700002800282856003700310 2018 eng d00aPerformance Measure and Analysis of MPLS and conventional IP network through VoIP: Effect in Video and Audio transmission0 aPerformance Measure and Analysis of MPLS and conventional IP net c06/2018 a56-650 v91 aOubaha, Jawad1 aEz-zahout, Abderrahmane uhttps://dline.info/newl/node/66800526nas a2200145 4500008004100000245007100041210006900112260000900181300001400190490000700204100001500211700001700226700001900243856011800262 2017 eng d00aBuilding consistent UML models for better model driven engineering0 aBuilding consistent UML models for better model driven engineeri c2017 a289 - 3000 v151 aAllaki, D.1 aDahchour, M.1 aEn-nouaary, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85036620073&partnerID=40&md5=3f141768de4df003a8dd47e8ece70abb00592nas a2200169 4500008004100000245008200041210006900123260000900192300001400201490000700215100001600222700001400238700001800252700001700270700001700287856011800304 2017 eng d00aHigh level mammographic information fusion for real world ontology population0 aHigh level mammographic information fusion for real world ontolo c2017 a259 - 2710 v151 aSalem, Y.B.1 aIdodi, R.1 aEttabaa, K.S.1 aHamrouni, K.1 aSolaiman, B. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85036660676&partnerID=40&md5=8f5bfd1dfc3fb6b38f1340484f42e5a900531nas a2200145 4500008004100000245008100041210006900122260000900191300001400200490000700214100001500221700001700236700001400253856011800267 2016 eng d00aExploring government uses of social media through Twitter sentiment analysis0 aExploring government uses of social media through Twitter sentim c2016 a290 - 3010 v141 aChen, H.M.1 aFranks, P.C.1 aEvans, L. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85006868159&partnerID=40&md5=11144532b5f9c5b4092fdc815b6c787802357nas a2200229 4500008004100000245013000041210006900171260000900240300001200249490000700261520157200268653003001840653001701870653001701887653002201904100001601926700002001942700001801962700001501980700001501995856011702010 2014 eng d00aImplementing and evaluating a smart-M3 platform-based multi-vendor micropayment system pilot in the context of small business0 aImplementing and evaluating a smartM3 platformbased multivendor  c2014 a44 - 510 v123 aToday, 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' 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.10aElectronic payment system10aMicropayment10aMulti-vendor10aSmart-M3 platform1 aRohunen, A.1 aEteläperä, M.1 aLiukkunen, K.1 aTulppo, T.1 aChan, K.W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84900390339&partnerID=40&md5=0dbddde65f1c4cabb8e7e74284b24fe501068nas a2200373 4500008004100000245009900041210006900140260000900209300001000218490000600228100001700234700001900251700001500270700001400285700001500299700001300314700001500327700001200342700001600354700001800370700001900388700002000407700001500427700001200442700001600454700001300470700001500483700001700498700001400515700001600529700001600545700001600561856011700577 2010 eng d00aEditorial preface: Special issue on context-aware and mobile multimedia databases and services0 aEditorial preface Special issue on contextaware and mobile multi c2010 a2 - 30 v81 aGrigoras, R.1 aCharvillat, V.1 aChbeir, R.1 aKosch, H.1 aBailer, W.1 aBoll, S.1 aBrunie, L.1 aCao, Y.1 aDelgado, J.1 aGranitzer, M.1 aHausenblas, M.1 aEidenberger, H.1 aKlamma, R.1 aLux, M.1 aMarques, O.1 aOria, V.1 aPlesca, C.1 aPréteux, F.1 aSedes, F.1 aSpaniol, M.1 aTernier, S.1 aWolpers, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84861465089&partnerID=40&md5=7b82f006c7ffa103ca31e784f7cd8bf801256nas a2200193 4500008004100000245006000041210005700101260000900158300001400167490000600181520064800187653003200835653001900867653000800886653002200894100001300916700001600929856011700945 2010 eng d00aA framework for enhancing non context-driven XML search0 aframework for enhancing non contextdriven XML search c2010 a167 - 1740 v83 aA 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' 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.10aContextdriven search system10aKeyword search10aXML10aXML search engine1 aTaha, K.1 aElmasri, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960686613&partnerID=40&md5=a8d61dbc9c63c15c9ce19f500d97fabe01270nas a2200193 4500008004100000245009900041210006900140260000900209300001400218490000600232520059900238653002600837653002600863653001900889100001500908700001700923700001900940856011700959 2009 eng d00aMaximizing mobile multimedia adhoc networks lifetime using a distributed cooperation mechanism0 aMaximizing mobile multimedia adhoc networks lifetime using a dis c2009 a352 - 3570 v73 aEnergy 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.10aDistributed algorithm10aMobile ad hoc network10aNodes mobility1 aBahi, J.M.1 aEskandar, M.1 aMostefaoui, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960685343&partnerID=40&md5=e4fa9baab9e0df89a5c694d24960476e01843nas a2200229 4500008004100000245008600041210006900127260000900196300001400205490000600219520104900225653002201274653002201296653005501318653002101373653002901394100002101423700001901444700001901463700001401482856011701496 2008 eng d00aAccessing heritage documents according to space criteria within digital libraries0 aAccessing heritage documents according to space criteria within  c2008 a102 - 1170 v63 aLocal 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's query. This paper focuses on IR and Visualization proposals relying on the geospatial characteristics of cultural heritage corpora.10aCultural heritage10aDigital libraries10aGeographic information retrieval and visualization10aGeographic model10aNon-structured documents1 aMarquesuzaà, C.1 aEtcheverry, P.1 aSallaberry, C.1 aBaziz, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849092298&partnerID=40&md5=199c3f9b17bf1a325e0c3fcc90160b1701282nas a2200193 4500008004100000245004900041210004600090260000900136300001400145490000600159520068000165653001900845653001800864653001300882653004100895100001900936700001600955856011700971 2008 eng d00aAn actor like data model for a parallel DBMS0 aactor like data model for a parallel DBMS c2008 a262 - 2710 v63 aWe 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.10aActor paradigm10aParallel DBMS10aRecovery10aScalable distributed data structures1 aHidouchi, W.K.1 aEzegour, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70449395027&partnerID=40&md5=62e63e876a6d33c10455c63bda2b977e02082nas a2200181 4500008004100000245006200041210006200103260000900165300001400174490000600188520148600194653003501680653002301715100001801738700001301756700001401769856011701783 2008 eng d00aBehavioral similarities for collaborative recommendations0 aBehavioral similarities for collaborative recommendations c2008 a442 - 4480 v63 aRecommender 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.10aCollaborative filtering system10aRecommender system1 aEsslimani, I.1 aBrun, A.1 aBoyer, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77955227289&partnerID=40&md5=c1516b14dc70e7dac89d3e8bef4af7a101359nas a2200205 4500008004100000245005300041210005300094260000900147300001400156490000600170520073400176653001400910653002600924653001700950653002100967100001700988700001301005700001801018856011701036 2008 eng d00aQuery planning in the PORDaS P2P database system0 aQuery planning in the PORDaS P2P database system c2008 a307 - 3140 v63 aComputational 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.10aData grid10aDistributed databases10aPeer-to-peer10aQuery processing1 aNørvåg, K.1 aEide, E.1 aStandal, O.H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70349991902&partnerID=40&md5=ac29e0f628f2878d089fa8c43f3eb0de01882nas a2200205 4500008004100000245010400041210006900145260000900214300001400223490000600237520116000243653002401403653003401427653003101461653001401492653001701506100001901523700001701542856011701559 2008 eng d00aRate control scheme based on cauchy R-D optimization model for H.264/AVC under low delay constraint0 aRate control scheme based on cauchy RD optimization model for H2 c2008 a180 - 1880 v63 aThe 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.10aCauchy distribution10aLagrange multiplier technique10aLinear regression analysis10aLow delay10aRate control1 aEiamjumrus, N.1 aAramvith, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-72449205119&partnerID=40&md5=60340eb5bbe6774b89e2d6c72f1c718101928nas a2200205 4500008004100000245008000041210006900121260000900190300001200199490000600211520125600217653002201473653002201495653002201517100001401539700001701553700001701570700001801587856011701605 2008 eng d00aRestricted continuous KNN queries on road networks with caching enhancement0 aRestricted continuous KNN queries on road networks with caching  c2008 a38 - 500 v63 aUsing 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.10aNavigation system10aNetwork databases10aSpatial databases1 aSafar, M.1 aEbrahimi, D.1 aJane, M.M.F.1 aNadarajan, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849106703&partnerID=40&md5=cc8d24f89ed2e864614cd064ddf33afc01786nas a2200229 4500008004100000245013000041210006900171260000900240300001400249490000600263520101700269653002201286653000801308653001801316653002301334100001601357700001601373700001601389700001701405700001701422856011701439 2008 eng d00aRobust video watermarking based on dual-plane correlation for immunity to rotation, scale, translation, and random distortion0 aRobust video watermarking based on dualplane correlation for imm c2008 a161 - 1670 v63 aA 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'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.10aRandom distortion10aRST10aSurvivability10aVideo watermarking1 aAtomori, Y.1 aEchizen, I.1 aDainaka, M.1 aNakayama, S.1 aYoshiura, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-67949090393&partnerID=40&md5=66e6b7ff3c851392463bf9ef0b6f2ae301735nas a2200205 4500008004100000245007900041210006900120260000900189300001200198490000600210520104200216653002201258653001901280653002301299653003301322100001701355700002001372700002001392856011701412 2007 eng d00aAnalysis of the data quality of audio descriptions of environmental sounds0 aAnalysis of the data quality of audio descriptions of environmen c2007 a48 - 540 v53 aIn 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.10aAudio descriptors10aAudio features10aMPEG-7 descriptors10aMultimedia content retrieval1 aMitrovic, D.1 aZeppelzauer, M.1 aEidenberger, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44849119790&partnerID=40&md5=8ed62cb5e71bdeccf00462d93d30e2db01260nas a2200217 4500008004100000245004700041210004700088260000900135300001400144490000600158520059100164653002700755653002100782653002300803653002600826100001700852700001900869700001800888700001900906856011700925 2007 eng d00aBiological model for information retrieval0 aBiological model for information retrieval c2007 a123 - 1290 v53 aHeuristic 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's a new way of thinking of, and dealing with, the problem of information retrieval.10aBiological environment10aBiological model10aGenetic algorithms10aInformation retrieval1 aGirgis, M.R.1 aAly, A.E.-M.A.1 aLatef, B.A.A.1 aEl-Gamil, B.R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350691855&partnerID=40&md5=22f8442d6b340f89f18dd39e3c99ed9901838nas a2200193 4500008004100000245007200041210006900113260000900182300001200191490000600203520121900209653002601428653002301454653000801477100001201485700001501497700001501512856011701527 2007 eng d00aContextualizing multimedia semantics towards personalised eLearning0 aContextualizing multimedia semantics towards personalised eLearn c2007 a62 - 670 v53 aRecent 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.10aMultimedia technology10aWeb based learning10aWWW1 aEze, E.1 aIshaya, T.1 aWood, D.M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44849139810&partnerID=40&md5=bef7d9f2dbe792bb21840530e2dbb14d01724nas a2200217 4500008004100000245007300041210006900114260000900183300001400192490000600206520101900212653001401231653002801245653002801273653002301301653001501324653000901339100002001348700002101368856011701389 2007 eng d00aA real time S-box construction using arithmetic modulo prime numbers0 areal time Sbox construction using arithmetic modulo prime number c2007 a354 - 3600 v53 aThis 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.10aDiffusion10aHardware implementation10aModulo prime arithmetic10aParallel execution10aPipelining10aVHDL1 aAbuelyman, E.S.1 aEl-Affendi, M.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149096383&partnerID=40&md5=a1fe3d6b0e1b163d7545da8586d0fc0f01977nas a2200241 4500008004100000245006200041210006000103260000900163300001400172490000600186520124700192653002201439653002301461653002301484653002001507100001201527700001901539700001901558700001501577700001301592700001301605856011701618 2007 eng d00aSocial search with missing data: Which ranking algorithm?0 aSocial search with missing data Which ranking algorithm c2007 a249 - 2610 v53 aOnline social networking tools are extremely popular, but can miss potential discoveries latent in the social 'fabric'. 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'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 'inferred profiles' 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.10aInstant messaging10aRanking algorithms10aRelation discovery10aSocial software1 aZhu, J.1 aEisenstadt, M.1 aGonçalves, A.1 aDenham, C.1 aUren, V.1 aSong, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350629888&partnerID=40&md5=a263e560496728c004285a55b37a4e2700381nas a2200133 4500008004100000245001400041210001400055260000900069300000800078490000600086100001800092700002000110856011700130 2006 eng d00aEditorial0 aEditorial c2006 a1580 v41 aPichappan, P.1 aEl-Qawasmeh, E. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749407706&partnerID=40&md5=797926d82d7289fb4e88f4899809bc0401764nas a2200217 4500008004100000245007900041210006900120260000900189300001400198490000600212520102200218653002601240653002501266653004101291653003001332100001401362700002301376700001501399700001501414856011701429 2006 eng d00aProviding support for interaction with consistent multimedia presentations0 aProviding support for interaction with consistent multimedia pre c2006 a124 - 1300 v43 aMultimedia 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.10aCompleteness checking10aConsistency checking10aDistributed multimedia presentations10aSpatio-temporal relations1 aElias, S.1 aEaswarakumar, K.S.1 aMathew, L.1 aChbeir, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649102725&partnerID=40&md5=6d8bb6f8d9dff4f2b87372209551154a01495nas a2200217 4500008004100000245005000041210004700091260000900138300001200147490000600159520085600165653002101021653001301042653002901055653001301084653001701097100001501114700001501129700001601144856011701160 2006 eng d00aRDF-based peer-to-peer based ontology editing0 aRDFbased peertopeer based ontology editing c2006 a50 - 550 v43 aThe 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.10aNetwork protocol10aOntology10aP2P network architecture10aRDF data10aSemantic web1 aBecker, P.1 aEklund, P.1 aRoberts, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748271282&partnerID=40&md5=6e01c9d91afd3edb7ba6d4f2ba608881