Miracle-dz/UniFAR-FTUs huggingface dataset:
Title: Exponential Random Graph Models Name: Agata Fronczak Exponential Random Graph Models Definition

Synonyms p* models, p-star models, p1 models, exponential family of random graphs, maximum entropy random networks, logit models, Markov graphs Glossary • Graph and network: the terms are used interchangeably in this essay. • Real-world network: (real network, observed network) means network data the researcher has collected and is interested in modelling. • Ensemble of graphs: means the set of all possible graphs (network realiza-tions) that the (real-world) network may reasonably be expected to become, with the assigned probability distribution, which specifies how likely it is that the network will be found in a particular realization. In other words, ensemble of graphs is defined by ascribing a statistical weight to every graph in the given set. • Graph observable: measurable property of a graph. • Network Hamiltonian: is a particular type of objective (fitness) function, H(G). The exponential random graph model defines a probability distribution over a specified set of possible graphs, G = {G}, such that the probability P (G) the Hamiltonian, {x i } is the set of graph observables upon which the relevant constraints act, and {θ i } is a set of ensemble parameters which we can vary so as to match the properties of the model network to the real-world network under investigation. • Adjacency matrix: is a matrix with rows and columns labelled by graph vertices i and j, with elements A ij = 1 or 0 according to whether the vertices, i and j, are connected/adjacent or not. In the case of an undirected graph with no self-loops or multiple edges (the so-called simple graph), the adjacency matrix is symmetric (i.e. A ij = A ji) and has 0s on the diagonal (i.e. A ii = 0). Accordingly, for a simple directed graph the symmetry condition may not be fulfilled, i.e. it can be that A ij = A ji. • Reciprocity: describes tendency of vertex pairs to form mutual directed connections between each other. • Clustering: describes tendency of nodes to cluster together. Clustering is measured by the clustering coefficient which calculates the average probability that two neighbors of a vertex are themselves nearest neighbors. A graph consists of a set of objects or individuals, called nodes (points, vertices), connected by links (edges). The idea of a graph is a powerful simplification for different phenomena-a way of specifying pairwise relations among a collection of items or agents. Graph models are introduced in …
Hardware Implementation of BCH ErrorCorrecting Codes on a FPGA

Our paper presents the prototyping of a BCH (Bose, Chaudhuri, and Hocquenghem) encoder and decoder using a Field Programmable Gate Array (FPGA) reconfigurable chip. The solutions implemented on FPGA lead to a high calculation rate using parallelization. We implemented the BCH code in a 3s400FG456 FPGA. In this implementation we used 15 bit-size word code and the results show that the circuits work quite well.
Robust OFDM receivers for dispersive time-varying channels: equalization and channel acquisition

In orthogonal frequency-division multiplexing, time variations of a multipath channel lead to a loss of orthogonality between the subcarriers, and thereby limit the achievable throughput. This paper proposes a general framework for a controlled removal of intercarrier interference (ICI) and channel acquisition. The core idea behind our method is to use a finite power series expansion for the time-varying frequency response, along with the known statistical properties of mobile radio channels. Channel acquisition and ICI removal are accomplished in the frequency domain and allow for any desired tradeoff between the residual ICI level, the required training for channel acquisition, and processing complexity. The proposed approach enables a high spectral efficiency (64-quadrature amplitude modulation mode) of digital video broadcasting-terrestrial in highly mobile environments.
On spectral approximations using modified Legendre rational functions: Application to the Korteweg-de Vries equation on the half line

A new set of modified Legendre rational functions which are mutually orthogonal in L2(0,+∞) is introduced. Various projection and interpolation results using the modified Legendre rational functions are established. These results form the mathematical foundation of related spectral and pseudospectral methods for solving partial differential equations on the half line. A spectral scheme using the modified Legendre rational functions for the Korteweg-de Vries equation on the half line is investigated. The numerical solution of the scheme is shown to possess the essential conservation properties satisfied by the solution of the Korteweg-de Vries equation. The spectral convergence of the proposed scheme is established.
Are Child and Adolescent Responses to Placebo Higher in Major Depression than in Anxiety Disorders? A Systematic Review of Placebo-Controlled Trials

Background In a previous report, we hypothesized that responses to placebo were high in child and adolescent depression because of specific psychopathological factors associated with youth major depression. The purpose of this study was to compare the placebo response rates in pharmacological trials for major depressive disorder (MDD), obsessive compulsive disorder (OCD) and other anxiety disorders (AD-non-OCD). Methodology and Principal Findings We reviewed the literature relevant to the use of psychotropic medication in children and adolescents with internalized disorders, restricting our review to double-blind studies including a placebo arm. Placebo response rates were pooled and compared according to diagnosis (MDD vs. OCD vs. AD-non-OCD), age (adolescent vs. child), and date of publication. From 1972 to 2007, we found 23 trials that evaluated the efficacy of psychotropic medication (mainly non-tricyclic antidepressants) involving youth with MDD, 7 pertaining to youth with OCD, and 10 pertaining to youth with other anxiety disorders (N = 2533 patients in placebo arms). As hypothesized, the placebo response rate was significantly higher in studies on MDD, than in those examining OCD and AD-non-OCD (49.6% [range: 17–90%] vs. 31% [range: 4–41%] vs. 39.6% [range: 9–53], respectively, ANOVA F = 7.1, p = 0.002). Children showed a higher stable placebo response within all three diagnoses than adolescents, though this difference was not significant. Finally, no significant effects were found with respect to the year of publication. Conclusion MDD in children and adolescents appears to be more responsive to placebo than other internalized conditions, which highlights differential psychopathology.
Determining Termhood for Learning Domain Ontologies using Domain Prevalence and Tendency

In the course of reviewing existing automatic termrecognition techniques for applications in ontology learning, we came across four issues which can be improved upon. We proposed a new mechanism that incorporates both statistical and linguistic evidences for the computation of a final weight defined as Termhood (TH) for ranking term candidates. The analysis of the frequency distributions of the term candidates during our initial experiments revealed three advantages for higher quality term recognition.
In-vitro effects of FSH and testosterone withdrawal on caspase activation and DNA fragmentation in different cell types of human seminiferous epithelium.

BACKGROUND Caspases are downstream elements of apoptosis-mediating pathways initiated by the Fas ligand/Fas receptor system which is supposed to play a central role in the regulation of apoptosis in the human seminiferous epithelium. However, caspase activity in different cell types of this epithelium has never been addressed. METHODS AND RESULTS We evaluated caspase activity and DNA integrity in Sertoli and germ cells within in-vitro cultured segments of human seminiferous tubules after induction of apoptosis by FSH or testosterone withdrawal. FSH withdrawal increased the incidence of DNA fragmentation in meiotic (primary spermatocytes) and post-meiotic (spermatids) germ cells without producing any detectable effect on caspase activity in these cells and without affecting DNA integrity or caspase activity in Sertoli cells. Testosterone withdrawal stimulated caspase activity and produced DNA fragmentation in Sertoli cells, but showed only a weak effect on DNA fragmentation in germ cells and did not alter germ cell caspase activity. CONCLUSIONS These findings confirm the central role of caspases in apoptosis of Sertoli cells. However, they also suggest that acute apoptosis of germ cells in the adult human testis occurs in a caspase-independent way and is controlled by Sertoli cells via an as yet undetermined mechanism.
Evaluation of Multiple Models to Distinguish Closely Related Forms of Disease Using DNA Microarray Data: an Application to Multiple Myeloma

Motivation: Standard laboratory classification of the plasma cell dyscrasia monoclonal gammopathy of undetermined significance (MGUS) and the overt plasma cell neoplasm multiple myeloma (MM) is quite accurate, yet, for the most part, biologically uninformative. Most, if not all, cancers are caused by inherited or acquired genetic mutations that manifest themselves in altered gene expression patterns in the clonally related cancer cells. Microarray technology allows for qualitative and quantitative measurements of the expression levels of thousands of genes simultaneously, and it has now been used both to classify cancers that are morphologically indistinguishable and to predict response to therapy. It is anticipated that this information can also be used to develop molecular diagnostic models and to provide insight into mechanisms of disease progression, e.g., transition from healthy to benign hyperplasia or conversion of a benign hyperplasia to overt malignancy. However, standard data analysis techniques are not trivial to employ on these large data sets. Methodology designed to handle large data sets (or modified to do so) is needed to access the vital information contained in the genetic samples, which in turn can be used to develop more robust and accurate methods of clinical diagnostics and prognostics. Results: Here we report on the application of a panel of statistical and data mining methodologies to classify groups of samples based on expression of 12,000 genes derived from a high density oligonucleotide microarray analysis of highly purified plasma cells from newly diagnosed MM, MGUS, and normal healthy donors. The three groups of samples are each tested against each other. The methods are found to be similar in their ability to predict group membership; all do quite well at predicting MM vs. normal and MGUS vs. normal. However, no method appears to be able to distinguish explicitly the genetic mechanisms between MM and MGUS. We believe this might be due to the lack of genetic differences between these two conditions, and may not be due to the failure of the models. We report the prediction errors for each of the models and each of the methods. Additionally, we report ROC curves for the results on group prediction. Availability: Logistic regression: standard software, available, for example in SAS. Decision trees and boosted trees: C5.0 from www.rulequest. com. SVM: SVM-light is publicly available from svmlight.joachims. org. Naïve Bayes and ensemble of voters are publicly available from www.biostat. wisc.edu/~mwaddell/eov.html. Nearest Shrunken Centroids is publicly available from http://www-stat.stanford. edu/~tibs/PAM.
A clustering method for seismic zone identification and spatial data mining

This paper shows how it made possible in geographical science to observe the seismic zone, clustering of highly sensitive earthquake zone and spatial data clustering during important geographical processes. This paper shows simple density based and KMean clustering technique. Density-Based clustering is done here using density estimation and by searching regions which are denser than a given threshold and to form clusters from these dense regions by using connectivity and density functions. Also we defined some optimal no of K locations for K-Mean clustering where the sum of the distance from every point to each of the K centers is minimized what is called global optimization. With this dataset it forms clusters using density estimation and K-Mean clustering. Also it correlates the clustering pattern by applying co-relation algorithm and proximity measure algorithm; hence it easily removes noisy data. This scheme can extract clusters efficiently with reduced number of comparisons.
The Animal Pathogen-Like Type III Secretion System Is Required for the Intracellular Survival of Burkholderia mallei within J774.2 Macrophages

ABSTRACT Burkholderia mallei is a highly infectious gram-negative pathogen and is the causative agent of human and animal glanders. By generating polar mutations (disruption of bsaQ and bsaZ) in the B. mallei ATCC 23344 animal pathogen-like type III secretion system (TTS), we demonstrate that this bacterial protein delivery system is required for intracellular growth of B. mallei in J774.2 cells, formation of macrophage membrane protrusions, actin polymerization, and phagosomal escape. These findings suggest that TTS plays a role in the intracellular trafficking of B. mallei and may facilitate cell-to-cell spread via actin-based motility.
Optimum and heuristic transformation techniques for simultaneous optimization of latency and throughput

Although throughput alone can be arbitrarily improved for several classes of systems using previously published techniques, none of those approaches are effective when latency constraints, which are increasingly important in embedded DSP systems, are considered. After formally establishing the relationship between latency and throughput in general computation, we explore the effect of pipelining on latency, and establish necessary and sufficient conditions under which pipelining does not alter latency. Many systems are either linear, or have subsystems that are linear. For such cases we have used a state-space based approach that treats various transformations in an integrated fashion, and answers analytically whether it is possible to simultaneously meet any given combination of constraints on latency and throughput, The analytic approach is constructive in nature, and produces a complete implementation when feasibility conditions are fulfilled. We also present a suboptimal but hardware efficient heuristic approach for the special case of initially-relaxed single-input single-output linear time-invariant computations. A novel software platform consisting of a high-level synthesis system coupled to a symbolic algebra system was used to implement the proposed algorithm transformations. Instead of optimizing to improve throughput and latency, our transformations can also be used to increase the implementation efficiency while achieving the same latency and throughput as the original design. >
Two phase nonoverlapping clocked All-N-Logic in subthreshold region with 49fJ power delay product

This paper represents a new structure of ANL logic, named TPSANL to achieve ultra low power with no glitches in the subthreshold region. Since different ANL logics suffer from output glitches due to race problem, our proposed TPSANL logic by using two phase nonoverlapping clocks eliminates output glitches and reduces the glitch power. The noninverting/inverting pipelined system in ANL logics causes a voltage drop on NMOS transistors in inverting blocks. Therefore, these logics cannot operate in subthreshold regions. TPSANL uses high speed noninverting blocks in all pipeline stages. So, it can operate in subthreshold region. One 4-bit CLA adder with TPSANL logic in the subthreshold region operates in 14.5MHz frequency with 157nW power consumption and 49fJ power-delay-product.
Variables influencing information security policy compliance: A systematic review of quantitative studies

Purpose – The purpose of this paper is to identify variables that influence compliance with information security policies of organizations and to identify how important these variables are. Design/methodology/approach – A systematic review of empirical studies described in extant literature is performed. This review found 29 studies meeting its inclusion criterion. The investigated variables in these studies and the effect size reported for them were extracted and analysed. Findings – In the 29 studies, more than 60 variables have been studied in relation to security policy compliance and incompliance. Unfortunately, no clear winners can be found among the variables or the theories they are drawn from. Each of the variables only explains a small part of the variation in people's behaviour and when a variable has been investigated in multiple studies the findings often show a considerable variation. Research limitations/implications – It is possible that the disparate findings of the reviewed studies can b.
The effect of monensin supplementation on ruminal fermentation parameters of sheep [Conference poster].

This study was carried out to determine of the effects of monensin on ruminal fermentation parameters in Ghizel sheep. Sixteen male Ghizel sheep were used allocated in completely randomized design. The diet containing of 2.9 ME (Mcal/kg DM) and 150 g/kg DM CP was formulated based on NRC requirement consisting of 400 g kg-1DM alfalfa, 488 g kg-1 DM barley grain, 200 g kg-1 DM soybean meal, 589 g kg-1 DM, corn grain and 20 g kg-1 DM limestone containing predicted metabolizable energy 2.9 Mcal kg-1 DM and containing crude protein 150 g kg-1 DM. The treatments containing different level of ionophores (20 ppm, 25 ppm, 30 ppm and 35 ppm). The experiment period was 21 days. The rumen fluid was collected using stomach tube at 2 and 4 h after morning feeding. The floatation and sedimentation time, methylene blue reduction time, pH, total ammonia nitrogen and total VFA in ruminal samples were determined. The ruminal pH, total VFA, sedimentation and floatation time and methylene reduction time were not significant differences. The effect of monensin on ruminal ammonia concentration was significant difference (P<0.05). The results showed that the monensin had not effect on ruminal parameters except of ruminal ammonia-N resulted low proteolytic bacteria activity.
An overview of low-voltage VCO delay cells and a worst-case analysis of supply noise sensitivity

This paper presents a comparative study of the architecture and timing jitter of the delay-cells of low-voltage CMOS ring-VCOs. Design considerations, such as noise, single-ended versus differential, linearity and symmetry of load, and the output voltage swing of delay cells are examined in detail. The worst-case sensitivity of the delay time of the delay cells and that of the oscillation frequency of corresponding ring-VCO implemented in TSMC 0.18 /spl mu/m CMOS technology are analyzed using Cadence's Spectre with BSIM3v3 device models. Simulation results are presented.
Accounting Discretion in Fair Value Estimates: An Examination of SFAS 142 Goodwill Impairments

This study examines Statement of Financial Accounting Standards 142 adoption decisions, focusing on the trade-off between recording certain current goodwill impairment charges below the line and uncertain future impairment charges included in income from continuing operations. We examine several potentially important economic incentives that firms face when making this accounting choice. We find evidence suggesting that firms' equity market concerns affect their preference for above-the-line vs. below-the-line accounting treatment, and firms' debt contracting, bonus, turnover, and exchange delisting incentives affect their decisions to accelerate or delay expense recognition. Our study contributes to the accounting choice literature by examining managers' use of discretion when adopting a mandatory accounting change and by developing and testing explicit cross-sectional hypotheses of the determinants of firms' preferences for immediate below-the-line versus delayed above-the-line expense recognition. Copyright University of Chicago on behalf of the Institute of Professional Accounting, 2006.
Data Partit ioning for DSP Software Synthesis

Many modern DSP processors have the ability to access multiple memory banks in parallel. Efficient compiler techniques are needed to maximize such parallel memory operations to enhance performance. On the other hand, stringent memory capacity is also an important requirement to meet, and this complicates our ability to lay out data for parallel accesses. We examine these problems, data partitioning and minimization, jointly in the context of software synthesis from dataflow representations of DSP algorithms. Moreover, we exploit specific characteristics in such dataflow representations to streamline the data partitioning process. Based on these observations on practical dataflow-based DSP benchmarks, we develop simple, efficient partitioning algorithms that come very close to optimal solutions. Our experimental results show 19.4% average improvement over traditional coloring strategies with much higher efficiency than ILP-based optimal partitioning computation. This is especially useful during design space exploration, when many candidate synthesis solutions are being evaluated iteratively.
Database Support for Bregman Co-clustering

As the amount of data generated and collected becomes larger and more complicated, scalable tools for effective data mining become more important. Because data mining is a broad area of research, we focus on coclustering, a new yet promising subarea of data mining. Co-clustering performs two-way clusterings and simultaneously clusters row and column entities. Specifically we consider a recently proposed algorithm, Bregman co-clustering algorithm, which has shown significant promise for clustering quality and hence gained popularity. However, a recent study has demonstrated that a main memory based implementation of the algorithm creates difficulty for applications with large data sets. Therefore, the focus of this paper is a scalable implementation of Bregman co-clustering algorithm. We discuss how summary statistics required by the algorithm can be stored in a data cube and computed by an OLAP engine. We conduct experiments using several real data sets from various domains, including matrix decomposition, bioinformatics, document clustering, and collaborative filtering (CF) based recommendation. Experimental results demonstrate the potential of our OLAP based implementation. Moreover, our implementation has a large prospective user base as it works on top of OLAP, a widely deployed technique; further, it facilitates the use of Bregman co-clustering algorithm for applications with large data sets while co-clustering is finding applications in various problems. The research is a step towards the increasing needs in connecting database and data mining. Keyboards: Database, SQL, OLAP, data mining, Bregman co-clustering
Monetary Policy-Making in Mauritius

The implementation of monetary policy in Mauritius has changed dramatically over the past two decades. This paper starts by describing the original mechanism of implementing monetary policy from the establishment of the Bank of Mauritius in 1968 until the reforms of the 1990s. The description is followed by a short analysis of the defects of the earlier system and the rationale for adopting alternative mechanisms for implementing monetary policy. The paper then describes the present system by which monetary policy in Mauritius is implemented. Although monetary policy can never be explained in isolation from fiscal and exchange rate policy, this description touches on fiscal and exchange rate policies only where absolutely necessary.