bluuebunny/crossref_metadata_2025_split huggingface dataset:
An effective weighting method for hopfield neural networks
Authors: Mizutani Hikaru 
Published: July 2007

AbstractThe Hopfield neural network is considered to be promising as a means to solve the paired association problem, which is to recall complete information from incomplete information by realizing the highly parallel system. However, the neural network has problems in that the already memorized basic memory (complete information) which is the closest to the input, may not be recalled or a solution other than the basic memory may be recalled. When, for example, the neural network is weighted using the sum of the autocorrelation matrices, solutions other than the basic memory are produced as the outputs for more than half of the possible input incomplete information.This paper aims to remedy these problems and proposes a new weighting method for the Hopfield neural network. In the proposed method, the evaluation function for the weighting is defined and the weights are determined so that the evaluation function is optimized.To determine the weights by the proposed method, a fairly complex algorithm must be executed, compared to the calculation of the sum of the autocorrelation matrices. However, the weighting process is required only once in the design of the neural network and the neural network designed by this method is expected to exhibit a better performance than the traditional network.
Two‐route flows in an undirected flow network
Authors: Kishimoto Wataru , Takeuchi Masashi , Kishi Genya 
Published: July 2007

AbstractThis paper defines anew the maximum two‐route flow as a measure to represent the relation between two vertices in the flow network. The maximum two‐route flow corresponds to the maximum number of communication channels that are composed of two‐route paths between two terminals in a communication network. The ℱ‐rings that can be composed simultaneously, containing the considered two vertices, is defined as the maximum two‐route flow between those two vertices.It is shown in this paper that a theorem exists for the maximum two‐route flow similar to the max‐flow min‐cut theorem for the ordinary flow.
A code to correct synchronization errors
Authors: Iwamura Keiichi , Imai Hideki 
Published: July 2007

AbstractUntil now, no code has been reported which can algebraically correct errors consisting in bit deletions or insertions (synchronization errors) and errors by bit inversion (inversion errors) when they occur simultaneously. This paper proposes a code that can algebraically correct simultaneously occurring synchronization and inversion errors as long as they occur within the range of a single byte. The proposed code is practical, involving very simple operations, and can correct synchronization and inversion errors in an information sequence of k bytes, where 1 byte consists of q bits, when the errors occur within a single byte. The redundancy and effectiveness of the code also are discussed.
An information‐theoretical approach and its application to optimal problems
Authors: Ohya Masanori , Mizu Masanori 
Published: July 2007

AbstractThere have been a large number of approaches to the optimal value problem but only a few from the information‐theoretical viewpoint. In particular, no measure to represent the easiness in solving the optimal value problem has been presented.From such a viewpoint, this paper represents the object function which is the object of the optimization in the form of the Boltzmann distribution and the properties of the object function are represented quantitatively using the entropy S(pβ) ≡ − Σ pβ(x)log pβ(x) of the Boltzmann distribution.It is noted that the optimal solution is difficult to obtain in the actual computation for the optimization problem taking discrete values. For this problem, a measure is introduced for the easiness of the problem (object function) to be optimized, apart from the algorithm to arrive at the optimal solution.
Bifurcations of equilibria and periodic solutions in a nonlinear autonomous system with symmetry
Authors: Katsuta Yuuji , Kawakami Hiroshi 
Published: July 2007

AbstractIn the engineering and physical systems described by a lumped‐constant system, sometimes a certain kind of symmetry is observed in the structure of the system or the nonlinear characteristics of the element. In such a system the symmetry is reflected on the state equation and the equation becomes invariant under the symmetrical transformation of the state variable.It may happen in the state equation with a symmetry that there exists an equilibrium point or a periodic solution, and the solution bifurcates into the solution without a symmetry when the system parameter changes. This phenomenon is called symmetry‐breaking bifurcation.This paper discusses the symmetry concerning the equilibrium point and the periodic solution of the autonomous system and presents the condition for the symmetry‐breaking bifurcation and the method to calculate the bifurcation parameters. It is pointed out that the symmetry‐breaking bifurcation is, in general, a degenerate bifurcation and the bifurcation parameters cannot be determined by the ordinary method. It is shown that, by considering the symmetry, the calculation is made possible and is simplified.
Characteristics and the present status of SAW materials in Japanese industries
Authors: Shimizu Yasutaka 
Published: July 2007

AbstractSurface acoustic wave (SAW) devices have been used for filters, delay lines, resonators and oscillators. Since the characteristics of SAW devices are determined by the piezoelectric substrate, SAW devices must be selected for appropriate material.This paper examines first the characteristics of SAW propagating through several kinds of piezoelectric substrates. Next, using the reports from companies involved with SAW devices, the application and development of piezoelectric materials and the present status of SAW devices will be summarized. The future of SAW materials will also be described.
Equivalent circuit consideration on null signals in a piezoelectric vibratory gyroscope
Authors: Sugawara Sumio , Konno Masashi , Kudo Subaru , Yoshida Tomio 
Published: July 2007

AbstractAn equivalent circuit analysis on a spurious component of the force factor, an input‐output electrostatic coupling and a mechanical coupling in a piezoelectric vibratory gyroscope is carried out. These factors cause leakage output. It is found quantitatively that the spurious component of the force factor and the input‐output electrostatic coupling generate a leakage output and provide a lateral shift in the characteristic of the synchronous detection output versus the applied angular rate of the vibratory gyroscope. It is found also that a large mechanical coupling not only generates a leakage output but also reduction of the sensitivity; and, hence, it is not desirable. Further, a method for reduction of these factors is presented and a design guideline of a vibratory gyroscope is summarized.
Error control technique for parallel combinatory spread spectrum communication system
Authors: Sasaki Shigenobu , Zhu Jinkang , Marubayashi Gen 
Published: July 2007

AbstractThis paper discusses the application of the error control technique for parallel combinatory spread spectrum (PC‐SS) communication system proposed previously by the authors. This paper considers the case where &‐bit information is transmitted in the spreading sequences and considers the following two coding methods as suited to PC‐SS systems: 1) to use 2k‐ary Reed‐Solomon code; and 2) to use the constant‐weight code by Chung et al. in the transmitter, converting the data into the combinatory spreading sequences, and to suppress the error in the receiver by taking the double correlation. The bit‐error rate performance is examined for the two methods and the effectiveness is discussed.It is shown as a result that both methods are useful in improving the bit‐error rate of the PC‐SS system. In the latter method, the number of spreading sequences needed per user is reduced to approximately one‐fourth compared to the conventional PC‐SS system with nearly the same bit‐error rate.
Finite‐element analysis of SAW reflection from a metallic grating with an arbitrary angle of incidence
Authors: Ohbuchi Kazuhiro , Koshiba Masanori 
Published: July 2007

AbstractWith a view to developing a method enabling accurate derivation of the reflection characteristics for an oblique incidence of the surface acoustic wave (SAW) into a metallic grating which is a fundamental constituent element of an SAW device, an analysis method is formulated based on the finite‐element method (FEM). The FEM can easily be applied to an anisotropic and piezo‐electric substrate. It is possible to carry out an analysis taking into account the electrical perturbation, mechanical perturbation, and the energy storage effect by a nonradiating bulk wave at the reflection end.In this paper, from the information on the stopband computed by the FEM, the amount of reflection per reflecting strip in the reflector and the shift of the center frequency of the stopband are computed. These quantities are actually computed for gratings on a Bi12GeO20 substrate and an ST‐cut quartz substrate so that the validity and usefulness of the present analysis method are presented.
Synchronization of nonlinear coupled oscillators
Authors: Hirai Kazumasa , Ohnishi Ryouta 
Published: July 2007

AbstractThis paper studies the synchronization phenomenon of frequency and phase of two coupled limit cycle oscillators. This problem is fundamental for many subsystems coupled to each other to behave autonomously.A nonlinear coupled system becomes the gradient system if its coupling factors are chosen appropriately and then a potential function can be determined. Moreover, conditions for the potential function to have the minimum point are investigated and, from this condition, the synchronization conditions of frequency and phase of two coupled oscillators are studied. It is shown that the simulation results agree quite well with the theoretical ones.
Multilevel run‐length‐limited modulation codes for optical disk recording system
Authors: Honguh Yoshinori , Murakami Teruo 
Published: July 2007

AbstractA generalization of the run‐length‐limited (RLL) code has been studied for multilevel recording systems where more than one kind of mark is used to record information. The run‐length constraints have been generalized to include the spacing in addition to the minimum and maximum run‐length constraints. The ratic of the minimum run length to the detection window has become arbitrarily adjustable. This provides the flexibility to design the modulation codes which match with the resolution and jitter characteristics of the recording system.The method of the calculus of variations has been applied to the asymptotic behavior of the amount of information stored in a sufficiently long code sequence. The formulation has been obtained for the code characteristics, which include the maximum density ratio, the maximum amount of information contained in the detection window, the average rate of appearance for individual run lengths, etc.The effect of the multilevel recording scheme depends on the number of the levels, the minimum and maximum run length, and the spacing. The optimum selection of these parameters can realize a large recording capacity close to the intrinsic potential of the multilevel recording system.
A model for multiple‐choice problem selection
Authors: Ueno Maomi , Nagaoka Keizo 
Published: July 2007

AbstractThis paper proposes a new model for the alternative selection process for multiple‐choice test items. The model has the following features in the description: (1) it can cope with the real‐time data, and (2) it is based on the entropy model. The feature of each selection item can be represented using the estimated parameters. Furthermore, using the indices derived from the model parameters, the extent of “illusion” among the test items can be represented quantitatively. The method is applied to the actual data and the following points are discussed: (1) validity of the model, (2) analysis of the characteristics of the selection item, and (3) characteristics analysis of alternative selection process. The effectiveness of the method is demonstrated.
A configuration methodology for high‐speed, bi‐level image codec LSI
Authors: Sato Fumitaka , Murayama Masayoshi 
Published: July 2007

AbstractEarlier, the authors proposed a processing scheme for expansion of the MR/MMR code to improve the performance close to the limit of the method. This paper proposes the processing scheme for MR/MMR encoding (compression) which can suitably be combined with the previously proposed expansion processing scheme. The two schemes are combined to form a CODEC, which is implemented as an LSI;, and the result of evaluation is reported here. This kind of LSI will frequently be used in image retrieval‐type applications, and it is important to reduce the time for expansion processing.In this study, the hardware needed in the proposed high‐performance expansion scheme is determined first and then the functions needed in the compression are mapped on the architecture. The length of the machine cycle is optimized from the viewpoint of expansion. When the delay in the compression circuit exceeds the machine cycle time, the function is divided into two cycles.It is shown that the priority order of pass mode and V mode recommended by T.4/T.6 of CCITT desirably should be reversed from the viewpoint of design, in the case of compression processing. The effect of this reversal is examined. Based on those ideas, CODEC is designed and constructed. It is verified that the functions and performances are realized as are designed. The processing time is mostly proportional to the amount of images. The image data flow almost at a constant rate, which is convenient in the design of the pipeline structure.
Estimation of the system state of a non‐gaussian stochastic system based on the time transitions of moment and probability function—establishment of digital filter and experiment
Authors: Ikuta Akira , Ohta Mitsuo 
Published: July 2007

AbstractThe specific signal in the actual sound environment shows complex distribution forms apart from the standard Gaussian distribution, which is due to a variety of causes. Furthermore, the observed data are often contaminated by additional external noise with an arbitrary distribution type. In this paper, a digital filter for estimating recursively the state variable of a specific signal based on the observation data contaminated by non‐Gaussian type external noise is proposed. More concretely, two types of state estimation methods are derived by adopting respectively (i) a time series regression model and (ii) the entire conditional probability density function, as the state transition model (i.e., system equation). The effectiveness of the proposed method is experimentally confirmed by applying it to the actual data of an acoustic environment.
Behavioral verification of cpus using functional information extraction
Authors: Ohmura Masahiko , Tamaru Keikichi , Yasuura Hiroto 
Published: July 2007

AbstractThe information extraction techniques which transform the description at the logic circuit level in the LSI design process into the description at the functional level are important. The authors have been studying the automatic transformation technique. By combining that technique with the technique for automatic logic synthesis which is now being developed, it is expected that the descriptions at the logic circuit level and the functional description can be transformed to each other. This will help to construct the integrated CAD system.The feature of the method proposed in this paper is that the arithmetic operation functions and the functions at the RT level can be extracted from the tremendous amount of complex circuit descriptions and the results are represented in a simple and clear form. Consequently, the method is especially suited to the behavior verification of the circuits, such as CPUs.In this paper, the object of consideration is limited to the circuits in the CPU system and the application of the functional information extraction technique to the design verification is discussed. Since the behavior description for a CPU is given in a simple and clear form, using the instruction code table or state transition table, the design verification is easy by a visual comparison of the extracted functional description.The complex logic functions in the control circuit are compared using BDD. An actual example of verification is shown in this paper for the 8‐bit microprocessor, and it is demonstrated that a practical processing is realized from the viewpoints of required time and memory capacity.
Application of analogical reasoning and extraction of tutoring rules for concept‐formation learning
Authors: Okamoto Toshio , Morihiro Koichiro , Matsuda Noboru , Takuma Shimpei 
Published: July 2007

AbstractThe concept formation in humans is made through a process where the common items and rules in the observed events are extracted. The observed events may contain an event which is not consistent with the already formed concept. In such a case, the modification or restructuring of the concept takes place and an effort is made toward differentiation or recombination of the concept.With respect to the process where a human forms or acquires a concept, Klausmeier et al. considered the development of the levels in the concept formation. They defined four levels which are the real level, equivalence level, analogy level, and formal level and discussed the order among the levels. In this study, the inference engine is built into the expert module of ITS and the system model to support the concept formation is considered, which contains the intellectual function corresponding to the analogy level.As a domain to handle a realistic problem, a simple transformation of a geometrical figure is considered and the following functions are realized: (1) construction of analogical reasoning engine in the transformation of geometrical figures, (2) construction of the student model which represents the student's analogical reasoning process, and (3) generation of problems based on the student model.
Synthesis of separable‐denominator multidimensional digital lattice filters
Authors: Watanabe Eiji , Nishihara Akinori 
Published: July 2007

AbstractDigital filters play an important role in multidimensional signal processing. Because the coefficients must be expressed in finite wordlength, the deterioration of the characteristics becomes a problem. Using a lattice structure whose efficiency has been confirmed for one‐dimensional (1‐D) digital filters, this paper proposes a unified synthesis method for the practically important separable‐denominator multidimensional IIR digital filters.First, the implementation of a 2‐D separable‐denominator transfer function by a separable‐denominator 2‐D digital lattice filter is considered. A characteristic of the proposed separable‐denominator 2‐D digital lattice filter is that both the usual tapped lattice structure and the injection‐type lattice structure are used and the signal flow becomes simple compared to the method so far.Next, when the numerator polynomial is a mirror‐image polynomial, an implementation method is presented in which the number of tap multipliers is reduced significantly. Furthermore, a method is suggested for the synthesis of a 3‐D transfer function based on the same approach as for the 2‐D case. Finally, the efficiency of this method is confirmed by an example.
Fundamental study of periodically time‐varying state‐space digital filters—statistical analysis, scaling, and stability
Authors: Kawamata Masayuki , Higuchi Tatsuo , Yang Xuedong 
Published: July 2007

AbstractAnalyses of periodically time‐varying (PTV) digital filters that have been published deal with the fundamental properties and the design methods of PTV digital filters described by transfer functions. However, few studies have been published on the design of high‐precision and high‐efficiency PTV digital filters with minimum roundoff noise, minimum coefficient sensitivity, and model reduction.To analyze these design problems, this paper reports on the statistical analysis, scaling, and stability of PTV state‐space digital filters. First, PTV state‐space digital filters are described and dual PTV state‐space digital filters and equivalent transformations of PTV state‐space digital filters are defined. Then covariance of the states and variance of the output in response to a white Gaussian noise input are analyzed statistically. Based on these results, a scaling analysis is presented. Also, asymptotic stability and bounded input‐bounded output stability of PTV state‐space digital filters are discussed. Finally, a numerical example is given to verify the foregoing analytic results.
Control of second‐order temperature coefficients of delay time for saw propagating in thin‐film layers
Authors: Nakagawa Yasuhiko , Yoneda Toshimaro , Omata Tadahiro , Hosaka Keiko 
Published: July 2007

AbstractIn a surface acoustic wave substrate with a “piezoelectric thin‐film/substrate” configuration, the temperature coefficients of the acoustic constants of the Ta2O5 and ZnO thin films were determined by means of the least square method based on the experimental values of the temperature coefficients of the acoustic constants. Also, with regard to the two‐layered model of a “piezoelectric thin‐film/piezoelectric thin‐film/substrate” configuration, the surface acoustic wave speed, electromechanical coupling coefficient and temperature characteristics were computed and the combinations of the film thicknesses were derived for a first‐order zero‐temperature coefficient. Further, it is recognized that the ZnO thin film and the Ta2O5 thin film have second‐order delay time temperature dependences with opposite signs and then a method is proposed for controlling the first‐ and second‐order temperature coefficients in a two‐layered substrate. It is found experimentally and theoretically that there exists a highly stable substrate which exhibits a third‐order characteristic at an appropriate film thickness.
m‐route flows in a network
Authors: Kishimoto Wataru , Takeuchi Masashi 
Published: July 2007

AbstractThe m‐route flow between two vertices is defined in a flow network which is an extension of the flow between two vertices. In the communication network, the m‐route flow corresponds to the set of m‐route structured communication paths. In a flow network, the set of m‐edge disjoint paths connecting the two vertices considered and composed of edges with the same capacity is defined as the elementary edge‐m‐route flows between those two vertices.For the cut of the flow network, the edge‐m‐route capacity is defined as an extension of the ordinary capacity and it is shown that a theorem similar to the max‐flow min‐cut theorem as in the ordinary theory of flows applies to the maximum edge‐m‐route flow. It is shown also that, when the set of m internally disjoint paths connecting the two vertices considered and which is composed of edges of the same capacity is defined as the elementary vertex‐m‐route flow, the vertex‐m‐route flow between two vertices is defined as the sum of elementary vertex‐m‐route flows between those two vertices; and a similar theorem holds. In the communication network, the maximum m‐route flow corresponds to the maximum number of communication paths that can be composed of the m‐route structure between the two terminals.