Miracle-dz/UniFAR-FTUs huggingface dataset:
Cyclooxygenase in biology and disease

Cyclooxygenase (COX), the key enzyme required for the conversion of arachidonic acid to prostaglandins was first identified over 20 years ago. Drugs, like aspirin, that inhibit cyclooxygenase activity have been available to the public for about 100 years. In the past decade, however, more progress has been made in understanding the role of cyclooxygenase enzymes in biology and disease than at any other time in history. Two cyclooxygenase isoforms have been identified and are referred to as COX‐1 and COX‐2. Under many circumstances the COX‐1 enzyme is produced constitutively (i.e., gastric mucosa) whereas COX‐2 is inducible (i.e., sites of inflammation). Here, we summarize the current understanding of the role of cyclooxygenase‐1 and ‐2 in different physiological situations and disease processes ranging from inflammation to cancer. We have attempted to include all of the most relevant material in the field, but due to the rapid progress in this area of research we apologize that certain recent findings may have been left out. —DuBois, R. N. , Abramson, S. B. , Crofford, L. , Gupta, R. A. , Simon, L. S. , van de Putte, L. B. A. , Lipsky, P. E. Cyclooxygenase in biology and disease. FASEB J. 12, 1063–1073 (1998)
View planning for 3D shape reconstruction of buildings with unmanned aerial vehicles

This paper presents a novel view planning method to generate suitable viewpoints for the reconstruction of the 3D shape of buildings, based on publicly available 2D map data. The proposed method first makes use of 2D map data, along with estimated height information, to generate a rough 3D model of the target building. Randomized sampling procedures are then employed to generate a set of initial candidate viewpoints for the reconstruction process. The most suitable viewpoints are selected from the candidate viewpoint set by first formulating a modified Set Covering Problem (SCP) which considers image registration constraints, as well as uncertainties present in the rough 3D model. A neighborhood greedy search algorithm is proposed to solve this SCP problem and select a series of individual viewpoints deemed most suitable for the 3D reconstruction task. The paper concludes with both computational and real-world field tests to demonstrate the overall effectiveness of the proposed method.
A METHOD FOR NONRESPONSE CORRECTION IN THE ANALYSIS OF MAIL SURVEY DATA

Even when researchers using mail surveys go to great lengths to maximize response rates, there will always be some portion of the intended sample that does not respond, either at all, or sufficiently -completely to allow inclusion in the estimating sample. This paper examines nonresponse and its apparent consequences for a survey of water-based recreational participation conducted in the Northwest US. We describe how zip codes can be used in combination with special software to determine distances from each address in our intended sample of 7034 households to each of the recreational sites featured in our survey. Zip codes also allow us to merge our intended sample with 1990 Census data aggregated to the zip code level. We demonstrate how to model the survey response/nonresponse decision explicitly, and show that statistical corrections for nonresponse can have a potentially important effect on the apparent inferences from our models. We strongly advocate, based on these.results, that any researcher using a mail survey can and should explore analogous response/nonresponse models and corrections before making any claims as to the robustness of empirical results to non-random sample selection. * This data set employed in this paper was collected as part of a study managed by Hagler Bailly Consulting, Inc., under contract with the U.S. Army Corps of Engineers (contract # TCN 93357).
A FRAMEWORK OF INTEGRATED INTELLIGENT JUDICIAL INFORMATION SYSTEM

The effective public security depends on the efficiency of the judicial process and procedure. Approaching to the supply chain management domain, the judicial procedures can be viewed as the complete stream sections. The legal agencies have also to deal with the information flow which need for integrating, interchanging and inter-cooperation among them. Anyway, the study in the intelligent system in the field of information technology, including data mining, is also consecutively studied and applied to various aspects in the legal domain. The study in this paper applied some of the existing technology and also suggests the possible application in intelligent judicial system. We then proposed a framework of the extension and integration for the intelligent judicial information system in Thailand. The designing methodology of this supply chain-core framework is based on the consistent cooperating of the information flow, the traditional and intelligent legal agencies. Field of Research: judicial system, intelligent system, data mining, supply chain management. ----------------------------------------------------------------------------------------------------------------------------------------
d = 4 Black Hole Attractors in N = 2 Supergravity with Fayet-Iliopoulos Terms

We generalize the description of the d = 4 Attractor Mechanism based on an eective black hole (BH) potential to the presence of a gauging which does not modify the derivatives of the scalars and does not involve hypermultiplets. The obtained results do not rely necessarily on supersymmetry, and they can be extended to d > 4, as well. Thence, we work out the example of the stu model of N = 2 supergravity in the presence of Fayet-Iliopoulos terms, for the supergravity analogues of the magnetic and D0 D6 BH charge congurations,
Local government in Bangladesh

The AA. analyse the Union council elections in 1997 in Bangladesh. The greater part of the paper is based on an in-depth study of one village (Boringram) where they trace the power structure in a historical context. The second set of data is based on a survey of selected unions in the northern part of the country where some NGOs have been active in mobilizing the rural poor. Using Mouzelis' framework of the mode of domination, they characterize it as the incorporative-clientilistic mode. The analysis reveals that in both sets of data the traditional power structure is breaking down. Boringram has undergone an economic development process which means that the rural poor no longer feel compelled to follow the traditional leaders. However, when it comes to candidates for the local government bodies, they continue to select representatives from the traditional land-owning classes. The NGO survey shows that some of the groups of poor they have mobilized had been able to get their members elected to the local government bodies. The AA. argue that this has lead to a partial break-down of the traditional power structure, but that the NGOs have become the new patrons of the poor giving rise to a different relationship of dependence.
Efficiently looking up non-aggregatable name prefixes by reducing prefix seeking

Content-Centric Networking (CCN) employs a hierarchical but location independent content naming scheme. While such a location independent naming brings various benefits including efficient content delivery, mobility, and multihoming, location independent name prefixes are hard to aggregate. This poses a serious scaling issue on the efficiency of looking up con-tent names in a huge Forwarding Information Base (FIB) by longest prefix matching, which requires seeking the longest matching prefix through all candidate prefix lengths. We propose a new scheme for efficiently looking up nonaggregatable name prefixes in a large FIB. The proposed scheme is based on the observation that the bottleneck of FIB lookup is the random accesses to the high-latency off-chip DRAM for prefix seeking and this can be reduced by exploiting the information on the longest matching prefix length in the previous hop.
On the Generalized Degrees of Freedom of the Gaussian Interference Relay Channel

The symmetric two-user Gaussian interference relay channel (IRC) is studied from a generalized degrees of freedom (GDoF) perspective. While it is known that the relay does not in crease the DoF of the IRC, such a characterization has not been reported for the GDoF yet. The focus of this paper is on all cases where the interference link is stronger than the link from the source to the relay. This regime basically covers half the space of all possible parameters of the IRC. By using genie-aided approaches, new sum-capacity upper bounds are derived. These bounds are then compared with rates achieved with a novel transmission scheme, which is based on a functional decode-and-forward (FDF) strategy. It is shown that the GDoF of the IRC is achieved by FDF in the given regime, and that a relay can indeed increase the GDoF of IRC. Finally, the FDF scheme is compared with other schemes like decode-and-forward as well as compress-and-forward at low, moderate, and high signal-to-noise ratios.
Distributed anomaly detection by model sharing

We present a novel general framework for distributed anomaly detection. In the framework, normal behavior is first learned from data from individual data sites using standard anomaly detection algorithms and then these models are combined when predicting anomalies from a new data set. We have investigated seven semi-supervised anomaly detection algorithms for learning normal behavior, as well as proposed method for combining anomaly detection models. Experiments have shown that our proposed combining technique may achieve comparable or even slightly better prediction performance than the anomaly detection models built on the data sets merged from distributed sites.
La digitalización de la conversación pública: redes sociales, afectividad política y democracia

This article deals with the impact of new communications technologies on democracy. It does so by analysing the processes by which public opinion is being partly digitalized - on account of the decisive importance that the quality of public opinion possesses for the quality of democracy. The focus is on the effects of citizens’ usage of social media and other digital platforms. Citizens themselves are mainly considered as affective subjects influenced by their own emotions and preconscious sensations. Social networks turn out to be intrinsically affective technologies, whose strong influence on political socialization and mobilization forces us to reconsider current understandings of actually existing liberal democracies.
Occlusion-Free Animation of Driving Routes for Car Navigation Systems

This paper presents a method for occlusion-free animation of geographical landmarks, and its application to a new type of car navigation system in which driving routes of interest are always visible. This is achieved by animating a nonperspective image where geographical landmarks such as mountain tops and roads are rendered as if they are seen from different viewpoints. The technical contribution of this paper lies in formulating the nonperspective terrain navigation as an inverse problem of continuously deforming a 3D terrain surface from the 2D screen arrangement of its associated geographical landmarks. The present approach provides a perceptually reasonable compromise between the navigation clarity and visual realism where the corresponding nonperspective view is fully augmented by assigning appropriate textures and shading effects to the terrain surface according to its geometry. An eye tracking experiment is conducted to prove that the present approach actually exhibits visually-pleasing navigation frames while users can clearly recognize the shape of the driving route without occlusion, together with the spatial configuration of geographical landmarks in its neighborhood
Fractal-Based Description of Natural Scenes

This paper addresses the problems of 1) representing natural shapes such as mountains, trees, and clouds, and 2) computing their description from image data. To solve these problems, we must be able to relate natural surfaces to their images; this requires a good model of natural surface shapes. Fractal functions are a good choice for modeling 3-D natural surfaces because 1) many physical processes produce a fractal surface shape, 2) fractals are widely used as a graphics tool for generating natural-looking shapes, and 3) a survey of natural imagery has shown that the 3-D fractal surface model, transformed by the image formation process, furnishes an accurate description of both textured and shaded image regions. The 3-D fractal model provides a characterization of 3-D surfaces and their images for which the appropriateness of the model is verifiable. Furthermore, this characterization is stable over transformations of scale and linear transforms of intensity. The 3-D fractal model has been successfully applied to the problems of 1) texture segmentation and classification, 2) estimation of 3-D shape information, and 3) distinguishing between perceptually ``smooth'' and perceptually ``textured'' surfaces in the scene.
Power, corruption and lies: Mis-selling and the production of culture in financial services

The extent of recent misconduct in retail financial services questions assumptions that mis-selling is perpetrated by rogue traders dealing in sub-prime markets. Yet we know little about the organizational dimensions of mis-selling and specifically how new employees are introduced to and subsequently enact mis-selling behaviour when not explicitly encouraged to do so. This article seeks to understand the mechanics of mis-selling through an ethnographic account of the opening of a new retail financial services call centre, and analysis of the ritual nature of the sales interaction. The study documents the training, induction and initial work of direct sales agents to better understand the complexity, social relations and organization of mis-selling, together with the way in which regulation and management regimes shape sales practice and consequent employee behaviour. The critical analysis of sales rituals allows us to explain how mis-selling becomes embedded in organizational practice and contributes to our understanding of the everydayness of mis-selling in contrast to approaches that focus either on individual decision-making or on cultural explanations.
Linear Stratified Self – Calibration and EuclideanReconstruction

Wepresent alinear algorithmfor self–calibrationwhich,liketheSturm/Triggsmethodfor projective reconstruction, is exact in thelimit of smallcameramotions or sidewaysmotionswith rotationsaround the optical axis. Unlike previous algorithms,our approachrecovers the available partial information about the internal parametersfor “cri tical” motion sequences, wherefull recovery of the calibration is impossible. Also, we present a linear algorithm for estimati ng the cameramotion and 3D structure given a projective reconstruction andknown calibration,andwe extend our linear approachesto more accurate,iterative algorithms. All our algorithmsfollow thestratified approachin which theEuclidean motion, 3D structure,andcalibration arecomputed from a projective reconstruction.
MiCAP: a custom reconfiguration controller for dynamic circuit specialization

Field Programmable Gate Arrays (FPGAs) belong to a class of semiconductor devices whose hardware can be changed according to our needs. The configuration data (bitstreams) of an FPGA define the functionality of the FPGA. Therefore, a user can design the hardware and change it by modifying the bitstreams for a given set of requirements. One way of doing this is using Dynamic Circuit Specialization (DCS), an FPGA implementation technique that is optimized for a parameterized design. A design is said to be parameterized if some of its inputs are infrequently changing compared to the rest. In the DCS technique, for every change in parameterized input values, a new specialized circuit is generated during run-time and the FPGA is reconfigured accordingly. The time taken to reconfigure the FPGA with a specialized circuit is called reconfiguration time and is a major overhead of the DCS technique. To reduce this overhead, we propose an efficient custom reconfiguration controller built with a simple architecture which is customized to implement DCS. Our results indicate an increase in the reconfiguration speed by ≈ 17% and the FPGA resource utilization is reduced by ≈ 50% compared to the standard Xilinx reconfiguration controller.
Allocentric versus Egocentric Representation of Remembered Reach Targets in Human Cortex

The location of a remembered reach target can be encoded in egocentric and/or allocentric reference frames. Cortical mechanisms for egocentric reach are relatively well described, but the corresponding allocentric representations are essentially unknown. Here, we used an event-related fMRI design to distinguish human brain areas involved in these two types of representation. Our paradigm consisted of three tasks with identical stimulus display but different instructions: egocentric reach (remember absolute target location), allocentric reach (remember target location relative to a visual landmark), and a nonspatial control, color report (report color of target). During the delay phase (when only target location was specified), the egocentric and allocentric tasks elicited widely overlapping regions of cortical activity (relative to the control), but with higher activation in parietofrontal cortex for egocentric task and higher activation in early visual cortex for allocentric tasks. In addition, egocentric directional selectivity (target relative to gaze) was observed in the superior occipital gyrus and the inferior occipital gyrus, whereas allocentric directional selectivity (target relative to a visual landmark) was observed in the inferior temporal gyrus and inferior occipital gyrus. During the response phase (after movement direction had been specified either by reappearance of the visual landmark or a pro-/anti-reach instruction), the parietofrontal network resumed egocentric directional selectivity, showing higher activation for contralateral than ipsilateral reaches. These results show that allocentric and egocentric reach mechanisms use partially overlapping but different cortical substrates and that directional specification is different for target memory versus reach response.
Optimization : Competing with Dynamic Comparators

Recent literature on online learning has focused on develop ing adaptive algorithms that take advantage of a regularity of the sequence of observations, yet retain worst-case perf ormance guarantees. A complementary direction is to develop prediction methods that perform well against c omplex benchmarks. In this paper, we address these two directions together. We present a fully adaptive method tha t competes with dynamic benchmarks in which regret guarantee scales with regularity of the sequence of cost fun c ions and comparators. Notably, the regret bound adapts to the smaller complexity measure in the problem environmen t. Finally, we apply our results to drifting zero-sum, two-player games where both players achieve no regret guara ntees against best sequences of actions in hindsight. I. I NTRODUCTION The focus of this paper is an online optimization problem in w hich a learner plays against anadversaryor nature. At each roundt ∈ {1, . , T }, the learner chooses an action xt from some convex feasible set X ⊆ R. Then, nature reveals a convex function ft ∈ F to the learner. As a result, the learner incurs the correspon ding loss ft(xt). A learner aims to minimize his regret, a comparison to a single best action in hindsight: RegT , T ∑ t=1 ft(xt)−min x∈X T ∑ t=1 ft(x). (1) Let us refer to this as tatic regret in the sense that the comparator is time-invariant . In the literature, there are numerous algorithms that guarantee a static regret rate of O( √ T ) (see e.g. [1]–[3]). Moreover, when the loss functions are strongly convex, a rate of O(log T ) could be achieved [4]. Furthermore, minimax optimality of algorithms with respect to the worst-case adversary has bee n established (see e.g. [5]). There are two major directions in which the above-mentioned results can be strengthened: (1) by exhibiting algorithms that compete with non-static comparator sequen ces (that is, making the benchmark harder), and (2) [1] Ali Jadbabaie and Shahin Shahrampour are with the Departmen t of Electrical and Systems Engineering at the University of Pennsylvania, Philadelphia, PA 19104 USA. (e-mail: shahin@seas.upenn.e du; jadbabai@seas.upenn.edu). [2] Alexander Rakhlin is with the Department of Statistics at th e University of Pennsylvania, Philadelphia, PA 19104 USA. ( e-mail: rakhlin@wharton.upenn.edu). [3] Karthik Sridharan is with the Department of Computer Scienc e at Cornell University, Ithaca, NY 14850 USA. (e-mail: srid haran@cs.cornell.edu). January 27, 2015 DRAFT 2 by proving regret guarantees that take advantage of nicenessof nature’s sequence (that is, exploiting some nonadversarial quality of nature’s moves). Both of these disti nct directions are important avenues of investigation. In the present paper, we attempt to address these two aspects by developing a single, adaptive algorithm with a regret bound that shows the interplay between the difficulty of the c omparison sequence and niceness of the sequence of nature’s moves. With respect to the first aspect, a more stringent benchmark i s a time-varyingcomparator, a notion that can be termeddynamicregret [3], [6]–[8]: RegT , T ∑
The Pricing Scheme of the Grid Resource Based on Cournot Equilibrium

As the complexity of grid environment, grid contains a variety of resources. We introduce the economic model in order to respond the changes of resource supply and demand. In this paper, we based on the original economic model and subdivision the role of resource providers, then we formulate an initial pricing strategy of underlying resources which based on Cournot equilibrium theory to achieve maximum benefits of resource participants. After the initial pricing strategy has been formulated, the initial price and basic information of the resources has been recorded in GIS of grid bank.
Structure of the hot object in the symbiotic prototype Z Andromedae during its 2000-03 active phase

Aims. To investigate structure of the hot object in the symbiotic prototype Z And during its major 2000-03 active phase. Methods. Analysis of the far ultraviolet, optical low- and high-resolution spectroscopy and ${\it UBVR}$ photometry. Reconstruction of the spectral energy distribution (SED) during the outburst. The Raman scattering process. Results. At the initial stages of the outburst the hot object was characterized by the two-temperature spectrum (a warm stellar radiation and a strong nebular emission) with signatures of a mass-outflow at moderate (~100-200 km s -1 ) and very high ( ≈ 1000-2000 km s -1 ) velocities. The corresponding structure of the hot object consists of an optically thick, slowly-expanding disk-like material encompassing the accretor at the orbital plane and a fast optically thin wind over the remainder of the star. The disk-like shell persisted around the central star until 2002 August as was indicated by the eclipse effect. Then, a significant dilution of the optically thick material and evolution of a fast wind from the hot star, concentrated more at the orbital plane, were detected. A striking similarity of [$\ion{Fe}{vii}$] λ 6087 and Raman λ 6825 profiles at/after the dilution of the disk suggests their origin within the interaction zone where the winds from the binary components collide.