Miracle-dz/UniFAR-FTUs huggingface dataset:
Thymoquinone attenuates diethylnitrosamine induction of hepatic carcinogenesis through antioxidant signaling

Hepatocellular carcinoma accounts for about 80–90% of all liver cancer and is the fourth most common cause of cancer mortality. Although there are many strategies for the treatment of liver cancer, chemoprevention seems to be the best strategy for lowering the incidence of this disease. Therefore, this study has been initiated to investigate whether thymoquinone (TQ), Nigella sativa derived-compound with strong antioxidant properties, supplementation could prevent initiation of hepatocarcinogenesis-induced by diethylnitrosamine (DENA), a potent initiator and hepatocarcinogen, in rats. Male Wistar albino rats were divided into four groups. Rats of Group 1 received a single intraperitoneal (I.P.) injection of normal saline. Animals in Group 2 were given TQ (4 mg/kg/day) in drinking water for 7 consecutive days. Rats of Group 3 were injected with a single dose of DENA (200 mg/kg, I.P.). Animals in Group 4 were received TQ and DENA. DENA significantly increased alanine transaminase (ALT), alkaline phosphatase (ALP), total bilirubin, thiobarbituric acid reactive substances (TBARS) and total nitrate/nitrite (NOx) and decreased reduced glutathione (GSH), glutathione peroxidase (GSHPx), glutathione-s-transferase (GST) and catalase (CAT) activity in liver tissues. Moreover, DENA decreased gene expression of GSHPx, GST and CAT and caused severe histopathological lesions in liver tissue. Interestingly, TQ supplementation completely reversed the biochemical and histopathological changes induced by DENA to the control values. In conclusion, data from this study suggest that: (1) decreased mRNA expression of GSHPx, CAT and GST during DENA-induced initiation of hepatic carcinogenesis, (2) TQ supplementation prevents the development of DENA-induced initiation of liver cancer by decreasing oxidative stress and preserving both the activity and mRNA expression of antioxidant enzymes.
A Complete Survey on application of Frequent Pattern Mining and Association Rule Mining on Crime Pattern Mining

Frequent pattern (itemset) mining plays an important role in association rule mining. The Apriori & FP-growth algorithms are the most famous algorithms which can be used for Frequent Pattern mining. This paper presents the survey of various Frequent Pattern Mining and Rule Mining algorithm which can be applied to crime pattern mining. The analysis of literature survey would give the information about what has been done previously in the same area, what is the current trend and what are the other related areas. This paper explains the concepts of Frequent Pattern Mining and three important approaches that is candidate generation approach, without candidate generation and vertical layout approach. It also explains various frequent pattern algorithms and how it can be applied to different areas particularly in crime pattern detection. This paper surely helps the researches to get clear idea about the application of frequent pattern mining algorithm in various areas.
Quantum cryptography based key distribution in WiFi networks

Wireless technology is rapidly evolving, and is playing an important role in the lives of people throughout the world. Due to the nature of wireless communications, it is possible for an adversary to snoop on confidential communications or modify them to gain access to the wireless networks more easily than with wired networks. Out of many wireless networks, WiFi, known as IEEE 802.11, has attracted millions of users worldwide. Our previous research work has demonstrated a quantum cryptography based approach to distribute the secrete key in 802.11 networks. In the current paper, we attempt to focus on the simulations and the analysis of our implementation of the experimental results about the key distribution solutions to confirm our previous research results.
A CONNECTION BETWEEN APPARENT VLBA JET SPEEDS AND INITIAL ACTIVE GALACTIC NUCLEUS DETECTIONS MADE BY THE FERMI GAMMA-RAY OBSERVATORY

In its first three months of operations, the Fermi Gamma-Ray Observatory has detected approximately one quarter of the radio-flux-limited MOJAVE sample of bright flat-spectrum active galactic nuclei (AGNs) at energies above 100 MeV. We have investigated the apparent parsec-scale jet speeds of 26 MOJAVE AGNs measured by the Very Long Baseline Array (VLBA) that are in the LAT bright AGN sample (LBAS). We find that the γ-ray bright quasars have faster jets on average than the non-LBAS quasars, with a median of 15c, and values ranging up to 34c. The LBAS AGNs in which the LAT has detected significant γ-ray flux variability generally have faster jets than the nonvariable ones. These findings are in overall agreement with earlier results based on nonuniform EGRET data which suggested that γ-ray bright AGNs have preferentially higher Doppler boosting factors than other blazar jets. However, the relatively low LAT detection rates for the full MOJAVE sample (24%) and previously known MOJAVE EGRET-detected blazars (43%) imply that Doppler boosting is not the sole factor that determines whether a particular AGN is bright at γ-ray energies. The slower apparent jet speeds of LBAS BL Lac objects and their higher overall LAT detection rate as compared to quasars suggest that the former are being detected by Fermi because of their higher intrinsic (unbeamed) γ-ray to radio luminosity ratios.
Encoding Global Unobservability for Efficient Translation to SAT

The paper studies the use of global unobservability constraints in a CNF translation of Boolean formulas, where the unobservability of logic blocks is encoded with CNF unobservability variables and the logic output values of the blocks with CNF logic variables. Each block’s unob-servability variable is restricted by local unobservability constraints, expressing conditions that the output value of the block will not propagate to the primary output, given values of inputs to nearby gates on the path to the primary output. Global unobservability constraints add conditions that a block is unobservable if all paths to the primary output pass through logic blocks that are unobservable. By introducing a cut of unobservability check-points at the inputs of the top gate in a Boolean formula, we can impose global unobservability constraints for every logic block. The results show that global unobservability constraints lead to small additional speedup if local unobservability is exploited, but make the SAT-time less dependent on values of parameters in the translation.
Intelligent Traffic Signal System for Isolated Intersections

One critical issue of traffic control is the optimization of signalized intersections for improved multimodal safety and operations. Accommodating pedestrian traffic at intersections is challenging because the demands of multimodal service compete fiercely on limited green time resources. The Highway Capacity Manual prescribes that the parallel vehicle green must exceed “Walk” plus pedestrian clearance interval (PCI) timed by a design walking speed. This static PCI timing is unsafe because seniors and children are likely to be slower than the design pedestrian. Furthermore, a vehicle-flow issue arises when the prolonged PCI exceeds the operationally efficient parallel green: additional vehicle right-of-way, unnecessary for operational efficiency, preempts green time from conflicting phase(s) and increases intersectionwide queuing delays. Queuing delays necessitate a trade-off between competing multifaceted traveler needs. Fuzzy logic control (FLC) proves effective, flexible, and robust in handling competing objectives. With the dynamic PCI concept, this research developed an intelligent traffic signal system that performed friendly pedestrian accommodation and also incorporated FLC into fulfilling multifaceted vehicle needs. The potential benefits from the new system optimized with a genetic algorithm were quantified through a comparison with a standard dual-ring, eight-phase, vehicle-actuated controller, conventionally cited as NEMA (National Electrical Manufacturers Association) control. Microsimulation experiments revealed that the current countermeasure, which lowered PCI timing design speed to strengthen crossing safety, was operationally deficient. The existing timing standard cannot offer adequate safety for all pedestrians, and the NEMA system omits multifaceted vehicle needs in control logic. In contrast, the FLC system fully protects all pedestrians through dynamic PCI and smartly serves manifold vehicle needs well. The FLC system outperforms the NEMA control by embodying a reasonable trade-off between competing objectives in the management of an isolated intersection.
Protecting the Homeland 2006/2007

Immediately after September 11, the Brookings Institution began a comprehensive, multidisciplinary project focused on the key policy challenge of these dangerous times --assessing and improving homeland defense. That intense effort produced Protecting the American Homeland, and it continues in this important new book. In Protecting the Homeland 2006/2007 , Brookings foreign policy experts analyze current homeland security concerns and the adequacy (or inadequacy) of current policies designed to address them. The authors present both the big picture and the smaller components of homeland security policy that make up the whole. They make specific recommendations on intelligence reform, science and technology policy and the protection of critical infrastructure within the United States. They also look ahead to consider what dangers we should anticipate and plan for, recommending policies that will work to that end. One of the strands running through Protecting the Homeland 2006/2007 is the need to "stitch the seams" in our homeland security blanket through greater integration and coordination. The authors emphasize that the U.S. federal government must work together with key partners who have been insufficiently integrated into American homeland security activities to date. These actors include foreign governments, state and local government, and the private sector, and the coordination must occur in several different areas (e.g. border protection, finance, technology, intelligence). The U.S. government should not --indeed, it cannot --do it alone. By its very nature, homeland security is a problem that defies the usual bureaucratic boundaries. Effective homeland security policy demands intense collaboration on new issues and between organizations that have not traditionally needed each other. This book is of interest and importance to journalists, analysts, policymakers, scholars, and citizens concerned with protecting their homeland against terrorism and related dangers.
Algorithms in the Public-Private Model to Sub-Additive functions

In this work we consider the Public-Private model of graphs introduced by Chierichetti et al [1]. In the first part, we briefly introduce the model and give the description of the shortest-path algorithm as described in their paper. In the second part we describe algorithms for Community Detection(Densest Subgraph problem), Max-Cut and Vertex Cover . We also briefly explain how the above algorithms can be extended to a small class of sub-additive functions. Finally, we give details of the experimental analysis of this algorithm run on real-world social network data. I. The Public-Private Model The public-private model was introduced in [1] to capture graph problems on social networks. In this model we have a known public graph G = (V, E) and for each node u ∈ V we have a hidden private graph Gu = (V, Eu). For each (v, w) ∈ Eu both v and w must be at most a distance of two from u in the union graph G ∪ Gu. Without loss of generality, we can also assume G ∩ Gu = ∅. In social networks, nodes represent people/users and edges represent connections between them (e.g. friendship, shared group membership, etc.). Here we differentiate between edges which are known to the public, E, and those which are hidden by the user, Eu. For example, a Facebook user can hide their friend list while other users allow their friend lists to be publicly available. A 2012 study [2] showed that out of 1.4 million New York City Facebook users, 52.6% hid their friend list. To see how this simple public-private model captures phenomena in social networks, we consider a few examples. If a user u hides their friend list, then the private graph Gu is a star centered at u. Similarly, if u is part of a private group, then Gu will include a clique containing all members of the group. Note that in some online social networks, such as Facebook, two users can be in the same group even if they are not “friends” and we put an edge between them since they can interact with each other in the group. When solving problems in this graph model, we assume the public graph G is known in advance and a private graph Gu for some user u will be revealed. The solution we find should apply to the union graph G ∪ Gu. Observe that it could be very time consuming to compute some function on the entire union graph each time a user reveals their public graph. So we wish to do some preprocessing once on the public graph to answer queries efficiently when private graphs are revealed. Specifically, our goal is to preprocess the public graph G using poly(|E|) time and Õ(|V|) space. Then, when Gu is revealed, we should answer queries in time/space that is Õ(|Eu|) and poly(lg |V|). II. All Pairs Shortest Path In this section, we will describe the algorithm for the All Pairs Shortest Path(APSP) problem in the Public-Private model. APSP is an important problem in social networks since many learning
Automating Contract Negotiation

The automation of contract negotiation requires intelligent agents that can assimilate and use real-time information flows wisely. Electronic markets are information-rich with access to the Internet and the World Wide Web. A new breed of "information-based" agents are founded on concepts from information theory, and are designed to operate with information flows of varying and questionable integrity. These agents are part of a larger project that aims to make informed automated trading in applications such as eProcurement a reality.
Gastric Ulcers in Middle-Aged Rats: The Healing Effect of Essential Oil from Citrus aurantium L. (Rutaceae)

The elderly population has experienced increased life expectancy as well as the increased incidence of gastric ulcers. The peels of fruits from Citrus aurantium L. , popularly known in Brazil as orange bitter, are commonly used asatea form for the treatment of gastrointestinal tract disorders, such as ulcer and gastritis. We evaluated the healing effects of essential oil from the peels of Citrus aurantium fruits (OEC) on gastric ulcers in middle-aged rats. We examined the effects of a 14-day chronic OEC treatment on gastric mucosa in middle-aged male Wistar rats that were given acetic-acid-induced gastric lesions by morphometric and immunohistological analyses. Oral OEC treatment significantly reduced the lesion area (76%) within the gastric mucosa and significantly increased (P < .05) the height of regenerated mucosa (59%) when compared to the negative control group. Immunohistochemical analysis of the molecular markers such as COX-2, HSP-70, VEGF, and PCNA in the gastric mucosa confirmed that OEC treatment induced healing effects by increasing the number of new blood vessels and by augmenting gastric mucus in the mucosa glands. These results suggest that the oil from Citrus aurantium effectively heals gastric ulcers in middle-aged animals; however, safe use of OEC demands special care and precautions.
Automated Proof Reading of Clinical Notes

Misspellings, abbreviations and acronyms are very popular in clinical notes and can be an obstacle to high quality information extraction and classification. In addition, another important part of narrative reports is clinical scores and measurements as doctors infer a patient‟s status by analyzing them. We introduce a knowledge discovery process to resolve unknown tokens and convert scores and measures into a standard layout so as to improve the quality of semantic processing of the corpus. System performance is evaluated before and after an automatic proof reading process by comparing the computed SNOMEDCT codes to the coding created originally by the clinical staff. The automatic coding of the texts increased the coded content by 15% after the automatic correction process and the number of unique codes increased by 4.7%. Accuracy of the automatic coding and annotations in the notes which have not been coded by the clinical staff is suggested by the system output.
SEISMOLOGY OF β CEPHEI STARS: DIFFERENTIALLY ROTATING MODELS FOR INTERPRETING THE OSCILLATION SPECTRUM OF ν ERIDANI

A method for the asteroseismic analysis of β Cephei stars is presented and applied to the star ν Eridani. The method is based on the analysis of rotational splittings and their asymmetries using differentially rotating asteroseismic models. Models with masses around 7.13 M☉, and ages around 14.9 Myr, were found to fit better in 10 of the 14 observed frequencies, which were identified as the fundamental radial mode and the three ℓ = 1 triplets g1, p1, and p2. The splittings and aymmetries found for these modes recover those provided in the literature, except for p2. For this last mode, all its non-axysimmetric components are predicted by the models. Moreover, opposite signs of the observed and predicted splitting asymmetries are found. If identification is confirmed, this can be a very interesting source of information about the internal rotation profile, in particular in the outer regions of the star. In general, the seismic models that include a description for shellular rotation yield slightly better results as compared with those given by uniformly rotating models. Furthermore, we show that asymmetries are quite dependent on the overshooting of the convective core, which makes the present technique suitable for testing the theories describing the angular momentum redistribution and chemical mixing due to rotationally induced turbulence.
Contour Stereo Matching by Correlation in a Constraint Satisfaction Approach

Stereo vision is the recovery of depth of a scene using multiple images with di erent points of view. The major task in stereo vision is establishing correspondence of points between images given a known pinhole-model of the stereo cameras. Two major approaches to matching points have been used widely: feature-based matching and areaor correlationbased matching. It is well known that both approaches have speci c advantages and disadvantages. We describe a method for the matching of contours in a constraint satisfaction approach. Contour matches allow for depth estimation of textured surfaces and objects boundaries to sub-pixel accuracy. These depth estimates may be used for geometric object modeling. We analyze and provide quantative results of the constraint-based stereo matching, and additionally present some examples of objects models obtained with our approach.
The Color Adjacency GraphRepresentation of Multi-Coloured

A new representation for objects with multiple colours-the colour adjacency graph (CAG)-is proposed. Each node of the CAG represents a single chromatic component of the image deened as a set of pixels forming a unimodal cluster in the chromatic scattergram. Edges encode information about adjacency of colour components and their reeectance ratio. The CAG is related to both the histogram and region adjacency graph representations. It is shown to be preserving and combining the best features of these two approaches while avoiding their drawbacks. The proposed approach is tested on a range of diicult object recognition and localisation problems involving complex imagery of non rigid 3D objects under varied viewing conditions with excellent results.
Preferential Semantics for Goals

Goals, as typically conceived in AI planning, provide an insufficient basis for choice of action, and hence are deficient as the sole expression of an agent's objectives. Decision-theoretic utilities offer a more adequate basis, yet lack many of the computational advantages of goals. We provide a preferential semantics for goals that grounds them in decision theory and preserves the validity of some, but not all, common goal operations performed in planning. This semantic account provides a criterion for verifying the design of goal-based planning strategies, thus providing a new framework for knowledge-level analysis of planning systems.
Inefficiencies in the Cache Hierarchy: A Sensitivity Study of Cacheline Size with Mobile Workloads

With the rising number of cores in mobile devices, the cache hierarchy in mobile application processors gets deeper, and the cache size gets bigger. However, the cacheline size remained relatively constant over the last decade in mobile application processors. In this work, we investigate whether the cacheline size in mobile application processors is due for a refresh, by looking at inefficiencies in the cache hierarchy which tend to be exacerbated when increasing the cacheline size: false sharing and cacheline utilization. Firstly, we look at false sharing, which is more likely to arise at larger cacheline sizes and can severely impact performance. False sharing occurs when non-shared data structures, mapped onto the same cacheline, are being accessed by threads running on different cores, causing avoidable invalidations and subsequent misses. False sharing has been found in various places such as scientific workloads and real applications. We find that whilst increasing the cacheline size does increase false sharing, it still is negligible when compared to known cases of false sharing in scientific workloads, due to the limited level of thread-level parallelism in mobile workloads. Secondly, we look at cacheline utilization which measures the number of bytes in a cacheline actually used by the processor. This effect has been investigated under various names for a multitude of server and desktop applications. As a low cacheline utilization implies that very little of the fetched cachelines was used by the processor, this causes waste in bandwidth and energy in moving data across the memory hierarchy. The energy cost associated with data movements is much higher compared to logic operations, increasing the need for cache efficiency, especially in the case of an energy-constrained platform like a mobile device. We find that the cacheline utilization of mobile workloads is low in general, decreasing when increasing the cacheline size. When increasing the cacheline size from 64 bytes to 128 bytes, the number of misses will be reduced by 10%--30%, depending on the workload. However, because of the low cacheline utilization, this more than doubles the amount of unused traffic to the L1 caches. Using the cacheline utilization as a metric in this way, illustrates an important point. If a change in cacheline size would only be assessed on its local effects, we find that this change in cacheline size will only have advantages as the miss rate decreases. However, at system level, this change will increase the stress on the bus and increase the amount of wasted energy due to unused traffic. Using cacheline utilization as a metric underscores the need for system-level research when changing characteristics of the cache hierarchy.