Miracle-dz/UniFAR-FTUs huggingface dataset:
Eliciting end users requirements of a supportive system for tacit knowledge management processes in value networks: A Delphi study

Co-creation value with the aim of enhancing customer experience—through providing integrated solutions— relies on networked collaborations of multiple service providers and customers within value network (VN) settings. The customer-centric view of such collaborations highlights the importance of understanding and addressing customer needs in which customer knowledge is essential. Accordingly, managing customer knowledge within VN facilitates providing integrated solutions, and in turn enhances customer experience. In this regard, in previous work we have developed a process-based framework on customer knowledge management within VN settings (VN-CKM). This framework covers processes in relation to both tacit and explicit customer knowledge. In general, there is extensive literature on IT-based systems in supporting knowledge management processes. However, there is a dearth of research on developing such systems to facilitate VN-CKM processes in the context of VN. In this regard, this study aims at eliciting end users requirements of systems needed to support VN-CKM processes. Regarding the predominant role of tacit knowledge in providing solutions, we focus on the tacit-related processes of our VN-CKM framework. Therefore, in this study these tacit-related processes are used as a basis in the requirement elicitation process. To do this, within a single VN, a two-round Delphi study is conducted to elicit the requirements from different actors of the VN. In total 144 requirements have been identified. Subsequently, by applying a structured classification approach they are classified into a set of 14 requirement types. Finally, a description for each requirement type is provided. This study, by following a well-structured research process from tacit-related VN-CKM processes to a coherent set of requirement types, provides a clear understanding on linking requirements to the original tacit-related VN-CKM processes. The resulting list of requirement types can be served as a baseline for defining and specifying the supportive system functionalities for tacit-related VN-CKM processes in the VN settings.
Evidence of cellular stress and caspase-3 resulting from a combined two-frequency signal in the cerebrum and cerebellum of Sprague-dawley rats

Multiple simultaneous exposures to electromagnetic signals induced adjustments in mammal nervous systems. In this study, we investigated the non-thermal SAR (Specific Absorption Rate) in the cerebral or cerebellar hemispheres of rats exposed in vivo to combined electromagnetic field (EMF) signals at 900 and 2450 MHz. Forty rats divided into four groups of 10 were individually exposed or not exposed to radiation in a GTEM chamber for one or two hours. After radiation, we used the Chemiluminescent Enzyme-Linked Immunosorbent Assay (ChELISA) technique to measure cellular stress levels, indicated by the presence of heat shock proteins (HSP) 90 and 70, as well as caspase-3-dependent pre-apoptotic activity in left and right cerebral and cerebellar hemispheres of Sprague Dawley rats. Twenty-four hours after exposure to combined or single radiation, significant differences were evident in HSP 90 and 70 but not in caspase 3 levels between the hemispheres of the cerebral cortex at high SAR levels. In the cerebellar hemispheres, groups exposed to a single radiofrequency (RF) and high SAR showed significant differences in HSP 90, 70 and caspase-3 levels compared to control animals. The absorbed energy and/or biological effects of combined signals were not additive, suggesting that multiple signals act on nervous tissue by a different mechanism.
Memory-Efficient and Accurate Sampling for Counting Local Triangles in Graph Streams

How can we estimate local triangle counts accurately in a graph stream without storing the whole graph? How to handle duplicated edges in local triangle counting for graph stream? Local triangle counting, which computes the number of triangles attached to each node in a graph, is a very important problem with wide applications in social network analysis, anomaly detection, web mining, and the like. In this article, we propose algorithms for local triangle counting in a graph stream based on edge sampling: Mascot for a simple graph, and MultiBMascot and MultiWMascot for a multigraph. To develop Mascot, we first present two naive local triangle counting algorithms in a graph stream, called Mascot-C and Mascot-A. Mascot-C is based on constant edge sampling, and Mascot-A improves its accuracy by utilizing more memory spaces. Mascot achieves both accuracy and memory-efficiency of the two algorithms by unconditional triangle counting for a new edge, regardless of whether it is sampled or not. Extending the idea to a multigraph, we develop two algorithms MultiBMascot and MultiWMascot. MultiBMascot enables local triangle counting on the corresponding simple graph of a streamed multigraph without explicit graph conversion; MultiWMascot considers repeated occurrences of an edge as its weight and counts each triangle as the product of its three edge weights. In contrast to the existing algorithm that requires prior knowledge on the target graph and appropriately set parameters, our proposed algorithms require only one parameter of edge sampling probability. Through extensive experiments, we show that for the same number of edges sampled, Mascot provides the best accuracy compared to the existing algorithm as well as Mascot-C and Mascot-A. We also demonstrate that MultiBMascot on a multigraph is comparable to Mascot-C on the counterpart simple graph, and MultiWMascot becomes more accurate for higher degree nodes. Thanks to Mascot, we also discover interesting anomalous patterns in real graphs, including core-peripheries in the web, a bimodal call pattern in a phone call history, and intensive collaboration in DBLP.
On Practical Construction of Quality Fault-Tolerant Virtual Backbone in Homogeneous Wireless Networks

Over years, many efforts are made for the problem of constructing quality fault-tolerant virtual backbones in wireless network. In case that a wireless network consists of physically equivalent nodes, e.g., with the same communication range, unit disk graph (UDG) is widely used to abstract the wireless network and the problem is formulated as the minimum <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-connected <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula>-dominating set problem on the UDG. So far, most results are focused on designing a constant factor approximation algorithm for this NP-hard problem under two positive integers <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> satisfying <inline-formula> <tex-math notation="LaTeX">$m \geq k \geq 1$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$k \leq 3$ </tex-math></inline-formula>. This paper introduces an approximation algorithm for the problem with <inline-formula> <tex-math notation="LaTeX">$m \geq k \geq 1$ </tex-math></inline-formula>. This algorithm is simple to implement; it connects the components by adding a bounded number of paths, which first computes a 1-connected <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula>-dominating set <inline-formula> <tex-math notation="LaTeX">$D$ </tex-math></inline-formula> and repeats the following steps: (a) search the separators arbitrarily in <inline-formula> <tex-math notation="LaTeX">$(i-1,m)$ </tex-math></inline-formula>-CDS with <inline-formula> <tex-math notation="LaTeX">$i = 2, 3, \cdots, k$ </tex-math></inline-formula>, (b) add a bounded number of paths connecting the components separated by separators in <inline-formula> <tex-math notation="LaTeX">$(i-1,m)$ </tex-math></inline-formula>-CDS to improve the connectivity of <inline-formula> <tex-math notation="LaTeX">$(i-1,m)$ </tex-math></inline-formula>-CDS, until it becomes <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-connected, and (c) remove redundant paths if there exist at every iteration. We provide a rigorous theoretical analysis to prove that the proposed algorithm is correct and its approximation ratio is a constant, for any fixed <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>.
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n^{5/4}) Rounds

We study computing all-pairs shortest paths (APSP) on distributed networks (the CONGEST model). The goal is for every node in the (weighted) network to know the distance from every other node using communication. The problem admits (1+o(1))-approximation &#xd5;(n)-time algorithms [2], [3], which are matched with \tilde &#x3a9;(n)-time lower bounds [4], [5],\footnote{\tilde \Theta, &#xd5; and \tilde &#x3a9; hide polylogarithmic factors. Note that the lower bounds also hold even in the unweighted case and in the weighted case with polynomial approximation ratios. }. No &#x3a9;(n) lower bound or o(m) upper bound were known for exact computation.In this paper, we present an &#xd5;(n^{5/4})-time randomized (Las Vegas) algorithm for exact weighted APSP; this provides the first improvement over the naive O(m)-time algorithm when the network is not so sparse. Our result also holds for the case where edge weights are asymmetric} (a.k.a. the directed case where communication is bidirectional). Our techniques also yield an &#xd5;(n^{3/4}k^{1/2}+n)-time algorithm for the k-source shortest paths} problem where we want every node to know distances from k sources; this improves Elkins recent bound [6] when k=\tilde &#x3a9;(n^{1/4}). We achieve the above results by developing distributed algorithms on top of the classic scaling technique, which we believe is used for the first time for distributed shortest paths computation. One new algorithm which might be of an independent interest is for the reversed r-sink shortest paths} problem, where we want every of r sinks to know its distances from all other nodes, given that every node already knows its distance to every sink. We show an &#xd5;(n&#x221a;{r})-time algorithm for this problem. Another new algorithm is called short range extension, where we show that in &#xd5;(n&#x221a;{h}) time the knowledge about distances can be extended for additional h hops. For this, we use weight rounding to introduce small additive} errors which can be later fixed.
Detailed Molecular Surveillance of the HIV-1 Outbreak Among People who Inject Drugs (PWID) in Athens During a Period of Four Years.

BACKGROUND New diagnoses of HIV-1 infection among people who inject drugs (PWID) increased significantly during 2011 in Athens. OBJECTIVE Our aim was to investigate the patterns of HIV epidemic spread among PWID and to estimate the transmission dynamics for the major local transmission networks (LTNs). METHODS We analyzed sequences from 2,274 HIV-infected subjects sampled in Greece during 01/01/2011-31/10/2014. Of specimens in our sample, 874 sequences were isolated from HIV-infected PWID. Phylodynamic analysis was performed using birth-death serial skyline models. RESULTS Phylogenetic analysis revealed that the majority of sequences from PWID (N=746, 85.4%) fell within four LTNs: CRF14_BG (N=456, 58.3%), CRF35_AD (N=149, 19.1%), subtype B (N=118, 15.1%) and A1 (N=59, 7.5%). In addition to PWID, we also found that sequences from 36 non-PWID belonged to the LTNs corresponding to cross-group transmissions. Based on the estimated plots of the effective reproductive number (Re) over time, subtype A1 and CRF35_AD LTNs showed a sharp increase before and during 2011 (maximum value of Re=3.0 and Re=4.6, respectively). For subtype B and CRF14_BG LTNs, the Re was increasing until the end of 2012 (maximum value of Re=3.2 and Re=3.0, respectively). CONCLUSION HIV transmissions within subtype A1 and CRF35_AD LTNs increased sharply during the early stage of the outbreak, in contrast to subtype B and CRF14_BG. A significant reduction in the number of infections was estimated on all transmission networks from the beginning of 2013 onwards. Prevention measures that took place in the Athens metropolitan area at the end of 2012 including also the ARISTOTLE program may explain this decrease.
Neutralization of the Effect of Hardware Trojan in SCADA System Using Selectively Placed TMR

Supervisory Control And Data Acquisition (SCADA) systems are the primary technology used to automate our critical infrastructure and major industries in order to improve their efficiency. Their dependability is challenged by probable vulnerabilities in the core computing system. These vulnerabilities can be appear on both front (software) and back (hardware) ends of the computing system. While the software vulnerabilities are well researched and documented, the hardware threats are normally overlooked. However, with hardware-inclusive technological evolutions like Cyber-Physical Systems and Internet-of-Things, hardware vulnerabilities should be addressed appropriately. Hardware Trojans are malicious alterations in the systems that leak confidential information or disable the entire system. In order to achieve a countermeasure, we propose to neutralize the effect of Hardware Trojans through a Triple Modular Redundancy (TMR) based methodology. In order to address the inevitable overhead on area, TMR will be implemented only on select paths of the system i.e., equally probable output paths which are found vulnerable to Trojan placement. In this work, we propose to neutralize the effect of hardware Trojan based vulnerabilities in SCADA systems, with the use of selectively placed TMR methodology.
Bisphenol-A exposure and gene expression in human luteinized membrana granulosa cells in vitro

STUDY QUESTION Does bisphenol-A (BPA) affect gene expression in human membrana granulosa cells (MGC)? SUMMARY ANSWER In vitro, short exposure to supra-physiological concentrations of BPA alters human MGC gene expression. WHAT IS KNOWN ALREADY Exposure to BPA may interfere with reproductive endocrine signaling. In vitro studies, mostly in animal models, have shown an inverse correlation between exposure to BPA and follicular growth, meiosis, and steroid hormone production in granulosa cells. STUDY DESIGN, SIZE, DURATION Primary cultures of MGC obtained from 24 patients undergoing IVF (for PGD, male factor infertility or unexplained infertility) were exposed to various concentrations of BPA (0, 0.02, 0.2, 2 or 20 µg/ml) for 48 h. PARTICIPANTS/MATERIALS, SETTING, METHODS The study was conducted in a university-affiliated hospital. Microarray analysis was used to identify genes exhibiting expression changes following BPA exposure. Genes significantly altered were identified based on changes greater than 2-fold relative to the control group (not treated by BPA) and a Student's t-test P-value <0.05. Statistical significance was adjusted for multiple comparisons using the Benjamini–Hochberg method. Alterations in the expression of genes that are involved in the enriched functional annotations altered by BPA at the concentration of 20 µg/ml were confirmed by real-time PCR. MAIN RESULTS AND THE ROLE OF CHANCE A distinct pattern of gene expression was observed in primary cultures of MGC exposed to the highest BPA concentration compared with untreated cells. We identified 652 genes that exhibited at least 2-fold differences in expression after BPA exposure (all P < 0.05 versus untreated). These genes were significantly enriched for annotations related to cell cycle progression, segregation of chromosomes, steroid metabolism, apoptosis, lipid synthesis, oocyte maturation and chromosomal alignment. No significant changes in gene expression were found at the lower doses of BPA most relevant to human exposure. LARGE SCALE DATA N/A. LIMITATIONS, REASONS FOR CAUTION Human exposure to BPA in vivo occurs over long periods of time. In this in vitro model, cells were exposed to the chemical for 48 h only. Thus, the effects of BPA on the human follicle might be underestimated. WIDER IMPLICATIONS OF THE FINDINGS As BPA exposure is ubiquitous, understanding the effects of the chemical on the ovary, specifically in women of reproductive age, has public health significance. The clinical evidence to date points to an association between BPA exposure and impaired IVF outcome, although not all studies have shown negative effects. Our study adds valuable mechanistic information showing that exposure to BPA alters granulosa cell gene expression at high and supra-physiological doses. STUDY FUNDING/COMPETING INTEREST(S) This study was supported by grant number 1936/12 from the ISF. The authors have nothing to disclose.
A Design Method for Internal Model Controllers for Multiple-Input/Multiple-Output Unstable Plant

In the present paper, we examine the parameterization of all stabilizing Internal Model Controllers(IMC) for multiple-input/multiple-output unstable plant. The parameterization problem is theproblem in which all stabilizing controllers for a plant are sought [1, 2, 3, 4, 5, 6, 7, 8, 9]. Since this parameterizationcan successfully search for all proper stabilizing controllers, it is used as a tool for manycontrol problems. However, there exists a problem whether or not stabilizing controllers for unstableplant can be represented by IMC structure. The IMC structure has advantages such as closed-loop stabilityis assured simply by choosing a stable IMC parameter. Additionally, closed-loop performancecharacteristics are related directly to controller parameters, which makes on-line tuning of the IMCvery convenient[6]. The solution to this problem, Morari and Zafiriou[6] examined the parameterizationof all stabilizing IMC for unstable plant. Their parameterization remains difficulties. Their internalmodel is not necessarily proper. In addition, their parameterization includes improper IMC. In order toovercome these problems, Chen et al. proposed a design method for IMC for minimum-phase unstableplant[17]. However, the method proposed by Chen et al. cannot apply for multiple-input/multipleoutputunstable plant. Because many of actual plants are multiple-input/multiple-output plants, consideringfor multiple-input/multiple-output unstable plant is important. In this paper, we propose theparameterization of all proper stabilizing IMC for multiple-input/multiple-output unstable plant suchthat the IMC and the internal model are proper. In addition, we present an application of the result forcontroller design for multiple-input/multiple-output time-delay plant.
Slow light enhanced nonlinear photonic functionalities

We discuss the enhancement of nonlinear functionalities in slow light photonic crystals. We show how slow light in photonic crystals is created, how nonlinear effects scale with the slowdown factor and what limits nonlinear effects in photonic crystals. We review some of the work recently reported in nonlinear optics in slow light photonic crystals and compare the observed effects to those found in other structures such as coupled resonators or photonic nanowires.
Observations of youth football training: How do coaches structure training sessions for player development?

ABSTRACT We used systematic observation tools to explore the structure (i.e., activity and inactivity) and sequencing (i.e., the types of activities used) of football coaching sessions in Australia following the implementation of a new National Curriculum. Youth soccer coaches (n = 34), coaching within the Skill Acquisition (U11–U13 n = 19) and Game Training (U14–U17 n = 15) phases of the Football Federation Australia National Curriculum participated. Participants were filmed during a regular coaching session, with systematic observation of the session undertaken to provide a detailed analysis of the practice activities and coach behaviours. Findings indicated a session comprised of Playing Form activities (40.9%), Training Form activities (22.3%), inactivity (31%), and transitions between activities (5.8%). Coaches prescribed more Training Form activities (e.g., individual (5.4%) and drills (15.1%)) early in the session and progressed to Playing Form activities (i.e., small-sided games (15.3%) then larger games (24.8%)) later in the session. Most inactivity reflected the players listening to the coach – either in a team huddle (9.9%) or frozen on the spot during an activity (16.5%). In addition, coaches generally spent over 3 min communicating to players prior to explaining and introducing an activity regardless of when in the session the activity was scheduled.
New privacy issues in mobile telephony: fix and verification

Mobile telephony equipment is daily carried by billions of subscribers everywhere they go. Avoiding linkability of subscribers by third parties, and protecting the privacy of those subscribers is one of the goals of mobile telecommunication protocols. We use formal methods to model and analyse the security properties of 3G protocols. We expose two novel threats to the user privacy in 3G telephony systems, which make it possible to trace and identify mobile telephony subscribers, and we demonstrate the feasibility of a low cost implementation of these attacks. We propose fixes to these privacy issues, which also take into account and solve other privacy attacks known from the literature. We successfully prove that our privacy-friendly fixes satisfy the desired unlinkability and anonymity properties using the automatic verification tool ProVerif.
On-line monitoring of multi-component strain development in a tufting needle using optical fibre Bragg grating sensors

Dynamic loadings induced on a tufting needle during the tufting of dry carbon fibre preform via a commercial robot-controlled tufting head were investigated in situ and in real-time using optical fibre Bragg grating (FBG) sensors bonded to the needle shaft. The sensors were configured such that the axial strain and bending moments experienced by the needle could be measured. A study of the influence of thread and thread type on the strain imparted to the needle revealed axial strain profiles which had equivalent trends but different magnitudes. The mean of the maximum axial compression strains measured during the tufting of a 4-ply quasi-isotropic carbon fibre dry preform were − 499 ± 79 με, − 463 ± 51 με and − 431 ± 59 με for a needle without thread, with metal wire and with Kevlar® thread, respectively. The needle similarly exhibited bending moments of different magnitude when the different needle feeding configurations were used.