Miracle-dz/UniFAR-FTUs huggingface dataset:
Feature ranking-guided fuzzy rule interpolation

Fuzzy rule interpolation (FRI) provides an alternative means to make inference with a sparse rule base, rather than directly resulting in failed reasoning when no rules can be fired for an input observation. However, existing approaches to FRI typically assume that rule antecedents are of equal significance in the implementation of interpolation, thereby often leading to less accurate interpolated results. Having taken notice of feature selection (FS) techniques being capable of selecting (subsets of) informative features, providing a mechanism of evaluating and ranking features, this work employs FS to score the individual rule antecedents in a given rule base. In particular, the computation of individual scores is enabled by the introduction of an innovative reverse engineering technique that artificially creates a set of training samples from a given sparse rule base. The antecedent scores are integrated within the scale and move transformation-based FRI algorithm (though other FRI approaches may employ the same idea), forming a novel feature ranking-guided FRI method. The work is systematically examined, by utilising six different FS techniques and comparing over eight benchmark classification problems, demonstrating improved classification performance.
Sensitivity encoding reconstruction with nonlocal total variation regularization

In sensitivity encoding reconstruction, the issue of ill conditioning becomes serious and thus the signal‐to‐noise ratio becomes poor when a large acceleration factor is employed. Total variation (TV) regularization has been used to address this issue and shown to better preserve sharp edges than Tikhonov regularization but may cause blocky effect. In this article, we study nonlocal TV regularization for noise suppression in sensitivity encoding reconstruction. The nonlocal TV regularization method extends the conventional TV norm to a nonlocal version by introducing a weighted nonlocal gradient function calculated from the weighted difference between the target pixel and its generalized neighbors, where the weights incorporate the prior information of the image structure. The method not only inherits the edge‐preserving advantage of TV regularization but also overcomes the blocky effect. The experimental results from in vivo data show that nonlocal TV regularization is superior to the existing competing methods in preserving fine details and reducing noise and artifacts. Magn Reson Med, 2011. © 2010 Wiley‐Liss, Inc.
Neuroscience and Biobehavioral Reviews Discussion Dopamine and Anorexia Nervosa

Keywords: Dopamine Anorexia nervosa Eating pathology Mental consequences of food deprivation Eating behavior Anorexia treatment Eating disorders a b s t r a c t We have suggested that reduced food intake increases the risk for anorexia nervosa by engaging mesolim-bic dopamine neurons, thereby initially rewarding dieting. Recent fMRI studies have confirmed that dopamine neurons are activated in anorexia nervosa, but it is not clear whether this response is due to the disorder or to its resulting nutritional deficit. When the body senses the shortage of nutrients, it rapidly shifts behavior toward foraging for food as a normal physiological response and the mesolimbic dopamine neurons may be involved in that process. On the other hand, the altered dopamine status of anorexics has been suggested to result from a brain abnormality that underlies their complex emotional disorder. We suggest that the outcomes of the treatments that emerge from that perspective remain poor because they target the mental symptoms that are actually the consequences of the food deprivation that accompanies anorexia. On the other hand, a method that normalizes the disordered eating behavior of anorexics results in much better physiological, behavioral, and emotional outcomes.
Albumin–bilirubin versus Child–Pugh score as a predictor of outcome after liver resection for hepatocellular carcinoma

The Child–Pugh (CP) score is used widely to assess liver function and predict postoperative outcomes in patients with hepatocellular carcinoma (HCC). Recently, the albumin–bilirubin (ALBI) score has been validated as a predictor of overall survival in these patients. This study aimed to compare the ability of the ALBI and CP scores to predict outcomes in patients with HCC after liver resection with curative intent.
Repair of service-based processes-an application area for logic programming ?

The handling of failing process executions has a long history in computer science. In this article we introduce methods for the diagnosis and repair of failed service-based processes and describe how logic programming can be successfully applied to problem solving. We formulate desirable properties like correctness, completeness, repair optimality and implementation/maintenance efficiency for this task and outline the problem using an introductory example. Finally, we sketch our solution based on model-based diagnosis, planning and logic programming which satisfies the desired qualities.
Comparative clinical evaluation of the 13C-mixed triglyceride breath test as an indirect pancreatic function test.

BACKGROUND Breath tests using stable isotopes of carbon or hydrogen are increasingly becoming established for the evaluation of various gastrointestinal functions, including measurement of exocrine pancreatic insufficiency. We wanted to evaluate the clinical relevance of the non-invasive, non-radioactive 13C-mixed triglyceride breath test in comparison with the secretin-caerulein test as the 'gold standard' of pancreatic function testing and with faecal chymotrypsin and elastase 1 in patients with mild and severe exocrine pancreatic insufficiency. METHODS The secretin-caerulein test, faecal fat analysis, 13C-mixed triglyceride breath test, faecal elastase 1, and chymotrypsin and various morphologic investigations were done in 26 patients with mild (n = 13) or severe (n = 13) exocrine pancreatic insufficiency and 25 patients with gastrointestinal diseases of non-pancreatic origin. Twenty-seven healthy volunteers served as normal controls. After a 12-h fast 200 mg mixed triglyceride (1,3-distearyl,2(carboxyl-13C)octanoyl glycerol) were orally administered with a test meal, and breath samples were taken before and at 30-min intervals for 5 h thereafter, and the increase in 13C/12C isotopic ratio in breath was analysed by mass spectrometry. Various modifications of the test procedure were investigated. RESULTS Specificity for impaired pancreatic function was higher for faecal elastase (90%) and equal for faecal chymotrypsin (82%) as compared with the various variables of the 13C-mixed triglyceride breath test (69-85%). The sensitivity of the 13C-mixed triglyceride breath test for total and separately for mild and severe exocrine pancreatic insufficiency was higher (total, 69-81%) than that of faecal chymotrypsin (total, 56%) but lower than faecal elastase (total, 92%). CONCLUSION The 13C-mixed triglyceride breath test very sensitively reflects severe exocrine pancreatic insufficiency (steatorrhoea) but has limited sensitivity for the detection of mild cases. With regard to the higher sensitivity and specificity, the higher practicability, and the much lower cost, determination of faecal elastase 1 concentrations is superior to the 13C-mixed triglyceride breath test and therefore remains the most reliable indirect pancreatic function test available today.
Gene expression pattern Cloning and expression of xSix3, the Xenopus homologue of murine Six3

The vertebrate Six family of transcription factor genes are homologues of the fruitfly gene sine oculis (so). Human, murine, avian and fish (medaka, zebrafish) homologues have recently been cloned. We report the cloning and developmental pattern of expression of xSix3, the Xenopus laevis homologue of Six3. In addition, we have compared all the known sequences of vertebrate Six3 genes. xSix3 is very homologous to Six3 in other vertebrates in terms of amino acid sequence. The reported developmental pattern of expression of Six3 in chick and mouse includes not only the developing eyes and the ventral diencephalic tissue between them, but also a large, sagittally-oriented telencephalic region. The distribution of xSix3, however, is virtually restricted to the eyes and ventral diencephalon, showing only a very small territory of expression in the telencephalon. q 2000 Elsevier Science Ireland Ltd. All rights reserved.
Innovations sociales, innovations économiques: XXXIVes journées de l'Association d'économie sociale

Depuis ses premieres journees organisees en 1979, l'Association d'economie sociale promeut les recherches qui analysent l'economie en tenant compte de toutes ses dimensions sociales, historiques et politiques. En 2014, les XXXIVes Journees, organisees par le Centre de recherche en economie de Grenoble (Creg), s'inscrivent dans cette tradition socio-economique en s'interrogeant sur l'innovation et sa dualite : innovations sociales, innovations economiques. L'innovation est au coeur de la recherche de competitivite economique (innovations technologiques, organisationnelles, manageriales.). Par ailleurs, de nouvelles formes d'emploi, de travail, de solidarites temoignent d'aspirations sociales en pleine evolution. Ces innovations sociales produisent leurs propres logiques economiques et impactent la relation salariale et ses formes de regulations. Dans quelles mesures le renouvellement des pratiques sociales, accompagnant ou decoulant du developpement rapide des innovations economiques, questionne-il les politiques publiques et les indicateurs usites ? Comment ces innovations sociales participent-elles aux evolutions du marche du travail et des parcours professionnels des salaries ? Enfin dans quelles dynamiques territoriales s'inscrivent-elles ? Les domaines traditionnels de l'Association d'Economie Sociale (emploi, sante, protection sociale, entreprises et organisations, education, economie sociale et solidaire, etc.), constituent un terrain privilegie pour analyser les innovations a l'oeuvre aussi bien au sein des organisations, des territoires que de l'action publique.
Domains of faith impact: how “faith” is perceived to shape faith-based international development organisations

ABSTRACT Increasing interest in faith-based international development organisations (FBOs) recently has improved understanding of these agencies. One reason for complex, often contradictory findings is the lack of frameworks analysing the interactions of worldviews on organisational structures, processes, and behaviours of agencies, and development outcomes. We utilise Lincoln's (2003. Holy Terrors: Thinking about Religion after September 11. Chicago: University of Chicago Press) four “domains of religion” to explore how the literature reports faith impacting the shape of development FBOs’ structures, behaviours, and outcomes. Literature suggests faith has a significant impact upon these agencies. We outline very specific similarities and differences, highlighting the importance of nuanced analysis of faith's role in FBOs. Further research is needed to build more evidence around these impacts of faith on FBOs.
UvA-DARE ( Digital Academic Repository ) Markers of infectious disease emergencies : Focus on patients with community-acquired pneumonia

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva. nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.
Design and analysis of a dynamic scheduling strategy with resource estimation for large-scale grid systems

In this paper, we present a resource conscious dynamic scheduling strategy for handling large volume computationally intensive loads in a grid system involving multiple sources and sinks/processing nodes. We consider a "pull-based" strategy, wherein the processing nodes request load from the sources. We employ the Incremental Balancing Strategy (IBS) algorithm proposed in the literature and propose a buffer estimation strategy to derive optimal load distribution. We consider nontime critical loads that arrive at arbitrary times with time varying buffer availability at sinks and utilize buffer reclamation techniques so as to schedule the loads. We demonstrate detailed workings of the proposed algorithm with illustrative examples using real-life parameters derived from STAR experiments in BNL for scheduling large volume loads.
On the Degrees of Freedom for Multi-Hop Wireless Networks under Layered TDD Constraint

Degrees of freedom (DoF) of a network build a new scaling law characterizing the scalability of capacity at high signal-to-noise region. In this paper, we extend our recent work from cascaded network to the general K-hop layered network. The main framework is based on the assumption of layered TDD, where all nodes at each layer work with the same on/off status. By this approach we decompose the DoF analysis into two steps: 1) apply the result of cascaded networks; 2) analyze / design the transmission of each hop. The upper and lower bounds on DoF are deduced. By viewing the network as cascaded X channels, we find an inner bound of the DoF region, applicable to many message topologies. The detail of message splitting is demonstrated. Finally ultimate analysis shows if the number of antennas/nodes at each relay layer goes to infinity, the lower bound reaches the upper bound. As a by-product, when K > 2 the network can alleviate the effect of TDD with the increase of relay antennas/nodes.
The clinical significance of p53 accumulation in gastric carcinoma

Alterations in the expression of p53 tumor suppressor protein is a frequent event in human cancer but the practical implications of this phenomenon are yet to be fully exploited. The objective of this study was to determine the value of p53 accumulation as a marker of tumor progression and prognosis of gastric carcinoma patients and to evaluate whether this parameter can be properly assessed prior to surgery.
A parametric segmentation functor for fully automatic and scalable array content analysis

We introduce FunArray, a parametric segmentation abstract domain functor for the fully automatic and scalable analysis of array content properties. The functor enables a natural, painless and efficient lifting of existing abstract domains for scalar variables to the analysis of uniform compound data-structures such as arrays and collections. The analysis automatically and semantically divides arrays into consecutive non-overlapping possibly empty segments. Segments are delimited by sets of bound expressions and abstracted uniformly. All symbolic expressions appearing in a bound set are equal in the concrete. The FunArray can be naturally combined via reduced product with any existing analysis for scalar variables. The analysis is presented as a general framework parameterized by the choices of bound expressions, segment abstractions and the reduction operator. Once the functor has been instantiated with fixed parameters, the analysis is fully automatic. We first prototyped FunArray in Arrayal to adjust and experiment with the abstractions and the algorithms to obtain the appropriate precision/ratio cost. Then we implemented it into Clousot, an abstract interpretation-based static contract checker for . NET. We empirically validated the precision and the performance of the analysis by running it on the main libraries of . NET and on its own code. We were able to infer thousands of non-trivial invariants and verify the implementation with a modest overhead (circa 1%). To the best of our knowledge this is the first analysis of this kind applied to such a large code base, and proven to scale.
Automatic Fingerprint Matching Using Extended Feature Set

Fingerprint friction ridge features are generally described in a hierarchical order at three different levels, namely, Level 1 (ridge flow), Level 2 (minutiae points) and Level 3 (pores and ridge shape, etc.). Current Automated Fingerprint Identification Systems (AFIS) generally rely only on a subset of Level 1 and Level 2 features (minutiae and core/delta) for matching. On the other hand, latent print examiners frequently take advantage of a much richer set of features naturally occurring in fingerprints. It is believed that this difference may be one of the reasons for the superior performance of fingerprint examiners over AFIS, particularly in case of difficult latent matches. Fingerprint features, other than minutiae and core/delta, are also referred to as the extended feature set (EFS). The goal of this study is to i) develop algorithms for encoding and matching extended features, ii) develop fusion algorithms to combine extended features with minutiae information to improve fingerprint matching accuracy, and iii) understand the contributions of various extended features in latent fingerprint matching. We study a number of extended features at all three levels, including ridge flow map, ridge wavelength map, ridge quality map, ridge skeleton, pores, dots, incipient ridges, and ridge edge protrusions. Feature extraction and matching algorithms are developed for each type of feature. Relative contribution of each feature towards the overall matching accuracy is evaluated by incrementally adding features to baseline features (minutiae and core/delta). The order of adding features is determined based on the amount of manual labour in feature marking and the estimated importance of features. Latent fingerprint databases, NIST SD27 and ELFT-EFS-PC, and several NIST rolled/plain fingerprint databases are used in our experiments. Based on extensive experiments, we report the following findings: i) almost all the extended features lead to some improvement in latent matching accuracy, ii) extended features at higher level are more effective in improving latent matching accuracy than those at lower level, iii) high image resolution (at least 1000 ppi) is necessary but not sufficient for reliably capturing Level 3 features. Based on our study, we would like to offer the following recommendations: i) extended features at Level 1 and Level 2 are strongly recommended to be incorporated into AFIS, ii) convenient GUI tools should be developed to help fingerprint examiners manually mark extended features (especially ridge skeleton) at Level 1 and Level 2 in latents, iii) it is crucial to improve the quality of enrolled fingerprints (so that a sufficient number of Level 3 features can be extracted) before Level 3 features can play an important role in AFIS.
Exploiting memory locality in distributed key-value stores

Distributed key-value stores which have a main-memory-based persistence can be utilized for serving applications whose performance criteria cannot be met by scaling-out across disk-based nodes. This paper outlines a PhD thesis that addresses the resulting challenge of exploiting memory locality in such systems. We propose to introduce the notion of a block that allows to store a certain number of values consecutively in main-memory. Preliminary micro-benchmarks indicate that this could increase the throughput by a factor 10 on a per-node level. Furthermore, this paper presents a research agenda that covers the resulting implications on a per-node and system-level.
Nonpreemptive Constrained Link Scheduling in Wireless Mesh Networks

This paper considers the problem of link scheduling with non-preemptive constraint in wireless mesh networks. In real-world implementation, there is often a constraint that a link can only transmit once and occupy consecutive time slots during a frame. We refer to it as the non-preemptive constraint. To date, only few scheduling algorithms in the literature has taken such constraint into consideration. In this paper, we show that optimal non-preemptive link scheduling (NPLS) problems are generally NP-hard and are provably harder to solve than link scheduling without such a constraint. To tackle the problem, a low-complexity list link scheduling (LLS) algorithm is proposed to approximate the optimal NPLS. Our analysis shows that with a randomly selected link-ordering list, throughput degradation of LLS compared to the optimal NPLS is bounded even in the worst case. By carefully constructing the link-ordering list, the performance of LLS can be further greatly improved. In this paper, we propose three schemes to construct link-ordering lists. The performance of the proposed schemes is evaluated through simulations.
The housing crisis and London

City has, from its inception, paid close attention to London, to the ‘World City’ or ‘Global City’ ideologies underwriting its concentration of wealth and of poverty and to challenges from among its citizens to the prevailing orthodoxy. This paper focuses on London's extreme experience of the housing crisis gripping the UK—itself the European nation with the fastest long-term growth of average house prices and widest regional disparities, both driven by overblown financialisation and the privileging of rent as a means of wealth accumulation, often by dispossession. Londoners’ experiences stem partly from four decades of neo-liberal transformation and partly from accelerated financialisation in the last two decades and are now being accelerated by the imposition of ‘austerity’ on low- and middle-income people. The social relationships of tenancy in social housing, private tenancy and mortgage-financed owner-occupation are, however, divisive and the paper ends by identifying what may be the beginning of a unified social movement, or at least a coalition, for change.
Design of Secure Image Transmission in MANET using Number Theory Based Image Compression and Quasigroup Encryption (NTICQE) Algorithm

Image compression and image encryption are pivotal to proper storage and transmission of images over MANET. Simultaneous image compression and encryption aims at achieving enhanced bandwidth utilization and security at the same time. The Number Theory based Image Compression and Quasigroup Encryption (NTICQE) algorithm employs number theoretic paradigm Chinese Remainder Theorem and Quasigroup Encryption, to solve congruencies and hence realize the twin ideals of compression and encryption simultaneously. Quasigroup encryptor that has very good data-scrambling properties and, therefore, it has potential uses in symmetric cryptography.
A model for the relationship between tropical precipitation and column water vapor

Several observational studies have shown a tight relationship between tropical precipitation and column‐integrated water vapor. We show that the observed relationship in the tropics between column‐integrated water vapor, precipitation, and its variance can be qualitatively reproduced by a simple and physically motivated two‐layer model. It has previously been argued that features of this relationship could be explained by analogy with the theory of continuous phase transitions. Instead, our model explicitly assumes that the onset of precipitation is governed by a stability threshold involving boundary‐layer water vapor. This allows us to explain the precipitation‐humidity relationship over a broader range of water vapor values, and may explain the observed temperature dependence of the relationship.