bluuebunny/crossref_metadata_2025_split huggingface dataset:
A multifeedback active circuit compensating effects of operational amplifier finite GB product and input capacitance
Authors: Okine Mitsuo , Fujii Nobuo 
Published: July 2007

AbstractMultifeedback active circuits are simpler and have low element sensitivity for passive elements; and since they can easily be compensated to operate at higher frequencies, they are among the useful circuits for basic biquad section.Various high‐frequency compensation techniques have been reported which compensate for the finite GB product of an operational amplifier by the passive circuit, but the circuit design should consider the effect of input capacitance.This paper proposes a multifeedback active circuit in which high‐frequency operation can be obtained by compensating the effect of finite GB product and input capacitance of the operational amplifier. The proposed circuit is studied to obtain the pole sensitivity with respect to the GB product.The spread of circuit element values and the influence of the secondary pole of the operational amplifier are discussed, and the compensation for the circuit is proposed. Finally, a fifth‐order lowpass filter with f0 = 100 kHz and passband ripple of 0.1 dB is designed, and its operation is confirmed through experiment.
An adaptive algorithm of a logarithmic‐type adaptive digital filter based on the LMS/Newton method
Authors: Kobayashi Masaki , Itoh Yoshio , Mikami Naoki , Kusaka Hiroji 
Published: July 2007

AbstractThe logarithmic adaptive digital filter (ADF) estimates the unknown system in which the transfer function is represented by a rational function of z. It consists of an ADF to estimate the logarithm of the denominator polynomial of the transfer function and a transversal ADF to estimate the numerator polynomial. Compared to the conventional transversal ADF, it is known that the number of taps can be reduced in this kind of ADF.Studies have been made concerning the adaptive algorithm of the logarithmic ADF and the convergence condition. A problem is that the correlation matrix is a function of the input and the output signals of ADF. This increases the convergence time, compared to the transversal ADF, when the input signal is white.This paper discusses the method of the improvement of the convergence speed and proposes the adaptive algorithm for the logarithmic ADF based on the LMS/Newton method. The successive computation of the inverse matrix of the correlation matrix (Jacobian) as well as the adaptive algorithm are derived. In contrast to the algorithm for the transversal ADF, it is shown that the square term of the estimation error is included in the update term of the tap vector.Finally, the convergence condition for the proposed algorithm is derived. The convergence speed, the adaptive algorithm and the convergence condition are examined by a computer simulation.
Use of a laplace‐transform relaxation method for the analysis of nonlinear electric circuits
Authors: Ichikawa Satoshi , Tada Hideo 
Published: July 2007

AbstractThe relaxation method is one of the methods for solving an initial value problem for a set of differential equations and is suitable for analysis of large‐scale circuits such as those simulating VLSI circuits. In analysis of the relaxation method, time domain analysis is most common but complex frequency domain analysis by means of the Laplace transform also is applicable.This paper presents the Laplace‐transform analysis. Semiconducting elements such as transistors of the VLSI circuits exhibit nonlinear characteristics. Thus, the differential equations to be used in the relaxation method must be nonlinear. In some cases, the properties of nonlinear elements are given not by analytic functions but by a series of discrete numerical values such as observed data. To express the nonlinearity of these elements, multidimensional interpolation formulas are used in this paper and practical computer algorithms for solving them are derived. The analysis of the conditions of convergence of the relaxation method shows that the proposed algorithm is applicable to circuits which operate in both stable and unstable domain, such as oscillators.
Identity‐based noninteractive common‐key generation and its application to cryptosystems
Authors: Tanaka Hatsukazu 
Published: July 2007

AbstractAt Crypto '84, Shamir originally proposed the concept of identity (ID)‐based cryptosystems and signature schemes. In this paper, a new realization scheme of a cryptosystem based on this concept is proposed for which the common‐key generation based on ID‐information requires neither a public directory nor interactive preparation for communication.For the principal operations of common‐key generation it is necessary to compute powers of integers modulo the product of two large Sophie Germain (SG) primes. The basis for security, as in the RSA cryptosystem, depends on the computational difficulty of factoring this product into its constituent primes. In particular, as a realization of a cryptosystem of the new ID‐based type, we permit the generation of nonsymmetric common keys and generate two different common keys for each pair of users. One key is used for enciphering and the other is used for deciphering when they are applied to a common‐key cryptosystem. The result is a very secure realization of an ID‐based cryptosystem which prevents both the disclosure of the center's secrets and a conspiracy by nonparticipants to forge a secret key between users since the exponent is nonsymmetric in the step before executing the exponentiation and it is a proper value between two users.
Extraction of symmetry properties using correlation with rotated and reflected images
Authors: Masuda Takeshi , Yamamoto Kazuhiko , Yamada Hiromitsu 
Published: July 2007

AbstractThe symmetrical properties of an image or a figure are important in visual psychology and computer vision.This paper proposes a new method to extract the properties of rotational symmetry and reflectional symmetry from planar two‐dimensional images. In the detection of the rotational symmetry, first, the original image for a quantized range of angles of rotation is rotated. The rotated results are convolved with the image using directional features. Then a set of affine transformations is applied to the parameter space to obtain the correlation results using each pixel as the center of rotation.The periodicity of the correlation along the rotation angle for each point is evaluated. Finally, the local maximum correlation is determined that indicates the center and the number of folds of the rotational symmetry. In the detection of the reflectional symmetry, the image for the lines in the possible quantized directions is reflected. Then the correlation between the resulting images and the original image is calculated.The transformation that maximizes the correlation directly indicates the direction of the axis of the reflectional symmetry and the translation amount of the glide symmetry. This method does not require any segmentation nor knowledge of the centroid position.The method in this paper evaluates the transformation that matches the images even though the match is a partial one; thus, it can extract the symmetrical property that exists only partially.Although a large amount of computation and storage capacity is required, the method is fundamental, versatile, and suited to the parallel computation.
A timing analyzer for multiple clock phase designs with level‐sensitive latch feedback loops
Authors: Imai Masanori , Ishikawa Hiromi , Kobara Junko 
Published: July 2007

AbstractThis paper proposes a method for the high‐speed timing analysis of the multiple clock phase synchronized circuit. In general, the static timing analysis can be executed by the computational complexity which is independent of the input pattern.In the traditional method of handling the multiple clock phase synchronized circuit, however, the timing analysis of the circuit requires the number of periods, which depends on the circuit structure, such as the number of latch stages in the longest path in the circuit. In addition, independently of whether or not there exists a loop containing a latch, the same number of elements as that of the clock phases must be examined in a period.A larger number of processings is always required when there exists a loop. By contrast, in the proposed method, each element is examining exactly once, if there does not exist a loop. Even if there exists a loop, the processing can be executed by the number which is independent of the number of phases. The number is several in the typical practical circuit. Thus, the speed is improved by the proposed method by restricting the timing analysis over multiple phases and multiple periods into a single period (the proposed timing analysis in a period, in the sense of this paper, is of a multiplexed nature since the verification extends over multiple phases and multiple periods).
Periodic sampling basis and associated biorthonormal basis of signal spaces composed of spline functions
Authors: Toraichi Kazuo , Iwaki Mamoru 
Published: July 2007

AbstractThis paper derives a Fourier‐like expansion formula in the signal space composed of spline functions, with the sampled value sequence of the signal as the expansion coefficients. Here, the domain is a finite closed interval and the boundary condition is periodic. The signal space composed of spline functions is one of the generalizations of the band‐limited signal space with the continuous differentiability as the parameter. Consequently, the Fourier‐like expansion formula derived in this paper is a generalization of Cahn's sampling theorem in the band‐limited signal space.
Uniform wiring structure embeddable in euclidean space
Authors: Aso Hirotomo 
Published: July 2007

AbstractIn a systolic array, uniform wiring is required for simplification of processor elements, synchronous and parallel data transmission through communications links, etc. As a method for designing a systolic array for a loop program given as a problem specification, there exists a method which is based on extracting wiring information from dependence relations among elemental computations in the loop program. In this paper, the uniformity of wiring structure is logically defined and a sufficient condition is given under with a given uniform wiring structure is embedded in a Euclidean space. In addition, its implementation method is given in the form of an embedding map. Examples satisfying this condition and a counterexample related to this condition are given. Furthermore, it is shown that there are cases that are embeddable in a Euclidean space even if they do not satisfy the given sufficient condition, which implies a natural expansion of the definition of embedding.
Application of K—M algorithm to vector quantization
Authors: Yuasa Tetsuya , Arimoto Suguru 
Published: July 2007

AbstractThis paper considers applying the algorithm proposed by Kalantari and McDonald (called the K—M algorithm) [1] for solving the nearest point problem to vector quantization. As a high‐performance vector quantization, the LBG algorithm in which a representative vector is defined as the center of gravity of a segment is well known. However, the method has a problem due to its inherent property that the optimal segmentation is not always attained, which implies a possibility that important information may be lost. By contrast, the proposed method is based on the K—M algorithm and restores the original signal within a specified quantization error ϵ. Consequently, the problem of information loss is avoided by defining ϵ appropriately. A simulation is executed for four‐dimensional quantization with regard to the memoryless Gaussian information source, and a satisfactory result is obtained from the viewpoint of the rate‐distortion theory.
A method for synthesizing animation to transmit sign language by intelligent communication
Authors: Xu Jun , Aoki Yoshinao , Zheng Zhong 
Published: July 2007

AbstractThe following intelligent communication system is considered for the transmission of the animation image information. The structural models are prepared both at the transmitter and the receiver. Only the information concerning the motion of the object is transmitted to provide the model with the motion parameters, and the animation image is synthesized. In such a system, the real‐time image synthesis based on the motion parameters is required.This paper aims at the intelligent communication of the sign language image using a personal computer. A method of real‐time synthesis is discussed which is based on the parameter representation of the hand motion and the computer graphics (CG) of the animation image. When the animation image for the human body is to be generated in real‐time, using the three‐dimensional shape model, the real‐time system is difficult to realize at the present stage by a personal computer from the viewpoint of the computation time. An idea is to use the key‐frame figure interpolation (which is a two‐dimensional figure processing) instead of the three‐dimensional shape model to reduce the computation time in generating the animation. However, it is difficult in this method to derive the rotational image of a three‐dimensional object such as the human hand.From such a viewpoint, the stick‐figure model for the upper limb is adopted in this study, aiming at the intelligent transmission of the sign language image. The state of connection of the three‐dimensional segments, which are obtained by the segmentation at the joints, is represented by a vector. The skeleton represented by the vector is shaped appropriately into a geometrical shape. Then, using the three‐dimensional vector representing the skeleton motion, the shapes of the figure, etc., are constructed and the result is projected on the two‐dimensional plane.
A method for two‐dimensional layout of semantic structure graphs
Authors: Matsui Tatsunori 
Published: July 2007

AbstractA questionnaire containing multiple‐choice questions is a representative method to investigate human behavior. Previously, Takeya proposed the semantic structure analysis (SS analysis) as an analytical means for data obtained by the forementioned method. A structural graph of the SS analysis is called an SS graph, and it is conceived that the SS graph is of the hierarchical structure when items are laid out taking the ordinate for the measurement as the statistic such as mean evaluation values. However, no argument has been made with the layout of the abscissa.With this in mind, an observation concerning the unsolved problem, i.e., a method for two‐dimensional layout of the semantic structure graph, is given in this paper. To solve this problem, a concept of a zone is introduced from a relationship between the ordering coefficient and the factor load by means of the centroid method. Then a measure to compose the abscissa by means of the zone determination values is proposed.It is shown that not only can the relationship among the individual items be comprehended but also the meanings grasped as item groups together with the meanings among the item groups. Furthermore, by observing the linkage of the amount of information possessed by the individual items, especially of the effective category numbers and mean evaluation values, by means of a model and examples, the size of scattering of the evaluation values is explained explicitly by composing the abscissa by means of this effective category number. Thus, the relationship of items including the response pattern can be grasped.
An adaptive lattice filter using a cyclic enzyme system
Authors: Iiguni Youji 
Published: July 2007

AbstractAn adaptive lattice filter for filtering impulsive noise is designed using a cyclic enzyme system. The cyclic enzyme system has a memory mechanism and can maintain the previous output for some duration independently of the system input. The partial autocorrelation (PARCOR) coefficient computed through the system is then robust against impulsive noise that appears as large spikes of short duration. Furthermore, a set of PARCOR coefficients estimated by the new filter is always stable. The effectiveness is investigated analytically and through computer simulation.
A method for transforming multiple‐objective linear programming problems with trapezoidal Fuzzy coefficients
Authors: Okada Shinkoh , Nakahara Yozo , Ida Kenichi , Gen Mitsuo 
Published: July 2007

AbstractRecently, many methods have been reported for transforming fuzzy multiple‐objective linear programming (MOLP) problems. However, the transformation into a crisp MOLP problem requires an extremely large number of constraints and decision variables which is the main disadvantage of these approaches.This paper proposes that a maximizing MOLP problem with trapezoidal positive fuzzy coefficients can be transformed into a crisp MOLP problem without increasing the number of constraints by basing the two indices on the inequality relation between trapezoidal fuzzy numbers. The usefulness of the proposed method is demonstrated.
Algebraic geometric codes on certain plane curves
Authors: Miura Shinji 
Published: July 2007

AbstractNecessary and sufficient conditions are given for projective plane curves to have cusps isomorphic to the origin of an affine plane curve xa + yb. Based on them, a family of curves Cab having only one such cusp as a singular point and a family of curves rCab having only two such cusps as singular points are formulated. Also, the structures of algebraic geometric codes generated on curves contained in these families are shown, where a and b are relatively prime. Then the genus is (a − 1)/(b − 1)/2 and the basis of linear space L(m · P) is given by rational functions xiyi only. Second, by giving concrete examples, it is shown that families of curves Cab and rCab contain many curves which attain Hasse‐Weil upper bound.
On a burst error correcting algorithm for binary expanded reed‐solomon codes
Authors: Kohnosu Toshiyuki , Hirasawa Shigeichi , Nishijima Toshihisa 
Published: July 2007

AbstractThe Reed‐Solomon (RS) code is widely applied to various fields including digital memory and communications systems. Since it has desirable properties from various viewpoints, intensive studies are made on its performance such as error correction. The code is not a complete code although it is a maximum‐distance separation (MDS) code, and there is a possibility that the code can correct more errors than the bounded distance decoding. From such a standpoint, this paper presents a method which can fully utilize its potential power for burst error correction when (t + 1) symbol errors are detected on the binary expanded RS code. The property that each of the sequences obtained by dividing the RS code with a certain parameter according to the basis is a codeword of BCH code, and an algorithm is proposed which estimates the symbol containing the head or tail of the solid burst error by superposing the received sequences. A decoding method is obtained which completely guarantees the error‐correcting power realizable by the bounded distance decoding on GF(2m) and realizes a larger error‐correcting power than the bounded distance decoding for the solid burst error represented on GF(2). The proposed method is also applied to the correction of the high‐density burst error, and the usefulness is demonstrated.
Deficient SOCS3 expression in CD4+CD25+FoxP3+ regulatory T cells and SOCS3‐mediated suppression of Treg function
Authors: Pillemer Brendan B. L. , Xu Hui , Oriss Timothy B. , Qi Zengbiao , Ray Anuradha 
Published: July 2007

AbstractNaturally occurring CD4+CD25+FoxP3+ regulatory T cells (Treg) suppress T helper (Th) cell‐mediated immune responses. The cytokines IL‐2 and IL‐6 are known to influence Treg function. However, their relative effects on Th cells versus Treg are not well understood. Stimulation with IL‐2, and to a lesser extent, IL‐6, enhanced Treg proliferation, FoxP3 and CTLA4 maintenance, and suppressive function. In contrast, when IL‐2 or IL‐6 were added to Treg/Th cell cocultures, suppression was inhibited. The molecule SOCS3 negatively regulates responses to IL‐2 and IL‐6. Interestingly, unlike Th cells, Treg were found to be deficient in SOCS3 protein expression. The significance of this finding lies in the need for Treg to rapidly respond to these cytokines to prevent unwarranted immune responses to self‐antigens. Overexpression of SOCS3 in Treg decreased their proliferation, FoxP3 and CTLA‐4 expression and suppressive function. Thus, up‐regulation of SOCS3 expression may be a useful therapeutic approach in diseases where inhibition of Treg is desirable.
Synthesis of a Norsesquiterpene Spirolactone/Steroidal Hybrid by Using an Environmentally Friendly Domino Reaction as a Key Step
Authors: Chanu Angéline , Safir Imad , Basak Ramkrishna , Chiaroni Angèle , Arseniyadis Siméon 
Published: July 2007

AbstractA new class of hybrid molecules is accessed by elaborating testosterone's AB ring into the norsesquiterpene spirolactone A′B′ ring. The cyclic ene‐acetal 6b, obtained by a PhI(OAc)2‐mediated domino process from vicinal unsaturated diol 5, is used for the synthesis of a norsesquiterpene spirolactone/testosterone hybrid. The route presented combines the advantages of domino reactions with the ease of functional group interchange on steroidal frameworks. (© Wiley‐VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2007)
Nontraditional Electrode Materials in Environmental Analysis of Biologically Active Organic Compounds
Authors: Barek Jiří , Fischer Jan , Navrátil Tomáš , Pecková Karolina , Yosypchuk Bogdan , Zima Jiří 
Published: July 2007

AbstractThis review describes recent results regarding voltammetric and amperometric determination of submicromolar concentrations of various environmentally important biologically active organic substances using nontraditional types of electrodes either in batch analysis or in flow liquid systems (especially HPLC or FIA with electrochemical detection). Attention is paid to solid amalgam electrodes (environmentally friendly alternatives to mercury electrodes), to carbon paste electrodes with easily renewable surface, to boron doped diamond film electrodes with very low noise and broad potential window, and to inexpensive solid composite electrodes with high signal‐to‐noise ratio, compatibility with organic solvents and easy mechanical or electrochemical pretreatment. The review concentrates on our own results in the context of the general development in the filed.
Direct Determination of Phosphite in Fertilizers by Flow‐Injection Amperometry
Authors: Franzini Vanessa Pezza , Fugivara Cecílio Sadao , Benedetti Assis Vicente , Ribeiro Clóvis Augusto , Cavalheiro Eder Tadeu Gomes , Neto José Anchieta Gomes 
Published: July 2007

AbstractA sensor based on graphite electrode modified with palladium‐platinum‐palladium film is proposed for phosphite determination by flow‐injection amperometry. The modified electrode was prepared by a sequential cathodic deposition of Pd, Pt and Pd on a graphite electrode from 0.5% m/v PdCl2+28% m/v NH4OH and 2% m/v H2PtCl6+10% v/v H2SO4 solutions. After suitable conditioning, the electrode showed catalytic activity for phosphite oxidation when 0.15 V was applied. The proposed system handles approximately 50 samples per hour (0.01–0.05 mol L−1 Na2HPO3; R2=0.9997), consuming ca. 70 μL of sample per determination. The limit of detection and amperometric sensibility were 5×10−4 mol L−1 and 1.5 mA L mol−1, respectively. The proposed method was applied to analysis of fertilizer samples without pre‐treatment. Results are in agreement with those obtained by spectrophotometry and titrimetry at 95% confidence level and good recoveries (96–109%) of spiked samples were found. Relative standard deviation (n= 12) of a 0.01 mol L−1 Na2HPO3 sample was 2%. The useful lifetime of modified electrode was around 220 determinations. For routine purposes it means that this electrode can be continuously used for 5 hours.