bluuebunny/crossref_metadata_2025_split huggingface dataset:
Monitoring for outliers and level shifts in kalman filter implementations of exponential smoothing
Authors: Kirkendall Nancy J. 
Published: July 2007

AbstractThis paper presents a new application of a Kalman filter implementation of exponential smoothing with monitoring for outliers and level shifts. The assumption is that each observation comes from one of three models: steady, outlier, or level shift. This concept was introduced as a multiprocess model by Harrison and Stevens (1976). However, their handling of the models is different. In this paper four different model‐selection criteria are introduced and compared by applying them to data. The new features of the application include the four model‐selection criteria and the estimation of the required parameters by maximum likelihood.
Analysis of many short time sequences: Forecast improvements achieved by shrinkage
Authors: Ledolter Johannes , Lee Chang‐Soo 
Published: July 2007

AbstractCredibility models in actuarial science deal with multiple short time series where each series represents claim amounts of different insurance groups. Commonly used credibility models imply shrinkage of group‐specific estimates towards their average. In this paper we model the claim size yu in group i and at time t as the sum of three independent components: yit = μr + δi + ϵit. The first component, μt = μt−1 + mt, represents time‐varying levels that are common to all groups. The second component, δi, represents random group offsets that are the same in all periods, and the third component represents independent measurement errors. In this paper we show how to obtain forecasts from this model and we discuss the nature of the forecasts, with particular emphasis on shrinkage. We also assess the forecast improvements that can be expected from such a model. Finally, we discuss an extension of the above model which also allows the group offsets to change over time. We assume that the offsets for different groups follow independent random walks.
Estimation and testing of time‐varying coefficient regression models in the presence of linear restrictions
Authors: Leybourne S. J. 
Published: July 2007

AbstractA linear regression model with random walk coefficients is extended to allow for linear restrictions between the coefficients to be satisfied at each point in time. Estimation in this model is shown to be no more involved than estimation in the standard model. It is also demonstrated how, after a slight modification to the testing problem, classical test procedures may be applied to the problem of testing for such restrictions. The performance of the Lagrange Multiplier test for a variety of different restrictions is then investigated via simulation. An empirical application involving testing for homogeneity in a random walk coefficient version of the AIDS model is given.
Interactions of real GNP business cycles in a three‐country time‐series model
Authors: Aoki Masanao 
Published: July 2007

AbstractThe paper describes a procedure for examining short‐run dynamic interactions among macroeconomic models by constructing aggregate state‐space submodels for dynamic modes corresponding with short‐run response patterns. Using the quarterly real GNP from the US, Germany, and Japan for 1974. III to 1991. I we examine dynamic interactions in the frequency ranges roughly comparable with a range of business cycle frequencies. We find that there is no (worldwide) shock common to the three countries even though the German and Japanese real GNP are affected by a common shock.
New methods for the analysis of long‐memory time‐series: Application to Spanish inflation
Authors: Delgado Miguel A. , Robinson Peter M. 
Published: July 2007

AbstractModels for long‐memorya time series are considered in which the autocovariance sequence is parameterized only at very long lags or the spectral density is parameterized only at very low frequencies. reently proposed methods for estimating the differencing parameters are reviewed and are applied to an economic time series of sprices of Spain.
Implementation and design of biosignal optical telemetry system based on enforced synchronization
Authors: Karita Nobuo , Kawahito Shoji , Ishida Makoto , Usui Shiro , Nakamura Tetsuro , Nishikado Masafumi , Nagaoka Shunji 
Published: July 2007

AbstractThis paper discusses the optical telemetry system for a life science experiment conducted in a space station, the feature of which is the telemetry of multichannel biosignals from a number of objects in the same booth.First, the enforced synchronization telemetry system is proposed. This system is based on two‐way communication which forms the key to the simultaneous biosignal telemetry from a number of objects. Based on the proposal, an experimental system is constructed. The external system sends a command signal to the object side and then receives and demodulates the telemetry signal from the object side. This system was implemented on a breadboard.The control unit for the multiplex telemetry system attached to the biological object is designed and constructed using dedicated BiCMOS. In this unit, approximately 400 elements are integrated into a 3.6 × 4.6 mm2 chip, realizing the function to telemeter four channel signals from up to four objects with the sampling frequency of 1 kHz.A series of operations was verified as satisfactory. Then include the reception of the optical command signal, selection of the object, multiplexing of a number of biosignals, and the transmission of telemetry signals. Using the experimental telemetry system based on the enforced synchronization, the operation of the parallel telemetry is verified as a principle for the two‐channel biosignals from two objects. The result is evaluated.
Defect‐ and fault‐tolerant static ram module designs based on parity checking and automatic testing
Authors: Tsuda Nobuo 
Published: July 2007

AbstractAdvanced redundancy configurations are presented for static RAM modules. These extend the word duplication and selection by horizontal parity checking (WDSH) and error correction by horizontal and vertical parity checking (ECHV) configurations to enhance yields of wafer‐scale integrated circuits. They use automatic spare block replacements for bit‐lines and word‐lines, word selection by access error checking, pair unit replacement, and two‐level hierarchical redundancy.A simulation using a 1.5‐μm, 128 k‐bit CMOS static RAM module suggests that defect‐ and fault‐tolerance capability is improved nine or 17 times over the basic redundancy configurations. These values are four or six times that achieved by conventional triple‐modular redundancy (TMR).
Enumeration of multiple‐valued kleenean functions and some related properties
Authors: Hata Yutaka , Yuhara Masaharu , Miyawaki Fujio , Yamato Kazuharu 
Published: July 2007

AbstractThe set of multiple‐valued Kleenean functions define a model of a Kleene algebra (a fuzzy algebra) suitable for treating ambiguity. This paper enumerates the Kleenean functions exactly, using the relation that the mapping from p‐valued Kleenean functions to monotonic ternary input p‐valued output functions is a bijection. Thus, the number pn of input vectors that should be searched is 3n for p‐valued n‐variable Kleenean functions. In this paper, we show how to obtain this number for 4‐ to 8‐valued Kleenean functions with 3 or fewer variables. We show that the number increases stepwise as the radix becomes larger and that the number of even (2m)‐valued Kleenean functions is uniquely determined by the number of odd (2m ‐ 1)‐valued Kleenean functions. These results show that the essence of Kleenean algebra is principally revealed by its odd‐valued functions. Moreover, the number of input variables increases exponentially as the variable becomes larger, and increases logarithmically as the radix becomes larger. Thus, increasing the number of variables has more of an effect on increasing this number than does incrementing the radix.
Realization of a self‐testing bus arbiter
Authors: Tokito Kazuo , Kurokawa Takakazu , Koga Yoshiaki 
Published: July 2007

AbstractThis paper discusses a realization of a self‐testing distributed arbiter for bus‐connected systems. One of the traditional schemes for arbitration is that each of the connected modules acknowledges when the arbitration is completed. However, there is a problem in that a dedicated software as well as a complex hardware are required, which increases the cost and affects the through‐put of the system.The method proposed in this paper assigns a certain code as the module number for verification of arbitration, and detects failure by a retrial using its complement. In other words, the method aims at secure arbitration using time‐space redundancy, i.e., redundancy in time and redundancy in code space, and at realization by as simple a circuit as possible, with the self‐testing function.It is verified from the results of simulation that all single stuck‐at faults can be detected for the case of 3 bits, under the assumption that all possible inputs are given before the next failure is produced. Even if not all of the inputs are given, there was no observed extraordinary operation where an incorrect module is selected. Thus, the self‐testing arbiter with a high speed and a simple hardware configuration can be realized.
A segmentation method based on region information and edge information
Authors: Jiang Hao , Suzuki Hidetomo , Toriwaki Jun‐Ichiro 
Published: July 2007

AbstractThis paper proposes a segmentation method based on region information and edge information. The method consists of three steps: (1) a connected component which is a part of an object is extracted as a seed by using a simple process such as a histogram analysis; (2) this seed is expanded repeatedly; and (3) to evaluate the possibility of the expansion, the uniformity of gray levels (region information) and checking the presence of border pixels (edge information) are used.Although the method can be considered as a kind of region expansion, the significant features are that it contains the growth of a seed and the edge information (a part of control information) to expand the region repeatedly. The former gives preliminary information on approximate gray levels of an object and extracts the object as a connected component, and the latter makes the edge information more useful. Although the usefulness of the edge information in a conventional region‐and‐edge integrated method such as the superslice algorithm depends greatly on its region segmentation, the use of such methods can be avoided in the proposed method, since both the region and edge information are used simultaneously for the control conditions of the region expansion. The method is justified experimentally by using synthetic images and actual images in two and three dimensions.
Automatic extraction of the representative 2‐D projected shape for polyhedral object from viewing vector map
Authors: Fujimoto Kozo , Kimoto Masato , Nakata Shuji 
Published: July 2007

AbstractTwo‐dimensional (2‐D) projected image (object appearance) pictured by a TV camera is changed by the construction of the visible surfaces or the surface occlusion according to the view direction. This paper proposes a new algorithm for extracting the representative 2‐D projected shape. In this method, a viewing area showing the same appearance is drawn and expressed on a viewing vector map that is the orthogonal coordinate graph expressed by the deflection angle (α, β) of a viewing vector in a polar coordinate system. A viewing vector map is divided into the viewing regions showing the same appearance by drawing the visible region of each surface and the boundary line showing the occlusion between surfaces.The representative 2‐D projected shapes for the 3‐D object are obtained by extracting the representative points in each divided region on a viewing vector map. The representative projected shape for a stable postrue of the 3‐D object is extracted easily by drawing the trace of the viewing point based on a stable posture of the object and the position of the TV camera on a viewing vector map. Furthermore, the approximate ratio of each viewing region showing the same appearance to the 3‐D view space can be calculated easily. This ratio shows the appearance probability.
Generation of Gn multisided patch surfaces
Authors: Kuriyama Shigeru 
Published: July 2007

AbstractThis paper proposes a method of generating multisided patches from a curve network that has arbitrary topology. The method generates N sweep surfaces from the curves surrounding ans N‐sided domain. A sweep surface is defined for each boundary of the domain by using a local parameter space that is composed of variables defined on generalized barycentric coordinates; N‐sided patches are generated by blending the sweep surfaces with interpolants that preserve geometric continuity on each boundary. The geometric continuity of the curves crossing the boundaries. Moreover, curves can be represented by arbitrary degrees and nodes.
Ray tracing using dynamic subtree—algorithm and speed evaluation
Authors: Naruse Tadashi , Shinya Mikio , Saito Takafumi 
Published: July 2007

AbstractFor fast ray tracing computation, it is essential to determine efficiently which object is projected on each pixel of the image plane. The data structure plays a major role in this process, and a hierarchical tree data structure of the objects often is used. This paper proposes a very fast algorithm based on use of a subtree of given hierarchical tree.Experimental results show that the number of intersection computations can be reduced greatly by the use of subtrees and that the computation cost for dynamic construction of a subtree is low. Analysis of the algorithm supports the experimental results. Experimental comparison with Arvo's algorithm [6], one of the fastest existing algorithms, shows that our algorithm is faster for primary rays.
An associate memory model based on hopfield neural network with redundant neurons
Authors: Nishiyama Kiyoshi , Goto Haruhide 
Published: July 2007

AbstractIn the associate memory model based on the Hopfield neural network, the memorized pattern must satisfy a certain kind of orthogonal condition. However, in general, it is very difficult to satisfy this condition, which has been a great drawback in the application of the associative memory model based on the Hopfield neural network.This paper aims at the remedy of the foregoing point in the associative memory model based on the Hopfield neural networks. Also, a new associative system is proposed based on the new memorized pattern which is generated by redundant neurons to satisfy the orthogonal condition. The proposed method is similar to the traditional method in that the Hopfield neural network is employed. However, it has the following differences: (i) new memorized patterns satisfying the orthogonal condition are generated using redundant neurons; and (ii) the initial state and the timeevolution rule for the redundant neuron are introduced based on the a priori information.Using computer simulation, the case of 3, 4 and 5 memorized patterns are examined and compared, and it is shown that the recall ability is improved greatly in the proposed system, compared to the traditional systems.
A model of selective attention to disambiguate ambiguous figures
Authors: Kawabata Nobuo 
Published: July 2007

AbstractAmbiguous figures are visual stimuli which are interpreted multiply by the human visual system.This paper proposes a model which disambiguates ambiguous figures. The model that was formulated was based on the characteristics of visual information processing, accompanied by selective attention.In the ambiguous figure “my husband and my father‐in‐law,” it was necessary to simulate visual information processing so that attention was directed to the multiple features in the figure to disambiguate the ambiguous figure.Pictures obtained from the model were examined as to whether or not they were interpreted unambiguously. Results show that the model simulating selective attention can disambiguate the ambiguous figures. This suggests that the image per se, viewed through selective attention, becomes unambiguous before the figure is interpreted at the higher level. The results show also that the computer simulation of selective attention would make it possible to examine factors affecting the initial interpretation of the figure.
Rs‐vector algorithms for combinational problems
Authors: Iwamoto Chuzo , Iwama Kazuo 
Published: July 2007

AbstractThe RS‐vector machine (RS‐VM) is based on the vector operations called repeat and stretch. It is known that generally they speed up according to a single parameter called the expansion factor, several sequential complexity classes over polynomial space to polynomial time.This paper investigates the computational power of the model for more concrete problems. The RS‐vector algorithms are given which can solve typical NP‐complete problems, i.e., satisfiability, knapsack, partition, vertex cover, clique and exact cover problems in O(n) time, k‐colorable problem in O(n log k) time, and Hamilton circuit and traveling salesperson problems in O(n log2 n) time.It should be emphasized that, compared with other models such as PRAMs, vector machines are completely of SIMD‐type and their communication facilities are nothing less than those represented by repeat and stretch. The results show that such a restricted model can solve a wide range of NP‐problems in almost linear time.
A context‐free grammar‐driven, one‐pass HMM‐based continuous speech recognition method
Authors: Nakagawa Seiichi , Kai Atsuhiko 
Published: July 2007

AbstractThis paper describes a frame synchronous continuous speech recognition algorithm using a context‐free grammar and its evaluation. A frame‐synchronous parsing algorithm for context‐free grammar based on the top‐down strategy is used for the prediction of successive words. The parsing process is incorporated into the one‐pass search algorithm with the dynamical expansion of a finite‐state automaton. Of course, since the number of the states becomes large, the beam search method should be used in the prediction and in pruning unreliable candidate branches from the search space. By using the proposed algorithm, a sentence recognition rate of 90 percent in a speaker adaptation mode is obtained while the conventional system based on word spotting and lattice parsing algorithm obtained 80.7 percent for the task of perplexity 10.
Fast morphology hardware using large‐sized structuring element
Authors: Kojima Shoji , Ebisawa Yoshinobu , Miyakawa Tatsuo 
Published: July 2007

AbstractMathematical morphology is one of the data processing methods that is extremely useful for image processing and has many applications, such as, noise elimination, shape description, texture analysis, and so on. The mathematical base of morphological processing is dilation and erosion which are described by set analysis and can be expressed in logical AND, OR notation.Localized parallel processing including morphological processing is not suitable to Neumann architecture because of the memory access bottleneck which makes it hard to achieve the high throughout data processing required in applications such as video image processing. Also the cytocomputer aimed at fast image processing has a drawback in that it can handle only very small structuring elements.In this paper, first, an algorithm is presented which accelerates morphological image processing. Next, the algorithm to design a specialized hardware which processes the real‐time video image is implemented and finally, an application of this specialized hardware for medical use is described.
Handprinted numerals recognition by learning distance function
Authors: Kawatani Takahiko 
Published: July 2007

AbstractIn designing more accurate character recognition, revealing the differences with other categories in distance function is important. In this paper, I propose Learning by Discriminant Analysis (LDA) as a method to learn distance functions. With a weighted Euclidean distance and a quadratic discriminant function as the original distance functions, LDA learns parameters by superposing the decision function for searching on the pattern set of the noticed category. The results for handwritten numeral recognition rate improved dramatically and its effectiveness was verified. In addition, when the values of the parameters after learning are changed and applied in a weighted Euclidean distance so that the misread patterns before learning are efficiently segmented and strong correlations exist between features, appropriate category boundaries are obtained. When applied to the quadratic discriminant function, the effect of the offset from the normal distribution of features is reduced.
Automated extraction of lung cancer lesions from multislice chest CT images by using three‐dimensional image processing
Authors: Hasegawa Jun‐Ichi , Mori Kensaku , Toriwaki Jun‐Ichiro , Anno Hirofumi , Katada Kazuhiro 
Published: July 2007

AbstractThis paper discusses the test for the automatic extraction of lung cancer candidate areas from the high‐resolution continuous chest CT image taken with the slice interval of 1 mm, by a three‐dimensional image processing technique. The detection of local suspicious regions (SR) is considered. A procedure is developed which discriminates the lung area from other images (mostly vessels) based on the differences of three‐dimensional shapes. The actual procedure in the processing is composed largely of two steps: (1) segmentation of lung area; and (2) SR extraction.In this study, the processing is realized by a relatively simple procedure, combining such basic processes as thresholding, fusion of three‐dimensional figures (or three‐dimensional distance transformation) and the three‐dimensional skeletonization. The usefulness of the method is demonstrated using an actual case of lung cancer. The study is significant as the first test that demonstrated the usefulness of the three‐dimensional image processing, using the three‐dimensional CT image of a practically sufficient accuracy.
A dictionary retrieval algorithm using two trie structures
Authors: Morimoto Katsushi , Iriguchi Hirokazu , Aoe Jun‐Ichi 
Published: July 2007

AbstractThe trie has the feature that the retrieval can be executed with the character symbols composing the key as the unit, and a high‐speed retrieval is realized independently of the total number of keys. Consequently, it used frequently in the search of the natural language dictionary and in other problems. A problem, however, is that the number of trie states increases with the enlargement of the key set, which necessitates a larger memory capacity. To remedy this point, DAWG (Directed Acyclic Word‐Graph) is proposed, where the common suffix of the tries is compressed.Then, a new problem arises in that the record information cannot be determined uniquely for the key. For this problem, this paper introduces a new structure, where the number of states is reduced by merging the common suffixes of the tries, while determining uniquely the record information for the key. The algorithm for retrieval, insertion and deletion of the key is proposed for the structure. In the proposed method, the set of keys is represented using two tries. One of the tries memorizes the prefix of the minimum length that can discriminate uniquely between the key from other keys. The other trie stores the suffixes of the remaining keys in order to merge the common suffix. A simulation is executed for various sets of keys such as Chinese character called Kanji, alphabets and Japanese Katakana characters, and it is seen that the number of states is reduced by approximately 30 to 65 percent for the key set of 50,000 words, compared to the ordinary trie.