In this paper, generic attacks are presented against hash functions that are constructed by a hashing mode instantiating a Feistel or generalized Feistel networks with an SP-round function. It is observed that the omission of the network twist in the last round can be a weakness against preimage attacks. The first target is a standard Feistel network with an SP round function. Up to 11 rounds can be attacked in generic if a condition on a key schedule function is satisfied. The second target is a 4-branch type-2 generalized Feistel network with an SP round function. Up to 15 rounds can be attacked in generic. These generic attacks are then applied to hashing modes of ISO standard ciphers Camellia-128 without FL and whitening layers and CLEFIA-128.
Kenichiro FUKUSHI Itsuo KUMAZAWA
In this paper, we present a computer vision-based human tracking system with multiple stereo cameras. Many widely used methods, such as KLT-tracker, update the trackers “frame-to-frame,” so that features extracted from one frame are utilized to update their current state. In contrast, we propose a novel optimization technique for the “multi-frame” approach that computes resultant trajectories directly from video sequences, in order to achieve high-level robustness against severe occlusion, which is known to be a challenging problem in computer vision. We developed a heuristic optimization technique to estimate human trajectories, instead of using dynamic programming (DP) or an iterative approach, which makes our method sufficiently computationally efficient to operate in realtime. Six video sequences where one to six people walk in a narrow laboratory space are processed using our system. The results confirm that our system is capable of tracking cluttered scenes in which severe occlusion occurs and people are frequently in close proximity to each other. Moreover, minimal information is required for tracking, instead of full camera images, which is communicated over the network. Hence, commonly used network devices are sufficient for constructing our tracking system.
Yukihide KOHIRA Atsushi TAKAHASHI
Multi-domain clock skew scheduling in general-synchronous framework is an effective technique to improve the performance of sequential circuits by using practical clock distribution network. Although the upper bound of performance of a circuit increases as the number of clock domains increases in multi-domain clock skew scheduling, the improvement of the performance becomes smaller while the cost of clock distribution network increases much. In this paper, a linear time algorithm that finds an optimum two-domain clock skew schedule in general-synchronous framework is proposed. Experimental results on ISCAS89 benchmark circuits and artificial data show that optimum circuits are efficiently obtained by our method in short time.
Huimin LIANG Jiaxin YOU Zhaowen CAI Guofu ZHAI
The reliability of electromagnetic relay (EMR) which contains a permanent magnet (PM) can be improved by a robust design method. In this parameter design process, the calculation of electromagnetic system is very important. In analytical calculation, PM is often equivalent to a lumped parameter model of one magnetic resistance and one magnetic potential, but significant error is often caused; in order to increase the accuracy, a distributed parameter calculation model (DPM) of PM bar is established; solution procedure as well as verification condition of this model is given; by a case study of the single PM bar, magnetic field lines division method is adopted to build the DPM, the starting point and section magnetic flux of each segment are solved, a comparison is made with finite element method (FEM) and measured data; the accuracy of this magnetic field line based distributed parameter model (MFDPM) in PM bar is verified; this model is applied to the electromagnetic system of a certain type EMR, electromagnetic system calculation model is established based on MFDPM, and the static force is calculated under different rotation angles; compared with traditional lumped parameter model and FEM, it proves to be of acceptable calculation accuracy and high calculation speed which fit the requirement of robust design.
This paper proposes a name-based routing mechanism called Routing Guidance Name (RGN) that offers new routing management functionalities within the basic characteristics of CCN. The proposed mechanism names each CCN router. Each router becomes a Data Provider for its name. When a CCN Interest specifies a router's name, it is forwarded to the target router according to the standard mechanism of CCN. Upon receiving an Interest, each router reacts to it according to RGN. This paper introduces a new type of node called a Scheduler which calculates the best routes based on link state information collected from routers. The scheduler performs its functions based on RGN. This paper discusses how the proposed system builds CCN FIB (Forwarding Information Base) in routers. The results of experiments reveal that RGN is more efficient than the standard CCN scheme. It is also shown that the proposal provides mobility support with short delay time. We explain a practical mobile scenario to illustrate the advantages of the proposal.
Suyong EUM Masahiro JIBIKI Masayuki MURATA Hitoshi ASAEDA Nozomu NISHINAGA
This article introduces a self-organizing model which builds the topology of a DHT mapping system for ICN. Due to its self-organizing operation and low average degree of maintenance, the management overhead of the system is reduced dramatically, which yields inherent scalability. The proposed model can improve latency by around 10% compared to an existing approach which has a near optimal average distance when the number of nodes and degree are given. In particular, its operation is simple which eases maintenance concerns. Moreover, we analyze the model theoretically to provide a deeper understanding of the proposal.
Yoshikazu FUJISHIRO Takahiko YAMAMOTO Kohji KOSHIJI
This study proposes a novel method for evaluating the transmission characteristics of a three-phase filter using the “Fortescue-mode S-parameters,” which are S-parameters whose variables are transformed into symmetrical coordinates (i.e., zero-/positive-/negative-phase sequences). The behavior of the filter under three-phase current, including its non-symmetry, can be represented by these S-parameters, without regard to frequency. This paper also describes a methodology for creating modal equivalent circuits that reflect Fortescue-mode S-parameters allowing the effects of circuit components on filter characteristics to be estimated. Thus, this method is useful not only for the measurement and evaluation but also for the analysis and design of a three-phase filter. In addition, the physical interpretation of asymmetrical/symmetrical insertion losses and the conversion method based on Fortescue-mode S-parameters are clarified.
In this paper, we propose a parameter estimation method using Volterra kernels for the nonlinear IIR filters, which are used for the linearization of closed-box loudspeaker systems. The nonlinear IIR filter, which originates from a mirror filter, employs nonlinear parameters of the loudspeaker system. Hence, it is very important to realize an appropriate estimation method for the nonlinear parameters to increase the compensation ability of nonlinear distortions. However, it is difficult to obtain exact nonlinear parameters using the conventional parameter estimation method for nonlinear IIR filter, which uses the displacement characteristic of the diaphragm. The conventional method has two problems. First, it requires the displacement characteristic of the diaphragm but it is difficult to measure such tiny displacements. Moreover, a laser displacement gauge is required as an extra measurement instrument. Second, it has a limitation in the excitation signal used to measure the displacement of the diaphragm. On the other hand, in the proposed estimation method for nonlinear IIR filter, the parameters are updated using simulated annealing (SA) according to the cost function that represents the amount of compensation and these procedures are repeated until a given iteration count. The amount of compensation is calculated through computer simulation in which Volterra kernels of a target loudspeaker system is utilized as the loudspeaker model and then the loudspeaker model is compensated by the nonlinear IIR filter with the present parameters. Hence, the proposed method requires only an ordinary microphone and can utilize any excitation signal to estimate the nonlinear parameters. Some experimental results demonstrate that the proposed method can estimate the parameters more accurately than the conventional estimation method.
Ruidong LI Jie LI Hitoshi ASAEDA
To secure a wireless sensor and actuator network (WSAN) in cyber-physical systems, trust management framework copes with misbehavior problem of nodes and stimulate nodes to cooperate with each other. The existing trust management frameworks can be classified into reputation-based framework and trust establishment framework. There, however, are still many problems with these existing trust management frameworks, which remain unsolved, such as frangibility under possible attacks. To design a robust trust management framework, we identify the attacks to the existing frameworks, present the countermeasures to them, and propose a hybrid trust management framework (HTMF) to construct trust environment for WSANs in the paper. HTMF includes second-hand information and confidence value into trustworthiness evaluation and integrates the countermeasures into the trust formation. We preform extensive performance evaluations, which show that the proposed HTMF is more robust and reliable than the existing frameworks.
Hyun-Ho CHOI Hyunggon PARK Jung-Ryun LEE
In this letter, we present a new method of alleviating the deterioration in the quality of real-time video service during vertical handover (VHO). The proposed method stochastically delays the starting time of the service disruption of VHO in order to reduce the number of lost frames caused by the inter-frame dependency of multi-layered video traffic. The results show that the proposed method significantly decreases the average frame loss time at the sacrifice of an increased handover execution time by one half of the group of picture (GOP) interval of the video traffic.
Takayuki SASAMORI Toru FUKASAWA
This paper focuses on the S-parameter method that is a basic method for measuring the input impedance of balanced-fed antennas. The basic concept of the method is summarized using the two-port network, and it is shown that the method can be enhanced to the unbalanced antennas using a formulation based on incident and reflected waves. The compensation method that eliminates the influence of a measurement jig and the application of the S-parameter method for the measurement of a radiation pattern with reduced unbalanced currents are explained. Further, application of the method for measuring the reflection and coupling coefficients of multiple antennas is introduced. The measured results of the input impedance of a dipole antenna, radiation patterns of a helical antenna on a small housing, and S-parameters of multiple antennas on a small housing are examined, and the measured results obtained with the S-parameter method are verified.
The goal of dimension reduction is to represent high-dimensional data in a lower-dimensional subspace, while intrinsic properties of the original data are kept as much as possible. An important challenge in unsupervised dimension reduction is the choice of tuning parameters, because no supervised information is available and thus parameter selection tends to be subjective and heuristic. In this paper, we propose an information-theoretic approach to unsupervised dimension reduction that allows objective tuning parameter selection. We employ quadratic mutual information (QMI) as our information measure, which is known to be less sensitive to outliers than ordinary mutual information, and QMI is estimated analytically by a least-squares method in a computationally efficient way. Then, we provide an eigenvector-based efficient implementation for performing unsupervised dimension reduction based on the QMI estimator. The usefulness of the proposed method is demonstrated through experiments.
Ryohei ARAI Koji YAMAMOTO Takayuki NISHIO Masahiro MORIKURA
Differential games are considered an extension of optimal control problems, which are used to formulate centralized control problems in smart grids. Optimal control theory is used to study systems consisting of one agent with one objective, whereas differential games are used to formulate systems consisting of multiple agents with multiple objectives. Therefore, a differential-game-theoretic approach is appropriate for formulating decentralized demand-side energy management systems where there are multiple decision-making entities interacting with each other. Moreover, in many smart grid applications, we need to obtain information for control via communication systems. To formulate the influence of communication availability, differential game theory is also promising because the availability of communication is considered as part of an information structure (i.e., feedback or open-loop) in differential games. The feedback information structure is adopted when information for control can be obtained, whereas the open-loop information structure is applied when the information cannot be obtained because of communication failure. This paper proposes a comprehensive framework for evaluating the performance of demand-side actors in a demand-side management system using each control scheme according to both communication availability and sampling frequency. Numerical analysis shows that the proposed comprehensive framework allows for an analysis of trade-off for decentralized and centralized control schemes.
This letter introduces a new reference frame to improve the performance of motion estimation and compensation in video coding, based on a video stabilization technique. The proposed method synthesizes the new reference frame from the previous frame in a way that the new reference and current frames have the same camera orientations. The overhead data for each frame to transmit from an encoder to a decoder is only three rotational angles along the x, y, and z axes. Since the new reference and current frames have the same camera orientations, the proposed method significantly improves the performance of motion estimation and compensation for video sequences having dynamic camera motion by up to 0.98 dB with negligible overhead data.
Chuang SHI Hideyuki NOMURA Tomoo KAMAKURA Woon-Seng GAN
Earlier attempts to deploy two units of parametric loudspeakers have shown encouraging results in improving the accuracy of spatial audio reproductions. As compared to a pair of conventional loudspeakers, this improvement is mainly a result of being free of crosstalk due to the sharp directivity of the parametric loudspeaker. By replacing the normal parametric loudspeaker with the steerable parametric loudspeaker, a flexible sweet spot can be created that tolerates head movements of the listener. However, spatial aliasing effects of the primary frequency waves are always observed in the steerable parametric loudspeaker. We are motivated to make use of the spatial aliasing effects to create two sound beams from one unit of the steerable parametric loudspeaker. Hence, a reduction of power consumption and physical size can be achieved by cutting down the number of loudspeakers used in an audio system. By introducing a new parameter, namely the relative steering angle, we propose a stereophonic beamsteering method that can control the amplitude difference corresponding to the interaural level difference (ILD) between two sound beams. Currently, this proposed method does not support the reproduction of interaural time differences (ITD).
Dan XU Wei XU Zhenmin TANG Fan LIU
In this paper, we propose a novel method for road sign detection and recognition in complex scene real world images. Our algorithm consists of four basic steps. First, we employ a regional contrast based bottom-up visual saliency method to highlight the traffic sign regions, which usually have dominant color contrast against the background. Second, each type of traffic sign has special color distribution, which can be explored by top-down visual saliency to enhance the detection precision and to classify traffic signs into different categories. A bag-of-words (BoW) model and a color name descriptor are employed to compute the special-class distribution. Third, the candidate road sign blobs are extracted from the final saliency map, which are generated by combining the bottom-up and the top-down saliency maps. Last, the color and shape cues are fused in the BoW model to express blobs, and a support vector machine is employed to recognize road signs. Experiments on real world images show a high success rate and a low false hit rate and demonstrate that the proposed framework is applicable to prohibition, warning and obligation signs. Additionally, our method can be applied to achromatic signs without extra processing.
Maximizing network lifetime and optimizing aggregate system utility are important but usually conflict goals in wireless multi-hop networks. For the trade-off, we present a matrix game-theoretic cross-layer optimization formulation to jointly maximize the diverse objectives in such networks with network coding. To this end, we introduce a cross-layer formulation of general network utility maximization (NUM) that accommodates routing, scheduling, and stream control from different layers in the coded networks. Specifically, for the scheduling problem and then the objective function involved, we develop a matrix game with the strategy sets of the players corresponding to hyperlink and transmission mode, and design multiple payoffs specific to lifetime and system utility, respectively. In particular, with the inherit merit that matrix game can be solved with mathematical programming, our cross-layer programming formulation actually benefits from both game-based and NUM-based approaches at the same time by cooperating the programming model for the matrix game with that for the other layers in a consistent framework. Finally, our numerical experiments quantitatively exemplify the possible performance trad-offs with respect to the two variants developed on the multiple objectives in question while qualitatively exhibiting the differences between the framework and the other related works.
Alparslan YILDIZ Noriko TAKEMURA Maiya HORI Yoshio IWAI Kosuke SATO
In this study, we introduce a system for tracking multiple people using multiple active cameras. Our main objective is to surveille as many targets as possible, at any time, using a limited number of active cameras. In our context, an active camera is a statically located pan-tilt-zoom camera. In this research, we aim to optimize the camera configuration to achieve maximum coverage of the targets. We first devise a method for efficient tracking and estimation of target locations in the environment. Our tracking method is able to track an unknown number of targets and easily estimate multiple future time-steps, which is a requirement for active cameras. Next, we present an optimization of camera configuration with variable time-step that is optimal given the estimated object likelihoods for multiple future frames. We confirmed our results using simulation and real videos, and show that without introducing any significant computational complexities, it is possible to use active cameras to the point that we can track and observe multiple targets very effectively.
Xiaojuan LIAO Miyuki KOSHIMURA Hiroshi FUJITA Ryuzo HASEGAWA
Coalition Structure Generation (CSG) is a main research issue in the domain of coalition games. A majority of existing works assume that the value of a coalition is independent of others in the coalition structure. Recently, there has been interest in a more realistic settings, where the value of a coalition is affected by the formation of other coalitions. This effect is known as externality. The focus of this paper is to make use of Maximum Satisfiability (MaxSAT) to solve the CSG problem where externalities may exist. In order to reduce the exponentially growing number of possible solutions in the CSG problem, we follow the previous works by representing the CSG problem as sets of rules in MC-nets (without externalities) and embedded MC-nets (with externalities). Specifically, enlightened by the previous MC-net-based algorithms exploiting the constraints among rule relations to solve the CSG problem, we encode such constraints into weighted partial MaxSAT (WPM) formulas. Experimental results demonstrate that an off-the-shelf MaxSAT solver achieves significant improvements compared to the previous algorithm for the same set of problem instances.
Xiaojuan LIAO Miyuki KOSHIMURA Hiroshi FUJITA Ryuzo HASEGAWA
Coalition Structure Generation (CSG) means partitioning agents into exhaustive and disjoint coalitions so that the sum of values of all the coalitions is maximized. Solving this problem could be facilitated by employing some compact representation schemes, such as marginal contribution network (MC-net). In MC-net, the CSG problem is represented by a set of rules where each rule is associated with a real-valued weights, and the goal is to maximize the sum of weights of rules under some constraints. This naturally leads to a combinatorial optimization problem that could be solved with weighted partial MaxSAT (WPM). In general, WPM deals with only positive weights while the weights involved in a CSG problem could be either positive or negative. With this in mind, in this paper, we propose an extension of WPM to handle negative weights and take advantage of the extended WPM to solve the MC-net-based CSG problem. Specifically, we encode the relations between each pair of agents and reform the MC-net as a set of Boolean formulas. Thus, the CSG problem is encoded as an optimization problem for WPM solvers. Furthermore, we apply this agent relation-based WPM with minor revision to solve the extended CSG problem where the value of a coalition is affected by the formation of other coalitions, a coalition known as externality. Experiments demonstrate that, compared to the previous encoding, our proposed method speeds up the process of solving the CSG problem significantly, as it generates fewer number of Boolean variables and clauses that need to be examined by WPM solver.