Take a journey to discover how you can provide quality information to your patrons for free! Explore the world of Open Access Resources! Open Access refers to scholarly information that is free, online, and free of most copyright and licensing restrictions. This makes it easier for people to find and use reliable information on a myriad of subjects, such as health information, educational materials, or business resources. Knowledge of Open Access is important for all librarians to help us best serve our communities and stretch our dwindling budgets. Your tour guides will give an overview of Open Access, discuss legislative issues, demonstrate how to find open access resources, and explain how librarians can get involved.
Presented at the SDLA/NDLA/MPLA Tri-conference 2013
Videos are a useful and popular way to reach an audience — we all know videos that have gone viral online, garnering millions of views. However, the type of video that can compete with Old Spice commercials takes weeks to plan and produce, as well as a significant budget. Arizona State University (ASU) Libraries wanted to find a sustainable way to share videos that would require minimal staff time to create and produce.
With that goal in mind, “The Library Minute” was born. We initially envisioned a weekly newscast, but it has evolved into a successful and fun video series. Episodes have been featured in American Libraries Direct, as part of the ACRL Marketing Minute, received more than 74,000 views on YouTube and the Internet Archive, and have garnered complimentary e-mails from all over the world. Most importantly, they are a valuable marketing and outreach tool for the ASU Libraries and have increased our visibility to our students and other departments in the university.
Purpose: In spring of 2007, Arizona State University Libraries held a focus group of selected faculty to discover their perceptions and use of electronic books (e-books) in their research and teaching.
Methodology/approach: We employed the services of the Institute of Social Sciences Research to recruit and moderate the focus group. The following major themes were explored:
1) Use of e-books as textbooks.
2) Use of e-books for personal research.
3) Comparison between e-books and print.
4) Disciplinary differences in perceptions of e-books.
5) Motivators for future use
Findings: Overall, the focus group revealed that faculty had generally unsatisfactory experiences in using e-books in their research and teaching due to the unreliability of access, lack of manipulability, and the steep learning curve of the various interfaces. However, most faculty agreed that e-books would be a very viable and useful alternative if these issues were resolved.
Research limitations/implications: The focus group consisted of only six faculty members and hence is not representative of faculty as a whole. A larger survey of a more diverse faculty population would greatly serve to clarify and expand upon our findings.
Practical implications: The implications for academic libraries include providing better outreach and training to faculty about the e-book platforms offered, provide better course support, and advocate to e-book vendors to consider faculty's teaching and research needs in their product development.
Originality/value of paper: To the best knowledge of the authors, this is the first published study of faculty opinions and use of e-books utilizing focus group methodology and offers detailed information that would be useful for academic libraries and e-book vendors for evidence-based decisions.
Revealing the underlying structure and dynamics of complex networked systems from observed data without of any specific prior information is of fundamental importance to science, engineering, and society. We articulate a Markov network based model, the sparse dynamical Boltzmann machine (SDBM), as a universal network structural estimator and dynamics approximator based on techniques including compressive sensing and K-means algorithm. It recovers the network structure of the original system and predicts its short-term or even long-term dynamical behavior for a large variety of representative dynamical processes on model and real-world complex networks.
One of the most challenging problems in complex dynamical systems is to control complex networks.
Upon finding that the energy required to approach a target state with reasonable precision
is often unbearably large, and the energy of controlling a set of networks with similar structural properties follows a fat-tail distribution, we identify fundamental structural ``short boards'' that play a dominant role in the enormous energy and offer a theoretical interpretation for the fat-tail distribution and simple strategies to significantly reduce the energy.
Extreme events and cascading failure, a type of collective behavior in complex networked systems, often have catastrophic consequences. Utilizing transportation and evolutionary game dynamics as prototypical
settings, we investigate the emergence of extreme events in simplex complex networks, mobile ad-hoc networks and multi-layer interdependent networks. A striking resonance-like phenomenon and the emergence of global-scale cascading breakdown are discovered. We derive analytic theories to understand the mechanism of
control at a quantitative level and articulate cost-effective control schemes to significantly suppress extreme events and the cascading process.
For tree networks, the maximum a posterior (MAP) estimator of the information source is derived under the independent cascades (IC) model with a complete snapshot and a Short-Fat Tree (SFT) algorithm is proposed for general networks based on the MAP estimator. Furthermore, the following possibility and impossibility results are established on the Erdos-Renyi (ER) random graph: $(i)$ when the infection duration $<\frac{2}{3}t_u,$ SFT identifies the source with probability one asymptotically, where $t_u=\left\lceil\frac{\log n}{\log \mu}\right\rceil+2$ and $\mu$ is the average node degree, $(ii)$ when the infection duration $>t_u,$ the probability of identifying the source approaches zero asymptotically under any algorithm; and $(iii)$ when infection duration $
In practice, other than the nodes' states, side information like partial timestamps may also be available. Such information provides important insights of the diffusion process. To utilize the partial timestamps, the information source detection problem is formulated as a ranking problem on graphs and two ranking algorithms, cost-based ranking (CR) and tree-based ranking (TR), are proposed. Extensive experimental evaluations of synthetic data of different diffusion models and real world data demonstrate the effectiveness and robustness of CR and TR compared with existing algorithms.
Another interesting problem in quantum transport is the effect of disorder or random impurities since it is inevitable in real experiments. At first, for a twodimensional Dirac ring, as the disorder density is systematically increased, the persistent current decreases slowly initially and then plateaus at a finite nonzero value, indicating remarkable robustness of the persistent currents, which cannot be discovered in normal metal and semiconductor rings. In addition, in a Floquet system with a ribbon structure, the conductance can be remarkably enhanced by onsite disorder.
Recent years have witnessed significant interest in nanoscale physical systems, such as semiconductor supperlattices and optomechanical systems, which can exhibit distinct collective dynamical behaviors. Firstly, a system of two optically coupled optomechanical cavities is considered and the phenomenon of synchronization transition associated with quantum entanglement transition is discovered. Another useful issue is nonlinear dynamics in semiconductor superlattices caused by its key potential application lies in generating radiation sources, amplifiers and detectors in the spectral range of terahertz. In such a system, transition to multistability, i.e., the emergence of multistability with chaos as a system parameter passes through a critical point, is found and argued to be abrupt.