1,451 research outputs found
USCID fourth international conference
Presented at the Role of irrigation and drainage in a sustainable future: USCID fourth international conference on irrigation and drainage on October 3-6, 2007 in Sacramento, California.Includes bibliographical references.Since 3000 BC, rice has been the main crop in the Korean Peninsula, and where currently most of the available irrigation water is used to grow paddy rice. Methods for calculating the quantity of irrigation water required developed in the 1990's were compared to quantities measured in the field. The largest difference between calculated and measured quantities occurred in April and May. Based on field data we obtained in the middle part of the Korean Peninsula, significant changes have occurred in rice management, which has changed the amount of irrigation water required. Rice is now transplanted earlier, and duration of the transplanting phase on the regional scale is shorter through mechanization and consolidation of land holdings. These changes need to be taken into account when calculating the quantity of water needed for irrigation
Current-induced domain wall motion in a nanowire with perpendicular magnetic anisotropy
We study theoretically the current-induced magnetic domain wall motion in a
metallic nanowire with perpendicular magnetic anisotropy. The anisotropy can
reduce the critical current density of the domain wall motion. We explain the
reduction mechanism and identify the maximal reduction conditions. This result
facilitates both fundamental studies and device applications of the current-
induced domain wall motion
An Enhanced Double-layered P2P System for the Reliability in Dynamic Mobile Environments
The double-layered peer-to-peer (P2P) systems were introduced to reduce the network traffic in MANET. The peers in the systems are classified into super peers and sub-peers. Super peers manage their neighboring sub-peers. The network communications in the systems are done mostly among super peers. In case when a pair of neighboring super peers is too far to communicate, one or two of their sub-peers bridges the super peers. However, the double-layered systems need to improve the reliability that guarantees communications among peers. In this paper, we propose a new double-layered P2P system in which super peers are selected based on their mobility. We also propose two reliability improvement schemes, the avoidance scheme and the role changing scheme. They are applied to the proposed system to enhance the reliability of the system. The proposed system is implemented in the dynamic mobile P2P environment where peers may join and leave the network dynamically and the number of peers varies. The various experiments are done with the Network Simulator-2 v2.33. The experimental results show that the proposed system with the two schemes improved the reliability over other double-layered systems in terms of the failure rate by up to 25 %, while increasing the network traffic marginally
Robust Distributed Clustering Algorithm Over Multitask Networks
We propose a new adaptive clustering algorithm that is robust to various multitask environments. Positional relationships among optimal vectors and a reference signal are determined by using the mean-square deviation relation derived from a one-step least-mean-square update. Clustering is performed by combining determinations on the positional relationships at several iterations. From this geometrical basis, unlike the conventional clustering algorithms using simple thresholding method, the proposed algorithm can perform clustering accurately in various multitask environments. Simulation results show that the proposed algorithm has more accurate estimation accuracy than the conventional algorithms and is insensitive to parameter selection.11Ysciescopu
Data-Reserved Periodic Diffusion LMS With Low Communication Cost Over Networks
In this paper, we analyze diffusion strategies in which all nodes attempt to estimate a common vector parameter for achieving distributed estimation in adaptive networks. Under diffusion strategies, each node essentially needs to share processed data with predefined neighbors. Although the use of internode communication has contributed significantly to improving convergence performance based on diffusion, such communications consume a huge quantity of power in data transmission. In developing low-power consumption diffusion strategies, it is very important to reduce the communication cost without significant degradation of convergence performance. For that purpose, we propose a data-reserved periodic diffusion least-mean-squares (LMS) algorithm in which each node updates and transmits an estimate periodically while reserving its measurement data even during non-update time. By applying these reserved data in an adaptation step at update time, the proposed algorithm mitigates the decline in convergence speed incurred by most conventional periodic schemes. For a period p, the total cost of communication is reduced to a factor of 1/p relative to the conventional adapt-then-combine (ATC) diffusion LMS algorithm. The loss of combination steps in this process leads naturally to a slight increase in the steady-state error as the period p increases, as is theoretically confirmed through mathematical analysis. We also prove an interesting property of the proposed algorithm, namely, that it suffers less degradation of the steady-state error than the conventional diffusion in a noisy communication environment. Experimental results show that the proposed algorithm outperforms related conventional algorithms and, in particular, outperforms ATC diffusion LMS over a network with noisy links.11Ysciescopu
Minimal grid diagrams of the prime knots with crossing number 13 and arc index 13
We give a list of minimal grid diagrams of the 13 crossing prime
nonalternating knots which have arc index 13. There are 9,988 prime knots with
crossing number 13. Among them 4,878 are alternating and have arc index 15.
Among the other nonalternating knots, 49, 399, 1,412 and 3,250 have arc index
10, 11, 12, and 13, respectively. We used the Dowker-Thistlethwaite code of the
3,250 knots provided by the program Knotscape to generate spanning trees of the
corresponding knot diagrams to obtain minimal arc presentations in the form of
grid diagrams.Comment: 57 pages, 5 figures, 1 table and 3250 grid diagram
- …