Particle swarm optimization (PSO) algorithm is a population-based stochastic technique. It characterized by the collaborative search in which each particle attracted toward global best position (gbest) and its own (pbest). However, all of particles' historical promising pbests PSO are lost except their current pbests. In order to solve this problem, paper proposes novel composite algorithm, called memory-based (HMPSO), uses an estimation distribution estimate preserve information Each has...

Due to its local property, guided image filter (GIF) generally suffers from halo artifacts near edges. To make up for the deficiency, a weighted (WGIF) was proposed recently by incorporating an edge-aware weighting into filtering process. It takes advantages of and global operations, achieves better performance in edge-preserving. However, edge direction, vital property guidance image, is not considered fully these filters. In order overcome drawback, we propose novel version GIF, which can...

Modern websites increasingly rely on machine learning (ML) to improve their business efficiency. Developing and maintaining ML services incurs high costs for developers. Although serverless systems are a promising solution reduce costs, we find that the current general purpose cannot meet low latency, throughput demands of services.

We propose a generic transformation that can convert any nonbinary (n = k + r, k) maximum distance separable (MDS) code into another (n, MDS over the same field such that: 1) some arbitrarily chosen r nodes have optimal repair bandwidth and rebuilding access; 2) for remaining nodes, normalized access (over file size) are preserved; 3) sub-packetization level is increased only by factor of r. Two immediate applications this then presented. The first application we transform with or systematic...

Recently, computation offloading methods have greatly improved the Quality of Experience (QoE) in Multi-access Edge Computing (MEC) by tasks to edge servers. Since well-coordinated actions Terminal Devices (TDs) are critical improving performance entire individual system, many practical MEC-based applications, i.e., firefighting robots and unmanned aerial vehicles, require great teamwork among TDs. However, real-world scenarios usually bound resource conditions. For instance, network...

Transformer oil plays the role of heat dissipation and insulation in operation transformer, any excessive high (low) transformer level will affect safe stable transformer; change with ambient temperature load rate, so it is necessary to predict then can be governed advance. First, according shape storage cabinet, surface characteristics working principle meter, relationship between volume cabinet indication established; second, operating parameters, BP neural network prediction model...

The seed-and-expand scheme is appropriate for multiple view stereo, since it can build dense point clouds adaptively by avoiding unnecessary computation. However, due to the irregularity of algorithm, not suitable parallel computing on general public utilities (GPU). This paper first attempt implement irregular method GPU stereo problems. Meanwhile, a hierarchical architecture also proposed maximize usage both CPU and GPU. adaptivity pushed further processing pixel several rounds while, in...

Piggybacking is an efficient method to decrease the repair bandwidth of maximum distance separable codes. In this paper, in order reduce parity nodes known minimum storage regenerating (MSR) codes with high rate, which usually whole amount original data, i.e., maximal, a new systematic piggybacking design proposed through in-depth analysis piggybacking. As result, MSR are obtained almost optimal while retaining nodes. Furthermore, balanced download during node process presented based on design.

Fuzzy inference systems have been successfully applied to many real-world applications. Traditional fuzzy are only applicable problems with dense rule bases by which the entire input domain is fully covered, whilst interpolation (FRI) also able work sparse that may not cover certain observations. Thanks its ability fewer rules, approaches utilised reduce system complexity removing those rules can be approximated their neighbouring ones for complex models. A number of important base...

In this paper, we study the problem of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">private and secure distributed matrix multiplication (PSDMM)</i> , where a user having private <inline-formula xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$A$ </tex-math></inline-formula> notation="LaTeX">$N$ non-colluding servers sharing library notation="LaTeX">$L$ ( notation="LaTeX">$L&gt;1$ ) matrices...

Coded caching systems have been widely studied to reduce the data transmission during peak traffic time. In practice, two important parameters of a coded system should be considered, i.e., rate which is maximum amount time, and subpacketization level, number divided packets each file when we implement scheme. Although there exists tradeoff between subpacketization, prefer design scheme with as small possible since they reflect efficiency complexity scheme, respectively. this paper, first...

The newly presented (k + m, k) Hadamard minimum storage regenerating (MSR) codes are a class of high rate with optimal repair property for single node failure. In this paper, we propose new simple strategy MSR codes, which can considerably reduce the computation compared original one during repair.

In this paper, we reinterpret the (k+2, k) zigzag code in coding matrix and then propose an optimal exact repair strategy for its parity nodes, whose disk I/O approaches a lower bound derived paper.

Abstract Spinning production is a typical continuous manufacturing process characterized by high speed and uncertain dynamics. Each unit in spinning produces various real-time tasks, which may affect efficiency yarn quality if not processed time. This paper presents an edge computing-based method that different from traditional centralized cloud computation because its decentralization characteristics meet the high-speed high-response requirements of production. Edge computing nodes,...

In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR strongly linear PIR. Being of is a technical, yet natural condition required prove converse result for capacity expression satisfied by almost all currently known capacity-achieving schemes, while strong linearity requirement enabling implementation over small finite fields with low subpacketization degree. Then, the MDS-coded, linear, in presence colluding...

In the literature, all known high-rate MDS codes with optimal repair bandwidth possess a significantly large sub-packetization level, which may prevent to be implemented in practical systems. To build small existing constructions and theoretical bounds imply that one sacrifice optimality of bandwidth. Partly motivated by work Tamo et al. (IEEE Trans. Inform. Theory, 59(3), 1597-1616, 2013), this paper, we present transformation can greatly reduce level respect same code length n. As...

Very recently, Costache and Smart proposed a fully homomorphic encryption (FHE) scheme based on the Learning with Rounding ( LWR ) problem, which removes noise (typically, Gaussian noise) sampling needed in previous lattices-based FHEs. But their did not work, since of multiplication is complicated large, leads to failure decryption. More specifically, they chose instances as public key private therein secret then used tensor product implement multiplication, resulted tangly modulus problem....

In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">full support-rank</i> PIR xmlns:xlink="http://www.w3.org/1999/xlink">strongly linear</i> PIR. Being of full support-rank is a technical, yet natural condition required prove converse result for capacity expression satisfied by almost all currently known capacity-achieving schemes, while...

In the literature, most of known high-rate <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(n,k)$ </tex-math></inline-formula> MDS array codes with optimal repair property only support a single degree (i.e., number helper nodes contacted during process) notation="LaTeX">$d$ , where notation="LaTeX">$k\le d\le n-1$ . However, in practical storage systems, available changes frequently. Thus, it is preferred...

We study two problems of private matrix multiplication, over a distributed computing system consisting master node, and multiple servers that collectively store family public matrices using Maximum-Distance-Separable (MDS) codes. In the first problem Private Secure Matrix Multiplication (PSMM) from colluding servers, intends to compute product its confidential $\mathbf{A}$ with target stored on without revealing any information about index some servers. second Fully (FPMM) is also selected...