Sharing Extendible Arrays in a Distributed Environment

We describe a novel implementation scheme of multidimensional array for handling large scale high dimensional datasets. The scheme implements a dynamic multidimensional extendible array employing a set of two dimensional extendible arrays. The multidimensional arrays provide many advantages but it has some problems as well. The Traditional Multidimensional array is not dynamic extendible. Again, if the length of dimension and number of dimension of a multidimensional array is large then the address space for the array overflows soon. In this paper, we propose a solution against the essential problem of address space overflow for handling large scale multidimensional datasets using our implementation model. We evaluate our proposed scheme by comparing with Traditional Multidimensional Array (TMA) for different operations and find a reasonable delay on address space overflow with no significant performance degradation.

Cloud service capabilities can always be clearly indicated by Quality of Service (QoS) properties. The quality and effectiveness of cloud services can be measured at both client and server sides. The parameters such as response time, throughput and failure rate influence the QoS properties at the client side. These parameters may differ with the utilization of the application for the same service. The proposed Bayesian Personalized Ranking-based Rank Prediction Scheme (BPR-RPS) provides rank prediction of QoS properties on the client side, since client-side properties vary with the usage of the application. The proposed rank prediction framework provides ranking to the services when particular cloud services are requested by the client. Personalization of cloud providers and customers is made possible by concentrating on the item recommendation imposed on the cloud by creating user-specific ranking for a set of items. The past response of the user with respect to the item aids in decision-making. The proposed ranking framework includes the following modules: Computation of similarity index between the active and ad hoc users and finding of identical users based on similarity index values.

A lot of service requires identity of users to mitigate undesirable incidents such as fraud. To cut down probability of potential fraud, ID Card of users are collected to be verified so people can verify users whenever an undesirable activity happens. However, to verify identity through an ID card, a repository for the ID Card is required. To verify ID cards, the ID Card repository will be connected to an automated ID Card Verification API. The ID Card repository is meant to be used both on mobile phones and desktop computers, so the concept of progressive web application is used. To be able to upload images smoothly and build progressive web application, the ID Card repository is built using ReactJS and Ant Design. Server side is powered by Strapi and MongoDB. GraphQL API is utilized to connect client side and server side. It involves queries to fetch data. To fetch data on the client side, Apollo client is used to in ReactJS. Git is utilized for version control system which gives contribution to Continuous Integration and Continuous Delivery. In this paper, we will discuss why Strapi is best suited on server side and how Ant Design, a library to style components in a web page, can provide required components in this web application.

At IHEP (Institute of High Energy Physics, Chinese Academy of Sciences), computing resources are contributed by different experiments including BES, JUNO, DYW, HXMT, etc. The resources were divided into different partitions to satisfy the dedicated experiment data processing requirements. IHEP had a local Torqu&Maui cluster with 50 queues serving for above 10 experiments. The separated resource partitions leaded to imbalance resource load. In a typical situation, BES resource partition was quite busy without free slot but still with lots of jobs in idle, while JUNO resources are free and wasted seriously. After moving resources from Torque&Maui to HTCondor in 2016, job scheduling efficiency has been improved a lot. In order to balance the imbalance resource load, we designed an efficient sharing strategy to improve the overall resourceutilization. We created an unified pool shared by all experiments. For each experiment, resources are divided into two parts: dedicated resource and sharing resource. The slots in dedicated resource only run jobs from its own experiment, and the slots in sharing resource are shared by jobs from all experiments. Default ratio of dedicated resource to sharing resource is 1:4. To maximize the sharing effectiveness, the ratio is dynamically adjusted between 0:5 and 4:1 based on the number of jobs submitted by each experiment. We have developed a central control system to decide how many resources can be allocated to each experiment group. This system is implemented at two sides: server side and client side. A management database is built at server side, which is storing resource, group and experiment information. Once the sharing ratio needs to be adjusted, resource group will be changed and updated into database. The resource group information is published to the server buffer in real-time. The client periodically pulls resource group information from server buffer via https protocol And resource scheduling configuration at client side is changed based on the resource group information. With this method, share ratio can be modified and deployed dynamically. Sharing strategy is implemented with HTCondor. ClassAd mechanism and accounting-group in HTCondor facilitate to utilizethe sharing strategy at IHEP computing cluster. With the sharing strategy, resource usage has been improved dramatically.

In recent years, the type and quantity of news are growing rapidly, and it is not easy for users to find the news they are interested in the massive amount of news. A news recommendation system can score and predict the candidate news, and finally recommend the news with high scores to users. However, existing user models usually only consider users’ long-term interests and ignore users’ recent interests, which affects users’ usage experience. Therefore, this paper introduces gated recurrent unit (GRU) sequence network to capture users’ short-term interests and combines users’ short-term interests and long-term interests to characterize users. While existing models often only use the user’s browsing history and ignore the variability of different users’ interest in the same news, we introduce additional user’s ID information and apply the personalized attention mechanism for user representation. Thus, we achieve a more accurate user representation. We also consider the risk of compromising user privacy if the user model training is placed on the server side. To solve this problem, we design the training of the user model locally on the client side by introducing a federated learning framework to keep the user’s browsing history on the client side. We further employ secure multi-party computation to request news representations from the server side, which protects privacy to some extent. Extensive experiments on a real-world news dataset show that our proposed news recommendation model has a better improvement in several performance evaluation metrics. Compared with the current state-of-the-art federated news recommendation models, our model has increased by 0.54% in AUC, 1.97% in MRR, 2.59% in nDCG@5%, and 1.89% in nDCG@10. At the same time, because we use a federated learning framework, compared with other centralized news recommendation methods, we achieve privacy protection for users.

The widespread use of Internet of Things (IoT) technology has promoted location‐based service (LBS) applications. Users can enjoy various conveniences brought by LBS by providing location information to LBS. However, it also brings potential privacy threats to location information. Location data that contains private information is often transmitted among IoT networks in LBS, and such privacy information should be protected. In order to solve the problem of location privacy leakage in LBS, a location privacy protection scheme based on k‐anonymity is proposed in this paper, in which the Geohash coding model and Voronoi graph are used as grid division principles. We adopt the client‐server‐to‐user (CS2U) model to protect the user’s location data on the client side and the server side, respectively. On the client side, the Geohash algorithm is proposed, which converts the user’s location coordinates into a Geohash code of the corresponding length. On the server side, the Geohash code generated by the user is inserted into the prefix tree, the prefix tree is used to find the nearest neighbors according to the characteristics of the coded similar prefixes, and the Voronoi diagram is used to divide the area units to complete the pruning. Then, using the Geohash coding model and the Voronoi diagram grid division principle, the G‐V anonymity algorithm is proposed to find k neighbors in an anonymous area so that the user’s location data meets the k‐anonymity requirement in the area unit, thereby achieving anonymity protection of location privacy. Theoretical analysis and experimental results show that our method is effective in terms of privacy and data quality while reducing the time of data anonymity.

One of the challenges faced by machine learning in human activity recognition systems is the different distributions of the training and test samples. Transfer learning constitutes a solution to this problem. On the other hand, to perform transfer learning, it is necessary to have access to the original dataset. However, access to the dataset to implement the transfer learning algorithms results in a privacy breach. To deal with this challenge, this paper presents semi-supervised and unsupervised scenarios for privacy-preserving transfer learning in centralized and distributed manner. In the proposed distributed algorithms, it is not necessary to share the original data among the clients to implement the transfer learning algorithms. Instead, the transfer learning process can be fulfilled without having the original datasets. PPSETR and PPUSTR algorithms transfer the knowledge while preserving the privacy of the datasets on the client side. In contrast, PPDSETR and PPDUSTR algorithms provide the privacy protection of the distributed data on both the client and server sides. The proposed semi-supervised algorithms reduce the recognition error rate by 20.58% and the unsupervised algorithms decrease the recognition error rate by about 15.97% while these algorithms considerably preserve the privacy.

A Linux operating system release is composed of a large number of software packages, with complex dependencies. The management of dependency relationship is the foundation of building and maintaining a Linux operating system release, and checking the integrity of the dependencies is the key of the dependency management. The widespread adoption of Linux operating systems in many areas of the information technology society has drawn the attention on the issues regarding how to check the integrity of complexity dependencies of Linux packages and how to manage a huge number of packages in a consistent and effective way. Linux distributions have already provided the tools for managing the tasks of installing, removing and upgrading the packages they were made of. A number of tools have been provided to handle these tasks on the client side. However, there is a lack of tools that could help the distribution editors to maintain the integrity of Linux package dependencies on the server side. In this paper we present a method based on conflict to check the integrity of Linux package dependencies. From the perspective of conflict, this method achieves the goal to check the integrity of package dependencies on the server side by removing the conflict associating with the packages. Our contribution provides an effective and automatic way to support distribution editors in handling those issues. Experiments using this method are very successful in checking the integrity of package dependencies in Linux software distributions.

This paper presents an original caching method called Minimal Quadtree Replication (MQTR) for Web and Mobile Applications (WMA) to query and display large sets of objects on a map. This method pre-builds a quadtree at the server side that is incrementally replicated at the client side. Our method tends to avoid useless queries and to minimize the overlaps of content when similar queries to remote services are done. This caching method offers benefits that increase the quality of service (QoS) provided by the WMA using it, when measured in terms of CPU time, bandwidth, and response time. We compared our MQTR approach with common approaches that are currently used by some popular web sites. Results show that MQTR significantly outperforms the other approaches. The best variant of our method reduces in average the number of requests by a factor of 5.5, transfers 3.9 times less data and requires 2.4 times less CPU time at the server side.

In this paper we demonstrate our MPEG-DASH evaluation suite, which comprises several components on the client side as well as on the server side. The major client components are the VLC DASH plugin, libDASH, and DASH-JS, a JavaScript-based DASH client. These tools enable performance tests on various platforms, e.g., Windows and Linux as well as mobile platforms such as Android. Moreover, due to their flexible structure it is possible to integrate adaptation logics and evaluate them under consistent conditions. On the server side we provide the content generation tool DASHEncoder, our MPEG-DASH datasets well as the MPEG-DASH conformance validator.

E-Yuan multimedia system is developed for the rich audio and video resource on the Internet and on its server side, it can automatically search and integration of network video and audio resources, and send to the client side for the user in real-time broadcast TV viewing, full use of remote control operation, Simply it’s a very easy to use multimedia system. This article introduces its infrastructure, main technical ideas and you can also see some details about server side and client side. At the same time, the improvement on how to collect and integrate video resources is comprehensively elaborated.

E-Yuan multimedia system is developed for the rich audio and video resource on the Internet and on its server side, it can automatically search and integration of network video and audio resources, and send to the client side for the user in real-time broadcast TV viewing, full use of remote control operation, Simply it’s a very easy to use multimedia system. This article introduces its infrastructure, main technical ideas and you can also see some details about server side and client side. At the same time, the improvement on how to collect and integrate video resources is comprehensively elaborated.KeywordsLinuxEmbedded systemWeb 2.0ServerClientVideo search

Context: Most approaches to automated white-box testing consider the client side and the server side of a web application in isolation from each other. Such testers lack a whole-program perspective on the web application under test. Inquiry: We hypothesise that an additional whole-program perspective would enable the tester to discover which server side errors can be triggered by an actual end user accessing the application through the client, and which ones can only be triggered in hypothetical scenarios. Approach: In this paper, we explore the idea of employing such a whole-program perspective in testing. To this end, we develop , a novel concolic tester which operates on full-stack JavaScript web applications, where both the client and the server side are JavaScript processes communicating via asynchronous messages -- as enabled by the WebSocket or Socket.IO-libraries. Knowledge: We find that the whole-program perspective enables discerning high-priority errors, which are reachable from a particular client, from low-priority errors, which are not accessible through the tested client. Another benefit of the perspective is that it allows the automated tester to construct practical, step-by-step scenarios for triggering server side errors from the end user's perspective. Grounding: We apply on a collection of web applications to evaluate how effective testing is in distinguishing between high- and low-priority errors. The results show that correctly classifies the majority of server errors. Importance: This paper demonstrates the feasibility of testing as a novel approach for automatically testing web applications. Classifying errors as being of high or low importance aids developers in prioritising bugs that might be encountered by users, and postponing the diagnosis of bugs that are less easily reached.

Multi tier applications are usually comprised of data tiers, logic tiers and presentation tiers. Logging is the technique that allows us to insert tracing statements which will produce persistent results at runtime with no effort. Modern applications use logging solutions like NLog, C# Logger or one of the many others for tracing. Logger solutions offer different ways to persist data, like database storage, file storage or web service calls for storing logs at the server side. This paper describes an enhancement of NLog which allows for server side log storage even if the logs are produced at the clients without exposing sensible resources that require protection. The goal of this enhancement is to provide high code reusability and ease of implementation to developers using it. The reusability has been attained by separating logging components into assemblies that should be referenced within the developed applications, some at the server side and some at the client side, and the ease of implementation by providing logging through NLog classes after a simple target registration at the application start.

Content-based image retrieval (CBIR) is one of the most important applications of computer vision. In recent years, there have been many important advances in the development of CBIR systems, especially Convolutional Neural Networks (CNNs) and other deep-learning techniques. On the other hand, current CNN-based CBIR systems suffer from high computational complexity of CNNs. This problem becomes more severe as mobile applications become more and more popular. The current practice is to deploy the entire CBIR systems on the server side while the client side only serves as an image provider. This architecture can increase the computational burden on the server side, which needs to process thousands of requests per second. Moreover, sending images have the potential of personal information leakage. As the need of mobile search expands, concerns about privacy are growing. In this article, we propose a fast image search framework, named DeepSearch, which makes complex image search based on CNNs feasible on mobile phones. To implement the huge computation of CNN models, we present a tensor Block Term Decomposition (BTD) approach as well as a nonlinear response reconstruction method to accelerate the CNNs involving in object detection and feature extraction. The extensive experiments on the ImageNet dataset and Alibaba Large-scale Image Search Challenge dataset show that the proposed accelerating approach BTD can significantly speed up the CNN models and further makes CNN-based image search practical on common smart phones.