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.
We propose and evaluate a novel energy and delay efficient OFDMA-based master medium access control (MAC) framework — the meta-MAC — for heterogeneous coexistence in next-generation PON, featuring both low computational complexity and low end-to-end packet delay.
Retrieving matchings between process models becomes a significant challenge in many applications. Recent attempts have been done to measure similarity of process models based on graph-edit distance. This problem is known to be difficult and computational complexity of exact algorithms for graph matching is exponential. Thus, heuristics must be proposed to obtain approximations. In this paper, we propose...
Support vector clustering (SVC) is a nonparametric clustering algorithm inspired by support vector machines. Incremental support vector clustering (ISVC) extends the SVC algorithm to an incremental version for the case of large-scale datasets with the assumption of no outliers. In order to tackle the problem of clustering large-scale noisy datasets, this paper proposes the algorithm termed incremental...
H.264/AVC offers many coding tools for achieving high compression gains of up to 50% more than other standards. These tools dramatically increase the computational complexity of the block based motion estimation (BB-ME) which consumes up to 80% of the entire encoder's computations. In this paper, computationally efficient accurate skipping models are proposed to speed up any BB-ME algorithm. First,...
Linear text segmentation aims at dividing a long text into several topical segments. It is beneficial to many natural language processing tasks, such as information retrieval and document summarization. In this article, an efficient linear text segmentation algorithm based on hierarchical agglomerative clustering is presented. The proposed linear text segmentation algorithm is implemented without...
Dynamic resource allocation (DRA) in MIMO-OFDMA systems supporting multiple services is studied. A low complexity linear algorithm based on solving an RA optimization problem subject to an additional proportional fairness constraint is developed. Computer simulation results demonstrate that the proposed algorithm performs well, and the proportionality of rate among the users approaches the proportional...
Cognitive radios have been introduced as a dynamic way to share the frequency spectrum within wireless networks. After sensing its environment to discover the available frequency resources, a cognitive network allocates the locally available carriers among its nodes, under the constraint of negligible interference on licensed operators. The allocation, based on partial knowledge of the network parameters,...
Finding an optimal execution order of join operations is a crucial task in every cost-based query optimizer. Since there are many possible join trees for a given query, the overhead of the join (tree) enumeration algorithm per valid join tree should be minimal. In the case of a clique-shaped query graph, the best known top-down algorithm has a complexity of Θ(n2) per join tree, where n is the number...
Modern multiprocessor and multicore architectures adopt shared resources to meet increased performance requirements. Adaptive arbiters, such as FlexRay, have been adopted to grant access to shared resources. While increasing the performance, timing analysis is more challenging with this kind of arbiter. This paper considers real-time tasks that are composed of super blocks, while super blocks themselves...
This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive scheduling, however, whenever a task reaches a state of zero laxity it is given the highest priority. FPZL is a minimally dynamic algorithm, in that the priority of a job can change at most once during its execution, bounding...
Pervasive use of pointers in large-scale real-world applications continues to make points-to analysis an important optimization-enabler. Rapid growth of software systems demands a scalable pointer analysis algorithm. A typical inclusion-based points-to analysis iteratively evaluates constraints and computes a points-to solution until a fixpoint. In each iteration, (i) points-to information is propagated...
In multi-agent route planning, there is a set of autonomous vehicles (agents), each with their own start and destination locations. Agents want to reach their respective destinations as quickly as possible while avoiding collisions and deadlocks with other agents. Finding an optimal set of conflict-free route plans is an NP-hard problem, so we have developed a polynomial-time, single-agent route planning...
The efficient scheduling of independent computational jobs in a heterogeneous computing (HC) environment is an important problem in domains such as grid computing. Finding optimal schedules for such an environment is (in general) an NP-hard problem, and so heuristic approaches must be used. The goal of grid task scheduling is to achieve high system throughput and to allocate various computing resources...
In video coding, motion estimation is the most time consuming part due to its high computational complexity. Based on the high temporal and spatial correlation of motion vector (MV), a new fast motion estimation algorithm of UMHexagonS (UMH) has been proposed to reduce computational complexity by using relatively few search points without degrading image quality, in which the modified patterns with...
In cluster computers, if the system load in each of computer is nearly equal, it indicates good resource utilization. It is well-known that load balancing is a key factor in developing parallel and distributed applications. Multiprocessor Scheduling is an NP-hard problem. The problem of scheduling a set of dependent or independent tasks in a distributed computing system is a well-studied area. In...
The study aims at Supermarket Distribution Problem, a mathematical model is constructed and an ant colony algorithm with tabu search is put forward. The algorithm is tested in combination with Supermarket Distribution Problem. The experimental results indicated that the algorithm solves Supermarket Distribution Problem effectively with quick convergence, avoids local optimum, high precision solution...
The complexity of technology and structure of equipments increasing significantly raise challenges in equipment diagnosis. Extensive researches make us recognize that Design for Testability (DFT) must be carried out concurrently with functional design of equipments in order to fundamentally solve these problems. Diagnostic strategy design, as an important aspect during DFT, is crucial for reducing...
This work addresses the rate-distortion (R-D) optimal packetization (OP) of embedded bitstreams into independent source packets, in order to limit error propagation in transmission over packet lossy channels. The input embedded stream is assumed to be an interleaving of K independently decodable basic streams. To form N independent source packets, each of L symbols, the set of basic streams is partitioned...
In order to successfully resolve the network infrastructure's problems the network provider has to improve the service quality. However in traditional ways, maintaining and improving of the service quality are generally determined in terms of quality of service criteria, not in terms of satisfaction and perception to the end-user. The latter is represented by Quality of Experience (QoE) that becomes...
This paper considers the problem of uplink scheduling in wireless networks supporting successive interference cancellation (SIC) at the physical layer. By allowing concurrent interfering transmissions, SIC enables multi-packet reception at the receiver resulting in increased network throughput. Specifically, we consider maximum throughput scheduling and proportional fair scheduling problems and study...
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.