This paper describes the nonlinear behavior of CMOS ADC input capacitance. Our SPICE simulation, based on the BSIM3v3 model, shows that the input capacitance of a typical CMOS flash-type ADC (with a single-ended NMOS differential pair preamplifier as the input stage) decreases as its input voltage increases; this is the opposite of what we would expect if we considered only MOSFET gate capacitance nonlinearity. We have found that this can be explained by the nonlinearity of the total effective input capacitance of each differential amplifier stage, taking into account not only MOSFET capacitance but also the fact that the contributions of the gate-source and gate-drain capacitances to the input capacitance of the differential pair change according to its input voltages (an ADC input voltage and a reference voltage). We also discuss design methods to reduce the value of the CMOS ADC effective input capacitance.

This paper describes the formula for dynamic power dissipation of a track/hold circuit as a function of the input frequency, the input amplitude, the sampling frequency, the track/hold duty cycle, the power supply voltage and the hold capacitance for a sinusoidal input.

Revocation is one of the major problems for access control systems. Especially, the revocation cost for the data outsourced in the third party environment such as cloud storage systems. The revocation in the cloud-based access control typically deals with the cryptographic operations that introduce costly overheads for key re-generation, file re-encryption, and key re-distribution. Also, the communication for retrieving files for re-encryption and loading them back to the cloud is another non-trivial cost for data owners. In this paper, we propose a Very Lightweight Proxy Re-Encryption (VL-PRE) scheme to efficiently support attribute-based revocation and policy update in the collaborative data sharing in cloud computing environment. To this end, we propose three-phase VL-PRE protocol including re-encryption key generation, re-encryption key update, and re-encryption key renewal for supporting the optimized attribute revocation and policy update. Finally, we conduct the experiments to evaluate the performance of our VL-PRE and show that it exhibits less computation cost with higher scalability in comparison with existing PRE schemes.

In computer simulation of a large number of moving objects (MOs), how to enlarge Δt (the interval between the simulation time steps) without introducing causality errors is one of the primary keys to enhancing performance. Causality errors can be avoided by using the same Δt among related MOs when they are in the scene of detection (SoD). But in a large-scale MO simulation, MOs interact with one another in a complicated manner requiring a large calculation cost to predict the beginning time of SoD. In this paper we propose an event-aware dynamic time step synchronization method (DTSS) for distributed MO simulation, which increases Δt without introducing causality errors and speeds up the simulation. DTSS can be implemented with little calculation cost because: (1) DTSS does not calculate the beginning time of SoD exactly, but calculates the time for possible entry into SoD with a simple mechanisim, and (2) MO simulation consists of a "movement"-phase and a "detection"-phase in which the distance-calculation between MOs requires a heavy load, and DTSS utilizes the distance values to calculate Δt. In this paper, we also discuss a suitable HLA based time management mechanism to implement DTSS on a distributed computing environment. In the performance evaluation of DTSS, the calculation cost of DTSS is implemented by using the HLA suitable time management mechanism. The results show that DTSS can be executed within the ideal time plus its 1% over-cost when a basic scenario of war-game simulation is employed. Therefore if the ratio of SoD to the total simulation is small, the execution time is expected to decrease to nearly this ratio. We also introduce the criterion for determining when DTSS is superior to the conventional method by using the performance evaluation results. The results presented in this paper are effectively utilized when DTSS is applied to practical applications.

A huge amount of information is being accumulated on the Internet as the Internet usage spreads and numbers of Web pages increase. However, it is also becoming very difficult to find required information, even when the information exists. The actual value of the Web is thus much lower than its potential value. In order to solve this problem, technologies which allow machines to handle Web content in an efficient, accurate, and flexible way by using machine-readable metadata are being developed. This paper is a survey of knowledge representation on the Web, and the utilization of metadata and ontology for data integration and information sharing, with a focus on the Semantic Web concept.

Smart education environment, that is a learning environment utilizing the Information Communication Technology (ICT), has attracted a great deal of attention. In order to expand this environment, we need a system that can establish the learning environment armed cloud systems to reduce a significant strain on teaching staff. The important issue for such system is extensibility because the system should be adapted to many kinds of original digital learning material with minimum modification. Therefore, this paper proposes “An Application Framework for Smart Education System: SES Framework”. In this Smart Education System, multi-aspect information concerning to a technical term embedded in the original digital learning material can be retrieved from different social media automatically. They can be also displayed on multi-screen devices according to user's operation. It is implemented based on “Transforming Model” which enables the migration of the original digital learning material to the smart education environment. It also has an easy operation flow for trainees named “three-step selection flow”. SES Framework derived from Model-View-Controller (MVC) pattern is based on the system architecture that enables triple mashup against the original digital learning material, external social media, and screen devices in front of users. All these functionalities have been implemented on cloud systems. We show SES Framework through the implementation example. We also demonstrate the effectiveness of SES Framework by indicating the system modification case study.

In this paper, performance enhancement algorithm in DQDB MAN (Distributed Queue Dual Bus Metropolitan Area Networks) is proposed. DQDB which is standardized by IEEE 802 committee is one of protocols which provide medium access control in metropolitan area networks. In DQDB MAN, a fixed-length slot is a unit for transmission and exchange. Information is transfered by using the slot. The transit delay of the slot has to be small since the slot is not stored in each node. However, the slot having finished information transfer can not be reutilized in downstream nodes. This problem has been discussed by IEEE 802 committee and some societies. This paper proposes new algorithm for improving this point and shows implement scheme to realize it. At first, in this paper, a special node called an erasure node is introduced in a DQDB network and its operation is described. Moreover its implement scheme is shown. In the latter, the performance of this algorithm is evaluated using a queueing model. The result shows the effectiveness of the proposed algorithm.

In this paper, we evaluate the computational complexity and the performance of the RAKE receivers for the Direct Sequence--Ultra Wideband (DS-UWB) with considering the accuracy of channel estimation in a multipath channel. As RAKE receivers for DS-UWB, we consider the maximal-ratio combining (MRC)-RAKE, the minimum mean square error (MMSE)-RAKE, and the MRC-RAKE-Equalizer that is the MRC-RAKE followed by a liner equalizer. Generally, if the channel estimation is perfect, as the number of fingers or taps increases, the performance of each receiver is improved, however the computational complexity of each receiver increases. In practice, the channel estimation is not perfect. The channel estimation error makes their performances degraded. Therefore, the performances of the RAKE receivers depend on the accuracy of channel estimation. Consequently, we evaluate the computational complexities and the Bit Error Rates (BERs) of MRC-RAKE, MMSE-RAKE, and MRC-RAKE-Equalizer with considering the accuracy of channel estimation for DS-UWB. We show that the accuracy of channel estimation affects the BER of each receiver significantly. We also show that when the accuracy of channel estimation is high, MRC-RAKE-Equalizer can achieve the better BER than MMSE-RAKE with less computational complexity, while MMSE-RAKE can achieve the better BER than MRC-RAKE-Equalizer when the accuracy of channel estimation is low.

Today, trust plays a central role in services in distributed environments. Conventionally deployed trust has been based on static framework in which a server responds to a service request under statically determined policies. However, in accordance with evolution of distributed environments empowered with IoT and federated access mechanisms, dynamic behavior must be analyzed and taken into service provision, which conventional trust cannot properly handle. In this paper, we propose an extension of PDP (Policy Decision Point) in which assertions together with service requests are evaluated. Furthermore, the evaluation may be dynamically configured in dynamically evolving trust environment. We propose an elastic trust model in view of dynamic trust environment. This enables intuitionistic modeling of typical concrete elastic distributed services.