Miracle-dz/UniFAR-FTUs huggingface dataset:
FlexCore: Dynamic Virtual Machine Scheduling Using VCPU Ballooning

As multi-core processors become the de-facto configuration in modern computers, the adoption of SMP Virtual Machines(VMs) has been increasing, allowing for more efficient use of computing resources. However,because of existence of schedulers in both the hypervisor and the guest VMs, this creates a new research problem,viz., double scheduling. Although double scheduling may cause many issues including lock-holder preemption,v CPU stacking, CPU fragmentation, and priority inversion, prior approaches have either introduced new problems and/or addressed the problem incompletely. In this paper, we describe the design and implementation of Flex Core,a new scheduling scheme using v CPU ballooning, which dynamically adjusts the number of v CPUs of a VM at runtime. This essentially eliminates unnecessary scheduling in the hypervisor layer, and thus, boosts performance significantly. An evaluation using a complete KVM-based implementation shows that the average performance improvement for PARSEC applications on a 12-core Intel machine is approximately 52.9%, ranging from 35.4% to79.6%.
Fitting the pieces together: system/software analysis and code integration using METAH

Architecture description languages (ADLs) are beginning to address the system as a set of interconnected components subject to an overall execution model. An ADL aimed at a specific domain can give designers a way to check their system against particular properties required by their application. Formal ADLs can also be transformed automatically into executable "glue" code that ties the components together according to the specified connections and execution model. MetaH is an ADL and toolset originally developed to meet the strict requirements of flight control and avionics, including hard realtime, safety, security, fault-tolerance and multiprocessing. However, an increasingly broad range of applications shares these requirements.
Fuzzy theory in frequency hop communication

Fuzzy theory can be used in many fields. There may be two applications of fuzzy theory in frequency hop communications. They are the adaptive fuzzy frequency hopping generator and adaptive frequency hop communications with fuzzy frequency estimation. This paper discusses both of these two applications. For an adaptive fuzzy frequency hopping generator, the fuzzy rules are used in random sequence generation. For adaptive frequency hop communication systems, the fuzzy rules are used to decide if frequency point is healthy or unhealthy.
Coding and scheduling optimization over packet erasure broadcast channels

Throughput and per-packet delay can present strong trade-offs that are important in the cases of delay sensitive applications. In this thesis, we investigate such trade-offs using a random linear network coding scheme for one or more receivers in single hop wireless packet erasure broadcast channels. We capture the delay sensitivities across different types of network applications using a class of delay metrics based on the norms of packet arrival times. With these delay metrics, we establish a unified framework to characterize the rate and delay requirements of applications and optimize system parameters. In the single receiver case, we demonstrate the trade-off between average packet delay, which we view as the inverse of throughput, and maximum ordered inter-arrival delay for various system parameters. For a single broadcast channel with multiple receivers having different delay constraints and feedback delays, we jointly optimize the coding parameters and time-division scheduling parameters at the transmitters. We formulate the optimization problem as a Generalized Geometric Program (GGP). This approach allows the transmitters to adjust adaptively the coding and scheduling parameters for efficient allocation of network resources under varying delay constraints. In the case where the receivers are served by multiple non-interfering wireless broadcast channels, the same optimization problem is formulated as a Signomial Program, which is NP-hard in general. We provide approximation methods using successive formulation of geometric programs and show the convergence of approximations. Practical issues of implementing proposed coding and optimization scheme on existing layered network architecture are also discussed. Thesis Supervisor: Muriel Medard Title: Professor of Elec. Eng We gratefully acknowledge the funding support from the Air Force Office of Scientific Research (AFOSR) under award No. 016974-002, from France Telecom S.A. under award number: 018499-00 and from BAE Systems National Security Solutions, Inc, under award number: 739532-SLIN 0002.
Internet Management Issues: A Global Perspective

w w w . m ed ia jo ur na l.o rg ‘Management Issues’ arising out of the use of the Internet are addressed from an interdisciplinary perspective in the book ‘Internet Management Issues: Al Global Perspective’, edited by Haynes. To extend the existing discipline of information systems is one major goal of the book. The 19 papers are organized in five sections. As a ‘collection of papers’ the single papers are grouped into the sections but do not follow a continuous thread. While most of the authors are academics coming from the IS field there are papers authored by mathematicians and psychologists as well as two chapters authored by academics from field of philosophy of information technology. As a collection of papers the book is targeted to all readers which are interested in management issues relating to the use of the Internet, academics and students as well as managers and the interested public. While many papers address directly the global perspective others deal with it only very generally. Most of the papers provide beside a thorough literature review and a theoretical analysis a discussion of cases from the real world as well.
A .net based resource sharing framework

This thesis presents an Internet resource sharing architecture . It allows users to access and utilize unused computer resources, such as CPU cycles and storage, without an expert's knowledge. It achieves this by providing a number of abstract services that hide some of the complexity inherent in distributed computing. In recent years, Grid Computing has been proposed as a solution for Internet resource sharing. However, Grid Computing as presently implemented does not address the need of the large majority of the users. In this thesis, we propose a different approach to achieve Internet resource sharing called the Realm. The Realm Framework offers a lightweight layer on top of the Microsoft . Net Framework so that the programs that can be migrated to . Net Framework can also utilize the shared resources through the Realm Framework. By leveraging the Microsoft . Net Framework, the Realm Framework avoids tedious re-working in this fast-paced world of technology by sitting on the top of the full-featured, coherent and up-to-date development platform. The Realm Framework applies current technologies such as Web Services, the Common Language Runtime (CLR) and popular encryption algorithms. In this thesis a versatile runtime system and a set of extension interfaces in C# programming language is developed. The modularized software package offers a layered programming model for distributed-application developers with different levels of proficiency. Two utilities that are helpful for maintaining a distributed system are also developed, namely, a dynamic domain-name based inter-realm communication scheme and a distributed debugger. Examples of applying the Realm Framework to several typical scenarios are shown, including embarrassingly parallel problems that require little communication between computing nodes, parallel computing problems that require intensive message-passing between the computing nodes, and universal storage systems that are based on storage media and the messenger-like applications that require a sophisticated communication scheme. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Power System Analysis

This text is intended for undergraduates studying power system analysis and design. It gives an introduction to fundamental concepts and modern topics with applications to real-world problems. This is the first text in this area to fully integrate MATLAB and SIMULINK throughout. It also provides students with an author-developed POWER TOOLBOX DISK organized to perform analyses and explore power system design issues with ease.
Optimizing locality of data representation in MLP networks

Local learning techniques associated with multilayer perceptron (MLP) networks typically rely on integrating receptive fields into the network model. However, data representation schemes that employ multiple, overlapping receptive fields to preprocess network inputs can be another source of local learning in MLP networks. This paper demonstrates a preprocessing scheme in which a genetic algorithm is used to determine the form and placement of receptive fields in order to optimize locality of representation of MLP network inputs. A performance metric for comparing MLP networks with disparate degrees of freedom is introduced. Both the preprocessing scheme and the proposed metric are demonstrated by using them in the context of predicting the Mackey-Glass chaotic time series. <<ETX>>
An object-oriented OSI event and log manager

This paper presents an object-oriented design and implementation of the OSI model of event and log manager based on the guidelines of definition of managed objects (GDMO) definitions of event reporting management (ERM) and log control function (LCF). The design is based on an object modelling technique (OMT) and implemented using C++ in an OS/2 2.1 environment. The manager was integrated with the XOM and XMP APIs communication infrastructure.
GaIn: un buscador Internet/Intranet avanzado para textos en euskera.

En este articulo se presentan las tareas realizadas para combinar la explotacion de la informacion de la Web y las tecnicas del NLP dando como resultado un buscador avanzado para textos en euskera, todo ello desarrollado dentro del proyecto GaIn financiado parcialmente por la Diputacion Foral de Gipuzkoa y por el programa Universidad-Empresa del Gobierno Vasco (UE-1999-2). Este trabajo ha sido desarrollado por el grupo IxA (ixa.si.ehu.es) de la Universidad del Pais Vasco en colaboracion con el portal Jalgi (www.jalgi.com) de Plazagune S.L. La herramienta realizada es un buscador de Internet/Intranet con su robot, indexador y buscador, que tiene dos modulos de NLP que lo convierten en avanzado: por un lado un identificador de idioma y por otro un lematizador robusto.
Binary Mask for Speech Enhancement

This paper is based on general principle of ideal binary masking. To Improve Intelligibility of the speech Ideal binary masking is used based on noise distortion constraints. A binary mask is designed to retain noise overestimated T-F units while discarding noise underestimated T-F units. Listening tests were conducted to evaluate the new binary mask in terms of intelligibility. An ideal binary mask is a priori defined as a binary matrix where 1 indicates that the target is stronger than the interference within the corresponding time- frequency unit and 0 indicates otherwise. Missing feature methods have been shown to be very successful at compensating for the effects of stationary and non-stationary noise when this mask is computed from a priori knowledge of the SNR of all spectrographic components. Our study, thus, demonstrates that the use of binary masking represents a promising direction for speech enhancement.
Classification of epileptic seizures using accelerometers

Epilepsy is a neurological disorder that affects a large group of people around the world. The research institute IMEGO has developed a hardware setup for measuring and logging acceleration of limbs on patients suffering from epilepsy. Signal analysis methods are applied to the acceleration data to register when a seizure occurs. In this thesis, the existing seizure classification methods are enhanced by studying the time evolution of the acceleration data over time spans of several minutes around each discrete sample point in time. This is achieved by clustering data and examining the cluster transitions between data points that are close in time. In this work several clustering, classification and dimension reduction techniques are presented. Moreover, a pilot study that assesses the performance of the proposed classification method under a wide variety of parameters, input data and data transformations, is implemented. The old classification method that was used prior to this thesis is also evaluated and compared against the new method developed in this thesis. The pilot study shows that the proposed classification method performs better than the method implemented prior to this work. The proposed method performs well on tonicclonic epileptic seizures even with a sporty and active movement background during the measurements. For strictly tonic seizures, however, the pilot study gives no promising results. It seems like the classification methods are not able to distinguish a tonic seizure from normal activity. The optimal parameters of the proposed method seems to differ depending on the kind of seizure and background data that is studied. In a real application, tuning the parameter model for the appropriate patient behavior seems to be necessary for adequate classification performance. During the measurements, acceleration on three limbs were analyzed. The pilot study reveals that in many cases not all three acceleration points are necessary. Which ones are, depends on the patients seizure behavior.
Uso de información morfológica en el alineamiento español-euskera

In this paper we present a preliminary study for the alignment of a Spanish-Basque parallel corpus using a token-based aligner (GIZA++). We have studied several morphological pre-processing alternatives, and achieved 23.76% Alignment Error Rate, with a reduction of 12.48% over the baseline (no pre-processing). The results are comparable to those obtained for others agglutinative languages.
Lung Cancer Data Analysis by k-means and Farthest First Clustering Algorithms

Objective: The objective of this research work is focused on the ethical cluster creation of lung cancer data and analyzed the performance of partition based algorithms. This research work would help the doctors to identify the stages of lung cancer and also enhances the medical care. This work is very convenient to avoid unnecessary biopsy. Methods: Lung Cancer is the form of cancer that has caused the most deaths in both men and women throughout the world. Most of the researchers analyzed the lung cancer dataset using algorithms to find the cluster among the small cell or non-small cell lung cancer in various stages. The very famous two partition based algorithms namely k-Means and FarthestFirst are implemented. A comparative analysis of clustering algorithms is also carried out using two different dataset. The performance of algorithms depends on the time taken to form the estimated clusters. Findings: The performance and cluster formation using the two various kinds of input dataset namely lc.arff, lc.csv are used. The output clusters depends upon the dataset type and algorithms related. The number of initial clusters is chosen by the user. The data points in each cluster are displayed by different colors. The computational complexity is calculated in milliseconds. The k-Means algorithm is efficient for clustering the lung cancer dataset with arff file format. The final outcome of this work is suitable to analyses the behavior of lung cancer in the department of oncology in cancer centers. Our findings are well fit for report preparation and treatment selection of the patients. Application: The created ethical cluster is used for support ingredient of the department of molecular oncology in cancer institution or centers. Ultimate goal of this research work is to find out which type of dataset and algorithm will be most suitable for analysis of lung cancer data.
New results on the reverse link capacity of CDMA cellular networks

The reverse link Erlang capacity of an IS-95 based CDMA system is studied under non-uniform traffic loading conditions. In particular, the variation in the capacity of a center cell surrounded by lightly loaded cells is assessed analytically, and its sensitivity to various factors is discussed. The statistics of the other cell interference factors are obtained, and some numerical results using typical system parameter values are given.
Overview of the Southern African Regional Science Initiative-SAFARI 2000

The Southern African Regional Science Initiative 2000 (SAFARI 2000) is an interdisciplinary science activity designed to increase our understanding of the southern African ecological and climatic systems as a whole, as well as its relationship to hemispheric and global climate. The project involves a confederation of national, regional, and global environmental research activities. NASA, through its EOS, Land Cover and Land Use Change, and Terrestrial Ecology Programs, is supporting several efforts in SAFARI 2000. These include an extensive validation component associated with the launch of the Earth Observing System (EOS) Terra and Landsat 7 platforms in 1999. SAFARI 2000 will address the key linkages between the physical, chemical and biological processes, including those due to human activities, that impact the functioning of the regional biogeophysical system. More specifically, it will help characterize and quantify the aerosol and trace gas sources and sinks, validate models and remote sensing observations of these processes and their systems, and determine the climatic, hydrological, and ecosystem consequences of these processes. Interest in the southern African region by the EOS validation community stems from two basic reasons: (1) there are unique scientific processes in the region which significantly influence climate and global change, and (2) EOS can leverage its validation activities off ongoing scientific investigations in the region, thereby providing maximum scientific return on limited resources.
The Cambridge Handbook of Information and Computer Ethics: Index

Information and Communication Technologies (ICTs) have profoundly changed many aspects of life, including the nature of entertainment, work, communication, education, healthcare, industrial production and business, social relations and conflicts. They have had a radical and widespread impact on our moral lives and hence on contemporary ethical debates. The Cambridge Handbook of Information and Computer Ethics provides an ambitious and authoritative introduction to the field, with discussions of a range of topics including privacy, ownership, freedom of speech, responsibility, technological determinism, the digital divide, cyber warfare, and online pornography. It offers an accessible and thoughtful survey of the transformations brought about by ICTs and their implications for the future of human life and society, for the evaluation of behaviour, and for the evolution of moral values and rights. It will be a valuable book for all who are interested in the ethical aspects of the information society in which we live.
Security in Wireless Ad Hoc and Sensor Networks

About the Authors. Preface. Acknowledgements. List of Acronyms. Part One Wireless Ad Hoc, Sensor and Mesh Networking. 1 Introduction. 1.1 Information Security. 1.2 Scope of the Book. 1.3 Structure of the Book. 1.4 Electronic Resources for the Book. 1.5 Review Questions. 2 Wireless Ad Hoc, Sensor and Mesh Networks. 2.1 Ad Hoc Networks and Applications. 2.2 Sensor and Actuator Networks. 2.3 Mesh Networks. 2.4 Tactical Communications and Networks. 2.5 Factors Influencing the Design of Wireless Ad Hoc, Sensor and Mesh Networks. 6 Review Questions. 3 The Wireless Medium. 3.1 Wireless Channel Fundamentals and Security. 3.2 Advanced Radio Technologies. 3.3 Review Questions. 4 Medium Access and Error Control. 4.1 Medium Access Control. 4.2 Error Control. 4.3 Wireless Metropolitan Area Networks. 4.4 Wireless Local Area Networks. 4.5 Wireless Personal Area Networks. 4.6 Review Questions. 5 Routing. 5.1 Internet Protocol and Mobile IP. 5.2 Routing in Wireless Ad Hoc Networks. 5.3 Routing in Wireless Sensor and Actuator Networks. 5.4 Review Questions. 6 Reliability, Flow and Congestion Control. 6.1 Reliability. 6.2 Flow and Congestion Control. 6.3 Review Questions. 7 Other Challenges and Security Aspects. 7.1 Localization and Positioning. 7.2 Time Synchronization. 7.3 Addressing. 7.4 Data Aggregation and Fusion. 7.5 Data Querying. 7.6 Coverage. 7.7 Mobility Management. 7.8 Cross-layer Design. 7.9 Review Questions. Part Two Security in Wireless Ad Hoc, Sensor and Mesh Networking. 8 Security Attacks in Ad Hoc, Sensor and Mesh Networks. 8.1 Security Attacks. 8.2 Attackers. 8.3 Security Goals. 8.4 Review Questions. 9 Cryptography. 9.1 Symmetric Encryption. 9.2 Asymmetric Encryption. 9.3 Hash Functions and Message Authentication Code. 9.4 Cascading Hashing. 9.5 Review Questions. 10 Challenges and Solutions: Basic Issues. 10.1 Bootstrapping Security in Ad Hoc Networks. 10.2 Bootstrapping Security in Sensor Networks. 10.3 Key Distribution, Exchange and Management. 10.4 Authentication Issues. 10.5 Integrity. 10.6 Review Questions. 11 Challenges and Solutions: Protection. 11.1 Privacy and Anonymity. 11.2 Intrusion Detection. 11.3 Defense Against Traffic Analysis. 11.4 Access Control and Secure Human-Computer Interaction. 11.5 Software-Based Anti-Tamper Techniques. 11.6 Tamper Resilience: Hardware Protection. 11.7 Availability and Plausibility. 11.8 Review Questions. 12 Secure Routing. 12.1 Defense Against Security Attacks in Ad Hoc Routing. 12.2 Secure Ad Hoc Routing Protocols. 12.3 Further Reading. 12.4 Review Questions. 13 Specific Challenges and Solutions. 13.1 SPINS: Security Protocols for Sensor Networks. 13.2 Quarantine Region Scheme for Spam Attacks. 13.3 Secure Charging and Rewarding Scheme. 13.4 Secure Node Localization. 13.5 Secure Time Synchronization. 13.6 Secure Event and Event Boundary Detection. 13.7 Review Questions. 14 Information Operations and Electronic Warfare. 14.1 Electronic Support. 14.2 Electronic Attack. 14.3 Electronic Protection. 14.4 Review Questions. 15 Standards. 15.1 X.800 and RFC 2828. 15.2 Wired Equivalent Privacy (WEP). 15.3 Wi-Fi Protected Access (WPA). References. Index.
Improving Machine Learning Approaches to Noun Phrase Coreference Resolution

Human speakers generally have no difficulty in determining which noun phrases in a text or dialogue refer to the same real-world entity. This task of identifying co-referring noun phrases—noun phrase coreference resolution—can present a serious challenge to a natural language processing system, however. Indeed, it is one of the critical problems that currently limits the performance for many practical natural language processing tasks. State-of-the-art coreference resolution systems operate by relying on a set of hand-crafted heuristics that requires a lot of time and linguistic expertise to develop. Recently, machine learning techniques have been used to circumvent both of these problems by automating the acquisition of coreference resolution heuristics, yielding coreference systems that offer performance comparable to their heuristic-based counterparts. In this dissertation, we present a machine learning-based solution to noun phrase coreference that extends earlier work in the area and out-performs the best existing learning-based coreference engine on a suite of standard coreference data sets. Performance gains accrue from more effective use of the available training data via a set of linguistic and extra-linguistic extensions to the standard machine learning framework for coreference resolution.