Journal of King Saud University-Computer and Information Sciences最新文献

{"title":"GCNT: Identify influential seed set effectively in social networks by integrating graph convolutional networks with graph transformers","authors":"Jianxin Tang ,&nbsp;Jitao Qu ,&nbsp;Shihui Song ,&nbsp;Zhili Zhao ,&nbsp;Qian Du","doi":"10.1016/j.jksuci.2024.102183","DOIUrl":"10.1016/j.jksuci.2024.102183","url":null,"abstract":"<div><p>Exploring effective and efficient strategies for identifying influential nodes from social networks as seeds to promote the propagation of influence remains a crucial challenge in the field of influence maximization (IM), which has attracted significant research efforts. Deep learning-based approaches have been adopted as an alternative promising solution to the IM problem. However, a robust model that captures the associations between network information and node influence needs to be investigated, while concurrently considering the effects of the overlapped influence on training labels. To address these challenges, a GCNT model, which integrates Graph Convolutional Networks with Graph Transformers, is introduced in this paper to capture the intricate relationships among the topology of the network, node attributes, and node influence effectively. Furthermore, an innovative method called <span><math><mrow><mi>G</mi><mi>r</mi><mi>e</mi><mi>e</mi><mi>d</mi><mi>y</mi></mrow></math></span>-<span><math><mrow><mi>L</mi><mi>I</mi><mi>E</mi></mrow></math></span> is proposed to generate labels to alleviate the issue of overlapped influence spread. Moreover, a Mask mechanism specially tailored for the IM problem is presented along with an input embedding balancing strategy. The effectiveness of the GCNT model is demonstrated through comprehensive experiments conducted on six real-world networks, and the model shows its competitive performance in terms of both influence maximization and computational efficiency over state-of-the-art methods.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 8","pages":"Article 102183"},"PeriodicalIF":5.2,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002726/pdfft?md5=fb687d0a26ab54db6f7c889e608384a1&pid=1-s2.0-S1319157824002726-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Learning-driven Data Fabric Trends and Challenges for cloud-to-thing continuum","authors":"Praveen Kumar Donta ,&nbsp;Chinmaya Kumar Dehury ,&nbsp;Yu-Chen Hu","doi":"10.1016/j.jksuci.2024.102145","DOIUrl":"10.1016/j.jksuci.2024.102145","url":null,"abstract":"<div><p>This special issue is a collection of emerging trends and challenges in applying learning-driven approaches to data fabric architectures within the cloud-to-thing continuum. As data generation and processing increasingly occur at the edge, there is a growing need for intelligent, adaptive data management solutions that seamlessly operate across distributed environments. In this special issue, we received research contributions from various groups around the world. We chose the eight most appropriate and novel contributions to include in this special issue. These eight contributions were further categorized into three themes: Data Handling approaches, resource optimization and management, and security and attacks. Additionally, this editorial suggests future research directions that will potentially lead to groundbreaking insights, which could pave the way for a new era of learning techniques in Data Fabric and the Cloud-to-Thing Continuum.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 7","pages":"Article 102145"},"PeriodicalIF":5.2,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002349/pdfft?md5=286285bbd5dfa0b63dd8785bf5349c2e&pid=1-s2.0-S1319157824002349-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142230508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"EETS: An energy-efficient task scheduler in cloud computing based on improved DQN algorithm","authors":"Huanhuan Hou ,&nbsp;Azlan Ismail","doi":"10.1016/j.jksuci.2024.102177","DOIUrl":"10.1016/j.jksuci.2024.102177","url":null,"abstract":"<div><p>The huge energy consumption of data centers in cloud computing leads to increased operating costs and high carbon emissions to the environment. Deep Reinforcement Learning (DRL) technology combines of deep learning and reinforcement learning, which has an obvious advantage in solving complex task scheduling problems. Deep Q Network(DQN)-based task scheduling has been employed for objective optimization. However, training the DQN algorithm may result in value overestimation, which can negatively impact the learning effectiveness. The replay buffer technique, while increasing sample utilization, does not distinguish between sample importance, resulting in limited utilization of valuable samples. This study proposes an enhanced task scheduling algorithm based on the DQN framework, which utilizes a more optimized Dueling-network architecture as well as Double DQN strategy to alleviate the overestimation bias and address the shortcomings of DQN. It also incorporates a prioritized experience replay technique to achieve importance sampling of experience data, which overcomes the problem of low utilization due to uniform sampling from replay memory. Based on these improved techniques, we developed an energy-efficient task scheduling algorithm called EETS (Energy-Efficient Task Scheduling). This algorithm automatically learns the optimal scheduling policy from historical data while interacting with the environment. Experimental results demonstrate that EETS exhibits faster convergence rates and higher rewards compared to both DQN and DDQN. In scheduling performance, EETS outperforms other baseline algorithms in key metrics, including energy consumption, average task response time, and average machine working time. Particularly, it has a significant advantage when handling large batches of tasks.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 8","pages":"Article 102177"},"PeriodicalIF":5.2,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002660/pdfft?md5=a86e26e6d8a0d8a013697db9338917a5&pid=1-s2.0-S1319157824002660-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Establishing a multimodal dataset for Arabic Sign Language (ArSL) production","authors":"Samah Abbas ,&nbsp;Dimah Alahmadi ,&nbsp;Hassanin Al-Barhamtoshy","doi":"10.1016/j.jksuci.2024.102165","DOIUrl":"10.1016/j.jksuci.2024.102165","url":null,"abstract":"<div><p>This paper addresses the potential of Arabic Sign Language (ArSL) recognition systems to facilitate direct communication and enhance social engagement between deaf and non-deaf. Specifically, we focus on the domain of religion to address the lack of accessible religious content for the deaf community. We propose a multimodal architecture framework and develop a novel dataset for ArSL production. The dataset comprises 1950 audio signals with corresponding 131 texts, including words and phrases, and 262 ArSL videos. These videos were recorded by two expert signers and annotated using ELAN based on gloss representation. To evaluate ArSL videos, we employ Cosine similarities and mode distances based on MobileNetV2 and Euclidean distance based on MediaPipe. Additionally, we implement Jac card Similarity to evaluate the gloss representation, resulting in an overall similarity score of 85% between the glosses of the two ArSL videos. The evaluation highlights the complexity of creating an ArSL video corpus and reveals slight differences between the two videos. The findings emphasize the need for careful annotation and representation of ArSL videos to ensure accurate recognition and understanding. Overall, it contributes to bridging the gap in accessible religious content for deaf community by developing a multimodal framework and a comprehensive ArSL dataset.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 8","pages":"Article 102165"},"PeriodicalIF":5.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002544/pdfft?md5=301cc3d87bf22d8e207fb35edd191aea&pid=1-s2.0-S1319157824002544-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"DeepExtract: Semantic-driven extractive text summarization framework using LLMs and hierarchical positional encoding","authors":"Aytuğ Onan ,&nbsp;Hesham A. Alhumyani","doi":"10.1016/j.jksuci.2024.102178","DOIUrl":"10.1016/j.jksuci.2024.102178","url":null,"abstract":"<div><p>In the age of information overload, the ability to distill essential content from extensive texts is invaluable. DeepExtract introduces an advanced framework for extractive summarization, utilizing the groundbreaking capabilities of GPT-4 along with innovative hierarchical positional encoding to redefine information extraction. This manuscript details the development of DeepExtract, which integrates semantic-driven techniques to analyze and summarize complex documents effectively. The framework is structured around a novel hierarchical tree construction that categorizes sentences and sections not just by their physical placement within a text, but by their contextual and thematic significance, leveraging dynamic embeddings generated by GPT-4. We introduce a multi-faceted scoring system that evaluates sentences based on coherence, relevance, and novelty, ensuring that summaries are not only concise but rich with essential content. Further, DeepExtract employs optimized semantic clustering to group thematic elements, which enhances the representativeness of the summaries. This paper demonstrates through comprehensive evaluations that DeepExtract significantly outperforms existing extractive summarization models in terms of accuracy and efficiency, making it a potent tool for academic, professional, and general use. We conclude with a discussion on the practical applications of DeepExtract in various domains, highlighting its adaptability and potential in navigating the vast expanses of digital text.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 8","pages":"Article 102178"},"PeriodicalIF":5.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002672/pdfft?md5=ee7790d3716e8b2a6454863f15695239&pid=1-s2.0-S1319157824002672-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142098684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Unsupervised selective labeling for semi-supervised industrial defect detection","authors":"Jian Ge ,&nbsp;Qin Qin ,&nbsp;Shaojing Song ,&nbsp;Jinhua Jiang ,&nbsp;Zhiwei Shen","doi":"10.1016/j.jksuci.2024.102179","DOIUrl":"10.1016/j.jksuci.2024.102179","url":null,"abstract":"<div><p>In industrial detection scenarios, achieving high accuracy typically relies on extensive labeled datasets, which are costly and time-consuming. This has motivated a shift towards semi-supervised learning (SSL), which leverages labeled and unlabeled data to improve learning efficiency and reduce annotation costs. This work proposes the unsupervised spectral clustering labeling (USCL) method to optimize SSL for industrial challenges like defect variability, rarity, and complex distributions. Integral to USCL, we employ the multi-task fusion self-supervised learning (MTSL) method to extract robust feature representations through multiple self-supervised tasks. Additionally, we introduce the Enhanced Spectral Clustering (ESC) method and a dynamic selecting function (DSF). ESC effectively integrates both local and global similarity matrices, improving clustering accuracy. The DSF maximally selects the most valuable instances for labeling, significantly enhancing the representativeness and diversity of the labeled data. USCL consistently improves various SSL methods compared to traditional instance selection methods. For example, it boosts Efficient Teacher by 5%, 6.6%, and 7.8% in mean Average Precision(mAP) on the Automotive Sealing Rings Defect Dataset, the Metallic Surface Defect Dataset, and the Printed Circuit Boards (PCB) Defect Dataset with 10% labeled data. Our work sets a new benchmark for SSL in industrial settings.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 8","pages":"Article 102179"},"PeriodicalIF":5.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002684/pdfft?md5=2e9ae7d3bfac3922191cefd8f900c5a6&pid=1-s2.0-S1319157824002684-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142117390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An efficient hybrid approach for forecasting real-time stock market indices","authors":"Riya Kalra ,&nbsp;Tinku Singh ,&nbsp;Suryanshi Mishra ,&nbsp;Satakshi ,&nbsp;Naveen Kumar ,&nbsp;Taehong Kim ,&nbsp;Manish Kumar","doi":"10.1016/j.jksuci.2024.102180","DOIUrl":"10.1016/j.jksuci.2024.102180","url":null,"abstract":"<div><p>The stock market’s volatility, noise, and information overload necessitate efficient prediction methods. Forecasting index prices in this environment is complex due to the non-linear and non-stationary nature of time series data generated from the stock market. Machine learning and deep learning have emerged as powerful tools for identifying financial data patterns and generating predictions based on historical trends. However, updating these models in real-time is crucial for accurate predictions. Deep learning models require extensive computational resources and careful hyperparameter optimization, while incremental learning models struggle to balance stability and adaptability. This paper proposes a novel hybrid bidirectional-LSTM (H.BLSTM) model that combines incremental learning and deep learning techniques for real-time index price prediction, addressing these scalability and memory challenges. The method utilizes both univariate time series derived from historical index prices and multivariate time series incorporating technical indicators. Implementation within a real-time trading system demonstrates the method’s effectiveness in achieving more accurate price forecasts for major stock indices globally through extensive experimentation. The proposed model achieved an average mean absolute percentage error of 0.001 across nine stock indices, significantly outperforming traditional models. It has an average forecasting delay of 2 s, making it suitable for real-time trading applications.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 8","pages":"Article 102180"},"PeriodicalIF":5.2,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002696/pdfft?md5=990fa1b67fa197073ed336d80589c08c&pid=1-s2.0-S1319157824002696-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142098691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A low-time-consumption image encryption combining 2D parametric Pascal matrix chaotic system and elementary operation","authors":"Jun Lu ,&nbsp;Jiaxin Zhang ,&nbsp;Dezhi An ,&nbsp;Dawei Hao ,&nbsp;Xiaokai Ren ,&nbsp;Ruoyu Zhao","doi":"10.1016/j.jksuci.2024.102169","DOIUrl":"10.1016/j.jksuci.2024.102169","url":null,"abstract":"<div><p>The rapid development of the big data era has resulted in traditional image encryption algorithms consuming more time in handling the huge amount of data. The consumption of time cost needs to be reduced while ensuring the security of encryption algorithms. With this in mind, the paper proposes a low-time-consumption image encryption (LTC-IE) combining 2D parametric Pascal matrix chaotic system (2D-PPMCS) and elementary operation. First, the 2D-PPMCS with robustness and complex chaotic behavior is adopted. Second, the SHA-256 hash values are applied to the chaotic sequences generated by 2D-PPMCS, which are processed and applied to image permutation and diffusion encryption. In the permutation stage, the pixel matrix is permutation encrypted based on the permutation matrix generated from the chaotic sequences. For diffusion encryption, elementary operations are utilized to construct the model, such as exclusive or, modulo, and arithmetic operations (addition, subtraction, multiplication, and division). After analyzing the security experiments, the LTC-IE algorithm ensures security and robustness while reducing the time cost consumption.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 8","pages":"Article 102169"},"PeriodicalIF":5.2,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002581/pdfft?md5=db7fa2d27baba2dde9365c9407528c9f&pid=1-s2.0-S1319157824002581-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142098681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An efficient authentication scheme syncretizing physical unclonable function and revocable biometrics in Industrial Internet of Things","authors":"Xinying Yu ,&nbsp;Kejun Zhang ,&nbsp;Zhufeng Suo ,&nbsp;Jun Wang ,&nbsp;Wenbin Wang ,&nbsp;Bing Zou","doi":"10.1016/j.jksuci.2024.102166","DOIUrl":"10.1016/j.jksuci.2024.102166","url":null,"abstract":"<div><p>Biometric recognition is extensive for user security authentication in the Industrial Internet of Things (IIoT). However, the potential leakage of biometric data has severe repercussions, such as identity theft or tracking. Existing authentication schemes primarily focus on protecting biometric templates but often overlook the “one-authentication multiple-access” mode. As a result, these schemes still confront challenges related to privacy leakage and low efficiency for users who frequently access the server. In this regard, this paper proposes an efficient authentication scheme syncretizing physical unclonable function (PUF) and revocable biometrics in IIoT. Specifically, we design a revocable biometric template generation method syncretizing the user’s biometric data and the device’s PUF to enhance the security and revocability of the dual identity information. Given the generated revocable biometric template and the secret sharing, our scheme implements secure authentication and key negotiation between users and servers. Additionally, we establish an access boundary and an authentication validity period to permit multiple accesses following one authentication, thus significantly decreasing the computational cost of the user-side device. We leverage BAN logic and the ROR model to prove our scheme’s security. Informal security analysis and performance comparison demonstrate that our scheme satisfies more security features with higher authentication efficiency.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 8","pages":"Article 102166"},"PeriodicalIF":5.2,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002556/pdfft?md5=bf447ec5a923cea7cdfc3e3a7567340f&pid=1-s2.0-S1319157824002556-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142088745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An electricity price and energy-efficient workflow scheduling in geographically distributed cloud data centers","authors":"Mehboob Hussain ,&nbsp;Lian-Fu Wei ,&nbsp;Amir Rehman ,&nbsp;Abid Hussain ,&nbsp;Muqadar Ali ,&nbsp;Muhammad Hafeez Javed","doi":"10.1016/j.jksuci.2024.102170","DOIUrl":"10.1016/j.jksuci.2024.102170","url":null,"abstract":"<div><p>The cloud computing platform has become a favorable destination for running cloud workflow applications. However, they are primarily complicated and require intensive computing. Task scheduling in cloud environments, when formulated as an optimization problem, is proven to be NP-hard. Thus, efficient task scheduling plays a decisive role in minimizing energy costs. Electricity prices fluctuate depending on the vending company, time, and location. Therefore, optimizing energy costs has become a serious issue that one must consider when building workflow applications scheduling across geographically distributed cloud data centers (GD-CDCs). To tackle this issue, we have suggested a dual optimization approach called electricity price and energy-efficient (EPEE) workflow scheduling algorithm that simultaneously considers energy efficiency and fluctuating electricity prices across GD-CDCs, aims to reach the minimum electricity costs of workflow applications under the deadline constraints. This novel integration of dynamic voltage and frequency scaling (DVFS) with energy and electricity price optimization is unique compared to existing methods. Moreover, our EPEE approach, which includes task prioritization, deadline partitioning, data center selection based on energy efficiency and price diversity, and dynamic task scheduling, provides a comprehensive solution that significantly reduces electricity costs and enhances resource utilization. In addition, the inclusion of both generated and original data transmission times further differentiates our approach, offering a more realistic and practical solution for cloud service providers (CSPs). The experimental results reveal that the EPEE model produces better success rates to meet task deadlines, maximize resource utilization, cost and energy efficiencies in comparison to adapted state-of-the-art algorithms for similar problems.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 8","pages":"Article 102170"},"PeriodicalIF":5.2,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002593/pdfft?md5=8ba14b81a0951bd08637405a78b6250b&pid=1-s2.0-S1319157824002593-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142129447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}