Miracle-dz/UniFAR-FTUs huggingface dataset:
A Multidisciplinary Study Of Gender-Based Research Productivity In The World's Best Journals

The past academic gender literature has focused on the underproduction of academic women in research outcomes and related reasons such as prejudice, more frequent career breaks and personality differences between genders. This study examines the top six journals in the world and finds no difference between women and men productivity when the percentage of women participating in the academic work force is factored in. Women have a 30-35% participation rate in academic university positions and represented almost 30% of the authors in the top tiered journals. There are also no significantly statistical differences in Journal Impact Factor ratings between men and women. These findings are consistent across all the major disciplines, science, business and social science. Other trends are noted such as the significantly higher number of authors in science journals and the different trends between US and non-US authors. Science authors quality (as measured by Journal Impact Factor (JIF of 31.9) is significantly higher than non-science authors (JIF 6.5); thus differences in quality are discipline specific not a gender issue. The implications are that academic womens research contribution matches that of a mans productivity.
On the Space Complexity of Renaming

We study the space complexity of implementing long-lived and one-shot adaptive renaming from multi-reader multi-writer registers, in an asynchronous distributed system with $n$ processes. %Given that $f: \{1,\dots,n\} \rightarrow \mathbb{N}$ is a non-decreasing function, As a result of an \emph{$f$-adaptive renaming algorithm} each participating process gets a distinct name in the range $\{1,\dots,f(k)\}$ provided $k$ processes participate. Let $f: \{1,\dots,n\} \rightarrow \mathbb{N}$ be a non-decreasing function satisfying $f(1) \leq n-1$ and let $d = \max\{x ~|~ f(x) \leq n-1\}$. We show that any non-deterministic solo-terminating long-lived $f$-adaptive renaming object requires $d + 1$ registers. This implies a lower bound of $n-c$ registers for long-lived $(k+c)$-adaptive renaming, which we observe is tight. We also prove a lower bound of $\lfloor \frac{2(n - c)}{c+2} \rfloor$ registers for implementing any non-deterministic solo-terminating one-shot $(k+c)$-adaptive renaming. We provide two one-shot renaming algorithms: a wait-free algorithm and an obstruction-free algorithm. %a wait-free and an obstruction-free one-shot renaming algorithm. Each algorithm employs a parameter to depict the tradeoff between space and adaptivity. When these parameters are chosen appropriately, this results in a wait-free one-shot $(\frac{3k^2}{2})$-adaptive renaming algorithm from $\lceil \sqrt{n} \rceil + 1$ registers, and an obstruction-free one-shot $f$-adaptive renaming algorithm from only $\min\{n, x ~|~ f(x) \geq 2n\} + 1$ registers.
Promoting Students' Paragraph Writing Using EDMODO: An Action Research.

This paper reports the findings of an action research that was carried out to measure the effectiveness of integrating a social networking website “Edmodo” in students’ writing performance in an EFL classroom at Arab Open University (Oman Branch). The participants were 25 students studying English in the Foundation Programme. Along with three lesson plans that were used to teach students the writing process, students conducted some quizzes, discussions and activities on Edmodo. Analysis of students’ second writing showed a statistically significant improvement in students’ writing. A post-treatment questionnaire results indicated that students have positive perceptions towards using Edmodo in language learning.
Computer Inclination of Students and Teachers in Relation to Their STS Views

The computer inclination (CI) of 881 eleventh-grade students and of their 181 teachers in relation to their Science-Technology-Society (STS) views was assessed in randomly selected high schools in British Columbia using a two-part questionnaire: a short, modified version of the Survey of Attitudes Toward Learning About and Working With Computers for the CI, and a condensed form of the Views on Science-Technology-Society (VOSTS) Inventory for the STS views. Significant differences between the computer inclinations of non-STS and STS students and between the STS views of non-STS and STS teachers and students in the “attitude” category were found, but there were no differences between other subgroups on these dimensions. Computer Inclination Indices (CII) and Science/Technology Indices (STx) have been defined and used for the elucidation of possible correlations between the CIIs and the STxs. It is argued that the CIs and STS views of both students and teachers should be assessed and taken into consideration by the educational policy makers and developers of future science curricula and teacher training programs, if the goals of the currently sought reforms in science education are to be attained.
REINFORCEMENT LEARNING OF BIPEDAL LATERAL BEHAVIOUR AND STABILITY CONTROL WITH ANKLE-ROLL ACTIVATION

Nimble bipeds are expected to execute a rich repertoire of movement behaviours and switch between them seamlessly without falling over. A good example demanding this responsiveness is playing a game of soccer. This paper explores a less well studied approach to biped locomotion using model-based multigoal reinforcement learning. We apply this approach to learn the side-to-side movement of a small humanoid robot in simulation. By on-line learning one transition function, it is possible to modify the behaviour of the robot varying the cost function. Behaviours include: changing support feet at different frequencies; standing upright; standing on either foot; and switching between these behaviours, subject to the imposed constraints. The behaviours are stable over much of the experienced phase domain. They respond optimally to disturbances and when switching.
Communication Issues in Agile Software Development

Scrum framework is a growing trend in software industry to companies that are looking for development agile ways. In their early days, this methodology required that the working team members were established in a unique room, because it is necessary to have great communication and working together. However, it is a common increasingly practice that the teams are in geographically dispersed places, which means that it is necessary to adapt and/or look for the way that this methodology is suitable in these contexts. There are many experiences in the industry where we can see communication issues due to this kind work. In this paper we will briefly explain the Scrum framework definition, the Global Software Development (GSD) context, and the practices used in different case studies to solve the issues when applying Scrum in GSD.
Dynamic Swapping and Marking Queue Management

 Abstract—In this paper, we propose a simple and effective queue management scheme to provide fairness and differentiated drop precedence at the same time, that is, Dynamic Swapping and Marking (DSM). The DSM dynamically swaps the counts of current queue length between both packets according to their drop precedence within the same flow. In addition, the DSM selectively marks a resided packet with the maximum count among competing flows. Simulation results show that DSM achieves good fairness and sufficient differentiated drop precedence under various traffic conditions.
Adaptive-delay based reconfigurable asynchronous pipeline

This paper presents the asynchronous pipeline model implementable on FPGA platforms. The proposed event-controlled register acts as true adaptive delay element which adaptively prolongs the process of latching of data to store only the valid results, unlike other asynchronous approaches. Bundle data strategy with two-phase handshake protocol is used. In order to ensure the validity of the proposed pipeline, a fourth-order FIR filter was implemented on Xc7a100t-1csg324 FPGA. It was observed that the asynchronous pipeline implemented using auto place and route tools, adapts the delays of the data path and exhibits smooth functionality, with throughput supremacy over its synchronous counterpart.
EFFICIENCY OF DECISION TREES IN PREDICTING STUDENT'S ACADEMIC PERFORMANCE

data mining is used to study the data available in the educational field and bring out the hidden knowledge from it. Classification methods like decision trees, rule mining, Bayesian network etc can be applied on the educational data for predicting the students behavior, performance in examination etc. This prediction will help the tutors to identify the weak students and help them to score better marks. The C4.5 decision tree algorithm is applied on student's internal assessment data to predict their performance in the final exam. The outcome of the decision tree predicted the number of students who are likely to fail or pass. The result is given to the tutor and steps were taken to improve the performance of the students who were predicted to fail. After the declaration of the results in the final examination the marks obtained by the students are fed into the system and the results were analyzed. The comparative analysis of the results states that the prediction has helped the weaker students to improve and brought out betterment in the result. To analyse the accuracy of the algorithm, it is compared with ID3 algorithm and found to be more efficient in terms of the accurately predicting the outcome of the student and time taken to derive the tree. KEYWORDSPrediction, Educational data mining, Decision tree, C4.5algorithm, ID3 algorithm
Spqr: formal foundations and practical support for the automated detection of design patterns from source code

Maintenance costs currently comprise the majority of total costs in producing software. While object-oriented techniques and languages appear to have assisted in the production of new code, there is little evidence to support the theory that they have helped lower the high cost of maintenance. In this dissertation, I describe the current problem and provide a system ultimately aimed at reducing this cost. The System for Pattern Query and Recognition, or SPQR, consists of: the rho-calculus, a formal foundation for conceptual relationships in object-oriented systems; a suite of Elemental Design Patterns that capture the fundamentals of object-oriented programming and their expressions in the rho-calculus; an XML Schema, the Pattern/Object Markup Language, or POML, to provide a concrete method for expressing the formalisms in a practical manner; an example mapping from the C++ programming language to POML; an implementation which ties the above components together into a practical tool that detects instances of design patterns directly from source code using the Otter automated theorem prover. I will discuss each of the components of the system in turn, and relate them to previous research in the area, as well as provide a number of future research directions. Using the results of SPQR, a system can be more easily documented and understood. The major contribution of SPQR is the flexible detection of design patterns using the formalisms of rho-calculus instead of static structural cues. Building on SPQR, I propose: a suite of metrics utilizing the Minimum Description Length principle that capture the salient conceptual features of source code as expressed in design patterns nomenclature as a method for measuring comprehensibility of code: an approach for mapping these metrics to cost-based metrics from current management principles. This combination should prove to be effective in facilitating communication between technical and managerial concerns in a manner that allows for the most efficient allocation of resources during maintenance of software systems.
Architekturkonzepte für prozessorbasierte MPEG Videodecoder mit Schwerpunkt für mobile Anwendungen

The texture data of the reference vop is vertical interpolated and copied to the outputbuffer (des). In: src: pointer to texture data, height: vertical blocksize, src_stride: stride of texture data, rc: rounding control InOut: Out: des: pointer to output buffer Modified: ***************************************************************************/ void VerFilter8(UInt8 *src,Int32 height,Int32 src_stride,UInt8 rc,UInt8 *des) { UInt32 i; UInt8 CONST *p, *s; UInt32 a, b; rc = 1 rc; s = (UInt8 CONST *) src; p = (UInt8 CONST *) src + src_stride; src_stride=src_stride-8; for( i = 0; i >1); a = *s++;b = *p++;*des++ = (UInt8)((rc + a + b) >>1); a = *s++;b = *p++;*des++ = (UInt8)((rc + a + b) >>1); a = *s++;b = *p++;*des++ = (UInt8)((rc + a + b) >>1); a = *s++;b = *p++;*des++ = (UInt8)((rc + a + b) >>1); a = *s++;b = *p++;*des++ = (UInt8)((rc + a + b) >>1); a = *s++;b = *p++;*des++ = (UInt8)((rc + a + b) >>1); a = *s++;b = *p++;*des++ = (UInt8)((rc + a + b) >>1); s+=src_stride;p+=src_stride; } } /*************************************************************************** Proto: void HorFilter8(UInt8 *src, Int32 height, Int32 src_stride, UInt8 rc, UInt8 *des) Author: Benno Stabernack / HHI Purpose: Gets prediction data with horizontal half-pixel interpolation. Abstract: The texture data of the reference vop is horizontal interpolated and copied to the outputbuffer (des). The texture data of the reference vop is horizontal interpolated and copied to the outputbuffer (des). In: src: pointer to texture data, height: vertical blocksize, src_stride: stride of texture data, rc: rounding control InOut: Out: des: pointer to output buffer Modified: ***************************************************************************/ void HorFilter8(UInt8 *src,Int32 height,Int32 src_stride,UInt8 rc,UInt8 *des) { Int32 i, x; UInt32 l, m; rc = 1 rc; src_stride-=8; Anhang A Programmauszuge ___________________________________________________________________________ 127 for(i=0; i >1); l = m; } src+=src_stride; } } /*************************************************************************** Proto: void HorVerFilter8( UInt8 *src, Int32 height, Int32 src_stride, UInt8 rc, UInt8 *des) Author: Benno Stabernack / HHI Purpose: Gets prediction data with horizontal and vertical half-pixel interpolation. Abstract: The texture data of the reference vop is horizontal and vertical interpolated and copied to the outputbuffer (des). The texture data of the reference vop is horizontal and vertical interpolated and copied to the outputbuffer (des). In: src: pointer to texture data, height: vertical blocksize, src_stride: stride of texture data, rc: rounding control InOut: Out: des: pointer to output buffer Modified: ***************************************************************************/ void HorVerFilter8(UInt8 *src,Int32 height,Int32 src_stride,UInt8 rc,UInt8 *des) { Int32 i, x; UInt32 l,m,n,o; UInt8 CONST *p; p= src + src_stride; src_stride-=8; rc = 2 rc; for(i=0; i >2); l = m; n = o; } src+=src_stride;p+=src_stride; }
Learning, knowledge and dynamic capabilities: theoretical implications for competitiveness and innovation in the 21st century

The aim of this paper is to support dynamic capabilities as a strategic tool for company management. We will begin by illustrating the evolution that can be discerned in the process of developing competitive advantage as a result of the organisation's internal analysis. In a first stage, interest was centred on understanding the nature of the firm's assets, and knowing which conditions would make it possible to turn them into lasting and sustainable sources of competitive advantage. During a second phase, interest was shifted towards the dynamic processes of generation, development and accumulation of assets. In this sense, dynamic capabilities are those which allow managers to activate and redirect the complex framework of influential economic and organisational factors, thus helping control the company's evolution and enhancing the organisation's wealth of opportunity. Dynamic capabilities are therefore key factors in optimising innovation and the overall strategic course of the company's future.
DBpedia Type and Entity Detection Using Word Embeddings and N-gram Models

ii Acknowledgement . iii List of Figures . vi List of Tables . vii Chapter 1: Introduction . 1 1.1 Motivation and Contributions . 4 1.2 Outline. 5 Chapter 2: Background and Related Work . 6 2.1 The Semantic Web and Linked Open Data. 6 2.2 Word and Entity Embeddings . 7 2.3 N-gram Models . 9 2.4 Machine Learning Techniques . 10 2.4.1 Clustering . 10 2.4.2 Classification . 11 2.5. Related Work . 14 2.5. 1. DBpedia and Linked Data Quality Assessment and Enhancement . 14 2.5. 2. Automatic Type Detection . 15 2.5. 3. Outlier Detection in Linked Data . 17 Chapter 3: Research Methodology. 19 3.1 General Architecture . 19 3.2 Entity Embedding Model Building . 20 3.3 Datasets Preparation. 23 3.3.1. Dataset for Entity Type Detection . 23 3.3.2. Dataset for Invalid Entity Detection . 26 3.4 N-gram Model Building . 30 3.5 Evaluation Metrics . 30 Chapter 4: DBpedia Entity Type Detection . 33 4.1 Experiment Introduction and Setup . 33 4.2 Clustering Evaluation. 34 4.2.1 Clustering with N-gram Models . 34
(Scientific Note) A Fault-Tolerant Model for Replication in Distributed-File Systems

In this paper, we propose a new fault-tolerant model for replication in distributed-file systems. We combine the advantages of the modular redundancy, primary-stand-by, and weighted priority schemes to address the fault-tolerant model. To fulfill the fault-tolerant requirements, we use the ideas of directoryoriented replication and the extended prefix table while incorporating a two-level heap data structure. In a consideration of practical circumstances, the heap, using an array instead of a linked-list tree structure, has a dynamically adjustable property, which can be used to easily modify the tree structure in the distributed-file system. Therefore, this fault-tolerant model provides low-cost overhead, a variety of transparency capacities, a fault-tolerant capacity, and a parallel commitment capacity on backup replicas for distributed-file systems.
Evaluation of existing resources (study/analysis)

Within TACCLE 3 – Coding European Union Erasmus+ KA2 Programme project, a review and evaluation of a set of resources that can contribute to teaching programming to younger children has made. This document represents the TACCLE 3 O4 deliverable entitled “Evaluation of existing resources (study/analysis)”.
Medical image registration and soft tissue deformation for image guided surgery system

In parallel with the developments in imaging modalities, image-guided surgery (IGS) can now provide the surgeon with high quality three-dimensional images depicting human anatomy. Although IGS is now in widely use in neurosurgery, there remain some limitations that must be overcome before it can be employed in more general minimally invasive procedures. In this thesis, we have developed several contributions to the field of medical image registration and brain tissue deformation modeling. From the methodology point of view, medical image registration algorithms can be classified into feature-based and intensity-based methods. One of the challenges faced by feature-based registration would be to determine which specific type of feature is desired for a given task and imaging type. For this reason, a point set registration using points and curves feature is proposed, which has the accuracy of registration based on points and the robustness of registration based on lines or curves. We have also tackled the problem on rigid registration of multimodal images using intensity-based similarity measures. Mutual information (MI) has emerged in recent years as a popular similarity metric and widely being recognized in the field of medical image registration. Unfortunately, it ignores the spatial information contained in the images such as edges and corners that might be useful in the image registration. We introduce a new similarity metric, called Adaptive Mutual Information (AMI) measure which incorporates the gradient spatial information. Salient pixels in the regions with high gradient value will contribute more in the estimation of mutual information of image pairs being registered. Experimental results showed that our proposed method improves registration accuracy and it is more robust to noise images which have large deviation from the reference image. Along with this direction, we further improve the technique to simultaneously use all information obtained from multiple features. Using multiple spatial features, the proposed algorithm is less sensitive to the effect of noise and some inherent variations, giving more accurate registration. Brain shift is a complex phenomenon and there are many different reasons causing brain deformation. We have investigated the pattern of brain deformation with respect to location and magnitude and to consider the implications of this pattern for correcting brain deformation in IGS systems. A computational finite element analysis was carried out to analyze the deformation and stress tensor experienced by the brain tissue during surgical operations. Finally, we have developed a prototype visualization display and navigation platform for interpretation of IGS. The system is based upon Qt (cross-platform GUI toolkit) and it integrates VTK (an object-oriented visualization library) as the rendering kernel. Based on the construction of a visualization software platform, we have laid a foundation on the future research to be extended to implement brain tissue deformation into the system.
Action Research in Bridging the Gap Between Theory and Practice: A Study of the Evaluation and Reporting of Student Achievement

The theory and practice of evaluating student academic performance has been a source of concern in academia for over a century. The challenge of successfully implementing assessment practices that reflect the true measure of a student’s academic achievement, and that accurately and effectively communicate the student’s level of mastery to stakeholders, has not been met according to measurement specialists. This study was designed to examine the implementation process of research-based classroom assessment practices that both accurately measure the academic achievement of students and effectively communicate the students’ level of mastery. Interviews were conducted to examine the practicality of the assessment practices and whether the evidences gathered from these practices support performance grades that accurately articulate student achievement. The study showed that recommendations from measurement specialists are practical assessments for the classroom, accurately measure the academic achievement of students, and effectively communicate the students’ level of mastery. However, training in pre-service teacher programs that continue to be supported by in-service professional development is critical to the successful implementation of the recommendations, and to bridging the gap between theory and practice.
A Survey on Performance Analysis of Different Transforms in DWT for Image Compression

The use of different digital devices is increasing every day. Thus it is necessary to compress images to make efficient transfer and storage of data. Wavelet is the image compression algorithm. It is Discrete Wavelet Transforms (DWT). Wavelet algorithms can process data at different scales or resolutions. The different wavelets used for image compression are Haar, Daubechies, Biorthogonal and Symlet. This paper presents a comparative study of various wavelet families for image compression and tests the results in terms of compressed image quality. The results are measured in terms of MSE, PSNR, CR and Elapsed time for compression considering as subjective quality measures.