Miracle-dz/UniFAR-FTUs huggingface dataset:
Extending modularity by capturing the similarity attraction feature in the null model

Modularity is a widely used measure for evaluating community structure in networks. The definition of modularity involves a comparison of within-community edges in the observed network and that number in an equivalent randomized network. This equivalent randomized network is called the null model, which serves as a reference. To make the comparison significant, the null model should characterize some features of the observed network. However, the null model in the original definition of modularity is unrealistically mixed, in the sense that any node can be linked to any other node without preference and only connectivity matters. Thus, it fails to be a good representation of real-world networks. A common feature of many real-world networks is "similarity attraction", i.e., edges tend to link to nodes that are similar to each other. We propose a null model that captures the similarity attraction feature. This null model enables us to create a framework for defining a family of Dist-Modularity adapted to various networks, including networks with additional information on nodes. We demonstrate that Dist-Modularity is useful in identifying communities at different scales.
A new concept of electrical power supply for AC arc furnaces

Electrical arc furnaces (EAFs) cause many power quality problems on the power network. Static var compensator or STATCOM are typically used for power quality requirements. In this paper the authors evaluate different STATCOM control strategy on the power system for two points of view: power quality requirements and furnace productivity enhancement. Simulation results, based on a new arc furnace electrical model developed with measurements carried out on a 75 MVA AC arc furnace, are shown. Finally the authors propose, for AC arc furnaces, a power electronic supply which suppress the flicker effect and increases the electrical energy transferred to the furnace. Compared to a STATCOM solution which has no effect on the arc current, the proposed supply allows increasing the furnace productivity
A Qos Guided Task Scheduling Model in Cloud Computing Environment

The management of resources and scheduling in cloud computing environment is a complex undertaking mainly due to resource's geographic distribution, heterogeneity and dynamic. A QoS guided task scheduling model, being composed of some scheduling strategies and a QoS guided scheduling Sufferage-min heuristic algorithm, is presented. Taking account for not only the resources' properties of dynamic and heterogeneity, but also the multi QoS levels of both the resources and tasks, this model try to improve the scheduling efficiency by dividing the tasks and resources into two groups of high QoS level and low QoS level and using different scheduling approach respectively. The following experiment shows that the make span value, the key performance, is successfully being shorten.
Effect analysis of an improved performance evaluation algorithm

The performance of information systems is a very important and complicated consideration. With the help of a proper performance model and evaluation algorithm, performance metrics can be predicted. The goal of our work is to improve the mean-value analysis evaluation algorithm based on the investigation of thread pools. With the help of a queueing model and the improved algorithm the performance metrics of multi-tier information systems can be predicted much more accurate. In our work, effect analysis of the improved algorithm is performed, as well.
The Role of Gendered Language and Performance Ratings in Teaching Evaluations of University Economics Professors Across Ontario

THE ROLE OF GENDERED LANGUAGE AND PERFORMANCE RATINGS IN TEACHING EVALUATIONS OF UNIVERSITY ECONOMICS PROFESSORS ACROSS ONTARIO Nirmal Narayanan Advisors: University of Guelph, 2018 Dr. Luiza Antonie Dr. Gary Gréwal Student evaluation is widely being recognized across university and colleges for professor evaluation, but there are many underlying trends or bias occurring that can influence the interpretation. RateMyProfessor.com is becoming an increasingly popular publicly accessible web-based evaluations, due to widespread usage by students for course selection and high quantity of data available for analysis. Professors performance is assessed for teaching and research. The teaching component is based on students’ ratings and comments. However, comments and ratings are highly subjective, thus making the assessment difficult. We use this large corpus to answer the following questions: 1) what words do students use to describe their professors? 2) is there any correlation between the words used and the rating is given? and, are there significant differences between the groups analyzed? To answer these questions, we model the reviews using Latent Dirichlet Allocation (LDA) and we run several regression models to analyze if there are statistically significant factors that influence the overall rating.
Nitric oxide activation of Keap1/Nrf2 signaling in human colon carcinoma cells

The transcription factor NF-E2-related nuclear factor 2 (Nrf2) regulates expression of genes that protect cells from oxidative damage. Here, we characterized nitric oxide (•NO)-induced Nrf2–Kelch-like ECH-associated protein 1 (Keap1) signaling and its role in counteracting •NO-induced apoptosis of human colon cancer HCT116 cells. Nrf2 was localized in the cytoplasm in control cells; •NO triggered its rapid nuclear accumulation, transcriptional activation, and up-regulation of HO-1, NQO1, and GCL, but not GST A4 and P1 subunits. Nrf2 accumulation in the nucleus was also associated with enhanced transcription and posttranscriptional modifications. (S)-nitrosation of Keap1 may contribute to nuclear accumulation of Nrf2 by facilitating its dissociation from Keap1, thus initiating •NO-mediated Nrf2–Keap1 signaling. •NO-mediated induction of ARE-dependent genes occurred well before apoptosis, as judged by caspase 3 activation. Collectively, these results show that the Nrf2–Keap1 signaling pathway mediates protective cellular responses to mitigate •NO-induced damage and may contribute to the relative resistance of HCT116 to •NO-induced cytotoxicity.
How Effective are Individual Lifestyle Changes in Reducing Electricity Consumption ?-Measuring the Impact of Earth Hour

This paper examines a unique natural experiment where Sydney residents turned off lights and electrical appliances for one hour. While polls reported 57% of Sydney participated, statewide electricity use declined by 2.10%, statistically indistinguishable from zero. This indicates that discretionary household electricity use like lighting forms only a small component of total electricity consumption, and policies targeting such use may be of limited impact. Using poll data on participation and previous estimates of household electricity consumption, evidence indicates that respondents overstated their involvement by around 36%. This is consistent with consumers feeling pressure to overstate their preferences for environmental goods. *5807 S. Woodlawn Ave., Chicago IL 60637. Contact at dsolomon@chicagogsb.edu . I would like to thank Sam Hartzmark, Roni Kisin and John List for helpful comments and suggestions. All remaining errors are my own.
Fusion of Modified Bat Algorithm Soft Computing and Dynamic Model Hard Computing to Online Self-Adaptive Fuzzy Control of Autonomous Mobile Robots

This paper presents a fusion methodology of modified bat algorithm (BA) soft computing and dynamic model hard computing to online self-adaptive fuzzy control of autonomous mobile robots in a field-programmable gate array (FPGA) chip. This fusion approach, called fusion of BA fuzzy control (FBAFC), gains the benefits of BA, online fuzzy control, dynamic model, Taguchi method, and FPGA technique. The FPGA realization of the proposed FBAFC fusion method is more effective in practice for challenging real-world embedded applications by using system-on-a-programmable-chip (SoPC) technology. Experimental results and comparative works are conducted to illustrate the merits of the proposed SoPC-based FBAFC optimal controller over other existing methods for mobile robots.
Synthesis and Cytotoxicity of Cyanoborane Adducts of N 6 -Benzoyladenine and 6-Triphenylphosphonylpurine

N 6 -Benzoyladenine-cyanoborane (2), and 6-triphenylphosphonylpurine-cyanoborane (3) were selected for investigation of cytotoxicity in murine and human tumor cell lines, effects on human HL-60 leukemic metabolism and DNA strand scission to determine the feasibility of these compounds as clinical antineoplastic agents. Compounds 2 and 3 both showed effective cytotoxicity based on ED50 values less than 4 μg/ml for L1210, P388, HL-60, Tmolt3, HUT-78, HeLa-S3 uterine, ileum HCT-8, and liver Hepe-2. Compound 2 had activity against ovary 1-A9, while compound 3 was only active against prostate PL and glioma UM. Neither compound was active against the growth of lung 549, breast MCF-7, osteosarcoma HSO, melanoma SK2, KB nasopharynx, and THP-1 acute monocytic leukemia. In mode of action studies in human leukemia HL-60 cells, both compounds demonstrated inhibition of DNA and protein syntheses after 60 min at 100 μM. These compounds inhibited RNA synthesis to a lesser extent. The utilization of the DNA template was suppressed by the compounds as determined by inhibition of the activities of DNA polymerase α, m-RNA polymerase, r-RNA polymerase and t-RNA polymerase, which would cause adequate inhibition of the synthesis of both DNA and RNA. Both compounds markedly inhibited dihydrofolate reductase activity, especially in compound 2. The compounds appeared to have caused cross-linking of the DNA strands after 24 hr at 100 μM in HL-60 cells, which was consistent with the observed increased in ct-DNA viscosity after 24 hr at 100 μM. The compounds had no inhibitory effects on DNA topoisomerase I and II activities or DNA-protein linked breaks. Neither compound interacted with the DNA molecule itself through alkylation of the nucleotide bases nor caused DNA interculation between base pairs. Overall, these antineoplastic agents caused reduction of DNA and protein replication, which would lead to killing of cancer cells.
A three-level clustering algorithm for color texture segmentation

This paper presents the development of a three level unsupervised segmentation framework based on color and texture features. An important contribution of this work consists of a new formulation of three different clustering algorithms at three different levels. In the first level, a multiclass clustering algorithm using binary quaternion moment preserving thresholding algorithm is applied in order to quantize the colors. In the second level, clustering is performed on the quantized image using Self-organizing map for the estimation of the optimal number of components in the image and to resolve the initialization problem of mixture model based clustering which is carried out in the third level. The clusters obtained in the second level are then, refined and modelled using an adaptive spatial finite mixture model in the color-texture feature space. Since the dimensionality and the complexity of the image space is reduced at every level the proposed algorithm is fast and efficient. The proposed algorithm is applied on the Berkeley database images and complex natural images. The results are competent with the JSEG and CTex algorithms.
Robust Real Time Zebrafish High Speed Tail Tracking

The real time detection and quantification of Zebrafish swim behavior from high speed video data is an essential component of a Zebrafish virtual reality system, where body-fixed Zebrafish are suspended in a gel and shown visual stimuli simulating a real world swimming environment. Here, several methods for extracting the Zebrafish tail position are explored and a method for for real time tail tracking is developed. Furthermore, with the aim of eventually utilizing supervised or unsupervised machine learning to classify various types of swim behaviors, a method for extracting concise and useful features from the tail position data is developed.
Utilization of Genetic Algorithm for Optimal EEG Channel Selection in Brain-Computer Interface Application

Brain-Computer Interface (BCI) research has provoked an enormous interest among researchers from different fields since it is an important element in assistive technology. The most popular approach is a non-invasive method, using Electroencephalogram (EEG) analysis which acquires signals from 32 to 64 electrodes' recordings and translate them to a movement using various computing algorithm which can be used in wheelchair navigation, or control robot movements. However, it will be time consuming and an exhausting experience if the single command translation from large number of electrodes is used. The aim of this project is to develop an algorithm that can choose optimal four electrodes for signal recording, and convert one thought into multiple commands with the chosen electrodes. Using sample datasets, the EEG signal is analyzed to determine the most suitable scalp area for P300 detection, while optimization with genetic algorithm (GA) is developed to select best four channels. After 30 GA runs, the optimal four sets of electrodes are chosen based on their coefficient of determination or r2 values, where higher values contributes to higher repetition rates. Using signals from the chosen four electrodes, a success rate of 75-80% is received.
The use of the mesh free methods (radial basis functions) in the modeling of radionuclide migration and moving boundary value problems

Recently, the mesh free methods (radial basis functions-RBFs) have emerged as a novel computing method in the scientific and engineering computing community. The numerical solution of partial differential equations (PDEs) has been usually obtained by finite difference methods (FDM), finite element methods (FEM) and boundary elements methods (BEM). These conventional numerical methods still have some drawbacks. For example, the construction of the mesh in two or more dimensions is a nontrivial problem. Solving PDEs using radial basis function (RBF) collocations is an attractive alternative to these traditional methods because no tedious mesh generation is required. We compare the mesh free method, which uses radial basis functions, with the traditional finite difference scheme and analytical solutions. We will present some examples of using RBFs in geostatistical analysis of radionuclide migration modeling. The advection-dispersion equation will be used in the Eulerian and Lagrangian forms. Stefan's or moving boundary value problems will also be presented. The position of the moving boundary will be simulated by the moving data centers method and level set method.
Mechanized Indexing Methods and Their Testing

Methods of mechanized indexing (subject indexing by computer) which have been proposed are systematically summarized. Every suggested method consists of some document preparation process (mostly or wholly mechanical) followed by the application of indexing rules to the prepared document. A comprehensive document preparation is described from which proposed methods can be derived by selection. It includes full text input, document place (title, abstract, etc.) marking, sentence and paragraph marking, pronoun replacement, and other syntactic marking. I t also includes addition of thesaurus headings, position numbers, weighted frequencies, closely associated expressions, importance measures, and reference information. Three kinds of indexing rules are then distinguished and illustrated. Several general comments on mechanized indexing include remarks on the argument that good mechanized indexing is not feasible, and the argument that mechanized indexing has the advantage, compared to human indexing, of consistency. Some problems of testing mechanized (or any other) indexing quality by the quality of the retrieval it permits are described. Index duplication studies are suggested as an alternative kind of empirical investigation of mechanized indexing methods.
A General Framework and New Alignment Criterion for Dense Optical Flow

The problem of dense optical flow computation is addressed from a variational viewpoint. A new geometric framework is introduced. It unifies previous art and yields new efficient methods. Along with the framework a new alignment criterion suggests itself. It is shown that the alignment between the gradients of the optical flow components and between the latter and the intensity gradients is an important measure of the flow’s quality. Adding this criterion as a requirement in the optimization process improves the resulting flow. This is demonstrated in synthetic and real sequences.
Parallel hybrid SAT solving using OpenCL

In the last few decades there have been substantial improvements in approaches for solving the Boolean satisfiability problem. Many of these consisted in elaborating on existing algorithms, both on the side of complete solvers as in the area of incomplete solvers. Besides the improvements to existing solving methods, however, recent evolutions in SAT solving take the form of combining several solvers into one, resulting in parallel solvers and so-called hybrid solvers. Our goal is to combine both approaches, by presenting a parallel hybrid solver. The parallelism exists on two levels: we run a complete solver on the CPU concurrently with an incomplete solver on the GPU, where the latter in turn consists of a massively parallel local search algorithm. We implemented our approach using the OpenCL framework, and present preliminary experimental results.
Decomposing a Polygonal Boundary as a List of Line Segments

Shape identification is a fundamental property of an object and is an important low level feature to human perception. Shape analysis is widely applied in image registration, segmentation, classification and various other computer vision applications like pattern recognition, medical image diagnostics, integral geometry etc. This paper describes a new shape descriptor using chainencoding methods, where a shape boundary is represented as a list of vectors of line segments. This is a very compact and efficient method of shape representation which could be exploited for shape compression, classification, segmentation and shape matching techniques.
ISEK: An Information Security Knowledge Graph for CISP Knowledge System

As the development of information technology, information security is concerned more by society and industry. One important way to assure the security of information technology is education and training for IT practitioners. In this paper, we propose an information security knowledge graph method for information security training and certification knowledge system, in which security knowledge is described and organized with semantics. It can be used for knowledge organization, architecture presentation and examination in security education and training. To valid the proposed method, we construct the ISEK knowledge graph for CISP knowledge system in China, and use it for knowledge navigation and examination analysis.
Lattice vector quantization with direct indexing as data differencing technique

A huge range of approaches to deal with the task of image coding with lossy compression based on wavelet and vector quantization has been developed. Lattice Vector Quantization (LVQ), a variant of vector quantization is a lossy image compression technique. In this paper LVQ is applied on the transformed image as lossy and data differencing technique. While used as data differencing technique, the indices of quantized vectors with the indices of error vectors are sent to the decoder. To achieve this, extra computations are required at the encoder. Indices for lattice vectors are generated by proposed direct indexing method which is independent of the indexing of leaders and enumeration of the lattice points. PSNR values and visual performance of various test images are compared in both cases.
Homogenization of some nonlinear problems with specific dependence upon coordinates

Sunto: Questo articolo considera una successione di equazioni diieren-ziali a derivate parziali non lineari in forma di divergenza del tipo ? div (Q " G(x; N " ru)) = f " ; in un dominio limitato dello spazio n-dimensionale; Q " = Q " (x) e N " = N " (x) sono matrici con coeecenti limitati, N " e' invertibile e la sua matrice inversa R " ha anche coeecenti limitati. La non linearita' e' dovuta alla funzione G = G(x;); la condizione di crescita, la monotonicita' e le ipotesi di coercitivita' sono modellate sul p-Laplaciano, 1 < p < 1, ed assicurano l'esistenza di una soluzione u " 2 W 1;p 0 (() di ciascuna equazione, per ogni ssata f " 2 W ? 1;p 0 ((). Si ipotizza una dipendenza speciica della matrice dei coeecenti dalle coordinate: Q " (x) = ? q " i;j (x 0 i) e R " (x) = ? r " i;j (x i) , dove il punto arbitrario di e' denominato x = (x i ; x 0 i), con x i reale e x 0 i nello spazio (n? 1)-dimensionale. Essenzialmente il risultato principale e' il seguente. Supponiamo la seguente convergenza: per i coeecenti, Q " * Q, R " * R, rispetto alla topologia debole* ; per i termini di sorgente, f " ! f, rispetto alla topologia forte di W ? 1;p 0 0 ((); e per le soluzioni u " * u, rispetto alla topologia debole di W 1;p 0 ((); allora u e' soluzione dell'equazione limite ? div (Q G(x; Nru)) = f: Si dimostra anche un risultato di tipo correttore e vengono date applicazioni del risultato ottenuto.
Refined New Technique for Correction of the Minor-Form, Microform Cleft Lip and Minor-Form Bilateral Cleft Lip through the Intraoral Incision and Long-Term Results

To attain muscle continuity with a minimal scar in the treatment of the microform cleft lip, the current author previously introduced a new method using interdigitation of the orbicularis oris muscle to create a philtrum through an intraoral incision to avoid an external scar.1 A total of 12 patients with microform cleft lip were treated between August of 2001 and October of 2002. The follow-up period ranged from 6 to 15 months. All patients were satisfied with the results. After the article was published, the technique was refined and modified, and 38 more patients including those with minor-form cleft lip2 and minor-form bilateral cleft lip were treated between 2003 and 2008. In this article, the current author reports a more refined technique and long-term results.