1,454 research outputs found

    GRAPHENE-BASED NANOCOMPOSITES FOR ENERGY STORAGE

    Get PDF
    Since the first report of using micromechanical cleavage method to produce graphene sheets in 2004, graphene/graphene-based nanocomposites have attracted wide attention both for fundamental aspects as well as applications in advanced energy storage and conversion systems. In comparison to other materials, graphene-based nanostructured materials have unique 2D structure, high electronic mobility, exceptional electronic and thermal conductivities, excellent optical transmittance, good mechanical strength, and ultrahigh surface area. Therefore, they are considered as attractive materials for hydrogen (H2) storage and high-performance electrochemical energy storage devices, such as supercapacitors, rechargeable lithium (Li)-ion batteries, Li– sulfur batteries, Li–air batteries, sodium (Na)-ion batteries, Na–air batteries, zinc (Zn)–air batteries, and vanadium redox flow batteries (VRFB), etc., as they can improve the efficiency, capacity, gravimetric energy/power densities, and cycle life of these energy storage devices. In this article, recent progress reported on the synthesis and fabrication of graphene nanocomposite materials for applications in these aforementioned various energy storage systems is reviewed. Importantly, the prospects and future challenges in both scalable manufacturing and more energy storage-related applications are discussed

    A tighter analysis of the worst-case endto- end communication delay in massive multicores

    Get PDF
    "Many-core” systems based on the Network-on- Chip (NoC) architecture have brought into the fore-front various opportunities and challenges for the deployment of real-time systems. Such real-time systems need timing guarantees to be fulfilled. Therefore, calculating upper-bounds on the end-to-end communication delay between system components is of primary interest. In this work, we identify the limitations of an existing approach proposed by [1] and propose different techniques to overcome these limitations

    Topology Management in Wireless Sensor Networks: Multi-State Algorithms

    Get PDF
    In order to maximize the network’s lifetime and ensure the connectivity among the nodes, most topology management practices use a subgroup of nodes for routing. This paper provides an in-depth look at existing topology management control algorithms in Multi-state structure. We suggest a new algorithm based on Geographical Adaptive Fidelity (GAF) and Adaptive Self-Configuring Sensor Networks Topology (ASCENT). The new proposed algorithm outperforms both GAF and ASCENT algorithms

    The minimum mean monopoly energy of a graph

    Get PDF
    The motivation for the study of the graph energy comes from chemistry, where the research on the so-called total pi - electron energy can be traced back until the 1930s. This graph invariant is very closely connected to a chemical quantity known as the total pi - electron energy of conjugated hydro carbon molecules. In recent times analogous energies are being considered, based on Eigen values of a variety of other graph matrices. In 1978, I.Gutman [1] defined energy mathematically for all graphs. Energy of graphs has many mathematical properties which are being investigated. The ordinary energy of an undirected simple finite graph G is defined as the sum of the absolute values of the Eigen values of its associated matrix. i.e. if mu(1), mu(2), ..., mu(n) are the Eigen values of adjacency matrix A(G), then energy of graph is Sigma(G) = Sigma(n)(i=1) vertical bar mu(i)vertical bar Laura Buggy, Amalia Culiuc, Katelyn Mccall and Duyguyen [9] introduced the more general M-energy or Mean Energy of G is then defined as E-M (G) = Sigma(n)(i=1)vertical bar mu(i) - (mu) over bar vertical bar, where (mu) over bar vertical bar is the average of mu(1), mu(2), ..., mu(n). A subset M subset of V (G), in a graph G (V, E), is called a monopoly set of G if every vertex v is an element of (V - M) has at least d(v)/2 neighbors in M. The minimum cardinality of a monopoly set among all monopoly sets in G is called the monopoly size of G, denoted by mo(G) Ahmed Mohammed Naji and N.D.Soner [7] introduced minimum monopoly energy E-MM [G] of a graph G. In this paper we are introducing the minimum mean monopoly energy, denoted by E-MM(M) (G), of a graph G and computed minimum monopoly energies of some standard graphs. Upper and lower bounds for E-MM(M) (G)are also established.Publisher's Versio

    Calibration of second-order correlation functions for non-stationary sources with a multi-start multi-stop time-to-digital converter

    Full text link
    A novel high-throughput second-order-correlation measurement system is developed which records and makes use of all the arrival times of photons detected at both start and stop detectors. This system is suitable particularly for a light source having a high photon flux and a long coherence time since it is more efficient than conventional methods by an amount equal to the product of the count rate and the correlation time of the light source. We have used this system in carefully investigating the dead time effects of detectors and photon counters on the second-order correlation function in the two-detector configuration. For a non-stationary light source, distortion of original signal was observed at high photon flux. A systematic way of calibrating the second-order correlation function has been devised by introducing a concept of an effective dead time of the entire measurement system.Comment: 7 pages, 6 figure
    corecore