Non-repudiation is a basic security requirement for electronic business applications to protect against a sender's false denial of having created and sent a message. Typically non-repudiation protocols are constructed based on digital signatures. However, there has been no theoretical treatment of such non-repudiation protocols. In this paper, we provide a formal security definition of non-repudiation protocols and analyze the security of a signature-based protocol. Our security definition and analysis are based on Canetti's framework of universally composable security.

We present a learning algorithm of the Hopfield neural network for minimizing edge crossings in linear drawings of nonplanar graphs. The proposed algorithm uses the Hopfield neural network to get a local optimal number of edge crossings, and adjusts the balance between terms of the energy function to make the network escape from the local optimal number of edge crossings. The proposed algorithm is tested on a variety of graphs including some "real word" instances of interconnection networks. The proposed learning algorithm is compared with some existing algorithms. The experimental results indicate that the proposed algorithm yields optimal or near-optimal solutions and outperforms the compared algorithms.

A "based" plane triangulation is a plane triangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane triangulations having exactly n vertices and with the maximum degree exactly D. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications.

Marginal reliability importance (MRI) of a component in a system is defined as the rate at which the system reliability changes over changes of the component reliability. MRI helps network designers to construct a reliable network layout. We consider a problem to compute MRI of all components in a network system considering all-terminal reliability in order to rank the components with respect to MRI. The problem is time-consuming since computing network reliability is #P-complete. This paper improves the traditional approach for the problem to proposes an efficient algorithm. The algorithm applies some network transformations, three network reductions and one network decomposition. We have proved lemmas with respect to the relationship between the transformations and MRI, which compute MRI for an original network by using MRI and reliability for transformed networks. Additionally, we have derived a deformed formula to compute MRI, which can also reduce computational task. Numerical experiments revealed that the proposed algorithm reduced computational time considerably compared to the traditional approach.

Electrical properties of contacts between head-tail coupled poly(3-hexylthiophene), PHT and Al (and Au) in planer type and sandwich type diodes of Al/PHT/Au have been studied. The contact resistances are directly evaluated by probing the potential profile of PHT between the metal electrodes using micromanipulators installed in scanning electron microscope. In the potential profile of planer type diode, a large potential cliff is observed at Al/PHT interface and some appreciable potential step is also found at PHT/Au interface. The contact resistance at the Al/PHT interface deduced from the potential profile shows the bias and its polarity dependence, indicating the existing of the Schottky like junction. At forward bias, it is found that the residual resistance at Al/PHT interface limits the diode performance. The residual resistance is supposed to be insulating layer of Al oxide. At larger reversed bias, the contact resistance at Al/PHT decreased abruptly due to the Zener breakdown. The potential profile of sandwich type diode is similar to that of planer type diode. It is found that even the PHT/Au contact shows the ohmic behavior, the contact resistance is significant as to limit the maximum current of the cells.

We present a digital algorithm for gray-scale/color image segmentation of real-time video signals and a cell-network-based implementation architecture in conventional CMOS technology. Practical application in fully-integrated QVGA-size video-picture segmentation chips is estimated to become possible at the 90 nm technology node.

Generating the identifiers of XML nodes is a crucial task in XML applications. On the other hand, the structural information of XML data is essential to evaluate the XML queries. Several numbering schemes have been proposed so far to express the structural information using the identifiers of XML nodes. In this paper, we introduce a new numbering scheme called recursive UID (rUID) that has been designed to be robust in structural update and applicable to arbitrarily large XML documents. We investigate the applications of rUID to XML query processing in a system called SKEYRUS, which enables the integrated structure-keyword searches on XML data. Experimental results of the performance of SKEYRUS are also reported.

In this letter, we investigate serially concatenated space-time codes (SC-STs) applying iterative decoding topologies in wideband code division multiple access (WCDMA) communication systems. In the decoding algorithm, an iterative (turbo) process is used, where a priori probability (APP) is exchanged between the symbol-by-symbol space-time (ST) decoder and the bit-by-bit convolutional decoder. The experimental results show that in a Rayleigh fading channel environment the serially concatenated interleaved space-time coding systems show significant error correction capability, and based on the applied system configurations, the nonrecursive ST code outperforms the recursive ST code.

Photocatalytic TiO2 films were prepared by reactive gas flow sputtering (GFS), which enables sputter-deposition at a high pressure of about 100 Pa. A pure Ti tube was used as the target, and the O2 gas was supplied in front of the substrate, resulting in a very stable discharge and a high deposition rate of 80 nm/min. The crystal structure and morphology of TiO2 films were found to strongly depend on the flow rate of O2 gas during sputtering. Polycrystalline films composed of rutile and anatase crystallites were deposited at a low O2 flow rate of less than 2 sccm when Ar flow rate was set at 300 sccm, and amorphous films were deposited at higher O2 flow rates. Polycrystalline films composed of very small crystallites showed high levels of photocatalytic activity, while amorphous films showed no activity.

In order to transport an ever-increasing amount of IP traffic effectively, Photonic IP networks that employ wavelength routing and Layer 3 cut-through are very important. This paper proposes a new network design algorithm that minimizes the network cost considering IP traffic growth for multi-layered photonic IP networks that comprise electrical label switched paths (LSPs) and optical LSPs. We evaluate the network cost obtained from the developed network design algorithm that considers IP traffic growth and compare it to the results obtained from a static zero-based algorithm. The static zero-based algorithm does not take into account the history of progressive past IP traffic changes/growth until that time. The results show that our proposed algorithm is very effective; the cost increase from the cost obtained using the zero-based algorithm is marginal. The algorithm developed herein enables effective multi-layered photonic IP network design that can be applied to practical networks where IP traffic changes/increases progressively and that can be used for long term network provisioning.

We have developed an algorithm called the "spectral-domain-to-real-space approach" (SDRSA) to analytically calculate radiation from the two-dimensional current density distribution in microstrip line configurations where the microstrip lines are represented in the form of a three-dimensional inhomogeneous structure. The algorithm is based on the spectral-domain approach used to estimate radiation from microstrip line configurations. Calculation results obtained by using the SDRSA and the current density distribution from a quasi-TEM mode model of microstrip lines agree well with the corresponding estimations obtained by using the equivalent electric current source method and the magnetic current source method, and with the experimental results obtained in the frequency band of up to 1 GHz.

A mechanical phase shifter is designed for beam scanning in co-phase fed single-layer slotted waveguide arrays. The multiple-way power divider in this array consists of a series of π-junctions with one guide wavelength spacing in a feed waveguide. The movable narrow walls placed between the π-junctions perturb the guide wavelength as well as the phase of output ports. Method of Moment (MoM) analysis for one unit consisting of one movable plate and two junctions is conducted to estimate the available phase shift as well as the degradation of reflection. A phase shift of 86 degrees is predicted between two π-junctions under the condition of reflection below -20 dB; experiments at 4 GHz confirmed the design. The beam scanning capability of the arrays is also surveyed and the beam-scanning of about 10 degrees is predicted.

High-quality Fe3O4 thin films have been fabricated onto metallic underlayers of Cr/Cu and Al by rf-magnetron sputtering at low substrate temperatures (<573 K). The measured saturation magnetizations Ms are 462 emu/cm3 for Al (50 nm)/Fe3O4 (200 nm) and 422 emu/cm3 for Cr (45 nm)/Cu (300 nm)/Fe3O4 (200 nm), which are markedly enhanced compared with that for the reference sample deposited directly on a glass substrate, and practically comparable to the bulk value of 477 emu/cm3. Highly conductive transport with an order-disorder change of the Verwey transition was observed in the current-perpendicular-to-plane geometry. The order of decrease in coercive field was achieved by exchange coupling with an overlaid NiFe layer.

In this paper, we consider a problem of global stabilization of a class of nonlinear systems which are approximately feedback linearizable. We propose a control law with the gain-scaling factor and analytically show the robust aspect of approximate feedback linearization in a more general framework.

This paper discusses performance issues for a sensor network. It describes the unique features of the sensor network and discusses studies on its protocols. Performance measures for the sensor network are investigated and studies related to them are surveyed. As an example of performance measures, this paper analyzes a sensor network's availability, which is the probability that all the sensor nodes are working without any of them having run out of energy. An explicit formula for the sensor network availability is derived, and the optimal placement of sensor nodes is investigated.

In recent years, there has been a rapid and widespread proliferation of non-traditional embedded computing platforms such as digital camcorders, cellular phones, and portable medical devices. As applications become increasingly sophisticated and processing power increases, the application designer has to rely on the services provided by the real-time operating systems (RTOSs). These RTOSs must not only provide predictable services but must also be efficient and small in size. Kernel services should also be deterministic by specifying how long each service call will take to execute. Having this information allows the application designers to better plan their real-time application software so as not to miss the deadline of each task. In this paper, we propose a generalized deterministic scheduling algorithm that makes the task scheduling time constant irrespective of the number of tasks created in an application. The proposed algorithm eliminates the restriction on the maximum number of task priorities imposed on the existing ones, without additional memory overhead.

In 1983, Chaum first introduced the concept of blind signature. In 2003, Hwang, Lee and Lai pointed out that the Chaum scheme cannot meet the untraceability property of the blind signature scheme. This letter will demonstrate that Hwang et al.'s claim is incorrect and the Chaum blind signature scheme still keeps the untraceability property.

This work presents a new sigma-delta modulator (SDM) architecture for a wide bandwidth receiver. This architecture contains dual-bandwidth for W-CDMA and GSM system applications. Low-distortion swing-suppressing SDM and interpolative SDM cascaded units are used together. Using the low-distortion swing-suppressing technique, the resolution can be improved even under non-linearity effects. The interpolative SDM extends the signal bandwidth and represses the high-band noise. The SDM used in the W-CDMA and GSM applications was designed and simulated using 0.25-µm 1P5M CMOS technology. The simulated peak SNDR of W-CDMA and GSM are 72/70 dB and 82/84 dB in Low-IF/Zero-IF standards.

In recent years, digital predistortion linearizers have been used in power amplifiers for mobile communications because they are simpler and provide higher power efficiency than conventional feedforward systems. However, in systems that cover a wider frequency band, it is impossible to disregard the frequency characteristics of their various parameters since the degradation that can result causes a decline in output power efficiency which is the most important property of a power amplifier. To date, no detailed studies have been carried out on predistortion compensation systems. Thus, we focused our research on these systems and in this paper we report the simulation and experimental results we obtained for clarifying these effects. In our experiments, we used a W-CDMA power amplifier to determine how much the distortion compensation effect is degraded by the frequency characteristics of analog RF circuits. The results of experiments to determine the relationship between the ACLR (Adjacent Channel Leakage power Ratio) and power efficiency are also reported.

Vector quantization (VQ) features a very heavy encoding process. In previous work, an efficient encoding algorithm using mean pyramid has been developed. To improve it further, a fast search algorithm is proposed in this letter. Specifically speaking, four major modifications are made. First, to rearrange the original codebook directly along the sorted real sums to reduce the search scope and then update the lower and upper bound dynamically. Second, to use sum instead of the mean that includes roundoff error to thoroughly avoid a possible mismatched winner. Third, to construct a sum pyramid using 2-pixel-merging other than 4-pixel-merging way to generate more in-between levels. Fourth, to introduce the Cauchy-Schwarz inequality to bridge Euclidean and Manhattan distance together so that the difference check between 2 vectors can be pre-conducted only by much lighter Manhattan distance computation. Experimental results show that the proposed algorithm is more search-efficient.