Miracle-dz/UniFAR-FTUs huggingface dataset:
Call Admission Control Algorithms Based on Random Waypoint Mobility for IEEE802.16e Networks

The next generation network WiMAX (Worldwide Interoperability for Microwave Access), has become synonymous with the IEEE802.16 Wireless Metropolitan Area Network (MAN) air interface standard. In its original release the 802.16 standard addressed applications in licensed bands in the 10 to 66 GHz frequency range. Subsequent amendments have extended the 802.16 air interface standard to cover non-line of sight (NLOS) applications in licensed and unlicensed bands from 2 to 11 GHz bands. These 802.16 networks are able to provide high data rates and are preferably based, for NLOS applications, on Orthogonal Frequency Division Multiple Access (OFDMA) (Piggin, 2004). In OFDMA, modulation and/or coding can be chosen differently for each sub-carrier, and can also change with time. Indeed, in the IEEE802.16 standard, coherent modulation schemes are used starting from low efficiency modulations (BPSK with coding rate 1/2) to very high efficiency ones (64QAM with coding rate 3/4) depending on the SNR (Signal-to-Noise Ratio). It has been shown that systems using adaptive modulation perform better than systems whose modulation and coding are fixed (Yaghoobi, 2004). Adaptive modulation increases data transmission throughput and the system reliability by using different constellation sizes on different sub-carriers. The authors in (Peyre et al., 2008) introduce a new Quality of Service (QoS) for real-time calls in IEEE802.16e Multi-class Capacity including AMC scheme and QoS Differentiation for Initial and Bandwidth Request Ranging (Seo et al., 2004). The QoS defined in this work is to maintain a same bit rate for RT calls independently of user position in the cell. The authors use a Discrete Time Markov Chain (DTMC) to model the system over a decomposition of IEEE802.16e cell. The authors took account the mobility of users among
Block motion vector estimation using edge matching: an approach with better frame quality as compared to full search algorithm

Intensity based block motion estimation algorithms are widely used for exploiting temporal redundancies in video coding. However, blocks located on boundaries of moving objects are not estimated accurately, which are very sensitive to human eyes. In this paper, we propose a novel approach which incorporates edge matching techniques to accurately predict the motion of moving objects such that the motion compensated frames are tied more closely to the physical features. Besides, accurate motion vectors of edge blocks can be used to develop an efficient block motion estimation algorithm. Experimental results show that our approach requires simple computational complexity, and it gives a significant improvement in accuracy on motion compensated frames as compared with the traditional intensity based methods, including the full search algorithm.
Symbiotic intelligence (poster): self-organizing knowledge on distributed networks driven by human interaction

Through conceptual examples and demonstrations, we argue that the symbiotic combination of the Internet and humans will result in a significant enhancement of the previously existing, self-organizing social structure of humans. The combination of the unique capabilities of intelligent, distributed information systems (the relatively loss-less transmission and capturing of detailed signatures) with the unique capabilities of humans (processing and analysis of complex, but limited, systems) will enable essential problem solving within our increasingly complex world. The capability may allow solutions that are not achievable directly by individuals, organizations or governments.
Approximate Semantic Tree Matching in OpenKnowledge

The OpenKnowledge (OK) project is predicated on the idea that the peers involved in the peer-to-peer network do not have to have prior agreement on the representation and vocabulary they use or conform to pre-established standards. Instead, peers are permitted to represent their knowledge in any way they choose and the interaction between these disparate peers is controlled via interaction models(IMs), which describe how specific interactions proceed. These IMs describe the order of the message passing, the messages to be passed and the constraints on those messages for every peer in the interaction and are written in LCC; see Figure 2 for an example. Naturally, since representation and vocabulary are not fixed, identifying, interpreting and communicating via these IMs requires complex matching techniques. In the basic case, this matching can be done by hand, with users choosing IMs that fit with their knowledge representation or developing bridges that link the representation in the IM with their own representation. However, this puts an onerous burden on users; the system can only be usable on a large-scale if these matchings can be made automatically or interactively.
Audio Quality X Accessibility How Digital Technology Changed the Way We Listen and Consume Popular Music

Based on the studies of Milner (2009), Katz (2004) and Wikstrom (2009), the article explores in details how the experience of listening and consuming music has been changing through the years due to the appearance and evolution of digital audio technology; analyzing the consequences in the recording industry and specially in its main product: popular music. The work approaches two different steps of this evolution (Compact Disks and Mp3) in terms of formats, devices and delivery methods; and how each one of them had an influence in our relationship with music.
A Web Usage Mining Approach Based On New Technique In Web Path Recommendation Systems

The Internet is one of the fastest growing areas of intelligence gathering. The ranking of web page for the Web search-engine is one of the significant problems at present. This leads to the important attention to the research community. Web Prefetching is used to reduce the access latency of the Internet. However, if most prefetched Web pages are not visited by the users in their subsequent accesses, the limited network bandwidth and server resources will not be used efficiently and may worsen the access delay problem. Therefore, it is critical that we have an accurate prediction method during prefetching. To provide prediction efficiently, we advance an architecture for predicting in Web Usage Mining system and propose a novel approach for classifying user navigation patterns for predicting users’ requests based on clustering users browsing behavior knowledge. The Expremental results show that the approach can improve accuracy, precision, recall and Fmeasure of classification in the architecture.
Probabilistic safety analysis in three dimensional aircraft flight

In this paper we study the problem of evaluating if the flight plan assigned to an aircraft is "safe", i.e., if it guarantees that the aircraft will neither enter any forbidden region of the airspace nor come closer than a minimum prescribed distance to another aircraft. We address the general case when the flight plan possibly involves altitude changes. The aircraft future position during the flight time is predicted based on a stochastic model that incorporates the information on the aircraft flight plan, and takes into account the presence of wind as the main source of uncertainty on the aircraft actual motion. Based on the aircraft predicted motion, we estimate the probability that an unsafe situation will occur during the aircraft flight by a stochastic approximation method. Some examples are presented to illustrate the proposed methodology for safety analysis. As expected, the examples show that the wind spatial correlation needs to be taken into account when evaluating the safety of aircraft encounters.
Exploiting SSD parallelism to accelerate application launch on SSDs

Using an optimised application prefetcher to accelerate the application launch on solid-state drives (SSDs) by exploiting the SSD parallelism is proposed. The proposed prefetcher was implemented on the Linux OS and achieved a 37% reduction of prefetcher execution time, which corresponds to an 18% reduction of application launch time.
Optimal spoken dialog control in hands-free medical information systems

In the paper a method of optimal selection of utter ances used as command entry-words for voice controlled application is presented. Voice controlled programs seem to be par ticularly useful in the area of medical informatics , where a physician interacts with a program by voice while operating the medical device or being involved in examinations requiring manual activities. The proposed method selects command words from sets of proposals defined for each command so as to min imize the overall probability of incorrect command recognition. First the entry-word dissimilarity matrix is calculated. The word dissimilarities are evaluated using HMM models consisting of appropriately trained acoustic models of the phonemes constit uting words. The trained HMM is used as the sample utterance generator for t he word. The artificially created utterance samples are then recognized by speech recognizers created for pairs of words. The estimation of correct recognition probability is us ed as the word dissimilarity measure. The word dissimilarities are then used to determine the average assessment of words selection s that can be used as commands. Selection is created by choosing single word from sets of candidates defined for each comman d. Finally, suboptimal selection is found by using genetic algorithm. Expe riments carried out prove that suboptimal selection of command entry-words can observably increase the accuracy of spoken commands recognition in many cases.
Aplicando gestao de energia ao protocolo de roteamento para redes ad hoc móveis VRP

xvi 1 INTRODUÇÃO 1 1.1 Gestão de Energia . 2 1.1.1 Controle de Potência de Transmissão . 3 1.1.2 Transição para o Modo de Operação Dormindo (sleep) . 3 1.1.3 Balanceamento de Fluxos . 4 1.2 Objetivos . 6 1.3 Motivação . 6 1.4 Organização . 7 2 CONSUMO DE ENERGIA DAS UNIDADES DA REDE 8 2.1 Modelo de Consumo de Energia . 8 3 PROTOCOLOS DE ROTEAMENTO PARA REDES MANET 12 3.1 Dynamic Source Routing . 13 3.2 Ad-hoc On-demand Distance Vector . 14 3.3 Virtual Routing Protocol . 15
Elimination of low-frequency harmonics caused by PWM in a three-phase soft-switched boost rectifier

This paper presents three major causes of low-frequency harmonics in a high-frequency soft-switched three-phase PWM boost rectifier: pulse width limits; an improper space vector modulation scheme; and dead time. Among these, the pulse width limits are related to soft-switching techniques. To eliminate undesirable low-frequency harmonics, each cause is illustrated and a solution is provided. Both simulation and experimental results prove the effectiveness of the proposed solutions. Due to the similarities between boost rectifiers and voltage source inverters, the conclusions of this paper are also applicable to high-frequency PWM voltage source inverters.
Reactive trajectory adjustment for motion execution using Chekhov

Robots are becoming more and more prominent in the world of manufacturing for assembling products. Currently most of these robots, such as the ones used in automobile manufacturing have specific pre-programmed tasks and motions, and no sense of their surrounding environment. In many of today's applications, this method will not be sufficient, as many real world environments are unstructured and could cause disturbances to the robots requiring the motion and task plans to be modified. If a robot has a task to complete, a planner, such as Bidirectional RRT [5], will generate a motion plan to complete the task. If that motion plan becomes infeasible, because the goal has changed, or an obstacle has moved into the robot's path, the robot will need to make an adjustment. One method is to generate a new plan. This can be quite time-consuming, especially since the time is not proportional to the size of the change making re-planning excessive for small adjustments. The problem we would like to solve is adjusting to minor disturbances much faster than re-planning. Re-planning can often take a few seconds, where we would like to make adjusted plans in less than a second. In this thesis, we present a method for solving this problem. We use an incremental adjustment approach that can make minor adjustments in response to collisions or goal changes where the time taken to make adjustments is proportional to the extent of the changes made. To make the adjustments to the plan, we have developed a quadratic program that will make near-optimal adjustments to each robot joint pose in a robot's motion plan based on the goal region and a reaction vector. The goal region is the region the robot manipulator needs to be in to accomplish its task. The reaction vector is a vector that specifies the direction the robot would need to move in order to remove itself from a collision if there is a collision. Along with this quadratic program, we give a method for computing these reaction vectors. These two pieces are the major components of our algorithm and the key innovations made in this thesis. The algorithm allows the robot to make minor adjustments to its plan in an unstructured environment in about a quarter of a second. The adjustments are near optimal, in that they only deviate slightly from the original plan, and are made much faster than traditional planning algorithms. The overall goal is to build a complete robust execution system, and the reactive trajectory adjustment algorithm presented in this thesis is an important piece of the overall system.
A Review of Higher-Order Factor Analysis Interpretation Strategies

Bu calismada, ikinci ve ucuncu dereceden faktor analizi ozetlenip yorumlama teknikleri incelendi. Ozellikle Gorsuch’un carpim matrisi, Schmid ve Leiman cozumu ve Thompson’un dikey dondurulmus carpim matrisi incelendi. Kesif amacli faktor analizi cok degiskenli bir istatistiksel teknik olup, gizil durumdaki faktorleri olculen degiskenlerden ortaya cikarmayi amac edinir. Arastirmacilar egik olarak dondurulmus stratejiyi sectiklerinde, faktorler arasinda bir iliski olduguna veya en iyi cozumun egik olarak dondurulmus stratejiden elde edilecegini dusunurler. Birinci dereceden elde edilen faktorler birbirleriyle iliskili oldugunda, bu foktorlerin olusturdugu korrelasyon matrisi ikinci dereceden faktorleri elde etmede kullanilir ve bu elde edilen ikinci dereceden faktorler veriye farkli acilardan bakmakta oldukca onemli bir yer tutar. Calismanin anlasilir olmasi icin iki farkli ornek SAS kodlari ile birlikte verildi. Her stratejinin avantajlari tartisildi
Shielding Android Application Against Reverse Engineering

Abstract: In this growing market of smart phones, Android is an open source platform of Google that has become one of the most popular operating system. As a result, protecting applications running on Android becomes of interest. Currently, Reverse engineering of Android applications is much easier than on other architectures, due to the high level but simple byte code language used. Hence, the goal is to minimize and manage risks of software flaws. Anti-Reverse engineering techniques can be used to prevent reverse engineering. This paper discusses the possible code obfuscation techniques on the android platform. Our approach aims at increasing the complexity of the control flow of the application so that it becomes tough for a reverse engineer to get the business logic performed by an android application. In this growing market of smart phones, Android is an open source platform of Google that has become one of the most popular operating system. As a result, protecting applications running on Android becomes of interest. Currently, Reverse engineering of Android applications is much easier than on other architectures, due to the high level but simple byte code language used. Hence, the goal is to minimize and manage risks of software flaws. Anti-Reverse engineering techniques can be used to prevent reverse engineering. This paper discusses the possible code obfuscation techniques on the android platform. Our approach aims at increasing the complexity of the control flow of the application so that it becomes tough for a reverse engineer to get the business logic performed by an android application.
An extensible approach for modeling ontologies in RDF(S)

RDF(S)1 constitutes a newly emerging standard for metadata that is about to turn the World Wide Web into a machine-understandable knowledge base. It is an XML application that allows for the denotation of facts and schemata in a web-compatible format, building on an elaborate objectmodel for describing concepts and relations. Thus, it might turn up as a natural choice for a widely-useable ontology description language. However, its lack of capabilities for describing the semantics of concepts and relations beyond those provided by inheritance mechanisms makes it a rather weak language for even the most austere knowledge-based system. This paper presents an approach for modeling ontologies in RDF(S) that also considers axioms as objects that are describable in RDF(S). Thus, we provide flexible, extensible, and adequate means for accessing and exchanging axioms in RDF(S). Our approach follows the spirit of the World Wide Web, as we do not assume a global axiom specification language that is too intractable for one purpose and too weak for the next, but rather a methodology that allows (communities of) users to specify what axioms are interesting in their domain.
Metaheuristic Algorithms Based Optimization for OLSR Routing in VANETs

In vehicular adhoc networks (VANETs) routing packets through the network is a difficult task because of the limited coverage of Wi-Fi and the high mobility of the nodes make regular topology changes and network fragmentations. For these reasons, and there is no central manager entity. Deployment of VANETs is crucial, therefore offering an efficient routing strategy. This paper deals with the optimal parameter setting of optimized link state routing (OLSR), is a well-known mobile ad hoc network routing protocol, by defining an optimization problem. To find automatically optimal configurations of this protocol, a series of metaheuristic algorithms (particle swarm optimization, differential evolution, genetic algorithm, and simulated annealing) are studied. Keywords—Vehicular adhoc networks(VANET),optimized link state routing (OLSR), metaheuristic, optimization
An application of H/sub /spl infin// optimization to multirate digital signal processing

A procedure is developed to design IIR synthesis filters in a multirate filter bank. The filters minimize the l/sub 2/-induced norm of the error system between the multirate filter bank and a desired pure time-delay system. This criterion is reduced to one of H/sub /spl infin// optimization, for which there is ready-made software.
Calibration and parameter identification of a 6-DOF robot using a single radial-distance transducer

The main goal is the identification of all the kinematic parameters of a robot to improve its absolute accuracy. The authors use a simple radial-distance linear transducer which measures the distance from a fixed point in the workspace to the robot's endpoint. These scalar data are accumulated as the robot endpoint is moved within one or more spherical shells centered about the fixed point. Optimal values for all of the independent kinematic parameters of the robot can then be found. The motivation, theory, implementation, and performance of this particularly easy calibration and parameter identification method are discussed. A disagreement in the literature about the class of measurements needed to fully identify a robot's kinematic parameters is addressed. <<ETX>>
Mixed compact and behavior modeling using AHDL Verilog-A

The way from the compact model development to implementation into a commercial circuit simulator is often time consuming. Moreover, it is not always straightforward how to implement behavior models in SPICE-like simulators. A capability of the analog hardware description language (AHDL) Verilog-A to handle state-of-the-art compact bipolar transistor modeling mixed with behavioral substrate coupling modeling has been demonstrated.
Downlink dynamic resource allocation for multi-cell OFDMA system

This paper presents an OFDMA radio resource control (RRC) scheme where dynamic resource allocation is realized at both a radio network controller (RNC) and base stations (BTSs). The scheme is semi-distributed in the sense that the RNC coordinates the mutual interference (inter-cell) at a super-frame level, whereas each BTS makes faster frame-level channel assignment decision based on the resources' utility value to the users. Another contribution of the paper is a set of computationally efficient (linear-time) algorithms that perform dynamic channel allocation at the RNC and BTSs. Simulations show that the algorithm yields excellent performance for both real-time and non real-time services, even under very fast fading.
Bayesian network classifiers in Weka

Various Bayesian network classifier learning algorithms are implemented in Weka [12]. This note provides some user documentation and implementation details. Summary of main capabilities: • Structure learning of Bayesian networks using various hill climbing (K2, B, etc) and general purpose (simulated annealing, tabu search) algorithms. • Local score metrics implemented; Bayes, BDe, MDL, entropy, AIC. • Global score metrics implemented; leave one out cv, k-fold cv and cumulative cv. • Conditional independence based causal recovery algorithm available. • Parameter estimation using direct estimates and Bayesian model averaging. • GUI for easy inspection and editing of Bayesian networks. • Part of Weka allowing systematic experiments to compare Bayes net performance with general purpose classifiers like C4.5, nearest neighbor, support vector, etc. • Source code available under GPL allows for integration in other systems and makes it easy to extend.
Software coherence in multiprocessor memory systems

Processors are becoming faster and multiprocessor memory interconnection systems are not keeping up. Therefore, it is necessary to have threads and the memory they access as near one another as possible. Typically, this involves putting memory or caches with the processors, which gives rise to the problem of coherence: if one processor writes an address, any other processor reading that address must see the new value. This coherence can be maintained by the hardware or with software intervention. Systems of both types have been built in the past; the hardware-based systems tended to outperform the software ones. However, the ratio of processor to interconnect speed is now so high that the extra overhead of the software systems may no longer be significant. This dissertation explores this issue both by implementing a software maintained system and by introducing and using the technique of offline optimal analysis of memory reference traces. It finds that in properly built systems, software maintained coherence can perform comparably to or even better than hardware maintained coherence. The architectural features necessary for efficient software coherence to be profitable include a small page size, a fast trap mechanism, and the ability to execute instructions while remote memory references are outstanding.