bluuebunny/crossref_metadata_2025_split huggingface dataset:
Causal forces: Structuring knowledge for time‐series extrapolation
Authors: Scott Armstrong J. , Collopy Fred 
Published: July 2007

AbstractThis paper examines a strategy for structuring one type of domain knowledge for use in extrapolation. It does so by representing information about causality and using this domain knowledge to select and combine forecasts. We use five categories to express causal impacts upon trends: growth, decay, supporting, opposing, and regressing. An identification of causal forces aided in the determination of weights for combining extrapolation forecasts. These weights improved average ex ante forecast accuracy when tested on 104 annual economic and demographic time series. Gains in accuracy were greatest when (1) the causal forces were clearly specified and (2) stronger causal effects were expected, as in longer‐range forecasts. One rule suggested by this analysis was: ‘Do not extrapolate trends if they are contrary to causal forces.’ We tested this rule by comparing forecasts from a method that implicitly assumes supporting trends (Holt's exponential smoothing) with forecasts from the random walk. Use of the rule improved accuracy for 20 series where the trends were contrary; the MdAPE (Median Absolute Percentage Error) was 18% less for the random walk on 20 one‐year ahead forecasts and 40% less for 20 six‐year‐ahead forecasts. We then applied the rule to four other data sets. Here, the MdAPE for the random walk forecasts was 17% less than Holt's error for 943 short‐range forecasts and 43% less for 723 long‐range forecasts. Our study suggests that the causal assumptions implicit in traditional extrapolation methods are inappropriate for many applications.
Forecasting cyclical turning points with an index of leading indicators: A probabilistic approach
Authors: Nazmi Nader 
Published: July 2007

AbstractIn this paper the econometrics of latent variables in conjunction with leading economic indicators are used to predict turning points of the US industrial production variable for various forecasting horizons. The results reported here show that leading indicators used in regression models with a dichotomous dependent variable that marks periods of economic expansion and contraction forecast business cycle turning points accurately. Leading indicators produce the most reliable forecasts of turning points five months prior to cyclical changes and do not give any false signals. Moreover, the weights assigned to leading indicators for producing the index vary as the forecast horizon changes.
Forecasts of inflation from var models
Authors: Webb Roy H. 
Published: July 2007

AbstractWhy are forecasts of inflation from VAR models so much worse than their forecasts of real variables? This paper documents that relatively poor performance, and finds that the price equation of a VAR model fitted to US post‐war data is poorly specified. Statistical work by other authors has found that coefficients in such price equations may not be constant. Based on specific monetary actions, two changes in monetary policy regimes are proposed. Accounting for those two shifts yields significantly more accurate forecasts and lessens the evidence of misspecification.
The Spectrum of D = 11 Supergravity via Harmonic Expansions on S4 X S7
Authors: Sezgin E. 
Published: July 2007

AbstractWe derive the complete particle spectrum of the d = 11 supergravity compactified on AdS X S7, by analytically continuing AdS to S4, and using the Salam‐Strathdee method of harmonic expansion on S4 X S7. The spectrum is arranged into supermultiplets labelled by an integer l = 0, 1, 2,. The massless supermultiplet corresponds to l = 0. For the l'th supermultiplet we find a relation, involving the eigenvalues of the second order Casimir operators of SO(3, 2) and SO(8), given by 2C2[SO(3, 2)] + C2[SO(8)] = 3/2(l + 2) (l + 4).
Effective Gauge Theories of Composite W, Z and Massless Fermions
Authors: Craigie N. S. , Stern J. 
Published: July 2007

AbstractWe have attempted to identify the circumstances under which a weakly coupled massive gauge theory such as the standard Glashow‐Salam‐Weinberg model, can emerge as a low energy effective Lagrangian of an ASF preon gauge theory. This involves many issues including the interplay between global and local symmetries and sum rules connecting long and short distance physics. The article puts together these issues and demonstrates that ASF preon models can be very tight and predictive frameworks. We make a systematic search of a minimal extension of the standard electro‐weak theory, which could emerge as a low energy effective Lagrangian of an ASF preon gauge theory, in which the left‐right symmetry is spontaneously broken by vacuum condensation.
The Ampere‐Neumann Electrodynamics of Metallic Conductors
Authors: Graneau Peter 
Published: July 2007

AbstractThis is a review of the old electrodynamics which prevailed during the first half of the 165‐year history of electromagnetism. Amperes principal achievement was the deduction of his empirical force law from experiments with several current balances. Faraday then discovered electro‐magnetic induction. This prompted F. E. Neumann to work out a quantitative explanation of induction based on Amperes force law. It involved the concept of the electrodynamic potential which, as we know now, is the same entity as magnetic energy. With the newtonian principle of virtual work, Neumann found his potential yielded the correct mechanical forces on metallic current circuits. Neumanns theory contains a physical quantity which today is called the magnetic vector potential and treated as a mathematical contrivance.Neumanns mutual inductance formula has become a powerful tool of inductance calculations. Maxwell made a major contribution to the Ampere‐Neumann electrodynamics by developing the mean‐geometric‐distance method for calculating the inductance of conductors of finite cross‐sections. This became particularly useful after Sommerfeld solved Neumanns double integral for parallel, straight wires. Maxwell built all of Neumanns mathematical theory into his field equations but the lingo changed. Electrodynamic potential became kinetic energy of the field; conductor element interactions became flux linkage; and so on. Maxwells equations do not contain a magnetic force law. He believed both Amperes law and the law currently in use, which was first suggested by Grassmann in 1845, were compatible with field theory. Lorentz later found that the motion of charges in vacuum obeyed only Grassmanns law and not Amperes. From then onward the old electrodynamics fell into disuse and field theory has reigned supremely ever since.Recent developments have shown the conflict between Amperes and Grassmanns law to be related to the nature, of the electric current. Conduction currents in metals obey Amperes law and convection currents in vacuum obey Grassmanns law. Both laws agree on the reaction forces between closed metallic circuits, because the relativistic contribution from the Grassmann law then integrates to zero. This fact appears to have mislead Lorentz in believing that the drifting electron in vacuum is magnetically equivalent to the current element of metals.An examination of the long debate concerning the validity of Newtons third law of motion in electromagnetism proves the Ampere‐Neumann electro‐dynamics to be valid for metallic circuits while the theory of special relativity and field momentum conservation are required for convecting charges in vacuum. This conclusion is strongly supported by experimental evidence. It demands a change in the concept of the metallic current element.
Terrain adaptive human walking animation
Authors: Tsutsuguchi Ken , Sakaino Hidetomo , Watanabe Yasuhiko 
Published: July 2007

AbstractThis paper describes a method for automatically generating human walking sequences that match the path set to the given terrain. The Environment Adaptive Human Walking Animation (EAW) module using this method offers to users an interface that can unite human walking motion with the environment in virtual worlds. The EAW module has a 4‐layer structure comprising the GUI level, the control level, the motion generation level and the rendering level. The EAW module realizes the adaptation to the 3D terrain by using “area divisions” and “step divisions” for the walking path in the control level, and generates the walking motion sequences by using the “E‐KLAW” method that uses dynamics and kinematics in the motion generation level. By using this module, the user's tasks are made significantly simpler and the user can incorporate human motion into various scenes.
Backpropagation learning algorithm with different learning coefficients for each layer
Authors: Takechi Hirochika , Murakami Kenji , Izumida Masanori 
Published: July 2007

AbstractWhen considering the algorithm of error backpropagation learning, it is seen that the learning of each layer is not completed independently. This paper proposes a DLBP learning algorithm which uses different learning coefficients for each layer. By changing the ratio of the learning coefficients, the following can be controlled:
the learning progress of the hidden units;
the influence of the hidden units on the network. With DLBP learning, we can construct the corresponding networks to the different requirement such as;
to obtain a network with small number of hidden units; and
to obtain a fault tolerant network.
Limits of pictorial pattern discrimination caused by noise originating in image pickup process and the deduced optimum resolution
Authors: Yoneyama Tsuneo 
Published: July 2007

AbstractIn an image processing system, the resolution of the input unit serves as an important design parameter in prescribing the processing speed and the scale of the entire system. However, no method to date has been established to derive the specification logically. This paper describes a method for calculating the best resolution in an objective manner by observing the relationship between the resolution and the discrimination limit of figures resulting from the fluctuation of images that are generated in light detection. It is found that the sensitivity in observation at the best resolution coincides with the features of the visual system.
Status and issues of HPF compilers
Authors: Nakatani Toshio 
Published: July 2007

AbstractHigh Performance Fortran (HPF) is an emerging, de facto standard language for machine‐independent, data‐parallel programs that run on various parallel machines. The ease with which parallel programs can be created by means of simple data placement annotations to Fortran 90 programs is particularly attractive to end‐users. The success of the HPF approach, however, depends on the innovation in compiler technology. In order to achieve a reasonable speedup on the target parallel machine, the HPF compiler must be able to parallelize loops, optimize communications, localize arrays, and generate efficient, scalable single‐program multiple‐data (SPMD) code. We have implemented HPF on the basis of the IBM XL Fortran 90 compiler. This task will present an overview of our compilation strategy and preliminary results obtained on an IBM Scalable POWERparallel System.
Identification of objects of complex shape by using stochastic local fractal variables–categorizing dust particles on lsi wafer surface
Authors: Kamijo Masayoshi , Aihara Shin‐Ichi , Nakazawa Masaru 
Published: July 2007

AbstractWhen a natural object or phenomenon is modelled mathematically by using a fractal dimension, it is recognized that the object or phenomenon does not often have an autocorrelation. In the fractal theory, a fractal dimension is defined as a determined value (dimension) which is independent of the scale of its covering. In practice, however, the dimension often fluctuates depending on samples used (even with the same object or phenomenon) and its scale.In published works of image analyses using fractal dimensions, it has been assumed that fractal dimensions are determined and independent of scales, ignoring the practical experience. To treat a natural object or phenomenon without contradictions, this paper introduces “stochastic local fractal variables.” Using these new variables, mathematical models of dust on LSI wafers are constructed, and they are identified by using the likelihood method. Usefulness of the proposed method has successfully been confirmed with real data.
Face recognition using neural networks with multiple combinations of categories
Authors: Yahagi Takashi , Takano Hiroaki 
Published: July 2007

AbstractNeural networks trained via backpropagation are now widely applied in a pattern recognition method. However, since it becomes much more difficult for a network to accomplish its task when the number of categories increases, research on multiple network combination is active. Novel learning and recognition processes are proposed here. It is shown that by combining small‐scale neural networks, the proposed method allows exploitation of the potential capabilities of the networks. In the learning process, multiple networks are trained with patterns organized in overlapping groups. During the recognition process, response is obtained by making the networks compete with each other. In experiments involving recognition of individuals from various facial images and different expressions, a recognition rate of higher than 96 percent was obtained for 20 individuals and 131 images. Furthermore, results of simulations in which noise was added confirmed that the proposed method is robust with respect to pattern changes.
An analysis of carp cerebellar eeg under the microgravitational environment
Authors: Usui Shiro , Hirata Yutaka , Hagiwara Katsuyuki , Toda Naohiro , Akagi Ichiro 
Published: July 2007

AbstractTo confirm the plausibility of the sensory conflict hypothesis for space motion sickness, a space experiment was carried out in 1992 as NASA's Spacelab‐J mission. In the experiment, the dorsal light tilt reaction (DLTR) of carp was observed and the corresponding cerebellar EEG was recorded. The purpose of this study is to evaluate the effects of change in gravitational environment on the EEG by means of spectrum analysis. In order to make a reliable conclusion, a procedure was established which consists of preprocessing, spectrum estimation and evaluation of the spectrum based on statistics. By applying this procedure, both the effects due to change in gravitational environment and the adaptation of the carp to the weightlessness environment in terms of differences in EEG spectrum are revealed. This result supports the sensory conflict hypothesis for space motion sickness.
Proof method for correctness of refinements of algebraic specification in abstract sequential machine style
Authors: Okano Kozo , Higashino Teruo , Taniguchi Kenichi 
Published: July 2007

AbstractIn this paper, new methods for providing the correctness of refinement among abstract sequential machine style programs are described. The programs are described in algebraic language ASL using some useful notions, i.e., the extended projection and the valid reachability condition for each transition function. These notions allow a designer to refine a given text (program or specification) to a concrete text more freely than the text that does not use such notions. These notions can also enhance the expressive power of the text.On the other hand, these advantages would have lost half their values, if useful methods to prove the correctness of refinement among the texts using them are not found. Thus new methods for proving the correctness of the texts are proposed, and they do not require much proof loads.First the correctness of refinement among the ASL texts with the extended projection is defined. Second, a method is proposed for proving the correctness of refinement among such texts. Also proposed is a definition of the correctness of refinement among the texts with the valid reachability conditions and a method to prove their correctness. These methods do not require more proof loads than the usual methods for the texts that do not use such notions in the abstract sequential machine style. Therefore, these methods are useful.
Capacity of autocorrelation associative memory with quantized synaptic weight
Authors: Mimura Kazushi , Okada Masato , Kurata Koji 
Published: July 2007

AbstractThe neural chips to speed up the process of a neural network have recently been developed actively. Since a conventional neural chip requires quantized synaptic weights, it is important to know the properties of the network with such weights. Devices for a 2‐layer network with the same number of input and output elements have been well developed, and such a device can be used as an autocorrelation associative memory by feeding its output to its input.This paper investigates theoretically the capacity of an autocorrelation associative memory when its synaptic weights are quantized with a finite number of bits. It also proposes an optimum quantization function. A system with a finite number of elements is computer simulated. The proposed method can be applied to the design of a neural chip for associative memory.
Completion of term‐rewriting systems with multiple reduction orderings
Authors: Kondo Hisashi , Kurihara Masahito , Ohuchi Azuma 
Published: July 2007

AbstractThe Knuth‐Bendix completion procedure results in one of the following, when the reduction ordering and the set of equations are given: (1) the procedure succeeds by generating a complete term‐rewriting system; (2) the procedure fails by not giving the orientation to an equation by the reduction ordering; and (3) the procedure diverges without being terminated. The success or failure of the completion procedure depends greatly on the reduction ordering.This paper proposes a completion procedure with multiple reduction orderings to reduce the burden of the user in determining the reduction ordering and to prevent the procedure from diverging due to the inadequate reduction ordering. To improve the efficiency, the data called node are used, based on the data structure of ATMS, which is an architecture proposed in the artificial intelligence. The parallel execution of the ordinary completion procedure is simulated under each reduction ordering.The property of ATMS to handle the multiple context is utilized, and the duplication of the inference is avoided by sharing the result of inference among the reduction orderings.
Boldfacedness of an image and the applicability of a spread spectrum image encryption scheme
Authors: Tachibana Hiroaki , Oshita Shinjiro , Maeda Junya , Mutsuura Kouichi 
Published: July 2007

AbstractWe study the applicability and evaluate the decryption fidelity of a spread spectrum image encryption method, for which decryption is accomplished with easy operations, and which makes possible the protection of secrecy even in hardcopy form. Decryption in the spread spectrum encryption method is based on the recognition of the dark‐pixel region in the picture's background noise. To evaluate the applicability of this image encryption method, we employ measure Bn, called the boldfacedness, which estimates the boldness of the original image. This is essentially the area of the dark‐pixel region normalized by the length of the path surrounding it. We relate the intuitive visibility of several kinds of images to the boldfacedness, and confirm its validity. To estimate its applicability, we composed a questionnaire concerning the recognition of simple rectangular images in background noise. The results showed that for these simple rectangular images a Bn value down to about 0.023 is adequate. Next, since we often want to transmit images of documents in facsimile, we evaluated the fidelity of document images based on the size and type of several kinds of characters. To perform this evaluation we took as input Group 3 facsimile, with the resolution of all document images as a consistent 200 dpi. It became clear that, for document images, the letter‐recognition threshold value of Bn is in the neighborhood of 0.015. This is equivalent to the case both for 16‐point Mincho‐tai characters and for 10‐point standard characters, verifying the applicability of this encryption method for general document usage.
WSI oriented design for highly reliable systems based on the residue number system
Authors: Tomabechi Nobuhiro 
Published: July 2007

AbstractIn WSI, a single noise could disrupt the system. However, neither dual system nor triple system can be used as a countermeasure because WSI benefits from the use of a single wafer system. This paper presents a design procedure for noise‐tolerant systems in which multiple clock pulses and the features of the residue number system are effectively combined. The design sequence is as follows: (1) The system is designed based on the redundant residue number system. (2) The circuits corresponding to the digits of the residue number system are driven by the clock pulses, each of which has a different phase. (3) A circuit is applied which corrects the noise‐induced error through calculation of the remaining correct digits. The reliability of a nonrecursive digital filter is clearly improved by applying the given method. The reliability is, however, reduced by pipelining and the hardware upgrade needed for redundancy is limited to 31%. By applying the given method, coincident noise‐induced faults throughout the system are avoided and the redundant hardware is reduced. We have found the method suitable for noise‐tolerant systems design of WSI.
Communication computation model for modeling dynamic human communication
Authors: Hiji Masahiro , Miyazaki Masatoshi , Nunokawa Hiroshi 
Published: July 2007

AbstractA communication computation model for modeling human communication is proposed. In this computation model, an individual communicator is represented by an Autonomous Object and a group communicator is represented by a Group Field. The mode of communication is represented by the communicative functions appropriate to each mode.A method is described for modeling the dynamic character of communication while changing among these various communication types. The dynamic character of communication is described as the selection of the communicative function corresponding to the mode of communication as well as the resultant information exchanges. A communication process is described as a combination of these communicative functions.
Program slicing using a path dependence flow graph
Authors: Naoi Kuniaki , Takahashi Naohisa 
Published: July 2007

AbstractA method that formally represents various program slices with a unified framework is presented; it uses a previously proposed directed graph called a path dependence flow graph (PDFG). Program slicing is a technique of extracting a set of statements (called slices) with certain desired features from an imperative program. The method proposed here has the following properties. (1) Since slices are represented by operations on dependence relationships defined on a PDFG, properties of slices such as an inclusion relationship among slices can be discussed independently of slicing procedures. (2) Since various slices are represented with the same framework, appropriate slices can be selected for specific purposes using one representation. (3) Since slices are generalized using orthogonal primitive attributes, slices can be represented comprehensively; this includes the ones for which there have been no known construction methods. It is also proven herein that major known slices and the slices represented by this method are identical as a set of statements, thereby demonstrating the appropriateness of this proposed method.