Miracle-dz/UniFAR-FTUs huggingface dataset:
Object‐Oriented Programming of Optimizers – Examples in Scilab

Optimization algorithms are generally implemented following a functional paradigm that places the optimization method at the top of the hierarchy. Consider for instance the package Scilab [CAM 06], where an objective function f is optimized by a single call to a procedure that performs the whole optimization process, without any interference of the user:-> [yopt, xopt] = optim(f, x0) Remark – Objective functions and constraints are calculated from the outputs of a (programming) function or an external software, both of which we call simulators. To keep the text readable, the words " objective function " and " simulator " are used here as a generalization of objective functions and constraints. The ideas presented also apply to constraints and multiple objectives. Such a structure turns out to be very restrictive to implement more versatile strategies , such as changing the optimizer or f during the optimization, which may be needed, e.g., to couple local and global optimizers (e.g., [HAR 05]) or to replace high fidelity simulations by metamodels (see Chapter 5).
A Novel Word Sense Disambiguation Algorithm Based on Semi-Supervised Statistical Learning

Statistical learning theory is a framework drawing from the fields of statistics and functional analysis . It provides a strong theoretical foundation for machine learning problems in the system of finite sample case. Word sense disambiguation (WSD) is a fundamental task in natural language processing to identify which sense of a word is used in a sentence, when the word has multiple meanings. At present, the mainstream studies of word sense disambiguation focus on the use of a variety of statistical machine learning techniques. But it difficult to obtain high quality labeled data. To solve the problem, we proposed a novel word sense disambiguation algorithm based on semi-supervised statistical learning in this paper. Firstly, an initial classifier with a certain accuracy rate was constructed based on small-scale labeled data. Then we extend the train data using a variety of threshold. The experiment results show the proposed method has a higher performance for word sense disambiguation.
Part-Task Training for Tracking and Manual Control

Part-task training was defined as practice on some set of components of the whole task as a prelude to performance of the whole task. Part-task procedures are intended to improve learning efficiency and to reduce costs. Our review focused on the instruction of tracking skills for manual control. Transfer of training was emphasized and crucial features of the methodology and of means of assessing transfer were discussed. The part-task procedures of segmentation, fractionation, and simplification were explained, and procedures for reintegrating parts into the whole task were summarized.
Fingerprinting Reverse Proxies Using Timing Analysis of TCP Flows

Abstract : Reverse proxy servers are valuable assets to defend outside hosts from seeing the internal network structure upon which the reverse proxy is serving. They are frequently used to protect valuable files, systems, and internal users from external users while still providing services to outside hosts. Another aspect of reverse proxies is that they can be installed remotely by malicious actors onto compromised machines in order to service malicious content while masking where the content is truly hosted. Reverse proxies interact over the HyperText Transfer Protocol (HTTP), which is delivered via the Transmission Control Protocol (TCP). TCP flows provide various details regarding connections between an end host and a server. One such detail is the timestamp of each packet delivery. Concurrent timestamps may be used to calculate round trip times with some scrutiny. Previous work in timing analysis suggests that active HTTP probes to servers can be analyzed at the originating host in order to classify servers as reverse proxies or otherwise. We collect TCP session data from a variety of global vantage points, actively probing a list of servers with a goal of developing an effective classifier to discern whether each server is a reverse proxy or not based on the timing of packet round trip times.
Energy Efficient and High Performance Scheduling Algorithm for Grid Computing

Grid computing is an epitome that furnishes seamless access to widely distributed resources for solving the big computing applications. Large amount of power consumption in grid computing infrastructure is the main concern because it conducing high operational costs and carbon emission to the environment. To reduce the power consumption without degrading the performance is the main challenge of grid computing. In this paper we present a scheduling algorithm which focuses on simultaneous optimization of both energy consumption and performance. We take an energy aware layered architecture in which Task analyzer (layer 1) analyses & sort the tasks on the basis of their complexities and dependencies then Provisioning Manager (layer 2) provisions the resources and tasks on the basis of energy and performance. Then Scheduler (layer 3) schedules the tasks on the resources in accordance of EEHP algorithm. We have validated our approach by conducting an experiment using the Gridsim toolkit. The results demonstrate that a large amount of energy can be saved without degrading the performance.
Radio propagation studies in a small city for universal portable communications

Time-delay spread and signal level measurements were performed in the streets of a small city at 850 MHz. The maximum root mean square (RMS) time-delay spread observed was 640 ns. However, this dropped to 330 ns for cell radii of 150 m, which is considered a likely size for personal communications systems. RMS delay spread was under 110 ns for cell radii under 75 m or where there was a strong line-of-sight path. When both the transmitter and receiver were on the same road, received power levels followed a two-path model, together with about 0.02 dB/m additional attenuation. A weak but consistent relationship of a decade of increase in RMS time-delay spread for about an 80 dB decrease in received power levels was also found at this site. <<ETX>>
Digital Image Processing Algorithms and Applications

From the Publisher: Digital data acquired by scanners, radar systems, and digital cameras are typically computer processed to produce images through digital image processing. Through various techniques employing image processing algorithms, digital images can be enhanced for viewing and human interpretation. This book provides readers with a complete library of algorithms for digital image processing, coding, and analysis. Reviewing all facets of the technology, it is supplemented with an ftp site containing detailed lab exercises, PDF transparencies, and source code (all algorithms are presented in C-code).
Geçmişten Günümüze Gerçeküstücülük / Surrealism: Past and Present

Modernizm ile iliskilendirilen en onemli akimlardan biri olan ve iki dunya savasi arasinda ortaya cikan gercekustuculuk 1940’li yillarda orgutlu bir akim olarak etkisini giderek kaybetmistir. Oysa gunumuzde gercekustucu terimi pek cok alanda yayginca kullanilmaktadir. Gecmisten gunumuze gercekustuculugun izini surdugumuzde cikisindan yuzyila yakin bir zaman sonra bile akimin bilincalti gercekliginin ifadesi temeline dayanan ozu, sanat ve edebiyatin yaninda gorsellige dayali pek cok alanda hala hukmunu surmektedir. Bu makalenin amaci, once gercekustuculugun ortaya cikisinin ardindaki sartlara ve gelisimine bir goz atip, gercekustucu ozun gunumuzde ifade buldugu moda, tiyatro ve sinema gibi cesitli kulturel alanlar incelenerek akimin tarihsel yolculugunda burundugu bicimler ve ona getirilen elestiriler ortaya konacaktir. Bu calisma boylelikle akimin cagimiz kulturunde nasil sunuldugu ve algilandigi hakkinda fikir vermeyi amaclamaktadir. Anahtar Kelimeler : Gercekustuculuk, Dadacilik, Andre Breton, Gorsel Sanatlarda Gercekustuculuk Abstract: Surrealism, one of the most important movements identified with modernism and one that emerged between the two world wars, gradually disappeared as an organised movement in the 1940s. However, the term is widely used in various fields today. When we trace surrealism from the past to the present, it is clear that even after almost a century the movement’s gist which is based on expressing the subconscious reality prevails in arts and literature as well as many different areas that depend on visuality. The purpose of this article is to initially take a look at the conditions behind the emergence of the movement and at its development; to examine several cultural areas such as fashion, theatre and cinema through which the surrealist gist finds expression; and to present the numerous guises of surrealism as well as the criticism directed at it. In doing so, this study aims to form an idea about how the movement is both presented and perceived in today’s world. Keywords : Surrealism, Dadaism, Andre Breton, Surrealism in Visual Arts Makale Gelis Tarihi: 06.03. 2016 Makale Kabul Tarihi: 21.06. 2016
Amant Alterna Camenae: Vergil’s Third Eclogue at the Dawn of Roman Literary History

summary: In Eclogue 3, Vergil flags the rough verses of his quarreling shepherds as alterna, evoking similar songs in aetiologies of early drama in the Georgics, in Livy, and in Horace. These later treatments often set early Italian practices against their foreign (especially Greek) counterparts to interrogate contemporary literary and social concerns. I argue that Eclogue 3—albeit with pastoral obliqueness—does the same, adumbrating a discomfort with indigenous Italian coarseness. My conclusion reassesses the significance of Palaemon’s judgment (e.g., his award of the uitula to both herdsmen) in the context of Roman literary history.
A Rate-Adaptive MAC Protocol for Wireless Networks

Wireless local-area networks are becoming increasingly popular. This is due, in part, to the recent availability of devices capable of communicating at data rates approaching that of conventional wired networks. These high rates are made possible through new modulation and coding techniques that dramatically increase bandwidth efficiency. However, maintaining reliable communication at higher data rates requires more signal power. Consequently, wireless devices often support multiple data rates, providing the user the ability to choose the rate that best suits their application. Alternatively, an automatic rate adaption mechanism may be used. Rate adaption is the process of automatically selecting the rate that gives the optimum throughput for the channel conditions. Although rate adaption mechanisms for cellular wireless networks have been studied at length, few have been proposed for wireless local-area networks. This paper presents one such mechanism: a rate adaptive MAC protocol based on the RTS/CTS collision avoidance handshake, called the Receiver-Based AutoRate (RBAR) protocol. The protocol is unique in that the rate adaption mechanism is located on the receiver, instead of the sender. Simulation results of an implementation of RBAR into IEEE 802.11 show that this arrangement performs well, in comparison to an existing protocol.
Height estimation from monocular image sequences using dynamic programming with explicit occlusions

In this study, the authors propose a novel algorithm to estimate the heights of objects from monocular aerial images taken from mobile platforms such as unmanned aerial vehicles and small airplanes. Sequential images captured by a single camera mounted on a mobile platform contain 3D information of objects. In this study, the authors propose to use illumination normalisation to reduce illumination variations and to use at least two objects with known distances to accurately estimate the camera focal length. The authors also propose a novel stereo matching algorithm using dynamic programming with explicit occlusion modelling to recover depth information in occluded regions and to preserve depth discontinuity. As a result, the authors are able to reliably estimate the heights of objects in or close to power line corridors. Our experiments show that the proposed algorithm can estimate the heights of trees and power poles from aerial images with average errors of 1.8 and 1.1 m, respectively, when the flight height is in the range between 230 and 280 m above ground level.
Detection of Cross-Site Scripting Using Web Proxy

This research proposes the detection of cross-site scripting in web application by using web proxy during runtime on a client side. Cross-site scripting is the top three security problems of web application. Most solutions detected and solved the problem on a server side. However, users do not have authority to edit anything on the server. Proposed application shows the risk of cross-site scripting. Users have to decide to agree or to ignore, in order to visit the web application. The experiment verifies that the application detects interesting patterns with few overhead.
Intelligent Behavior as an Adaptation to the Task Environment

As research in artificial intelligence focuses on increasingly complex task domains, a key question to be resolved is how to design a system that can efficiently acquire knowledge and gracefully adapt its behavior in an uncertain environment. This dissertation argues that examining more closely the way animate systems cope with real-world environments can provide valuable insights about the structural requirements for intelligent behavior. Accordingly, a class of simulated environments is designed that embodies many of the important functional properties characteristic of natural environments. A new type of adaptive system is then defined that uses pattern-directed, rule-based processing to cope with uncertain information. As a rule-based system, the system presented here is notable in that several rules can be active at once and there are no fixed priorities determining the order in which rules can be activated. Moreover, the syntax of each rule is simple enough to make a powerful learning heuristic applicable--one that is provably more efficient than the techniques used in most other adaptive rule-based systems. A simple version of the adaptive system is implemented as a hypothetical organism having to locate resources and avoid noxious stimuli by generating temporal sequences of actions in a simulated environment. Simulation results show that the naive organism quickly acquires the knowledge required to function effectively. Further experiments show that the system is capable of discriminating a large class of schematic patterns; and, that prior learning experiences transfer to novel situations. The results presented here demonstrate that activity in a collection of simple computational elements--operating in parallel and activated stochastically--can be orchestrated to produce reliable behavior in a challenging environment. The system touches on several issues related to cognitive functioning such as the generic representation of objects and the management of limited processing resources. These issues have been addressed in a way that is computationally feasible and that allows for rigorous testing.
Robust decentralized stabilization of thermal-power plants

This paper develops a robust decentralized stabilization method of thermal-power plants using linear matrix inequalities (LMIs). This method guarantees robust stability and provides /spl Hscr/;/sub /spl infin// rejection of time-varying and norm-bounded parametric uncertainties. It consists of an observer in each control channel, which includes estimates of the controls in the other channels and of the worst disturbance as determined by a state-feedback /spl Hscr/;/sub /spl infin// solution. The observer gains are computed using LMIs. Results of simulation studies show the efficiency of the developed method.
Leaky Wave Antennas: Theory and Design

We review old and recent developments on leaky wave antenna theory and design. A leaky wave is treated mathematically as a complex plane wave and the radiation pattern is derived in terms of the complex propagation constant. Several leaky wave antenna structures are introduced and analyzed. An example of a one dimensional leaky wave antenna is a planar surface waveguide with a partially reflecting screen (PRS) made of periodic thin metal strips placed on the dielectric /air interface. This particular configuration has been treated theoretically and experimentally by the present authors. Radiation occurs in this antenna by the spatial harmonic mode with n= -1. The two dimensional (2-D) leaky wave structures depend on radially travelling waves and they produce pencil beams in the broadside direction and conical beams otherwise. Examples of such antennas include a stack of dielectric layers of contrasting alternate high/low permittivities. Results obtained on an antenna of this type are presented as well as some results on new types of planar structures. Future trends and applications for these type of antennas are also featured.
A clutter metric based on texture

The authors report the statistical analysis of infrared scenes containing a military ground vehicle. The purpose is to model the behavior of clutter as well as test the robustness of the present definition of clutter through computer simulation. Both variance based and texture based clutter metrics are compared. The authors analyzed both cluttered and non-cluttered scenes. <<ETX>>
Detection and tracking vehicles using a zoom camera over a pan-and-tilt unit

The concern about safety in mobile vehicles and means of transport normally used by people has increased considerably in last decades. Different sensorial systems have been developed and improved in order to save lives, inside vehicles and outside them. In this way, imaging and vision systems can be considered to increase the visibility and detect, fix or mobile vehicles/obstacles from a moving vehicle or static/strategic position. There are different approaches to capture an image sequence from a camera and analyze them. In this paper, zoom cameras are used to improve the safety of transport systems. Having calibrated the zoom camera the goal is make measurements from far away obstacles and mobiles, increasing the precision and reliability of conventional visual systems made up of cameras with fixed lenses, fixed resolution. Besides, the zoom camera is mounted over a pan-tilt unit that gives the device the possibility to focus on different region of interest. The whole imaging system is also calibrated to reference its measurements to the global reference system.
PERFORMANCE ENHANCEMENT OF OFDM IN PAPR REDUCTION USING NEW COMPANDING TRANSFORM AND ADAPTIVE AC EXTENSION ALGORITHM FOR NEXT GENERATION NETWORKSPERFORMANCE ENHANCEMENT OF OFDM IN PAPR REDUCTION USING NEW COMPANDING TRANSFORM AND ADAPTIVE AC EXTENSION ALGORITHM FOR NEXT GENERATION NETWORKS

This paper presents a new hybrid PAPR reduction technique for the OFDM signal, which combines a multiple symbol representations method with a signal clipping method. The clipping method is a nonlinear PAPR reduction scheme, where the amplitude of the signal is limited to a given threshold. Considering the fact that the signal must be interpolated before A/D conversion, a variety of clipping methods has been proposed. Some methods suggest the clipping before interpolation, having the disadvantage of the peaks re-growth. Other methods contributed that the clipping after interpolation, having the disadvantage of out-of-band power production. In order to overcome this problem different filtering techniques have been proposed. Filtering can also cause peak re-growth, but less than the clipping before interpolation. Another clipping technique supposes that only subcarriers having the highest phase difference between the original signal and its clipped variant will be changed. This is the case of the partial clipping method. To further reduce the PAPR, the dynamic of the clipped signal can be compressed. Linear methods like partial transmit sequence or selective mapping has been proposed for the reduction of PAPR as well. Another PAPR reduction method is the tone reservation. It uses tones on which no data is sent to reduce the transmitted signal peaks. Derivatives of this method with lower computation complexity and improved performance have been proposed: One-Tone One-Peak and one by-one iteration. A similar PAPR reduction method is the multiple symbol representations, where alternative signalling points are used to represent one symbol. The simulation results highlight the advantages of the proposed PAPR reduction method.
Decision of image watermarking strength based on artificial neural-networks

Digital watermarking is a new technique for digital multimedia copyright protection. The robustness and the imperceptibility are the basic requirements of the digital watermark. The key factor that affects both the robustness and the imperceptibility of the digital watermark is the watermarking strength. In this paper, artificial neural network (ANN) is used to model human visual system (HVS) and an ANN-based image-adaptive method for deciding watermarking strength for image DCT coefficients is presented. The experimental results show that the method can increase the watermarking strength so that the robustness of digital watermark is enhanced and that the method has very good adaptability.
Tone Sandhi: Patterns across Chinese Dialects

Preface Notational conventions 1. Setting the stage 2. Tonal representation and tonal processes 3. Directionality and interacting sandhi processes I 4. Directionality and interacting sandhi processes II 5. From base tones to sandhi forms: a constraint-based analysis 6. From tone to accent 7. Stress-foot as sandhi domain I 8. Stress-foot as sandhi domain II 9. Minimal rhythmic unit as obligatory sandhi domain 10. Phonological phrase as a sandhi domain 11. From tone to intonation Concluding remarks Bibliographical appendix: tone sandhi across Chinese dialects References Subject index Author index.
A statistical method for syntactic dialectometry

This dissertation establishes the utility and reliability of a statistical distance measure for syntactic dialectometry, expanding dialectometry’s methods to include syntax as well as phonology and the lexicon. It establishes the measure’s reliability by comparing its results to those of dialectology and phonological dialectometry on Swedish dialects, as well as evaluating variant parameter settings. The research questions of this dissertation are (1) whether a statistical measure of syntax for dialectometry will reproduce the results of syntactic dialectology and phonological dialectometry and (2) what parameter settings produce results most similar to dialectology’s results. Statistical dialect distance is defined in two parts: a feature set that captures linguistic properties and a measure of dissimilarity that combines two sites’ features into a single number. This dissertation uses feature sets from previous work: trigrams (Nerbonne & Wiersma, 2006) and leaf-ancestor paths (Sanders, 2007). In addition, it introduces two other feature sets: leaf-head paths based on dependencies and phrase-structure rules. This dissertation uses the measure R (Nerbonne & Wiersma 2006) as well as measures from information theory: Kullback-Leibler and Jensen-Shannon divergences and cosine similarity. This statistical distance is tested on the Swediasyn, a corpus of interviews recorded in villages throughout Sweden. After the distance was measured, the distances were processed and then compared with existing dialectology results. Unlike previous work, significant distances were measured between dialect corpora in this dissertation. When these distances are mapped to the geography of Sweden, they reproduce the traditional dialect regions of Sweden. There is weak correlation with geographic distance, but good agreement between dialectometric syntactic and phonological distance. Comparing specific dialect features with those of dialectology is inconclusive; better comparison methods are needed.