In 2003, Wu proposed a threshold access control scheme based on smart cards. In this letter, we show that the scheme is vulnerable to various attacks.

This paper addresses issues regarding to the development of teleconferencing support collaboration focusing on the realistic sensation domain. It argues that the gaze communications are the important mechanisms to enable visual channel and social presence in human-human communications. We propose a new aspect to establish multiple eye contacts and community awareness in multiparty videoconference (VC). The participants can aware of being recognized from any remote sites while they are talking with each other. Community awareness means the ability to aware of group communication in the videoconference. The participant can recognize of who is talking with whom and any communicative groups in a conference. An intelligent image arrangement through a unique position of camera is built and simulated. The systematic placement of images serves the gaze communications by utilizing the characteristic of gaze direction and image's position. The experimental results show that the proposed approach has the significant improvement in the interpersonal communication compared with the conventional VC system.

This paper proposes a novel feature selection method for the fuzzy neural networks and presents an application example for 'personalized' facial expression recognition. The proposed method is shown to result in a superior performance than many existing approaches.

The high-end telecom terminal and PDAs, sometimes called Personal Trusted Devices (PTDs) are programmable, have tens of megabytes memory, and rather fast processors. In this paper we analyze, when it is energy-efficient to transfer application data compressed over the downlink and then decompress it at the terminal, or compress it first at the terminal and then send it compressed over up-link. These questions are meaningful in the context of usual application code or data and streams that are stored before presentation and require lossless compression methods to be used. We deduce an analytical model and assess the model parameters based on experiments in 2G (GSM) and 3G (FOMA) network. The results indicate that if the reduction through compression in size of the file to be downloaded is higher than ten per cent, energy is saved as compared to receiving the file uncompressed. For the upload case even two percent reduction in size is enough for energy savings at the terminal with the current transmission speeds and observed energy parameters. If time is saved using compressed files during transmission, then energy is certainly saved. From energy savings at the terminal we cannot deduce time savings, however. Energy and time consumed at the server for compression/decompression is considered negligible in this context and ignored. The same holds for the base stations and other fixed telecom infrastructure components.

In this letter, we present an adaptive hopping technique for a wireless personal area network (WPAN) system employing a frequency hop spread spectrum (FH/SS). Analytical results based on the closed-form solutions for the aggregate throughput show that the proposed hopping algorithm using two defined hopping criteria is more friendly towards all kinds of interferers and gives an enhanced throughput with a moderate computational complexity.

This paper presents the summarized achievements of "Study Group on Software Technology for Radio Equipment" held at TELEC from April 2000 to March 2003. The Study Group specified the essential issues on Software Defined Radio (SDR), and discussed desirable methods to evaluate conformity to technical regulations in radios that can change RF characteristics only by changing software. The biggest objective in SDR is to build the architecture to allow users to install software exclusively in the combination of hardware and software that have passed the certification test. The Study Group has reached a solution by introducing the idea of "tally." This paper explains the concept of tally, and proposes two types of systems to use tallies in checking adaptability in combinations of hardware and software.

A framework is described for a peer-to-peer information exchange system, and a collaborative information retrieval (IR) scheme for the system is proposed. The aims of the system include smooth knowledge and information management to activate organizations or communities. Conventional server-centric systems are weak because they create information-providing bottlenecks. Accordingly, the proposed framework targets the collaborative inter-working of personal repositories that accumulate per-user information, and accept and service requests. Issues concerning the framework are addressed. One issue is the retrieval of information from another's personal repository; the retrieval criteria of a system are tightly personalized for its user. The system is assumed to employ a vector space model with a concept-base as its IR mechanism. The vector space on one system is very different from that on another system. Another issue is the automated control of the information-providing criteria. This paper presents solutions to the first problem. To achieve IR that provides satisfactory results to a user requiring information from another's personal repository, we need vector space equalization to compensate for the differences in the vector spaces of the personal repositories. The paper presents a vector space equalization scheme, the automated relevance feedback scheme, that compensates the differences in the vector spaces of the personal repositories. We implement the scheme as a system and evaluate its performance using documents on the Internet.

Recent years have witnessed a growing interest in employing animated agents for tasks that are typically performed by humans. They serve as communicative partners in a variety of applications, such as tutoring systems, sales, or entertainment. This paper first discusses design principles for animated agents to enhance their effectiveness as tutors, sales persons, or actors, among other roles. It is argued that agents should support their perception as social actors by displaying human-like social cues such as affect and gestures. An architecture for emotion-based agents will be described and a simplified version of the model will be illustrated by two interaction scenarios that feature cartoon-style characters and can be run in a web browser. The second focus of this paper is an empirical evaluation of the effect of an affective agent on users' emotional state which is derived from physiological signals of the user. Our findings suggest that an agent with affective behavior may significantly decrease user frustration.

A high efficient HBT MMIC power amplifier with a new on-chip bias control circuit was proposed for PCS applications. By adjusting the quiescent current in accordance with the output power levels, the average power usage efficiency of the power amplifier is improved by a factor of 1.4. The bias controlled power amplifier, depending on low (high) output power levels, shows 62(103) mA of quiescent current, 16(28) dBm output power with 7.5(35.4)% of power-added efficiency(PAE), -46(-45) dBc of adjacent-channel power ratio (ACPR), and 23.7(26.9) dB of gain

An improved movement-based registration scheme reduces location update cost on conventional movement-based location update scheme but increases uncertainty of the position of a mobile terminal (MT). The effect of this uncertainty of the MT position on the paging cost of the improved movement-based registration scheme is analyzed. We show that the paging cost of the improved movement-based registration scheme in [2] is underestimated, especially for large values of movement threshold. The result shows that the underestimation cannot be ignored.

It is very important to accurately and effectively track the movement of each mobile terminal in the personal communications networks. Accordingly, various dynamic location update schemes reflecting the mobile terminal's moving pattern are proposed in the literature. Important schemes include time-based, movement-based, distance-based, and direction-based location update schemes. In this paper, we intend to improve the performance of the movement-based location update scheme which is simple to implement and shows good performance. The proposed location update scheme reflects each mobile terminal's movement characteristics and reduces the number of unnecessary location updates. The performance of the proposed scheme is evaluated and compared with the previously proposed movement-based location update scheme through simulation. The proposed location update scheme requires three memory elements to maintain the movement history in the mobile terminal. The simulation results show that the location management cost is significantly reduced especially for the case with small call-to-mobility ratio by minimizing the unnecessary location updates intrinsic in the movement-based location update scheme.

In this paper, we propose a new location tracking method for pointer forwarding with distributed HLRs schemes to decrease the location tracking cost. Similar to the distributed HLR schemes, the location information is replicated on all HLRs in our scheme. However, unlike the traditional distributed HLR schemes, we propagate the most recent location changes from an HLR to reset the forwarding pointers in other HLRs, and thus reduce the cost of location tracking for call deliveries. The signaling cost of location propagation may be too costly to be practical. Therefore, we allow some inconsistency to exist among the location data of HLRs and defer the propagation of location changes to reduce the propagation cost. Three delay propagation policies are also proposed and analyzed using simulation. The performance result shows that the delay propagation policies reduce the propagation cost and the propagation resetting process degrades the location tracking cost. Our method preserves a low total cost for call deliveries, registrations and propagations in distributed HLRs.

A timer-based scheme is proposed to manage information within terminal and service profiles for both incall registration/deregistration of UPT users and incall registration resets of terminal owners. In the timer-based scheme, information related to incall registration for a UPT user in a terminal profile is deleted due to a timer expiration without accessing the terminal profile. The performance of the timer-based scheme is compared with the previously proposed request-based scheme in terms of; 1) total cost and, 2) the number of terminal profile accesses per unit time for a terminal. Even though provision of the timer-based scheme requires the modification of incoming call delivery procedure, the timer-based scheme can reduce both the total cost and the number of terminal profile accesses compared to the previously proposed request-based scheme.

This paper describes the results of a series of laboratory experiments for performance evaluations of our proposed Maximum Likelihood Sequence Estimation (MLSE) based interference canceller, the Interference Canceling Equalizer (ICE), which can cancel both co-channel interference (CCI) and inter-symbol interference (ISI). To verify the feasibility of ICE for the Japanese cellular communications system, a standard of which has been released under the name of Personal Digital Cellular (PDC) system, a prototype system was constructed using 27 TI TMS320C40 Digital Signal Processor (DSP) chips. The ICE prototype works in real-time on the PDC air interface, major specifications of which are π/4 QDPSK 21 k symbols/s 3-channel time-division multiple-access (TDMA). Two-branch diversity reception is used to enhance the signal detection performance of ICE. In the experiments, BER performances were evaluated using the prototype system. Under a single-path Rayleigh fading and a single CCI condition, the ICE receiver attains the BER of less than 310-2 with the negative values of the average CIR: for fD = 5 Hz and 40 Hz, the average CIR more than -20 dB and -10 dB, respectively. Under a double-path Rayleigh fading and a single CCI condition, the ICE receiver attains the BER of less than 1.510-2 with the negative values of the average CIR: for fD = 5 Hz and 40 Hz, the average CIR more than -20 dB and -10 dB, respectively. The laboratory test results suggest that the ICE receiver has potential for system capacity enhancement.

This letter describes two adaptive timing synchronization schemes for a short-ranged Bluetooth system in the partial-band noise environments. One estimates the variance of the partial-band interference, which is utilized for the trigger threshold value of the inquiry scan and page scan states, while second is designed using the scaled partial correlation value for the connection state. Numerical results show the proposed synchronization algorithms are robust to the partial-band noise interference and of low complexity, which is suitable for a low-cost personal area network (PAN).

This paper analyzes a generalized secret-key authentication system from a viewpoint of the information-spectrum methods. In the generalized secret-key authentication system, for each n 1 a legitimate sender transmits a cryptogram Wn to a legitimate receiver sharing a key En in the presence of an opponent who tries to cheat the legitimate receiver. A generalized version of the Simmons' bounds on the success probabilities of the impersonation attack and a certain kind of substitution attack are obtained.

In this paper, we propose a call arrival history-based location tracking strategy for a variable call arrival rate over time. The basis of the proposed strategy is a time-based location tracking strategy. A mobile terminal obtains the up-to-date information about changes in the call arrival rate by maintaining its call arrival history, from which it can calculate an appropriate timeout interval for a variable call arrival rate. We present a simple analytical model and numerical results to investigate its performance for both a fixed and a variable call arrival rate which is modeled by a Markov-modulated Poisson process.

This paper provides the Shannon theoretic coding theorems on the success probabilities of the impersonation attack and the substitution attack against secret-key authentication systems. Though there are many studies that develop lower bounds on the success probabilities, their tight upper bounds are rarely discussed. This paper characterizes the tight upper bounds in an extended secret-key authentication system that includes blocklength K and permits the decoding error probability tending to zero as K . In the extended system an encoder encrypts K source outputs to K cryptograms under K keys and transmits K cryptograms to a decoder through a public channel in the presence of an opponent. The decoder judges whether K cryptograms received from the public channel are legitimate or not under K keys shared with the encoder. It is shown that 2-KI(W;E) is the minimal attainable upper bound of the success probability of the impersonation attack, where I(W;E) denotes the mutual information between a cryptogram W and a key E. In addition, 2-KH(E|W) is proved to be the tight upper bound of the probability that the opponent can correctly guess K keys from transmitted K cryptograms, where H(E|W) denotes the conditional entropy of E given W.

A novel carrier frequency offset and timing offset detection scheme for orthogonal frequency division multiplexing (OFDM) is proposed. The carrier frequency offset is detected by utilizing a certain a-priori known pattern of power differences along the sub-carrier index. The power difference is caused by the collapse of the orthogonal condition. In order that the power differences are effectively influenced by the frequency offset, time-domain windowing is employed. Timing offset is detected by utilizing average phase rotation according to the sub-carrier index. Moreover, by applying the cyclically mapped sequence as a pilot sequence, the computational complexity for reference signal generation is reduced. Additionally, a simplified burst frame searcher is possible if the sliding correlator is applied as a burst frame searcher. The proposed scheme is advantageous for designing the air-frame format, because the operation for synchronization is done using only one pilot symbol. The simulation results of the offset detection performance are shown, and the validity of the proposed offset detection scheme is presented.

In order to realize universal service access of mobile users on the global telecommunication environment, we have to consider the scalable networking architecute based on the distributed object computing technologies. In this paper, we apply TINA to the promising networking architecture, and propose TINA-based scalable model for realizing personal mobility service, which especially focuses on making access to telecommunication services from any legacy systems that do not support such the new environment, using a downloadable module in an end terminal, as well as considering load balance of a whole system. Our proposed model also focuses on exchanging personal infomation of mobile users between different administrative domains, by separating the already-specified user profile information objects into two parts, which are the domain-common part and domain-specific part, and propose secure exchange procedure.