The demand response is attracting attention to perform electric power load leveling. In this paper, we consider a power consumption reduction problem with an aggregator that requests electric power consumption reduction to consumers by allocating a part of its profit to them as an incentive. We formulate interactions among consumers as a game, where the incentive to each consumer is determined by his/her contribution to the total power consumption reduction, and the consumer determines his/her own reduction amount selfishly to maximize his/her payoff. The uniqueness of best responses of each consumer and an equilibrium condition of the game are also derived. By using numerical simulations, we show relationship among incentive allocation rate, realized total reduction amount through the game, and the aggregator's payoff for the cases with the for-profit and the nonprofit aggregator.

Possible functional roles of the phase resetting control during rhythmic movements have been attracting much attention in the field of robotics. The phase resetting control is a control mechanism in which the phase shift of periodic motion is induced depending on the timing of a given perturbation, leading to dynamical stability such as a rapid transition from an unstable state to a stable state in rhythmic movements. A phase response curve (PRC) is used to quantitatively evaluate the phase shift in the phase resetting control. It has been demonstrated that an optimal PRC for bipedal walking becomes bimodal. The PRCs acquired by reinforcement learning in simulated biped walking are qualitatively consistent with measured results obtained from experiments. In this study, we considered how such characteristics are obtained from a mathematical point of view. First, we assumed a symmetric Bonhoeffer-Van der Pol oscillator and phase excitable element known as an active rotator as a model of the central pattern generator for controlling rhythmic movements. Second, we constructed feedback control systems by combining them with manipulators. Next, we numerically computed the PRCs of such systems and compared the resulting PRCs. Furthermore, we approximately calculated analytical solutions of the PRCs. Based on the results, we systematically investigated the parameter dependence of the analytical PRCs. Finally, we investigated the requirements for realizing an optimal PRC for the phase resetting control during rhythmic movements.

Many countries have deregulated their electricity retail markets to offer lower electricity charges to consumers. However, many consumers have not switched their suppliers after the deregulation, and electricity suppliers do not tend to reduce their charges intensely. This paper proposes an electricity market model and evolutionary game to analyze the behavior of consumers in electricity retail markets. Our model focuses on switching costs such as an effort at switching, costs in searching for other alternatives, and so on. The evolutionary game examines whether consumers choose a strategy involving exploration of new alternatives with the searching costs as “cooperators” or not. Simulation results demonstrate that the share of cooperators was not improved by simply giving rewards for cooperators as compensation for searching costs. Furthermore, the results also suggest that the degree of cooperators in a network among consumers has a vital role in increasing the share of cooperators and switching rate.

In this paper, we introduce conditional decisions for enforcing forcible events in the decentralized supervisory control framework for timed discrete event systems. We first present sufficient conditions for the existence of a decentralized supervisor with conditional decisions. These sufficient conditions are weaker than the necessary and sufficient conditions for the existence of a decentralized supervisor without conditional decisions. We next show that the presented sufficient conditions are also necessary under the assumption that if the occurrence of the event tick, which represents the passage of one time unit, is illegal, then a legal forcible event that should be forced to occur uniquely exists. In addition, we develop a method for verifying the presented conditions under the same assumption.

In this paper, we propose a distributed subgradient-based method over quantized and event-triggered communication networks for constrained convex optimization. In the proposed method, each agent sends the quantized state to the neighbor agents only at its trigger times through the dynamic encoding and decoding scheme. After the quantized and event-triggered information exchanges, each agent locally updates its state by a consensus-based subgradient algorithm. We show a sufficient condition for convergence under summability conditions of a diminishing step-size.

This paper proposes a distributed algorithm over quantized communication networks for unconstrained optimization with smooth cost functions. We consider a multi-agent system whose local communication is represented by a fixed and connected graph. Each agent updates a state and an auxiliary variable for the estimates of the optimal solution and the average gradient of the entire cost function by a consensus-based optimization algorithm. The state and the auxiliary variable are sent to neighbor agents through a uniform quantizer. We show a convergence rate of the proposed algorithm with respect to the errors between the cost at the time-averaged state and the optimal cost. Numerical examples show that the estimated solution by the proposed quantized algorithm converges to the optimal solution.

Pinning control of multi-agent systems is a method that the external control input is added to some agents (pinning nodes), e.g., leaders. By the external control input, consensus to a certain target value and faster consensus are achieved. In this paper, we propose a new method of self-triggered predictive pinning control for the consensus problem. Self-triggered control is a method that both the control input and the next update time are calculated. Using self-triggered control, it is expected that the communication cost can be reduced. First, a new finite-time optimal control problem used in self-triggered control is formulated, and its solution method is derived. Next, as an on-line algorithm, two methods, i.e., the multi-hop communication-based method and the observer-based method are proposed. Finally, numerical examples are presented.

MATLAB/Simulink is the de facto standard tool for the model-based development (MBD) of control software for automotive systems. A Simulink model developed in MBD for real automotive systems involves complex computation as well as tens of thousands of blocks. In this paper, we focus on decision coverage (DC), condition coverage (CC) and modified condition/decision coverage (MC/DC) criteria, and propose a Monte-Carlo test suite generation method for large and complex Simulink models. In the method, a candidate test case is generated by assigning random values to the parameters of signal templates with specific waveforms. We try to find contributable candidates in a plausible and understandable search space, specified by a set of templates. We implemented the method as a tool, and our experimental evaluation showed that the tool was able to generate test suites for industrial implementation models with higher coverages and shorter execution times than Simulink Design Verifier. Additionally, the tool includes a fast coverage measurement engine, which demonstrated better performance than Simulink Coverage in our experiments.

The surveillance problem is to find optimal trajectories of agents that patrol a given area as evenly as possible. In this paper, we consider multiple agents with fuel constraints. The surveillance area is given by a weighted directed graph, where the weight assigned to each arc corresponds to the fuel consumption/supply. For each node, the penalty to evaluate the unattended time is introduced. Penalties, agents, and fuels are modeled by a mixed logical dynamical system model. Then, the surveillance problem is reduced to a mixed integer linear programming (MILP) problem. Based on the policy of model predictive control, the MILP problem is solved at each discrete time. In this paper, the feasibility condition for the MILP problem is derived. Finally, the proposed method is demonstrated by a numerical example.

In this paper, we consider the design problem of an unknown-input observer for distributed network systems under the existence of communication delays. In the proposed method, each node estimates all states and calculates inputs from its own estimate. It is assumed that the controller of each node is given by an observer-based controller. When calculating each node, the input values of the other nodes cannot be utilized. Therefore, each node calculates alternative inputs instead of the unknown inputs of the other nodes. The alternative inputs are generated by own estimate based on the feedback controller of the other nodes given by the assumption. Each node utilizes these values instead of the unknown inputs when calculating the estimation and delay compensation. The stability of the estimation error of the proposed observer is proven by a Lyapunov-Krasovskii functional. The stability condition is given by a linear matrix inequality (LMI). Finally, the result of a numerical simulation is shown to verify the effectiveness of the proposed method.

This paper proposes statistical analysis of phase-only correlation functions between two signals with stochastic phase-spectra following bivariate circular probability distributions based on directional statistics. We give general expressions for the expectation and variance of phase-only correlation functions in terms of joint characteristic functions of the bivariate circular probability density function. In particular, if we assume bivariate wrapped distributions for the phase-spectra, we obtain exactly the same results between in case of a bivariate linear distribution and its corresponding bivariate wrapped distribution.

In this paper, we propose the low voltage CMOS current mode reference circuit using self-regulator with adaptive biasing technique. It drastically reduces the line sensitivity (LS) of the output voltage and the power supply voltage dependence of the temperature coefficient (TC). The self-regulator used in the proposed circuit adaptively generates the minimum voltage required the reference core circuit following the PVT (process, voltage and temperature) conditions. It makes possible to improve circuit performances instead of slightly increasing minimum power supply voltage. This proposed circuit has been designed and evaluated by SPICE simulation using TSMC 65nm CMOS process with 3.3V (2.5V over-drive) transistor option. From simulation results, LS is reduced to 0.0065%/V under 0.8V < V_DD < 3.0V. TC is 67.6ppm/°C under the condition that the temperature range is from -40°C to 125°C and V_DD range is from 0.8V to 3.0V. The power supply rejection ratio (PSRR) is less than -80.4dB when V_DD is higher than 0.8V and the noise frequency is 100Hz. According to the simulation results, we could confirm that the performances of the proposed circuit are improved compared with the conventional circuit.

Satellite communications (SATCOM) systems play important roles in wireless communication systems. In the future, they will be required to accommodate rapidly increasing communication requests from various types of users. Therefore, we propose a framework for efficient resource management in large-scale SATCOM systems that integrate multiple satellites. Such systems contain hundreds of thousands of communication satellites, user terminals, and gateway stations; thus, our proposed framework enables simpler and more reliable communication between users and satellites. To manage and control this system efficiently, we formulate an optimization problem that designs the network structure and allocates communication resources for a large-scale SATCOM system. In this mixed integer programming problem, we allow the cost function to be a combination of various factors so that SATCOM operators can design the network according to their individual management strategies. These factors include the total allocated bandwidth to users, the number of satellites and gateway stations to be used, and the number of total satellite handovers. Our numerical simulations show that the proposed management strategy outperforms a conventional strategy in which a user can connect to only one specific satellite determined in advance. Furthermore, we determine the effect of the number of satellites in the system on overall system performance.

Register-transfer-level (RTL) information is hardly available for hardware Trojan detection. In this paper, four RTL Trojan features related to branching statement are proposed. The Minimum Redundancy Maximum Relevance (mRMR) feature selection is applied to the proposed Trojan features to determine the recommended feature combinations. The feature combinations are then tested using different machine learning concepts in order to determine the best approach for classifying Trojan and normal branches. The result shows that a Decision Tree classification algorithm with all the four proposed Trojan features can achieve an average true positive detection rate of 93.72% on unseen test data.

One goal in stack-queue mixed layouts of a graph subdivision is to obtain a layout with minimum number of subdivision vertices per edge when the number of stacks and queues are given. Dujmović and Wood showed that for every integer s, q>0, every graph G has an s-stack q-queue subdivision layout with 4⌈log_(s+q)q sn(G)⌉ (resp. 2+4⌈log_(s+q)q qn(G)⌉) division vertices per edge, where sn(G) (resp. qn(G)) is the stack number (resp. queue number) of G. This paper improves these results by showing that for every integer s, q>0, every graph G has an s-stack q-queue subdivision layout with at most 2⌈log_s+q-1sn(G)⌉ (resp. at most 2⌈log_s+q-1qn(G)⌉ +4) division vertices per edge. That is, this paper improves previous results more, for graphs with larger stack number sn(G) or queue number qn(G) than given integers s and q. Also, the larger the given integer s is, the more this paper improves previous results.

When a unit repeats some works over again and undergoes minimal repairs at failures, it is more practical to replace it preventively at the end of working cycles or at its failure times. In this case, it would be an interesting problem to know which is better to replace the unit at a number of working cycles or at random failures from the point of cost. For this purpose, we give models of the expected cost rates for the following replacement policies: (1) The unit is replaced at a working cycle N and at a failure number K, respectively; (2) Replacement first and last policies with working cycle N and failure number K, respectively; (3) Replacement overtime policies with working cycle N and failure number K, respectively. Optimizations and comparisons of the policies for N and K are made analytically and numerically.

In the context of compressed sensing (CS), simultaneous orthogonal matching pursuit (SOMP) algorithm is an important iterative greedy algorithm for multiple measurement matrix vectors sharing the same non-zero locations. Restricted isometry property (RIP) of measurement matrix is an effective tool for analyzing the convergence of CS algorithms. Based on the RIP of measurement matrix, this paper shows that for the K-row sparse recovery, the restricted isometry constant (RIC) is improved to $delta_{K+1}<rac{sqrt{4K+1}-1}{2K}$ for SOMP algorithm. In addition, based on this RIC, this paper obtains sufficient conditions that ensure the convergence of SOMP algorithm in noisy case.

In this letter, an active complex filter with finite transmission zeros is proposed. In order to obtain a complex prototype ladder filter including no inductors, a new circuit transformation is proposed. This circuit is classified into the RⁱCR filter. It is shown that it includes no negative capacitors when it is obtained through a frequency transformation. The validity of the proposed method is confirmed through computer simulation.

Sorting is one of the most fundamental problems in mathematics and computer science. Because high-throughput and flexible sorting is a key requirement in modern databases, this paper presents efficient techniques for designing a high-throughput sorting matrix that supports continuous data sequences. There have been numerous studies on the optimization of sorting circuits on FPGA (field-programmable gate array) platforms. These studies focused on attaining high throughput for a single command with fixed data width. However, the architectures proposed do not meet the requirement of diversity for database data types. A sorting matrix architecture is thus proposed to overcome this problem. Our design consists of a matrix of identical basic sorting cells. The sorting cells work in a pipeline and in parallel, and the matrix can simultaneously process multiple data streams, which can be combined into a high-width single-channel data stream or low-width multiple-channel data streams. It can handle continuous sequences and allows for sorting variable-length data sequences. Its maximum throughput is approximately 1.4 GB/s for 32-bit sequences and approximately 2.5 GB/s for 64-bit sequences on our platform.

In an OFDM communication system using quadrature amplitude modulation (QAM) signals, peak envelope powers (PEPs) of the transmitted signals can be well controlled by using QAM Golay complementary sequence pairs (CSPs). In this letter, by making use of a new construction, a family of new 16-QAM Golay CSPs of length N=2^m (integer m≥2) with binary inputs is presented, and all the resultant pairs have the PEP upper bound 2N. However, in the existing such pairs from other references their PEP upper bounds can arrive at 3.6N when the worst case happens. In this sense, novel pairs are good candidates for OFDM applications.

This Letter explores the adaptive hybrid automatic repeat request (HARQ) using rate-compatible polar codes constructed with a common information set. The rate adaptation problem is formulated using Markov decision process and solved by a dynamic programming framework in a low-complexity way. Simulation verifies the throughput efficiency of the proposed adaptive HARQ.

In the theory of orthogonal arrays, an orthogonal array (OA) is called schematic if its rows form an association scheme with respect to Hamming distances. In this paper, we study the Hamming distances of any two rows in an OA, construct some schematic OAs of strength two and give the positive solution to the open problem for classifying all schematic OAs. Some examples are given to illustrate our methods.

Radio signals show small characteristic differences between radio transmitters resulted from their idiosyncratic hardware properties. Based on the parameters estimation of transmitter imperfections, a novel radiometric identification method is presented in this letter. The fingerprint features of the radio are extracted from the mismatches of the modulator and the nonlinearity of the power amplifier, and used to train a support vector machine classifier to identify the class label of a new data. Experiments on real data sets demonstrate the validation of this method.

This paper proposes a simple source data exchange method for channel switching in space-time block code. If one transmits source data on another antenna, then the receiver should change combining method in order to adapt it. No one except knowing the channel switching sequence can decode the received data correctly. In case of exchanging data for channel switching, four orthogonal frequency division multiplexing symbols are exchanged according to a format of space-time block code. In this paper, I proposes two simple sign exchanges without exchanging four orthogonal-frequency division multiplexing symbols which occurs a different combining and channel switching method in the receiver.

This paper proposes a temporal domain difference based secondary background modeling algorithm for surveillance video coding. The proposed algorithm has three key technical contributions as following. Firstly, the LDBCBR (Long Distance Block Composed Background Reference) algorithm is proposed, which exploits IBBS (interval of background blocks searching) to weaken the temporal correlation of the foreground. Secondly, both BCBR (Block Composed Background Reference) and LDBCBR are exploited at the same time to generate the temporary background reference frame. The secondary modeling algorithm utilizes the temporary background blocks generated by BCBR and LDBCBR to get the final background frame. Thirdly, monitor the background reference frame after it is generated is also important. We would update the background blocks immediately when it has a big change, shorten the modeling period of the areas where foreground moves frequently and check the stable background regularly. The proposed algorithm is implemented in the platform of IEEE1857 and the experimental results demonstrate that it has significant improvement in coding efficiency. In surveillance test sequences recommended by the China AVS (Advanced Audio Video Standard) working group, our method achieve BD-Rate gain by 6.81% and 27.30% comparing with BCBR and the baseline profile.

In this letter, the performance of a state-of-the-art deep learning (DL) algorithm in [5] is analyzed and evaluated for orthogonal frequency-division multiplexing (OFDM) receivers, in the presence of harmonic spur interference. Moreover, a novel spur cancellation receiver structure and algorithm are proposed to enhance the traditional OFDM receivers, and serve as a performance benchmark for the DL algorithm. It is found that the DL algorithm outperforms the traditional algorithm and is much more robust to spur carrier frequency offset.

We consider a property about a result of non-negative matrix factorization under a parallel moving of data points. The shape of a cloud of original data points and that of data points moving parallel to a vector are identical. Thus it is sometimes required that the coefficients to basis vectors of both data points are also identical from the viewpoint of classification. We show a necessary and sufficient condition for such an invariance property under a translation of the data points.