Basic principles of ultrafast Raman loss spectroscopy

When a light beam passes through any medium, the effects of interaction of light with the material depend on the field intensity. At low light intensities the response of materials remain linear to the amplitude of the applied electromagnetic field. But for sufficiently high intensities, the optical properties of materials are no longer linear to the amplitude of applied electromagnetic field. In such cases, the interaction of light waves with matter can result in the generation of new frequencies due to nonlinear processes such as higher harmonic generation and mixing of incident fields. One such nonlinear process, namely, the third order nonlinear spectroscopy has become a popular tool to study molecular structure. Thus, the spectroscopy based on the third order optical nonlinearity called stimulated Raman spectroscopy (SRS) is a tool to extract the structural and dynamical information about a molecular system. Ultrafast Raman loss spectroscopy (URLS) is analogous to SRS but is more sensitive than SRS. In this paper, we present the theoretical basis of SRS (URLS) techniques which have been developed in our laboratory.

Query Click and Text Similarity Graph for Query Suggestions

Query suggestion is an important feature of the search engine with the explosive and diverse growth of web contents. Different kind of suggestions like query, image, movies, music and book etc. are used every day. Various types of data sources are used for the suggestions. If we model the data into various kinds of graphs then we can build a general method for any suggestions. In this paper, we have proposed a general method for query suggestion by combining two graphs: (1) query click graph which captures the relationship between queries frequently clicked on common URLs and (2) query text similarity graph which finds the similarity between two queries using Jaccard similarity. The proposed method provides literally as well as semantically relevant queries for users' need. Simulation results show that the proposed algorithm outperforms heat diffusion method by providing more number of relevant queries. It can be used for recommendation tasks like query, image, and product suggestion.

Full retention schedule in FE

Jisc Freedom of Information retention schedules Disclaimer We aim to provide accurate and current information on this website. However, we accept no liability for errors or ommissions, or for loss or damage arising from using this information. The statements made and views expressed in publications are those of the authors and do not represent in any way the views of the Service. The JISC infoNet Service offers general guidance only on issues relevant to the planning and implementation of information systems. Such guidance does not constitute definitive or legal advice and should not be regarded as a substitute therefor. The JISC infoNet Service does not accept any liability for any loss suffered by persons who consult the Service whether or not such loss is suffered directly or indirectly as a result of reliance placed on guidance given by the Service. The reader is reminded that changes may have taken place since issue, particularly in rapidly changing areas such as internet addressing, and consequently URLs and e-mail addresses should be used with caution. We are not responsible for the content of other websites linked to this site. No part of this Web site or its contents may be reproduced or distributed in any form except by bona fide UK public sector education establishments or in accordance with the provisions of the Copyright, Designs and Patents Act 1988 and any amending legislation. All reproductions require an acknowledgement of the source and the author of the work. Parties outside the education sector should contact JISC infoNet regarding use of these materials.

Application-Level Document Caching in the Internet

With the increasing demand for document transfer services such as the World Wide Web comes a need for better resource management to reduce the latency of documents in these systems. To address this need, we analyze the potential for document caching at the application level in document transfer services. We have collected traces of actual executions of Mosaic, reflecting over half a million user requests for WWW documents. Using those traces, we study the tradeoffs between caching at three levels in the system, and the potential for use of application-level information in the caching system. Our traces show that while a high hit rate in terms of URLs is achievable, a much lower hit rate is possible in terms of bytes, because most profitably-cached documents are small. We consider the performance of caching when applied at the level of individual user sessions, at the level of individual hosts, and at the level of a collection of hosts on a single LAN. We show that the performance gain achievable by caching at the session level (which is straightforward to implement) is nearly all of that achievable at the LAN level (where caching is more difficult to implement). However, when resource requirements are considered, LAN level caching becomes much more desirable, since it can achieve a given level of caching performance using a much smaller amount of cache space. Finally, we consider the use of organizational boundary information as an example of the potential for use of application-level information in caching. Our results suggest that distinguishing between documents produced locally and those produced remotely can provide useful leverage in designing caching policies, because of differences in the potential for sharing these two document types among multiple users.

We need to have a conversation about OpenURL, a close look at a corpus of error reports from the 2013 academic year. Or, How I learned to stop worrying and give up on clean metadata.

Presented at Access 2014, winner of poster contest.

Simple Analysis of Network Datasets

Linux commands that are generally useful for analyzing data; it is very easy to reduce phenomena such as links, nodes, URLs or downloads, to multiply repeating identifiers and then sorting and counting appearances.

What is the Web?

An introductory lecture on Web Science, taking a kind of devils advocate position by suggesting that the Web is a piece of runaway technology that escaped from research labs prematurely.

Fuentes de información bibliográfica a través de Internet para investigadores en educación.

Resumen tomado de la publicación

Capturing meaning construction in financial disclosure

Our study takes as its motivation common concerns across a variety of disciplines regarding an understanding of the linguistic, rhetorical and argumentative functions of the narrative aspects of financial disclosures, however with one significant alteration. This is that we do not restrict our investigation to the textual aspects but also consider the discursive nature of numbers. Numbers and narratives are simply alternative, and complementary, media to be used in disclosure, and many of the linguistic, and all of the rhetorical and argumentative, considerations apply to both, and need to be addressed and analysed. For complete version of the "long abstract" see attached full text pdf or the link in "Related URLs" field.

ALOI : um agente para a localização e organização de informações

Este trabalho é um estudo sobre agentes inteligentes e suas aplicações na Internet. São apresentados e comparados alguns exemplos de software com funcionalidades para extrair, selecionar e auxiliar no consumo de informações da Internet, com base no perfil de interesse de cada usuário. O objetivo principal deste trabalho é a proposição de um modelo geral e amplo de agente para a obtenção e manutenção de um repositório de links para documentos que satisfaçam o interesse de um ou mais usuários. O modelo proposto baseia-se na obtenção do perfil do usuário a partir de documentos indicados como modelos positivos ou negativos. O ponto forte do modelo são os módulos responsáveis pela extração de informações da Internet, seleção quanto a importância e armazenamento em banco de dados das URLs obtidas, classificadas quanto a usuário, categoria de assunto e assunto. Além disso, o modelo prevê a realização de freqüentes verificações de integridade e pertinência dos links armazenados no repositório. Com base no modelo proposto foi implementado um protótipo parcial. Tal protótipo contempla os módulos responsáveis pela obtenção de informações, seleção das informações pertinentes e classificação e armazenamento dos links de acordo com o assunto. Finalmente, o protótipo implementado permaneceu em execução por um determinado período, gerando alguns resultados preliminares que viabilizaram uma avaliação do modelo.

Catecholaminergic (CA) neurons modulate hypoxic ventilatory response in newborn rats (P7-8)

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Exercise training and MAPK protein expression in rats with heart failure

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Cardiovascular effects of chronically increasing angiotensin II type 2 receptor expression in the nucleus of the solitary tract

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Influence of late N-acetylcysteine administration on cardiac remodeling in long-term follow-up postinfarction rats

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)