New Bounds for Multidimensional Packing

New upper and lower bounds are presented for a multidimensional generalization of bin packing called box packing. Several variants of this problem, including bounded space box packing, square packing, variable-sized box packing and resource augmented box packing are also studied. The main results, stated for d=2 , are as follows: a new upper bound of 2.66013 for online box packing, a new 14/9 + ? polynomial time offline approximation algorithm for square packing, a new upper bound of 2.43828 for online square packing, a new lower bound of 1.62176 for online square packing, a new lower bound of 2.28229 for bounded space online square packing and a new upper bound of 2.32571 for online two-sized box packing.     

New Bounds for Multidimensional Packing

Abstract. New upper and lower bounds are presented for a multidimensional generalization of bin packing called box packing. Several variants of this problem, including bounded space box packing, square packing, variable-sized box packing and resource augmented box packing are also studied. The main results, stated for d=2 , are as follows: a new upper bound of 2.66013 for online box packing, a new 14/9 + ɛ polynomial time offline approximation algorithm for square packing, a new upper bound of 2.43828 for online square packing, a new lower bound of 1.62176 for online square packing, a new lower bound of 2.28229 for bounded space online square packing and a new upper bound of 2.32571 for online two-sized box packing.     

Computation of the frequency response of multilinear affine systems

Deals with the problem of computing the frequency response of an uncertain transfer function whose numerator and denominator polynomials are multiples of independent uncertain polynomials of the form P(s, q) = l/sub o/ (q) + l/sub 1/ (q) s + /spl middot//spl middot//spl middot/ + l/sub n/, (q) s/sup n/ whose coefficients depend linearly on q = [q/sub 1/, q/sub 2/, ..., q/sub q/]/sup T/ and the uncertainty box is Q = {q: q/sub i/ /spl epsiv/ [q/sub i/, q/sub i/], i = 1, 2,..., q}. Using the geometric structure of the value set of P(s, q), a powerful edge elimination procedure is proposed for computing the Bode, Nyquist, and Nichols envelopes of these uncertain systems. A numerical example is included to illustrate the benefit of the method presented.     

Using Petri net graphs express boolean functions

Both the combination and sequential switching function, also called switching circuits, can be represented by the binary code with Boolean algebra and Finite State Machine （FSM）. The basic elements of Petri net graph, such as place nodes, transition nodes, arcs, and tokens are used to frame the OR, NOT, and NOR logic function. Furthermore, to illustrate AND, and NAND switching function using the foregoing switching function, which is implemented by the Petri net graph. The main purpose of the paper is to prove ours hypothesis that the most logic function can be represented by the Petri net graph. Ultimately, our assumptions are complemented trustily.     

Fractal Beauty in Xinjiang Folk Art Patterns

Xinjiang folk art patterns and designs are the art treasures of Chinese cultural treasure-house as well as the precious humanistic resources of Western China. In the process of collecting, sorting out and studying Xinjiang folk art patterns, the elegant simplicity as well as the good taste stands out impressively, and the pattern shape as well as the layout composition shows a distinctive national trait and a strong local color. As ＂The Geometry of Nature＂, fractal geometry brings about a new performing method. Various fractal graphs are created by different generators. Their dynamic pictures contain visual information of great magnitude and their artistic effect is similar to Xinjiang folk art patterns, which fully proves the fractal beauty in Xinjiang folk art patterns.     

Super-Resolution image Reconstruction Based on Iteration and Wavelet Transform

In this paper, we provide a super-resolution image reconstruction algorithm based on wavelet transform. Wavelet transform can separate high frequency and low frequency information of image. The more high frequency information can be obtained by using wavelet transform and the technique of image fusion. Meanwhile, reconstructed super-resolution image is produced by the iterative method. In iteration process, noise of image can be suppressed by applying method of wavelet threshold de-noising. The experiment results show that the algorithm can overcome the disadvantage of the classical interpolation method and effectively improve the resolution and PSNR of the image.     

Implementation of AVS Jizhun decoder with HW/SW partitioning on a coarse-grained reconfigurable multimedia system

In this paper,a TPP(Task-based Parallelization and Pipelining)scheme is proposed to implement AVS(Audio Video coding Standard)video decoding algorithm on REMUS(REconfigurable MUltimedia System),which is a coarse-grained reconfigurable multimedia system.An AVS decoder has been implemented with the consideration of HW/SW optimized partitioning.Several parallel techniques,such as MB(Macro-Block)-based parallel and block-based parallel techniques,and several pipeline techniques,such as MB level pipeline and block level pipeline techniques are adopted by hardware implementation,for performance improvement of the AVS decoder.Also,most computation-intensive tasks in AVS video standards,such as MC(Motion Compensation),IP(Intra Prediction),IDCT(Inverse Discrete Cosine Transform),REC(REConstruct)and DF(Deblocking Filter),are performed in the two RPUs(Reconfigurable Processing Units),which are the major computing engines of REMUS.Owing to the proposed scheme,the decoder introduced here can support AVS JP(Jizhun Profile)1920×1088@39fps streams when exploiting a 200 MHz working frequency.     

Multi-scale local features based on anisotropic heat diffusion and global eigen-structure

Multi-scale local feature detection enables downstream registration and recognition tasks in med- ical image analysis. This paper articulates a novel robust method for multi-scale local feature extraction on volumetric data. The central idea is the elegant unification of local/global eigen-structures within the powerful framework of anisotropic heat diffusion. First, the local vector field is constructed by way of Hessian matrix and its eigenvectors/eigenvalues. Second, anisotropic heat kernels are computed using the vector field＇s global graph Laplacian. Robust local features are manifested as extrema across multiple time scales, serving as volumetric heat kernel signature. To tackle the computational challenge for massive volumetric data, we propose a multi- resolution strategy for hierarchical feature extraction based on our feature-preserving down-sampling approach. As a result, heat kernels and local feature identification can be approximated at a coarser level first, and then are pinpointed in a localized region at a finer resolution. Another novelty of this work lies at the initial heat design directly using local eigenvalue for anisotropic heat diffusion across the volumetric domain. We conduct experiments on various medical datasets, and draw comparisons with 3D SIFT method. The diffusion property of our local features, which can be interpreted as random walks in statistics, makes our method robust to noise, and gives rise to intrinsic multi-scale characteristics.     

Exploring the Interactions of Storylines from Informative News Events

Today＇s news readers can be easily overwhelmed by the numerous news articles online. To cope with information overload, online news media publishes timelines for continuously developing news topics. However, the timeline summary does not show the relationship of storylines, and is not intuitive for readers to comprehend the development of a complex news topic. In this paper, we study a novel problem of exploring the interactions of storylines in a news topic. An interaction of two storylines is signified by informative news events that play a key role in both storylines. Storyline interactions can indicate key phases of a news topic, and reveal the latent connections among various aspects of the story. We address the coherence between news articles which is not considered in traditional similarity-based methods, and discover salient storyline interactions to form a clear, global picture of the news topic. User preference can be naturally integrated into our method to generate query-specific results. Comprehensive experiments on ten news topics show the effectiveness of our method over alternative approaches.     

Joint relay selection and power allocation for amplify-and-forward two-path relaying networks

This paper presents a joint relay selection and power allocation scheme for amplify-and-forward two-path relaying networks,in which diferent relay nodes forward information symbols alternatively in adjacent time slots.Our approach is based on the maximization of the received signal-to-noise ratio under total power consumption by the transmission of the symbol.We show that in spite of inter-relay interferences,the maximization problem has a closed-form solution.Simulation results explicitly indicate that the performance of proposed approach outmatches the existing methods including equal power allocation and one-path relaying.     

An Intra-Server Interconnect Fabric for Heterogeneous Computing

With the increasing diversity of application needs and computing units, the server with heterogeneous pro- cessors is more and more widespread. However, conventional SMP/ccNUMA server architecture introduces communication bottleneck between heterogeneous processors and only uses heterogeneous processors as coprocessors, which limits the efficiency and flexibility of using heterogeneous processors. To solve this problem, this paper proposes an intra-server inter- connect fabric that supports both intra-server peer-to-peer interconnection and I/O resource sharing among heterogeneous processors. By connecting processors and I/O devices with the proposed fabric, heterogeneous processors can perform direct communication with each other and run in stand-alone mode with shared intra-server resources. We design the proposed fabric by extending the de-facto system I/O bus protocol PCIe （Peripheral Computer Interconnect Express） and implement it with a single chip cZodiac. By making full use of PCIe＇s original advantages, the interconnection and the I/O sharing mechanism are light weight and efficient. Evaluations that have been carried out on both the FPGA （Field Programmable Gate Array） prototype and the cycle-accurate simulator demonstrate that our design is feasible and scalable. In addition, our design is suitable for not only the heterogeneous server but also the high density server.     

Image categorization using a semantic hierarchy model with sparse set of salient regions

Image categorization in massive image database is an important problem. This paper proposes an approach for image categorization, using sparse set of salient semantic information and hierarchy semantic label tree （HSLT） model. First, to provide more critical image semantics, the proposed sparse set of salient regions only at the focuses of visual attention instead of the entire scene was formed by our proposed saliency detection model with incorporating low and high level feature and Shotton＇s semantic texton forests （STFs） method. Second, we also propose a new HSLT model in terms of the sparse regional semantic information to automatically build a semantic image hierarchy, which explicitly encodes a general to specific image relationship. And last, we archived image dataset using image hierarchical semantic, which is help to improve the performance of image organizing and browsing. Extension experimefital results showed that the use of semantic hierarchies as a hierarchical organizing frame- work provides a better image annotation and organization, improves the accuracy and reduces human＇s effort.     

Uplink resource allocation in OFDMA system using distributed antennas

In this article, we investigate uplink resource allocation in orthogonal frequency division multiple access （OFDMA） systems that use distributed antennas. The multiple distributed receiving antennas motivate us to exploit the spatial diversity to maximize the achievable rate of the system. Given constraints on the subcarrier allocation and the power limit of each user equipment （UE）, a mixed-integer optimization problem is formulated. We first propose a centralized greedy algorithm to find the maximum achievable rate of the system. Then a heuristic algorithm is proposed that can be implemented in a distributed manner. Simulation results show that the heuristic algorithm can approximately achieve the maximum achievable rate of the system and result in significant system performance improvement over the approach assigning one user to each subcarrier.     

Performance of orthogonal STBC-MIMO with variable-power adaptive modulation and delayed feedback in Nakagami fading channels

A variable-power （VP） adaptive modulation （AM） scheme with space-time block code （STBC） is developed in MIMO systems, and the corresponding performance is investigated in Nakagami fading channels. The optimum switching thresholds are derived so that the spectrum efficiency （SE） under an average power and a target bit error rate （BER） constraint is maximized. By the switching thresholds, average BER and SE are further derived. As a result, closed-form expressions are obtained. Besides, the exact and approximate BER expressions of VP AM and constant-power （CP） AM systems with delayed feedback are respectively derived. Simulation results show that the theoretical SE and BER can match the corresponding simulation well. The results indicate that VP-AM with STBC provide higher spectrum efficiency than the CP counterparts, and has slighter bite error rate performance degradation when the normalized delay is less than 0.01.     

Joint optimal sensing time and power allocation for multi-channel cognitive radio networks considering sensing-channel selection

In this paper,we consider a multi-channel cognitive radio network(CRN)where each secondary user(SU)can only choose to sense a subset of channels.We formulate a joint optimization problem of sensingchannel selection,sensing time and power allocation under the constraints of average transmit power budget and average interference power budget,which maximizes the CRN’s total throughput.We propose a greedy algorithm to solve the joint optimization problem,which has much less computational complexity.Moreover,it is shown that the search space of the greedy algorithm can be further pruned.Finally,numerical results demonstrate that the greedy algorithm has comparable performance to the exhaustive search algorithm.     

Optimal resource allocation for transmission diversity in multi-radio access networks： a coevolutionary genetic algorithm approach

The next generation wireless communication systems aim at supporting enhanced diversified network access and data transmission abilities via the cooperative integration and unified management of various radio access technologies(RATs).The resource allocation is the core component leading the network system and mobile terminals to the service robustness and performance maximization.In this paper,a numeric optimization model for optimizing terminals’transmission power and allocated RAT bandwidth for maximizing system capacity is proposed with the focal consideration of the multi-radio transmission diversity for parallel transmission through multiple links from diferent RATs,and diferent terminal characteristics on RAT supports.Also,we design a centralized and periodic scheduling algorithm including an improved coevolutionary genetic algorithm for efciently solving the optimization problem.Simulation results demonstrate that our propose algorithm can distinctly enhance the system performance and improve the computational efciency.     

Remote-Controlled Ambidextrous Robot Hand Concept

In the development of robotic limbs, the side of members is of importance to define the shape of artificial limbs and the range of movements. It is mainly significant tbr biomedical applications concerning patients suffering arms or legs injuries, fn this paper, the concept of an ambidextrous design lbr robot hands is introduced. The fingers can curl in one xvay or another, to imitate either a right hand or a left hand. The advantages and inconveniences of different models have been investigated to optimise the range and the maximum force applied by fingers. Besides, a remote control interthce is integrated to the system, allowing both to send comrnands through internet and to display a video streaming of the ambidextrous hand as feedback. Therefore, a robotic prosthesis could be used for the first time in telerehabilitation. The main application areas targeted are physiotherapy alter strokes or management of phantom pains/br amputees by/earning to control the ambidextrous hand. A client application is also accessible on Facehook social network, making the robotic limb easily reachable for the patients. Additionally the ambidextrous hand can be used tbr robotics research as well as artistic performances.     

Normalized Efficient Routing Protocol for WSN

WSNs （wireless sensor networks） consist of thousands of tiny nodes having the capability of sensing, computation, and wireless communications. Unfortunately these devices are limited energy devices, that is means we must save energy as much as possible, to increase network life time as long as possible. In this paper we introduce NEER--normalized energy efficient routing protocol that increases network life time through switching between AODV protocol that depends on request-reply routing, and MRPC that depends on residual battery in routing.     

Some new distance measures for type-2 fuzzy sets and distance measure based ranking for group decision making problems

In this paper, we propose some distance measures between type-2 fuzzy sets, and also a new family of utmost distance measures are presented. Several properties of differ- ent proposed distance measures have been introduced. Also, we have introduced a new ranking method for the ordering of type-2 fuzzy sets based on the proposed distance measure. The proposed ranking method satisfies the reasonable prop- erties for the ordering of fuzzy quantities. Some properties such as robustness, order relation have been presented. Lim- itations of existing ranking methods have been studied. Fur- ther for practical use, a new method for selecting the best alternative, for group decision making problems is proposed. This method is illustrated with a numerical example.     

Assessment of Numerical Models for Live Load Distribution in a Road Slab Bridge

This paper presents comparison of numerical models used in an analysis of a road bridge deck. The models were adapted for computing the live load distribution coefficients in composite concrete bridge deck. The load distribution method was chosen for assessment of the usability of different numerical model in slab bridge deck analysis. The goal of the study is to determine a simplest but still accurate numerical model to estimate live load effects on composite slab bridge. In the analysis, the well-established grillage approach was adapted for representation of the bridge deck as a basic model as well as more sophisticated three-dimensional models which was supposed to better represent the real behavior of the deck under concentrated wheel loads. The bridge deck was effectively modeled using beam and shell elements. The grillage method compares well with the finite-element method. This finding is allowed to establish simplification in numerical modeling of slab bridge decks for live load effect computations.