bluuebunny/crossref_metadata_2025_split huggingface dataset:
A priority queue with two priority classes whose nonpriority class call has preemptive and nonpreemptive parts
Authors: Komatsu Masaharu 
Published: July 2007

AbstractA priority queue with two priority class calls is analyzed. In this model, nonpriority call consists of three parts: preemptive‐repeat part, preemptive‐resume part, and non‐preemptive part. If a priority call arrives during the service of the preemptive‐repeat part, the preemptive‐resume part and the non‐preemptive part, the preemptive‐repeat different, the preemptive‐resume, and the nonpreemptive priority queueing disciplines are enforced, respectively. As an analytical result, characteristic equations of completion time, busy period, waiting time, system time and through out are derived. Also, from numerical examples, throughput and average waiting time characteristics are examined.
An algorithm for updating skeleton matrix of a reachability matrix model
Authors: Kase Satoshi , Ohuchi Azuma , Kaji Ikuo 
Published: July 2007

AbstractA reachability matrix M is a binary matrix with a reflexive and transitive property, i.e., M + I = M and M2 = M, where I is the identity matrix. A skeleton matrix S is a nonredundant matrix of M. the skeleton matrix has the following properties: SK‐2 ≠ SK‐1 Sk M, and any binary matrix B ≠ S which satisfies the forementioned equation will also satisfy B > S, where the super scripts on S are exponents and the operations are Boolean. an algorithm for updating the skeleton matrix is proposed. the proposed algorithm is much more efficient than the previous algorithm used to perform the same task.
Variable rate sampling technique for images based on successive approximation vector quantization
Authors: Yamada Yoshio , Tazaki Saburo 
Published: July 2007

AbstractThe monochromatic static image can be represented as a scalar‐valued function f(u, v), for the brightness or density at point (u, v) on the two‐dimensional coordinate space T. For the color image, the image is represented by a vector‐valued function composed of such signal components as red, green, blue or luminance, chrominance and saturation. The sampling of an image can be considered as derivation of a sequence {fi} of spatially discrete sampled values by dividing the coordinate space T. Denoting the partitioning of the coordinate space by {Si}, the sampled value fi is a scalar or vector value, which is determined uniquely by the subimage {f(u, v) |(u, v) ϵ Si}.This paper proposes a new variable rate sampling method which partitions the multidimensional coordinate space efficiently based on the vector quantization method. A high‐speed region partitioning algorithm is also shown which is based on the successive approximation vector quantization. The usefulness of the proposed method is demonstrated by simulation. Using those results, the sampling process is reformulated as the vector quantization in the coordinate space. Thus, a new development is made for the variable rate sampling method.
A regression analysis method matched to the prediction of probability distribution with less information loss and its application to the acoustic environment (in the case with continuous value observation)
Authors: Ohta Mitsuo , Chang Bing , Takaki Naomitsu 
Published: July 2007

AbstractIn the study of acoustic environment, the well‐known regression analysis is applied based on the measured data for the predictor variable and the criterion variable. Standard methods are employed in the usual regression analysis, such as the assumption of Gaussian distribution of the variable, the mean‐square evaluation of the error, and the prediction based on the transformation of regression function. This paper concentrates on the derivation of a new methodology, avoiding as much as possible such a traditional artificial simplification, and predicts the overall distribution of the fluctuation of the predictor variables based on the criterion variables with arbitrary fluctuation distribution. Based on the standard method of regression analysis, a discussion is made as to what higher‐order processing should be introduced to achieve the goal of prediction of the fluctuation distribution. A method of regression analysis matched to the complexity of the phenomenon, and a new prediction method for the response distribution based on the regression are proposed. More precisely, three kinds of regression models are derived which reflect as comprehensively as possible various linear and nonlinear correlation information between two kinds of variables. It is shown that the well‐known regression analysis based on the least mean‐square evaluation is included in the proposed method as a special case. The proposed regression model and the prediction method are applied to the actually measured data for the acoustic environment, indicating experimentally although partially the practical usefulness of the proposed method.
Modified two‐dimensional AR lattice filter and its application to spectral analysis
Authors: Watanabe Tsutomu , Taguchi Akira , Hamada Nozomu 
Published: July 2007

AbstractAs a generalization of a one‐dimensional (1D) AR (Autoregressive) lattice filter structure, Parker et al. proposed a two‐dimensional (2D) AR lattice filter with three reflection coefficients in each stage for the linear prediction of a given random signal.This paper shows that Parker's lattice model is not sufficient to realize any 2D AR process. Hence, we will use a more general lattice filter whose stage has six reflection coefficients. The determination procedures of reflection coefficients, and the algorithm for deriving an AR transfer function, a sufficient condition of filter stability, are considered. In the example shown, the proposed model is seen to be more general than that of Parker's. Finally, a new power spectral estimation method using the proposed lattice filter is considered.
Switched‐capacitor circuit analysis program SCNODAL and its application to SC filter design
Authors: Inoue Takahiro , Ueno Fumio , Sonobe Satoru , Matsumoto Tetsuya 
Published: July 2007

AbstractA general‐purpose circuit analysis software such as SPICE, and an SC‐specified circuit analysis software such as SWITCAP, are both available for analysis of SC circuits. However, the former requires additional pre‐and post‐processings because the analysis is performed by converting SC circuits into equivalent continuous‐time circuits such as active‐RC circuits. As to the latter, the present limitation on the kind of OS environments is severe for users in Japan. SCNODAL proposed in this paper is developed for the purpose of providing an SC circuit analysis tool which is easy to use and is implementable on general‐purpose or personal computers popular in Japan. Since SCNODAL has many functions, it is useful as a semi‐general‐purpose SC circuit analysis tool. SCNODAL has an input format which is best suited for an analysis of parasitic‐insensitive SC filters. Since nine‐standard building blocks are built in the program, a compact representation of the input data is possible. Furthermore, SCNODAL has many user‐oriented functions with regard to a clock‐pattern input form, an input form for a tracking pattern of elements, and an option for an output form. Thus, one can easily perform a variety of analyses such as amplitude response analysis and sensitivity analysis. In this paper, SCNODAL is described based on the formulations of the nodal equation and other equations used in each analysis to the actual usage of this software, by illustrating an SCF design.
SC immittance simulation circuits using ugbs and their applications to filters
Authors: Hyogo Akira , Sekine Keitaro 
Published: July 2007

AbstractAs switched capacitor (SC) immittance simulation circuits based on the bilinear z transformation, circuits are proposed that realize the inductor (L) as the linear system of s, and the FDNC (D) and FDNR (M) as the quadratic systems. The circuit configuration is separated into the feedback circuit and the immittance realization unit and their realizations are constructed. Since the UGB (Unity Gain Buffer) with a simple circuit is used in the active circuit for these units, one can expect low power consumption, small chip areas and high‐speed operation. All the proposed circuits can be constructed with a binary phase clock. The element values can be determined only by one capacitance value comprising the feedback circuit and the sampling period. With respect to the inductor and the FDNC, the parallel resistance and capacitance generated by the choice of the capacitance value are investigated. With respect to FDNR, it is shown that an M‐L‐C‐R parallel circuit with arbitrary values of M and L can be obtained by simply adding one set of feedback circuits. Finally, as an application of the proposed circuit, a low‐pass filter, a bandpass filter and a high‐pass filter are constructed. Their operations are confirmed by the experiments using individual components.
Finite element simulation of steady‐state heat problem in electrostrictive vibrators
Authors: Ando Ei'Ichi , Kagawa Yukio 
Published: July 2007

AbstractUltrasonics is utilized widely for industrial application. An electrostrictive transducer is used widely for this purpose because of its high electromechanical conversion efficiency. In actual use, the transducer usually is operated under the mechanical vibration of large amplitude, and the mechanical loss of the vibrating body is responsible for the heat.Since the transducer is also excited at high voltage, the dielectric loss in a ferroelectric body must be considered for the heat. These losses should be taken into account in the design. However, the temperature distribution and the influence of the temperature caused by the heat are not always clear. The heat design of the transducers depends on the experiments which at present, are made on a trial‐and‐error basis.This paper describes the application of the finite element method to simulating a steady‐state heat diffusion problem in electrostrictive vibrators. The simulation is made to evaluate the temperature distribution caused by the heat which is generated by the mechanical vibratory loss in the elastic body and the dielectric loss in the ferroelectric body, and then the influence of the temperature distribution on the transducer characteristic is examined. Simulation is an experiment on computer and could be used as a means of CAD. Among others, the capability of the visualization of the temperature distribution and the thermal stress distribution helps to design the ultrasonic transducers. A numerical demonstration is made whose results are compared with the experimental results. The technique is proved to be useful in solving problems of this kind.
Variations of vertex potentials by short‐circuiting two vertices in resistance networks
Authors: Sato Kimio 
Published: July 2007

AbstractIn the resistance network N, the potential of each vertex determined in reference to one vertex of the input vertex‐pair, where a unit current source is placed, can be expressed by using the topological formula as the ratio of the conditional 2‐tree conductance product sum to the tree conductance product sum of N. It is a well‐known empirical law that the potential of the input vertex (equi‐valently, the input resistance) does not increase if any two vertices of N are short‐circuited. However, no rigorous and simple algebraic proof including the potential variation of the input vertex is available, and such studies on an arbitrary vertex as its generalization have not been carried out. In this paper, the variations of vertex potentials by short‐circuiting two vertices of N are formulated by using the topological process. If the formula obtained here is used, a necessary and sufficient condition can be provided for increase (or decrease) of any vertex potentials by short‐circuiting two vertices of N besides a proof of the fore‐mentioned empirical law. In addition, the following can readily be verified. If the potentials of two vertices of N are equal, the potentials of any vertices do not change by short‐circuiting the two vertices. Even if a specific vertex potential does not change after short‐circuiting two vertices, the potentials of these two vertices are not necessarily equal.
Numerical analysis of switching transformation matrices for SC circuits
Authors: Hanagata Osamu , Tanaka Mamoru 
Published: July 2007

AbstractIn equations describing switched‐capacitor (SC) circuits, the switching equation of some switching instant is represented by v+c = F · v−c + G · u+. Historically, the transformation matrices F and G have been obtained by the limiting method, in which each switching resistance approaches infinity or zero. This method derives the transformation matrices F and G directly. But it has numerical instability for large‐scale SC circuits, because Frame's method is used. In this paper, we propose two methods to obtain the transformation matrix F from a characteristic matrix C. The first method is the Danielevsky's method, and the second is the backward Euler method. We also propose another method to transform F to G by means of characteristic matrices given by circuit topology, by relation of zero input and the zero state responses. The results of the simulation are represented by a simulator.
Measurement of the complex relative permittivity frequency characteristics of the body using pulse—reflection
Authors: Higashi Tsunehito , Ishihara Khoshi 
Published: July 2007

AbstractFrom the measurement of a reflected voltage waveform from a biological body for a step‐like voltage waveform, the frequency characteristics of the complex relative permittivity are studied and the following results are obtained: (1) if the blood flow and sweating are normal, the value of tanδ in the mouth is 4 ‐ 6 at about 10 MHz because electrochemical materials are contained in a large quantity. At frequencies below 100 MHz, the value is larger than those at the face, upper arms, legs and torso and its decrease with respect to frequency is larger. The back of the foot and the thenar have relative permittivities and tanδ's lower than other parts and hence are suitable for measurement of emotion functions; (2) in a physical exercise which causes a change in blood condition without sweating, the value of tanδ in the moving part increases as the number of motions is increased. In addition, the frequency characteristics below 1 GHz change significantly. The value of tanδ in the portion not related to the motion increases even after termination of the motion. Hence, the effect of the exercise can be evaluated from tanδ; and (3) as sweating progresses, the reduction of the permittivity becomes significant at frequencies below 100 MHz while the increase of tanδ is significant below 1 GHz. Hence, the sweating activity can be evaluated from the complex relative permittivity.
A unified approach to multiobjective linear programming problems with fuzzy parameters
Authors: Sakawa Masatoshi , Yano Hitoshi 
Published: July 2007

AbstractThis paper considers multi‐objective programming problems with fuzzy parameters, and newly defines the concepts of four types of α‐feasibility and β‐Pareto optimality. The relations between these concepts is discussed in some detail. Four types of (α, β) Pareto optimal solutions, which simultaneously consider the proposed α‐feasibility and β‐Pareto optimality, are introduced. The possibility of deriving these solutions using linear programming is shown. The relationship of this approach to the already proposed extended concept of the Pareto optimal solution is also discussed.
Orthogonal projection algorithm for block adaptive signal processing and some of its properties
Authors: Furukawa Toshihiro , Kubota Hajime , Tsujii Shigeo 
Published: July 2007

AbstractWith the progress of hardware technology, the development of real‐time adaptive algorithms is becoming more and more important. The essential questions concerning adaptive algorithms are: 1) increasing the speed of the algorithm; and 2) speeding up the convergence. It seems that the block signal processing and the orthogonal projection on the subspace of state‐vectors are effective methods to solve the forementioned questions 1) and 2), respectively.This paper proposes a block orthogonal projection algorithm (BOPA) which combines the block processing with the orthogonal projection operation. Next, an analysis of this algorithm is presented and the fundamental properties of the relation between the block length and the convergence characteristics are shown. Also, the efficiency of the proposed algorithm is verified by computer simulation. This algorithm is based on a block‐by‐block adaptation where the operation of orthogonal projection on the state‐vector space is performed repetitively for arbitrary blocks.
An efficient user interface based on maximizing shared information
Authors: Suzuki Joe , Matsushima Toshiyasu , Hirsawa Shigeichi , Inazumi Hiroshige 
Published: July 2007

AbstractIn designing systems with a human‐computer interface with a minimum number of interactions, there are two issues to consider: the determination of a proper sequence of questions by the user, and proper termination by the computer system, based on previous instructions. In short, these issues are those of feature selection ordering and a stopping rule for pattern recognition processes. Conventional treatments of these problems have been investigated from the viewpoint of an average error rate. When the number of patterns is large, however, and the number of instructions to be terminated is large, from the point of view of user interface efficiency, and the average error rate is not an effective indicator at the intermediate stage. In this paper, a new method is proposed for determining feature selection ordering and a stopping rule which focuses on the remaining patterns at each stage, and which maximizes the value of mutual information between the user's responses and the required pattern. Important properties associated with this scheme have been demonstrated while evaluating its performance via computer simulation. One is that the average information gain at each stage decreases monotonically, and another is that this scheme produces the minimum error rate.
Logic design system with evaluation‐redesign mechanism
Authors: Maruyama Fumihiro , Kakuda Taeko , Matsunaga Yusuke , Kawato Nobuaki , Minoda Yoriko , Sawada Shuho 
Published: July 2007

AbstractSophisticated CAD (Computer‐Aided Design) systems that can produce quality designs quickly are anticipated to keep pace with the remarkable advance of VLSI technology. This paper presents a cooperative logic design system, co‐LODEX, in the two streams of design, datapath design and control design. The feature of co‐LODEX is its evaluation‐redesign mechanism using assumption‐based reasoning, which automates the evaluate‐redesign cycle under constraints. As constraints co‐LODEX takes those on area and speed.Design alternatives are considered as assumptions and constraint violations as contradictions. Redesign was implemented as contraction resolution. Here, justifications are defined for constraint violations whose forms are independent of actual constraint values, and the evaluation‐redesign mechanism based on these justifications is described.An experimental system was implemented and it was observed that it could correctly carry out the evaluation‐redesign mechanism. It enables the user to specify constraints in terms of numbers and obtain a circuit satisfying all of them. It also allows the user to obtain a variety of circuits efficiently with different characteristics conforming to the same specification by changing constraints.
A Communications Network Reliability Specification Based on the Failure Effect
Authors: Watanabe Hitoshi 
Published: July 2007

AbstractOne method used in the reliability design of a switching system is the determination of the unavailability target according to the scale of a failure. This method has already been applied to the design of digital switching systems. The basic idea of this approach is the following. The effect produced by a failure in a switching system depends on the scale of the failure. Consequently, in order to achieve a balance between economy and reliability, the target of reliability should be set according to the scale of the failure. A similar idea can be applied to a link in a communications network. This paper presents the basic concepts involved in setting the unavailability target in the link of a communications network based on the scale of the failure. The effect of a link failure is formulated in terms of the degradation of the channel capacity, and is introduced as the network loss. A method is presented, wherein the unavailability target is set so that the loss is a reasonable value. In contrast to the case of a switching system, for a network it is a difficult problem to determine the unavailability target of a link. This is because a link is often a common path between different node pairs, and a strict reliability design should consider all the paths between nodes. This paper presents a simple method for dealing with this problem, in which the unavailability target is set taking into account only the scale of the link, and not the individual paths between the nodes. It is shown that the proposed reliability design method is quite useful in practice.
Algorithms for finding maximum and selecting median on a processor array with separable global buses
Authors: Maeba Takashi , Tatsumi Shoji , Sugaya Mitsuyoshi 
Published: July 2007

AbstractA problem has been considered in which the maximum among N data should be determined by providing a global bus in a processor array. As a solution to this problem, various kinds of global bus configurations have been proposed from the viewpoint of improving the computation time. This paper considers the processor array with global buses, which includes several switching units and can be separated by the switching control from the processors.Parallel algorithms are constructed which can solve efficiently the semigroup computation such as maximum determination and the median selection problems. The computational complexity of the proposed algorithm is evaluated to indicate that the proposed method has an asymptotically desirable property. Furthermore, to verify that the separable global buses can be embedded efficiently in a VLSI chip, the area‐time complexity is evaluated as a performance measure for the VLSI circuit. Comparing the result with the case of the processor arrays with the traditional global bus configuration, the proposed algorithms are shown to be more VLSI‐oriented.
The dead‐zone conductor hyperchaos generator
Authors: Saito Toshimichi 
Published: July 2007

AbstractThis paper discusses a simple four‐dimensional autonomous hyperchaos generator. This circuit includes only one nonlinear element: a dead‐zone conductor (serially connected Zener diodes) and the circuit dynamics is described by a piecewise‐linear canonical equation. Regarding the dead‐zone conductor as a switch, the circuit equation can be simplified and hence a two‐dimensional Poincaré map can be defined. This simplification is proved to be reasonable for an n‐dimensional canonical form. The Poincaré map and its Lyapunov exponents can be calculated by using exact solutions and they explicate the generation of hyperchaos and related phenomena.
A method to measure the area function from distribution of complex sound pressure in the nonuniform acoustic tube
Authors: Motoki Kunitoshi , Miki Nobuhiro , Nagai Nobuo 
Published: July 2007

AbstractDetermination of the area function of the vocal tract is an important problem for the speech production model. This paper proposes a method to measure the area function from the distribution of complex sound pressure in the nonuniform acoustic tube. The area is obtained with the calculation procedure of the cascade matrix at each measuring point under the assumptions of plane‐wave propagation and the losslessness of the non‐uniform tube. Discussions are also presented on the experiments for axially symmetric tubes and replicas of oral cavities. The proposed method is useful in investigating the influence from the complicated shapes of the oral cavities by using their replicas.