A criança nativa digital no contexto de filmes publicitários

Pós-graduação em Psicologia - FCLAS

The dynamical state of galaxy groups and their luminosity content

We analyse the dependence of the luminosity function (LF) of galaxies in groups on group dynamical state. We use the Gaussianity of the velocity distribution of galaxy members as a measurement of the dynamical equilibrium of groups identified in the Sloan Digital Sky Survey Data Release 7 by Zandivarez & Martinez. We apply the Anderson-Darling goodness-of-fit test to distinguish between groups according to whether they have Gaussian or non-Gaussian velocity distributions, i.e. whether they are relaxed or not. For these two subsamples, we compute the (0.1)r-band LF as a function of group virial mass and group total luminosity. For massive groups, , we find statistically significant differences between the LF of the two subsamples: the LFs of groups that have Gaussian velocity distributions have a brighter characteristic absolute magnitude (similar to 0.3 mag) and a steeper faint-end slope (similar to 0.25). We detect a similar effect when comparing the LF of bright [M-0.1r(group) - 5log(h) < -23.5] Gaussian and non-Gaussian groups. Our results indicate that, for massive/luminous groups, the dynamical state of the system is directly related to the luminosity of its galaxy members.

PLANEJAMENTO, OBJETIVOS E DEFINIÇÃO DE PADRÕES NA DESCRIÇÃO DOS METADADOS DA COLEÇÃO DA BIBLIOTECA BRASILIANA DIGITAL

O projeto „Por uma Biblioteca Brasiliana Digital‟ é parte integrante do projeto BRASILIANA USP, uma iniciativa da Reitoria da Universidade de São Paulo (USP), que tem por objetivo facultar para a pesquisa a maior Brasiliana custodiada por uma universidade, tornando-a disponível na internet. O trabalho que ora apresentamos é resultado da implantação de um modelo de biblioteca digital que atende aos padrões de interoperabilidade e compartilhamento de informações. Especificamente, apresentaremos os procedimentos e processos de descrição de conteúdos das diversas tipologias documentais (livros, periódicos, mapas, gravuras etc.) e formatos digitais (pdf, mp3, jpeg entre outros), bem como a consolidação de um esquema de metadados gerenciais e administrativos que contemplam as informações e dados produzidos pelo Projeto da Brasiliana Digital.

USO DO DUBLIN CORE NA DESCRIÇÃO DE OBRAS RARAS NA WEB: A COLEÇÃO DA BIBLIOTECA BRASILIANA DIGITAL

Acessível ao público desde junho de 2009, a Biblioteca Brasiliana Digital, da Universidade de São Paulo tem por objetivo facultar para a pesquisa, a maior Brasiliana custodiada por uma universidade. Sua intenção é disponibilizar virtualmente parte do acervo da Universidade oferecendo-se como um instrumento útil e funcional para a pesquisa e o estudo dos temas e cultura brasileiros, além de oferecer um modelo tecnológico de gestão que possa ser difundido a outras coleções, acervos e instituições. Este trabalho apresenta os resultado da implantação de um esquema de metadados baseado no formato Dublin Core, para a descrição de obras raras e especiais na web. Especificamente, apresenta os procedimentos e processos de descrição de conteúdos das diversas tipologias documentais (livros, periódicos, gravuras etc.) e formatos digitais (pdf, jpeg entre outros). Palavras-Chave: Bibliotecas digitais; Metadados; Dublin Core.

Galaxy triplets in Sloan Digital Sky Survey Data Release 7: II. A connection with compact groups?

We analyse a sample of 71 triplets of luminous galaxies derived from the work of O’Mill et al. We compare the properties of triplets and their members with those of control samples of compact groups, the 10 brightest members of rich clusters and galaxies in pairs. The triplets are restricted to have members with spectroscopic redshifts in the range 0.01 ≤ z ≤ 0.14 and absolute r-band luminosities brighter than Mr = −20.5. For these member galaxies, we analyse the stellar mass content, the star formation rates, the Dn(4000) parameter and (Mg − Mr) colour index. Since galaxies in triplets may finally merge in a single system, we analyse different global properties of these systems. We calculate the probability that the properties of galaxies in triplets are strongly correlated. We also study total star formation activity and global colours, and define the triplet compactness as a measure of the percentage of the system total area that is filled by the light of member galaxies. We concentrate in the comparison of our results with those of compact groups to assess how the triplets are a natural extension of these compact systems. Our analysis suggests that triplet galaxy members behave similarly to compact group members and galaxies in rich clusters. We also find that systems comprising three blue, star-forming, young stellar population galaxies (blue triplets) are most probably real systems and not a chance configuration of interloping galaxies. The same holds for triplets composed of three red, non-star-forming galaxies, showing the correlation of galaxy properties in these systems. From the analysis of the triplet as a whole, we conclude that, at a given total stellar mass content, triplets show a total star formation activity and global colours similar to compact groups. However, blue triplets show a high total star formation activity with a lower stellar mass content. From an analysis of the compactness parameter of the systems we find that light is even more concentrated in triplets than in compact groups. We propose that triplets composed of three luminous galaxies, should not be considered as an analogous of galaxy pairs with a third extra member, but rather they are a natural extension of compact groups.

Digitalização e preservação digital: a experiência do Sistema Integrado de Bibliotecas da Universidade de São Paulo (SIBiUSP)

As atividades de digitalização e de preservação digital de conteúdos permeiam as ações das bibliotecas universitárias, quer seja para a preservação de acervos raros e especiais como para garantir o acesso amplo à produção intelectual da Universidade. São descritas as experiências desenvolvidas pelo Sistema Integrado de Bibliotecas da Universidade de São Paulo (SIBiUSP) referente as ações implementadas em âmbito sistêmico, abordando a construção da infraestrutura tecnológica (hardware e software) e as políticas e normas institucionais de digitalização e de preservação digital, apresentando ao final os desenvolvimentos já obtidos com os conteúdos produzidos até o momento.

Digital library of historical cartography: open access to cultural heritage and public good

This paper describes the integration of information between Digital Library of Historical Cartography and Bibliographical Database (DEDALUS), both of the University of São Paulo (USP), to guarantee open, public access by Internet to the maps in the collection and make them available to users everywhere. This digital library was designed by Historical Cartography Studies Laboratory team (LECH/USP), and provides maps images on the Web, of high resolution, as well as such information on these maps as technical-scientific data (projection, scale, coordinates), printing techniques and material support that have made their circulation and cultural consumption possible. The Digital Library of Historical Cartography is accessible not only to the historical cartography researchers, but also to students and the general public. Beyond being a source of information about maps, the Digital Library of Historical Cartography seeks to be interactive, exchanging information and seeking dialogue with different branches of knowledge

BDPI Digital Library of USP in intellectual production

USP INFORMATION MANDATE – Resolution 6444 – Oct. 22th, 2012 Make public and accessible the knowledge generated by research developed at USP, encouraging the sharing, the use and generation of new content; •Preserve institutional memory by storing the full text of Intellectual Production (scientific, academic, artistic and technical); •Increase the impact of the knowledge generated in the university within the scientific community and the general public; •It is suggested to all members of the USP community to publish the results of their research, preferably, in open-access publication outlets and/or repositories and to include the permission to deposit their production in the BDPI system in their publication agreements. •Institutional Repository for Intellectual Production; •Official Source USP Statistical Yearbook.

Pattern-based segmentation of digital documents: model and implementation

This thesis proposes a new document model, according to which any document can be segmented in some independent components and transformed in a pattern-based projection, that only uses a very small set of objects and composition rules. The point is that such a normalized document expresses the same fundamental information of the original one, in a simple, clear and unambiguous way. The central part of my work consists of discussing that model, investigating how a digital document can be segmented, and how a segmented version can be used to implement advanced tools of conversion. I present seven patterns which are versatile enough to capture the most relevant documents’ structures, and whose minimality and rigour make that implementation possible. The abstract model is then instantiated into an actual markup language, called IML. IML is a general and extensible language, which basically adopts an XHTML syntax, able to capture a posteriori the only content of a digital document. It is compared with other languages and proposals, in order to clarify its role and objectives. Finally, I present some systems built upon these ideas. These applications are evaluated in terms of users’ advantages, workflow improvements and impact over the overall quality of the output. In particular, they cover heterogeneous content management processes: from web editing to collaboration (IsaWiki and WikiFactory), from e-learning (IsaLearning) to professional printing (IsaPress).

Dynamic distance analysis : new geometric data structures and algorithms for the real-time calculation of tolerance violating regions in the digital mockup process

In vielen Industriezweigen, zum Beispiel in der Automobilindustrie, werden Digitale Versuchsmodelle (Digital MockUps) eingesetzt, um die Konstruktion und die Funktion eines Produkts am virtuellen Prototypen zu überprüfen. Ein Anwendungsfall ist dabei die Überprüfung von Sicherheitsabständen einzelner Bauteile, die sogenannte Abstandsanalyse. Ingenieure ermitteln dabei für bestimmte Bauteile, ob diese in ihrer Ruhelage sowie während einer Bewegung einen vorgegeben Sicherheitsabstand zu den umgebenden Bauteilen einhalten. Unterschreiten Bauteile den Sicherheitsabstand, so muss deren Form oder Lage verändert werden. Dazu ist es wichtig, die Bereiche der Bauteile, welche den Sicherhabstand verletzen, genau zu kennen. rnrnIn dieser Arbeit präsentieren wir eine Lösung zur Echtzeitberechnung aller den Sicherheitsabstand unterschreitenden Bereiche zwischen zwei geometrischen Objekten. Die Objekte sind dabei jeweils als Menge von Primitiven (z.B. Dreiecken) gegeben. Für jeden Zeitpunkt, in dem eine Transformation auf eines der Objekte angewendet wird, berechnen wir die Menge aller den Sicherheitsabstand unterschreitenden Primitive und bezeichnen diese als die Menge aller toleranzverletzenden Primitive. Wir präsentieren in dieser Arbeit eine ganzheitliche Lösung, welche sich in die folgenden drei großen Themengebiete unterteilen lässt.rnrnIm ersten Teil dieser Arbeit untersuchen wir Algorithmen, die für zwei Dreiecke überprüfen, ob diese toleranzverletzend sind. Hierfür präsentieren wir verschiedene Ansätze für Dreiecks-Dreiecks Toleranztests und zeigen, dass spezielle Toleranztests deutlich performanter sind als bisher verwendete Abstandsberechnungen. Im Fokus unserer Arbeit steht dabei die Entwicklung eines neuartigen Toleranztests, welcher im Dualraum arbeitet. In all unseren Benchmarks zur Berechnung aller toleranzverletzenden Primitive beweist sich unser Ansatz im dualen Raum immer als der Performanteste.rnrnDer zweite Teil dieser Arbeit befasst sich mit Datenstrukturen und Algorithmen zur Echtzeitberechnung aller toleranzverletzenden Primitive zwischen zwei geometrischen Objekten. Wir entwickeln eine kombinierte Datenstruktur, die sich aus einer flachen hierarchischen Datenstruktur und mehreren Uniform Grids zusammensetzt. Um effiziente Laufzeiten zu gewährleisten ist es vor allem wichtig, den geforderten Sicherheitsabstand sinnvoll im Design der Datenstrukturen und der Anfragealgorithmen zu beachten. Wir präsentieren hierzu Lösungen, die die Menge der zu testenden Paare von Primitiven schnell bestimmen. Darüber hinaus entwickeln wir Strategien, wie Primitive als toleranzverletzend erkannt werden können, ohne einen aufwändigen Primitiv-Primitiv Toleranztest zu berechnen. In unseren Benchmarks zeigen wir, dass wir mit unseren Lösungen in der Lage sind, in Echtzeit alle toleranzverletzenden Primitive zwischen zwei komplexen geometrischen Objekten, bestehend aus jeweils vielen hunderttausend Primitiven, zu berechnen. rnrnIm dritten Teil präsentieren wir eine neuartige, speicheroptimierte Datenstruktur zur Verwaltung der Zellinhalte der zuvor verwendeten Uniform Grids. Wir bezeichnen diese Datenstruktur als Shrubs. Bisherige Ansätze zur Speicheroptimierung von Uniform Grids beziehen sich vor allem auf Hashing Methoden. Diese reduzieren aber nicht den Speicherverbrauch der Zellinhalte. In unserem Anwendungsfall haben benachbarte Zellen oft ähnliche Inhalte. Unser Ansatz ist in der Lage, den Speicherbedarf der Zellinhalte eines Uniform Grids, basierend auf den redundanten Zellinhalten, verlustlos auf ein fünftel der bisherigen Größe zu komprimieren und zur Laufzeit zu dekomprimieren.rnrnAbschießend zeigen wir, wie unsere Lösung zur Berechnung aller toleranzverletzenden Primitive Anwendung in der Praxis finden kann. Neben der reinen Abstandsanalyse zeigen wir Anwendungen für verschiedene Problemstellungen der Pfadplanung.

3CAM - A NOVEL TERNARY CONTENT ADDRESSABLE MEMORY USING THREE-VALUED LOGIC

Content Addressable Memory (CAM) is a special type of Complementary Metal-Oxide-Semiconductor (CMOS) storage element that allows for a parallel search operation on a memory stack in addition to the read and write operations yielded by a conventional SRAM storage array. In practice, it is often desirable to be able to store a “don’t care” state for faster searching operation. However, commercially available CAM chips are forced to accomplish this functionality by having to include two binary memory storage elements per CAM cell,which is a waste of precious area and power resources. This research presents a novel CAM circuit that achieves the “don’t care” functionality with a single ternary memory storage element. Using the recent development of multiple-voltage-threshold (MVT) CMOS transistors, the functionality of the proposed circuit is validated and characteristics for performance, power consumption, noise immunity, and silicon area are presented. This workpresents the following contributions to the field of CAM and ternary-valued logic:• We present a novel Simple Ternary Inverter (STI) transistor geometry scheme for achieving ternary-valued functionality in existing SOI-CMOS 0.18µm processes.• We present a novel Ternary Content Addressable Memory based on Three-Valued Logic (3CAM) as a single-storage-element CAM cell with “don’t care” functionality.• We explore the application of macro partitioning schemes to our proposed 3CAM array to observe the benefits and tradeoffs of architecture design in the context of power, delay, and area.

Isospectrality and Heat Content

We present examples of isospectral operators that do not have the same heat content. Several of these examples are planar polygons that are isospectral for the Laplace operator with Dirichlet boundary conditions. These include examples with infinitely many components. Other planar examples have mixed Dirichlet and Neumann boundary conditions. We also consider Schrodinger operators acting in L-2[0,1] with Dirichlet boundary conditions, and show that an abundance of isospectral deformations do not preserve the heat content.

Panel Two: Content Orientation versus Civic Education

Format: 5 minute introduction, 15 min per speaker, 70 minute discussion Moderator: Eric DeMeulenaere, Clark University