bluuebunny/crossref_metadata_2025_split huggingface dataset:
Relation between instantaneous field of view and recognition performance of thermal imager
Authors: Kondo Michimasa 
Published: July 2007

AbstractThe relation between the instantaneous field of view (IFOV) and recognition performance of a thermal imager is discussed theoretically and a method of improving the target recognition performance applying the relation is presented. When the IFOV included in the evaluation function of the minimum resolvable temperature difference (MRTD) varies, the MRTD does not vary monotonically but has a minimum value. It is found that this value is obtained in the case where the product of the IFOV and target spatial frequency is 0.5. Then the MRTD is defined as the (MRTD)n, and it is shown that (MRTD)IL for various targets is the bottom envelope of MRTD curves for IFOV. Moreover, on the basis of these relations, the condition for obtaining (MRTD)IL by applying zoom optics and changing the IFOV is established and the improvement factor of recognition probability is compared to a fixed IFOV.The experimental results using a prototype serial scan thermal imager and the calculated values using the theory agree well in their basic characteristics.
Aggregation method using orthogonal vector function and approximation by rational transfer matrices
Authors: Akita Masashi , Hamada Nozomu 
Published: July 2007

AbstractIn recent years, with the widened scope and scale of control, the complexity of systems has been greatly increased and this has motivated studies of methods for reducing the order of systems. The methods presented in this paper employ orthogonal vector functions to reduce the order: (1) the system aggregation method in the time domainand, based on that, (2) the transfer characteristic method in the frequency domain. In (1) orthogonal vector functions are used i in conjunction with the aggregation method which has long been known to have various excellent characteristics. Thus, the characteristics of the aggregation method are retained while deriving a low‐order model such 1 that the squared error of the output is a minimum. Method (2) is shown to be one in which the scalar function approximation method based on orthogonal vector functions (known in the past as the Kautz approximation method) has been generalized to multi‐input/multi‐output systems. Here, also, a least‐square approximation is effected for the transfer function matrix by forming the orthogonal vector functions from the given transfer characteristic.
Hysteresis chaos generator
Authors: Saito Toshimichi 
Published: July 2007

AbstractThis paper discusses the hysteresis generator which is drawing attention as an autonomous chaos generator. However, this generator has not been discussed theoretically for its chaos generation mechanism. A fundamental hysteresis chaos generator is proposed deriving analytically the condition that chaos is generated in the circuit. The analysis of the circuit is performed by mapping procedure, and the Poincare' mapping is derived analytically as a one‐dimensional mapping from the fact that the circuit is a second‐order piecewise‐linear differential equation. By calculating based on the mapping, the generation condition for the chaos is represented explicitly for the parameters In this paper, the definition for the chaos is that the derived mapping has a unique absolutely continuous invariant measure and is ergodic. The generation of the chaos is verified by experiment.
Studies on longitudinal balance measurement in communication systems
Authors: Hagishima Koichi , Koinuma Takeo 
Published: July 2007

AbstractInduced noises from an ac‐electric train, etc. are applied in common‐phase mode to 2‐wire symmetrical lines. In order to avoid noise quality deterioration by these induced noises, it is important in designing electromagnetic or fully electronic terminating circuits of these lines to obtain an excellent longitudinal balance. Fully electronic equipment, which has been introduced recently to replace electromagnetic equipment in telecommunications systems, e.g., subscriber line circuits in a digital switching system, is different from electromagnetic equipment in that the former has a much lower common‐mode impedance than the latter. This necessitates an optimal longitudinal balance evaluation method appropriate for both fully electronic equipment and electromagnetic equipment. This paper analyzes and evaluates the relation between the longitudinal balance and the noise magnitude of telecommunications equipment, and then clarifies an optimal longitudinal balance evaluation method that is appropriate for telecommunications equipment with arbitrary common‐mode impedance.
Adaptive decoding method for double‐encoding systems
Authors: Imai Hideki , Suda Hirohito , Yashiro Mitsuhiko 
Published: July 2007

AbstractA general decoding method for doubleencoding systems has been proposed by Imai and Nagasaka, wherein decoding state information obtained in the first stage is utilized fully. This method has a better decoding performance than conventional ones and implementation is easy. However, because this method is based on the probabilistic characteristic of communication channel, its decoding performance can deteriorate when BER of communication channel is varied. This paper proposes an adaptive decoding method which follows the variation of probabilistic characteristic of communication channel. In this method, channel state information can be obtained in the first stage, then the second decoding stage is performed appropriately to that channel state information. With this proposed method, high quality communication is achieved when the communication channel is in good condition. Moreover, even if some quality degradation is unavoidable, communication that is as good as possible is achieved even when the communication channel is in a bad condition. Since an enormous amount of computation is necessary to determine the optimum adaptive decoding system, an adaptive decoding method using some approximation is studied. This method is suitable for a channel where transitions of the channel states can be modeled as a Markov process. Numerical comparisons show that the proposed method achieves a better decoding performance.
On principal partition of matroids with parity condition into strongly irreducible minors pairs
Authors: Onozava Akira , Inoue Masayuki , Oishi Shin'Ichi , Horiuchi Kazuo 
Published: July 2007

AbstractThe matroid parity problem is a common generalization of the matching problem for graphs. The matroid intersection problem and its engineering applications are also known. It has been shown that the matroid parity problem is generally unsolvable in a polynomial‐bounded running time. The concept of principal partition has recently been extended to matroids with parity condition as well as to 2‐polymatroids and a certain class of matroids for which the matroid parity problem can be solved by a polynomial bounded algorithm has been charcterized. This paper shows that the central minor plays an important role when using the concept of principal partition in the matroid parity problem and generalizes the concept of principal partition of a matroid into its strongly irreducible minors pairs. Then we characterize the properties of strongly irreducible minors pairs and the critical sets pairs which give these minors pairs. Finally, we give a class of matroids for which one can show the existence of such a principal partition and solve the parity problem by a polynomial‐bounded algorithm by using the concept of the so‐called F0‐strongly irreducible minors pairs. At the same time, we show that a strongly irreducible minor called the F0‐ minimal central minor plays an essential role in the theory of principal partition in parity problems.
Extended formulas of sampling theorem on band‐limited waves and their application to the design of digital filters for data transmission
Authors: Kida Takuro , Fukuda Yutaka 
Published: July 2007

AbstractThe paper presents an extension of the sampling theorem with nonuniform sampling points to band‐limited waves where the spectrum of the obtained interpolation functions is differentiable to any desired degree. The adopted series of sampling points, in general, is a periodic repetition of K nonuni‐formly spaced sampling points. It is then shown that, neglecting shift along the time axis, there is no need of K different interpolation functions and that these functions are discrete orthogonal under certain conditions. Next, general formulas are derived to evaluate interpolation error due to moderate band limitation and simplified forms of the formulas are derived at K = 2 for each frequency interval. These formulas are also used as examples for an intuitive explanation. As a typical example of data transmission filters, a digital Nyquist filter is considered and a design method for it is introduced by applying Bellanger's method to some of the low‐rate subsystems while the remaining ones are supplied by interpolation. As an example, two out of five low‐rate subsystems are designed by the proposed method and are shown to require about 40% less hardware than the filters designed by Bellanger's method.
Interactive fuzzy goal programming for multiobjective nonlinear programming problems
Authors: Sakawa Masatoshi 
Published: July 2007

AbstractThis paper considers the situation where the decision‐maker has a fuzzy goal for each of the object functions in a multiobjective nonlinear programming problem, and proposes the interactive fuzzy goal programming which can determine the satisfying solution ensuring the Pareto‐optimality of the decision maker. The decision‐maker has a fuzzy goal for each of the object functions in the multiobjective nonlinear programming problem. For example, “The function should nearly be a or less,” or “The function should be approximately b.” Such a fuzzy goal of the decision‐maker is determined by evaluating interactively the corresponding membership function. After determining the membership function for each of the object functions, the decision‐maker sets the goal membership value for each membership function on a subjective basis. Then the difference between the membership function value and the goal membership value is minimized, determining the corresponding Pareto‐optimal solution. The decision‐maker is either satisfied with the given Pareto‐optimal solution, or subjectively updates the goal membership value by noting the difference between the membership function value for the obtained Pareto‐optimal solution and the goal membership value. By this process, the satisfying solution is derived eventually for the decision‐maker, ensuring the Pareto‐optimality. Based on the proposed algorithm, an interactive computer program was constructed, which is shown in this paper, together with the example of computer output for numerical example.
A consideration on a design for optical collimating system using rod lens
Authors: Kishimoto Ryozo , Toba Hiromu 
Published: July 2007

AbstractOptical circuits with low loss and stable operation are needed for developing optical communications systems with single‐mode optical fibers and laser diodes. The Gaussian beam field is analyzed by means of the beam expansion method and the Hermite generating function when the beam is incident on a rod lens off‐axis and obliquely. The coupling loss of the optical collimating system is obtained both experimentally and theoretically and the optimum design method is found. With rod lenses which have a radius of curvature of 2.5 mm and thickness of 5.5 mm, the insertion loss is as low as 0.4 dB for lens intervals larger than 100 mm. It is also shown that there is an optimum configuration which minimizes the increase in coupling loss when two connecting single‐mode fibers are displaced in opposite directions perpendicular to the optical axis.
Twin delta loop antenna and its application to antenna with plane reflector
Authors: Tsukiji Takehlko , Kumon Yasunori , Tou Shigefumi , Okubo Masaokl 
Published: July 2007

AbstractIt is known that the impedance characteristics of polygonal loop antennas (e.g., triangular or rectangular loop antennas) vary considerably with the loop shape. This feature is considered to be an advantage of the polygonal loop antenna in designing practical antennas since the characteristics required for the intended purpose can be obtained by appropriate choice of the loop shape. Investigation of the polygonal loop antenna shows that an isoceles triangular loop antenna driven at its apex exhibits relatively broadband impedance characteristics. Utilizing this feature, we propose a twin‐delta‐loop‐antenna (TDLA), which is a coplanar twin triangular loop antenna that provides broadband properties with respect to both impedance and gain. This TDLA can be easily applied to a plane reflector antenna or the Yagi‐Uda array antenna to develop an antenna system with higher performance.In this paper, for wider application of the TDLA we present the detailed fundamental characteristics of impedance and directive gain of the TDLA. In addition, the design procedure for a plane reflector antenna using the TDLA is demonstrated for an example of practical application of the TDLA with low VSWR for coaxial cable without using a balun or impedance transformer.
Secret ballot systems using cryptography
Authors: Akiyama Minoru , Tanaka Yos Hiaki , Kikuchi Toshio , Uji Hiroaki 
Published: July 2007

AbstractSeveral problems arise when an electrical communication system is utilized to realize a secret ballot. For example, double voting is easy. Even if cryptography is used, the content can be deciphered by voters who know the key to the cryptography. This paper proposes and discusses a system which can solve those problems and can realize a secure secret ballot by electrical communication. The divided‐vote secret ballot system is considered first. In this system, the individual votes represented by integers are divided into several sets and are distributed to ballot managers who process the subsets and announce the total. Deciphering and counterfeiting are impossible. Then the sum‐round‐opening secret ballot is discussed. In this system, the vote is enciphered using the GS public‐key system, and are totaled in the enciphered form. The separate‐round‐opening secret ballot is also discussed in this paper. The system is a modification of the sum‐round‐opening type so that the individual votes can be opened separately. Deciphering, counterfeiting and impeding are impossible in this system.
Optimal predictive control of linear discrete‐time stochastic systems
Authors: Yahagi Takashi , Sakai Katsuhito 
Published: July 2007

AbstractThis paper considers the regulator problem for the linear discrete‐time stochastic system represented by the input‐output relation. The methods of optimal predictive control based on the prediction of output, when the output contains a delay in relation to the input, is described. In the control system, in general, there exists a delay inherent in the plant, and this delay apparently is increased with the decrease of the sampling period. There may also be produced a control delay due to the computation time when it is not negligible. From such a viewpoint, the predictive control is very important. In this paper, the input‐output relation is represented by the equivalent state and output equations based on the observable canonical form, and a quadratic objective function containing output and control input is adopted. This choice of state variables is useful in that fewer computations are required in the derivation of the optimal control input, compared with other methods. By comparing the proposed method with a Kalman filter, either method can arrive at the optimal prediction, thereby minimizing the mean‐square error under the specified condition. However, the proposed method is better in the number of computations when an adaptive control by digital computer is to be realized. For example, simulations are made by the proposed method from various viewpoints, indicating that satisfactory control can be realized by suitably selecting the objective function according to the property of the plant.
Analysis of input control based on discrete monitoring in mixed input queueing model
Authors: Fukuda Akira 
Published: July 2007

AbstractThis paper analyzes input control with discrete monitoring in a queueing system involving two input systems. One stream with Poisson arrivals (Poisson stream) can enter the system when waiting room is not full. For the other stream with arrival of general distribution (GI stream), entry into the system is controlled as follows. The system is monitored at Poisson epoch, and when the number of calls in the system at the beginning of each interval is beyond the threshold, the arriving calls are regulated and lost during that interval. The holding time for both of the streams obeys an identical exponential distribution. The model is analyzed using piecewise Markov process theory and the stationary state probabilities at GI call arrival speech and Poisson call arrival epoch are obtained. Next, using these probabilities, regulation probability, regulation action frequency, individual loss probability, and mean waiting time are evaluated. By some numerical examples, this input control is compared with no control and input control with continuous monitoring. As a result, the following are revealed: (i) Under this control, the loss probability for Poisson stream and its mean waiting time are reduced compared with no control case; (ii) Regulation action frequency of this control is far smaller than that of the continuous monitoring control and is little affected by the Inter‐arrival time distribution of GI call.
Double‐thin‐film waveguides for acoustic surface waves
Authors: Hayashi Yukinari , Hayata Kazuya , Koshiba Masanori , Suzuki Michio 
Published: July 2007

AbstractTo increase the degrees of freedom in the design of a thin‐film surface acoustic waveguide, this paper proposes a waveguide of new configuration in which two kinds of strip thin films are placed on the substrate. Specifically, a double‐thin‐film waveguide is considered which consists of a Y‐cut Z‐propagation LiNb 03 substrate with a chromium coat and an additional gold coat on top of it. The velocity dispersion of the Rayleigh wave and the particle displacement distribution as a measure of the guiding effect have been studied theoretically. The results are compared with the structure coated with gold only or with chromium only. From the utility viewpoint, it is desirable to make the velocity dispersion small and the guiding effect substantial. The chromium‐coated structure has a smaller velocity dispersion but the guiding effect is smaller. On the other hand, the gold‐coated waveguide has a larger guiding effect but the velocity dispersion is also large. In the double‐thin‐film configuration, the velocity dispersion can be reduced without significantly degrading the guiding effect. This double‐thin‐film waveguide and the one coated with gold only have been fabricated and the experiments have been performed. It has been confirmed that the numerical results for the velocity dispersion are accurate.
Automatic construction of consonant recognition rules using binary decision unit
Authors: Aikawa Kiyoaki 
Published: July 2007

AbstractIn conventional rule‐based speech recognition, the rules have been constructed in a heuristic way. In that method, the rules with high accuracy have been difficult to construct when the recognition algorithm is complex, as in the case of consonant recognition. To cope with this problem, this paper presents a method for automatically constructing the recognition algorithm in the form of a set of rules. The method is a compromise between the transparency of the algorithmic representation by rule‐based representation and the high accuracy by the optimization of the automatic construction.The unit of the rule is represented by if (condition), then (branch 1), and else (branch 2). The condition is a threshold logic using the discrimination parameter with clear meaning. The set of rules is constructed by the iterative procedure of selecting the optimum discrimination parameter and the threshold, for partitioning the consonant training samples into two sets. By connecting the constructed rules, a binary decision tree is formed. The consonant is recognized by iterating binary decisions on the tree and examining upon each which terminating node is arrived at. By constructing the rules depending upon each succeeding vowel, a set of rules with a higher accuracy can be obtained. By the evaluation experiment, it was seen that transparent rules with higher accuracies can be constructed. The obtained rules are in agreement with the empirical rules of phonology. Furthermore, using the rules, the consonant recognition rate in 100 city succeeding vowel‐dependent names uttered by 50 subjects was improved from 72.4 to 80.0 percent.
LSP‐CV speech synthesis via CV‐syllable positioning rule
Authors: Arai Yasuhiko 
Published: July 2007

AbstractTraditional rule‐based synthesized speech has such problems as being unsatisfactory in articulateness and in naturalness of the rhythm inherent to the Japanese language. This paper proposes a CV‐syllable positioning rule based on the auditory evaluated data. The LSP‐CV rule speech synthesis based on the proposed principle is described. The positioning interval of CV‐syllable (i.e., the interval between the auditory perceptual timing points determined by auditory test) is affected by the succeeding syllable. Deviations are produced in the word‐top syllable, syllabic nasal, double consonant, long vowel, diphthong and devocalized sound. The deviations are represented by a correction factor to be combined into the rule in a simple form. By this rule, both rhythm and tempo can be controlled. To improve the sound articulation, the unvoiced part is excited by the original residual signal, the transient part is excited by the adaptive correlation function excitation, and the voiced part is excited by the representative correlation function excitation. As a result, a more natural rhythmicity was realized than in the case of isochronous positioning of CV‐syllable. A rule‐based synthesized speech, which is clear and easy to hear (the single sound articulation score being 95.5%), was obtained. A hardware configuration is realized in which the CV‐syllable concatenation processing is performed on μCPU and the LSP synthesis operation is performed on DSP. Then the frame period can be reduced to 3.2 ms, indicating that the interval between auditory perceptual timing points can be controlled with a high accuracy.
Synchronization method employing a cyclic redundancy check in an asynchronous transport system
Authors: Kitami Tokuhiro 
Published: July 2007

AbstractThis paper proposes a synchronization method in an asynchronous transport system. In this method, the cyclic redundancy check (CRC) code inserted in each cell for error control is also used for cell alignment recovery. Then frame alignment is established using cell alignment signals. The analyses include CRC detection probability in an out‐of‐synchronization mode, and cell/frame alignment recovery performance. The analyses also include the performance for an extended frame structure in which frame length is not divisible by cell length. This method has the following advantages: (a) this system shows good synchronization performance without using additional synchronization patterns; (b) frame alignment recovery time is reduced considerably using cell alignment signals; (c) this technique is also applicable to the forementioned extended frame structure and performs well.