Search

Abstract Silent information regulator 1 (SIRT1) is a type III histone deacetylase that is related to the inhibition of the inflammatory response. The aim of this study was to investigate the regulation of SIRT1 on isoniazid-induced hepatocyte injury and the possible mechanism of histone modification. We found that compared with the blank control group, expression of SIRT1 was decreased in the isoniazid group and that expression of NF-κB p65 was increased, leading to an increase of the expression of inflammatory cytokines Interleukin-6 (IL-6) and Tumour necrosis factor alpha (TNF-α). The level of histone H3K9 acetylation in the promoter region of IL-6 was increased as well. Addition of a SIRT1 agonist (SRT1720) alleviated the inflammatory reaction caused by isoniazid, while the use of a SIRT1 inhibitor (EX527) aggravated the inflammatory damage to cells. In conclusion, these findings indicated that during the period of isoniazid-induced hepatocyte injury, SIRT1 levels were decreased and inflammatory factor levels were increased. Activation of SIRT1 may reduce hepatocyte injury by reducing the level of histone H3K9 acetylation in the promoter region of the IL-6 gene. Highlights • Isoniazid can induce inflammatory damage in human normal liver cells. • Activation of SIRT1 can attenuate hepatocyte inflammatory damage caused by isoniazid. • SIRT1 can alleviate hepatocyte inflammatory damage caused by isoniazid by reducing histone acetylation in the promoter region of the IL-6 gene. [ABSTRACT FROM AUTHOR]

Abstract: When using wireless sensor networks for real-time event alarming, it is critical to ensure event notification in a timely manner. Additionally, it is extremely important to ensure the alarms generated by the sensors propagate securely through the network to the sink. Another important factor to consider is energy, as it is a limited resource in wireless sensor networks. Accordingly, maximizing network lifetime is always an optimization goal. To address the aforementioned concerns, in this paper we present the Authentic Delay Bounded Event Detection System (ADBEDS). ADBEDS works in rounds, and in each round an event detection tree is responsible for simultaneously detecting events, routing packets to a gateway node, and detecting injection of false packets. The ADBEDS can support k-watching composite events to allow event detection in a redundant manner. Additionally, the corresponding event alarm can be delivered within a user-specified bounded delay. The use of energy-based keying allows smaller, more efficient keys as input to security mechanisms, allowing further reduction in energy consumption of the ADBEDS. We evaluate the energy efficiency and reliability of ADBEDS using theoretical analysis and simulation. [Copyright &y& Elsevier]

• Several important parameterization methods for completeness reasoning problem are identified. • The completeness reasoning problems parameterized by the sizes of the completeness statements are shown to be para-NP-complete. • For special cases defined by limiting query structures, the parameterized completeness reasoning problems are shown to be intractable. • With data completeness statements of constant size, tractable cases of the parameterized completeness reasoning problem are found. Incompleteness management has become a popular research topic and been viewed in many applications in the area of data quality and data management. Traditional methods for handling incompleteness assume data is totally complete or incomplete. However, in practical applications, data is often partial complete , which means that data is not totally complete but some special parts of the data satisfying given semantic specifications are complete. Intuitively, partial complete data can still give complete answers for queries consistent with the semantic specifications. Therefore, it is highly needed to study the fundamental problems for managing partial complete data. However, as far as known by us, there are only few works focusing on this area. The most important and fundamental problem, completeness reasoning , is studied from the aspect of parameterized complexity by this paper. The completeness reasoning problem, TC-QC (Table Completeness to Query Completeness), is first formally defined and studied by Razniewski et al. [1]. Given completeness statements of data, the goal of the TC-QC problem is to determine whether the result of a special query Q is complete, that is to reason query completeness based on given data completeness. Razniewski et al. have shown that the TC-QC problem is NP- hard even for conjunctive queries , and a natural and interesting question is whether or not TC-QC can be solved efficiently by parameterized algorithms. To answer that, the parameterized complexities of completeness reasoning for conjunctive queries are studied by the paper. First, it is shown that, considering the parameterizations defined by the size of query completeness or table completeness, the parameterized TC-QC problem for conjunctive queries is para-NP- complete , which strongly indicate that the TC-QC problems parameterized by the above two parameters do not admit fixed-parameter tractable algorithms. Then, for more special cases parameterized by different constraints on query structures like degree, tree-width and number of variables, the TC-QC problems are still not fixed parameter tractable. Finally, on the positive side, if each data completeness statement has a constant size bound, the parameterized TC-QC problem defined by the query completeness size can be solved by a fixed-parameter tractable algorithm. [ABSTRACT FROM AUTHOR]

We study a graph class called conflict graph , which is a union of a finite number of given forests of complete multipartite graph. It is interesting that conflict graph can model many natural problems, such as in database application and others. We show that this property is non-trivial if limiting the number of forests of complete multipartite graph. Then study the problem of vertex cover on conflict graph in this paper. The results list as follows, if the number of forests of complete multipartite graph is fixed, conflict graph is non-trivial property, but finding 1.36-approximation algorithms is NP- hard. Also given 2 forests of complete multipartite graph and maximum degree less than 7, vertex cover problem of conflict graph is NP- complete. Moreover, it is shown to be NP- hard to find an algorithm for vertex cover of conflict graph within 41 40 − ε , for any ε > 0 , if there is no the degree restriction over the graph. At last, we design an approximation algorithm for the conflict graph consisting of r forests of complete multipartite graph and show that the approximation ratio can be bounded by 2 − 1 2 r and it's near optimal. [ABSTRACT FROM AUTHOR]

Abstract Deletion propagation problem has been an important role in data lineage, is a classic problem in the database research on data provenance and quality. As a more restricted version of classic view update problem in relational databases, it is defined on a given database D , a monotonic relational algebraic query Q and its materialized view V of D , deletion propagation aims to find a tuple set ΔD whose deletion from D guarantees that the result of Q is exactly the view V minus an intended deletion ΔV , i.e., ΔD will not produce side-effect on view. Such ΔD is side-effect-free if no side effect produced by deleting it from D. We study the complexity of finding side-effect-free deletion in this paper. We also consider the functional dependency restricted version deletion propagation problem ' b -dp ' which generalizes the computational issues involved in data lineage, it is to find the ΔD not only view side-effect free but also without introducing inconsistency with respect to the predefined functional dependencies. Both data and combined complexity of b -dp are studied under both single and group deletion. Plenty of analysis are provided on this problem with respect to queries in different classes on either complexity aspect. [ABSTRACT FROM AUTHOR]

In this paper, we revisit the triangle edge deletion problem a variant of feedback arc set problem which is one of the Karp's 21 NP-complete problems. Given a graph G (V , E) , it is to find the edge set F such that | F | ≤ k and G ′ (V , E ∖ F) is a triangle-free graph. Yannakakis [1] showed it is hard for simple digraphs as well. The latest results showed that triangle edge deletion problem is still hard even for (a) planar undirected graphs of maximum degree seven [2] and (b) RGB-digraphs [3] which is a special class of digraphs. To make a further step, we show a new result in this paper that triangle edge deletion problem is still NP-complete even for planar RGB-digraphs of maximum degree eight with no glasses. On the other hand, we can find a kernel consisting of 11 k / 3 vertices for planar RGB-digraphs with no glasses. The results have an interesting application for the derivation of a tighter dichotomy on resilience decision problem in database theory. [ABSTRACT FROM AUTHOR]

Abstract: Given n clones with some positive ones, the problem of DNA screening is to identify all positive clones with a set of tests each on a subset of clones, called a pool and the outcome is either the pool contains a positive clone or not. In this paper, we show that for a class of designs, if we apply those for samples with d positive clones to samples with at most positive clones, the error-tolerant property will have an interesting improvement. We also make a remark on decoding method for k-error-correcting d-disjunct matrix. [Copyright &y& Elsevier]