Miracle-dz/UniFAR-FTUs huggingface dataset:
Taking advantage of reconfigurable logic

The availability of programmable logic devices based on static memory cells allows the implementation of "soft" hardware - that is, logic devices whose functions can be changed while they remain resident in system. A growing number of SRAM-based Field Programmable Gate Array (FPGA) users are taking advantage of this capability. In general, these applications of reconfigurable logic fall into three categories: System with built-in diagnostic or test logic, "adaptable" system designs, and systems with "multi-purpose" hardware. <<ETX>>
Investigating and analyzing the light-weight ciphers for wireless sensor networks

The Wireless Sensor Networks (WSNs) are characterized by the severe constraints in the com- putational, storage and energy resources. Though there has been significant improvement in the available computational resources due to the proliferation of the next-generation sensor nodes, the energy and stor- age resources of sensor nodes are still limited. As the sensor nodes are often deployed in ubiquitous and pervasive environments, it is necessary to ensure communications security in a WSN. However, the use of the security protocols adds to the associated overhead. Therefore, ensuring communications security in a WSN is a challenge. We believe that since the core component of any security protocol is the cipher used therein; the overhead due to a security protocol can be largely reduced, by employing essentially a lightweight cipher. But at the same time, the cipher so employed must ensure appropriate levels of security with standard key-sizes. Currently, Skipjack (80-bit key-size) is the cipher of choice, for the software based security protocols like TinySec, SenSec and MiniSec, used in WSNs. However, with the help of exhaustive simulation, experiments and analysis, in this paper, we show that our optimized implementation of the Corrected Block Tiny Encryption Algorithm (XXTEA) (128-bit key-size), can be a good alternative to Skipjack; at least in the resource constrained WSN environments.
Design of the wavelength-division optical network

The authors consider the wavelength-division optical network (WON), a generalization of the ShuffleNet concept. Motivated by the potential drawback of large delays in poorly designed WONs, they introduce and use a queuing-network model of the WON that provides a general framework for analyzing the performance of these networks. This performance model is used to formulate the virtual-topology design problem. Using the optimization technique of simulated annealing, a number of instances of the virtual-topology design problem were solved. The results have been very encouraging and have yielded significant-and sometimes dramatic-improvement in delay and throughput, compared to previously proposed, unoptimized design approaches such as ShuffleNet and the Manhattan street network. The authors discuss their experiences with the optimization algorithm and outline continuing efforts in this area. <<ETX>>
Continuing Research Needs Resulting from the SDTS Development Effort

For more than a decade, efforts to develop and specify the U.S. Spatial Data Transfer Standard (SDTS) have on many occasions encountered limitations in both theory and "gaps in our knowledge" which have hindered its development. This work examines broad categories of these limitations from the perspective of research needs, to encourage further research on these topics. Areas in need of further study include fundamental concepts, the specification and use of spatial objects, spatial data quality, entity definitions, the data transfer mechanism, and international comparison of transfer mechanisms. In many cases recent research progress has been made in these areas and this progress is pointed out. A number of high-priority research areas are identified. It is hoped that this work will encourage more research effort to be directed towards these areas, which will benefit not only the development of spatial data transfer standards but also the spatial data sciences in general.
Dynamics Explorer science data processing system.

The Dynamics Explorer project has acquired the ground data processing system from the Atmosphere Explorer project to provide a central computer facility for the data processing, data management and data analysis activities of the investigators. Access to this system is via remote terminals at the investigators' facilities, which provide ready access to the data sets derived from groups of instruments on both spacecraft. The original system has been upgraded with both new hardware and enhanced software systems. These new systems include color and grey scale graphics terminals, an augmentation computer, micrographics facility, a versatile data base with a directory and data management system, and graphics display software packages.
COMPUTER RECOGNITION OF PRISMATIC SOLIDS

An investigation is made into the problem of constructing a model of the appearance to an optical input device of scenes consisting of plane-faced geometric solids. The goal is to study algorithms which find the real straight edges in the scenes, taking into account smooth variations in intensity over the faces of the solids, blurring of edges and noise. A general mathematical analysis is made of optimal methods of identifying the edge lines in figures, given a raster of intensities covering the entire field of view. There is given in addition a suboptimal statistical decision procedure, based on the model, for the identification of a line within a narrow band on the field of view given an array of intensities from within the band. A computer program has been written and extensively tested which implements this procedure and extracts lines from real scenes. Other programs were written which judge the completeness of extracted sets of lines, and propose and text for additional lines which had escaped initial detection. The performance of these programs is discussed in relation to the theory derived from the model, and with regard to their use of global information in detecting and proposing lines.
Comparison GMM and SVM Classifier for Automatic Speaker Verification

The objective of this thesis is to develop automatic text-independent speaker verification systems using unconstrained telephone conversational speech. We began by performing a Gaussian Mixture Model Likelihood ratio verification task in speaker independent system as described by MIT Lincoln Lab. We next introduced a speaker dependent verification system based on speaker dependent thresholds. We then implemented the same system applying Support Vector Machine. In SVM, we used polynomial kernels and radial basis function kernels and compared the performance. For training and testing the system, we used low-level spectral features. Finally, we provided a performance assessment of these systems using the National Institute of Standards and technology (NIST) speaker recognition evaluation 2008 telephone corpora.
Two-hour-ahead load forecasting using neural network

In this paper, we propose a two-hour-ahead load forecasting method using the correction of similar day's data. The proposed prediction method is an extension of a one-hour-ahead load forecasting method. Therefore, first we forecast a one-hour-ahead load and then this load is taken as the input to the neural network for the two-hour-ahead load forecasting. In the proposed prediction method, the forecasted power load is obtained by adding a correction to the selected similar day's data. The correction is yielded from a neural network. Since the neural network yields the correction which is simple data, it is not necessary for the neural network to learn all similar day's data. Therefore, the neural network can forecast power load by simple learning.
Adaptive compliant motion control of position-controlled manipulators

This paper presents a new adaptive compliant motion control scheme for position-controlled manipulators. The strategy does not require knowledge of the manipulator dynamic model, the position controller parameters, or the environment, and is extremely simple computationally. It is shown that the control scheme ensures global boundedness of all signals if the inner-loop position controller has a PD structure and that the ultimate bounds on the size of the force and position errors can be made arbitrarily small in this case. If the inner-loop position controller has a PD-plus-gravity-compensation structure then the stability is shown to be asymptotic. Experimental results are presented for the Robotics Research Corporation (RRC) Model K-1207 redundant robot and demonstrate that the control scheme provides a simple and effective means of obtaining high performance force control. <<ETX>>
Transitioning to PC-Based Simulation-One Perspective

Abstract : Doing "more for less" is a recurring theme facing researchers in many simulation facilities. In the area of simulation, one way to reduce operational costs is to invest in and operate inexpensive simulation computer systems. Traditionally, this has not been possible because very specialized computer systems were required to build simulation architectures that provided a deterministic timing mechanism and also assured that simulation processes executed in a predetermined order throughout the entire execution period of the simulation. However, with the advent of 2.0 OHz processors, powerful graphics cards, and the wide availability of software, the personal computer (PC) is now becoming a realistic option for developing real-time simulation architectures. Air Force Research Laboratory (AFRL) researchers at the Aerospace Vehicle Technology Assessment and Simulation (AVTAS) Laboratory have integrated and tested a simple, PC-based, real-time simulation framework that executes under the Linux operating system. Using various hardware- and software-based timing mechanisms, along with nonspecialized software tools, the AVTAS Laboratory has developed a real-time simulation architecture that will enable the execution of simulation experiments on dual-CPU and quad-CPU PCs.
Beyond problem solving and comprehension: An exploration of quantitative reasoning

Building on the methods and techniques presented in " Problem Solving and Comprehension, " the authors show how their methods can be used to manage more difficult problems and situations. By providing step-by-step solutions for problems of figural reasoning, chart and graph interpretation, verbal reasoning, and advanced mathematical word problems, the authors create an ideal book for gifted students and for those preparing to take standardized admissions tests for colleges and professional schools.
Intelligent control based on genetic algorithms-case study on mobile robot

The application of genetic algorithms to mobile robot dynamic control and path planning is described. A new genetic strategy, GASC (genetic algorithm with symmetric code), is used in this application. Robot dynamic control based on dynamic model and its path planning are converted into an optimization problem with some constraints, then GASC is employed to solve this problem. In GASC, some new genetic techniques have been put forward. A genetic strategy is employed in the robot system's intelligent control. The simulation results obtained show that these techniques are indispensable to enhance the performance of our genetic strategy. GASC out performs the traditional genetic algorithms greatly in control find path planning of a mobile robot. The population of GAs based on symmetric codes theory in our generic strategy can automatically satisfy the velocities constraints at the final point in a robot path.
Job Scheduling Algorithm for Cloud Computing Based on Particle Swarm Optimization

Cloud computing is an emerging high performance computing environment with a large scale, heterogeneous collection of autonomous systems and flexible computational architecture. The performance of the scheduling system influences the cost benefit of this computing paradigm. To reduce the energy consumption and improve the profit, a job scheduling model based on the particle swarm optimization(PSO) algorithm is established for cloud computing. Based on open source cloud computing simulation platform CloudSim, compared to GA and random scheduling algorithms, the results show that the proposed algorithm can obtain a better solution concerning the energy cost and profit.
Simplified calculation of radial force spectrum in SMR for acoustic noise prediction in preliminary machine design

An analytical method for prediction of the radial force spectrum in switched reluctance machines is presented. The radial force waveform is approximated with a tetragon shape and the resulting spectrum is derived analytically. The characteristic points of the tetragon may be determined analytically, by simple lumped parameter simulation models or finite element analysis (FEA).
Full-field high-speed laser Doppler imaging system for blood-flow measurements

We describe the design and performance of a new full-field high-speed laser Doppler imaging system developed for mapping and monitoring of blood flow in biological tissue. The total imaging time for 256x256 pixels region of interest is 1.2 seconds. An integrating CMOS image sensor is utilized to detect Doppler signal in a plurality of points simultaneously on the sample illuminated by a divergent laser beam of a uniform intensity profile. The integrating property of the detector improves the signal-to-noise ratio of the measurement, which results in high-quality flow-images provided by the system. The new technique is real-time, non-invasive and the instrument is easy to use. The wide range of applications is one of the major challenges for a future application of the imager. High-resolution high-speed laser Doppler perfusion imaging is a promising optical technique for diagnostic and assessing the treatment effect of the diseases such as e.g. atherosclerosis, psoriasis, diabetes, skin cancer, allergies, peripheral vascular diseases, skin irritancy and wound healing. We present some biological applications of the new imager and discuss the perspectives for the future implementations of the imager for clinical and physiological applications.
E‐Readiness for Developing Countries: Moving the focus from the environment to the users

The achievement of high levels of e‐readiness is being increasingly heralded as one of the top priorities for developing countries. Furthermore, a growing amount of time, money and effort is being invested in calculating the level of a country's e‐readiness. This paper carries out a critical review on the concept of e‐readiness, with a special focus on developing countries. The results show that used by themselves, such measures do not help in terms of development as they tend to focus on the wider environment while ignoring the level of the organisation. In this light, a new model is proposed which gives importance to both e‐readiness (the environment) and technology acceptance (the organisation), in order to gain a richer understanding of the situation.
Distributed routing for load balancing

Some open-loop and closed-loop control algorithms are discussed for an example of a discrete-event system, namely, the routing of arriving tasks from different arrival streams among several possible service stations. It is shown that it is possible to design open-loop policies that give good performance in a way which is very robust with respect to large changes in the arrival rates. This is possible even though it is assumed that there is no online coordination between the routing algorithms for the different arrival streams. Some further improvements of the performance are possible when a simple feedback policy, namely, overflow routing, is implemented. This also gives reasonable robustness of performance with respect to changes in the service rates. >
Locating facial features with color information

In the present paper we suggest a new method for inferring the face location and scale from the color information. At first facial region segmentation is performed with the vertical projection of the gray level pixel value. Second a horizontal projection can be used to localize the vertical edges of the eyes. Within the borders of the eyes we use a gradient decomposed Hough transform to find eye centres in the low brightness region. Once the eyes are reliably detected, we can easily find the position of the mouth depending on a natural constant biometric relation. We calculating two projection curves with the color information. Computer simulation shows that this algorithm is robust.
Artificial neural networks in marine propeller design

Various neural network systems were developed for examining propeller performance data that were derived experimentally. This study is aiming to establish an accurate mapping thus facilitating propeller selection during the design process. Different neural network architectures and learning rates were tested aiming at establishing a near optimum setup. It is evident from the findings so far, that this technology can be used effectively in modeling the performance of a series of marine propellers and thus may be used for propeller selection, and for extrapolation to new designs.
Fast content-based image retrieval using dynamic cluster tree

A novel content-based image retrieval data structure is developed in present work. It can improve the searching efficiency significantly. All images are organized into a tree, in which every node is comprised of images with similar features. Images in a children node have more similarity (less variance) within themselves in relative to its parent. It means that every node is a cluster and each of its children nodes is a sub-cluster. Information contained in a node includes not only the number of images, but also the center and the variance of these images. Upon the addition of new images, the tree structure is capable of dynamically changing to ensure the minimization of total variance of the tree. Subsequently, a heuristic method has been designed to retrieve the information from this tree. Given a sample image, the probability of a tree node that contains the similar images is computed using the center of the node and its variance. If the probability is higher than a certain threshold, this node will be recursively checked to locate the similar images. So will its children nodes if their probability is also higher than that threshold. If no sufficient similar images were founded, a reduced threshold value would be adopted to initiate a new seeking from the root node. The search terminates when it found sufficient similar images or the threshold value is too low to give meaningful sense. Experiments have shown that the proposed dynamic cluster tree is able to improve the searching efficiency notably.
Realization of filter banks by means of wave digital filters

Wave digital filters (WDFs) are derived from classical filters. They have very good properties with respect to coefficient accuracy requirements, stability, and dynamic range. One of the most attractive classes of WDFs are lattice WDFs (LWDFs), which can be used for filtering with sampling rate alteration and multirate filter banks in a very efficient way. The principles of LWDFs and LWDF filter banks are extended for polyphase and multidimensional WDFs and WDF filter banks. The following applications are presented: efficient coding of audio signals, in particular music signals; realization of a filter bank for real-time spectrum analysis; and realization of a 2-D filter bank with sector-shaped regions for efficient coding of images by decomposing these into several directional images. <<ETX>>
Computer and Robot Vision

From the Publisher: This two-volume set is an authoritative, comprehensive, modern work on computer vision that covers all of the different areas of vision with a balanced and unified approach. The discussion in "Volume I" focuses on image in, and image out or feature set out. "Volume II" covers the higher level techniques of illumination, perspective projection, analytical photogrammetry, motion, image matching, consistent labeling, model matching, and knowledge-based vision systems.
Identifying objects in a conventional procedural language: an example of data design recovery

The authors propose methodologies to aid in the design recovery of object-like features of a program written in a non-object-oriented language. Two complementary methods, based on an analysis of global data or of data types, are proposed, along with an interactive tool that would combine the two methods while using human input to guide the object identification process. The authors are constructing a prototype interactive software tool to implement these methods for the C language. The intention is to collect data on the user's decisions and reasons for making them so that improved heuristics or knowledge-based-methods could be developed to improve the process. <<ETX>>
Improved K-Means Algorithm Based on Outliers Detection in Review Spam Filtering

K-means algorithm is common in text clustering algorithm. The traditional K-means algorithm has sensitivity to the initial centers. The result of clustering depends on the initial centers excessively. For different input, the output fluctuated considerably. The K-means algorithm combined features dictionary with density based on outlier detection to detect the outliers in text data. In the first stage, the density parameter is given to all of the data objects using the custom distance function. In the second stage, K-means is used to cluster base on the distribution of density. K data objects are chosen to be the initial clustering centers as they belong to high density area and have the farthest distance for each other. In the third stage, the exception text sets can be identified from the clustering by the outlier detection algorithm. Experimental results show that the proposed approach can efficiently detect outliers in data set.
Generalized Phrase Structure Grammar

"Generalized Phrase Structure Grammar" provides the definitive exposition of the theory of grammar originally proposed by Gerald Gazdar and developed during half a dozen years' work with his colleagues Ewan Klein, Geoffrey Pullum, and Ivan Sag. This long-awaited book contains both detailed specifications of the theory and extensive illustrations of its power to describe large parts of English grammar. Experts who wish to evaluate the theory and students learning GPSP for the first time will find this book an invaluable guide.The initial chapters lay out the theoretical machinery of GPSP in a readily intelligible way. Combining informal discussion with precise formalization, the authors describe all major aspects of their grammatical system, including a complete theory of syntactic features, phrase structure rules, meta rules, and feature instantiation principles. The book then shows just what a GPSP analysis of English syntax can accomplish. Topics include the internal structure of phrases, unbounded dependency constructions of many varieties, and coordinate conjunction a construction long considered the sticking point for phrase structure approaches to syntax.The book concludes with a well developed proposal for a model theoretic semantic system to go along with GPSP syntax. Throughout, the authors maintain the highest standards of explicitness and rigor in developing and assessing their grammatical system. Their aim is to provide the best possible test of the hypothesis that syntactic description can be accomplished in a single-level system. And more generally, it is their intention to formulate a grammatical framework in which linguistic universals follow directly from the form of the system and therefore require no explicit statement. Their book sets new methodological standards for work in generative grammar while presenting a grammatical system of extraordinary scope. "