Miracle-dz/UniFAR-FTUs huggingface dataset:
Interactive Analysis of Agent-Goal Models in Enterprise Modeling

Understanding and analyzing the needs of an enterprise in the early stages of a project requires knowledge about stakeholders, their goals, interactions, and alternative actions. Agent-goal models offer a way to systematically and graphically capture this information, even as it evolves through continued elicitation. However, the complexity of resulting models makes it difficult to evaluate the achievement of key stakeholder goals within a model without applying systematic analysis procedures. Existing approaches to agent-goal model evaluation focus on automated procedures, without explicitly promoting model iteration and domain elicitation. In this paper, the authors argue that "Early" Enterprise modeling requires analysis procedures that account for the incompleteness and informality of early agent-goal models, facilitating iteration, elicitation, and user participation. A qualitative, interactive evaluation procedure for agent-goal models is introduced, using the i* Framework illustrated. Case study experience and results of an exploratory experiment show the applicability of the procedure to early enterprise analysis.
Targeting retinal dopaminergic neurons in tyrosine hydroxylase-driven green fluorescent protein transgenic zebrafish

Purpose Dopamine plays key roles in a variety of basic functions in the central nervous system. To study developmental and functional roles of dopaminergic cells in zebrafish, we have generated a transgenic line of zebrafish expressing green fluorescent protein (GFP) under the control of the tyrosine hydroxylase (th1) promoter. Methods A 12 kb gene fragment that contains the th1 promoter was isolated and ligated to the MmGFP coding sequence, linearized, microinjected into 1–2 cell stage embryos and the founders crossed with wild-type fish to screen for transgenic lines. Tg(−12th:MmGFP) embryos were visualized under fluorescence microscopy for GFP expression during development. Confocal microscopy was used to visualize GFP-labeled cells in the living whole mount retina and immunostained vertical sections of adult zebrafish retina. Single-cell reverse transcription polymerase chain reaction (RT–PCR) was performed on individual GFP+ cells collected from dispersed retinal cell cultures for th1 and dopamine transporter (dat). Loose-patch recordings of spike activity of GFP+ neurons were made in isolated whole mount retinas. Results th1 promoter-driven GFP exhibited robust expression in the brain and retina during zebrafish development. In juvenile and adult fish retinas, GFP was expressed in cells located in the inner nuclear layer. Immunocytochemistry with antibodies for GFP and TH showed that 29±2% of GFP-labeled cells also expressed TH. Two subpopulations of GFP-labeled cells were identified by fluorescent microscopy: bright GFP-expressing cells and dim GFP-expressing cells. Seminested single-cell RT–PCR showed that 71% of dim GFP-expressing cells expressed both th and dat mRNA. Loose-patch voltage-clamp recording from dim GFP-labeled cells in retinal whole mounts revealed that many of these dopaminergic neurons are spontaneously active in darkness. Conclusions Although this Tg(−12th:MmGFP) line is not a completely specific reporter for dopaminergic neurons, using relative GFP intensity we are able to enrich for the selection of retinal dopaminergic cells in vitro and in situ in molecular and electrophysiological experiments. This transgenic line provides a useful tool for studying retinal dopaminergic cells in the zebrafish.
Identification of a Negative Regulator of Gibberellin Action, HvSPY, in Barley

To broaden our understanding of the molecular mechanisms of gibberellin (GA) action, we isolated a spindly clone (HvSPY) from barley cultivar Himalaya and tested whether the HvSPY protein would modulate GA action in barley aleurone. The HvSPY cDNA showed high sequence identity to Arabidopsis SPY along its entire length, and the barley protein functionally complemented the spy-3 mutation. HvSPY and SPY proteins showed sequence relatedness with animal O-linked N-acetylglucosamine transferases (OGTs), suggesting that they may also have OGT activity. HvSPY has a locus distinct from that of Sln, a mutation that causes the constitutive GA responses of slender barley, which phenotypically resembles Arabidopsis spy mutants. The possibility that the HvSPY gene encodes a negative regulator of GA action was tested by expressing HvSPY in a barley aleurone transient assay system. HvSPY coexpression largely abolished GA3-induced activity of an α-amylase promoter. Surprisingly, HvSPY coexpression increased reporter gene activity from an abscisic acid (ABA)–inducible gene promoter (dehydrin), even in the absence of exogenous ABA. These results show that HvSPY modulates the transcriptional activities of two hormonally regulated promoters: negatively for a GA-induced promoter and positively for an ABA-induced promoter.
SF-sketch: slim-fat-sketch with GPU assistance

A sketch is a probabilistic data structure that is used to record frequencies of items in a multi-set. Various types of sketches have been proposed in literature and applied in a variety of fields, such as data stream processing, natural language processing, distributed data sets etc. While several variants of sketches have been proposed in the past, existing sketches still have a significant room for improvement in terms of accuracy. In this paper, we propose a new sketch, called Slim-Fat (SF) sketch, which has a significantly higher accuracy compared to prior art, a much smaller memory footprint, and at the same time achieves the same speed as the best prior sketch. The key idea behind our proposed SF-sketch is to maintain two separate sketches: a small sketch called Slim-subsketch and a large sketch called Fat-subsketch. The Slim-subsketch, stored in the fast memory (SRAM), enables fast and accurate querying. The Fat-subsketch, stored in the relatively slow memory (DRAM), is used to assist the insertion and deletion from Slim-subsketch. We implemented and extensively evaluated SF-sketch along with several prior sketches and compared them side by side. Our experimental results show that SF-sketch outperforms the most commonly used CM-sketch by up to 33.1 times in terms of accuracy. The concise version of our paper will appear in IKDE 2017.
Fuzzy K-Means Incremental Clustering Based on K-Center and Vector Quantization

Fuzzy k -means and vector quantization are combined in this paper to complement each other in incremental mode because each has qualities which the other lacks. The threshold of vector quantization is given and the pattern of computing the distance between the new coming data point and the k centers is introduced in a new way. We firstly reduce redundant attributes and eliminate the difference of units of dimensions and make units of all attributes same. Then, we use k -center to produce initial k means and partition data points into no more than k clusters. Besides, we adopt vector quantization to classify incremental data points and then adjust means after the structure of clustering varying. Finally, it is applied to real datasets and results show its efficiency and precision.
Galaxy Formation and Evolution: What to Expect from Hierarchical Clustering Models

In hierarchical clustering theories of galaxy formation, galaxies form by gas cooling and condensing into dark matter halos which, in turn, form by a hierarchy of mergers (White & Rees 1978). The context in which this process takes place is specified by a cosmological model that determines the spectrum of primordial density fluctuations and the rate at which they grow by gravitational instability. The best known example of such a model is the cold dark matter (CDM) model (see Frenk 1991 for a review), but a number of alternatives (mostly variants of CDM), have recently become popular in response to new data on large-scale structure and the COBE detection of anisotropies in the microwave background radiation. Regardless of the specific cosmological model that one wishes to consider, there are at least six distinct physical processes that need to be included in any theory of galaxy formation: - 1. The growth of dark matter halos by accretion and mergers. - 2. The dynamics of cooling gas. - 3. Star formation. - 4. Energy feedback into prestellar gas from the products of stellar evolution. - 5. Evolution of the stellar populations that form. - 6. Galaxy mergers.
A NetBSD-based IPv 6 / NEMO Mobile Router

This paper defines the problem statement of vehicle-embedded networking in order to communicate with the infrastructure (the Internet) as well as with other cars. Based on this problem statement, we explain the steps that allowed us to build a mobile router addressing this problem by using state of the art software. This software includes the NetBSD-current kernel and networking code developed by the Japanbased WIDE project working groups: the KAME IPv6 stack with SHISA extensions for Mobile IPv6 (MIPv6) and Network Mobility (NEMO) support, and the Zebrabased OLSR daemon with IPv6 extensions allowing for a Mobile Ad Hoc Networks (MANET) and NEMO cooperation, formerly known as MANEMO.
A Tree Based Strategy for Test Data Generation and Cost Calculation for Uniform and Non-Uniform Parametric Values

Software testing is a very important phase of software development to ensure that the developed system is reliable. Due to huge number of possible combinations involved in testing and the limitation in the time and resources, it is usually too expensive and sometimes impossible to test systems exhaustively. To reduce the number of test cases to an acceptable level, combinatorial software interaction testing has been suggested and used by many researchers in the software testing field. It is also reported in literature that pairwise (2-way) combinatorial interaction testing can detect most of the software faults. In this paper we propose a new strategy for test data generation, a Tree Based Test Case Generation and Cost Calculation strategy (TBGCC) that supports uniform and non-uniform values, for input parameters (i.e. parameters with same and different number of values). Our strategy is distinct from others work since we include only the test cases which covers the maximum number of pairs in the covering array at every iteration. Additionally, the whole set of test cases will be checked as one block at every iteration only until the covering array is covered. Other strategies check each test case (N-1) times, where N is the maximum number of the input parameters. A detail description of the tree generation strategy, the iterative cost calculation strategy and effecient empirical results are presented.
Induction chemotherapy followed by concurrent chemoradiotherapy versus concurrent chemoradiotherapy alone in stage III-IVb nasopharyngeal carcinoma patients with Epstein-Barr virus DNA ≥4000 copies/ml: a matched study

Background The effects of induction chemotherapy (IC) followed by concurrent chemoradiotherapy (CCRT) in high-risk (stage III-IVb with EBV DNA≥4000 copies/ml) nasopharyngeal carcinoma (NPC) patients are unclear. Methods A total of 325 high-risk NPC patients treated with IC+CCRT or CCRT alone who were treated with intensity-modulated radiation therapy (IMRT) between March 2007 and March 2013 were included. For each patient in the IC+CCRT group, a matched pair in the CCRT group was matching for: gender, age, T stage, N stage, clinical stage and WHO (World Health Organization) type. The primary endpoint was overall survival (OS), and the secondary endpoints were progression-free survival (PFS), distant metastasis-free survival (DMFS), and locoregional relapse-free survival (LRFS). Results There were no significant differences in OS, PFS, DMFS, and LRFS between the IC+CCRT (148 patients) and CCRT (177 patients) groups. After matching, 103 paired patients were analyzed, and there were no differences between the IC+CCRT and CCRT groups regarding clinical outcomes. Based on the subgroup analysis of 156 very-high-risk patients (stage N2-3 with EBV DNA ≥4000 copies/ml), the 5-year OS of the IC+CCRT and CCRT groups was 84.3% and 67.5% (P =0.033), respectively. Based on our multivariate analysis, the treatment group was significantly associated with OS (P=0.034; HR0.451, 95%CI 0.216-0.941). Conclusions IC+CCRT did not improve the clinical outcomes of high-risk NPC patients compared to CCRT alone. However, in very-high-risk patients, IC+CCRT treatment led to increased OS compared to patients received CCRT treatment alone.
Overlapping Community Detection by Local Community Gravitation in Social Networks

In this paper, a simple but efficient method of overlapping community detection is presented using local community gravitation in social networks. Given a high-quality, non-overlapping partition generated by existing methods, this proposed method identifies the overlapping nodes from their surrounding partitioned communities according to their local community gravitation, with low computational complexity. Our experiments on synthetic networks and real-world networks demonstrate that the proposed algorithm is better than other algorithms in terms of the general quality.
Spectral Slicing for Data Communications

In short range data communications, the cost of terminal equipment is borne by the user so lowcost wavelength generation methods are desirable. One option is to use an optical filter to provide narrow slices of a broadband noise source producing an approach commonly known as spectral slicing (SS). This provides a cost-effective alternative to laser diode sources but introduces excess intensity noise due to the source incoherence. This paper addresses the bit error rate performance of SS systems and their capabilities. Consideration is given also to the impact of different modulation formats and performance improvement using error correcting codes. Introduction Wavelength division multiplexing (WDM) is finding its way into access networks where the cost of expensive components is shared by a relatively small number of customers. One low cost option for implementing WDM is to use an optical filter to provide narrow slices of a broadband noise source, known as spectral or spectrum slicing (SS) [1]. Recent developments in, for example, superluminescent LEDs [2] have greatly increased slice output powers in recent years. However, the excess intensity noise in SS compared to laser diodes due to the source incoherence remains, producing a power penalty in exchange for the inexpensive nature of the source. System Model The SS system, shown schematically in Figure 1, is assumed to operate in the C-band and thus linear dispersion is dominant. The broadband optical source may be modeled as white Gaussian noise of two-sided power spectral density (PSD) N0/2. Slices are taken from it with an unapodized arrayed waveguide grating (AWG) with impulse response ( ) 2 exp t α − ∝ [3], where the parameter α is half the mean squared coherence time. This produces noise that is Gaussian but no longer white because of the effect of the filter on the PSD. The slices are assumed to be narrow in comparison with the approximately rectangular passbands of the WDM multiplexer (MUX) and demultiplexer (DEMUX), which then have a negligible effect on the Gaussian spectrum of the SS source. On-off keyed (OOK) data drives a polarization-insensitive intensity modulator of ideal extinction ratio such that the optical field has an envelope ( ) t s . The modulated signal travels through an optical fiber path of length z , having linear dispersion 2 β (here taken as -20 ps 2 per kilometer). A trade off between the dispersive spreading of the pulses generated using a wide filter, causing intersymbol interference (ISI), and the increasingly detrimental effect of the excess noise with narrowing filter bandwidth occurs. Proceedings Symposium IEEE/LEOS Benelux Chapter, 2006, Eindhoven
1 Quantitative Performance Metrics for Mobile Robots Navigation

Mobile robots navigation involves the design of navigation algorithms. There are several navigation methods for mobile robots and every time a new navigation algorithm is proposed, some comparisons with traditional algorithms are usually made, but there isn’t set of benchmarks globally accepted to assess the performance of algorithms. Despite the wide variety of studies and research on robot navigation systems, performance measures are often neglected in this research area, which makes it difficult to make an objective performance comparison (Wong et al., 2002); in general, use of quantitative metrics is limited to measuring the length of the path or the time needed by the robot to complete the task. Additionally, the lack of consensus on how to define or measure these systems impedes rigor and prevents evaluation of progress in this field and compare its different capabilities (Evans & Messina, 2000). As the degree of complexity in robotics is increasing, becomes necessary to establish proper approaches and benchmarking procedures, mainly for two reasons: first, reliable benchmarking is necessary in order to allow the comparison of the many robotics research results seeking this way to enable their industrial application. Second, to position the robotics as a serious science is important to consider the replication of experiments, i.e., it is important to verify whether a new procedure or algorithm proposed is really a breakthrough that can be used in new applications. This would be achieved only if it is determined which are the appropriate benchmarking procedures that allow to compare the actual practical results with reference to standard accepted procedures (Eurongemsig, 2008). However, by applying navigation comparison metrics of a mobile robot, such as the length of trajectory (path), collision risk and smoothness of trajectory, using a protocol, that is in a systematic and ordered way, works on mobile robots navigation algorithms can be systematized, and this will help researchers to decide which algorithm should be implemented in the vehicle. This chapter describes aspects related with a procedure used for the performance evaluation of mobile robots navigation algorithms. First, several performance metrics used in the navigation of mobile robots are described, then, the protocol to be followed in the performance evaluation is defined, finally, the results are presented. To illustrate the procedure, we used simulation software. 24
thecerealkiller at SemEval-2016 Task 4: Deep Learning based System for Classifying Sentiment of Tweets on Two Point Scale

In this paper, we propose a deep learning sys-tem for classiﬁcation of tweets on a two-point scale. Our architecture consists of a multilayered recurrent neural network having gated recurrent units. The network is pre-trained with a weakly labeled dataset of tweets to learn the sentiment speciﬁc embeddings. Then it is ﬁne tuned on the given training dataset of the task 4B in SemEval-2016. The network does very little pre-processing for raw tweets and no post-processing at all. The proposed sys-tem achieves 3rd rank on the leaderboard of task 4B.
Tuning the continual flow pipeline architecture

Continual Flow Pipelines (CFP) allows a processor core to process instruction windows of hundreds of instructions without increasing cycle-critical pipeline resources. When a load misses the data cache, CFP checkpoints the processor register state and then moves all miss dependent instructions into a low complexity non-critical waiting buffer to unblock the pipeline. Meanwhile, miss independent instructions execute normally and update the processor state. When the miss data returns, CFP replays the miss dependent instructions from the waiting buffer and then merges the miss dependent and the miss independent execution results. CFP was initially proposed for cache misses to DRAM. Later work focused on reducing the execution overhead of CFP by avoiding flushing the pipeline before replaying miss dependent instructions, and on allowing these instructions to execute concurrently with miss independent instructions. The goal of these improvements was to gain performance by applying CFP to L1 data cache misses that hit the last level on chip cache. However, many applications or execution phases of applications incur excessive amount of replay and/or rollbacks to the checkpoint. This frequently cancels any benefits from CFP or even causes performance degradation. In this paper, we improve the CFP architecture by using a novel virtual register renaming substrate, and by tuning the replay policies to mitigate excessive replays and rollbacks to the checkpoint. We describe these new design optimizations and show, using Spec 2006 benchmarks and microarchitecture performance and power models of our design, that our Tuned CFP architecture improves performance and power consumption over previous CFP architectures by ~15% and 9%, respectively.
SURVEY OF BREAKFAST CONSUMPTION STATUS AND ITS PREDICTORS AMONG QOM STUDENTS BASED ON THE PENDER'S HEALTH PROMOTION MODEL CONSTRUCTS

1 نارهت يكشزپ مولع هاگشناد ،تشادهب هدكشناد ،تشادهب شزومآ دشرا يسانشراك يوجشناد ناريا ، 2 لوئسم هدنسيون : رايداتسا هورگ نارهت يكشزپ مولع هاگشناد ،تشادهب هدكشناد ،تشادهب شزومآ ، ناريا . يكينورتكلا تسپ : t-dehdari@tums.ac. ir 3 نارهت يكشزپ مولع هاگشناد ،تشادهب هدكشناد ،هيذغت هورگ رايداتسا ناريا ، 4 رامآ هورگ رايداتسا يضاير و ، ريدم تاقيقحت زكرم ي ،يناتسراميب ت يناسر علاطا و تيريدم هدكشناد نارهت يكشزپ مولع هاگشناد ،يكشزپ ناريا ،
Toward a Theory of Stakeholder Identification and Salience: Defining the Principle of who and What Really Counts

Stakeholder theory has been a popular heuristic for describing the management environment for years, but it has not attained full theoretical status. Our aim in this article is to contribute to a theory of stakeholder identification and salience based on stakeholders possessing one or more of three relationship attributes: power, legitimacy, and urgency. By combining these attributes, we generate a typology of stakeholders, propositions concerning their salience to managers of the firm, and research and management implications.
Ranking on Data Manifold with Sink Points

Ranking is an important problem in various applications, such as Information Retrieval (IR), natural language processing, computational biology, and social sciences. Many ranking approaches have been proposed to rank objects according to their degrees of relevance or importance. Beyond these two goals, diversity has also been recognized as a crucial criterion in ranking. Top ranked results are expected to convey as little redundant information as possible, and cover as many aspects as possible. However, existing ranking approaches either take no account of diversity, or handle it separately with some heuristics. In this paper, we introduce a novel approach, Manifold Ranking with Sink Points (MRSPs), to address diversity as well as relevance and importance in ranking. Specifically, our approach uses a manifold ranking process over the data manifold, which can naturally find the most relevant and important data objects. Meanwhile, by turning ranked objects into sink points on data manifold, we can effectively prevent redundant objects from receiving a high rank. MRSP not only shows a nice convergence property, but also has an interesting and satisfying optimization explanation. We applied MRSP on two application tasks, update summarization and query recommendation, where diversity is of great concern in ranking. Experimental results on both tasks present a strong empirical performance of MRSP as compared to existing ranking approaches.