A new single resistance controlled quadrature oscillator using two current differencing buffered amplifiers (CDBAs), four resistors and two grounded capacitors is presented. Outputs of two sinusoidal signals with 90phase difference are available in the proposed quadrature oscillator. The oscillation condition and oscillation frequency of the proposed quadrature oscillator are independently controllable through different resistors. The proposed quadrature oscillator employs only grounded capacitors. The use of only grounded capacitors is ideal for integration. Simulation results are included.

This paper proposes three-phased traffic conditioner (3PTC) to be installed at edge routers in Differentiated Services (DiffServ) networks. 3PTC ensures that Assured Service (AS) flows are supplied with the throughput assurance, which stems from alleviating the impact of the size of TCP reserved rate, UDP/TCP interaction, Round Trip Time (RTT) and number of microflows. 3PTC is composed of token bucket phase, writing probability (WP) calculation phase and queue management phase. Computer simulation results show that 3PTC guarantees throughput assurance and provides end users with expected service levels.

In the field of computer graphics (CG), some adaptive methods have been proposed in order to make CG images more real in relatively low computational cost. As one of such adaptive methods, in this paper, an adaptive method will be proposed for detection of edges and approximation of surfaces in the use of the so-called automatic differentiation. In the proposed method a CG image with high quality can be generated in suitable computational cost. In this paper, three cases will be considered. The first is an adaptive distributed ray tracing which can adaptively generate anti-aliased CG images in suitable computational cost. The second is a high quality triangular meshing, which guarantees accuracy of the generated meshes according to shape of given surface in suitable computational cost. The last case is used in the so-called radiosity method.

With the emerging technology of photonic networks, careful design becomes necessary to make most of the already installed fibre capacity. Appropriate numerical tools are readily available. Usually, these are based on the split-step Fourier method (SSFM), employing the fast Fourier transform (FFT). With N discretization points, the complexity of the SSFM is O(N log2N). For real-world wavelength division multiplexing (WDM) systems, the simulation time can be of the order of days, so any speed improvement would be most welcome. We show that the SSFM is a special case of the so-called collocation method with harmonic basis functions. However, for modelling nonlinear optical waveguides, various other basis function systems offer significant advantages. For calculating the propagation of single soliton-like impulses, a problem-adapted Gauss-Hermite basis leads to a strongly reduced computation time compared to the SSFM . Further, using a basis function system constructed from a scaling function, which generates a compactly supported wavelet, we developed a new and flexible split-step wavelet collocation method (SSWCM). This technique is independent of the propagating impulse shapes, and provides a complexity of the order O(N) for a fixed accuracy. For a typical modelling situation with up to 64 WDM channels, the SSWCM leads to significantly shorter computation times than the standard SSFM.

Scaled models for an anatomical head model and a simple head model are used to investigate the effects of head size on SAR characteristics for a cellular phone exposure at 835 MHz. From the results, we can see that a larger head produces a higher localized SAR and a lower whole-head averaged SAR.

The FDTD method needs Fourier analysis to obtain the fields of a single frequency. Furthermore, the frequency spectra of the fields used in the FDTD method ordinarily have wide bands, and all the fields in FDTD are treated as real numbers. Therefore, if the permittivity ε and the permeability µ of the medium depend on frequency, or if the surface impedance used for the surface impedance boundary condition (SIBC) depends on the frequency, the FDTD method becomes very complicated because of convolution integral. In the electromagnetic theory, we usually assume that the fields oscillate sinusoidally, and that the fields and ε and µ are complex numbers. The benefit of introduction of the complex numbers is very extensive. As we do in the usual electromagnetic theory, the authors assume that the fields in FDTD oscillate sinusoidally. In the proposed FDTD, the fields, ε, µ and the surface impedances for SIBC are all treated as the complex numbers. The proposed FDTD method can remove the above-mentioned weak points of the conventional FDTD method.

We have focused on the RIO queueing mechanism in statistical bandwidth allocation service, which uses AF-PHB. We have studied the parameterization of RIO to achieve both high throughput and low delay. We were able to parameterize RIO for that purpose in terms of both minth and maxp used in dropping OUT packets. Furthermore, we have also examined the parameterization regarding EWMA (Exponential Weighted Moving Average), i.e., weight factor wqout, and have shown that dropping OUT packets should depend upon the queue length without much delay unlike in RED. From our simulation results, we could see that our parameterization provided high throughput performance and also limited the queue length in a narrow range more effectively.

In Vivo Diffusion Tensor Magnetic Resonance Imaging (DT-MRI) can now be used to elucidate and investigate major nerve pathways in the brain. Nerve pathways are constructed by a) calculating a continuous diffusion tensor field from the discrete, noisy, measured DT-MRI data and then b) solving an equation describing the evolution of a fiber tract, in which the local direction vector of the trajectory is identified with the direction of maximum apparent diffusivity. This approach has been validated previously using synthesized, noisy DT-MRI data. Presently, it is possible to reconstruct large white matter structures in the brain, such as the corpus callosum and the pyramidal tracts. Several problems, however, still affect the method's reliability. Its accuracy degrades where the fiber-tract directional distribution is non-uniform, and background noise in diffusion weighted MRIs can cause computed trajectories to jump to different tracts. Nonetheless, this method can provide quantitative information with which to visualize and study connectivity and continuity of neural pathways in the central and peripheral nervous systems in vivo, and holds promise for elucidating architectural features in other fibrous tissues and ordered media.

In this paper, we discuss the impossible differential cryptanalysis for the block cipher Zodiac. The main design principles of Zodiac include simplicity and efficiency. However, the diffusion layer in its round function is too simple to offer enough security. The impossible differential cryptanalysis exploits such weakness in Zodiac. Our attack using a 14-round impossible characteristic derives the 128-bit master key of the full 16-round Zodiac faster than the exhaustive search. The efficiency of the attack compared with exhaustive search increases as the key size increases.

This paper studies security of Feistel ciphers with SPN round function against differential cryptanalysis, linear cryptanalysis, and truncated differential cryptanalysis from the "designer's standpoint." In estimating the security, we use the upper bounds of differential characteristic probability, linear characteristic probability and truncated differential probability, respectively. They are useful to design practically secure ciphers against these cryptanalyses. Firstly, we consider the minimum numbers of differential and linear active s-boxes. They provide the upper bounds of differential and linear characteristic probability, which show the security of ciphers constructed by s-boxes against differential and linear cryptanalysis. We clarify the (lower bounds of) minimum numbers of differential and linear active s-boxes in some consecutive rounds of the Feistel ciphers by using differential and linear branch numbers, Pd, Pl, respectively. Secondly, we discuss the following items on truncated differential probability from the designer's standpoint, and show how the following items affect the upper bound of truncated differential probability; (a) truncated differential probability of effective active-s-box, (b) XOR cancellation probability, and (c) effect of auxiliary functions. Finally, we revise Matsui's algorithm using the above discussion in order to evaluate the upper bound of truncated differential probability, since we consider the upper bound of truncated differential probability as well as that of differential and linear probability.

The differentiated services (Diffserv) architecture is a potential solution for providing quality of service (QoS) on the Internet. Most existing studies focus on providing service differentiation among few service classes. In this paper, we propose an approach which can achieve per-flow weighted fair rate allocation in a differentiated services network. Following the design philosophy of the Diffserv model, in the proposed approach core routers do not need to keep per-flow information. An edge router adjusts the transmission rate of a flow based on the feedback carried on control packets, which are inserted by the ingress edge router and returned by the egress edge router. Core routers periodically estimate the fair share rate of each virtual flow and mark the results in control packets. We use both simulations and analysis to evaluate the performance of the proposed approach. The analytical results show that our approach allows a system to converge to weighted fair rate allocations in limited time. Through the simulation results, we can further validate the analytical results, and demonstrate that better throughput can be achieved.

Most applications can adapt their coding techniques and sending rates according to the network congestion and the resource needed can be provided at the beginning of the transmission. So traditional Differentiated Services (DiffServ) model is too rigid to them. In this paper, we are seeking a balance between the relative DiffServ and the absolute DiffServ and propose a new Diffserv model, a relative Differentiated Service model with admission control, which suits the adaptive application. By providing the proportional differentiated services in core routers and loss-rate based CAC control in edge routers, we can make both the network and the users adaptive: the network is adaptive to the traffic load and the users is adaptive to the network congestion. This model is promising to the elastic but unpredictable traffic, such as IP telephony or other multimedia applications.

Generalized Pulse Spectrum Technique (GPST) is a method to solve the inverse problems of wave-propagation and diffusion-dominated phenomena, and therefore has been popularly applied in image reconstruction of time-resolved diffuse optical tomography. With a standard GPST for simultaneous reconstruction of absorption and scattering coefficients, the products of the gradients of the Green's function and the photon-density flux, based on the photon-diffusion equation, are required to calculate the diffusion-related Jacobian matrix. The adversities are of two-folds: time-consuming and singular in the field near the source. The latter causes a severe insensitivity of the algorithm to the scattering changes deep inside tissue. To cope with the above difficulties, we propose in this paper a modified GPST algorithm that only involves the Green's function and the photon-density flux themselves in the scattering-related matrix. Our simulated and experimental reconstructions show that the modified algorithm can significantly improve the quality of scattering image and accelerate the reconstruction process, without an evident degradation in absorption image.

The Quality of Service (QoS) reservations in Differentiated Service (DiffServ) networks can be classified into two sets: Book-ahead (BA) requests and Instantaneous Requests (IRs). When an admitted BA request becomes active, some ongoing IRs is dropped when the bandwidth is insufficient for supporting both IRs and BA requests. The admission control should predict the lifetime, i.e. look-ahead time, of the IRs to prevent the admitted IRs from being dropped. The control should then check whether the available bandwidth during the look-ahead time is sufficient for the incoming IRs. We propose an application-aware look-ahead admission control for IRs, which determines the look-ahead time for specific types of IR applications. An admitted BA request might block subsequent ones that could bring more effective revenue. Thus, we propose the deferrable model of the admission control for BA requests. Simulation results indicate that the application-aware look-ahead admission control successfully reduces the dropping probability and wasted revenue of IRs by up to 10 times and 30%, respectively. Besides, the deferrable model indeed results in more BA effective revenue.

A technique was developed to reconstruct the cross-sectional image of the absorption distribution in a diffuse medium using backscattered light. In this technique, we illuminate an object with an ultra-short pulse, and measure the time-resolved pulse shape of the light backscattered from the object. The absorption distribution of the scattering object can be estimated using the propagation-path distribution of photons at each detection time and the optical impulse response of backscattered light. In a simulation, the effectiveness of this technique was verified in the cases of a layered absorber and a three dimensional absorber. The nonlinear relationship between the depth of the probing region and the propagation time was clarified. The accuracy of the image reconstruction was significantly improved by the aperiodic sampling of the backscattered impulse response according to the nonlinear relation. The feasibility of the proposed technique was verified in the experiment with a model phantom.

In recent years, the concept of Quality of Service (QoS) has gained attention in the network research community and its extension towards delivering QoS level assurance to sensitive applications has generally been agreed to be crucial for the longevity and usability of the Internet. On the Internet, the Differentiated Services (DiffServ) architecture is a general framework for the differentiated treatment of traffic aggregates in the core network. However, DiffServ does not extend to end-to-end QoS assurance. In this paper, we propose a simple resource-brokering scheme operating over a hierarchically connected internetwork of administratively-independent DiffServ-capable domains that is a simplified model of the Internet. The proposed asynchronous, multi-agent resource-brokering scheme operates locally but avoids conflicts globally. In this way, the traffic control reflects the underlying structure of the internetwork, introduces only a localized complexity thus scaling up well, and permits independent policies between the interconnected domains.

A digital noncoherent demodulation scheme is presented for reception of Gaussian frequency shift keying (GFSK) signals with small modulation index. The proposed differential demodulator utilizes oversampled signals to estimate the symbol timing and to compensate the frequency offset. The performance of the proposed receiver is evaluated in terms of the bit-error rate (BER). Numerical results show that the proposed demodulator provides performance comparable to that of conventional baseband differential demodulator, while significantly reducing the implementation complexity suitable for single chip integration with direct conversion radio frequency module. Finally the performance of the proposed receiver is improved by adding a simple decision feedback module.

This paper proposes a methodology for detecting matte-surfaced objects on a scene using color information and spatial thresholding. First, a difference image is obtained via a pixel-wise comparison of the color content of a 'clean' reference image and a sample image. Then, spatial thresholding of the difference image is performed to extract any objects of interest, followed by morphological post-processing to remove pixel noise. We study the applicability of two alternate color spaces (HSV, CIE Lab) for computing the difference image. Similarly, we employ two spatial thresholding methods, which determine the global threshold from the local spatial properties of the difference image. We demonstrate the performance of the proposed approach in scene surveillance, where the objective is to monitor a shipping dock for the appearance of needless objects such as cardboard boxes. In order to analyze the robustness of the approach, the experiment includes three different types of scenes categorized as 'easy,' 'moderate,' and 'difficult,' based on properties such as heterogeneity of the background, existence of shadows and illumination changes, and reflectivity and chroma properties of the objects. The experimental results show that relatively good recognition accuracy is achieved on 'easy' and 'moderate' scenes, whereas 'difficult' scenes remain a challenge for future work.

This study investigates the problem of unfairness when QoS routing does not consider the mix of traffic classes. Unfairness is mainly caused by routing different traffic flows of the same class through paths with extremely different traffic mixtures, involving various service classes. Next, a new routing scheme--Service-sensitive Routing (SSR), which takes the state of traffic mixture of the various service classes into account, is proposed. To determine the QoS route for a flow request, SSR not only considers the available bandwidth and delay of the candidate paths, but also considers the mix of traffic classes on the paths. Additionally, the hybrid granularity routing decision in SSR scheme is scalable and suitable for the Differentiated Services and MPLS networks. Extensive simulations show that SSR can effectively reduce the variance of the average of queuing delays, for example by approximately 20% to 35% for a moderate offered load, compared to the shortest path routing. Furthermore, this routing scheme reduces the fractional reward loss and bandwidth blocking probability.

A periodic approach introduced previously is applied to the TM wave scattering from a finite periodic surface. A mathematical relation is proposed to estimate the scattering amplitude from the diffraction amplitude for the periodic surface, where the periodic surface is defined as a superposition of surface profiles generated by displacing the finite periodic surface by every integer multiple of the period . From numerical examples, it is concluded that the scattering cross section for the finite periodic surface can be well estimated from the diffraction amplitude for a sufficiently large .