Square-related functions such as square, inverse square, square-root and inverse square-root operations are widely used in digital signal processing and digital communication algorithms, and their efficient realizations are commonly required to reduce the hardware complexity. In the implementation point of view, approximate realizations are often desired if they do not degrade performance significantly. In this paper, we propose new linear approximations for the square-related functions. The traditional linear approximations need multipliers to calculate slope offsets and tables to store initial offset values and slope values, whereas the proposed approximations exploit the inherent properties of square-related functions to linearly interpolate with only simple operations, such as shift, concatenation and addition, which are usually supported in modern VLSI systems. Regardless of the bit-width of the number system, more importantly, the maximum relative errors of the proposed approximations are bounded to 6.25% and 3.13% for square and square-root functions, respectively. For inverse square and inverse square-root functions, the maximum relative errors are bounded to 12.5% and 6.25% if the input operands are represented in 20 bits, respectively.

Recently, we have proposed a new prefix lookup algorithm which would use the prefixes as scalar numbers. This algorithm could be applied to different tree structures such as Binary Search Tree and some other balanced trees like RB-tree, AVL-tree and B-tree with minor modifications in the search, insert and/or delete procedures to make them capable of finding the prefixes of an incoming string e.g. an IP address. As a result, the search procedure complexity would be O(log n) where n is the number of prefixes stored in the tree. More important, the search complexity would not depend on the address length w i.e. 32 for IPv4 and 128 for IPv6. Here, it is assumed that interface to memory is wide enough to access the prefix and some simple operations like comparison can be done in O(1) even for the word length w. Moreover, insertion and deletion procedures of this algorithm are much simpler and faster than its competitors. In what follows, we report the software implementation results of this algorithm and compare it with other solutions for both IPv4 and IPv6. It also reports on a simple hardware implementation of the algorithm for IPv4. Comparison results show better lookup and update performances or superior storage requirements for Scalar Prefix Search in both average and worst cases.

A K-exponential filter is derived and utilized for pulse shaping to reduce peak to average power ratio (PAPR) without intersymbol interference (ISI). While keeping the same bandwidth, the frequency responses of the filters vary with different values of the parameter k. The minimum PAPR is associated with a value of the parameter k when the roll-off factor α is specified. Simulations show that the PAPR can be reduced compared with the raised cosine (RC) filter in various systems. The derived pulse shaping filters also provide better performance in PAPR reduction compared with the existing filters.

Many services rely on the Internet to provide their customers with immediate access to information. To provide a stable service to a large number of customers, a service provider needs to monitor demand fluctuations and adjust the number and the location of replica servers around the world. Unfortunately, Flash crowds make it quite difficult to determine good number and locations of replica servers because they must be repositioned very quickly to respond to rapidly changing demands. We are developing ExaPeer, an infrastructure for dynamically repositioning replica servers on the Internet on the basis of demand fluctuations. In this paper we introduce ExaPeer Server Reposition (EPSR), a mechanism that quickly finds appropriate number and locations of replica servers. EPSR is designed to be lightweight and responsive to Flash crowds. EPSR enables us to position replica servers so that no server becomes overloaded. Even though no dedicated server collects global information such as the distribution of clients or the load of all servers over the Internet, the peer-to-peer approach enables EPSR to find number and locations of replica servers quickly enough to respond to flash crowds. Simulation results demonstrate that EPSR locates high-demand areas, estimates their scale correctly and determines appropriate number and locations of replica servers even if the demand for a service increases/decreases rapidly.

In this paper, we propose a new 3D sound rendering method for multiple sound sources with limited computational resources. The method is based on fuzzy clustering, which achieves dual benefits of two general methods based on amplitude-panning and hard clustering. In embedded systems where the number of reproducible sound sources is restricted, the general methods suffer from localization errors and/or serious quality degradation, whereas the proposed method settles the problems by executing clustering-process and amplitude-panning simultaneously. Computational cost evaluation based on DSP implementation and subjective listening test have been performed to demonstrate the applicability for embedded systems and the effectiveness of the proposed method.

In PMIPv6, all packets sent by mobile nodes or correspondent nodes are transferred through the local mobility anchor. This unnecessary detour results in high delivery latency and significant processing cost. Several PMIPv6 route optimization schemes have been proposed to solve this issue. However, they also suffer from the high signaling costs when determining the optimized path. The proposed scheme which adopts the prediction algorithm in PFMIPv6 can reduce the signaling costs of the previous schemes. Analytical performance evaluation is performed to show the effectiveness of the proposed scheme.

We proposed a method for reducing LCD motion blur in MPEG domain and analyzing the cause of LCD motion blur. The problem of LCD motion blur is caused by slow response time of liquid crystal and hold-type displaying method of LCDs. The proposed method uses MPEG motion vectors and frequency coefficients of DCT blocks to improve the motion blurs. First, we interpreted the aperture and response time effect of LCD in frequency domain then, modeled sharpening mask filters for the compensation. We confirmed the reduction of motion blurs in LCDs by a motion image simulator.

In this paper, the optimum combination of optical pseudo-noise (PN) code and modulation scheme to achieve high total data transmission rate is presented. Moreover, the bit error rate (BER) performance of a wireless OCDMA system using chip-level detection is evaluated through theoretical analysis in the multi-user case. It is shown that, in a wireless OCDMA system with chip-level detection, the total data transmission rate of a multi-pulse pulse position modulation (MPPM) systems with optical pseudo-noise code generated by an M-sequence is better than that of an MPPM system with optical orthogonal code and that of an MPPM system with an extended prime code sequence. Moreover, the total data transmission rate of an MPPM/SIK system using modified pseudo orthogonal M-sequence sets can achieve more than 1.0 [bit/chip].

This paper proposes a new auto flesh tone balance algorithm for the picture that is taken for people. In this paper, the basis of auto white balance (AWB) is human face in photo. For experiment, the transfer characteristic of camera image sensor is analyzed and the camera output RGB is calculated by measuring the average face chromaticity under standard illuminant. For the face region taken under unknown illuminant, the proposed algorithm makes RGB output rate of face region become its rate of standard face color. For this, it adjusts the R and B channel and performs the chromaticity correction. Algorithm is applied to the light skin color (average face color) in Macbeth color chart and average color of various face colors that are actually measured.

The basic requirements of the distributed Web crawling systems are: short download time, low communication overhead and balanced load which largely depends on the systems' Web partition strategies. In this paper, we propose a DHT-based distributed Web crawling system and several DHT-based Web partition methods. First, a new system model based on a DHT method called the Content Addressable Network (CAN) is proposed. Second, based on this model, a network-distance-based Web partition is implemented to reduce the crawler-crawlee network distance in a fully distributed manner. Third, by utilizing the locality on the link space, we propose the concept of link-based Web partition to reduce the communication overhead of the system. This method not only reduces the number of inter-links to be exchanged among the crawlers but also reduces the cost of routing on the DHT overlay. In order to combine the benefits of the above two Web partition methods, we then propose 2 distributed multi-objective Web partition methods. Finally, all the methods we propose in this paper are compared with existing system models in the simulated experiments under different datasets and different system scales. In most cases, the new methods show their superiority.

We present a novel RFID middleware architecture, Otedama, which makes use of a unique property of RFID information to improve performance. RFID tags are bound to items. New information related to an RFID tag is generated at the site where the ID exists, and the entity most interested in the history and the item itself is in close proximity to the RFID tag. To exploit this property, we propose a scheme which bundles information related to a specific ID into one object and moves that bundle to a nearby server as the RFID tag moves from place to place. By using this scheme, information is always accessible by querying a system near the physical location of the tag, providing better query performance. Additionally, the volume of records that must be kept by a repository manager is reduced, because the relocation naturally migrates data away as physical objects move. We show the effectiveness of this architecture by analyzing data from a major retailer, finding that information retrieval performance will be six times better, and the cost of search is possibly several times cheaper.

Ubiquitous technologies such as sensor network and RFID have enabled companies to realize more rapid and agile manufacturing and service systems. In this paper, we addresses how the huge amount of real-time events coming from these devices can be filtered and integrated to business process such as manufacturing, logistics, and supply chain process. In particular, we focus on complex event processing of sensor and RFID events in order to integrate them to business rules in business activities. We also illustrate a ubiquitous event processing system, named ueFilter, which helps to filter and aggregate sensor event, to detect event patterns from sensors and RFID by means of event pattern languages (EPL), and trigger event-condition-action (ECA) in logistics processes.

In this paper, newly-found properties of the pseudo-ternary maximum-length shift register sequences (pseudo-ternary M-sequences) are described. In particular, the balance properties, the run-length distribution, the cross-correlation properties, and the decimation relationships are shown. The pseudo-ternary M-sequence is obtained by subtracting the one-chip shifted version from the {+1,-1}-valued M-sequence. Moreover, in this paper, performances of the direct sequence spread spectrum (DS/SS) system using the pseudo-ternary M-sequence are analyzed. In the performance evaluation, tracking error performance (jitter) and bit error rate (BER) performance that takes the jitter into account in DS/SS system with a pseudo-ternary M-sequence non-coherent DLL are evaluated. Using the pseudo-ternary M-sequence instead of the conventional M-sequences can improve the tracking error performance about 2.8 [dB]. Moreover, BER of the DS/SS system using the pseudo-ternary M-sequence is superior about 0.8 [dB] to that using the {+1,-1}-valued M-sequence.

In this paper, we investigate a multi-packet transmitting and receiving wireless mesh network that uses a multi-antenna set on each node in the network. In wireless mesh networks for accessing the Internet, the target of all traffic generated from distributed nodes is a gateway (GW). Therefore, many packets are concentrated around the GW and the communication channel around the GW is crowded. To prevent packet congestion around the GW, we propose setting an adaptive array antenna on the GW and the relay nodes. We also calculate an appropriate number of antenna elements considering the fair traffic over the whole region, to prevent packet congestion at each node.

This paper combines the LBP operator and the active contour model. It introduces a salient gradient vector flow snake (SGVF snake), based on a novel edge map generated from the salient boundary point image (SBP image). The MDGVM criterion process helps to reduce feature detail and background noise as well as retaining the salient boundary points. The resultant SBP image as an edge map gives powerful support to the SGVF snake because of the inherent combination of the intensity, gradient and texture cues. Experiments prove that the MDGVM process has high efficiency in reducing outliers and the SGVF snake is a large improvement over the GVF snake for contour detection, especially in natural images with low contrast and small texture background.

The need for efficient movement and precise location of robots in intelligent robot control systems within complex buildings is becoming increasingly important. This paper proposes an indoor positioning and communication platform using Fluorescent Light Communication (FLC) employing a newly developed nine-channel receiver, and discusses a new location estimation method using FLC, that involves a simulation model and coordinate calculation formulae. A series of experiments is performed. Distance errors of less than 25 cm are achieved. The enhanced FLC system yields benefits such as greater precision and ease of use.

In this letter, we propose a novel motion detection method in order to accurately perform the detection of moving objects in the automatic video surveillance system. Based on the proposed Background Generation Mechanism, the presence of either moving object or background information is firstly checked in order to supply the selective updating of the high-quality adaptive background model, which facilitates the further motion detection using the Laplacian distribution model. The overall results of the detection accuracy will be demonstrated that our proposed method attains a substantially higher degree of efficacy, outperforming the state-of-the-art method by average Similarity accuracy rates of up to 56.64%, 27.78%, 50.04%, 43.33%, and 44.09%, respectively.

Data query is one of the most important issues in wireless ad hoc networks, since the ultimate goal of these networks is to support efficient data sharing among wireless nodes. In this paper, we study the issue of data query for delay-sensitive applications in dense wireless ad hoc networks. We focus our attention on step-by-step expanding ring-based data query, which provides an upper bound on query delay to any expanding ring based query strategies. Two replication strategies including Index Replication (IR) and Data Replication (DR) are considered, to improve the delay performance of data query. We analyze the probabilistic behavior of query delay for both DR and IR by theoretical methods, and develop analytical models to approximate the minimum number of replicas required for both query strategies if an application-specified delay bound is imposed. Our work is validated through extensive simulations.

Several papers have presented measured function to handle multi-criteria fuzzy decision-making problems based on interval-valued intuitionistic fuzzy sets. However, in some cases, the proposed function cannot give sufficient information about alternatives. Consequently, in this paper, we will overcome previous insufficient problem and provide a novel accuracy function to measure the degree of the interval-valued intuitionistic fuzzy information. And a practical example has been provided to demonstrate our proposed approach. In addition, to make computing and ranking results easier and to increase the recruiting productivity, a computer-based interface system has been developed for decision makers to make decisions more efficiently.

A planar inverted-E (PIE) antenna that can achieve a wide impedance bandwidth is proposed. The antenna is realized by inserting a branch capacitance between the feed line and the shorting pin of a conventional planar inverted-F antenna (PIFA). Such a modification significantly enhanced the impedance bandwidth while maintaining the antenna size. The proposed antenna possesses a very wide impedance bandwidth of 1250 MHz (1650-2900 MHz) at a voltage standing wave ratio (VSWR) <3. In addition, good radiation patterns were obtained at the desired frequency bands.