Miracle-dz/UniFAR-FTUs huggingface dataset:
1 CONVERGING APPROACHES TO AUTOMATED COMMUNICATIONS-BASED ASSESSMENT OF TEAM SITUATION AWARENESS

Collaboration enables people to execute tasks that are beyond the capabilities of any one of them. Each member of an organization or team has a set of skills, roles, and responsibilities that, when executed accurately and in synchronization with other members of that organization or team, enables them to accomplish the work of the organization. In complex, dynamic environments, team collaboration is more than the simple aggregation of the work products of individuals; collaboration also requires complex exchanges of information, largely through spoken or written language. Linguistic communication is the choreography of team performance. Modern networked information systems support synchronous and asynchronous communication among globally distributed team members via telephone, e-mail, instant messaging, and text chat-rooms, making possible the coordination of activities that would have been impossible or impractical in the past. The distributed project coordination common in commercial organizations would not be tenable without these technologies. However, these technologies do not ensure highly effective organization. Cognitive collaboration quality varies significantly between teams, whether they are collocated Gorman, & Kiekel, this volume). When collaboration tools do make a difference, it is not 2 always positive. These tools increase the opportunity for information overload; errors of commission (miscommunication) can increase relative to errors of omission (non-communication); and decisions and actions sometimes – and sometimes tragically – are The Department of Defense (DoD) uses networked collaboration technologies to coordinate distributed, heterogeneous forces for both wartime and peacetime activities. Such coordination is a key element of Network Centric Warfare or Network Centric Operations (NCO), a theory of warfare in the information age. Among the primary tenets of NCO is the belief that networked information and collaboration increases " shared situation awareness " , a common understanding of the state of the mission environment. This, in turn, is predicted to enhance the effectiveness of forces (Alberts, 2002). Some critics foresee a concurrent increase in the errors cited above. The debate is important to the nation's economic health, as well as its defense. However, NCO concepts are not the sole province of military organizations; they are also being applied in large and economically important commercial organizations. Effective work product requires that the individual contributors align their understanding of the state of the commercial environment, the corporate mission within it, and their responsibilities. Tools such as data dashboards, knowledge portals, distributed conferencing applications, and chat are often installed to facilitate this. Corporations, like DoD, are putting …
HER-2/neu (p185neu) protein expression in the natural or treated history of prostate cancer.

PURPOSE Amplification of HER-2/neu gene and overexpression of its encoded product, the p185neu (HER-2/neu) tyrosine kinase membrane receptor, have been associated with tumor progression in certain neoplasms. We conducted this study to investigate patterns of HER-2/neu protein expression in prostate cancer, analyzing different points in the natural and treated history of the disease. EXPERIMENTAL DESIGN Radical prostatectomy cases (83) and 20 metastatic lesions were studied for the association between HER-2/neu protein overexpression detected by immunohistochemistry and clinicopathological parameters, including time to prostate-specific antigen (PSA) relapse. RESULTS HER-2/neu protein overexpression, defined as complete membrane staining in >10% of tumor cells using the Food and Drug Administration-approved Dako kit, was found in 9 of 45 (20%) of evaluable hormone naïve primary tumors and 23 of 34 (67%) primary tumors after androgen-deprivation therapy (P = 0.0001). Of the 20 metastatic lesions, positivity was noted in 16 (80%) of the cases. On univariate analysis, HER-2/neu overexpression was associated with pretreatment PSA (P = 0.011) and time to PSA relapse (P = 0.02). After controlling for pretreatment PSA, the association between hormone treatment and HER-2/neu was still observed. No association was found between HER-2/neu overexpression and Gleason score, capsular invasion, and tumor proliferative index determined by Ki67. CONCLUSIONS These data suggest that there is significant HER-2/neu overexpression in primary tumors that persist after androgen deprivation. It also emphasizes the importance of characterizing tumors at determined points in the natural or treated history of prostate cancer when targeting treatment to specific biological processes.
Novel Lutein Loaded Lipid Nanoparticles on Porcine Corneal Distribution

Topical delivery has the advantages including being user friendly and cost effective. Development of topical delivery carriers for lutein is becoming an important issue for the ocular drug delivery. Quantification of the partition coefficient of drug in the ocular tissue is the first step for the evaluation of delivery efficacy. The objectives of this study were to evaluate the effects of lipid nanoparticles and cyclodextrin (CD) on the corneal lutein accumulation and to measure the partition coefficients in the porcine cornea. Lipid nanoparticles combined with 2% HPβCD could enhance lutein accumulation up to 209.2 ± 18 (μg/g) which is 4.9-fold higher than that of the nanoparticles. CD combined nanoparticles have 68% of drug loading efficiency and lower cytotoxicity in the bovine cornea cells. From the confocal images, this improvement is due to the increased partitioning of lutein to the corneal epithelium by CD in the lipid nanoparticles. The novel lipid nanoparticles could not only improve the stability and entrapment efficacy of lutein but also enhance the lutein accumulation and partition in the cornea. Additionally the corneal accumulation of lutein was further enhanced by increasing the lutein payload in the vehicles.
ethicillin-resistant Staphylococcus aureus and Staphylococcus eudintermedius in veterinary medicine

Staphylococci are important opportunistic pathogens in most animal species. Among the most relevant species are the coagulase positive species Staphylococcus aureus and Staphylococcus pseudintermedius. Methicillin resistance has emerged as an important problem in both of these organisms, with significant concerns about animal and public health. The relative importance of these staphylococci on different animal species varies, as do the concerns about zoonotic transmission, yet it is clear that both present a challenge to veterinary medicine. 2009 Elsevier B.V. All rights reserved. Corresponding author. Tel. : +1 519 824 4120x54064;
Good news and bad news: Do online investor sentiments reaction to return news asymmetric?

There is growing evidence to suggest that the impact of positive and negative news are asymmetricthat the impact of bad news has a much greater effect on investors’ sentiment than positive news does; investors react more harshly when bad news is disseminated. Using daily data from 30 companies listed on the DJIA index over the period April 3, 2012 to April 5, 2013, we analyse 289,443 online tweets, from the so-called StockTwits, and construct a measure of online investor sentiment. The aim of this paper is to explore the asymmetric responses of online investor sentiments to different news in different market conditions (i.e. bull versus bear market). Applying data mining techniques for sentiment detection coupled with a nonlinear econometric model, we find strong evidence of asymmetry. The result provides evidence that investor sentiments exhibit different sensitivity to news in the bull and bear market. In particular, return effects on sentiment are positive (negative) in the bull and (bear) market where this effect is more pronounced in the bull market.
Compiler Analysis for Cache Coherence: Interprocedural Array Data-Flow Analysis and Its Impact on Cache Performance

In this paper, we present compiler algorithms for detecting references to stale data in shared-memory multiprocessors. The algorithm consists of two key analysis techniques, state reference detection and locality preserving analysis. While the stale reference detection finds the memory reference patterns that may violate cache coherence, the locality preserving analysis minimizes the number of such stale references by analyzing both temporal and spatial reuses. By computing the regions referenced by arrays inside loops, we extend the previous scalar algorithms for more precise analysis. We develop a full interprocedural array data-flow algorithm, which performs both bottom-up side-effect analysis and top-down context analysis on the procedure call graph to further exploit locality across procedure boundaries. The interprocedural algorithm eliminates cache invalidations at procedure boundaries, which were assumed in the previous compiler algorithms. We have fully implemented the algorithm in the Polaris parallelizing compiler. Using execution-driven simulations on Perfect Club benchmarks, we demonstrate how unnecessary cache misses can be eliminated by the automatic stale reference detection. The algorithm can be used to implement cache coherence in the shared-memory multiprocessors that do not have hardware directories, such as Cray T3D.
Optimized resource allocation for the uplink of SFBC-CDMA systems

In this paper we present an optimized resource allocation algorithm for the uplink of space frequency block coded code division multiple access (SFBC-CDMA) systems. The algorithm allocates appropriate base transceiver stations (BTS), antenna array sub system and frequency subcarrier blocks to users such that the pair wise cross correlation between the users is minimized while maximizing the channel coherence time. The intermediate effects such as reduction of the channel estimation error and higher signal powers culminate into more cost effective multiple input multiple output (MIMO) operation. The proposed algorithm shows a noticeable improvement in the bit error rate of the users and the bandwidth efficiency of the system compared to random resource assignment.
Are Student Ratings of Instruction Useful?

Despite the lead article^Rs title ^SValidity Concerns and Usefulness of Student Ratings of Instruction^T (Greenwald 1997) in the American Psychologist^R^Rs special section on teacher ratings, the papers did not provide direct evidence on ^Susefulness. ^T There is no evidence that the use of teacher ratings improves learning in the long run. The papers do not show that the effects would improve the allocation of effort between teaching and research, or that the quality of the educational experience will be better, or that students and faculty will be happier. Given the evidence to date, the case for student ratings is weak. I raise some questions about usefulness, with a particular emphasis on the ratings^R effects on learning.
Detection of stable properties in distributed applications

When evaluated to true, a stable property remains true forever. Such a stable property may characterize important states of a computation. This is the case of deadlocked or terminated computations. In this paper we expose a general algorithm for the distributed detection of stable properties in distributed applications or systems. This distributed algorithm deals with every stable property of a fairly general class : in this sense the algorithm is generic. This was achieved using a methodical approach, with a strong distinction between the computation and control activities in the problem. Moreover, the detection method used by the algorithm is based on an observational mechanism,
Metabolism, Excretion, and Pharmacokinetics of ((3,3-Difluoropyrrolidin-1-yl)((2S,4S)-4-(4-(pyrimidin-2-yl)piperazin-1-yl)pyrrolidin-2-yl)methanone, a Dipeptidyl Peptidase Inhibitor, in Rat, Dog and Human

The disposition of 3,3-difluoropyrrolidin-1-yl{(2S,4S)-4-[4-(pyrimidin-2-yl)piperazin-1-yl]pyrrolidin-2-yl}methanone (PF-00734200), a dipeptidyl peptidase IV inhibitor that progressed to phase 3 for the treatment of type 2 diabetes, was examined in rats, dogs, and humans after oral administration of a single dose of [14C]PF-00734200. Mean recoveries of administered radioactivity were 97.1, 92.2, and 87.2% in rats, dogs, and humans, respectively. The majority of radioactive dose was detected in the urine of dogs and humans and in the feces of rats. Absorption of PF-00734200 was rapid in all species, with maximal plasma concentrations of radioactivity achieved within 1 h after the dose. Circulating radioactivity was primarily composed of the parent drug (79.9, 80.2, and 94.4% in rat, dog, and human, respectively). The major route of metabolism was due to hydroxylation at the 5′ position of the pyrimidine ring (M5) in all species. In vitro experiments with recombinant cytochrome P450 isoforms suggested that the formation of M5 was catalyzed both by CYP2D6 and CYP3A4. Molecular docking simulations showed that the 5′ position of the pyrimidine moiety of PF-00734200 can access the heme iron-oxo of both CYP3A4 and CYP2D6 in an energetically favored orientation. Other metabolic pathways included amide hydrolysis (M2), N-dealkylation at the piperazine nitrogen (M3) and an unusual metabolite resulting from scission of the pyrimidine ring (M1). Phase II metabolic pathways included the following: carbamoyl glucuronidation (M9), glucosidation (M15) on the pyrrolidine nitrogen, and conjugation with creatinine to form an unusual metabolite/metabonate (M16). The data from these studies suggest that PF-00734200 is eliminated by both metabolism and renal clearance.
Differential Expression of Ion Channel Transcripts in Atrial Muscle and Sinoatrial Node in Rabbit

The aim of the study was to identify ion channel transcripts expressed in the sinoatrial node (SAN), the pacemaker of the heart. Functionally, the SAN can be divided into central and peripheral regions (center is adapted for pacemaking only, whereas periphery is adapted to protect center and drive atrial muscle as well as pacemaking) and the aim was to study expression in both regions. In rabbit tissue, the abundance of 30 transcripts (including transcripts for connexin, Na+, Ca2+, hyperpolarization-activated cation and K+ channels, and related Ca2+ handling proteins) was measured using quantitative PCR and the distribution of selected transcripts was visualized using in situ hybridization. Quantification of individual transcripts (quantitative PCR) showed that there are significant differences in the abundance of 63% of the transcripts studied between the SAN and atrial muscle, and cluster analysis showed that the transcript profile of the SAN is significantly different from that of atrial muscle. There are apparent isoform switches on moving from atrial muscle to the SAN center: RYR2 to RYR3, Nav1.5 to Nav1.1, Cav1.2 to Cav1.3 and Kv1.4 to Kv4.2. The transcript profile of the SAN periphery is intermediate between that of the SAN center and atrial muscle. For example, Nav1.5 messenger RNA is expressed in the SAN periphery (as it is in atrial muscle), but not in the SAN center, and this is probably related to the need of the SAN periphery to drive the surrounding atrial muscle.
Uniqueness of polynomial canonical representations

Let P(z) and Q(y) be polynomials of the same degree k≥1 in the complex variables z and y , respectively. In this extended abstract we study the non-linear functional equation P(z)=Q(y(z)) , where y(z) is restricted to be analytic in a neighborhood of z=0 . We provide sufficient conditions to ensure that all the roots of Q(y) are contained within the range of y(z) as well as to have y(z)=z as the unique analytic solution of the non-linear equation. Our results are motivated from uniqueness considerations of polynomial canonical representations of the phase or amplitude terms of oscillatory integrals encountered in the asymptotic analysis of the coefficients of mixed powers and multivariable generating functions via saddle-point methods. Uniqueness shall prove important for developing algorithms to determine the Taylor coefficients of the terms appearing in these representations. The uniqueness of Levinson's polynomial canonical representations of analytic functions in several variables follows as a corollary of our one-complex variables results.
The Foraging Behavior of Free-ranging Rattlesnakes (Crotalus oreganus) in California Ground Squirrel (Otospermophilus beecheyi) Colonies

Abstract Foraging is a key aspect of a species’ ecology and decisions made while foraging affect fitness in many ways. Although much research has focused on snake foraging, only a handful of detailed studies have been conducted on free-ranging individuals, all on Crotalus horridus. We used fixed videography to collect data on free-ranging Northern Pacific Rattlesnake (Crotalus oreganus) behavior to qualitatively test predictions regarding interspecific differences in rattlesnake foraging behavior. We analyzed foraging behaviors based on encounter rates with prey and strike rates on prey, distances moved between consecutive ambush sites, residency time at each site, and poststrike behaviors. Snakes encountered approximately 4 prey/d, with California Ground Squirrels (Otospermophilus beecheyi) being encountered at much higher rates than other prey types. Crotalus oreganus typically did not remain at hunting sites for long durations compared with other species, and generally exhibited short distance movements (<10 m) to new sites. Snakes initiated strikes during 21% of all prey encounters, and 49% of these strikes were successful. Snakes were more likely to hold on to nonsquirrel prey than squirrels after a strike. When snakes struck and released prey, the distance prey fled after a strike was positively related to the time snakes spent locating the envenomated prey. Our findings indicate that variation in rattlesnake foraging behavior both within and between species might be driven largely by differences in habitat features, including prey abundance.
An Analysis of Augmented Reality Systems

Augmented Reality Systems (ARSs) are a logical evolution of virtual reality systems. This new type of system enriches reality by mixing real elements with electronic information. This paper identifies the common tasks performed by ARSs, the underlying software and hardware components that support them and the most common architectures for ARSs. Subsequently, the paper reviews some ARSs, identifying their main hardware and software components. Thus, the goal of this paper is to serve as a guide for those entities that are planning to deploy an augmented reality system.
Nonasymptotic Bounds for Bayesian Order Identification with Application to Mixtures

The efficiency of two Bayesian order estimators is studied underweak assumptions. By using nonparametric techniques, we prove newnonasymptotic underestimation and overestimation bounds. The boundscompare favorably with optimal bounds yielded by the Stein lemmaand also with other known asymptotic bounds. The results applyto mixture models. In this case, the underestimation probabilitiesare bounded by a constant times e-an (some a > 0, all sample sizen = 1). The overestimation probabilities are bounded by 1/pn (alln larger than a known integer), up to a log n factor.
Journal of Graph Algorithms and Applications I/o-efficient Algorithms on Near-planar Graphs 504 Haverkort & Toma I/o-efficient Algorithms on Near-planar Graphs

Obtaining I/O-efficient algorithms for basic graph problems on sparse directed graphs has been a long-standing open problem. The best known algorithms for most basic problems on such graphs still require Ω(V) I/Os in the worst case, where V is the number of vertices in the graph. Nevertheless optimal O(sort(V)) I/O algorithms are known for special classes of sparse graphs, like planar graphs and grid graphs. It is hard to accept that a problem becomes difficult as soon as the graph contains a few deviations from planarity. In this paper we extend the class of graphs on which basic graph problems can be solved I/O-efficiently. We discuss several ways to transform graphs that are almost planar into planar graphs (given a suitable drawing), and based on those transformations we obtain the first I/O-efficient algorithms for directed graphs that are almost planar. Let G be a directed graph that is given as a planar subgraph (V, E) and a set of additional edges EC. Our main result is a single-source-shortest-paths algorithm that runs in O(EC + sort(V + EC)) I/Os. When EC is small our algorithm is a significant improvement over the best previously known algorithms, which required Ω(V) I/Os. Alternatively, when G is given with a drawing with T crossings, we can compute single-source shortest paths in O(sort(V + T)) I/Os. We obtain similar bounds for computing (strongly) connected components, breadth-first and depth-first traversals and topological ordering.
A jointly local structured sparse deep learning network for face recognition

In this paper, we proposed an optimized Sparse Deep Learning Network (SDLN) model for Face Recognition (FR). A key contribution of this work is to learn feature coding of human face with a SDLN based on local structured Sparse Representation (SR). In traditional sparse FR methods, different poses and expressions of training samples could have great influence on the recognition results. We consider the SR that should be guided by context constraints which are defined by the correlations of dictionary atoms. The over-complete common dictionary that contains common atom set has been learned from a local region structured sparse encoding process. We obtained over-complete common dictionary and feature coding for each face. As we all know that the deep learning has been widely applied to face feature learning. Using traditional deep learning methods can not contain variations of face identity information. We have to get face features of compatible change in a jointly deep learning network. The proposed SDLN is jointly fine-tuned to optimize for the task of FR. The SDLN achieves high FR performance on the ORL and FERET database.
Identities, traditions, and diversity in Cahokia's uplands

In the last five years, the Richland Archaeological Project has excavated several sites in what is called the Richland complex. The sites lie 15-40 km southeast of Cahokia. Their excavation has greatly increased information about people, places, and events at the time of the rise of Cahokia. These sites exhibit much more variability in terms of differences from and similarities to settlements in and around Cahokia than previous models of Mississippianization have suggested. Embedded in these differences and similarities are clues as to how people negotiated community relationships and identities in a rapidly changing social and political landscape. These communities also offer insights into the development of Cahokia itself.