Miracle-dz/UniFAR-FTUs huggingface dataset:
Gene Expression Profiling for In Silico Microdissection of Hodgkin's Lymphoma Microenvironment and Identification of Prognostic Features

Gene expression profiling studies based on DNA microarrays have demonstrated their ability to define the interaction pathways between neoplastic and nonmalignant stromal cells in cancer tissues. During the past ten years, a number of approaches including microdissection have tried to resolve the variability in DNA microarray measurements stemming from cancer tissue sample heterogeneity. Another approach, designated as virtual or in silico microdissection, avoids the laborious and time-consuming step of anatomic microdissection. It consists of confronting the gene expression profiles of complex tissue samples to those of cell lines representative of different cell lineages, different differentiation stages, or different signaling pathways. This strategy has been used in recent studies aiming to analyze microenvironment alterations using gene expression profiling of nonmicrodissected classical Hodgkin lymphoma tissues in order to generate new prognostic factors. These recent contributions are detailed and discussed in the present paper.
Food Insecurity and Obesogenic Maternal Infant Feeding Styles and Practices in Low-Income Families

OBJECTIVES: We explored the relationship between household food insecurity and maternal feeding styles, infant feeding practices, and perceptions and attitudes about infant weight in low-income mothers. METHODS: Mothers participating in the Special Supplemental Food Program for Women, Infants, and Children with infants aged between 2 weeks and 6 months were interviewed. By using regression analyses, the following relationships were examined between food insecurity and: (1) controlling feeding styles (restrictive and pressuring); (2) infant feeding practices, including breastfeeding, juice consumption, and adding cereal to the bottle; and (3) perceptions and attitudes about infant weight. Path analysis was used to determine if perceptions and attitudes about infant weight mediated the relationships between food insecurity and controlling feeding styles. RESULTS: The sample included 201 mother–infant pairs, with 35% reporting household food insecurity. Food-insecure mothers were more likely to exhibit restrictive (B [SE]: 0.18 [0.08]; 95% confidence interval [CI]: 0.02–0.34) and pressuring (B [SE]: 0.11 [0.06]; 95% CI: 0.001–0.22) feeding styles compared with food-secure mothers. No associations were found with feeding practices. Concern for their infant becoming overweight in the future was associated with food insecurity (adjusted odds ratio: 2.11 [95% CI: 1.02–4.38]). This concern mediated the relationship between food insecurity and both restrictive (P = .009) and pressuring (P = .01) feeding styles. CONCLUSIONS: Increased concern about future overweight and controlling feeding styles represent potential mechanisms by which food insecurity could be related to obesity. Obesity prevention should aim to decrease food insecurity and to reduce controlling feeding styles in families who remain food insecure.
Albuminuria in Mice after Injection of Antibodies against Aminopeptidase A: Role of Angiotensin Ii

It has been shown that injection of combinations of anti-aminopeptidase A (APA) monoclonal antibodies (mAb) that inhibit the enzyme activity induces an acute albuminuria in mice. This albuminuria is not dependent on inflammatory cells, complement, or the coagulation system. APA is an important regulator of the renin-angiotensin system because it is involved in the degradation of angiotensin II (Ang II). This study examined the potential role of glomerular Ang II in the induction of albuminuria. The relation among renal Ang II, glomerular APAX enzyme activity, and albuminuria was examined first. Injection of the nephritogenic combinations ASD-3/37 and ASD-37/41 in BALB/c mice induced albuminuria, whereas the non-nephritogenic combination ASD-3/41 had no effect. There was no clear relation between the inhibition of glomerular APA activity and albuminuria, yet it was evident that intrarenal Ang II levels were significantly increased in albuminuric mice and not in nonalbuminuric mice. As a next step, anti-APA mAb were administered to angiotensinogen-deficient mice that do not produce Ang II, and kidney morphology and albuminuria were determined. Angiotensinogen-deficient mice also developed albuminuria upon ASD-37/41 administration. Altogether, these findings clearly demonstrate that Ang II is not required for the induction of albuminuria upon injection of enzyme-inhibiting anti-APA mAb. Aminopeptidase A (APA; EC 3.4.11.7) is a homodimeric type II membrane-bound protease, which specifically hydrolyses N-terminal glutamyl and aspartyl residues from peptides (1,2). APA has a widespread organ distribution, but in mouse kidney it is predominantly expressed on podocytes and brush borders of proximal tubular epithelial cells (3–5). APA is an important regulator of the renin-angiotensin system, because it inacti-vates its most vasoactive component angiotensin II (Ang II) by cleaving off the N-terminal aspartate (6,7). In an effort to develop a mouse model of membranous nephropathy, we generated monoclonal antibodies (mAb) against APA. Injection of some of these mAb in BALB/c mice induces an acute albuminuria that is not dependent on systemic mediators, such as inflammatory cells, complement, or the coagulation system (3). Recently, we showed that injection of combinations of the anti-APA mAb, in doses that do not cause albuminuria when given alone, induces a massive acute albu-minuria. This albuminuria is observed only when using combinations of mAb that reduce the APA enzyme activity in vivo considerably (8). The latter finding suggested that Ang II might play a crucial role in the induction of the acute albuminuria in our model. It is widely known that the APA substrate Ang II …
Using Career Stage Theory to Predict Turnover Intentions among Salespeople

An important body of past research in sales management has evoked career stage theory in an attempt to better understand the attitudes and behaviors of the sales force. In doing so, the career stage construct has been defined and operationalized in numerous, and sometimes conflicting, ways. In this study, data collected from 123 automobile salespeople suggests that traditional psychometric measures of career stage have more explanatory power than demographic measures such as age or tenure when predicting turnover intentions.
Running head : PROPERTIES OF MAJORITY-RULE SUPERTREES Properties of Majority-Rule Supertrees

2 Supertree methods assemble many smaller phylogenetic trees, called input trees, into a larger phylogenetic tree, a supertree, whose taxon set is the union of the taxon sets of the input trees. This synthesis can provide a high-level perspective that is harder to attain from individual trees. A recent example of the use of this approach is the species-level phylogeny of nearly all extant Mammalia constructed by Bininda-Emonds et al. (2007) from over 2,500 partial estimates. Several of the known supertree methods are reviewed in the book edited by Bininda-Emonds (2004). The consensus tree problem can be viewed as the special case of the supertree problem where the input trees have identical leaf sets. Several consensus methods have been designed; a good survey of these methods, their properties, and their interrelationships is given by Bryant (2003). One particularly important and widely-used method is the majority-rule consensus tree (Margush and McMorris, 1981; Barthélemy and McMorris, 1986), which is the tree that contains the splits displayed by the majority of the input trees. Not only does this tree always exist, but it is also unique, can be efficiently constructed, and has the property of being a median tree relative to the Robinson-Foulds distance (Robinson and Foulds, 1981) (also known as the symmetric-difference distance). That is, the majority-rule consensus tree is a tree whose total Robinson-Foulds distance to the input trees is minimum. In light of the above, it is attractive to try to extend the majority-rule consensus method to the supertree setting, while (hopefully) retaining as many of its appealing qualities as possible. Cotton and Wilkinson (2007) defined two such extensions, which they called majority-rule (-) su-pertrees and majority-rule (+) supertrees (we give formal definitions of these supertree methods later). In their paper, they argue that these methods will, in general not produce trees that include 3 unsupported groups or that are biased with respect to input tree shape. Cotton and Wilkinson also posed four conjectures on some desired properties of their majority-rule supertrees. Informally, these properties state what information from the input trees, in the form of splits, is displayed by a majority-rule (or or majority-rule (+) supertree. Here we answer all of Cotton and Wilkin-son's conjectures, some in the affirmative, some in the negative. Indeed, we show that the two supertree methods differ in their specific properties, in that a conjecture may hold for one method, but its counterpart may …
The missing measure? Academic identity and the induction process

ABSTRACT The effectiveness of academic induction is under-monitored by higher education institutions (HEIs) despite growing evidence that some academics, facing increased expectations and rising accountability within higher education (HE), perceive a lack of support from their institution. In this paper, we argue that HEIs should follow the example of other sectors to promote socialisation through adequate and supportive scaffolding of the multiple responsibilities that new academics are required to take on. We offer a dual lens into the induction of early career academics in the contemporary university. Using corpus analysis techniques, we survey recent research into induction from the fields of HE studies and of human resources (HR). The HR literature displays a greater emphasis on organisational socialisation but also on performance measures. Secondly, drawing on an empirical study of researcher experiences within a measured and funding-directed environment, we surface the challenges faced by new academics and the tensions of juggling multiple roles and identities. We find that induction programmes that encourage and educate individuals to take responsibility for their socialisation can enhance positive outcomes. Paradoxically, traditional, one-size-fits-all, induction that focuses on the ‘doing’ of academic practice leaves individuals unequally prepared for academic life. The empirical study findings echo claims in the literature that communities of practice can act to positively support newer academics. The induction challenge then is to provide personalised, professional scaffolding for scholarly development and to monitor its effectiveness, while seeking opportunities to build a more supportive academic culture.
Periocular biometrics: An emerging technology for unconstrained scenarios

The periocular region has recently emerged as a promising trait for unconstrained biometric recognition, specially on cases where neither the iris and a full facial picture can be obtained. Previous studies concluded that the regions in the vicinity of the human eye - the periocular region- have surprisingly high discriminating ability between individuals, are relatively permanent and easily acquired at large distances. Hence, growing attention has been paid to periocular recognition methods, on the performance levels they are able to achieve, and on the correlation of the responses given by other. This work overviews the most relevant research works in the scope of periocular recognition: summarizes the developed methods, and enumerates the current issues, providing a comparative overview. For contextualization, a brief overview of the biometric field is also given.
Tag Management in a Reconﬁgurable Tagged-Token Dataﬂow Architecture

: Combining dataﬂow concepts with reconﬁgurable computing provides a great potential to exploit the application parallelism efﬁciently. However, to express such parallelism cannot be a trivial task. Therefore, there is a great effort to automatically translate programs originally written in procedural languages (like C and Java) into dataﬂow architectures which express the parallelism in a natural way. Our previous work presents a static dataﬂow architecture which is part of a framework to translate C programs into reconﬁgurable dataﬂow architectures. In this paper, it is discussed an implementation of tag management in a reconﬁgurable tagged-token dataﬂow architecture which was implemented on a ﬁeld programmable gate array (FPGA). Although tagged-token is a traditional concept to implement dynamic dataﬂow machines, they have not been well explored in FPGA-based dataﬂow architectures. The FPGA-based dynamic dataﬂow architecture shows the potential for high computation rates allowing more efﬁcient execution and presenting a more effective way to exploit parallelism for several program statements, as nested loops and function calls, when compared to static dataﬂow architectures.
Building capacities, exerting power: The European Union police mission in the Palestinian Authority

Abstract This article offers a Foucauldian approach to examine the European Union Police Mission in the Palestinian Authority. Using Foucault’s ideas on ‘policing’, ‘discipline’ and ‘normalization’ and applying an interpretive approach, the article argues that the EU police mission rests on ideas, visions and techniques that problematize local capacities and skills in the policing of the population. It highlights the epistemic context of knowledge creation within which the local becomes an object of intervention through two techniques: benchmarking and capacity-building. The article also discusses what is left invisible and unaddressed in EUPOL COPPS activities.
Epidermal Growth Factor Receptor Silencing Blunts the Slow Force Response to Myocardial Stretch

Background Myocardial stretch increases force biphasically: the Frank‐Starling mechanism followed by the slow force response (SFR). Based on pharmacological strategies, we proposed that epidermal growth factor (EGF) receptor (EGFR or ErbB1) activation is crucial for SFR development. Pharmacological inhibitors could block ErbB4, a member of the ErbB family present in the adult heart. We aimed to specifically test the role of EGFR activation after stretch, with an interference RNA incorporated into a lentiviral vector (small hairpin RNA [shRNA]‐EGFR). Methods and Results Silencing capability of p‐shEGFR was assessed in EGFR‐GFP transiently transfected HEK293T cells. Four weeks after lentivirus injection into the left ventricular wall of Wistar rats, shRNA‐EGFR–injected hearts showed ≈60% reduction of EGFR protein expression compared with shRNA‐SCR–injected hearts. ErbB2 and ErbB4 expression did not change. The SFR to stretch evaluated in isolated papillary muscles was ≈130% of initial rapid phase in the shRNA‐SCR group, while it was blunted in shRNA‐EGFR–expressing muscles. Angiotensin II (Ang II)‐dependent Na+/H+ exchanger 1 activation was indirectly evaluated by intracellular pH measurements in bicarbonate‐free medium, demonstrating an increase in shRNA‐SCR–injected myocardium, an effect not observed in the silenced group. Ang II‐ or EGF‐triggered reactive oxygen species production was significantly reduced in shRNA‐EGFR–injected hearts compared with that in the shRNA‐SCR group. Chronic lentivirus treatment affected neither the myocardial basal redox state (thiobarbituric acid reactive substances) nor NADPH oxidase activity or expression. Finally, Ang II or EGF triggered a redox‐sensitive pathway, leading to p90RSK activation in shRNA‐SCR‐injected myocardium, an effect that was absent in the shRNA‐EGFR group. Conclusions Our results provide evidence that specific EGFR activation after myocardial stretch is a key factor in promoting the redox‐sensitive kinase activation pathway, leading to SFR development.
Mining the data cube for improving its scheme

The integration of data mining, data warehousing, and OLAP is an important research direction| Han 4] uses the term OLAP mining in this respect. Data warehouses facilitate data mining, and conversely, the desire to mine knowledge is an incentive to maintain large, integrated data warehouses. The data structures of data warehouses are typically \\at" multidimensional data cubes. In this paper, we present the notion of nested data cube, which we believe is a natural paradigm for perceiving large data cubes. Flat data cubes can be nested in numerous ways. Three measures for characterizing the complexity/simplicity of a particular nesting are presented. An interesting data mining problem then is: Given threshold values for each measure, nd a nesting that satisses each threshold. The computational complexity and the applicability of this problem are investigated. The integration of data mining, data warehousing, and OLAP is considered a promising research area. Data warehouses facilitate data mining, and conversely, the desire to mine knowledge is an incentive to maintain large, integrated data warehouses. OLAP users typically view the data as \\at" multidimensional data cubes. The top table of gure 1 shows the non-empty entries of such a data cube. The rst row, for example, indicates that at Allen's, the price of yellow hinges amounted to 10 dollars in January. The data cube may be called incomplete, as certain values are missing; for example, at Allen's there were no red hinges in January. This tabular representation has also been called an f-table 1]. Such tables are \\at," and consequently, can cause some perceptional diiculties: The dimensionality can be too high to be practically visualizable in a \cubic" format. The example table of gure 1 (top) has dimensionality=4. The cardinality can be large. The example table of gure 1 (top) has cardinality=11. In practice, the cardinality is typically in the order of thousands or millions. Clearly, such large tables or cubes are not t for human perception. Therefore, semi-automated \cube viewers" are needed, to help users to browse through the data cube.
Fly-Fishing on Vimeo: Cas(t)ing the Channel

ABSTRACT This article explored the symmetry of characteristics and practices that define meaning and identity of fly anglers using Bourdieu’s theory of habitus. Content analysis was used to analyze a systematic random sample of videos (N = 260) that anglers posted on Vimeo in relation to characteristics, fishing behavior, parallel actions, and content. Results confirmed that several key dispositions were shared within the videos, including type of water fished (rivers), type of fish caught (Salmonids), gratuitous lift of caught fish out of water, catch-and-release, treatment of fish once caught, the place of video (North America), and language of video (English). Suggestions are made to advance social science research in this area.
Verification of agent knowledge in dynamic access control policies

We develop a modeling technique based on interpreted systems in order to verify temporal-epistemic properties over access control policies. This approach enables us to detect information flow vulnerabilities in dynamic policies by verifying the knowledge of the agents gained by both reading and reasoning about system information. To overcome the practical limitations of state explosion in model-checking temporal-epistemic properties, we introduce a novel abstraction and refinement technique for temporal-epistemic safety properties in ACTLK (ACTL with knowledge modality K) and a class of interesting properties that does fall in this category.
Online Algorithm for Orthogonal Regression

In this paper, we introduce a new online algorithm for orthogonal regression. The method is constructed via a stochastic gradient descent approach combined with the idea of a tube loss function, which is similar to the one used in support vector (SV) regression. The algorithm can be used in primal or in dual variables. The latter formulation allows the introduction of kernels and soft margins. In addition, an incremental strategy algorithm is introduced, which can be used to find sparse solutions and also an approximation to the “minimal tube” containing the data. The algorithm is very simple to implement and avoids quadratic optimization.
A framework for QoS provisioning in unified communications networks

Telepresence, device independent communication, unified reachability and UC-enabled business processes are all advantages of employing Unified Communication (UC) in today's networks. Users can freely roam between networks and change the type of the devices they use and still enjoy the same type of service and quality they are expecting from their original network. Also UC improves business productivity by increasing the chances for real-time communication and collaboration. UC functionality is mainly implemented at the application layer and is manifested in the UC applications and services offered to end user, in the UC call and session control and UC call routing. To enable all these services and applications at the application layer, the network layer with all its comprising components must ensure stringent Quality of Service (QoS) as mandated by the UC services at the application layer. QoS provisioning in UC networks is sophisticated considering the diverse types of networks involved, the diverse levels of quality for the same service/application as they arrive from different networks, the types of services/applications sharing the same session and finally the performance parameters of those services or applications. In this paper, we introduce our UC QoS provisioning framework that receives packets belonging to different networks and sessions, classifies them, maps them using our mapping algorithm to a set of proposed UC classes, schedules them with our proposed queuing and scheduling scheme and then maps them back to the native classes belonging to different heterogeneous networks.
Distributed Graph-Partitioning based Coalition Formation for Collaborative Multi-Agent Systems Some Lessons Learned and Challenges Ahead

We study algorithms for distributed collaborative multi-agent coalition formation. The focus of our recent and ongoing research has been on coalition formation via scalable distributed graph partitioning of the underlying agents’ communication network topology. In that endeavor, we have been analyzing, simulating and optimizing our original graph partitioning algorithm called Maximal Clique based Distributed Coalition Formation (MCDCF). MCDCF is a fully distributed graph partitioning algorithm that was designed in a topology-independent manner, the only requirement being that the underlying graph be relatively sparse, which is a realistic assumption in most applications of our interest. In the present paper, we summarize our recent experimental findings on the performance of our algorithm on specific types of graph and draw some general lessons from those results. In particular, we focus on comparison and contrast between the MCDCF behavior on small-world networks and on ErdösRenyi random graphs. We draw several insights from the considerable differences in MCDCF performance on these two types of underlying graphs (even when the underlying average densities or even node degree distributions are the same), identify key areas for further improvement, and outline some