Orderly Spanning Trees with Applications

We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an {\em orderly pair} for any connected planar graph $G$, consisting of a plane graph $H$ of $G$, and an orderly spanning tree of $H$. We also present several applications of orderly spanning trees: (1) a new constructive proof for Schnyder's Realizer Theorem, (2) the first area-optimal 2-visibility drawing of $G$, and (3) the best known encodings of $G$ with O(1)-time query support. All algorithms in this paper run in linear time.Comment: 25 pages, 7 figures, A preliminary version appeared in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), Washington D.C., USA, January 7-9, 2001, pp. 506-51

Effects of English Teaching with Interactive Whiteboards in the Elementary English Classrooms

The purpose of the study was to probe the effectiveness of English language teaching through Interactive Whiteboards (IWBs). Three specific factors were probed: (a) the results from immediate test and retention test; (b) students’ perceptions related to the utilization of IWBs; (c) the advantages and disadvantages of the technology-supported instruction. Forty-three students from Grade 3 students in Sahes Elementary School in Taiwan were engaged in either technology-supported group or none technology-supported group. The results revealed that the experimental group through technology-supported instruction significantly outperformed the control group on students’ immediate test and retention test. Moreover, students’ perceptions related to the IWBs indicated that most of them enjoying learning English in the technology-supported classrooms. Finally, the results also showed the advantages and disadvantages through the IWBs instructions. The study revealed that teaching through technology was an effective way to help students in English learning

Using Data Envelopment Analysis to Evaluate the Performance of Third Party Distribution Centers

There has been considerable interest worldwide in last few years in the growth of third party logistics (3PL) providers. 3PL distribution center (DC) enables firms to achieve reduced operating costs, increased revenues, and to focus on their core competence. This research aims to find the key performance indicators through a survey of a set of DCs and then evaluate their efficiency over the period 2005-2007 using data envelopment analysis (DEA) models based on selected performance indicators as inputs and outputs. Three inputs and two outputs for all DCs from the surveyed performance indicators were selected in this study. DEA is a non-parametric linear programming technique used to evaluate the efficiency of decision making units (DMUs) where multiple inputs and outputs are involved. We adopted both the input-oriented CCR model and the BCC model that were designed to derive weights instead of being fixed in advance and handle positive inputs/outputs. A Malmquist productivity index (MPI) analysis further evaluates efficiency change and productivity growth between two time points. Our empirical results show that scale inefficiency is the major reason for the inefficient DMUs. For the future research, more DC data should be collected and different DEA models could be applied for other benchmark studies

Celecoxib extends C. elegans lifespan via inhibition of insulin‐like signaling but not cyclooxygenase‐2 activity

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/86911/1/ACEL_688_sm_FigS1-S2-TableS1-S2.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/86911/2/j.1474-9726.2011.00688.x.pd

Effects of Ox-LDL on Macrophages NAD(P)H Autofluorescence Changes by Two-photon Microscopy

Ox-LDL uptakes by macrophage play a critical role in the happening of atherosclerosis. Because of its low damage on observed cells and better signal-to- background ratio, two-photon excitation fluorescence microscopy is used to observe NAD(P)H autofluorescence of macrophage under difference cultured conditions- bare cover glass, coated with fibronectin or poly-D-lysine. The results show that the optimal condition is fibronectin coated surface, on which, macrophages profile can be clearly identified on NAD(P)H autofluorescence images collected by two-photon microscopy. Moreover, different morphology and intensities of autofluorescence under different conditions were observed as well. In the future, effects of ox-LDL on macrophages will be investigated by purposed system to research etiology of atherosclerosis.Comment: Submitted on behalf of TIMA Editions (http://irevues.inist.fr/tima-editions

On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation

Hamiltonian simulation is one of the most important problems in the field of quantum computing. There have been extended efforts on designing algorithms for faster simulation, and the evolution time T for the simulation greatly affect algorithm runtime as expected. While there are some specific types of Hamiltonians that can be fast-forwarded, i.e., simulated within time o(T), for some large classes of Hamiltonians (e.g., all local/sparse Hamiltonians), existing simulation algorithms require running time at least linear in the evolution time T. On the other hand, while there exist lower bounds of ?(T) circuit size for some large classes of Hamiltonian, these lower bounds do not rule out the possibilities of Hamiltonian simulation with large but "low-depth" circuits by running things in parallel. As a result, physical systems with system size scaling with T can potentially do a fast-forwarding simulation. Therefore, it is intriguing whether we can achieve fast Hamiltonian simulation with the power of parallelism. In this work, we give a negative result for the above open problem in various settings. In the oracle model, we prove that there are time-independent sparse Hamiltonians that cannot be simulated via an oracle circuit of depth o(T). In the plain model, relying on the random oracle heuristic, we show that there exist time-independent local Hamiltonians and time-dependent geometrically local Hamiltonians on n qubits that cannot be simulated via an oracle circuit of depth o(T/n^c), where the Hamiltonians act on n qubits, and c is a constant. Lastly, we generalize the above results and show that any simulators that are geometrically local Hamiltonians cannot do the simulation much faster than parallel quantum algorithms