The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The energy consumption of the base station(BS) accounts for great proportion of the total energy consumption of the wireless access network(WAN). It would save a large amount of energy that operators switch off a part of spare BSs during the time of less network request. It is difficult to deploy a BS energy saving strategy in the current network architecture because of the tightly coupled network...
The paper presents an efficient parallel timing synchronization algorithm structure, which is suitable for high speed communications demodulation system and easy to implement on FPGA platform. First, a new parallel timing synchronization structure is displayed. Wherein the proposed parallel structure make up of a feedback loop based on the farrow interpolation filter, Gardner algorithm and the numerically...
The latest High Efficiency Video Coding (HEVC) standard offers higher performance than existing video coding standards - up to 50% bit-rate reduction at the equal perceptual quality, but with a significant encoder complexity increase. With regard to intra prediction, a set of 35 intra prediction modes is defined in HEVC to enhance the intra coding performance. However, the high complexity makes it...
To enable low-rank tensor completion and factorization, this paper puts forth a novel tensor rank regularization method based on the ℓ1,2-norm of the tensor's parallel factor analysis (PARAFAC) factors. Specifically, for an N-way tensor, upon collecting the magnitudes of its rank-1 components in a vector, the proposed regularizer controls the tensor's rank by inducing sparsity in the vector of magnitudes...
In this paper, the performance of network codingbased gossip algorithms -- i.e. algebraic gossip algorithms -- is analyzed on random geometric graphs under static and mobile environments. The lower bounds for the convergence time of algebraic gossip algorithms are derived based on the conductance, and these bounds are O(n log n log ε -- 1 -- log n log ε -- 1) with node...
In cryptography applications, pseudorandom sequences should have large linear complexity and k-error linear complexity, so that they cannot be recovered by only knowing a small amount of consecutive terms. However, general efficient algorithms do not exist for computing the exact value of k-error linear complexity. Therefore, it is useful to compute a good upper bound of the k-error linear complexity...
Facing large scale of data sets, disk I/O seems still one of the bottlenecks in DBMS. In the mean time, the CPU resource is not fully utilized. So compression is introduced to take use of the computing resource and largely reduces the storage overhead. Also, the commonly used compression algorithm can improve the performance when the database runs on HDD. With SSD, however, the performance for both...
In this paper, an efficient Laguerre-based body of revolution finite-difference time-domain (BOR-FDTD) method is proposed. A perturbation term and the Gauss–Seidel method are introduced to get the new algorithm. The splitting error caused by the perturbation term can be reduced to a low level by using the iterative method. To be different from its counterpart in the Cartesian coordinate system, the...
Albeit being in the big data era, a significant percentage of data accrued can be overlooked while maintaining reasonable quality of statistical inference at affordable complexity. By capitalizing on data redundancy, interval censoring is leveraged here to cope with the scarcity of resources needed for data exchanging, storing, and processing. By appropriately modifying least-squares regression, first-...
Service Restoration is defined as when a failure happens, we can use some ways to decrease the failure effects and restore power supply. Restoring the losing power area that has no fault reasonably and quickly is the essential requirements in self-healing control of distribution system with distributed generations. This article puts forward a hybrid decision diagram model for service restoration in...
Packet classification is one of the most important enabling functions for network services. The previous trie-based hierarchical search structure suffers from backtracking and address length. This paper proposes a multi-dimensional packet classification algorithm based on hierarchical all-match B+tree. By utilizing the property that the IP prefixes of a rule set are nested to each other, we develop...
Compressed Sensing (CS) shows that, when signal is sparse or compressible with respect to some basis, only a small number of compressive measurements of original signal can be sufficient for exact (or approximate) recovery. While in some cases, only the mixtures of original sources are available for observation without knowing the priori information of both the source signals and the mixing process...
Crosstalk is a key factor that can cause performance degradation in VDSL2. Balancing the transmit power spectra refers to as spectrum management to diminish the impact of crosstalk. The distributed band-preference spectrum management (DBPSM) adopts a bit-moving process to highlight the data rates of weak users. However, it still leaves room for improvement. This paper proposes a new tone and band...
Dynamic electrocardiogram is of great application value in clinical medicine. This paper proposes a fast filtering algorithm in preprocess of dynamic cardio-electric signal. First, it synthetically compares different QRS wave group detection algorithms, and adapts dynamic threshold detection method in order to meet fast testing requirement. Then it chooses QRS wave group as a switch, using different...
In this paper, we select several prevalent Peer-to-peer (P2P) network TV as research objects, and analyze their differences in port usage and packet size distribution thoroughly, based on their traffic from local captured files. By observing and summarizing the above characteristics, we discover that (i) a network TV application employs only one port to generate most of UDP traffic in one communication...
Considering the complex uncertain database, top-kquery processing in uncertain databases is semantically and computationally different from classical top-kprocessing. Score is not the only factor we should concern. The interplay between score and membership uncertainty makes computation complex. Powerful computing capability of Graphic Processing Unit(GPU) is needed in the processing of this kind...
The video quality can be degraded because of physical problems such as repeated projection, low-quality compression/decompression, or bad chemical decomposition of the original recording material. It becomes increasingly important to locate degraded video (video with defects) with the wide application of digital media. One common video defection is mosaic, where several even square combined together...
In this paper, by virtue of the methods which comes from intersecting and combining differential geometry with wavelet theory, and this method belong to us. We extend the two-direction multiresolution and the two-direction Mallat Algorithm to the theory on the special differential manifold - compact Lie group, our work lay a foundation for the further study wavelet theory on compact Lie group.
Lists intersection is an important operation in modern web search engines. Many prior studies have focused on the single-core or multi-core CPU platform or many-core GPU. In this paper, we propose a CPU-GPU cooperative model that can integrate the computing power of CPU and GPU to perform lists intersection more efficiently. In the so-called synchronous mode, queries are grouped into batches and processed...
It is an extreme challenge to produce a nonlinear SVM classifier on very large scale data. In this paper we describe a novel P-packSVM algorithm that can solve the support vector machine (SVM) optimization problem with an arbitrary kernel. This algorithm embraces the best known stochastic gradient descent method to optimize the primal objective, and has 1/?? dependency in complexity to obtain a solution...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.