bluuebunny/crossref_metadata_2025_split huggingface dataset:
Early experience affects the traits of monogamy in a sexually dimorphic manner
Authors: Bales Karen L. , Lewis‐Reese Antoniah D. , Pfeifer Lisa A. , Kramer Kristin M. , Carter C. Sue 
Published: April 2007

AbstractThe goal of this study was to examine the effects of early life experiences on the subsequent expression of traits characteristic of social monogamy in prairie voles (Microtus ochrogaster). During cage changes parents and their offspring were either transferred between cages in a cup (zero manipulation, MAN0) or with a gloved hand (one manipulation, MAN1). Following weaning the offspring were tested for alloparental behavior. In adulthood they were tested for the capacity to form partner preferences, behavior in an elevated plus‐maze (EPM), and corticosterone levels. MAN0 males (but not females) showed lower levels of alloparental behavior than MAN1 males. MAN0 females (but not males) were less likely to form pair bonds than MAN1 females. MAN0 animals of both sexes were less exploratory in the EPM than MAN1 counterparts. These experiments support the hypothesis that behaviors used to characterize monogamy are vulnerable in a sex‐specific manner to early experience. © 2007 Wiley Periodicals, Inc. Dev Psychobiol 49: 335–342. 2007.
Gilbert Gottlieb (1929–2006)
Authors: Bateson Patrick , Logan Cheryl 
Published: April 2007

AbstractGilbert Gottlieb, a pioneer in developmental psychobiology, died on July 13, 2006. We pay tribute to the man, to his career, and to his dedication to developmental science. © 2007 Wiley Periodicals, Inc. Dev Psychobiol 49: 446–449, 2007.
Adult and peer influences on starling song development
Authors: Bertin Aline , Hausberger Martine , Henry Laurence , Richard‐Yris Marie‐Annick 
Published: April 2007

AbstractAdult influence on song development was rarely investigated in complex social settings. We investigated the influence of the young/adult ratio on song learning in European starlings. Starling songs are composed of two categories: whistles and warbling. Warbling includes three parts: complex variable motifs, click motifs, and high frequency motifs. Song learning by young birds raised in group (G birds), in group with adults (GT birds) or in pair with one adult (IT birds) were compared. Song tutor choice, song sharing, and song quality varied with social context. The mere presence of adults in a group was not sufficient for young to develop all adult song features. Only IT birds chose adults as tutors. Social contact with only one adult enhanced acquisition of whistles, click motifs, individuality, and reduced the number of high frequency motifs (adult song features). This study suggests that the adult influence is proportional to young/adult ratio. © 2007 Wiley Periodicals, Inc. Dev Psychobiol 49: 362–374, 2007.
Replica distribution of data associated with location on wireless ad hoc networks
Authors: Tsuchida Gen , Okino Tomoyuki , Tamori Masahiro , Watanabe Takashi , Mizuno Tadanori , Ishihara Susumu 
Published: April 2007

AbstractIn mobile ad hoc networks, due to the change of topology caused by the movement of hosts and the change of radio link status, it is difficult for mobile hosts to retain accessibility to data on other hosts. To solve such a problem, replica distribution methods which distribute replicas of data items to other mobile hosts and maintain them have been proposed. In this paper, we propose and evaluate a method to enhance the accessibility to data items that are associated with locations and requested by Geocast from hosts. This method is based on flooding of replicas of data items, and it uses the locations of mobile hosts and the associated locations of data items for controlling the range of the replications and the redundancy of the replicas. Furthermore, to keep the accessibility to such data high, replicas are dynamically relocated after the movement of hosts. We confirmed the effectiveness of the proposed method by detailed simulations including multiple data request models. Simulation results showed that the proposed method achieves high accessibility to location‐dependent data especially when the storage size is small. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 90(10): 67– 80, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.20320
A decoding method for Tornado‐type codes utilizing error packets
Authors: Yamato Ryohei , Umehara Daisuke , Morihiro Yoshiteru , Noguchi Taku , Kawai Makoto 
Published: April 2007

AbstractSatellite communications is suitable for multicast communications which can achieve one‐to‐many delivery because it can broadcast to multiple receiving stations over a wide area. However, packet retransmission is inefficient for satellite communications because of its large delay and bit error rate. In order to avoid packet retransmission, FEC (forward error correction) exploiting error correcting codes have been put to practical use in satellite multicasting. Tornado‐type codes are well known as a kind of error correcting codes suitable for multicasting. Tornado‐type codes are encoded and decoded in packets. As a result, they are effective for combatting packet losses by buffer overflow or congestion control. Furthermore, their coding and decoding have low time complexity. On the other hand, the bit errors in the packet are processed as a packet loss in decoding because the Tornado‐type codes are decoded packet‐wise. In this paper, we propose an effective decoding method for bit errors in the packets for Tornado‐type codes. We show by computer simulation that the proposed method is effective in bit error environments. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 90(10): 57– 66, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.20361
A routing protocol for mobile terminals in an ad hoc network with established network
Authors: Yoshida Masashi , Miki Tetsuya 
Published: April 2007

AbstractThe expansion of a communication area and the provision of services to wide districts can be expected if ad hoc networks are connected to established networks. In this environment, two types of routes exist between mobile stations that compose ad hoc networks: routes using wireless links only and routes via base station and the established networks. However, most routing protocols decide a route simply by the minimum hop counts between mobile stations without taking the differences of communication performance between the established network and ad hoc networks into account. This paper presents a new routing protocol that uses simple formulas to decide which route is effective, a route using wireless links only, or a route via the established networks. The formulas are derived from the results of simulation on the communication performance of some routes that uses IEEE802.11b as wireless links and Ethernet of 100 Mb/s as wired links. The performance of our proposed routing protocol, which is realized as an extension of ad hoc on‐demand distance vector (AODV), is evaluated by simulation. The results show that the proposed routing protocol is effective especially under a high data rate situation compared with AODV. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 90(10): 47– 56, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.20363
Proposed high‐efficiency packet forwarding method under multihome environment
Authors: Shiota Hiroshi , Otaka Akihiro , Nakashima Takashi , Okumura Yasuyuki 
Published: April 2007

AbstractIn the past few years, communication among clients, such as IP video telephony and file sharing, that is peer‐to‐peer (P2P) communication, has increased. P2P communication is often considered to be communication over relatively short geographic distances as in local communication. However, in P2P communication, the communication partner is not limited to belonging to the same Internet Service Provider (ISP) as oneself and communication may be routed over long paths known as routing through an Internet exchange (IX) even when geographically close. However, the problem becomes inefficient transmission. To solve this problem, we herein propose a multinetwork access method using multiple networks, implement efficient packet forwarding, and study the reduction in IX or ISP network traffic when this method is applied to an access network. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 90(10): 36– 46, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.20368
New weighting method to synthesize a zero sidelobe correlation filter for burst signals
Authors: Shinonaga Mitsuyoshi , Suzuki Junichiro , Yajima Shinichi , Nishimoto Shinkichi 
Published: April 2007

AbstractThe detection of received radar signals uses Doppler filtering as the correlation process on the received echoes for many transmitted pulses in addition to the pulse compression process which is the correlation process in the range direction. Normal radar echoes become blips widened in the azimuth direction, but the Doppler filtering process is not the optimum process from the perspective of improving the signal‐to‐noise ratio. Furthermore, compression of the spread in the azimuth direction of the signal is demanded in order to detect the azimuth. In this paper, we show that the azimuth beam width compression process can be implemented by filtering which satisfies the maximum SNR based on the zero sidelobe constraint condition applied to pulse compression. In addition, we theoretically explain the weighting matrix derived by this design method and use simulations to compare with the pulse compression process of the characteristics of a zero sidelobe correlation function. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 90(10): 25– 35, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.20373
Transmission performance of WDM/OFDM hybrid systems over optical fibers
Authors: Tanaka Kenichiro , Norimatsu Seiji 
Published: April 2007

AbstractOrthogonal frequency division multiplexing (OFDM) can achieve high utilization efficiency. In this paper, the authors combine OFDM with wavelength division multiplexing (WDM) to investigate the optical fiber transmission characteristics of a WDM/OFDM hybrid system that can easily achieve high utilization efficiency even when the number of channels is high. They used intensity modulation (IM), differential binary phase‐shift keying (DBPSK), and differential quadrature phase‐shift keying (DQPSK) as modulation methods to show transmission characteristics related to multi‐repeater and nonrepeater systems. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 90(10): 14– 24, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.20387
Modified calibration method for MUSIC method with an array antenna
Authors: Hirota Akimichi , Miyamoto Takehiro , Nakano Masayuki , Arai Hiroyuki 
Published: April 2007

AbstractIn this paper, we propose a modified calibration method to improve the accuracy of direction of arrival (DOA) estimation, and conduct simulations and experiments to verify the effectiveness of the proposed method. In a system for DOA estimation, because the accuracy of the DOA estimation is degraded by the mutual coupling among the antenna elements, these elements must be calibrated. Therefore, we propose a modified calibration method to implement these improvements while considering the mutual coupling among the elements and the manufacturing errors. We verify the effectiveness of the proposed method by simulations and improve the accuracy by about twofold compared to the conventional method in experiments. In addition, the estimation accuracy is degraded by changes in the directions of the angle of elevation and the angle of dip in the conventional method, but we demonstrate the ability to suppress degradation by applying the proposed method. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 90(10): 1– 13, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.20398
A real‐valued periodic orthogonal sequence derived from a real‐valued shift‐orthogonal finite‐length sequence and its fast periodic correlation algorithm
Authors: Matsumoto Takahiro , Tanada Yoshihiro 
Published: April 2007

AbstractThis paper proposes a real‐valued orthogonal periodic sequence of a periodN=2νderived from a real‐valued shift‐orthogonal finite‐length sequence of lengthM=2ν+1. This paper also explains the principle of a fast correlation algorithm that efficiently executes periodic correlation processing for this real‐valued orthogonal periodic sequence. The sidelobe of an aperiodic autocorrelation function for a real‐valued shift‐orthogonal finite‐length sequence (length ofM) is 0 except for the right and left ends of the shift. If the subsequent sequence of first values repeatedly overlap the final values of this sequence, a real‐valued orthogonal periodic sequence of a periodN=M−1 can be obtained. A real‐valued orthogonal periodic sequence of a periodN=2νgenerated from real‐valued shift‐orthogonal finite‐length sequence of lengthM=2ν+1 is obtained by convoluting partial sequences and based on that controls the number of multiplications and the number of additions to increment on the order ofNlog2Nwithout using fast Fourier transformation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 18–28, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20294
A proposal and evaluation of a coordinated checkpointing technique using incremental snapshots
Authors: Ohara Mamoru , Arai Masayuki , Fukumoto Satoshi , Iwasaki Kazuhiko 
Published: April 2007

AbstractCoordinated checkpointing techniques ensure that a consistent global state is maintained by means of coordination between processes. The approach requires that application messages temporarily cease to be exchanged but the rollback procedure when recovering from a fault is consequently simplified and the recovery costs are small. With current reductions in communications costs, the importance of coordinated techniques may be seen to be growing. However, in large‐scale systems there is a possibility that performance will be seriously impaired due to the frequent halting of the exchange of messages. In this paper we propose a method whereby coordination is performed at only a subset of the checkpoint generation points that are periodically visited while at the remaining points each process independently generates an incremental snapshot. This method aims to both alleviate the performance degradation incurred from coordination and to realize relatively high‐speed recovery. In evaluating the effectiveness of this method we estimate the checkpointing overheads and recovery costs using a probabilistic model and simulations and compare it with existing coordination methods. The results show that the proposed method is more effective than existing coordination methods from the perspective of both performance and reliability in environments with a relatively low frequency of messages. In addition, we perform comparisons of two different delta schemes for representing the incremental snapshots and discuss which environments they are each respectively suited to. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 39– 53, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20296
How to derive a quantum complexity lower bound
Authors: Nishino Tetsuro 
Published: April 2007

AbstractThe modeling of computation using logic circuits occupies an important position in the fundamentals of complexity theory including quantum complexity theory. Consequently, research into methods for computing logic functions on quantum circuits as well as for minimizing and simplifying such circuits has become extremely important. In this paper we explicitly formulate the depth minimization problem for quantum logic circuits and show that this problem is closely related to a geometric approach to deriving a lower bound on the size of a quantum logic circuit. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 9–17, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20298
A method of detection of signals corrupted by nonstationary random noise via stationarization of the data
Authors: Ijima Hiroshi , Ohsumi Akira , Okui Ryo 
Published: April 2007

AbstractThis paper proposes a method for detecting a signal embedded in nonstationary noise. In most past studies of the signal detection problem, random noise is considered as a stationary stochastic process, since it is mathematically easy to handle. However, the noise observed in practice contains many nonstationary elements with time‐varying (evolutionary) statistical properties. In this study, observational noise is modeled as a probability density function with slowly evolving parameters. Then, based on the evolving spectral representation, the nonstationary observation data are transformed to a stationary process. A new method is proposed as follows. It is assumed that nonstationarity remains in the stationarized observation data in the interval containing the signal, due to the effect of the signal. Then the signal is detected by testing for stationarity. In the proposed method, Priestley's evolutionary spectrum is used in the spectral representation of the nonstationary stochastic process, and the method of Okabe and colleagues based on the KM2O‐Langevin equation is used for the stationarity test. The effectiveness of the proposed method is verified by a simulation experiment. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 29–38, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20302
A study on an estimation system of inverse transfer function using adaptive filter estimating minimum‐phase and allpass transfer function
Authors: Kobayashi Masaki , Itoh Yoshio , Okello James 
Published: April 2007

AbstractA structure is proposed for an adaptive system with an adaptive filter located before the unknown system (pre‐inverse adaptive system) for estimation of the inverse of the transfer function (inverse transfer function) of the unknown system. In general, when an adaptive transversal filter is used as an adaptive filter, the delay signal of the output of the unknown system is needed in the adaptive algorithm for the weights. Since an adaptive filter is inserted in the front stage, this signal cannot be observed, so that a replica of the unknown system is needed. In this paper, an adaptive system that does not require this replica is discussed. Estimation of the inverse transfer function of the minimum phase of the unknown system is performed by an adaptive exponential filter and an inverse copy of the weights of the exponential filter placed in front of the unknown system. The signal within the adaptive algorithm consists of the observable input signal to the adaptive exponential filter and the estimation error. Estimation of the inverse transfer function for the allpass transfer function of the unknown system is performed by the adaptive transversal filter and the reversing copy of the weight to the transversal filter located before the unknown system. The signal in the adaptive system consists of the observable input signal to the exponential filter and the estimation error. Convergence of the weight is studied from the point of view of monotonic increase of the gradient. The unique feature of the approach is that the algorithm of the two adaptive filters consists of a gradient algorithm with guaranteed convergence for the weights and of copies of the weights after updating. Finally, a performance evaluation of the adaptive system and a comparison with conventional systems are performed by numerical simulation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 10– 17, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20305
Resolution enhancement of digital images with data‐dependent biasing
Authors: Okamoto Yasuaki , Taguchi Akira , Tokuda Masamitsu 
Published: April 2007

AbstractIn the information and communications field, digital images have come to be widely used in mobile communications devices, and digital image processing is very important. Because of the different resolutions of the displays and output devices in each terminal, digital images undergo reduction and enlargement processing very frequently. Conventionally, reduction and enlargement processing is performed using an interpolation algorithm based on the sinc function. However, because the frequency band increases when digital images are enlarged, an enlarged image of sufficient quality cannot be attained through interpolation. In recent years, an enlargement method has been proposed which uses estimation of the frequency bands (high‐frequency components) which increase with the enlargement of a digital image. The authors have also clarified interpolation algorithms using the preservation of step edge signals, coordinate point warping for generating peak signals, and signal amplitude biasing. They have implemented an interpolation algorithm which produces high‐frequency components. In calculating the bias in this method, the smaller of the biases found to either side of the interpolation is selected. This choice is not necessarily optimal; the larger bias should be selected depending on certain conditions. For example, the selection of the larger bias makes it possible to preserve the precipitous changes in a step edge signal. This makes it possible to preserve step edge signals and generate peaks, without also using coordinate point warping, by selecting the optimal bias according to local information. The proposed interpolation algorithm using data‐dependent biasing was compared to an interpolation algorithm using coordinate point warping and signal amplitude biasing. The proposed algorithm was found to have a similar performance and clearly shown to be a method with low computational complexity. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 18–28, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20306
Stochastic complexity of complete bipartite graph‐type Boltzmann machines in mean field approximation
Authors: Nishiyama Yu , Watanabe Sumio 
Published: April 2007

AbstractA variational Bayes method is proposed as an approximation method for implementing Bayesian posterior distribution with moderate computational complexity. Its effectiveness for real problems has been confirmed. The variational Bayes method is a method which generalizes the mean field approximation used in calculating partition functions in statistical physics. In recent years, the mathematical properties of the precision with which it is approximated have been investigated. In this paper, the authors consider the asymptotic stochastic complexity in the case of applying the mean field approximation to complete bipartite graph‐type Boltzmann machines and theoretically derive that asymptotic form. Also, based on the results, the authors quantitatively consider the difference between Bayesian posterior distribution and the posterior distribution of the mean field approximation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 1– 9, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20307