Miracle-dz/UniFAR-FTUs huggingface dataset:
A fundamental study of a thin λ/4 wave absorber using FSS technology

The λ/4 wave absorber is expected to be useful for indoor wireless LAN because of its simple structure and ease of design. However, this type of wave absorber has the deficiency that the thickness cannot be less than 1/4 of the wavelength within the spacer used. In this paper, an FSS (Frequency Selective Surface) is inserted in tandem with a resistive film as an absorbing film in the spacer section of the λ/4 wave absorber. By varying the phase within the spacer, thickness reduction of the absorber is attempted. In this case, it is necessary to understand the impedance of the FSS at the design frequency. In this paper, the impedance is first derived by the FDTD method. Substituting this result into an electric equivalent circuit, the insertion position of the FSS and the surface resistivity of the resistive film maximizing the absorbing characteristic are determined. A thin λ/4 wave absorber of this type is designed and fabricated and the absorption is measured. It is confirmed that a λ/4 wave absorber can be realized with approximately half the conventional thickness. Basic data on the frequency characteristics and angular dependence of this type of absorber can be obtained. © 2004 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 87(11): 77–86, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.10180
Obtaining Information while Preserving Privacy: A Markov Perturbation Method for Tabular Data

specified level of confidentiality protection The gen- item era approach is to provide disclosure-limited data that maximize their statistical utility subject to confidential- Figure Characterization of Data Users Knowledge ity constraints Disclosure limitation based on Markov chain methods that respect the underlying uncertainty in real data is examined For use with categorical data tables method called Markov perturbation is proposed II Dt as an extension of the PRAM method of Kooiman Confidential
Automatic Encoding and Language Detection in the GSDL

Automatic detection of encoding and language of the text is part of the Greenstone Digital Library Software (GSDL) for building and distributing digital collections. It is developed by the University of Waikato (New Zealand) in cooperation with UNESCO. The automatic encoding and language detection in Slavic languages is difficult and it sometimes fails. The aim is to detect cases of failure. The automatic detection in the GSDL is based on n-grams method. The most frequent n-grams for Czech are presented. The whole process of automatic detection in the GSDL is described. The input documents to test collections are plain texts encoded in ISO-8859-1, ISO-8859-2 and Windows-1250. We manually evaluated the quality of automatic detection. To the causes of errors belong the improper language model predominance and the incorrect switch to Windows-1250. We carried out further tests on documents that were more complex. We devote them a separate article.
Modeling and Performance Simulation of the Mass Storage Network Environment

This paper describes the application of modeling and simulation in evaluating and predicting the performance of the mass storage network environment. Network traffic is generated to mimic the realistic pattern of file transfer, electronic mail, and web browsing. The behavior and performance of the mass storage network and a typical client-server Local Area Network (LAN) are investigated by modeling and simulation. Performance characteristics in throughput and delay demonstrate the important role of modeling and simulation in network engineering and capacity planning.
Timing Models for MOS Circuits

Performance is an important aspect of integrated circuit design, and depends in part on the speed of the underlying circuits. This thesis presents a new method of analyzing MOS circuit delay, based on a single-time-constant approximation. The timing models characterize the circuit by a single parameter, which depends on the resistance and capacitance of the circuit elements. To ensure the single- time-constant approximation is valid for a particular circuit, the timing models provide both an estimate and bounds for the output waveform. For circuits where the bounds are poor, an improved timing model is derived. These simple models provide insight about circuit performance issues, as well as determining the circuit delay. The timing models are first developed for linear networks and then are extended to model MOS circuits driven by a step input. By using the single-time-constant approximation, the output waveform of a complex MOS circuit can be modelled by the output of a circuit consisting of a single MOS transistor and a single capacitor. Finally, a new circuit model of a gate is used to derive the output waveform of a circuit driven by an arbitrary input. The resulting timing model does not depend strongly on the shape of the input: the output waveform only depends on the input''s slope at the gate''s switching voltage.
Efficient Multi-Target Tracking using graphical models

The objective of this thesis is to develop a new framework for Multi-Target Tracking (MTT) algorithms that are distinguished by the use of statistical machine learning techniques. MTT is a crucial problem for many important practical applications such as military surveillance. Despite being a well-studied research problem, MTT remains challenging, mostly because of the challenges of computational complexity faced by current algorithms. Taking a very different approach from any existing MTT algorithms, we use the formalism of graphical models to model the MTT problem according to its probabilistic structure, and subsequently develop efficient, approximate message passing algorithms to solve the MTT problem. Our modeling approach is able to take into account issues such as false alarms and missed detections. Although exact inference is intractable in graphs with a mix of both discrete and continuous random variables, such as the ones for MTT, our message passing algorithms utilize efficient particle reduction techniques to make approximate inference tractable on these graphs. Experimental results show that our approach, while maintaining acceptable tracking quality, leads to linear running time complexity with respect to the duration of the tracking window. Moreover, our results demonstrate that, with the graphical model structure, our approach can easily handle special situations, such as out-of-sequence observations and track stitching. Thesis Supervisor: Alan S. Willsky Title: Professor of Electrical Engineering
Hacia una síntesis concatenativa de alta calidad para aplicaciones de conversión texto-habla.

Este articulo describe nuevas lineas de investigacion referentes a la sintesis concatenativa para la conversion texto habla. La tecnica TD-PSOLA supuso un salto importante en cuanto a la mejora de la calidad de los sistemas anteriores. Ha sido un metodo valido para muchas aplicaciones pero es insuficiente para las nuevas necesidades en el campo de las telecomunicaciones, donde se requiere una sintesis mas natural y agradable. Se hace referencia a nuevos enfoques de los sistemas de conversion texto habla, especialmente en dos aspectos, el metodo y la estrategia de sintesis. Respecto al metodo de sintesis se explican mejoras conseguidas con modificaciones efectuadas sobre el TDPSOLA. En referencia a la estrategia de sintesis se describen las lineas de investigacion actuales haciendo una especial mencion de la necesidad de disponer de herramientas automaticas de segmentacion y etiquetado de bases de datos de voz.
Dynamic Server Selection using Bandwidth Probing in Wide-Area Networks

Abstract Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server. Prior work has generally assumed that assignment to be static. In contrast, we propose dynamic server selection, and show that it enables application-level congestion avoidance. To make dynamic server selection practical, we demonstrate the use of three tools. In addition to direct measurements of round-trip latency, we introduce and validate two new tools: bprobe, which estimates the maximum possible bandwidth along a given path; and cprobe, which estimates the current congestion along a path. Using these tools we demonstrate dynamic server selection and compare it to previous static approaches. We show that dynamic server selection consistently outperforms static policies by as much as 50%. Furthermore, we demonstrate the importance of each of our tools in performing dynamic server selection.
Structural Reliability: Analysis and Prediction

Measures of Structural Reliability. Structural Reliability Assessment. Integration and Simulation Methods. Second-Moment and Transformation Methods. Reliability of Structural Systems. Time Dependent Reliability. Load and Load Effect Modelling. Resistance Modelling. Codes and Structural Reliability. Probabilistic Evaluation of Existing Structures. Appendices. References. Index.
A novel radix-2 pipeline architecture for the computation of the DFT

A radix-two discrete Fourier transform (DFT) algorithm is derived which supports a pipeline architecture realization. The amount of necessary multipliers for the pipeline structure can be reduced by a factor up to four compared to the conventional and most often used radix-2 pipeline-FFT. This reduction is obtained without sacrificing computational speed. Several applications of digital signal processing require dedicated hardware to compute the DFT and/or its inverse in order to cope with the fast processing speeds which are needed. <<ETX>>
APP - ARCHITECTURE FOR PIPELINED PROCESSING

This paper presents an architecture for XML processing applications, defined by a set of transformations preformed over complex XML contents. The architecture is composed by stages (logical separation of concerns), each stage is defined by a set of pipelines (independent processing of contents), and each pipeline is a sequence of processing components (smallsize units that perform a single transformation over a subset of the content). These components are registered with metadata about which subset of the content they will process. This way, the application pipeline configuration does not have to define which subsets are being processed, hiding details from the application configuration steps, thus simplifying the creation of complex XML-based applications. A case study is presented.
Automated specification-based graphical user interface testing

The event-based nature of graphical user interfaces, or GUIs, increases the difficulty of testing software applications. Automating this process reduces not only the time to test, but also the work involved in preparing the tests to be run. However, some form of specification is required for this automation. TUIL, or Testable User Interface Language, is a lightweight prototype specification language based on XML that was created to specify desktop, widget-based application GUIs. TUIDE, or Testable User Interface Development Environment, is a prototype Java application that is used to handle the testing automation processes, as well as mock-up TUIL specifications. A small Java application, containing four dialogs, is created to prove that the TUIL language and TUIDE processing can not only find errors within faulty versions of it, but also generate reasonably accurate mock-ups of the dialog GUIs. The findings from this testing are positive.
On the effect of the nonlinearity of the sigmoid function in artificial neural network classifiers

Despite a considerable amount of recent directed towards pattern recognition applications of the artificial neural networks (ANNs), little quantitative information concerning the nonlinearity of the sigmoid function is available to a designer. In this paper, the authors study the effect of the nonlinearity of the sigmoid function on the generalization capability of the ANN classifiers trained with the backpropagation algorithm. Experimental results show that like the case of the network size, there exists the optimal degree of the nonlinearity for a particular problem.
Neural network arbitration for edge detection

Our proposal is that different edge detection techniques be utilised in parallel, for generalised edge detection of different image types. This allows the attainment of several edge maps containing different features. From the various edge maps, edges are arbitrated in order to perform the merging of the different maps. The arbitration is done using a perceptron neural network. To overcome the increased computing time, implementation is being performed on a multi-transputer array, using the inherent parallelism of the techniques involved. In this paper, we present examples that show the performance of the neural arbitration of different techniques along with a comparison with the individual techniques alone. These are computed and calculated using test patterns which allow for easy quantification.
Sensorless vector and direct torque control

1. Introduction 2. The space-phasor model of A.C. machines 3. Vector and direct torque control of synchronous machines 4. Vector and direct torque control of induction machines 5. Torque control of switched reluctance motors 6. Effects of magnetic saturation 7. Artificial intelligence-based steady-state and transient analysis of electrical machines, estimators 8. Self-commissioning Index
The role of cognitive task analysis in the application of predictive models of human performance

Predictive modeling of human performance as long been applied in human factors engineering. In the meantime, computational cognitive architecture models have developed a theoretically coherent and sophisticated basis for advanced predictive modeling of human performance. Key is a distinction between fixed task-independent architectural mechanisms and task-specific strategies that control the architecture. Applying the new cognitive modeling approaches to system design problems requires a method for identifying the task strategy, but new results suggest that humans choose task strategies that incorporate optional features that are not based on either architectural constraints or task demands. These optional features strongly influence performance, but cannot be identified by conventional task analysis methods. A heuristic is presented for obtained useful task performance predictions based on characterizing the fast-possible and slowest-reasonable combinations of optional task strategy aspects. The heuristic is illustrated with results from a somewhat complex laboratory task.
Implementation of a new sliding mode control for SCARA robot

This paper addresses the implementation of a new sliding mode control algorithm for a high speed/precision controller which is robust against the variation of robot parameters and load. The nonlinear dynamics become prominent in high speed operation but can hardly be modeled accurately. Therefore, we consider the nonlinear inertia, Coriolis and centrifugal force terms as external disturbances. This approach is applied to sliding mode control to obtain switching control inputs. The control input obtained satisfy the existence condition of sliding mode. A dynamic simulator has been developed and used to evaluate the proposed algorithm for SCARA robots. Simulated results show that the proposed algorithm is robust against disturbances and reduces the amount of chattering. An experiment was performed to demonstrate the simulated results in a real system.
A survey on breast cancer analysis using data mining techniques

Data mining (DM) comprises the core algorithms that enable to gain fundamental insights and knowledge from massive data. In fact, data mining is a part of a larger knowledge discovery process. One of the new researches in data mining application involves analyzing Breast cancer, which are the deadliest disease and most common of all cancers in the leading cause of cancer deaths in women worldwide. Among the various DM techniques, classification plays a vital role in DM research. Breast cancer diagnosis and prognosis are two medical applications pose a great challenge to the researchers in medical field. This survey work analyses the various review and technical articles on breast cancer diagnosis. The main goal of this research is to explore the overview of the current research being carried out using the data mining techniques to enhance the breast cancer diagnosis. Particularly, this survey discusses about use of the classification algorithms ID3 and C4.5 in breast cancer analysis.
SAOC FOR GAMING - THE UPCOMING MPEG STANDARD ON PARAMETRIC OBJECT BASED AUDIO CODING

Following the current trend of employing parametric enhancement tools for increased coding and spatial rendering efficiency, MPEG audio pursues a standardization activity on Spatial Audio Object Coding (SAOC) technology. The SAOC system extends the MPEG Surround standard by exploiting its coding efficiency. Moreover, the SAOC technology introduces user-controllable rendering functionality together with flexible choice of various playback configurations. These aspects are of potential interest for a large range of gaming applications that will benefit from the efficient coding and interactive rendering. Although SAOC targets many different application scenarios, besides describing the basic SAOC architecture and the manifold of enhancement tools, this paper will focus on the relevance for gaming applications.
Voice activity detection based on short-time energy and noise spectrum adaptation

On the basis of the short-time energy of speech signals and the efficient method of noise statistics adaptation estimation proposed by Sohn et al.(1998), a new highly robust voice activity detection (VAD) rule for any kind of environmental noise is proposed in this paper. The accurate recognition rate of the new method is about five percent higher than that of Sohn's method on average, and also has the same merit of tracking the noise spectrum properly as in Sohn's method. Simulation experiments show that the new method is an efficient and robust voice activity detector.
Meaningful Object Extraction for Booking Website

This paper attempts to propose a novel approach that can obtain the interested data from extracting the web objects. Through the object extraction and analyzing the gaze distributions, the meaningful object on webpage can be acquired in corresponding to the viewer’s real gaze behavior. In order to locate the meaningful object on webpage, the proposed approach includes two parts: the interested object extraction and the mapping model of the meaningful object content. In addition, the proposed method can overcome the content uncertainty caused by the mouse events when the audience scrolls or clicks on the mouse. The experimental results show that the proposed approach returns a good performance.
Toward automatic identification of the language of an utterance. I. Preliminary methodological con

A method of preparation of a ternary or quaternary alloy composed of the elements A1 A2 A3 (ternary alloy) or the elements A1 A2 A3 A4 (quaternary alloy) consists of the successive steps of preparation of one or a number of binary alloys such as A1A2, purification of the binary alloys by zone melting, placing of the binary alloy or alloys which are in the solid state together with the other constituent elements of the alloy within a container in the presence of a solvent, crystallization of the ternary or quaternary alloy by melting all the elements within the container and recrystallization in the presence of the solvent.
A New Routing Protocol for Heterogeneous Mobile Ad Hoc Networks

– Each Mobile Ad hoc Network (MANET) consists of some independent system contacting with each other wirelessly. Most of routing protocols work well with this hypothesis, that the network is homogeneous and they are not appropriate for Heterogeneous Mobile Ad hoc Networks (HMANET) and they also lose their efficiency in such networks. Homogeneous Mobile Ad hoc Networks are networks in which all nodes have the same sources and capabilities, and this is in contrast with nature of MANETs because nodes are independent and have different sources, capabilities (such as battery lifetime, bandwidth, transmission range,.) and mobility. In this paper, we improve one of proactive routing protocols named OLSR (Optimized Link State Routing Protocol) so that this protocol becomes appropriate for HMANET and do not lose its capability and scalability. In our method, we suggest an algorithm which uses all existing links (unidirectional, bidirectional ) in a network that works within OLSR routing protocol and this causes better use of sources and minimizes MPR (Multipoint Relays) set
Framework-Based Software Development in C++

Preface. I. INTRODUCTION. 1. Overview of Methodology. What Is a Framework? What Are the Benefits of Using Frameworks? What Is the Difference Between a Horizontal and Vertical Framework? What Is Framework-Based Software Development? What Is the Object Infrastructure? 2. The Standard Template Library (STL). Getting Started with STL. The Design of STL. Using the string Class. Using STL Container Classes. Adding Your Own Generic Algorithms. 3. Common Object Request Broker Architecture (CORBA). High-Level Overview. The Marriage Between the WWW and CORBA. Using an ORB-An Informal Description. Using an ORB-The Detailed Steps. CORBA and Frameworks. The Impact of CORBA on Modeling Notation. An Example: Event Notification. Common Object Services. 4. ODMG-93: An Object Database Standard. High-Level Overview. The Role of Object Databases in Frameworks. The Impact of Object Databases on Modeling Notation. Using an ODMG-Compliant Object Database with C++. Example Application Using CORBA and ODMG-93: Security Alarm Reporting. II. METHODOLOGY. 5. Domain Analysis. Steps in Domain Analysis. An Example Domain Analysis for "Mail Order". 6. Framework Design Standard. Introduction to Design Patterns. Catalog of Design Patterns. Design Rules. 7. Framework Design Metrics. Inheritance Depth Metric. Inheritance Width Metric. Size Metrics. Framework Reusefulness Metric. 8. Framework Development Procedures. Designing a Framework. Implementing a Framework. Testing a Framework. Preparing User Documentation. 9. Framework Development Strategies. Creating a Framework Industry. Reengineering the Development Organization. Putting Together an Application Development Team. Putting Together an Infrastructure Group. Evaluating an Off-the-Shelf Framework. The Economics of In-house Framework Development. Setting Up the Ideal Development Environment. The Project Plan for Developing a Framework. Red Flags. III. EXAMPLE FRAMEWORKS. 10. A Horizontal Framework for Workflow. Facet Analysis: Workflow. Design of the Workflow Framework. Implementation of the Workflow Framework. 11. A Framework for Monitoring Financial Risk. Domain Analysis: Financial Risk Monitoring. Design of the Risk Monitoring Framework. APPENDIX A: STL Lint Program. APPENDIX B: Notation. Bibliography. Index.