Miracle-dz/UniFAR-FTUs huggingface dataset:
Quality Measuring of Multicast Communication in Secure MAODV Protocol under MANET

The absence of centralized authority is the reason of attack that easily affects the routing performance in MANET. MANETs are vulnerable to various attacks at all layers, including in particular the network layer, because the design of most MANET routing protocols assumes that there is no malicious intruder node in the network.MANET faces various challenges like security issue, quality of service issue and routing decision as well as group communication. Before that various work done to resolve the entire problem with the help of number of technique so here we design secure group communication with the help of MAODV routing and node behaviour analysis base prevention mechanism that work improve the quality of service as well as provide reliable communication to the network and maintain group communication. The proposed prevention scheme in this paper provides the secure communication among the neighbours in presence of attacker. The performance is measured through performance metrics like PDR, Routing load and data dropping.
Automatic Synthesis of Fine-Motion Strategies for Robots

Active compliance enables robots to carry out tasks in the presence of significant sensing and control errors. Compliant motions are quite difficult for humans to specify, however. Furthermore, robot programs are quite sensitive to details of geometry and to error characteristics and must, therefore, be constructed anew for each task. These factors motivate the search for automatic synthesis tools for robot program ming, especially for compliant motion. This paper describes a formal approach to the synthesis of compliant-motion strategies from geometric descriptions of assembly operations and explicit estimates of errors in sensing and control. A key aspect of the approach is that it provides criteriafor correct ness of compliant-motion strategies.
Influence of system load on channel estimation in MC-CDMA mobile radio communication systems

This paper investigates the influence of a variable system load on the performance of the channel estimation in a multicarrier code division multiple access (MC-CDMA) transmission scheme. We consider channel estimation based on pilot symbols, which are periodically inserted into the MC-CDMA frame. Starting from the analytical expression of the decision variable, we show the impact of erroneous channel estimation as a function of system load. We derive a simple adaptation rule for the pilot symbol power in order to maintain the signal-to-noise ratio (SNR) loss due to channel estimation errors constant for all system loads. We show that this simple rule enables us to minimize the total transmitted power required at a given bit error rate (BER), particularly for systems with high spreading gain as used in mobile radio channels with high frequency diversity.
Les tables du Lexique-Grammaire au format TAL

Lexicon-Grammar tables are a very rich syntactic lexicon for the French language. This linguistic database is nevertheless not suitable for use by computer programs, as it is incomplete and lacks consistency. Our goal is to adapt the tables, so as to make them usable in various Natural Language Processing (NLP) applications. We describe the problems we encountered and the approaches we followed to enable their integration into a parser.
Vyhledávání v matematickém textu

Praca sa zaobera problematikou vyhľadavania v matematických textoch. Rozobera niekoľko existujucich rieseni vyhľadavania matematiky a z tohto sa snaži si odniesťi doležite poznatky použite pri navrhu vlastneho riesenia. Ten obsahuje idey a zdovodnenia navrhnutých sucasti riesiacich vyhľadavanie matematiky, ako vhodna tokenizacia, upravy a hodnotenie formul. Casť venovana implementacii tohoto navrhu popisuje ako bolo dosiahnute konecne riesenie za použitia indexovacieho jadra Lucene. V zavere dochadza k zhodnoteniu projektu a navrhom na ďalsi vývoj.
Self management of high density wireless networks

IEEE 802.11 wireless networks are very popular in today’s world. This popularity has been stimulated due to the use of mobile computing devices such as laptops, tablets, and Wi-Fi enabled phones. We can get 802.11 connectivity in schools, squares, parks and other public places. All of these places can have a high concentration of users. Moreover, there are other nonpublic places like lecture halls, hotel ballrooms, and convention centers that are common examples of spaces with high concentration of users in a high-density wireless communications environment. Dense deployments of wireless networks suffer from increased interference and, as a result, bad user experience. The interference caused by the co-channel and adjacent channel interference driven by co-located devices is one of the main issues to address to improve network performance. The limited number of nonoverlapping channels may lead to severe interference scenarios if no appropriated spectrum planning is employed. In this work, we present an in-depth review of research work for the channel allocation strategies. Then, we formalize the channel allocation as a minimization problem of the interference level and we propose three different manners to optimize channel assignment between participating Access Points with the aim to improve network performance. The algorithms that we propose can be classified as local and uncoordinated, coordinated and distributed, and centralized. The local and uncoordinated solution behaves well in our testbed but present oscillatory issues that we tackle with a feedback control technique. Finally, this work presents an evaluation of the strategies, on a testbed and on a simulation environment. In the testbed we demonstrate the practical deployability of the solutions and lead to the conclusion that the local and uncoordinated implementation is worthy to be considered as a good strategy for the channels allocation problem where Access Points works in isolated manner. In the simulation, we test the scalability of both, the coordinated and centralized solution, and we show that they can be deployed in networks with more than thirty Access Points and as a results, we conclude that the centralized implementation is the best strategy to perform optimization decisions for channel allocation in connected networks .
IEEE 802.11 Parameters Adaptation for Performance Enhancement in High Density Wireless Networks

Nowadays, it is common to find wireless networks that are based on the IEEE 802.11 standard deployed in an unplanned and unmanaged manner. Moreover, because of the low hardware cost and, trying to obtain optimal coverage and performance, a large number of devices are usually installed in reduced spaces generating high-density deployments. This kind of networks experiment a myriad of problems (e.g., interference, medium access control, etc.) related with the shared nature of the transmission medium. In recent years, different physical-layerand link-layer-adaptation mechanisms have been proposed to palliate those problems, however, their feedback-loop-based behaviour in a highly complex RF medium makes their performance hard to assess. In this work, we study the problems of high-density networks, experimentally evaluate some existing solutions and propose a new adaptation mechanism, PRCS, that tackles some common weakness of those solutions. PRCS control the transmit power, the data rate, and the carrier sense threshold of APs of a wireless network so as to mitigate the effects of interference in high-density deployments without causing unfairness between links. In simulation-based experiments, PRCS outperforms similar existing mechanisms in various scenarios and in a particular scenario, where most mechanisms fail, duplicates global network throughput.
Evidence of validity and reliability in cancellation tests

This systematic review aimed to provide an overview of studies that obtained evidence of validity and reliability of standardized visual cancellation instruments. We included eleven studies presenting data about ten visual cancellation tasks. six of these tests were target of a main goal of searching for evidence of their validity and reliability. The tests more explored regarding psychometric parameters were Apples Test, Character-Line Bisection Task and Symbol Cancellation Test. The most studied validity types were construct and concurrent convergent validities, mainly based on correlation with gold-standard tests. With regards to reliability, the most used technique was test-retest. In general there are few studies showing the interest in obtaining evidence of validity and reliability of cancellation instruments, with surprisingly even fewer evaluating healthy populations. These methodological and psychometric parameters need to be further used in order to guarantee better accuracy of neuropsychological assessment instruments. © Cien. Cogn. 2012; Vol. 17 (2): 155-167. Ciencias & Cognicao 2012; Vol 17 (2): 155-167 © Ciencias & Cognicao Submetido em 13/04/2012 | Aceito em 12/09/2012 | ISSN 1806-5821 – Publicado on line em 30 de setembro de 2012
Um estudo de algoritmos de gestão de tráfego de baixa complexidade em SDNs

The lack of solutions that can answer to current network needs generates poor management of traffic that leads to congestion when there are still free parts in the network. In traditional networks each node can only determine the next node to which traffic should be routed, this feature combined with the lack of global knowledge of the network makes the task of optimizing the cost of links hard, being complex to obtain an optimal solution. The use of emph Software-Defined Networking brings advantages that allow to overcome the adversities of traditional networks, making it possible to design new, more efficient traffic routing methods that consider the overall state of the network. Combining these advantages the use of new routing methods could result in improved network performance, as for example to achieve an increased efficiency in data transport. The separation of the control plane scalability results in some conditions which restrain the use of optimization-based traffic distribution methods. The two main constraints are the number of rules supported by the equipment and the cost of communication between the devices on the network and controller. This work starts from an architecture that has these limitations into account, where the efficiency network utilization depends on two factors: the calculation of the paths in the network and the distribution of traffic by these same paths. This thesis will study new approaches regarding path calculation methods between access nodes and traditional traffic distribution methods, focusing on the development of a theoretical modeling tool to study the various alternatives to traditional routing methods providing a performance indicator for the studied method. Several experiments demonstrating the impact on data transport of different routing methods were carried out.
Performance aspects of security-aware database systems

Security as well as performance are crucial requirements in every application design. However, security requirements of an application impose some limitations and typically have a significant impact on the performance of the application. In this thesis, we address security issues in distributed database systems, propose solutions to impose security in underlying platforms, and study the performance implications of our proposed solutions. The objective is to design efficient solutions for distributed database systems that satisfy security requirements while offering acceptable performance. We consider three database paradigms: multilevel databases, replicated databases, and multidatabases. Each paradigm has its own unique security requirements. In a multilevel database, every component of the database is run under a multilevel security policy. Any accesses to the database must be free of potential covert channels. In this work, a multilevel log manager is designed and implemented to support logging of multiple security levels. The design uses a round-robin approach to log transaction activities of each security level. The design is channel-free and also offers good performance. Maintaining the consistency of a common security policy in a distributed environment can be modeled as a replicated database. Strong consistency such as one-copy serializability is required since any inconsistency including transient inconsistency may lead to a security violation. Invalidation-based consistency protocol proposed in this thesis satisfies one-copy serializability and performs better than update-based protocols. Heterogeneity and local autonomy are main characteristics of multidatabases. Summary Schemas Model (SSM) is an adjunct to a multidatabase. It helps resolve name and semantic heterogeneity in the multidatabase by defining access terms as hypernyms or hyponyms from data names of underlying local databases. As a result, accessing heterogenous data in multidatabases via access terms defined in the SSM is simple and efficient. However, those terms are publicly accessible and unprotected. Thus, an SSM authorization model is presented. The model restricts access to SSM access terms according to global roles defined at multidatabase level. Consequently, unauthorized accesses are rejected before they reach local databases. This reduces the network traffic, decreases the workload at database servers, and hence offers higher performance. In conclusion, we present three topics to illustrate that, even under security requirements of database systems, the underlying environments are able to exhibit good performance. We believe that the ideas presented here will contribute to the design of secure and efficient database environments.
Commercial applications on the AP3000 parallel computer

Recently, commercial parallel applications became important in parallel computing with the increase of parallel computer users. In this study, we parallelize two commercial applications, a fulltext search system and a data mining system. In this paper, the implementation of each application and its performance evaluation on the AP3000 parallel computer are shown. A parallel framework, a novel parallelizing approach applied to those applications, is also described.
Power Normalization in Massive MIMO Systems: How to Scale Down the Number of Antennas

This work considers the downlink of a massive MIMO system in which L base stations (BSs) of N antennas each communicate with K single-antenna user equipments randomly positioned in the coverage area. Within this setting, we are interested in studying the effect of power normalization on the sum rate of the system when maximum ratio transmission (MRT) or zero forcing (ZF) are employed as precoding schemes. In particular, we consider the most common two power normal-ization methods known as vector and matrix normalizations. The analysis is conducted assuming that N and K grow large with a non-trivial ratio K/N under the assumption that the data transmission in each cell is affected by channel estimation errors, pilot contamination, an arbitrary large scale attenuation, and antenna correlation at the BSs. The asymptotic results are instrumental to get insights and make comparisons. For medium to high signal-to-noise ratios, simulations and theory concur to show that vector normalization largely outperforms matrix normalization for both MRT and ZF and thus allows to scale down the number of antennas required to achieve a target sum rate.
Architecture-led Diagnosis and Verification of a Stepper Motor Controller

This paper discussed an architecture-led approach to diagnosing time sensitive issues with a stepper motor controller that manages fuel flow of an engine. A real engine control system design had originally been modeled and verified with SCADE . The potential for missed steps that result in misalignment in the fuel valve position is difficult to test for and was not discovered until after the engine went into operation. We utilize the execution and communication timing semantics of AADL to architecturally characterize the interaction between the elements of the stepper motor control systems. We then characterize the functional behavior in the context of the task dispatch and input handling semantics using the AADL Behavior Annex and identify potential fault sources and their impact using the AADL Error Model Annex. The identified the potential error sources, early arrival and mismatched command rates, we quantify the condition for this to occur and analyze the system based on timing data from scheduling analysis and actual timing measurements. We use this analysis to evaluate several proposed design corrections.
Methods for efficient object categorization, detection, scene recognition, and image search

In the past few years there has been a tremendous growth in the usage of digital images. Users can now access millions of photos, a fact that poses the need of having methods that can efficiently and effectively search the visual information of interest. In this thesis, we propose methods to learn image representations to compactly represent a large collection of images, enabling accurate image recognition with linear classification models which offer the advantage of being efficient to both train and test. The entries of our descriptors are the output of a set of basis classifiers evaluated on the image, which capture the presence or absence of a set of high-level visual concepts. We propose two different techniques to automatically discover the visual concepts and learn the basis classifiers from a given labeled dataset of pictures, producing descriptors that highly-discriminate the original categories of the dataset. We empirically show that these descriptors are able to encode new unseen pictures, and produce state-of-the-art results in conjunct with cheap linear classifiers. We describe several strategies to aggregate the outputs of basis classifiers evaluated on multiple subwindows of the image in order to handle cases when the photo contains multiple objects and large amounts of clutter. We extend this framework for the task of object detection, where the goal is to spatially localize an object within an image. We use the output of a collection of detectors trained in an offline stage as features for new detection problems, showing competitive results with the current state of the art.
KeYTestGen2: an automatic, verification-driven test case generator

Software testing is a verification technique common in contemporary software engineering processes, both the development of the system itself, as well as subsequent quality assurance, maintenance and extension. It suffers, however, from the drawback that writing high quality test cases is an error prone and resource heavy process. This work describes KeYTestGen2, a verification-driven, automatic test case generation system. It addresses the problem of automatically generating robust test code by relying on symbolic execution of Java source code using the KeY Symbolic Debugger. This process yields sufficiently detailed data about software systems in order to generate tests of high quality. KeYTestGen2 implements a robust processing system which can both control this process, and mold the generated data into executable test suites for modern automated testing frameworks, such as JUnit.
methods for peer-to-peer distributed virtual environments

architectures consists of providing each avatar with updated information about which other avatars are its neighbors. This problem is known as the awareness problem. In this paper, we propose a comparative study of the performance provided by those awareness methods that are supposed to fully solve the awareness problem. This study is performed using well-known performance metrics in distributed systems. Moreover, while the evaluations shown in the literature are performed by executing P2P simulations on a single (sequential) computer, this paper evaluates the performance of the considered methods on actually distributed systems. The evaluation results show that only a single method actually provides full awareness to avatars. This method also provides the best performance results. Copyright © 2008 John Wiley & Sons, Ltd.
Foreground Object Detection Combining Gaussian Mixture Model and Inter-Frame Difference in the Application of Classroom recording Apparatus

A new effective approach to detect central coordinate of foreground object in classroom recording application circumstance is proposed in this paper. The new approach includes two steps. The first step is to segment interested blocks from a whole video image by Inter-frame Differences. The second step is to extract the foreground pixels from the interested blocks by Gaussian Mixture Model GMM. The experimental results show that the new algorithm, which combines Gaussian Mixture Model and Inter-frame Differences, performs better than the methods in previous researches in classroom recording application field. The new method is proved to be effective in reducing complexity of calculation with very small expense of accuracy. The adaptability of different number of blocks and different values of block threshold are discussed at the end of the paper.
Picture book reading in a new arrival context: a multimodal perspective on teaching reading.

x Declaration. xii Acknowledgements. xiii List of Tables. xv List of Figures. xvi List of Abbreviations. xviii Transcription Conventions. xix Chapter 1 Picture Book Reading in a New Arrival Context: An Introduction 1.1 Overview of Chapter. 1 1.2 Rationale for the Study. 1 1.2. 1 The Significance of Teaching Reading to New Arrival Students. 2 1.2. 2 The Relationship of Verbal and Visual Resources in Picture Books. 5 1.3 The Context of this Study and Key Observations. 7 1.4 Contributions of this Study. 9 1.5 Motivation for this Research Project. 10 1.6 Scope of the Study. 13 1.6. 1 Research Questions. 13 1.6. 2 Planned Objectives. 14 1.7 Structure of the Thesis. 14 Chapter 2 Curriculum and Pedagogic Practices in the South Australian New Arrivals Program: Context of the Study 2.
Design verification by using universal test sets

In this paper, the application of universal test sets (UTS) to design verification is studied. First, the paper analyzes the relationships between the design error models and the stuck-at fault model. Then theorems are presented to show that the UTS can detect almost all the design errors. Experimental results show that design verification using UTS is an efficient approach. <<ETX>>
A multi-tasking environment for manipulating and measuring neural correlates of cognitive workload

As part of the DARPA Augmented Cognition Program, our goal has been to develop a complex cognitive multi-tasking environment in which to study user workload, its neural correlates, and task/interface augmentations to modulate workload. Additionally, our goal has been to develop a task environment that has a quasi-operational and interactive feel appropriate for developing military command and control technologies while at the same time being suitable for experimental development using undergraduates as research participants. Our solution is a ship-based navy command and control environment that contains multiple tasks and enlists spatial, verbal, and decision-making processes. The workload of the component tasks may be manipulated independently to facilitate development of process-specific neuro-metric measures of workload.