Miracle-dz/UniFAR-FTUs huggingface dataset:
Remote sensing analysis of rice disease stresses for farm pest management using wide-band airborne data

On-farm pest management and crop protection strongly depend on diagnosis of crop disease stress in fields. In this paper, we first examine the applicability of broadband high-spatial-resolution ADAR (airborne data acquisition and registration) remote sensing data in visible and near infrared regions for rice disease detection and then develop an approach to explore their applicability. Experiments were conducted in 1999 on a large-scale rice field with sheath blight infection in central Arkansas, USA. Based on the measured symptoms, a comprehensive ground disease index (DI) was constructed to indicate the infection severity. Correlations between ground data and image data were analyzed with attempt to develop an applicable method for remote sensing of the rice disease. The results indicate that the broadband remote sensing imagery has valuable capability of application. Some image indices such as the RI/sub 14/, SDI/sub 14/ and SDI/sub 24/ have a correlation of above 0.62, hence are valuable for rice disease identification. A method based on the indices has been developed. Validation with the ground data indicates that the method has an average accuracy of above 70% for classification. The standard estimate error of the method is /spl sim/13%. In spite of this encouraging result, we also realize that it is really difficult to discriminate the healthy plants from light infection ones (DI<20%) because of their heavily overlapping in the estimated image indices. Identification is much more accurate when infection reaches to mediate-to-severe levels (DI>35%). High spectral resolution remote sensing imagery with more bands and narrower bandwidth is required for remote sensing diagnosis of crop disease stress.
Infrastructure in Kohonen maps

Different Kohonen maps have been studied in order to establish whether dimensional and shape aspects are important for map performance. The results presented indicate that for the same number of nodes, two-dimensional maps perform slightly better than three-dimensional maps. On the other hand, there was no difference in performance due to map shape. Different adaptation rules have been studied and compared with respect to map convergence. One of the rules, center adaptation, has been shown to result in faster convergence. Two measures are proposed to establish the unimodality in map response and the internal organization of a trained map. <<ETX>>
Decimation filter compiler for oversampling A/D applications

A silicon compiler (DECGEN) which generates a decimation filter for oversampling A/D converters is described. It generates a multistage filter consisting of two stages of sinc filter and an equiripple bandshaping FIR filter. A heuristic procedure is derived for dividing the decimation ratio between the two stages of sinc filter in an optimum fashion. Digit serialization and hardware multiplexing are used for the target architecture in order to reduce silicon area. <<ETX>>
A Library of Concurrent Objects and Their Proofs of Correctness

Answering the first question is one of definition; the second, of method. While there is no general agreement on an answer to the first, we choose the correctness condition called linearizability, which has recently captured the attention of the research community. Informally, we say an implementation of a concurrent object O is correct if and only if each concurrent history H accepted by O is “equivalent” in some sense to some legal sequential history, where (1) legality is defined in terms of the (sequential) type semantics of the object and (2) the “equivalent” sequential history preserves the real-time ordering of operations in H.
A 4.6Tbits/s 3.6GHz single-cycle NoC router with a novel switch allocator in 65nm CMOS

As chip multiprocessors (CMPs) become the only viable way to scale up and utilize the abundant transistors made available in current microprocessors, the design of on-chip networks is becoming critically important. These networks face unique design constraints and are required to provide extremely fast and high bandwidth communication, yet meet tight power and area budgets. In this paper, we present a detailed design of our on-chip network router targeted at a 36-core shared-memory CMP system in 65 nm technology. Our design targets an aggressive clock frequency of 3.6 GHz, thus posing tough design challenges that led to several unique circuit and microarchitectural innovations and design choices, including a novel high throughput and low latency switch allocation mechanism, a non-speculative single-cycle router pipeline which uses advanced bundles to remove control setup overhead, a low-complexity virtual channel allocator and a dynamically-managed shared buffer design which uses prefetching to minimize critical path delay. Our router takes up 1.19 mm2 area and expends 551 mW power at 10% activity, delivering a single-cycle no-load latency at 3.6 GHz clock frequency while achieving apeak switching data rate in excess of 4.6 Tbits/sper router node.
The shape of things to come

I still vividly remember the day in 1964 when, as a graduate student interested in informat ion storage and retr ieval , I saw Ivan Sutherland's landmark film on Sketchpad [6]. I was blown away. The next day I switched my thesis topic to an unknown specialty in the nascent field of computer science called computer graphics. I still show the Sketchpad film in my introductory course each year and, like the old-timer who tells his kids about walking 10 miles to school, in the snow, barefoot, I always emphasize to my students, spoiled rotten by mult i-hundred MIPS engines with accelerators for 3D raster graphics, what an amazing paradigm shift interaction via pictures was in an era defined by batch processing with punched cards. Later, at the 1969 FJCC, Doug Engelbart further expanded my horizons when he, in what has to be the mother of all demos, demoed window systems, the mouse, outline processing, sophisticated hypertext features and telecollaboration with video and audio communication. In the intervening decades, graphics has greatly expanded from those early days of primitive vector graphics to include not just classical geometric modeling, photorealistic rendering (made possible by color raster graphics) and even behavioral modeling, but also elements that only recently became part of mainstream graphics, such as image processing, computer vision and new paradigms for user interaction.A look at these examples will serve to show how the field continues to evolve and take on new forms, and may give a hint as to the shape of things to come.
UNDERWATER ACOUSTIC COMMUNICATIONS IN WARM SHALLOW WATER CHANNELS

Acknowledgements Although the completion of a Ph.D. is looked upon as an individual accomplishment, it is rarely achieved without the help of many people. The research presented in this thesis is no exception. Potter, for their support and guidance in my academic pursuits. A/Prof. Ong Sim Heng has supported me through several projects over the past years, allowing my research interests in underwater acoustics and digital image processing an avenue for growth. A/Prof. John Potter introduced me to underwater acoustics and guided me through the learning process involved in theoretical and experimental aspects of the subject. Without his mentoring and support, I would not be pursuing independent research in this field today. I would also like to thank Prof. Chan Eng Soon, who first recognized my research interests during my undergraduate studies and helped me find numerous opportunities to further them. He has since supported me in several endeavors, eventually leading to my current research in underwater acoustics. I would like to express my gratitude towards the DSTA a and the ARL b for supporting most of the research presented in this thesis. experimental deployments and data collection in support of this project, for which I am grateful. kindly agreed to find time from their busy schedules to help monitor the technical progress during the course of the research. Their comments and feedback during the Ph.D. qualification defense proved valuable in helping define some of the key research directions for the project. Lastly, I would like to thank my lovely wife, Yun Ping, and my loving parents for their support, understanding and unconditional love. Without them, none of this work would have been possible.
Enhanced Cost Estimation Model for Replica Selection

A data grid allows large amount of data to be stored and shared among users at geographically different locations. However, when required, data has to be copied to the location where it is needed. This means a lot of network bandwidth will be used for the data transfer. One strategy employed in data grids is to make multiple copies of the data, called replicas, and place them in strategic locations so that the data is not too far from where it might be needed. When data is required, a user now has to choose among the different replicas. Hence, the need for best replica selection to reduce time, effort and resources needed to bring that data to where it is required. Best replica selection tries to estimate the cost involved in copying the data from the alternative replica sites. Most replica cost estimation models use only a few parameters to make the calculations, hence limiting their usage for specific purposes. In this work, we include multiple parameters, taking into account the characteristics of the replica sites as well the network links between the user site and replica sites. We combine the parameters into a formula, and test various scenarios in a simulator. Our results show that this enhanced model can consistently select best replica, and is comparable to other models. Keywords—replica selection, cost estimation model, data replication, data grids
Michael Schrage on Innovation

Looking for the great clients who are the true innovators? Co-director of the MIT Media Lab's eMarkets Initiative, a senior advisor to MIT's Security Studies Program, and a consultant to MIT's Langer Labs on technology transfer issues, Michael Schrage conducts research on the economics of innovation. His particular focus is on the role of models, prototypes and simulations in managing interactive iterative design, an area in which he works with a number of companies.
Two design techniques for adaptive transceivers for digital subscriber lines (DSL)

Two techniques for using adaptive transceivers for digital subscriber lines (DSL) are studied. Both methods utilize preprocessors before modulation and transmission of signals. The performance of these transceivers is compared with that of a conventional transceiver, with no preprocessor, on some loops within the CSA (carrier serving area) design rules. It is found that when self near-end crosstalk (NEXT) is the predominant impairment, using adaptive transmitters in addition to adaptive decision-feedback equalizers (DFEs) offers to advantage over using fixed transmitters with DFEs. However, the results indicate that adaptive transmitters can be used to eliminate precursor intersymbol interface (ISI) without substantial performance penalty. This leaves the receiver the sole task of mitigating the effects of added interference and postcursor ISI. <<ETX>>
Trial application of spread spectrum technologies to hierarchical digital broadcasting

This paper describes two advanced hierarchical digital transmission systems using SS (spread spectrum) technology in order to improve the breakdown characteristics of digital transmission. One is AW-CDM (adaptively weighted code division multiplexing) hierarchical digital transmission system for terrestrial digital broadcasting, which enables one to use mobile/portable receiver as well as fixed receiver. The other is TDM-SS (time division multiplexing using spread spectrum) hierarchical digital transmission system for Ka-band satellite broadcasting, which enables one to receive limited but continuous service even in heavy rain attenuation. Through simulations and experiments using prototype models, some of their features have been verified.
A parallel tabu search approach based on genetic crossover operation

TS (tabu search) is one of the meta-heuristic algorithms that can solve the combinatorial optimization problems, which is NP-hard such as TSPs (traveling salesman problems), satisfied. With the requirement of solving large-scale problems, we proposed a new parallel tabu search (PTS) approach, which was cooperated with genetic crossover operation for TSPs. In addition, a novel adaptive search strategy of intensification and diversification was proposed to improve the solution quality and efficiency in TS. Taking TSPs as sample, some simulation experiments were implemented. It was shown that our proposed PTS approach was feasible and effective.
An image retrieval system to estimate impression words from images using a neural network

In this paper, we propose a new method to estimate impression words from images using neural network and the image retrieval system. Since the human sensitivity and various images are flexibly connected using a neural network in the proposed system, it can automatically estimate impression words from various kinds of images. As a result, the proposed system can reflect human's kansei (impression and sensitivity) effectively and treat wider variety of images. We show some experimental results. The proposed system can estimate correct impression words and successfully retrieve correct images.
The phonology of German /R/

The German uvular /R/ probably shows more surface variation than any other segment in the language. (1) illustrates that /R/ has a vocalic allophone [A], which can surface either as a glide or a vowel, a sonorant consonant allophone, which is pronounced as a uvular trill or approximant, and two obstruent allophones: In the present study I focus on the rules producing the consonantal allophones of /R/ in both Standard German and in certain dialects of the Lower Rhineland (henceforth LRG).
Variable precision rough set model based dataset partition and association rule mining

Discovery of association rules is one of the most important tasks in data mining. Many efficient algorithms have been proposed in the literature. In this paper, a method of dataset-partitioning using conceptual hierarchy and a variable precision rough set model is presented. An algorithm for mining association rules using this technique is designed, and an asynchronous algorithm is proposed, too. The efficiency of the algorithm and the factors that affect the efficiency of the algorithm are analyzed by mining association rules in a dataset artificially generated. The result of an experiment proves the efficiency of the algorithm.
A protection cache architecture for the multi-view memory model and its performance

This paper presents a supporting architecture for the multi-view memory model and investigates its performance. The multi-view memory model is intended to provide applications with the variable-sized access units that they require for optimal performance within a computer system. The supporting architecture provides for the addressability of the state information which is kept on each variable sized-access unit. It is also designed to provide applications with a choice of access control protocol on various memory regions. Caches are integral to the architectural design. They allow for on-the-fly access rights determination and also for the flexibility of protocol choices. The miss rates on the caches within the access control protection subsystem architecture are determined using synthetic traces as input. The emphasis in this study is not to determine how traditional factors such as cache size, degree of associativity and line size affect the miss rates, but is targeted at evaluating the effect that views and their definitions have on the performance. It is found that the protection cache miss rate vary according to the sites of the access units defined within the views and the number and ratio of the differently-sized access unit entries within the protection cache.
BER and FER prediction of control and traffic channels for a GSM type of air-interface

Performance analysis of a mobile communications system is often done separately at network and at link level. It is difficult to study a modern mobile communications system like GSM analytically, due to the complexity. Hence simulations are used. It is desirable to include all link aspects in a network simulator, but without having to simulate every single link, since this would be to time consuming. In this paper a method is presented to find the BER and FER from the signal to interference (C/I) values for a GSM type of air-interface, which can be used for integration of link aspects in a network simulator. The accuracy is within 0.2 dB in case of the BER and 0.5 for the FER. Both traffic and control channels are studied and the method is independent of hopping sequences and speed.
Semantic Similarity Algorithm Based on Generalized Regression Neural Network

Based on the intensives study of semantic similarity algorithms and artificial neural networks knowledge, a generalized regression neural network semantic similarity algorithm is proposed. Training samples are obtained by extracting the principal component of semantic similarity influence factors; the desired spread factor and best training sample sets are gotten by crossvalidation and recursive optimization; a generalized regression neural network is established with these supports. Experiment comparison and analysis verify that, the result of semantic similarity algorithm based on generalized regression neural network is more accurate than that of existing algorithms.
Distance Adaptive Tensor Discriminative Geometry Preserving Projection for Face Recognition

There is a growing interest in dimensionality reduction techniques for face recognition, however, the traditional dimensionality reduction algorithms often transform the input face image data into vectors before embedding. Such vectorization often ignores the underlying data structure and leads to higher computational complexity. To effectively cope with these problems, a novel dimensionality reduction algorithm termed distance adaptive tensor discriminative geometry preserving projection (DATDGPP) is proposed in this paper. The key idea of DATDGPP is as follows: first, the face image data are directly encoded in high-order tensor structure so that the relationships among the face image data can be preserved; second, the data-adaptive tensor distance is adopted to model the correlation among different coordinates of tensor data; third, the transformation matrix which can preserve discrimination and local geometry information is obtained by an iteration algorithm. Experimental results on three face databas.
An Improved Way to Make Large-Scale SVR Learning Practical

We first put forward a new algorithm of reduced support vector regression (RSVR) and adopt a new approach to make a similar mathematical form as that of support vector classification. Then we describe a fast training algorithm for simplified support vector regression, sequential minimal optimization (SMO) which was used to train SVM before. Experiments prove that this new method converges considerably faster than other methods that require the presence of a substantial amount of the data in memory.
Optimizing stimulus parameters by modeling multi-electrode electrical stimulation for retina implants

The purpose of this paper is to investigate the feasibility of retina implants to selectively stimulate individual retina neurons by coupled current pulses for multielectrode arrays. Retina implants with learning retina encoders for blind subjects suffering from retinal degeneration must be able to stimulate individual retinal nerve cells. A computer model of a retina segment was combined with the simulation of a set of epi-retinally positioned stimulation electrodes. The potential field distribution was calculated for a cluster of neighboring electrodes. Stimulus time courses for given geometric conditions were identified by direction set methods as well as evolutionary algorithms. The computational retina model reveals under which conditions different retinal nerve cells are stimulated.
Trajectory planning of human reaching movements for a time-minimizing task

We investigate trajectory planning for a time minimizing task in human reaching movements. Using computer simulation, we found that the minimum movement-time trajectory is considerably concave toward a body and its velocity profile has two peaks. In psychophysical experiments, we observed that the subjects generated roughly straight hand paths with bell-shaped velocity profiles in the time-minimizing task. These features can be reproduced by the minimum commanded torque change criterion that requires the smoothness of motor command. We confirmed that the subjects could generate minimum movement-time trajectories when given a via-point and some instructions. The experimental results suggest that the brain cannot calculate the optimal trajectory according to the performance index except for the smoothness.
The use of numerical weather forecast model predictions as a source of data for irrigation modelling

The use of numerical weather forecast model data as a source of data for soil moisture modelling was tested. Results show that the potential evaporation calculated using the Penman‐Monteith equation can be estimated accurately using data obtained from the output of a high resolution numerical atmospheric model (HIRLAM, High Resolution Limited Area Model). The mean bias error was 0.26 mm for a 36‐hour sum and the root mean square error was 2.14 mm. The evaporation obtained directly from HIRLAM was systematically smaller because this direct model output represents the real evaporation rather than the potential evaporation. The precipitation forecasts were less accurate. When the accuracy of parameters required for the calculation of potential evaporation were studied for one station, no serious bias was found. When two different irrigation models (AMBAV and SWAP) were run over one summer using either measured or HIRLAM data as the input, the results given by the models were quite similar regardless of input data source. The largest differences between the model outputs were caused by the formulation of crop and soil characteristics in the irrigation models. Copyright © 2005 Royal Meteorological Society