Miracle-dz/UniFAR-FTUs huggingface dataset:
ILS Tech Report: 001 (4/9/07) ACHIEVING IMPROVED RETRIEVAL PERFORMANCE ASSESSMENT FOR AN EXPERIMENTAL QUESTION-ANSWERING SYSTEM

Assessing the performance of a complex computer-based information retrieval system is desirable but not simple. Measurements that indicate quality of retrieval, although not the only consideration in assessing system performance, are central. However, measurements of precision and recall are difficult to validate because they involve the subjective concept of relevance, and may also be difficult to obtain because they involve labor-intensive procedures for judging relevance that are outside of normal system use. Performance evaluation for an interactive question-answering system presents further difficulties because the user-driven retrieval criteria do not remain fixed throughout a search session. An approach is described that is being developed and implemented for assessing retrieval performance of the HITIQA experimental question-answering system which is configured to facilitate the on-line generation of a search report as an integral part of a search session. Each item in the system’s database has a unique identification code, which is carried into a session record when that item is cited in the session report. Extensive data are collected automatically by the HITIQA system; reports produced by searchers are added to the data collected automatically. All of this can be used to generate a variety of measurements reflecting retrieval performance from different points of view regarding relevance. In one retrieval assessment approach, items used in searchers’ reports are considered relevant by definition, making the calculation, comparison, or tracking of searchers’ retrieval performance with respect to reporting more-or-less objective and programmable. Alternative programmable definitions of relevance may be used to assess aspects of retrieval performance from different viewpoints; measurements may be chosen to focus on performance of searchers, or on evaluation of the retrieval system or its specific components, or on performance with different user access provisions, different search question topics and formats, or comparisons of retrieval performance when different sources are used for stocking the system’s database.
Detection and prevention of LeNa Malware on Android

Smartphones contain security-sensitive information of a user such as contacts, SMS, photos, and GPS information. Because smartphones are always turned on and ready to connect to the Internet, that sensitive information is in danger of leakage. Various kinds of malware are more and more attacking smartphones, especially Android phones. We propose a scheme that protects Android phones against one of them, called LeNa. LeNa infects rooted Android phones and periodically leaks sensitive information of the phone. LeNa also dominates the system and makes the phone a zombie which can perform Distributed Denial of Service (DDoS) attack. The proposed scheme checks whether a process is allowed to execute a requesting operation even after the process have acquired the root privilege. This scheme can also protect smartphones from malware targeted for rooted phones.
A no reference image registration method using a LPM-based data hiding scheme

This paper proposes a new image registration method using no reference image. The proposed method embeds a two dimensional tracking pattern to the Fourier magnitude domain of an image to generate a stego image, by data hiding scheme based on a log-polar mapping. Once a stego image is geometrically deformed, this method estimates rotation angle and resizing scale by correlation between the original and extracted tracking patterns, then it compensates the deformed image without using any reference image. Experimental results show the effectiveness of the proposed method.
The SALSA Annotation Tool

The SALSA annotation tool supports the graphical annotation of a treebank with semantic roles in the frame semantics paradigm. The tool, which takes corpora in the TIGER XML format as input, supports the whole annotation process from subcorpus extraction to merging individual annotations, and allows for underspecified tags as well as tags beyond the sentence boundary and below the word boundary.
Comparative study of modern web browsers based on their performance and evolution

Internet is the most revolutionary invention of 20th century. It has contracted the world and made the lives of the people lucid and simple. Web browsers act as medium to access internet features and help us browse different websites for our daily purpose making most difficult tasks easier. In this paper, we will talk about advancement in field of web browser. Since it plays major role in field of internet, we will catch the significance and utility of popular browsers like Google Chrome, Internet Explorer, Mozilla Firefox, Opera, etc. performance evaluation will be done based on their performance in different user's environment. We have seen lot of variations in the versions of these web browsers from past decade and we will also focus on the variation and evolution of browsers with the alteration.
Special-effect edit detection using VideoTrails: a comparison with existing techniques

Video segmentation plays an integral role in many multimedia applications, such as digital libraries, content management systems, and various other video browsing, indexing, and retrieval systems. Many algorithms for segmentation of video have appeared within the past few years. Most of these algorithms perform well on cuts, but yield poor performance on gradual transitions or special effects edits. A complete video segmentation system must also achieve good performance on special effect edit detection. In this paper, we discuss the performance of our Video Trails-based algorithms, with other existing special effect edit-detection algorithms within the literature. Results from experiments testing for the ability to detect edits from TV programs, ranging from commercials to news magazine programs, including diverse special effect edits, which we have introduced.
Stereoscopic image generation based on region-wise rendering for 2D to 3D conversion

Depth image-based rendering (DIBR), which is used to render virtual views with a color image and the corresponding depth map, is one of the key techniques in the 2D to 3D conversion process. One of the main problems in DIBR is how to reduce holes that occur on the generated virtual view images. In this paper, a region-wise rendering framework, which divides the original image regions into three special classes and renders each with optimal adaptive process respectively, is introduced. With the optimized region-wise processing, kinds of existing DIBR methods can be combined together to achieve better visual rendering results. Numerical experimental results demonstrate the good performance of the proposed method.
Dielectric relaxation model in high-k materials: Simplified Kohlrausch-Williams-Watts function

The dielectric relaxation in the high-k materials, which would cause the metal-oxide-semiconductor field-effect transistor deterioration, is able to be fitted by several models. A novel model is proposed to simplify the original Kohlrausch-Williams-Watts (KWW) model. The proposed model has an analytical expression respectively in both high and low frequency domain. A critical comparison is made between the simplified model and the original model. The simplified KWW model is able to describe the dielectric relaxation data of high-k materials to a high degree of accuracy.
Carbon and Nitrogen Mineralization in Relation to Soil Particle-Size Fractions after 32 Years of Chemical and Manure Application in a Continuous Maize Cropping System

Long-term manure application is recognized as an efficient management practice to enhance soil organic carbon (SOC) accumulation and nitrogen (N) mineralization capacity. A field study was established in 1979 to understand the impact of long-term manure and/or chemical fertilizer application on soil fertility in a continuous maize cropping system. Soil samples were collected from field plots in 2012 from 9 fertilization treatments (M0CK, M0N, M0NPK, M30CK, M30N, M30NPK, M60CK, M60N, and M60NPK) where M0, M30, and M60 refer to manure applied at rates of 0, 30, and 60 t ha−1 yr−1, respectively; CK indicates no fertilizer; N and NPK refer to chemical fertilizer in the forms of either N or N plus phosphorus (P) and potassium (K). Soils were separated into three particle-size fractions (2000–250, 250–53, and <53 μm) by dry- and wet-sieving. A laboratory incubation study of these separated particle-size fractions was used to evaluate the effect of long-term manure, in combination with/without chemical fertilization application, on the accumulation and mineralization of SOC and total N in each fraction. Results showed that long-term manure application significantly increased SOC and total N content and enhanced C and N mineralization in the three particle-size fractions. The content of SOC and total N followed the order 2000–250 μm > 250–53μm > 53 μm fraction, whereas the amount of C and N mineralization followed the reverse order. In the <53 μm fraction, the M60NPK treatment significantly increased the amount of C and N mineralized (7.0 and 10.1 times, respectively) compared to the M0CK treatment. Long-term manure application, especially when combined with chemical fertilizers, resulted in increased soil microbial biomass C and N, and a decreased microbial metabolic quotient. Consequently, long-term manure fertilization was beneficial to both soil C and N turnover and microbial activity, and had significant effect on the microbial metabolic quotient.
Distributed Key Establishment Scheme in Wireless Sensor Network

Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Overhead imbalance of sensor nodes make it infeasible to use traditional key distribution center scheme for security service of distributed sensor network. In this paper we propose a distributed key establishment scheme. In the phase of key pre-distribution, every sensor node is preloaded the same size key pre-distribution information; in the phase of key establishment, the overhead every sensor node used to distribute key is the same. So, the overhead imbalance problem of traditional key distribution center scheme can be solved. A distinguishing property of this framework is that it does not require the knowledge of sensor’s expected location and greatly simplifies the deployment of sensor networks. In security, the relationship between the ratio of compromised links to non-compromised sensors and the number of compromised nodes is linear.
Topological Membranes with 3-Form H Flux on Generalized Geometries

We construct topological string and topological membrane actions with a nontrivial 3-form flux H in arbitrary dimensions. These models realize Bianchi identities with a nontrivial H flux as consistency conditions. Especially, we discuss the models with a generalized SU(3) structure, a generalized $G_2$ structure and a generalized $Spin(7)$ structure. These models are constructed from the AKSZ formulation of Batalin-Vilkovisky formalism.
Relation of Heart Rate and Systolic Blood Pressure to the Onset of Pain in Angina Pectoris

Arterial pressure was recorded directly and continuously in 15 patients with angina pectoris while pain was repeatedly induced by exercise of various types and severity. In every case, the precipitation of angina could be consistently related to the level reached by the product of heart rate and systolic blood pressure (corrected when necessary for changes in ejection time). This relationship persisted even when there were large variations in the type, intensity, and duration of the exercise and was also maintained in a patient in whom spontaneous and emotional episodes of pain were observed. A substantial improvement in exercise tolerance occurred in one patient and this was completely accounted for by a reduction in the circulatory response to exercise.It was concluded that the precipitation of angina is normally the result of a rise in the work of the myocardium to a critical level which is essentially fixed in each patient. The varying ease with which pain is provoked on different occasions can usually be explained by variations in circulatory response to the precipitating stress.
Towards robust hidden watermarking using multiple quasi-circles

Digital watermarking is the process of embedding a pattern or an icon into an image to establish legal ownership to protect the copyrights of the image in a publicly accessible image database. In this paper, we propose three robust watermarking schemes. One of our schemes, Diagonal Insersion (DI), modifies the Fourier coefficients of the middle frequencies of the input image, according to a binary string. Another scheme, Randomized Multiple Circles (RMC), is based on a technique proposed by Licks [8] which embeds a binary string by modifying the Fourier coefficients along concentric circles. We introduce a random perturbation into the radius of the circles to protect the waterwark from removal (cryptographic attack). A hybrid technique (HY) is also proposed to combine DI and RMC. These methods are robust against various attacks, such as geometric transformation, filtering, cropping and histogram equalization. Some experiemental results are also reported.
Self-Stabilization in Preference-Based Networks

Participants in a decentralized system often use some local ranking information in selecting effective collaborations. We say that such systems are preference-based for most practical types of preferences, such systems converge towards a unique stable configuration. In this paper, we investigate the speed and quality of the convergence process with respect to the model parameters. Our results provide insight into the design of system parameters, such as the number of connections or the algorithm for choosing new partners.
Language-based Security

Overview Software plays a critical role in our lives. We use it to pay our bills, keep in touch with our friends, and write our research papers. Unless software is secure and reliable, our finances, love letters, and jobs are at risk. The primary goal of my research is to develop programming languages and tools that mitigate security vulnerabilities and enhance software reliability. In practice, software security is characterized by an arms-race; software is written, exploited, patched, and exploited again. Researchers describe a menagerie of exploitable vulnerabilities, but I am most interested in two particular classes. Abstraction breaking vulnerabilities arise when a program's execution violates assumptions about its language semantics or operational environment, as happens, for instance, in a buffer overflow attack [5]. Logical vulnerabilities result from flaws in a program's design, implementation, or configuration. Evaluating untrusted code without access control restrictions [3] is an example. Language-based security techniques have proved useful for addressing both sorts of attacks. For instance, memory-safe languages like Java are generally immune to buffer overflows, and programmers can use Perl's taint-mode to avoid some command injection attacks. However, such techniques represent only the tip of a very exciting iceberg. The language-based security systems used in practice are ad hoc and cannot provide guarantees necessary for high-assurance systems. My research shows how cutting edge advances in type theory and the (mechanized) formalization of language semantics can enable language-based techniques to enforce security properties important to real-world applications. My main research focus is language-based security. I have investigated language support for authorization, audit, and cryptography. This section outlines my work in the area and describes ongoing research into type-based techniques that ensure confidential data is protected by appropriate encryption keys. Aura: programming with authorization and audit With my collaborators—including Steve Zdancewic, Limin Jia and Karl Mazurak—I developed the Aura programing language, which integrates functional programming, access control via authorization logic [2], and automatic audit logging [8]. Aura's programming model marries an expressive, principled way to specify access control policy with a practical policy-enforcement methodology that is well-suited for auditing access grants. Aura security policies are expressed as propositions in an authorization logic. Such logics are suitable for discussing delegation, permission, and other security-relevant concepts. Aura's (dependent) type system cleanly integrates standard data types, like integers, with proofs of authorization-logic propositions; this lets programs manipulate authorization proofs just like ordinary values. In addition, security-relevant implementation details—like the creation …
The Effect of Perceived Structure of Classroom on the Choice of Problem, Effort, Persistence and Academic Performance

The purpose of this study was to investigate the effect of perceived classroom structures on the choice of problem, effort and persistence in practical tasks and academic performance of students. The method used in this study was a pretest-posttest. 48 individuals were selected randomly and were divided into three groups of mastery structure, performance structure and control. The data was analyzed using multivariate analysis of variance (MANOVA). Results revealed that the mean scores for effort in mastery group were significantly higher than that of performance (p<0.01) and control group (p<0.001). In addition, the average scores for effort in performance group were significantly higher than the scores in control group (p<0.05). The average scores for choice of problem and academic performance in mastery group were significantly higher than the scores in control group (p<0.05). Finally, there was no significant difference between the average scores of persistence among groups. Mastery structure of the classroom is very effective in creating progress behavior and increasing academic performance.
Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing

We study the problem of selecting K arms with the highest expected rewards in a stochastic n-armed bandit game. Instead of using existing evaluation metrics (e.g., misidentification probability (Bubeck et al., 2013) or the metric in EXPLORE-K (Kalyanakrishnan & Stone, 2010)), we propose to use the aggregate regret, which is defined as the gap between the average reward of the optimal solution and that of our solution. Besides being a natural metric by itself, we argue that in many applications, such as our motivating example from crowdsourcing, the aggregate regret bound is more suitable. We propose a new PAC algorithm, which, with probability at least 1 - δ, identifies a set of K arms with regret at most e. We provide the sample complexity bound of our algorithm. To complement, we establish the lower bound and show that the sample complexity of our algorithm matches the lower bound. Finally, we report experimental results on both synthetic and real data sets, which demonstrates the superior performance of the proposed algorithm.
Action, change, and co-teaching; professional relationships and professional learning during the Induction of newly qualified teachers

The induction stage of teacher education in Ireland is currently at a major turning point. In 2013, the Teaching Council embarked on piloting a new form of induction and probation of teachers known as Droichead (Teaching Council, 2013a); this involved practising, experienced teachers mentoring and supporting newly qualified teachers (NQTs) during induction. It also involved mentors and principal teachers in the assessment of NQT progress; the assessment role was traditionally the remit of the Inspectorate as probationary work with NQTs. For various reasons, this departure has been met with opposition from within the profession and from teacher unions. A central focus of my research is an exploration of co-teaching as a pedagogy, as used by mentors and NQTs during the induction process. This research was conducted in a range of schools: DEIS, urban, rural, Droichead pilot schools, and special schools. Collaborative action research (CAR) engaged the participants in co-teaching lessons and professional development meetings. Collaborative practices were developed and fostered in schools and across school settings in communities of practice, which affected participants’ professional learning. The findings suggest that tensions, which NQTs and mentors face whilst establishing a professional relationship, were dealt with during reflections on practice and participation in co-teaching. Sharing of professional responsibility and collaboration, whilst still fostering the needs of teacher education at induction level, also added to the continuing professional learning of mentors. These areas are represented in the model for the development of professional learning and professional relationships through coteaching with CAR, which was designed in this study. The model developed here created a space where professional learning was developed in conjunction with professional relationships. This model moved away from the traditional models of induction and, instead, embraced innovation in teacher education in an Irish context.
Are you fluent in sexual emoji?: Exploring the use of emoji in romantic and sexual contexts

Abstract:This research presents an exploratory study of how individuals use emoji, specifically in sexually suggestive contexts. Emoji are small images that depict emotions, concepts, or items that are used in computer-mediated communication in order to add context, emotion, and personality to messages. The dataset consists of 693 participants recruited via online social networks and forums. Results indicate that the use of emoji play a significant role in the sending and receiving of sexually suggestive messages; of individuals who have sent these messages, 51% report that the use of emoji led to the sexually suggestive behaviour and 54% report that emoji appear in their messages sometimes, often, or always. The three most common object emoji last sent and received in a sexually suggestive message are the tongue (
Synchronized Control Algorithm for the Precise Tracking of 4-SPS(PS) Type Parallel Manipulator

In precise tracking control system of parallel manipulator, the different of the dynamic characteristics of each actuator are the main reasons effect the precise tracking performance, that is, high-precision tracking control of parallel manipulator depends not only on the position accuracy of each actuator, but also on the dynamic characteristic synchronization of all actuators. This paper presents a synchronized control algorithm for the precise tracking control of 4-SPS(PS) type parallel manipulator by select a tracking error as a standardize which response slowest among all actuators (defined as the synchronization error). Compared with this standardize tracking error, sliding mode synchronous control is developed with feedback of the synchronization errors of tracking errors among actuators. The controller can stabilize the tracking of each actuator, and meanwhile synchronize all actuators’ tracking so that both position and synchronization errors converge to zero. It is proved that the proposed scheme can guarantee global stability of the system by Lyapunov stability theory. Simulation results demonstrate the control algorithm is feasible and valid