Sintaxe e semântica de registros bibliográficos: princípios para a conversão de registros analógicos para o formato MARC21 bibliográfico: Scan for MARC

The research presents as its central theme the study of the bibliographic record conversion process. The object of study is framed by an understanding of analogic bibliographic record conversion to the Bibliograhpic MARC21 format, based on a syntactic and semantic analysis of records described according to descriptive metadata structure standards and content standards. The objective of this research the objective is to develop a theoretical-conceptual model of syntactic and semantic of bibliographic records, from Linguistic studies of Saussure and Hjelmslev of manifestations of human language, which subsidizes the development of a computacional interpreter, focused to the conversion of bibliographic records to MARC21 Bibliographic Format, which can be confirmed both the semantic value of the informational resource represented as the reliability of the representation. Given the aforementioned objectives, the methodological trajectory of the research is based on the qualitative approach, of an exploratory, descriptive and experimental nature, and with recourse to the literature. Contributions on the theoretical plane can be envisaged regarding the development of questions inherent to the syntactic and semantic aspects of bibliographic records, and by involving, at the same time, interdisciplinarity between Information Science, Computer Science and Linguistics. Contributions to the practical field are identified by the fact the study covers the development of the Scan for MARC, a computational interpreter that can be adopted by any institution that wishes to use the conversion procedure for bibliographic record databases to the MARC21 Bibliographic Format from description and visualization schemes of bibliographic records (AACR2r and ISBD), an aspect of the research which is considered innovative.

Acessibilidade em Ambientes Informacionais Digitais

The current nature of World Wide Web (Web), which highlights the collaborative participation of users in some digital information environments, lead to development of guidelines with a focus on Inclusive Digital Information Architecture for a different audiences in multiples informational ambiences. This research proposes guidelines for a inclusive digital information environment, aiming to identify the elements of accessibility that allow the promotion of inclusion digital information, in order to highlight the references of the Architecture of Digital Information, the international recommendations and the structures representation of information (specially accessibility attributes), with the look of Information Science and New Technologies of Information and Communication. The thesis is as to the need to develop methodologies with guidelines that contemplate the elements of digital accessibility focused on the task of the user. The research problem is that actual methodologies and recommendations used for the development of digital information environments do not cover all the elements of accessibility with a focus on user needs. The proposition is to present, through a methodological approach (exploratory and descriptive), a theoretical-methodological proposal to promote elements of digital accessibility to the development of digital information environments, for users with or without special needs. The overall objective of this study is to contribute to the development of inclusive digital information environments, in perspective of union of theories, recommendations and technologies for the development of digital accessibility guidelines. In a theoretical dimension, the research covers a critical review of the specialized literature in the areas of Information Science and Computer Science and, in the applied part, the analysis and development of a proposal of guidelines for the architecture of a digital information environment with accessibility.

Um estudo sobre a equação de Schrödinger biharmônica

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Informática na Educação de jovens e adultos: Análise de um Programa de Intervenção a favor da inclusão social e digital

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Estudos teóricos e numéricos de escoamentos com escorregamento

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

Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design

The design of a network is a solution to several engineering and science problems. Several network design problems are known to be NP-hard, and population-based metaheuristics like evolutionary algorithms (EAs) have been largely investigated for such problems. Such optimization methods simultaneously generate a large number of potential solutions to investigate the search space in breadth and, consequently, to avoid local optima. Obtaining a potential solution usually involves the construction and maintenance of several spanning trees, or more generally, spanning forests. To efficiently explore the search space, special data structures have been developed to provide operations that manipulate a set of spanning trees (population). For a tree with n nodes, the most efficient data structures available in the literature require time O(n) to generate a new spanning tree that modifies an existing one and to store the new solution. We propose a new data structure, called node-depth-degree representation (NDDR), and we demonstrate that using this encoding, generating a new spanning forest requires average time O(root n). Experiments with an EA based on NDDR applied to large-scale instances of the degree-constrained minimum spanning tree problem have shown that the implementation adds small constants and lower order terms to the theoretical bound.

Design of a Comb Generator for High Capacity Coherent-WDM Systems

This paper presents a theoretical model developed for estimating the power, the optical signal to noise ratio and the number of generated carriers in a comb generator, having as a reference the minimum optical signal do noise ratio at the receiver input, for a given fiber link. Based on the recirculating frequency shifting technique, the generator relies on the use of coherent and orthogonal multi-carriers (Coherent-WDM) that makes use of a single laser source (seed) for feeding high capacity (above 100 Gb/s) systems. The theoretical model has been validated by an experimental demonstration, where 23 comb lines with an optical signal to noise ratio ranging from 25 to 33 dB, in a spectral window of similar to 3.5 nm, are obtained.

Riverbed: A Novel User-Steered Image Segmentation Method Based on Optimum Boundary Tracking

This paper presents an optimum user-steered boundary tracking approach for image segmentation, which simulates the behavior of water flowing through a riverbed. The riverbed approach was devised using the image foresting transform with a never-exploited connectivity function. We analyze its properties in the derived image graphs and discuss its theoretical relation with other popular methods such as live wire and graph cuts. Several experiments show that riverbed can significantly reduce the number of user interactions (anchor points), as compared to live wire for objects with complex shapes. This paper also includes a discussion about how to combine different methods in order to take advantage of their complementary strengths.

Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.

First- and second-row transition metal oxa-aza macrocyclic complexes: a DFT study of an octahedral conformation

A theoretical study of structures of the 1,7,1 l,17-tetraoxa-2,6,12,16-tetraaza-cycloeicosane ligand ([20]AneN(4)O(4)) coordinated to Fe2+, Co2+, Ni2+, Ru2+, Rh2+, and Pd2+ transition metals ions was carried out with the DFT/B3LYP method. Complexes were fully optimized in C-s symmetry with the metal ions coordinated either to nitrogen (1a) or oxygen atoms (1b). For all the cases performed in this work, 1a was always more stable than 1b. Considering each row it is possible to see that the binding energy increases with the atomic number. The M2+ cation binding energies increase in the following order: Fe2+ < Ru2+ < Co2+ < Ni2+ < Rh2+ < Pd2+. In addition, it was observed the preference of Pd2+ and Rh2+ complexes for a tetrahedral arrangement, while Fe2+, Ru2+, Co2+, Ni2+ complexes had a preference for the octahedral arrangement. From the orbital representation results, it was seen that 1b unsymmetrical orbitals may influence the susceptibility over metal ions orientation toward heteroatoms orbitals.

Network-based stochastic semisupervised learning

Semisupervised learning is a machine learning approach that is able to employ both labeled and unlabeled samples in the training process. In this paper, we propose a semisupervised data classification model based on a combined random-preferential walk of particles in a network (graph) constructed from the input dataset. The particles of the same class cooperate among themselves, while the particles of different classes compete with each other to propagate class labels to the whole network. A rigorous model definition is provided via a nonlinear stochastic dynamical system and a mathematical analysis of its behavior is carried out. A numerical validation presented in this paper confirms the theoretical predictions. An interesting feature brought by the competitive-cooperative mechanism is that the proposed model can achieve good classification rates while exhibiting low computational complexity order in comparison to other network-based semisupervised algorithms. Computer simulations conducted on synthetic and real-world datasets reveal the effectiveness of the model.

On the impact of disproportional samples in credit scoring models: An application to a Brazilian bank data

Statistical methods have been widely employed to assess the capabilities of credit scoring classification models in order to reduce the risk of wrong decisions when granting credit facilities to clients. The predictive quality of a classification model can be evaluated based on measures such as sensitivity, specificity, predictive values, accuracy, correlation coefficients and information theoretical measures, such as relative entropy and mutual information. In this paper we analyze the performance of a naive logistic regression model (Hosmer & Lemeshow, 1989) and a logistic regression with state-dependent sample selection model (Cramer, 2004) applied to simulated data. Also, as a case study, the methodology is illustrated on a data set extracted from a Brazilian bank portfolio. Our simulation results so far revealed that there is no statistically significant difference in terms of predictive capacity between the naive logistic regression models and the logistic regression with state-dependent sample selection models. However, there is strong difference between the distributions of the estimated default probabilities from these two statistical modeling techniques, with the naive logistic regression models always underestimating such probabilities, particularly in the presence of balanced samples. (C) 2012 Elsevier Ltd. All rights reserved.

Intrinsic Order and Hamming Weight

[EN]The intrinsic order is a partial order relation defined on the set {0, 1} n of all binary n-tuples. This ordering enables one to automatically compare binary n-tuple probabilities without computing them, just looking at the relative positions of their 0s & 1s. In this paper, new relations between the intrinsic ordering and the Hamming weight (i.e., the number of 1-bits in a binary n-tuple) are derived. All theoretical results are rigorously proved and illustrated through the intrinsic order graph…

Useful computer vision techniques for human-robot interaction

[ES]This paper describes some simple but useful computer vision techniques for human-robot interaction. First, an omnidirectional camera setting is described that can detect people in the surroundings of the robot, giving their angular positions and a rough estimate of the distance. The device can be easily built with inexpensive components. Second, we comment on a color-based face detection technique that can alleviate skin-color false positives. Third, a simple head nod and shake detector is described, suitable for detecting affirmative/negative, approval/dissaproval, understanding/disbelief head gestures.

Expressiveness in biologically inspired languages

A very recent and exciting new area of research is the application of Concurrency Theory tools to formalize and analyze biological systems and one of the most promising approach comes from the process algebras (process calculi). A process calculus is a formal language that allows to describe concurrent systems and comes with well-established techniques for quantitative and qualitative analysis. Biological systems can be regarded as concurrent systems and therefore modeled by means of process calculi. In this thesis we focus on the process calculi approach to the modeling of biological systems and investigate, mostly from a theoretical point of view, several promising bio-inspired formalisms: Brane Calculi and k-calculus family. We provide several expressiveness results mostly by means of comparisons between calculi. We provide a lower bound to the computational power of the non Turing complete MDB Brane Calculi by showing an encoding of a simple P-System into MDB. We address the issue of local implementation within the k-calculus family: whether n-way rewrites can be simulated by binary interactions only. A solution introducing divergence is provided and we prove a deterministic solution preserving the termination property is not possible. We use the symmetric leader election problem to test synchronization capabilities within the k-calculus family. Several fragments of the original k-calculus are considered and we prove an impossibility result about encoding n-way synchronization into (n-1)-way synchronization. A similar impossibility result is obtained in a pure computer science context. We introduce CCSn, an extension of CCS with multiple input prefixes and show, using the dining philosophers problem, that there is no reasonable encoding of CCS(n+1) into CCSn.