Miracle-dz/UniFAR-FTUs huggingface dataset:
Learning receptor positions from imperfectly known motions

An algorithm is described for learning image interpolation functions for sensor arrays whose sensor positions are somewhat disordered. The learning is based on failures of translation invariance, so it does not require knowledge of the images being presented to the visual system. Previously reported implementations of the method assumed the visual system to have precise knowledge of the translations. We demonstrate here that translation estimates computed from the imperfectly interpolated images can have enough accuracy to allow the learning process to converge to a correct interpolation.
Fortran D Language Specification

This paper presents Fortran D, a version of Fortran enhanced with data decomposition spec-iications. It is designed to support two fundamental stages of writing a data-parallel program: problem mapping using sophisticated array alignments, and machine mapping through a rich set of data distribution functions. We believe that Fortran D provides a simple machine-independent programming model for most numerical computations. We intend to evaluate its usefulness for both programmers and advanced compilers on a variety of parallel architectures.
PENERAPAN SISTEM NILAI DALAM BUDAYA ORGANISASI SEKOLAH UNGGUL: STUDI MULTIKASUS

Abstrak: Penerapan Sistem Nilai dalam Budaya Organisasi Sekolah Unggul Studi Multikasus. Tujuan penelitian ini adalah memperoleh gambaran mendalam tentang penerapan sistem nilai dalam budaya sekolah unggul yang memiliki latar budaya organisasi yang berbeda, baik dari segi nilai-nilai yang dianut maupun penyelenggaranya, yaitu SMPN1 Banyuwangi, SMP Kristen Aletheia Genteng, dan SMP Bustanul Makmur Genteng. Penelitian ini menggunakan pendekatan kualitatif dengan rancangan studi multikasus dengan menggunakan pendekatan fenomenologis dan budaya. Informan ditetapkan secara purposif. Teknik pengumpulan data meliputi wawancara mendalam, observasi partisipan, dan studi dokumentasi. Data dianalisis secara berulang-ulang melalui analisis dalam kasus dan analisis lintas kasus. Temuan penelitian sebagai berikut. (1) Penerapan sistem nilai pengetahuan terwujud apabila (a) terlaksana sistem nilai prestasi; (b) sistem nilai mandiri; (c) sistem nilai displin; dan (d) sistem nilai keunggulan. (2) Penerapan sistem nilai sosial terwujud apabila (a) terlaksana sistem nilai kebebasan yang ber tanggung jawab; (b) sistem nilai kesederhanaan kesahajaan; dan (c) sistem nilai kebersamaan dan persaudaraan. (3) Penerapan sistem nilai agama terwujud apabila (a) terlaksana sistem nilai ibadah; dan (b) sistem nilai kerendahan hati. Kata Kunci: sistem nilai, budaya organisasi, sekolah unggul, SMP
Myoelectric signal classification using evolutionary hybrid RBF-MLP networks

This paper introduces a hybrid neural structure using radial-basis functions (RBF) and multilayer perceptron (MLP) networks. The hybrid network is composed of one RBF network and a number of MLPs, and is trained using a combined genetic/unsupervised/supervised learning algorithm. The genetic and unsupervised learning algorithms are used to locate the centres of the RBF part in the hybrid network. In addition, the supervised learning algorithm, based on a back-propagation algorithm, is used to train the connection weights of the MLP part in the hybrid network. Performances of the hybrid network are initially tested using a two-spiral benchmark problem. Several simulation results are reported for applying the algorithm in the classification of myoelectric or electromyographic (EMG) signals where the GA-based network proved most efficient.
Metaheuristics for the bus-driver scheduling problem

We present new metaheuristics for solving real crew scheduling problems in a public transportation bus company. Since the crews of these companies are drivers, we will designate the problem by the bus-driver scheduling problem. Crew scheduling problems are well known and several mathematical programming based techniques have been proposed to solve them, in particular using the set-covering formulation. However, in practice, there exists the need for improvement in terms of computational efficiency and capacity of solving large-scale instances. Moreover, the real bus-driver scheduling problems that we consider can present variant aspects of the set covering, as for example a different objective function, implying that alternative solutions methods have to be developed. We propose metaheuristics based on the following approaches: GRASP (greedy randomized adaptive search procedure), tabu search and genetic algorithms. These metaheuristics also present some innovation features based on and genetic algorithms. These metaheuristics also present some innovation features based on the structure of the crew scheduling problem, that guide the search efficiently and able them to find good solutions. Some of these new features can also be applied in the development of heuristics to other combinatorial optimization problems. A summary of computational results with real-data problems is presented.
Web Search Using Dynamic Keyword Suggestion

Abstract Web search has become an essential task for most people. As the Web grows rapidly, effective searches have grown increasingly important. Most of us, however, have experienced frustration in trying to search for something on the Web. In existing keyword-based Web search, the user has to come up with keywords for a query, and a search engine passively retrieves pages based solely on what the user types in. Deciding on effective keywords is vital but often difficult. In this paper, we focus on the problem of how to help users find the right keywords in the first place, and our method is based on the idea that selecting from a suggested keyword list can be a more effective strategy in deciding on keywords for a query. We propose a new search method based on keyword suggestion and selection. The user is guided by a list of active keywords that is suggested dynamically during the search by a search engine. This active keyword list helps the user choose keywords that are more relevant to the search through recognition and guided selection. Our method is based on formal concept analysis and is complementary to the existing user-dependent keyword-based Web and desktop search engines. Based on the proposed method, a prototype system is implemented for directory search. Our method will be especially useful in domain-specific Web search, and can be extended to weighted keywords by applying the conceptual scaling process to a many-valued formal context.
Improvement of generation change on SSE algorithm

The Stochastic Schemata Exploiter (SSE) is one of the evolutionary optimization algorithms for solving the combinatorial optimization problems. For improving the search performance of SSE, we will present the cross generational elitist selection SSE (cSSE) algorithms of which the generation alternation algorithm is improved by using cross generational elitist selection. The SSE and the cSSE are compared with the Minimal Generation Gap (MGG) and the Bayesian Optimization Algorithm (BOA) on deception and knapsack problems in order to discuss their features.
Room-temperature lasing of microdisk lasers

Multiple quantum wells (MQW) microdisk lasers are fabricated by using the methods of photolithography-etching techniques. By the CCD watching-control and micron-area detecting systems, The 5µm-diameter microdisk lasers was optically pumped by Ar+ pulse laser at room temperature, with the 1:50 pump duty cycle. We obtained the single-mode lasing at 1.543m wavelength, with threshold pump power about 200µw.
Pattern Recognition in Speech and Language Processing

Minimum Classification Error (MSE) Approach in Pattern Recognition, Wu Chou Minimum Bayes-Risk Methods in Automatic Speech Recognition, Vaibhava Goel and William Byrne A Decision Theoretic Formulation for Adaptive and Robust Automatic Speech Recognition, Qiang Huo Speech Pattern Recognition Using Neural Networks, Shigeru Katagiri Large Vocabulary Speech Recognition Based on Statistical Methods, Jean-Luc Gauvain Toward Spontaneous Speech Recognition and Understanding, Sadaoki Furui Speaker Authentication, Qi Li and Biing-Hwang Juang HMMs for Language Processing Problems, Richard M. Schwartz and John Makhoul Statistical Language Models with Embedded Latent Semantic Knowledge, Jerome R. Bellegarda Semantic Information Processing of Spoken Language - How May I Help You? sm, A.L. Gorin, A. Abella, T. Alonso, G . Riccardi, and J.H. Wright Machine Translation Using Statistical Modeling, H. Ney and F.J. Och Modeling Topics for Detection and Tracking, James Allen
A digital neuron-type processor and its VLSI design

A set of neuron-type circuits elements based on logic gate circuits with multi-input multifan output capability is described. Three types of elements are introduced, one called the cell body with its dendritic inputs and synaptic junction, another representing the axon base, and the axon circuit. These three elements are cascaded to form a neuron-type processing element. The circuit performs input temporal and spatial summation as well as thresholding. The entire neuron circuit is simulated and a design is given using VSLI techniques. >
Coding for the correction of synchronization errors

Synchronisation is often assumed by the information engineer when working with data. However, diverse systems such as magnetic and optic storage systems, semiconductor devices as well as communication networks are affected by uncertainties in timing. This timing noise introduces or removes spurious symbols in the symbol stream, known as insertion or deletion errors. These errors differ from additive errors and erasure errors in that both the position and value of the error must be determined before correction can take place. In this seminar a brief survey of previous work in synchronization error correction coding is given. We start by introducing definitions for different synchronization errors, followed by definitions for synchronization error correction. The foundation for correcting synchronization errors provided by VI Levenshtein is then discussed. We finally present a general construction of binary algebraic block codes for the correction of multiple random insertion/deletion errors. The talk is concluded with some open problems and possible novel applications of synchronization error correction adjacent to the field of Network Coding. Synchronization error correcting coding is seldom mentioned in literature, due to the lack of understanding of the theory of synchronization channels as well as a lack of adequate mathematical models for this class of errors. This seminar should be of interest to anyone that haven’t come across these codes before and aims to stimulate interest in this research field. Biography Albert Helberg obtained the B.Eng (Cum Laude 1989), M.Eng (Cum Laude 1991) and D.Eng (1993) degrees in electronic engineering from the Rand Afrikaans University, South Africa. After spending time in industry, Albert was appointed at the North-West University in 2001 as professor. Prof. Albert Helberg is currently the research team leader in the TeleNet research group of the Telkom CoE at the North-West University and has filled several management positions in the Faculty, including Director of the School of Electrical, Electronic and Computer Engineering (2002-2006), Director Quality and Teaching (2007-2008) as well as Acting Dean of the Faculty of Engineering (2009). His personal research interests include digital coding techniques for error correction. ** ALL ARE WELCOME ** Host: Professor Raymond W.H. Yeung (Tel: 2609-8375, Email: whyeung@ie.cuhk.edu.hk) Enquiries: Information Engineering Dept., CUHK (Tel.: 2609-8388)
Efficient routing of multiple vehicles with no explicit communications

In this paper, we consider a class of dynamic vehicle routing problems, in which a number of mobile agents in the plane must visit target points generated over time by a stochastic process. It is desired to design motion coordination strategies in order to minimize the expected time between the appearance of a target point and the time it is visited by one of the agents. We propose control strategies that, while making minimal or no assumptions on communications between agents, provide the same level of steady‐state performance achieved by the best‐known decentralized strategies. In other words, we demonstrate that inter‐agent communication does not improve the efficiency of such systems, but merely affects the rate of convergence to the steady state. Furthermore, the proposed strategies do not rely on the knowledge of the details of the underlying stochastic process. Copyright © 2007 John Wiley & Sons, Ltd.
Bidding Marginal Utility in Simultaneous Auctions

We propose a new topic model for tracking timevarying consumer purchase behavior, in which consumer interests and item trends change over time. The proposed model can adaptively track changes in interests and trends based on current purchase logs and previously estimated interests and trends. The online nature of the proposed method means we do not need to store past data for current inferences and so we can considerably reduce the computational cost and the memory requirement. We use real purchase logs to demonstrate the effectiveness of the proposed method in terms of the prediction accuracy of purchase behavior and the computational cost of the inference.
Small-signal analysis and minimum settling time design of a one-stage folded-cascode CMOS operational amplifier

A small-signal analysis of the single-ended one-stage folded-cascode CMOS operational amplifier is presented. The analysis results in a four-pole two-zero representation from which a two-pole model is extracted that is sufficiently accurate for many applications in switched-capacitor (SC) circuits. A design equation for obtaining the minimum settling time (MST) response for SC applications is given. >
Die Prosodie des Schweizerdeutschen - Erkenntnisse aus der sprachsynthetischen Modellierung von Dialekten

After a focus on dialectal syntax in the 1990s, an increasing interest in dialectal prosody can be noted at the beginning of the new millennium. The following findings on Swiss German prosody are based on models for a speech synthesis for the dialects of Berne and Zurich. The differences between the dialects appear not only in the phonology of intonation but - analogously to segmental phonetics - also in suprasegmental phonetics. Thus, the focus of the method lies more strongly on global phonetic aspects than on local phonological aspects. In addition to the basic conception of speech synthesis, this article discusses aspects of the analysis and certain areas of the modelling. According to the goals of the research project "Development of basic knowledge for research on Swiss German prosody by means of speech synthesis modelling" from which this paper results, findings are presented in the use of pauses, phrasing, timing aspects and intonation.
Procedures and statistical methodology of model validation

Abstract : Determining the effectiveness of a computer simulation model in duplicating a desired real world phenomenon is an important unsolved problem. The purpose of this paper is to model the validation procedure in a broad context and develop a general methodology for the statistical part of validation. A procedure calling on utility, decision, simulation, and statistical theories is developed. The goals of statistical testing are presented, and the assumptions, properties, and results of several parametric and nonparametric tests are discussed and compared.
Discovering all frequent trends in time series

Several techniques have been proposed for translating and mining time series. The translation schemes are typically based on passing a window over the time series and extracting features from the data lying within the window. The use of windows in time series translation has been shown to be effective in indexing and querying similar time series. However, for applications involving the identification of frequent patterns in time series, and finding pattern associations existing in single or multiple time series, significant domain knowledge is required to effectively choose a window size. Alternatively, an expensive all-window approach may be employed.In this work we present a linear-time, domain-independent technique for translating time series and finding all frequent trends in the series without using a time window.
Can Standards be Met and Evaluated Through an Online Teacher Education Technology Course? A Case Study

The continual evolution of the national technology standards creates a continual state of flux within the world of instructional technology. However, this creative online environment offers the possibilities that may not be available within other specialization areas; namely, the opportunity to reinvent conceptual frameworks of understanding and creative endeavors. Innovative teacher education units across the United States are reaching for opportunities to maintain the bleeding edge of understanding and integrating technology in successful and appropriate manners, which may also lead to thoughtful reflection as to the state and reasoning behind "why we do what we do. " Discussion includes: cognitive flexibility; instructional design; national standards integration into Webbased coursework; standards evaluation; and the Web-based teacher education technology course scope and sequence. (Author/AEF) Reproductions supplied by EDRS are the best that can be made from the original document. 00 Title: Can Standards be Met and Evaluated Through an Online Teacher oo c:) Education Technology Course? A Case Study Author: Caroline M. Crawford University of Houston Clear Lake Houston, Texas, USA crawford@cl.uh. edu Jana Willis University of Houston-Clear Lake United States of America willis@cl.uh. edu
A System for Visualizing Gene Expressions Using Metabolic Networks

It has become possible to monitor gene expressions comprehensively with the rapid progress of the DNA microarray technique. Microarray data is useful for estimating the functions of a gene because a set of genes is considered to have similar functions if the genes have similar gene expression profiles. However, it is difficult to extract biologically meaningful data from such data. One promising approach for browsing gene expression data is to map them onto genetic networks. It is a well-known fact that genes interact with each other and form complex networks. Genetic networks are modeled as graphs where a node represents a gene and an edge represents an interaction of the genes at the ends. Estimating genetic networks using gene expression data is one of the most important tasks in the field of bioinformatics. There have been several related studies to visualize gene expression data onto metabolic networks, such as KEGG (Kyoto Encyclopedia of Genes and Genomes) [2], ExPASy [1], and EcoCyc[3]. However, most studies only provide static images. Obviously, the cost of maintaining massive images of metabolic networks is expensive, and it is also difficult to update the images based on the latest information. Although some studies support automatic graph drawing, their functionalities are limited; that is, they only support one particular species or they cannot handle data based on multiple pathways. To cope with this problem, we have implemented a system that supports automatic drawing of metabolic pathways. It allows us to visualize microarray data by overlaying gene expression statuses without complex operations. In this paper, we propose a system for visualizing DNA microarray data by mapping them onto metabolic pathways. In our implementation, we employ SVG for drawing graphs to support dynamic redrawing of metabolic networks. As a result, when we have a set of gene expression data, we can quickly spot the distinctions among those data by browsing them contrastively.
A 1.5-GHz 130-nm Itanium® 2 Processor with 6-MB on-die L3 cache

This 130-nm Itanium 2 processor implements the explicitly parallel instruction computing (EPIC) architecture and features an on-die 6-MB 24-way set-associative level-3 cache. The 374-mm/sup 2/ die contains 410 M transistors and is implemented in a dual-V/sub t/ process with six Cu interconnect layers and FSG dielectric. The processor runs at 1.5 GHz at 1.3 V and dissipates a maximum of 130 W. This paper reviews circuit design and package details, power delivery, the reliability, availability, and serviceability (RAS) features, design for test (DFT), and design for manufacturability (DFM) features, as well as an overview of the design and verification methodology. The fuse-based clock deskew circuit achieves 24-ps skew across the entire die, while the scan-based skew control further reduces it to 7 ps. The 128-bit front-side bus has a bandwidth of 6.4 GB/s and supports up to four processors on a single bus.
Target tracking with retrodicted discrete probabilities

The concept of retrodiction of discrete probabilities is exploited in this paper to provide alternative data association algorithms for tracking multiple targets with a single or multiple sensors. These algorithms employ multiple frames of data in the data association processing. The concept of retrodiction is also applied to the task of multiple model filtering. Alterative optimization criteria are also exploited to provide alternative association approaches and each approach is expected to exhibit different estimation error characteristics. These additional association approaches provide wider selection to better tailor the tracking algorithms to a specific application. These approaches offer improved performance over single-frame association tracking approaches. This improved performance is obtained, however, at the expense of increased processing load. A number of different approaches are described that employ multiple-frame data association. Similarly, a number of different approaches are also described that employ a moving window of multiple measurements for multiple model filtering. With these algorithms, design parameters can be selected to adjust performance to suit a specific application.
Fusión e integración de sistemas sensoriales artificiales utilizados en robótica

En este trabajo se presentan conceptos relacionados con los sistemas sensoriales artificiales principalmente con los utilizados en Robotica Movil. Se hace enfasis en las tecnicas de «Integracion y Fusion Sensorial» con una revision de los planteamientos propuestos en la literatura existente al respecto, tanto en problemas particulares como generales, y se esbozan algunas alternativas de solucion a problemas concretos. Por ultimo, se relaciona una bibliografia especializada que servira como fuente basica para ampliacion e investigacion sobre los temas tratados. El trabajo pretender ser el informe de una revision bibliografica que permita vislumbrar el estado del arte en las tecnicas planteadas anteriormente sobre sistemas sensoriales artificiales.
An architecture for designing internationalized software

Presents a modular architecture for designing internationalized software, called ISDA-i (Internationalized Software Design Architecture). This architecture successfully combines the user requirements for highly personalized applications with the developer requirements for easily maintained, reusable software components incorporating high localization potential. It enlarges the reusable software libraries and minimizes the size of the program core. All the configurable components of a software application are systematically stored in external configuration and resource files, which a system administrator or end-user may edit in order to modify its appearance and behavior.