Miracle-dz/UniFAR-FTUs huggingface dataset:
Indigenous media producers’ perspectives on objectivity, balancing community responsibilities and journalistic obligations

Professional communicators produce a diverse range of global Indigenous media while balancing professional journalistic conventions such as ‘objectivity’ against community and organizational responsibilities. Despite their work being tarred as biased, soft or preaching to the converted, Indigenous media producers argue that their work counterbalances biased mainstream media coverage that hampers Indigenous public sphere participation and denigrates Indigenous communities and individuals. Through interviews with 42 Indigenous media producers from Australia, Canada, Finland, Sweden and New Zealand, this study investigates their journalistic processes and attitudes to professional norms such as objectivity, source choices and news values. The article interrogates how Indigenous media producers navigate the tensions between their professional obligations and community responsibilities. It argues Indigenous media producers apply a modified version of objectivity to produce fact-driven content that promotes Indigenous perspectives, prioritizes Indigenous voices and serves the needs of their communities.
Triangle Sparsifiers

In this work, we introduce the notion of triangle sparsiﬁers , i.e., sparse graphs which are approximately the same to the original graph with respect to the triangle count. This results in a practical triangle counting method with strong theoretical guarantees. For instance, for unweighted graphs we show a randomized algorithm for approximately counting the number of triangles in a graph G , which proceeds as follows: keep each edge independently with probability p , enumerate the triangles in the spar-siﬁed graph G (cid:48) and return the number of triangles found in G (cid:48) multiplied by p − 3 . We prove that under mild assumptions on G and p our algorithm returns a good approximation for the number of triangles with high probability. Speciﬁcally, we show that if p ≥ max ( polylog( n )∆ t , polylog( n ) t 1 / 3 ), where n , t , ∆, and T denote the number of vertices in G , the number of triangles in G , the maximum number of triangles an edge of G is contained and our triangle count estimate respectively, then T is strongly concentrated around t :
Optimal Multilevel Extension Operators

In the present paper we suggest the norm-preserving explicit operator for the extension of finite-element functions from boundaries of domains into the inside. The construction of this operator is based on the multilevel decomposition of functions on the boundaries and on the equivalent norm for this decomposition. The cost of the action of this operator is proportional to the number of nodes. Preprint-Reihe der Chemnitzer DFG-Forschergruppe “Scientific Parallel Computing” SPC 95 3 January 1995 Let Ω be a bounded, polygonal domain and Γ be its boundary. Let us consider a coarse grid triangulation of Ω
Security for Authenticated Key Exchange Based on Non-Malleability

This paper continues the study of password-based protocols for authenticated key exchange (AKE). In 2000, Bellare, Pointcheval, and Rogaway proposed the formal model on AKE. In this paper, we propose new security notions on AKE, based on the non-malleability of session keys. Then we prove that those security notion are equivalent. Furthermore, we show that there is a protocol secure in the random oracle model, not always secure in the standard model with collision-resistant hash functions
Nice sets and invariant densities in complex dynamics

Abstract In complex dynamics, we construct a so-called nice set (one for which the first return map is Markov) around any point which is in the Julia set but not in the post-singular set, adapting a construction of Rivera–Letelier. This simplifies the study of absolutely continuous invariant measures. We prove a converse to a recent theorem of Kotus and Świątek, so for a certain class of meromorphic maps the absolutely continuous invariant measure is finite if and only if an integrability condition is satisfied.
The katA Catalase Gene Is Regulated by OxyR in both Free-Living and Symbiotic Sinorhizobium meliloti

ABSTRACT The characterization of an oxyR insertion mutant provides evidences that katA, which encodes the unique H2O2-inducible HPII catalase, is regulated by OxyR not only in free-living Sinorhizobium meliloti but also in symbiotic S. meliloti. Moreover, oxyR is expressed independently of exogenous H2O2 and downregulates its own expression in S. meliloti.
Characterization of the Reconstructed 1918 Spanish Influenza Pandemic Virus

The pandemic influenza virus of 1918–1919 killed an estimated 20 to 50 million people worldwide. With the recent availability of the complete 1918 influenza virus coding sequence, we used reverse genetics to generate an influenza virus bearing all eight gene segments of the pandemic virus to study the properties associated with its extraordinary virulence. In stark contrast to contemporary human influenza H1N1 viruses, the 1918 pandemic virus had the ability to replicate in the absence of trypsin, caused death in mice and embryonated chicken eggs, and displayed a high-growth phenotype in human bronchial epithelial cells. Moreover, the coordinated expression of the 1918 virus genes most certainly confers the unique high-virulence phenotype observed with this pandemic virus.
APPLICATIONS FOR SOCIAL SITUATION MODELS

We motivate why models of social networks on small time and space scales and especially social situations are valuable for new useful social networking services that are context aware and socially aware. A model for social situations and pragmatic approaches for instantiating such models with the help of mobile devices is introduced. Two example applications are discussed: Social Life-logging and a communication service with social situations as recipients. Social Life-logging aims at the recording and later retrieval of social situations, which represent valuable granularity elements that simplify retrieval and improve usefulness in comparison or in addition to known multimedia-based life-logging concepts. Social situations as recipients for communication acts support an interesting new mode of communication.
CONNECTIVITY MONITORING AND MAINTENANCE FOR WIRELESS SENSOR NETWORKS-A SURVEY

Wireless Sensor Networks (WSNs) has a wide variety of applications such as Healthcare, home security, biological detection, and battlefield surveillance. It has brought new challenges to the researcher of network protocols. One fundamental problem in wireless sensor networks is the connectivity issue, which reflects how best a network is connected or linked to each other by sensors and also needs to be ensured so that the sink sensor node receives all sensed data for further processing. It is very important to have full connectivity in a WSN, after it is deployed and also to maintain the same. But, these networks are restricted by the low usertonode ratio, energy constraint and bandwidth resources, and frequent failure due to problems of energy, vulnerability to attack and they also put on them lots of bottlenecks that make issues in wireless sensor networks very challenging. In this survey, we present our investigation of various connectivity problems for maintain and monitoring approaches used by various algorithms to achieve connectivity. Our survey attempts to presents an outlook of these problems as well as the solutions proposed in recent research literature.
Reduced Switching Connectivity for Large Scale Antenna Selection

In this paper, we explore reduced-connectivity radio frequency (RF) switching networks for reducing the analog hardware complexity and switching power losses in antenna selection (AS) systems. In particular, we analyze different hardware architectures for implementing the RF switching matrices required in AS designs with a reduced number of RF chains. We explicitly show that fully-flexible switching matrices, which facilitate the selection of any possible subset of antennas and attain the maximum theoretical sum rates of AS, present numerous drawbacks such as the introduction of significant insertion losses, particularly pronounced in massive multiple-input multiple-output (MIMO) systems. Since these disadvantages make fully-flexible switching suboptimal in the energy efficiency sense, we further consider partially-connected switching networks as an alternative switching architecture with reduced hardware complexity, which we characterize in this work. In this context, we also analyze the impact of reduced switching connectivity on the analog hardware and digital signal processing of AS schemes that rely on received signal power information. Overall, the analytical and simulation results shown in this paper demonstrate that partially-connected switching maximizes the energy efficiency of massive MIMO systems for a reduced number of RF chains, while fully-flexible switching offers sub-optimal energy efficiency benefits due to its significant switching power losses.
Management of information technology innovation: a heuristic contingency paradigm research perspective

This paper presents a contingency model which causally relates information technology acquisition and diffusion (IT/AD) to organization culture (heterogeneous versus homogeneous), organization learning (innovative versus adaptive), and knowledge sharing (networked versus hierarchical). The model integrates multiple and well-grounded theoretical streams of research. These three primary driving forces interact in a recursive dynamic, expressed in both rational driving forces and political driving forces. This paper focuses on the political driving forces, operationalizing them with five categories of measurement variables. A preliminary set of research propositions associated with the five categories of political driving forces are presented. Future research is suggested, addressing moderating variables, and information technology acquisition and diffusion patterns of S-curves.
Restart recovery for page-server database management systems

This paper presents a restart recovery protocol for page-server systems. The protocol is based on the ARIES recovery algorithm, and it deals with transaction aborts and system failure. In this protocol, client transaction aborts and rollbacks during normal processing are performed by the clients themselves in order to offload the server, while the server performs the restart recovery after a system failure.
Hidden conformations in protein structures

MOTIVATION Prediction of interactions between protein residues (contact map prediction) can facilitate various aspects of 3D structure modeling. However, the accuracy of ab initio contact prediction is still limited. As structural genomics initiatives move ahead, solved structures of homologous proteins can be used as multiple templates to improve contact prediction of the major conformation of an unsolved target protein. Furthermore, multiple templates may provide a wider view of the protein's conformational space. However, successful usage of multiple structural templates is not straightforward, due to their variable relevance to the target protein, and because of data redundancy issues. RESULTS We present here an algorithm that addresses these two limitations in the use of multiple structure templates. First, the algorithm unites contact maps extracted from templates sharing high sequence similarity with each other in a fashion that acknowledges the possibility of multiple conformations. Next, it weights the resulting united maps in inverse proportion to their evolutionary distance from the target protein. Testing this algorithm against CASP8 targets resulted in high precision contact maps. Remarkably, based solely on structural data of remote homologues, our algorithm identified residue-residue interactions that account for all the known conformations of calmodulin, a multifaceted protein. Therefore, employing multiple templates, which improves prediction of contact maps, can also be used to reveal novel conformations. As multiple templates will soon be available for most proteins, our scheme suggests an effective procedure for their optimal consideration. AVAILABILITY A Perl script implementing the WMC algorithm described in this article is freely available for academic use at http://tau.ac. il/~haimash/WMC.
The Cyclooxygenase-2 Inhibitor GW406381X [2-(4-Ethoxyphenyl)-3-[4-(methylsulfonyl)phenyl]-pyrazolo[1,5-b]pyridazine] Is Effective in Animal Models of Neuropathic Pain and Central Sensitization

The pathogenic form of the cyclooxygenase (COX) enzyme, COX-2, is also constitutively present in the spinal cord and has been implicated in chronic pain states in rat and man. A number of COX-2 inhibitors, including celecoxib and rofecoxib, are already used in man for the treatment of inflammatory pain. Preclinically, the dual-acting COX-2 inhibitor, GW406381X [2-(4-ethoxyphenyl)-3-[4-(methylsulfonyl)phenyl]-pyrazolo[1,5-b]pyridazine, where X denotes the free base], is as effective as rofecoxib and celecoxib in the rat established Freund's Complete Adjuvant model with an ED50 of 1.5 mg/kg p.o. compared with 1.0 mg/kg p.o. for rofecoxib and 6.6 mg/kg p.o. for celecoxib. However, in contrast to celecoxib (5 mg/kg p.o. b.i.d.) and rofecoxib (5 mg/kg p.o. b.i.d.), which were without significant effect, GW406381X (5 mg/kg p.o. b.i.d.) fully reversed mechanical allodynia in the chronic constriction injury model and reversed thermal hyperalgesia in the mouse partial ligation model, both models of neuropathic pain. GW406381X, was also effective in a rat model of capsaicin-induced central sensitization, when given intrathecally (ED50 = 0.07 μg) and after chronic but not acute oral dosing. Celecoxib and rofecoxib had no effect in this model. Several hypotheses have been proposed to try to explain these differences in efficacy, including central nervous system penetration, enzyme kinetics, and potency. The novel finding of effectiveness of GW406381X in these models of neuropathic pain/central sensitization, in addition to activity in inflammatory pain models and together with its central efficacy, suggests dual activity of GW406381X compared with celecoxib and rofecoxib, which may translate into greater efficacy in a broader spectrum of pain states in the clinic.
Continuous and Discrete Wavelet Transforms

This paper is an expository survey of results on integral representations and discrete sum expansions of functions in $L^2 ({\bf R})$ in terms of coherent states. Two types of coherent states are considered: Weyl–Heisenberg coherent states, which arise from translations and modulations of a single function, and affine coherent states, called ’wavelets,’ which arise as translations and dilations of a single function. In each case it is shown how to represent any function in $L^2 ({\bf R})$ as a sum or integral of these states. Most of the paper is a survey of literature, most notably the work of I. Daubechies, A. Grossmann, and J. Morlet. A few results of the authors are included.
Oscillatory Dynamic Link Matching for Pattern Recognition

The ”dynamic link matching” (DLM) has been first proposed by Konen et al. [1] to solve the visual correspondence problem. The approach consists of two layers of neurons connected to each other through synaptic connections constrained to some normalization. The reference pattern is applied to one of the layers and the pattern to be recognized to the other. The dynamics of the neurons are chosen in such a way that ”blobs” are formed randomly in the layers. If the features of two blobs, each belonging to a different layer, are sufficiently similar, then weight strengthening between the blobs and activity similarity will be observed between sets of similar blobs. The size of the blobs remains fixed during all the simulation. In the original DLM network, the behavior is based on rate coding (averaged neuron activity over time is encoded). Here, we propose the Oscillatory Dynamic Link Matching algorithm (ODLM) that uses models of conventional spiking neurons and for which the coding is based on phase (place coding). We observe that the network is capable of performing motion analysis without optical flow computation and no additional signal processing should be made between layers unlike in [2] (translation, rotation, etc. between the patterns in the first and second layers can be seen as motion). More generally, our proposed network can solve the correspondence problem, and at the same time, performs the segmentation of the scene, which is in accordance with the Gestalt theory of perception.
Topical Atropine in the Control of Myopia

Atropine has been used for more than a century to arrest myopia progression. Compelling evidence of its protective effect has been reported in well-designed clinical studies, mainly performed during the last two decades. However, its exact mechanism of action has not been determined. Experimental findings have shown that the mechanism is not related to accommodation, as was thought for decades. A review of the published literature revealed a significant amount of evidence supporting its safety and efficacy at a concentration of 1.0%, and at lower concentrations (as low as 0.01%).
Why rebuttals may not work: the psychology of misinformation*

ULLRICH K. H. ECKER is assonist ProI ssor st th snhool oI Psynhologinsl sni ian , Uiaiv rsity oI W st ria amstrslis. eosil: mllrinh. nk r@mws. dm.sm This srtinl is sia dit d v rsioia oI his pr s iatstioia st th asis Jomriasliso Formo, siiagspor , 18 amgmst 2017. My research looks at ways in which misinformation influences people’s memory, their reasoning, and their decision-making, even after they receive credible corrections. People can be influenced by misinformation even when they understand the correction, they believe the correction, and they later on remember the correction. Even in those circumstances, their reasoning and decision-making will, on average, be measurably affected by the corrected misinformation (e.g. Ecker, Lewandowsky, & Tang, 2010). So for example, if you hear that vaccines cause autism, and then you learn that it is not true, we can still measure the impact of that misinformation on your decision-making. That is a scary and sobering thought, I think. Where does misinformation come from? Obviously, the media can contribute to this. The media landscape has changed a fair bit and there is arguably now less fact checking, and an obsession in some segments of the media with balanced coverage of issues even in the absence of balanced evidence (e.g. Dixon & Clarke, 2013). A second obvious source is social media, where there is no fact checking and people use the potential of information to elicit an emotional response in the recipient regardless of the information’s veracity (e.g. Berger, 2011). Then of course there are the echo chambers and filter bubbles of the internet, where if you “like” some misinformation online you will just get more and more and more of it (e.g. Jasny, Waggle, & Fisher, 2015; Pariser, 2011). And of course, we would be very naïve to assume that misinformation is not also disseminated on purpose. This is captured by buzzwords such as “cognitive warfare,” which basically means the identification of the people you want to persuade, or the people most susceptible to a particular piece of misinformation, and then the targeted dissemination of propaganda and disinformation to those people (Persily, 2017). Arguably this can be quite important, for example in an election process. And apart from propaganda, there is forgery, tweetbots, trolls, and so on. But going back to psychology, why do people believe in misinformation? Well, first of all, we need to consider that people want to understand what is going on in the world. They want to understand causalities, in particular, if there are unusual negative events. For example, if your child SPECIAL SECTION The disinformation dilemma
Reverse Engineering: Why and How to Reverse Engineer Software

Today especially large organizations are not only faced with the problem of replacing their information systems with completely new ones, but they have to maintain and to gain control over their legacy applications. Reverse engineering provides the means for this purpose supporting in recapturing lost information, restructuring complex systems or transforming old systems to a new and more maintainable architecture. This paper introduces the basic concepts of reverse engineering, clarifies related terms and indicates important reverse engineering approaches. Furthermore, a particular reverse engineering methodology for re-architecturing legacy applications is introduced and its impact on software engineering is discussed.
A Review of Machine Learning Algorithms for Text-Documents Classification

With the increasing availability of electronic documents and the rapid growth of the World Wide Web, the task of automatic categorization of documents became the key method for organizing the information and know- ledge discovery. Proper classification of e-documents, online news, blogs, e-mails and digital libraries need text mining, machine learning and natural language processing tech- niques to get meaningful knowledge. The aim of this paper is to highlight the important techniques and methodologies that are employed in text documents classification, while at the same time making awareness of some of the interesting challenges that remain to be solved, focused mainly on text representation and machine learning techniques. This paper provides a review of the theory and methods of document classification and text mining, focusing on the existing litera- ture.
Linguistic Annotation for the Semantic Web

Establishing the semantic web on a large scale implies the widespread annotation of web documents with ontology-based knowledge markup. For this purpose, tools have been developed that allow for semi-automatic annotation of web documents with ontology-based metadata. However, given that a large number of web documents consist either fully or at least partially of free text, language technology tools will be needed to support this authoring process by providing an automatic analysis of the semantic structure of textual documents. In this way, free text documents will become available as semi-structured documents, from which meaningful units can be extracted automatically ( information extraction ) and organized through clustering or classiﬁcation ( text mining ). Obviously, this is of importance for both knowledge markup and ontology development, i.e. the dynamic adaptation of ontologies to evolving applications and domains. In this paper we present the following linguistic analysis steps that underlie both of these: morphological analysis, part-of-speech tagging, chunking, dependency structure analysis, semantic tagging . Examples for each are given in the context of two projects that use linguistic and semantic annotation for the purpose of cross-lingual information retrieval and content-based multimedia access.
Green Attraction—Transnational Municipal Climate Networks and Green City Branding

In this article, we investigate the nexus of green city branding and municipal climate networks. In recent decades, a number of formal transnational municipal climate networks have emerged and their membership continues to increase. In parallel, city branding that is based on green policies, has gained importance. Based on quantitative and qualitative data, we assess how and to what extent German cities use their membership in transnational municipal climate networks to communicate green city brands. In contrast to our expectations, we encountered very few indications of green city branding efforts by German cities. Our analysis shows that in general, branding considerations only play a negligible role in the involvement of cities in transnational municipal climate networks or climate policies. Instead, it seems that German cities use their membership in climate networks, to genuinely improve local climate change strategies. We therefore suggest that research on green city branding should be more sensitive to the particular context of cities and efforts should be made to unveil the underlying motives for the communication of green policies.