Vector graphics is a key technology for drawing 2D graphics images on the mobile devices. As screen resolution increases and multi-touch interface is widely used in mobile devices, the efficient solution for vector gr...
详细信息
Vector graphics is a key technology for drawing 2D graphics images on the mobile devices. As screen resolution increases and multi-touch interface is widely used in mobile devices, the efficient solution for vector graphics becomes more important. For future mobile environments, we should process vector graphics with high performance and low power. In this paper, we have proposed the efficient anti-aliasing algorithm for mobile vector graphics. We can have greatly reduced sample counts by selective multi-sampling, which uses multi-sampling only for the pixels which meet the contour of the image. We can find the multi-sampling pixel by simple pixel-primitive intersection test. To reduce the cost of intersection test, we have proposed the pixel block algorithm which processes adjacent pixels together. For more optimization, we use hierarchical sampling. Our optimized S-MSAA (Selective Multi-Sample Anti-Aliasing) is 29.4 times faster than the original 16× MSAA.
The cloud radio access network (C-RAN) has emerged as a promising architecture to provide extremely high throughput with fantastic energy efficiency (EE) performance. However, as all the RRHs need to be connected to t...
详细信息
ISBN:
(纸本)9781509020621
The cloud radio access network (C-RAN) has emerged as a promising architecture to provide extremely high throughput with fantastic energy efficiency (EE) performance. However, as all the RRHs need to be connected to the baseband unit pool (BBU) through transport links, the transmit power consumption becomes significant, which result in the demands of new researches in energy efficiency optimization. In this paper, we focus on the dynamic remote radio head (RRH) activation and network EE optimization in order to fully reap the benefits brought by Green C-RAN. First, an EE optimization problem that jointly considers RRH activation and group sparse beamforming is formulated, which is hard to solve due to its non-convexity nature. Thus, we utilize the weighted minimal mean square error (WMMSE) method to transfer the non-convex EE problem into a concave-convex fractional program problem. And the Lagrangian theory is exploited to assist the problem analysis and algorithmdesign. Specifically, the weighted group sparse beamforming algorithm is proposed. In this algorithm, we adopt the mixed l 1 =l p -norm to induce group sparsity in the beamformers, which corresponds to switching off RRHs. Simulation results will show that the proposed algorithm can significantly improve the EE for C-RAN.
In this paper, a novel ultra-fast multi-objective optimization algorithm for VLIW architecture design space exploration has been proposed. This method which is based on design space pruning, is applicable to any archi...
详细信息
ISBN:
(纸本)9781509006946
In this paper, a novel ultra-fast multi-objective optimization algorithm for VLIW architecture design space exploration has been proposed. This method which is based on design space pruning, is applicable to any architecture objectives such as the number of issue widths, ALUs, the number of register file clusters and etc. Proposed method could be utilized for optimizing the configuration to meet various constraints of the design. Having defined several distinct objectives in this study, our heuristic method is deployed to optimize the design in terms of performance and cost. Implementation of the algorithm for three sample applications has resulted in substantial speed improvement (over 35000 times more) and negligible error (up to 3.5%).
Crime distribution forecasting has a positive impact on social stability and has drew much attention in academia. Existing research methods are not applicable for specific research problems or specific data sets very ...
详细信息
ISBN:
(纸本)9781509051557
Crime distribution forecasting has a positive impact on social stability and has drew much attention in academia. Existing research methods are not applicable for specific research problems or specific data sets very well. So we build the Vector Motion Model and propose a new algorithm named as TPML-WMA (Transition Probability Matrix Learning and Weighted Moving Average algorithm) to predict a future robbery distribution and figure out how it transfers. According to the idea of machine learning algorithm, we let the transition probability matrix to learn by itself, and do the weighted moving processing on the matrices. Using data from 2001 to 2011 from a city in China, we set up the model, evaluate the TPML-WMA algorithm on brigandage prediction and discuss the performance of algorithms under different initial conditions. At the same time, we compare the proposed algorithm with the classical linear regression method based on the least square method. The results illustrate that the prediction performance of TPML-WMA is greatly improved compared with the linear regression method.
An effective and scalable metaheuristic algorithm termed Phase Based Optimization (PBO) for solving big optimization problems is proposed. In the natural system, the individuals with three phases which are gas phase, ...
详细信息
ISBN:
(纸本)9781509006243
An effective and scalable metaheuristic algorithm termed Phase Based Optimization (PBO) for solving big optimization problems is proposed. In the natural system, the individuals with three phases which are gas phase, liquid phase and solid phase have completely different motional characteristics. PBO mimics the above three kinds of motional characteristics of individuals, and three corresponding operators, diffusion operator of gas individuals, flowing operator of liquid individuals and perturbation operator of solid individuals are devised. The diffusion operator and the flowing operator are utilized to perform the task of divergence and convergence respectively, and the perturbation operator plays a role of fine-tune search. Despite its algorithmic simplicity, PBO can effectively find a very better solution even in a high dimensional search space. The experimental results demonstrate that PBO can provide much better accuracy on optimized solutions and lower time complexity than the other state-of-the-art optimization algorithms.
This Vision System would be able to identify the objects in the digital imagery by reducing the current limitations by increasing accuracy. Further the extensively trained Vision System could be applied over the Learn...
详细信息
ISBN:
(纸本)9781509060795
This Vision System would be able to identify the objects in the digital imagery by reducing the current limitations by increasing accuracy. Further the extensively trained Vision System could be applied over the Learning Platforms where the outcome could be used to develop rich learning tools where the learners could learn through vision over text.
Herein it is proposed a simple algorithm for automatic hopping among mining pools in the Bitcoin network. The hopping ceases to occur when the best pool to be mined is found. The choice of the best pool is based on st...
详细信息
Herein it is proposed a simple algorithm for automatic hopping among mining pools in the Bitcoin network. The hopping ceases to occur when the best pool to be mined is found. The choice of the best pool is based on statistical data generated and collected during the operation of the Bitcoin network. Experiments for validation and performance analysis are based on mining networks built specifically for this purpose. The major results show for instance that the bitcoin generation increases at 46.0% comparing to when the mining is carried out in only one isolated pool. Additionally, it is evaluated the possibility of implementing a distributed application making use of the proposed algorithm. Lastly, general conclusions and possible avenues for future works are highlighted at the end of this article.
The recent rise of image processing circuits all along with the persistent quest for higher levels of performance have enormously contributed to the need of creating more efficient types of image processing circuit. F...
详细信息
ISBN:
(纸本)9781509034086
The recent rise of image processing circuits all along with the persistent quest for higher levels of performance have enormously contributed to the need of creating more efficient types of image processing circuit. For that, we have proposed a new design that offers us not only a less consuming circuit but also a faster one. Our new design has been tested and has given an interesting gain in power as well as in response time compared to classical one.
Road traffic condition in cities are complicated by the daily, weekly, seasonally, and weather-induced traffic demand fluctuations and the effects caused by the control of traffic signals. Therefore, it is difficult t...
详细信息
ISBN:
(纸本)9781509018901
Road traffic condition in cities are complicated by the daily, weekly, seasonally, and weather-induced traffic demand fluctuations and the effects caused by the control of traffic signals. Therefore, it is difficult to quantitatively analyze typical traffic congestion patterns that are represented by the time and place of occurrence, the process of propagation and diminution, duration time, and many others. This study proposed a method to enumerate traffic congestion patterns from traffic sensor data based on frequent pattern mining developed in information science to understand the present situations of traffic congestion in cities. The feasibility and effectiveness of the proposed method have been evaluated through the analysis of typical congestion patterns using the traffic sensor data in Okinawa, Japan.
We focus on designing efficient flow monitoring algorithms in SDN/OpenFlow by fully exploiting all three polling mechanisms, poll-single, poll-some and poll-all. Notably, the poll-some mechanism has not been adopted b...
详细信息
ISBN:
(纸本)9781479989515
We focus on designing efficient flow monitoring algorithms in SDN/OpenFlow by fully exploiting all three polling mechanisms, poll-single, poll-some and poll-all. Notably, the poll-some mechanism has not been adopted by any existing flow monitoring algorithm due to the inflexible match structure standardized in the early version of the OpenFlow specification. To enable the poll-some mechanism, we need to find out the minimum number of match structures required to exactly match all not-yet-covered flows at a switch. An efficient heuristic called Critical Column First (CCF) is then proposed for solving the Minimum Match Structure (MMS) problem. The idea is to consider the column of the flow matrix that can potentially identify the largest number of not-yet-covered flows first. With CCF, an existing flow monitoring algorithm called LFF [1] is extended to support all three polling mechanisms. We call it LFF+ algorithm. As compared with LFF, simulation results show that LFF+ can cut down the communication cost by about 54%.
暂无评论