Miracle-dz/UniFAR-FTUs huggingface dataset:
Advanced resource provisioning in context-sensitive converged networks

Mobile users are increasingly demanding multimedia content created specifically or at least tailored to cater for their needs and preferences. In this scope, context-sensitive converged network requires technologies beyond-standards to allow designing personalized multi-user service applications over heterogeneous communication systems. The Context Casting (C-CAST) project designed a context-sensitive converged network architecture to support personalized multi-user sessions with Quality of Service (QoS) guaranteed towards group of multi-homed users simultaneously, and in their wireless network technologies. However, the per-flow driven signalling approach of Legacy C-CAST introduces performance penalties since the signalling load exponentially increases with the number of flow admissions. Thus, this paper proposes the Advanced C-CAST, which re-architects the Legacy C-CAST with over-provisioning centric network resource control to improve performance and reliability. The evaluation of Advanced C-CAST demonstrate its benefits against Legacy C-CAST by optimizing overall networking costs (signalling load and latency) while keeping users with best quality perception (packet loss and propagation delay) experience.
Fast graph‐based instruction selection for multi‐output instructions

A multi‐output instruction (MOI) is an instruction that produces multiple outputs to its destination locations. Such inherently parallel instructions are becoming more and more popular in embedded processors, due to the advances in application‐specific architectures. In order to provide high‐level programmability and thus guarantee widespread acceptance, sophisticated compiler support for these programmable cores is necessary. However, traditional tree‐based approaches for instruction selection, although very fast, fail to exploit MOIs mainly because of the fundamental limitation of the tree representation. In fact, to generate optimal code with MOIs requires a more general graph‐based formulation of the instruction selection problem, which is at least NP‐complete. In this paper we present a new methodology to automatically generate from simple instruction set descriptions, graph‐based code selectors that can effectively utilize all provided instructions including MOIs. Our experimental results using a set of benchmarks on a target processor with various MOIs of up to two outputs demonstrate that our generated code selectors can quickly and effectively exploit many MOIs at the application level, and therefore are highly desirable both for architecture exploration and as code generators after architecture is fixed. Copyright © 2010 John Wiley & Sons, Ltd.
The EMIME Bilingual Database

This paper describes the collection of a bilingual database of Finnish/English and German/English data. In addition, the accents of the talkers in the database have been rated. English, German and Finnish listeners assessed the English, German and Finnish talkers’ degree of foreign accent in English. Native English listeners showed higher inter-listener agreement than non-native listeners. Further analyses showed that non-native listeners judged Finnish and German female talkers to be significantly less accented than do English listeners. German males are judged less accented by Finnish listeners than they are by English and German listeners and there is no difference between listeners as to how they judge the accent of Finnish males. Finally, all English talkers are judged more accented by non-native listeners than they are by native English listeners.
Improving image encryption using two-dimensional logistic map and AES

The need for higher levels of security in transferring data has always been a matter of critical concern and sheer development. Almost every domain around the world including individuals to nations require a highly secure means for communication of data. In this paper, an image encryption scheme has been proposed based on use of 2D logistic map and AES. 2D logistic map and AES have been accepted as adequate standards for encryption and decryption of data since they exhibit high resistance towards cryptanalysis attacks. Therefore, a combination of these two established techniques could be used as a very strong mechanism for real time encryption of image.
Coping with difficult situations by tourism workers (foreign excursion guides)

Journal of Modern Science tom 3/38/2018 Abstract Objectives: The aim of the study was to identify the preferred means of coping with stress among the workers of tourism industry, specifically, foreign excursion guides. The research problem was formulated in the form of the following question: What ways of dealing with stressful situations are preferred by the workers of tourism industry – foreign excursion guides? Material and methods: The subject of the study was a group of 31 practicing guides. The chosen research method was a diagnostic poll. The adopted research tool was the Ways of Coping Questionnaire developed by S. Folkman and R. Lazarus. Results: Results were divided regarding sex and place of residence. Average results of men are slightly higher for the following strategies: “Desires” (M=7,33; W=6,50), “Passive attitude” (M=7,66; W=6,25), “Positive attitude” (M=5,40; W=4,00), “Blaming oneself ” (M=4,29; W=4,00) and “Retiring into oneself ” (M=3,96; W=2,75). Women, in turn, handle better such strategies as “Solving problems” (W=18,50; M=16,96), “Seeking social support” (W=11,25; M=9,40) and “Reduction of tension” (W=4,50; M=3,14). In all the cases, however, no significant differences can be noticed. Conclusions: The subjects of the study do not seem to prefer any of the eight analyzed ways of coping with problematic situations, which is confirmed by the average results obtained for all the strategies. More specifically, however, it can be noticed that men tend to employ the strategy of rational approach to problems more than women. The analyses also show that the variables such as sex and place of living do not significantly influence the subjects’ preferences with respect to the ways of coping with difficult situations.
A meta-analysis of the efficacy and toxicity of combining disease-modifying anti-rheumatic drugs in rheumatoid arthritis based on patient withdrawal.

INTRODUCTION Combinations of disease-modifying anti-rheumatic drugs (DMARDs) are increasingly used to treat rheumatoid arthritis (RA). Early trials showed their toxicity while recent trials suggest superior efficacy. Trials of DMARD combinations have enrolled different types of patient (early or established RA), used different designs (step-up, parallel or step-down) and utilized a range of outcome measures. We undertook a systematic review of combination DMARD therapy for RA and carried out a meta-analysis to evaluate the evidence for efficacy and toxicity. METHOD Medline, PubMed and EmBase were searched using MESH headlines 'arthritis, rheumatoid', 'drug therapy, combination' and 'randomized controlled trial' (RCT) for papers published from 1975 to April 2004. References from published articles were also searched. Three independent assessors evaluated abstracts and selected trials for detailed examination. Trials were excluded if their quality was poor, were not published in English or studied DMARDs not licensed to treat RA. Two independent assessors extracted data. Efficacy was assessed by the numbers of patients withdrawn due to lack of efficacy. Toxicity was assessed by the numbers of patients withdrawn due to adverse events. Risk ratios (RR) with 95% confidence intervals (CI) were calculated and meta-analysis was carried out based on a random effects model. Sensitivity analyses evaluated different treatment combinations, trial designs, study populations and outcome measures. RESULTS Fifty-three potentially relevant RCTs were identified. Twelve were excluded due to: using unlicensed DMARDs (n = 3); reporting in journal supplements of RCTs already included (n = 2); follow-up of an earlier RCT, report of biological outcomes or pharmacokinetics (n = 5); and non-English language publications (n = 2). Forty-one RCTs were evaluated in detail and another five excluded (three open-labelled studies and two with high patient attrition); 36 studies were included in the meta-analysis. These comprised 13 step-up, 16 parallel and 7 step-down trials. Nine assessed early RA and 27 established RA. Seven added steroids to DMARD monotherapy and one study added steroids to DMARD combinations. Six assessed methotrexate (MTX) plus tumour necrosis factor (TNF) inhibitors. Overall, combination DMARD therapy was more effective than monotherapy (RR 0.35; 95% CI 0.28, 0.45) although the risk of toxicity was also slightly higher (RR 1.37; 95% CI 1.16, 1.62). Combinations of MTX with TNF inhibitors and MTX with sulphasalazine or anti-malarials showed good efficacy/toxicity ratios. CONCLUSIONS DMARD combinations vary in their efficacy/toxicity ratio. MTX plus sulphasalazine and/or anti-malarials and MTX plus TNF inhibitors have particularly favourable benefit/risk ratios.
An Effective Approach to Realizing Planning Programs

Planning programs are loose, high-level, declarative representations of the behavior of agents acting in a domain and following a path of goals to achieve. Such programs are specified through transition systems that can include cycles and decisions to make at certain points. We investigate a new effective approach for solving the problem of realizing a planning program, i.e., informally, for finding and combining a collection of plans that guarantee the planning program executability. We focus on deterministic domains and propose a general algorithm that solves the problem exploiting a planning technique handling goal constraints and preferences. A preliminary experimental analysis indicates that our approach dramatically outperforms the existing method based on formal verification and synthesis techniques.
Design and implementation of a radiation tolerant on-board computer for science technology satellite-3

This paper describes the design and implementation of a radiation tolerant on-board computer (OBC) for the science and technology satellite-3 (STSAT-3). SRAM-based FPGAs are replacing traditional integrated circuits for space applications. However, it is difficult to employ the approach in space applications without radiation tolerant schemes to deal with the radiation effects such as single event upset (SEU). To mitigate the SEU effect, we apply a triple modular redundancy (TMR) scheme to the STSAT-3 OBC based on FPGA. Although there is an overhead in area, power and minimum clock period, we notice through a radiation test in an irradiation facility that our TMR based OBC is immune to the radiation environments up to a proton energy of 20.3MeV. The radiation environment of the test is expected to be more severe than the environment in which STSAT-3 is to be located.
Analysis of Improved Square-Root Algorithm Based on Efficient Inverse Cholesky Factorization for V-blast MIMO Wireless Communications

Vertical Bell Laboratories Layered Space time (V-BLAST) detection schemes are widely used in time critical application involving high speed packet transfer using MIMO for 3GPP and 3GPP-2 standards. As the number of transmitting and receiving antennas is increased, employing efficient square root algorithm yields high computational cost due to the inefficient utilization of orthogonal or unitary transformations and discarding intermediate results without any usage. Reduction in the computational cost is achieved by improved square root algorithm which utilizes intermediate results that were discarded without any usage in the original square-root algorithm. Further reduction in computational cost can be achieved by employing a fast algorithm for inverse Cholesky factorization used to compute a triangular square-root of the estimation error covariance matrix which is then applied to improved square-root algorithm. This paper compares the performance between the improved square root algorithm with minimum mean square error (MMSE) filter and an Improved Square-Root Algorithm Based on Efficient Inverse Cholesky Factorization with MMSE filter when subjected to multi-media application for various numbers of transmitting and receiving antennas with varying SNR. Performance parameters considered include bit error rate (BER), symbol error rate (SER), peak signal-to- noise ratio (PSNR), number of number of floating point operations (FLOPS), Time required for detection. The number of floating point operation (FLOPS) required for detection for improved square root algorithm based on efficient inverse cholesky factorization with MMSE for 16 transmitting and 16 receiving antennas is 0.6 x 10 6 , a reduction of 2.9x10 6 , 4.2x10 6 , 5.4x10 6 and 5.6x10 6
Design of a two degree of freedom resonant miniature robotic leg

This article identifies the design considerations for a two degree of freedom (DoF) miniature robotic leg utilizing piezoelectric bimorph actuators with a specific focus on the resonance modes of the system. An analytical model was developed using three independent lumped mass models with superposition for tuning the resonance frequencies and optimizing the performance of the leg. The model was verified both experimentally and using finite element analysis (FEA).
A soft wearable sleeve for joint stiffness modulation

In this paper, we present the design and analysis of a soft wearable sleeve capable of modulating the stiffness of a joint. The sleeve uses a novel fabric-like architecture of miniaturized soft fluidic actuators known as Fiber Reinforced Elastomeric Enclosures (FREEs). By selective actuation of FREEs in this architecture, we demonstrate joint stiffening in either one or both directions. The paper presents an analytical formulation to capture this stiffness modulation by (a) predicting stroke and forces generated by individual FREEs, and (b) applying them in the context of the architecture geometry to predict joint stiffness. We further verify the stiffness model with experimental bench top testing. The sleeve is soft, lightweight and discreet - worn under standard clothing - and can be configured for any joint and size.
Arbitrary Waveform Generation Using Memristive Cross Bar Array

With the advent memristor and the development of cross bar architecture using it, has led to an influx in the development of programmable analog circuits. Prior to this, the arbitrary waveform generation was based on a memory driven system, where the data values to be read out at any particular instant of time was stored in the system memory. Thus, the maximum operating frequency of such a system was based on the speed of the read out processor employed. In this paper we have proposed a cross bar architecture based arbitrary waveform generator, where the waveform to be generated is incorporated into the system as a wiring and doesn't need any read out device as such. Thus, owing to the fact that no real time processors are involved, it can perform much faster than the traditional methods, since it is hardware driven. The proposed method can be implemented to realize almost any waveform that can be graphically visualized.
DirectoryRank: ordering pages in web directories

Web Directories are repositories of Web pages organized in a hierarchy of topics and sub-topics. In this paper, we present DirectoryRank, a ranking framework that orders the pages within a given topic according to how informative they are about the topic. Our method works in three steps: first, it processes Web pages within a topic in order to extract structures that are called lexical chains, which are then used for measuring how informative a page is for a particular topic. Then, it measures the relative semantic similarity of the pages within a topic. Finally, the two metrics are combined for ranking all the pages within a topic before presenting them to the users.
Practicability study of android volatile memory forensic research

As Android device and application storage encryption becomes more widespread, memory analysis becomes more important. Memory is often the only data immediately accessible without decryption and in most cases stores the encryption keys of persistent data currently in use. This work therefore investigates the practicability of current research in forensics with regard to acquiring and analyzing volatile memory of Android smartphones. To this end, we investigate 8 different Android smartphones in their stock vendor configurations. While we are able to recreate current research results by specifically preparing specific phones the same way as described in the relevant research publications, we are only able to conduct a full acquisition and full analysis against 1 of our 8 sample smartphones in its stock configuration. Because the stock configuration, as shipped by the manufacturer, i.e. non-rooted and locked boot loader, is the most likely configuration encountered by forensic investigators, we unfortunately must conclude that current research methods are not applicable in practice. We further present reasons for our conclusion and possible resolutions which should be endeavored by future research.
Distributed Computation of Sparse Cuts via Random Walks

A sparse cut of a graph is a partition of the vertices into two disjoint subsets such that the ratio of the number of edges across the two subsets divided by the sum of degrees of vertices in the smaller side is minimum. Finding sparse cuts is an important tool in analyzing large-scale distributed networks such as the Internet and Peer-to-Peer networks, as well as large-scale graphs such as the web graph, online social communities, and VLSI circuits. Sparse cuts are useful in graph clustering and partitioning among numerous other applications. In distributed communication networks, they are useful for topology maintenance and for designing better search and routing algorithms. In this paper, we focus on developing a fast distributed algorithm for computing sparse cuts in networks. Given an undirected n-node network G with conductance φ, the goal is to find a cut set whose conductance is close to φ. We present a distributed algorithm that finds a cut set with sparsity Õ(√φ) (Õ hides polylog n factors). Our algorithm works in the CONGEST distributed computing model and outputs a cut of conductance at most Õ (√φ) with high probability, in Õ(1/b(1/φ + n)log2) rounds, where b is balance of the cut of given conductance. In particular, to find a sparse cut of constant balance, our algorithm takes O((1/φ + n)log2 n) rounds. Our algorithm can also be used to output a local cluster, i.e., a subset of vertices near a given source node, and whose conductance is within a quadratic factor of the best possible cluster around the specified node. Our distributed algorithm can work without knowledge of the optimal φ value (with only a log n factor slowdown) and hence can be used to find approximate conductance values both globally and with respect to a given source node. Our algorithm uses random walks as a key subroutine and is fully decentralized and uses lightweight local computations. We also give a lower bound on the time needed for any distributed algorithm to compute any non-trivial sparse cut --- any distributed approximation algorithm (for any nontrivial approximation ratio) for computing sparsest cut will take Ω (√n + D) rounds, where D is the diameter of the graph. Our algorithm can be used to find sparse cuts (and their conductance values) and to identify well-connected clusters and critical edges in distributed networks. This in turn can be helpful in the design, analysis, and maintenance of topologically-aware networks.
THE RELATIONSHIP BETWEEN FL LISTENING ANXIETY AND FL LISTENING STRATEGIES: THE CASE OF TURKISH EFL LEARNERS

-It is assumed that learners may feel anxious while listening in the target language due to many factors such as the authenticity of the listening text, incomprehensibility of the listening material and environmental factors. In this respect, developing effective listening strategies may help to overcome many problems related to target language listening. It is then of interest for reserachers to investigate whether there is a relationship between FL listening anxiety and FL listening strategies. In the Turkish EFL context, studies concerning this issue are scarce. This study aims at filling the gap in the recent literature on listening anxiety and listening strategies in Turkish EFL context. For this purpose, 60 students at the intermediate English proficiency level participated in the study. Both quantitative and qualitative findings indicated a negative association between FL listening anxiety and strategy use. The results of the study were discussed in the light of the recent literature and it has been put forward that investigation of anxiety and strategy use for listening skill is crucial for improving effective listening in the classroom context. Key-Words: Listening in FL, FL Listening Anxiety, FL Listening Strategies,
The Use of Self-Regulated Cognitive Strategies Across Students With Different Immigrant Backgrounds and Gender

Cognitive self-regulation is regarded as necessary for enhancing academic success and the possibility of lifelong learning. This study, based on 263,683 Italian 10th-grade students, examines the use of self-regulated cognitive strategies in immigrant and native students, as well as in boys and girls. Preliminarily, we examined the psychometric properties and measurement invariance across the groups of the short four-factor scale adopted. Immigrant students report less use of self-regulated cognitive strategies than natives and that this use diminishes from one generation of immigrants to the next. Also boys report lower levels of cognitive self-regulation than girls. On the whole, these findings indicate that male and immigrant students systematically use less self-regulated cognitive strategies in studying. Improvements in their cognitive self-regulation should therefore increase the chances of academic success in these groups of students, which tend to have lower performances at school across the industrialized countries.
The EDF Experience in Clustering Suites for Debian , Toward OSCAR on Debian

Linux clusters are now an interesting solution to execute numerical simulations. But cluster use implies problems of deployment, because of their distributed architecture. In the past, each company developed his own solution based on various tools. Today, software suites like OSCAR are available and can be freely used. But such solutions may not be adapted to the current computing architecture of companies. For example, the current solution deployed inside a company may be based on a Linux distribution not supported by a software suite like OSCAR. Nevertheless, the use of software suite like OSCAR is very interesting inside companies which are not specialized in cluster