Miracle-dz/UniFAR-FTUs huggingface dataset:
Robust MIMO Cognitive Radio Via Game Theory

Cognitive radio (CR) systems improve the spectral efficiency by allowing the coexistence in harmony of primary users (PUs), the legacy users, with secondary users (SUs). This coexistence is built on the premises that no SU can generate interference higher than some prescribed limits against PUs. The system design based on perfect channel state information (CSI) can easily end up violating the interference limits in a realistic situation where CSI may be imperfect. In this paper, we propose a robust design of CR systems, composed of multiple PUs and multiple noncooperative SUs, in either single-input single-output (SISO) frequency-selective channels or more general multiple-input multiple-output (MIMO) channels. We formulate the design of the SU network as a noncooperative game, where the SUs compete with each other over the resources made available by the PUs, by maximizing their own information rates subject to the transmit power and robust interference constraints. Following the philosophy of the worst-case robustness, we take explicitly into account the imperfectness of SU-to-PU CSI by adopting proper interference constraints that are robust with respect to the worst channel errors. Relying on the variational inequality theory, we study the existence and uniqueness properties of the Nash equilibria of the resulting robust games, and devise totally asynchronous and distributed algorithms along with their convergency properties. We also propose efficient numerical methods, based on decomposition techniques, to compute the robust transmit strategy for each SU.
A knowledge-based inspection workstation

We are building an inspection workstation development environment to use as a testbed for understanding what types of knowledge, e.g. data, algorithms and processes, can increase the productivity of inspection operations. Inspection can be more efficient through reducing the need for fixturing, integrating the generation of process plans and their execution within the controller, and reducing the errors or data losses that occur by translating the models to different formats. The initial configuration of inspection systems can be less costly through the use of open architectures that are constructed from components. Key elements of our work include in-situ feature-based planning, vision-driven part pose estimation and software methods to facilitate construction of manufacturing controllers. These provide a rich environment in which to study the categories of knowledge that are useful in intelligent control of inspection workstations. This paper describes our vision, approach and preliminary results.
Evaluation of Background Subtraction Methods

In this paper we evaluate and compare six well-known foreground from background subtraction methods against a standard database. To be able to compare these algorithms objectively, we have chosen three challengeable scenarios from this database. The algorithms were applied to image sequences of length 100 to 800 frames. We examined the results thoroughly and supported the experimental results with a careful analytical study. We concluded that each algorithm might perform satisfactory in dealing with some particular challenges. That is, for example where we encounter background changes, illumination changes and flickering screens. This evaluation study assists the reader to be able to choose the most appropriate algorithm (among the six) for any particular situation.
588 Graph Partitioning and Graph Clustering

Copying and reprinting. Material in this book may be reproduced by any means for educational and scientific purposes without fee or permission with the exception of reproduction by services that collect fees for delivery of documents and provided that the customary acknowledgment of the source is given. This consent does not extend to other kinds of copying for general distribution, for advertising or promotional purposes, or for resale. Requests for permission for commercial use of material should be addressed to the Acquisitions Department, American Math-also be made by e-mail to reprint-permission@ams.org. Excluded from these provisions is material in articles for which the author holds copyright. In such cases, requests for permission to use or reprint should be addressed directly to the author(s). (Copyright ownership is indicated in the notice in the lower right-hand corner of the first page of each article.) ∞ The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability.
Protection of JPEG compressed e-comics by selective encryption

Nowadays, there is an increasing number of digital comics, so-called e-comics, available on Internet. Protecting these ecomics without Digital Rights Management (DRM) is a new issue. In this paper, we propose a method to ensure the protection of e-comics by encrypting only bubbles so that the story will not be understandable. To develop this method, we used standards like JPEG compression and AES encryption. The first step of the method involves detecting bubbles, and we decided to use the MSER algorithm, which is the most commonly used for text detection. The second main step involves making these areas unreadable by encrypting AC coefficients of the JPEG block, corresponding to high frequencies during entropy coding. Several experimental results show the efficiency of the proposed method.
ExConQuer: Lowering barriers to RDF and Linked Data re-use

A major obstacle to the wider use of semantic technology is the perceived complexity of RDF data by stakeholders who are not familiar with the Linked Data paradigm, or are otherwise unaware of a dataset’s underlying schema. In order to help overcome this barrier, we propose the ExConQuer Framework (Explore, Convert, and Query Framework) as a tool that preserves the semantic richness of the data model while catering for simplified and workable views of the data. With the aim of encouraging and enabling further re-use of Linked Data by people who would otherwise shy away from this task, this framework facilitates the publication and consumption of RDF in a variety of generic formats. In this manner, any stakeholder can export and work with RDF data in the formats they are most accustomed with, radically lowering the entry barrier to the use of semantic technologies, and possibly enabling the exploitation of Linked Data to its full potential. Through the ExConQuer Framework we provide a comprehensive set of tools that enable users to easily query linked datasets, download the results in a number of formats, and re-use previously-executed queries and transformations. With this framework we hence attempt to target the evident niche in existing tools that are intended to be used by non-experts to consume Linked Data.
Graph Cuts for Minimizing Robust Higher Order Potentials

Energy functions defined on higher order cliques can model complex interactions between groups of random variables. They have the capability of modelling the rich statistics of natural scenes which can be used for many applications in computer vision. However, these energies are seldom used in practice, primarily due to the lack of efficient algorithms for minimizing them. In this paper we introduce a novel family of higher order potentials called the Robust P model. This family is a generalization of the P Potts model class of potentials which was recently introduced in computer vision. We show that energy functions containing such potentials can be solved using the expansion and swap move algorithms for approximate energy minimization. Specifically, we prove that the optimal swap and expansion moves for energy functions composed of these potentials can be computed by solving a st-mincut problem. For functions of binary variables, our method is able to produce the globally optimal solution in polynomial time. Further, it is extremely efficient and can handle energies defined on cliques involving thousand of variables.
Note: This Copy Is for Your Personal, Non-commercial Use Only. to Order Presentation-ready Copies for Distribution to Your Colleagues or Clients, Contact Us at Www.rsna.org/rsnarights. Snapshot Inversion Recovery: an Optimized Single-shot T1-weighted Inversion-recovery Sequence for Improved Fetal Br

Purpose: To prospectively evaluate the clinical effectiveness of snapshot inversion recovery (SNAPIR), which is a dedicated optimized inversion-recovery-prepared single-shot fast spin-echo T1-weighted sequence, in the delineation of normal fetal brain anatomy compared with that of the currently used T1-weighted gradient-echo protocol, which often yields images of poor quality due to motion artifacts and inadequate contrast. This study was approved by the hospital research ethics committee, and informed written consent was obtained from all patients. Forty-one fetuses were examined at 19–37 weeks gestation (mean, 29 weeks gestation) by using both the standard T1-weighted protocol and the optimized T1-weighted SNAPIR protocol with a 1.5-T imager. Two independent blinded observers performed qualitative analysis, evaluating overall diagnostic quality, detailed an-atomic delineation, and severity of motion artifacts. Quantitative analysis comprised calculation of contrast ratios (CRs) for the cortical gray matter, subplate, white matter, and cerebrospinal fl uid. The Wi lcoxon signed rank test was used to compare image rating scores, the paired t test was used to compare CRs, and k statistics were used to test interobserver agreement. Results: Both overall diagnostic quality (P , .001) and detailed anatomic delineation (P , .001) were enhanced with SNAPIR compared with the standard T1-weighted acquisition. Also, motion artifacts were less severe (P = .008) and less extensive (P , .001) with SNAPIR. Corresponding CRs were increased with SNAPIR in seven of eight examined regions. Conclusion: SNAPIR is a promising robust alternative to the current T1-weighted acquisitions; its role in the detection of disease requires further study.
Gender and Persuasive Technology: Examining the Persuasiveness of Persuasive Strategies by Gender Groups

This paper examines the persuasiveness of ten commonly used Persuasive Technology (PT) strategies with respect to the effect of gender. The results of a large- scale study suggest that males and females differ significantly in persuadability - with females being more receptive to most of the PT strategies. Some PT strategies are more suitable for persuading one gender than the other. Contribution statement. This paper contributes to research on ways of tailoring Persuasive Technology to various user groups. It also contributes to research on validating and comparing the effectiveness of various persuasive strategies as applied in Persuasive Technology design.
An Approach to Separating Security Concerns in E-Commerce Systems at the Architecture Level

Security is a requisite and vital concern that should be addressed in e-commerce systems. Traditionally, to add security properties to the application, developers had to specify when, where and how to apply what security policies manually. Such a process is often complicate and error-prone. This paper describes an aspect oriented approach to separating security and application concerns at the architecture level. In the approach, security and application concerns are specified in security aspect models and a base model separately. By specifying the crosscutting relationship between them, the two kinds of models are combined together through weaving. The weaving is based on process algebras and is automatic. Separating security aspects at the early stage of software development can promote maintainability and traceability of the system.
Decision‐making and Weber's law: a neurophysiological model

We describe an integrate‐and‐fire attractor model of the decision‐related activity of ventral premotor cortex (VPC) neurons during a vibrotactile frequency comparison task [ Romo et al. (2004)Neuron, 41, 165–173]. Populations of neurons for each decision in a biased competition attractor network receive a bias input that depends on the firing rates of VPC neurons that code for the two vibrotactile frequencies. The firing rate of the neurons in whichever attractor wins, reflects the sign of the difference in the frequencies (Δf) being compared but not the absolute frequencies. However, the transition from the initial spontaneous firing state to one of the two possible attractor states depends probabilistically on the difference of the vibrotactile frequencies scaled by the base frequency. This is due to finite size noise effects related to the spiking activity in the network, and the divisive feedback inhibition implemented through inhibitory interneurons. Thus the neurophysiological basis for a psychophysical effect, Weber's Law, can be related to statistical fluctuations and divisive inhibition in an attractor decision‐making network.
Schedulability Bound of Weighted Round Robin Schedulers for Hard Real-Time Systems

We derive a parameterized, closed-formed schedulability bound for weighted round robin schedulers in hard real-time computing systems. The schedulability bound uses several parameters to represent important system behaviors: (1) Number of tasks; (2) Normalized deadline that measures the tightness of task deadlines; (3) Tasks set workload burst-ness; (4) Overhead ratio, which measures the portion of overhead time consumed in round robin operations; (5) Normalized token rotation frequency, that measures the number of token rotations in a time interval of the shortest relative deadline. Our work follows the network calculus representation framework and is based on a generalized workload and service approximation models. We derive a closed form expression of the utilization bound, so that one can analyze the impact of particular system parameters on the schedulability bound and schedulability bounds for specific system configurations can be easily obtained by simply plugging in proper parameters.
Fixing inconsistent databases by updating numerical attributes

For several reasons a database may not satisfy certain integrity constraints (ICs). However most likely most of the information in it is still consistent with the ICs; and could be retrieved when queries are answered. Consistent answers with respect to a set of ICs have been characterized as answers that can be obtained from every possible minimal repair of the database, where the repairs are obtained by deletions/insertion of whole tuples. In this paper we study the problem of fixing (repairing) databases by updating numerical attributes of tuples with respect to denial constraints. We introduce a quantitative definition of database fix, identify relevant tractable cases and introduce approximation algorithms for some of those that are intractable.
Comparing Apples and Oranges : Using Consensus Rankings for Decision Support

Conference program committees, graduate admissions committees, and even many social Web sites, are in the business of ranking content. However, they have too much content for everyone to review all of it. It therefore becomes necessary to order content based on partial information. Simply comparing numerical scores is error-prone because different reviewers see different portions of the content and score in different ways. This paper describes a local-search algorithm for the Linear Ordering Problem specifically designed for rank aggregation that can be used to construct a consensus ordering of options based on reviewers’ relative preferences. We will then discuss a system for using this ordering to categorize options by quality and to identify conflict among reviewers. Lastly, we will review the performance of this system on data extracted from a faculty search and a number of small academic conferences, and identify a number of features of reviewer behavior that may serve as obstacles for decision support systems in this domain. NOTE: this may not be the latest available version of this paper. Please contact sk@cs.brown. edu to receive the most up-to-date information available.
Part-of-speech tagger based on maximum entropy model

The maximum entropy (ME) conditional models don't force to adhere to the independence assumption such as in Hidden Markov generative models, and thus the ME -based Part-of-Speech (POS) tagger can depend on arbitrary, non-independent features, which are benefit to the POS tagging, without accounting for the distribution of those dependencies. Since ME models are able to flexibly utilize a wide variety of features, the sparse problem of training data is efficiently solved. Experiments show that the POS tagging error rate is reduced by 54.25% in close test and 40.56% in open test over the Hidden-Markov-Model-based baseline, and synchronously an accuracy of 98.01% in close test and 95.56%in open test are obtained.
DIMwid – Decoder Inspection for Moses (using Widgets)

Abstract The development of accurate machine translation systems requires detailed analyses of the recurring translation mistakes. However, the manual inspection of the decoder log files is a daunting task because of their sheer size and their uncomfortable format, in which the relevant data is widely spread. For all major platforms, DIMwid offers a graphical user interface that allows the quick inspection of the decoder stacks or chart cells for a given span in a uniform way. Currently, DIMwid can process the decoder log files of the phrase-based stack decoder and the syntax-based chart decoder inside the Moses framework.
Behavioral Neuroscience

one out of ∼25 specific Ors interacts with a variable number of odorants, and a given odorant can bind to multiple Ors (Kreher et al., 2005). Therefore, the recognition of odorant identity is based on the odorant's combinatorial activation of distinct populations of ORNs, just as it has been described in detail for adult flies (Wang et al., 2003a; Hallem and Carlson, 2006; Hallem et al., 2006). In larvae even the activation of one single ORN is sufficient to elicit positive odortaxis toward a variety of odors, underlining the fact that many odorants are able to activate a given Or (Fishilevich et al., 2005). Whereas the characterization of response spectra of diverse Ors has far advanced (Kreher et al., 2005; Vosshall and Stocker, 2007) the neuronal mechanisms underlying the decision whether an odorant is attractive or repulsive remains unknown for larvae. Aversive or appetitive behavior might be induced in central brain structures based on the processed combinatorial olfactory information , as suggested by Wang et al. (2003b). Alternatively, the decision whether an odorant acts as attractant or repellent might be already determined at the level of individual types of ORNs. This has clearly been shown to be the case in the olfactory system of adult Drosophila (Semmelhack and Wang, 2009), suggesting that also in larvae the attractive or repulsive character of particular odors might be determined already at the level of distinct ORNs.
Position adaptive formation control for multi-robot system using a redundant adaptive robust Kalman filter

Leader-follower based formation control is a promising technique in multi-robot motion planning system. When the pose of leader-robot mutated or disturbed by external disturbance, the follower-robot usually cannot react quickly, resulting in loss tracing. A redundant adaptive robust Kalman filter (RAREKF) is adopted to predict the relative movement parameters between the leader and follower, so that the followers can reach the desired position and orientation quickly and accurately. According to the actual situation, the redundancy factor in RAREKF is designed to compensate the timeliness lack of the tracking process. This approach has the advantages of eliminating the system state noises and errors generated by the sudden change of formation, which can ensure rapidity and accuracy of the tracking process and maintain the stability of the formation. The validity of the method mentioned above has been verified by simulation experiments.
Two-handed hand gesture recognition for Bangla sign language using LDA and ANN

Sign language detection and recognition (SLDR) using computer vision is a very challenging task. In respect to Bangladesh, sign language users are around 2.4 million [16]. In this paper, we try to focus for communicating with those users by computer vision. In this respect, an efficient method is proposed consists of some significant steps and they are, skin detection, preprocessing, different machine learning techniques like PCA and LDA, neural network for training and testing purpose of the system. Various hand sign images are used to test the proposed method and results are presented to provide its effectiveness.
Towards an open, collaborative repository for online learning system design patterns

espanolLos patrones de diseno son soluciones de alta calidad a los problemas conocidos en un contexto especifico que guian las decisiones de diseno. Por lo general, los patrones de diseno son extraidos y evaluados a traves de cuatro metodos: el conocimiento de expertos, analisis de los artefactos, las observaciones sociales y talleres. Por ejemplo, los expertos estudian: el conocimiento, las interpretaciones de los artefactos, los patrones sociales, y la claridad de los patrones. En este trabajo, presentamos un quinto metodo, un metodo de produccion patron de diseno basada en datos (3D2P) para producir patrones de diseno y realizacion de ensayos controlados aleatorios como un medio para evaluar los patrones de diseno aplicadas. Presentamos el metodo 3D2P en el contexto de los sistemas de aprendizaje en linea (OLSS) que son dificiles de crear, actualizar y mantener. Para superar estos desafios, proponemos un repositorio abierto para los patrones de diseno, OLS datos de la evaluacion, y ejemplos de aplicacion. En el repositorio, los investigadores pueden colaborar en las seis etapas del ciclo de vida del patron (es decir, la prospeccion, la mineria, la escritura, evaluacion, la aplicacion, la evaluacion aplicada). El repositorio proporciona cinco beneficios: investigadores de diferentes origenes pueden (a) colaborar en la produccion patron de diseno; (B) realizar tareas distribuidas en paralelo; (c) los resultados de las acciones para el beneficio mutuo; (D) patrones de prueba a traves de diversos sistemas y dominios para explorar generalizacion patron y robustez; y (e) la promocion de patrones de diseno para elevar la calidad de MCO. EnglishDesign patterns are high quality solutions to known problems in a specific context that guide design decisions. Typically, design patterns are mined and evaluated through four methods: expert knowledge, artifact analysis, social observations, and workshops. For example, experts discuss: knowledge, interpretations of artifacts, social patterns, and clarity of patterns. In this paper, we introduce a fifth method, a data-driven design pattern production (3D2P) method to produce design patterns and conduct randomized controlled trials as a means to evaluate applied design patterns. We illustrate the 3D2P method in the context of online learning systems (OLSs) that are difficult to create, update and maintain. To overcome such challenges, we propose an open repository for OLS design patterns, evaluation data, and implementation examples. On the repository, researchers can collaborate in the six stages of the pattern lifecycle (i.e., prospecting, mining, writing, evaluation, application, applied evaluation). The repository provides five benefits: researchers from different backgrounds can (a) collaborate on design pattern production; (b) perform distributed tasks in parallel; (c) share results for mutual benefit; (d) test patterns across varied systems and domains to explore pattern generalizability and robustness; and (e) promote design patterns to elevate OLS quality