Miracle-dz/UniFAR-FTUs huggingface dataset:
A combined H/sub /spl infin///QFT control of a rotary dryer

In this paper a hybrid controller design for a rotary dryer process is presented. First, a H/sub /spl infin// robust controller is obtained. Some tracking specifications are proposed in order to test the quality of this former controller using the Nichols chart and some QFT (quantitative feedback design) contours. Then, a prefilter is designed to lower the control signal amplitude and to fit all the plants in the set between the two specifications.
Dynamic path following: a new control algorithm for mobile robots

A new algorithm for the control of wheeled mobile robots called dynamic path following is presented. This algorithm regulates the motion of the mobile robots to desired geometric paths as opposed to desired trajectories which are given as time histories in conventional trajectory tracking algorithms. The desired trajectory for the dynamic path following algorithm is parameterized by a convenient geometrical parameter (e.g., arc length of the path). The algorithm is designed by using a nonlinear feedback for input-output linearization and decoupling. The performance of this new algorithm is compared with that of the trajectory tracking algorithm and is evaluated under different initial conditions as well as in the presence of various uncertainties using computer simulations. <<ETX>>
Kernel korner: Linux socket filter: sniffing bytes over the network

The invention relates to a combination of a pusher tug and one or more barge units, whereby each barge unit may comprise one or more barges coupled alongside each other. Between the barge units and/or between the rear-unit and the pusher tug, pivotable pushing connections are installed giving the combination an articulated character. Each of the pivotable pushing connections is only mounted to one of the units or to the pusher tug and is coupled to the opposite unit with usual connections, such as steel wires. The pivotable pushing connections are robust and easy to handle by the normal deck crew. Application of the pivotable and steerable pushing connections increases the safety of pushing traffic on waterways and allows more units per combination.
Things they never taught you in CMM school

The authors discuss some of the common mistakes made by organizations in planning and executing process improvement programs. Results are based on surveys and case histories from commercial and defense organizations, as well as the authors' personal experiences, and apply to improvement programs based on any Capability Maturity Model or similar quality standard. Some of these mistakes are due to lack of experience or knowledge; some are the result of cultural "blind spots", a lack of discipline, or optimistically wishing the world did not work the way it actually does. Examples are given, along with practical steps to avoid these pitfalls.
The design and analysis of efficient lossless data compression systems

Our thesis is that high compression efficiency for text and images can be obtained by using sophisticated statistical compression techniques, and that greatly increased speed can be achieved at only a small cost in compression efficiency. Our emphasis is on elegant design and mathematical as well as empirical analysis. We analyze arithmetic coding as it is commonly implemented and show rigorously that almost no compression is lost in the implementation. We show that high-efficiency lossless compression of both text and grayscale images can be obtained by using appropriate models in conjunction with arithmetic coding. We introduce a four-component paradigm for lossless image compression and present two methods that give state of the art compression efficiency. In the text compression area, we give a small improvement on the preferred method in the literature. We show that we can often obtain significantly improved throughput at the cost of slightly reduced compression. The extra speed comes from simplified coding and modeling. Coding is simplified by using prefix codes when arithmetic coding is not necessary, and by using a new practical version of arithmetic coding, called quasi-arithmetic coding, when the precision of arithmetic coding is needed. We simplify image modeling by using small prediction contexts and making plausible assumptions about the distributions of pixel intensity values. For text modeling we use self-organizing-list heuristics and low-precision statistics.
Open-Ended Learning of Visual and Multi-Modal Patterns

A common trend in machine learning and pattern classification research is the exploitation of massive amounts of information in order to achieve an increase in performance. In particular, learning from huge collections of data obtained from the web, and using multiple features generated from different sources, have led to significantly boost of performance on problems that have been considered very hard for several years. In this thesis, we present two ways of using these information to build learning systems with robust performance and some degrees of autonomy. These ways are Cue Integration and Cue Exploitation, and constitute the two building blocks of this thesis. In the first block, we introduce several algorithms to answer the research question on how to integrate optimally multiple features. We first present a simple online learning framework which is a wrapper algorithm based on the high-level integration approach in the cue integration literature. It can be implemented with existing online learning algorithms, and preserves the theoretical properties of the algorithms being used. We then extend the Multiple Kernel Learning (MKL) framework, where each feature is converted into a kernel and the system learns the cue integration classifier by solving a joint optimization problem. To make the problem practical, We have designed two new regularization functions making it possible to optimize the problem efficiently. This results in the first online method for MKL. We also show two algorithms to solve the batch problem of MKL. Both of them have a guaranteed convergence rate. These approaches achieve state-of-the-art performance on several standard benchmark datasets, and are order of magnitude faster than other MKL solvers. In the second block, We present two examples on how to exploit information between different sources, in order to reduce the effort of labeling a large amount of training data. The first example is an algorithm to learn from partially annotated data, where each data point is tagged with a few possible labels. We show that it is possible to train a face classification system from data gathered from Internet, without any human labeling, but generating in an automatic way possible lists of labels from the captions of the images. Another example is under the transfer learning setting. The system uses existing models from potentially correlated tasks as experts, and transfers their outputs over the new incoming samples, of a new learning task where very few labeled data are available, to boost the performance.
PENGEMBANGAN ASESMEN ALTERNATIF DALAM PEMBELAJARAN MATEMATIKA DENGAN PENDEKATAN REALISTIK DI SEKOLAH DASAR

Tujuan penelitian ini adalah untuk mengembangkan dan menemukan asesmen alternatif yang valid, praktis dan efektif berlandaskan pembelajaran matematika dengan pendekatan realistik di Sekolah Dasar (SD). Penelitian ini merupakan peneli-tian pengembangan yang mengacu pada model pengembangan pendidikan dari Plomp dengan mengacu pada kriteria kualitas produk pengembangan yang dikemukakan Nieveen , yang melipu-ti kriteria kevalidan, kepraktisan, dan keefektifan. Hasil peneliti-an ini adalah seperangkat penilaian dalam pembelajaran mate-matika dengan pendekatan realistik. Hasil uji coba, menunjuk-kan bahwa asesmen alternatif telah memenuhi kriteria kevalid-an, kepraktisan, dan keefektifan. Kevalidan asesmen alternatif beserta perangkat asesmen yang digunakan termasuk dalam kategori sangat baik. Kepraktisan dan keefektifan asesmen alter-natif beserta seluruh perangkat asesmen yang digunakan dalam pelaksanaan asesmen di dalam kelas termasuk kategori sangat praktis dan efektif. Ketercapaian keefektifan asesmen alternatif berdasarkan proses dan hasil pembelajaran cenderung mening-kat dengan kategori baik. Demikian juga respons siswa dan guru terhadap penerapan asesmen alternatif yang cenderung positif. Kata kunci: asesmen alternatif , pendekatan realistik ________________________________________________ DEVELOPING ALTERNATIVE ASSESMENT IN MATHEMATICS LEARNING USING THE REALISTIC APPROACH IN ELEMENTARY SCHOOLS Abstract This study aimed to develop and generate a valid, practical and effective alternative assessment based on the principle of mathematics learning using the realistic approach in elementary schools ( Sekolah Dasar , SD). This study was a research and development study which referred to the model of educational development by Plomp based on the criteria of product quality proposed by Nieveen , including the criteria of validity, practicality, and effectiveness. This study produced a set of assessment in mathematics learning using realistic approach. Based on the result of the tryout, the generated alternative assessment has fulfilled the criteria of validity, practicality, and effectiveness. The validity of alternative assessment and its assessment sets are in very good category. The result of the testing shows that the alternative assessment is very practical and effective, in terms of the learning process and learning achievement which tend to improve toward the good category. The response of students and teachers towards the implementation of this alternative assessment is also positive. Keywords: alternative assessment, realistic approach
An Agent-Based Architecture for Supporting High-Level Search Activities in Federated Digital Libraries

Federated digital libraries offer a variety of information structures. In order to allow for different kinds of searches as well as for navigation along explicit and implicit links, a large set of searching and browsing functions has to be provided. However, non-expert users will need additional help for performing effective searches. In order to guide the user, we support strategic search activities at different abstraction levels (strategies, stratagems, tactics), which are structured in a hierarchy. For implementing these concepts, we have developed an agent-based architecture for accessing a federated digital library. The resulting system integrates searching and browsing, supports high-level search activities, allows for horizontal and vertical integration of services and is flexible and extensible.
Continuous speech recognition results of the BYBLOS system on the DARPA 1000-word resource management database

The system was trained in a speaker dependent mode on 28 minutes of speech from each of 8 speakers, and was tested on independent test material for each speaker. The system was tested with three artificial grammars spanning a broad perplexity range. The average performance of the system measured in percent word error was: 1.4% for a pattern grammar of perplexity 9, 7.5% for a word-pair grammar of perplexity 62, and 32.4% for a null grammar of perplexity 1000. <<ETX>>
An Architecture-Independent Analysis of False Sharing

Efficiently supporting a shared memory paradigm in a large-scale multiprocessor generally involves some form of data caching. One of the drawbacks of caching shared data is the cost of keeping the multiple copies coherent. One source of unnecessary coherency overhead is caused by a problem known as {\em false sharing. } Unfortunately, the lack of a precise, universally accepted, definition of false sharing hinders research to detect and eliminate the problem. We attempt to detect when such a problem exists and to identify the specific root causes of the problem. To accomplish this, we propose an architecture-independent measure of the false sharing exhibited in a reference trace for cache lines of a specified size. We motivate the importance of a concrete measure by demonstrating that false sharing related coherence overhead comprises a significant portion of the coherence costs in real applications, especially when page-granularity coherence is required. Experiments are performed to show the usefulness of this formulation.
A framework for managing models in nonlinear optimization of computationally expensive functions

One of the most significant problems in the application of standard optimization methods to real-world engineering design problems is that the computation of the objective function often takes so much computer time (sometimes hours) that traditional optimization techniques are not practical. A solution that has long been used in this situation has been to approximate the objective function with something much cheaper to compute, called a “model” (or surrogate), and optimize the model instead of the actual objective function. This simple approach succeeds some of the time, but sometimes it fails because there is not sufficient a priori knowledge to build an adequate model. One way to address this problem is to build the model with whatever a priori knowledge is available, and during the optimization process sample the true objective at selected points and use the results to monitor the progress of the optimization and to adapt the model in the region of interest. We call this approach “model management”. This thesis will build on the fundamental ideas and theory of pattern search optimization methods to develop a rigorous methodology for model management. A general framework for model management algorithms will be presented along with a convergence analysis. A software implementation of the framework, which allows for the reuse of existing modeling and optimization software, has been developed and results for several test problems will be presented. The model management methodology and potential applications in aerospace engineering are the subject of an ongoing collaboration between researchers at Boeing, IBM, Rice and College of William & Mary.
On-board processing satellite network architecture and control study

For satellites to remain a vital part of future national and international communications, system concepts that use their inherent advantages to the fullest must be created. Network architectures that take maximum advantage of satellites equipped with onboard processing are explored. Satellite generations must accommodate various services for which satellites constitute the preferred vehicle of delivery. Such services tend to be those that are widely dispersed and present thin to medium loads to the system. Typical systems considered are thin and medium route telephony, maritime, land and aeronautical radio, VSAT data, low bit rate video teleconferencing, and high bit rate broadcast of high definition video. Delivery of services by TDMA and FDMA multiplexing techniques and combinations of the two for individual and mixed service types are studied. The possibilities offered by onboard circuit switched and packet switched architectures are examined and the results strongly support a preference for the latter. A detailed design architecture encompassing the onboard packet switch and its control, the related demand assigned TDMA burst structures, and destination packet protocols for routing traffic are presented. Fundamental onboard hardware requirements comprising speed, memory size, chip count, and power are estimated. The study concludes with identification of key enabling technologies and identifies a plan to develop a POC model.
Encyclopedia of Communities of Practice in Information and Knowledge Management

Will reading habit influence your life? Many say yes. Reading encyclopedia of communities of practice in information and knowledge management is a good habit; you can develop this habit to be such interesting way. Yeah, reading habit will not only make you have any favourite activity. It will be one of guidance of your life. When reading has become a habit, you will not make it as disturbing activities or as boring activity. You can gain many benefits and importances of reading.
WDM Optical Networks: Concepts, Design, and Algorithms

(NOTE: Each chapter begins with an Introduction and concludes with Problems.) Preface. 1. WDM Technology and Issues in WDM Optical Networks. Optical Networks. Wavelength Division Multiplexing. WDM Optical Networking Evolution. Enabling Technologies for WDM Optical Networks. WDM Optical Network Architectures. Issues in Wavelength Routed Networks. Next-Generation Optical Internet Networks. Book Overview. 2. Wavelength Routing Algorithms. Classification of RWA Algorithms. RWA Algorithms. Fairness and Admission Control. Distributed Control Protocols. Permutation Routing and Wavelength Requirements. Summary. 3. Wavelength-Convertible Networks. Need for Wavelength Converters. Wavelength-Convertible Switch Architectures. Routing in Convertible Networks. Performance Evaluation of Convertible Networks. Networks with Sparse Wavelength Conversion. Converter Placement Problem. Converter Allocation Problem. Summary. 4. Wavelength Rerouting Algorithms. Benefits of Wavelength Rerouting. Issues in Wavelength Rerouting. Lightpath Migration. Rerouting Schemes. Algorithm AG. Algorithm MWPG. Rerouting in WDM Networks with Sparse Wavelength Conversion. Rerouting in Multifiber Networks. Rerouting in Multifiber Unidirectional Ring Networks. Summary. 5. Virtual Topology Design. Virtual Topology Design Problem. Virtual Topology Design Subproblems. Virtual Topology Problem Formulation. Virtual Topology Design Heuristics. Regular Virtual Topology Design. Predetermined Virtual Topology and Lightpath Routes. Predetermined Virtual Topology. Design of Multifiber Networks. Summary. 6. Virtual Topology Reconfiguration. Need for Virtual Topology Reconfiguration. Reconfiguration Due to Traffic Changes. Reconfiguration for Fault Restoration. Summary. 7. Network Survivability and Provisioning. Failures and Recovery. Restoration Schemes. Multiplexing Techniques. Provisioning Restorable Multifiber Networks. Provisioning Restorable Single-Fiber Networks. Backup Multiplexing-Based Routing. Primary-Backup Multiplexing-Based Routing. Distributed Control Protocols. Survivability in WDM Ring Networks. Summary. 8. Optical Multicast Routing. Multicast Routing Problem. Node Architectures. Multicast Tree Generation. Source-Based Tree Generation. Steiner-Based Tree Generation. Virtual Source-Based Trees. Summary. 9. Next-Generation Optical Internet Networks. Optical Circuit Switching. Optical Burst Switching. Optical Packet Switching. MPLS in WDM Networks. Summary. References. Appendices. AWEB RESOURCES LIST. BATM Technology. CSONET Technology. DMPLS Framework. Acronyms. Index.
The Universal Networking Language beyond Machine Translation

The proposed apparatus for surgical treatment of bones and joints comprises at least two pairs of needles designed to be driven through the juxtaposed bones. The tips of the needles of each pair are secured in at least one brace so that each pair of needles forms a rigid system with the brace, said rigid system being secured on the respective bone being juxtaposed. Said rigid systems are interconnected by two distractors each of which is formed as a split member carrying, in the midportion thereof, a system of two guides with two sliders attached to the respective components of the distractors, said guides being perpendicular to each other and also to the longitudinal axes of the distractor components associated therewith, and the sliders are provided with screw actuators serving to propel said sliders along said guides. The apparatus permits correcting lateral and rotary displacements of the juxtaposed bones, ensuring secure fixation thereof in the compression or distraction position.
Power converter design methodology: Uses of multiple objective techniques for optimization of a (42/14 V) buck converter

In this paper we propose to optimize a power converter design following simultaneously three objectives: area, cost in Euro and efficiency. A multiple objectives optimization design approach is proposed and applied to a buck converter (42/14 V, 8A). It combines the characteristics of two most popular techniques: Pareto based approach using genetic algorithm and goal programming method. Optimized design with the proposed approach was compared to designs from single objective optimization with genetic algorithm. Multiple objective solution is the best one, the nearest to the ideal.
Texture Analysis for Urban Pattern Recognition Using Fine-resolution Panchromatic Satellite Imagery

In the framework of the analysis of urban settlement areas using very fine-resolution satellite imagery, a study is presented concerning the discrimination power of textural features with respect to the different terrain patterns present within an urban region. The textural approach chosen in this study is based on the well-known co-occurrence matrix statistical measures derived from the work of Haralick and others in the 1970s. This approach has already been used in the classification of remotely sensed imagery with significant accuracy improvement when compared with the classical radiometric per-pixel approach. However, some problems still exist in the definitions of key parameters for the calculation of the textural measures, as, for example, the pixel displacement vector or the size of the sliding window. In most cases, a specific set of parameters is adopted by referring to a non-explained trial-and-error experience, to subjective thinking, to a generic affirmation led from other experiences in the l.
Graph-theoretic methods for the analysis and synthesis of networked dynamic systems

Graph-theoretic Methods for the Analysis and Synthesis of Networked Dynamic Systems Daniel Zelazo Chair of the Supervisory Committee: Professor Mehran Mesbahi Aeronautics & Astronautics This dissertation aims to develop a graph-centric framework for the analysis and synthesis of certain classes of large-scale systems, namely, those with linear dynamic subsystems that interact with other subsystems via an interconnection topology. Four canonical models for networked dynamic systems (NDS) are derived as the analytic foundation for this work. The role of heterogeneity of the agent dynamics comprising the system is also made explicit. An essential construct used to describe these systems is a new algebraic representation for a graph that we term the edge Laplacian. Equipped with models that explicitly describe the role of the underlying connection topology, we consider the controllability, observability, and performance of the NDS models in terms of the structural properties of the connection graph. Motivated by the analysis results, we also provide various synthesis procedures, including optimal topology design, local inner-loop control for each agent in an NDS, and decentralized control laws for the entire NDS.