Miracle-dz/UniFAR-FTUs huggingface dataset:
Bordeaux Wine Vintage Quality and the Weather

Publisher Summary The current Bordeaux marketing system has the character of an agricultural income stabilization system, and this may be its purpose. Complete income stabilization for the growers would require that the price of the young wines be inversely related to the quantity produced and independent of the quality. Although the actual pricing of young Bordeaux wines falls short of this ideal, it is clearly closer to it than would occur if purchasers used the information available from the weather for determining the quality of the wines. The producers do attempt to raise prices when crops are small, despite the evidence that the quantity of the wines (determined by the weather in the spring) is generally unrelated to the quality of the wines. Moreover, it is common for the proprietors to claim that each vintage is a good one, independent of the weather that produced it. Indeed, there is no obvious incentive for an individual proprietor to ever claim anything else.
Bazı Herbisitlerin Mısır ve Yabancı Ot Biyomasına Etkisi

Bu calisma bazi herbisitlerin misirin ve yabanci otlarin biyomasina etkilerini incelemek amaciyla yurutulmustur. Arastirma 2016 yilinda tesaduf parsellerinde faktoriyel deneme desenine gore 4 tekerrurlu olarak, tam kontrollu sera sartlarinda, glpyhosate, glufosinate, imazamox ve isoxaflutole + thiencarbazone-methyl + cyprosulfamide etken maddeli herbisitlerin saksilara ekilen 25 misir hattina uygulanmasiyla gerceklestirilmistir. Misir biyomasi en az glpyhosate, en fazla isoxaflutole + thiencarbazone-methyl + cyprosulfamide etken maddeli herbisit uygulanan misir hatlarinda elde edilmistir. Yetistirme ortaminda bulunan yabanci ot tohumlarinin cimlenmesi ve buyumesi ise en az isoxaflutole + thiencarbazone-methyl + cyprosulfamide (safener), en fazla glpyhosate uygulanan saksilarda ortaya cikmistir. Isoxaflutole + thiencarbazone-methyl + cyprosulfamide etken maddeli herbisitle sonradan cimlenme potansiyeli bulunan yabanci otlara karsi kontrol saglandigi dusunulmektedir.
A fusion method that performs better than best sensor

In multiple sensor systems, it is generally known that a good fuser will outperform the best sensor, and on the other hand, an inappropriate fuser can perform worse than the worst sensor. If the error distributions of the sensors are precisely known, an optimal fuser--that performs at least as well as best sensor--can be designed using statistical estimation methods. In engineering and robotic systems, however, it is too difficult and expensive to derive closed form error distributions required by these methods. This problem is further compounded by the variety and complexity of present day sensor systems, wherein a number of sensing hardware units and computing modules could be integrated into a single sensor. In these systems, however, it is possible to collect sensor data by sensing objects with known parameters. Thus, it is very important to have sample-based methods that enable a fuser to perform at least as well as the best sensor. In this paper, the author presents a generic analytical formulation of this problem, and provide a very simple property that yields such fuser.
Structured modeling of manufacturing processes

The complexity of modern manufacturing systems calls for advanced modeling techniques which can be applied during different planning phases from a first design to the operation of a system. This paper introduces a Manufacturing Modeling (MM) concept which partitions a system into the subsystems INFORM, EXECUTE and SUPPORT and describes all activities in the individual subsystems by the MM functions REST, MOVE, MAKE and VERIFY. Graphical representations of the model structure and of simulation output help to make models transparent to the user. The technique is being implemented using the Research Queueing Package (RESQ), a modeling language developed by IBM Research in Yorktown Heights. It will be demonstrated for an automatic manufacturing line.
Nano-Optical Device Design with the Use of Open-Source Parallel Version FDTD and Commercial Finite Element Package

In this paper, the implementation of open-source parallel-version FDTD (Finite-Difference-Time-Domain) software, MEEP, on Texas A&M supercomputers and commercial finite element package, COMSOL, on a single workstation for the design design of nano-optical device is reported. The the computer architecture and performance of both numerical methods on the same design will be briefly described.
On a neural network associative memory that uses indirect convergence

A special type of neural network associative memory which utilizes indirect convergence is introduced. During the synchronous, iterative recall process, every neuron state update must be in the right direction, i.e. no wandering transition is allowed. The tradeoff between the number of fundamental states and their attraction force is analyzed, under the constraint of probability of successful recall being not less than 0.99. The major advantage of such a network is its quickness in seeking for the stable state, even with a comparable number of stored states. <<ETX>>
On the decoding structure for multiple turbo codes

We consider message-passing strategies for the iterative decoding of multiple turbo codes (MTCs). We contradict the conventional wisdom that the parallel decoding structure is the best for MTCs by proposing new non-parallel decoding structures which give better BER performances for the same computational complexity. Under a modified independent Gaussian assumption (IGA), we are able to theoretically validate our design, which is further supported by extensive simulation results.
Object recognition using coding schemes

A new technique for recognizing two-dimensional objects independent of scale and orientation is presented. This technique's performance on real imagery of tactical military targets, both occluded and nonoccluded, is evaluated. This study shows that this method is robust with respect to partial occlusion. The relatively small storage requirements and fast search time make it an attractive candidate for real-time applications.
Robust Statistical Methods With R

There is a rapidly increasing number of books with titles “Something with R”, where “Something” is some area of statistics. Clearly this is a good development from the point of view of JSS: statistical software gets more attention than it did in the “Without R” era. I think it is also good from a somewhat broader perspective: paying more attention to software blends applied and theoretical aspects of statistics, and illustrates the fact that statistics is properly defined as the development and study of techniques for data analysis. For those of us who are so inclined source code for a working algorithm is a precise and reproducible way to explain what a technique actually does. And finally it is good that the books use R, and not something else, because R is the lingua franca of computational statistics.
Framework for evaluating dynamic memory allocators including a new equivalence class based cache-conscious allocator

Software applications’ performance is hindered by a variety of factors, but most notably by the well-known CPU-memory speed gap (often known as the memory wall). This results in the CPU sitting idle waiting for data to be brought from memory to processor caches. The addressing used by caches cause non-uniform accesses to various cache sets. The non-uniformity is due to several reasons, including how different objects are accessed by the code and how the data objects are located in memory. Memory allocators determine where dynamically created objects are placed, thus defining addresses and their mapping to cache locations. It is important to evaluate how different allocators behave with respect to the localities of the created objects. Most allocators use a single attribute, the size, of an object in making allocation decisions. Additional attributes such as the placement with respect to other objects, or specific cache area may lead to better use of cache memories. In this dissertation, we proposed and implemented a framework that allows for the development and evaluation of new memory allocation techniques. At the root of the framework is a memory tracing tool called Gleipnir, which provides very detailed information about every memory access, and relates it back to source level objects. Using the traces from Gleipnir, we extended a commonly used cache simulator for generating detailed cache statistics: per function, per data object, per cache line, and identify specific data objects that are conflicting with each other. The utility of the framework is demonstrated with a new memory allocator known as equivalence class allocator. The new allocator allows users to specify cache sets, in addition to object size, where the objects should be placed. We compare this new allocator with two well-known allocators, viz., Doug Lea and Pool allocators.
A Comparison of Traditional and Conceptual Instruction on Students' Algorithmic Performance and Understanding of Area

This study investigated the effects of conceptual instruction on conceptual understanding and algorithmic performance as well as the student's ability to relate the two. The sample consisted of 83 fifth grade students, divided into four classes. A total of 44 were in the experimental group and 39 served as the control group. Both groups were taught the concept of area. The experimental group recieved conceptual instruction and the control group recieved traditional instruction. Two regular classroom teachers implemented the experiment, each taught one experimental group and one control group. A pretest/posttest design was used to collect the data. Analysis of covariance was the statistical analysis used to test the three null hypotheses with a significance level at <. 05. Results indicated that conceptual instruction did improve the student's conceptual understanding but did not improve algorithmic performance. Also, no significant difference was found regarding the student's ability to relate the concept and the algorithm. Chapter
Implementation of bit-serial recursive digital filters

A single-chip digital filter capable of realizing a single class of transfer function with programmable cutoff frequencies, stopband attenuation, and passband ripple has been designed and implemented. The filter is implemented using a pipelined bit-serial two's-complement arithmetic architecture. Six different recursive digital filter structures were analyzed to determine the minimum signal and coefficient wordlengths required to obtain the same performance with each of the filters. This information was then used to estimate the maximum sample rate possible and the number of gates that would be required to implement each filter structure using the same gate array fabrication technology. The bilinear LDI digital filter chosen for implementation required the least gates for an architecture in which on pipelined bit-serial multiplier is shared throughout the filter. <<ETX>>
Performance analysis of the transmission control protocol over low earth orbit satellite communication systems

i ACKNOWLEDGMENTS I would like to thank Dr. Shawn Osterman for giving me an opportunity to work with him. I would like to acknowledge his assistance in providing thoughtful insights and wonderful working environment. I would like to thank my classmates and labmates, most notably Issam, Naseef, Eric, Vitaly, Kunjan, Usman and Matai for helping me out of all the problems I encountered in two years of my course work. I'd like to acknowledge the funding granted to me by the School of Electrical Engineering and Computer Science. I would like to thank my friend Nayana for her constant support.
Editorial: Science Fiction and Fantasy

Electrical harness manufacturing apparatus comprises wire feeding means for feeding wires along a wire feed path through upstream and downstream (relative to the direction of wire feed) wire guides. The guides have opposed ends which are adjacent to each other during feeding. The guides thereafter move apart so that fed wires are exposed in a gap between the opposed ends. A transferring device clamps the wires in the gap and wire cutting means are provided to cut the wires adjacent to the transferring means, thereby producing leads having their trailing ends gripped in the transferring means. The transferring means transfers the trailing ends laterally of the feed path to a wire connecting station at which the trailing ends are connected to terminals in a connector. Insulation can be stripped, if desired, from the trailing ends of the cut leads and from the leading ends of the wires extending from the feed means.
Qualitative research : analysis types and software tools

History of qualitative research qualitative research in sociology types of qualitative research qualitative research in education qualitative research in philosophy types of qualitative analysis organizing systems and how to develop them the mechanics of structural qualitative analysis the mechanics of interpretational qualitative analysis qualitative analysis programs (MS-DOS) - basic structures and functions how to deal with a computer how to read the descriptions of qualitative analysis programs.
A controlled, rapid approach to curriculum change

Teachers are continually bombarded with change programs for improvements in areas such as literacy and numeracy, however; the focus is often on the program and not on results (Pertuze, Calder, Greitzer & Lucas, 2010). When the inevitable failure follows (Fullan, 2005; Gross, Giacquinta & Bernstein, 1971)the school moves on to a new activities-based model.
Simulation kinematics model of a multi-legged mobile robot

This paper addresses the kinematics modeling of a four legged mobile robot which has been developed to study the leg swinging and robot motion during locomotion. The robot motion is categorized into: The leg swinging motion as an open loop kinematics chain and the robot trunk motion relative to the feet during locomotion as a closed kinematics chain. Algorithms for solving the forward and inverse kinematics problems of these two categories have been developed. A closed kinematics chain algorithms of the whole robot structure is presented. This closed kinematics model is used in off-line animation of the robot motion in different cases and to simulate the stable wave gait in off-line programming. The robot motion by computer graphics is displayed.
DESIGNING LISTENING MATERIALS BASED ON CONTEXTUAL TEACHING AND LEARNING APPROACH

This research was aimed at designing listening materials based on Contextual Teaching and Learning approach for second semester of eleventh grade students of SMA Negeri 1 Ketapang. Before designing the listening materials, the writer did a preliminary study. The result showed that there were not any units which had the seven components of CTL in the units for listening to monologue texts. Therefore, the writer designed listening comprehension materials which fulfilled the seven components of CTL. The listening materials designed had fulfilled the components of CTL, principles of material design, aspects of material design and principles of listening material development.
Inverse Frequent Itemset Mining Based on FP-Tree: Inverse Frequent Itemset Mining Based on FP-Tree

After the current definition of the inverse frequent set mining problem is expanded and its three practical applications are explored, an FP-tree-based method is proposed for the inverse mining problem. First, the method divides target constraints into some sub constraints and each time it solves a sub linear constraint problem. After some iterations, it finds an FP-tree satisfying the whole given constraints. Then, based on the FP-tree it generates a temporary database TempD that only involves frequent items. The target datasets are obtained by scattering infrequent items into TempD. Theoretic analysis and experiments show that the method is right and efficient. Moreover, compared with the current methods, the method can output more than one target data set.
Extraction of semantic relations from texts

In recent years the amount of unstructured data stored on the Internet and other digital sources has increased significantly. These data contain often valuable, but hardly retrievable information. The term unstructured data refers mainly to data that does not have a data structure. As a result of this, the unstructured data is not easily readable by machines. In this work, we present a simple method for automatic extraction of semantic relations that can be used to precisely locate valuable pieces of information.
A modified actor-critic reinforcement learning algorithm

This paper proposes a fast and efficient actor-critic reinforcement learning algorithm that is novel in at least two ways: it updates the critic only when the best action is executed and it takes full advantage of the powerful temporal difference (TD) prediction method to train a continuous-valued actor. Both actor and critic are represented separately by two adaptive neural fuzzy systems tuned by a backpropagation algorithm. While the critic adapts to the actor by minimizing the quadratic sum of TD error, the actor adapts to the critic, by not only using the TD error, but also by using the state value function. The new actor-critic architecture is applied to an inverted pendulum system, which is widely used to compare reinforcement learning architectures.
3D facial image analysis for human identification

Presents a new method based on 3D facial section analysis for human face identification. The range data on different curves of intersection, such as, vertical, horizontal, and circular, with the 3D face are used as the distinguishing surface features. These are robust against changes in makeup and lighting as compared to the 2D approach, and more efficient for computation and data storage than other 3D approaches. The performance of this method for human face identification is evaluated through several matching experiments. It has been observed that the curves of intersection crossing the facial central area vertically and contain the features, like, nose and mouth, have the major distinctiveness. Those crossing near the inner corners of the eyes and a part of the nose are also effective for human face identification. But it seems that such an effectiveness requires the accurate extraction of the sections against their locational variations. <<ETX>>
Hierarchical routing using k-SPR

This research explores hierarchical routing strategies in AODV/ k-SPR by implementing them in U. C. Berkeley's NS-2 network simulator. Creating a hierarchical system of routing necessitated altering of the C++ code associated with AODV protocols and also the generating of C++ code to do a number of tasks connected with creating such a system. More data must be collected and analyzed in order to determine the most efficient method of applying these new protocols for routing. Last year's research Last year, two Drake students, Tiffany Meredith and Jennifer Ehrlich started working with the NS-2 simulator to create graphs and perform actions on these graphs. Their research yielded several interesting results including the development of a new wireless routing protocol which they named k-SPR. Ehrlich and Meredith's version of k-SPR used a router selection algorithm called k-SPR-I to select routers and passed messages across a network using a hybrid of the k-SPR algorithm and the AODV algorithm. They also used a particular C++ program in the NS2 simulator named God.cc along with the existing AODV code to help them implement k-SPR/AODV. Our research begins where theirs left off.
Collaboration in Writing

Main work: Creating Multiple Pathways to Powerful Literacy in Challenging Times : Proceedings of the 2011 and 2010 Annual Conferences of the Reading Association of Ireland Editor(s): Kelly, Aoibheann; Dwyer, Bernadette; Mehigan, Gene; Watson, Gillian Year: 2012 Pages: 84-92 Publisher: Reading Association of Ireland Discipline: Educational sciences; Languages; Literature studies School /Other Unit: School of Education Item Type: Article in Conference Proceeding URN: URN:NBN:fi:uta-201306131125
Scientific/industrial camera-on-a-chip using Active Column Sensor CMOS imager core

The first section will review the requirements for scientific/industrial cameras and discuss the limitations of conventional CCD and active pixel sensors (APS) approaches. The next section will describe the Active Column Sensor technology, and discuss the reasons for the improved performance compared to passive pixel CMOS and APS imagers. Then the Active Column SensorTM (ACS) pixel structure and modes of pixel operation will be discussed. The paper will also describe the other camera functions that are placed on the same substrate. Experimental results including images will be presented. The paper will close with a glimpse into the future of industrial and scientific CMOS ACS image enabled systems.
The real costs of outsourcing

Nearly every public and private organization is expected to take a serious look at outsourcing for at least part of their operations. Yet the emotional costs that employees pay and the productivity loss a company risks can offset the potential cost savings. An Informed decision on whether to outsource hinges on understanding the roles and responsibilities of management, contractors, and consultants.
Neural-like holographic information system for processing of optical signals

The main advantages of a neural networks are the flexibility of architecture and ability to training. It allows to perform data processing even when the processing procedure can not be present by the known function. The neural networks based on optical elements allow real time operation rather than electronic neural networks. We offered system, based on neural networks, capabling to solve a broad class of heterogeneous problems and adapting to input information flow. The system are based on neural networks of two types: (1) a single-pass network of perceptron type and (2) recognize network of Hopfield network type. The neural network of the type (1) is realized by holographic scheme and experimental checked when processing the signals fiber- optic measuring network.
Implementation of Efficient Pan-Tilt-Zoom Camera Calibration

Abstract : Pan-tilt-zoom (PTZ) cameras, frequently used in both online and automated surveillance applications, require accurate knowledge of camera parameters in order to accurately register autonomously tracked objects to a world model. Due to imprecision in the PTZ mechanism, these parameters cannot be obtained from PTZ control commands but must be calculated directly from camera imagery. This report describes the efforts to implement a real-time calibration system for a stationary PTZ camera. The approach continuously tracks distinctive image feature points from frame to frame, and from these correspondences, robustly calculates the homography transformation between frames. Camera internal parameters are then calculated from these homographies. Finally, the external parameters can be calculated from the internal parameters and image homographies. The calculations are performed by a self-contained program that continually monitors images collected by the camera as it performs pan, tilt, and zoom operations. The accuracy of the calculated calibration parameters are compared to ground truth data. The program works with a higher degree of accuracy for small changes in the camera's external parameters. In addition, long algorithm execution time prevents the algorithm from running under all real-time conditions.