1,721,282 research outputs found

    Occurrence of aristolochic acids in over-the-counter Chinese prepared medicines 

    No full text
    [[abstract]]The purpose of the present study was to investigate the levels of aristolochic acids (AA-I and AA-II) in Chinese herbal medicines and in over-the-counter Chinese prepared medicines using high-performance liquid chromatography (HPLC). Reversed-phase HPLC (C-18) utilizing isocratic elution (65% methanol, 35% water, 0.5% acetic acid) and UV detection (lambda = 254 nm) was used to survey 11 different kinds of Chinese herbal medicines that were known to be consumed by patients prior to be hospitalized for acute renal failure. It was found that 8 out of 11 samples contained aristolochic acids (ranging from 0.2 to 20 nmol/g. These results suggested that commercially available over-the-counter Chinese herbal medicines might contain various levels of aristolochic acids.[[note]]SC

    Designing stable ABR flow control with rate feedback and open-loop control: first-order control case

    Full text link
    In this paper we present a control-theoretic approach to design stable rate-based Bow control for ATM ABR services. The flow control algorithm that we consider has the most simple form among all the queue-length-based flow control algorithms, and is referred to as first-order rate-based flow control (FRFC) since the corresponding closed loop can be modeled as a first-order retarded differential equation. We analyze the equilibrium and the asymptotic stability of the closed loop for the case of multiple connections with diverse round-trip delays. We also characterize the asymptotic decay rate at which the stable closed loop tends to the equilibrium. The decay rate is shown to be a concave function of control gain with its maximum being the inverse of round-trip delay. We also consider an open loop control in which the queue control threshold is dynamically adjusted according to the changes in the available bandwidth and the number of connections. This open loop control is shown to be necessary and effective to prevent the closed loop from converging to an undesirable equilibrium point. (C) 1998 Elsevier Science B.V. All rights reserved.

    First-order rate-based flow control with dynamic queue threshold for high-speed wide-area ATM networks

    No full text
    In this paper we present a new rate-based flow control scheme for ATM ABR, services and analyze its performance. The proposed algorithm, which we refer to as first-order rate-based flow control (FRFC) is the most simple form of queue-length-based flow control. The asymptotic stability, the steady-state throughput, queue length and fairness, and the transient behavior are analyzed for the case of multiple connections with diverse round-trip delays. We also consider novel approach to dynamically adjust a queue threshold in the FRFC according to the changes in the available bandwidth, and the arrival and departure of connections. Simulations show that the simple FRFC with dynamic queue threshold (DQT) effectively maintains high throughput, small loss and a desired fairness in these dynamic environments and is a promising solution for ABR flow control in ATM networks. (C) 1998 Elsevier Science B.V.

    Going Beyond Counting First Authors in Author Co-citation Analysis

    Full text link
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed

    Variations on the Author

    Full text link
    “Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship

    Appropriate Similarity Measures for Author Cocitation Analysis

    Full text link
    We provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis

    A hybrid particle Swann optimization algorithm for optimal task assignment in distributed systems

    No full text
    [[abstract]]In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited resource are satisfied. Most of the existing formulations for this problem have been found to be NP-complete, and thus finding the exact solutions is computationally intractable for large-scaled problems. This paper presents a hybrid particle swarm optimization algorithm for finding the near optimal task assignment with reasonable time. The experimental results manifest that the proposed method is more effective and efficient than a genetic algorithm. Also, our method converges at a fast rate and is suited to large-scaled task assignment problems. (c) 2005 Elsevier B.V. All rights reserved.[[note]]SC
    corecore