13 resultados para Knowledge maps
em Repositório Científico do Instituto Politécnico de Lisboa - Portugal
Resumo:
Develop a new model of Absorptive Capacity taking into account two variables namely Learning and knowledge to explain how companies transform information into knowledge
Resumo:
Today, information overload and the lack of systems that enable locating employees with the right knowledge or skills are common challenges that large organisations face. This makes knowledge workers to re-invent the wheel and have problems to retrieve information from both internal and external resources. In addition, information is dynamically changing and ownership of data is moving from corporations to the individuals. However, there is a set of web based tools that may cause a major progress in the way people collaborate and share their knowledge. This article aims to analyse the impact of ‘Web 2.0’ on organisational knowledge strategies. A comprehensive literature review was done to present the academic background followed by a review of current ‘Web 2.0’ technologies and assessment of their strengths and weaknesses. As the framework of this study is oriented to business applications, the characteristics of the involved segments and tools were reviewed from an organisational point of view. Moreover, the ‘Enterprise 2.0’ paradigm does not only imply tools but also changes the way people collaborate, the way the work is done (processes) and finally impacts on other technologies. Finally, gaps in the literature in this area are outlined.
Resumo:
In this paper is presented a relationship between the synchronization and the topological entropy. We obtain the values for the coupling parameter, in terms of the topological entropy, to achieve synchronization of two unidirectional and bidirectional coupled piecewise linear maps. In addition, we prove a result that relates the synchronizability of two m-modal maps with the synchronizability of two conjugated piecewise linear maps. An application to the unidirectional and bidirectional coupled identical chaotic Duffing equations is given. We discuss the complete synchronization of two identical double-well Duffing oscillators, from the point of view of symbolic dynamics. Working with Poincare cross-sections and the return maps associated, the synchronization of the two oscillators, in terms of the coupling strength, is characterized.
Resumo:
We describe the Lorenz links generated by renormalizable Lorenz maps with reducible kneading invariant (K(f)(-), = K(f)(+)) = (X, Y) * (S, W) in terms of the links corresponding to each factor. This gives one new kind of operation that permits us to generate new knots and links from the ones corresponding to the factors of the *-product. Using this result we obtain explicit formulas for the genus and the braid index of this renormalizable Lorenz knots and links. Then we obtain explicit formulas for sequences of these invariants, associated to sequences of renormalizable Lorenz maps with kneading invariant (X, Y) * (S,W)*(n), concluding that both grow exponentially. This is specially relevant, since it is known that topological entropy is constant on the archipelagoes of renormalization.
Resumo:
This work describes a methodology to extract symbolic rules from trained neural networks. In our approach, patterns on the network are codified using formulas on a Lukasiewicz logic. For this we take advantage of the fact that every connective in this multi-valued logic can be evaluated by a neuron in an artificial network having, by activation function the identity truncated to zero and one. This fact simplifies symbolic rule extraction and allows the easy injection of formulas into a network architecture. We trained this type of neural network using a back-propagation algorithm based on Levenderg-Marquardt algorithm, where in each learning iteration, we restricted the knowledge dissemination in the network structure. This makes the descriptive power of produced neural networks similar to the descriptive power of Lukasiewicz logic language, minimizing the information loss on the translation between connectionist and symbolic structures. To avoid redundance on the generated network, the method simplifies them in a pruning phase, using the "Optimal Brain Surgeon" algorithm. We tested this method on the task of finding the formula used on the generation of a given truth table. For real data tests, we selected the Mushrooms data set, available on the UCI Machine Learning Repository.
Resumo:
Microarray allow to monitoring simultaneously thousands of genes, where the abundance of the transcripts under a same experimental condition at the same time can be quantified. Among various available array technologies, double channel cDNA microarray experiments have arisen in numerous technical protocols associated to genomic studies, which is the focus of this work. Microarray experiments involve many steps and each one can affect the quality of raw data. Background correction and normalization are preprocessing techniques to clean and correct the raw data when undesirable fluctuations arise from technical factors. Several recent studies showed that there is no preprocessing strategy that outperforms others in all circumstances and thus it seems difficult to provide general recommendations. In this work, it is proposed to use exploratory techniques to visualize the effects of preprocessing methods on statistical analysis of cancer two-channel microarray data sets, where the cancer types (classes) are known. For selecting differential expressed genes the arrow plot was used and the graph of profiles resultant from the correspondence analysis for visualizing the results. It was used 6 background methods and 6 normalization methods, performing 36 pre-processing methods and it was analyzed in a published cDNA microarray database (Liver) available at http://genome-www5.stanford.edu/ which microarrays were already classified by cancer type. All statistical analyses were performed using the R statistical software.
Resumo:
This paper is devoted to the synchronization of a dynamical system defined by two different coupling versions of two identical piecewise linear bimodal maps. We consider both local and global studies, using different tools as natural transversal Lyapunov exponent, Lyapunov functions, eigenvalues and eigenvectors and numerical simulations. We obtain theoretical results for the existence of synchronization on coupling parameter range. We characterize the synchronization manifold as an attractor and measure the synchronization speed. In one coupling version, we give a necessary and sufficient condition for the synchronization. We study the basins of synchronization and show that, depending upon the type of coupling, they can have very different shapes and are not necessarily constituted by the whole phase space; in some cases, they can be riddled.
Resumo:
Relatório de Estágio apresentado à Escola Superior de Educação de Lisboa para obtenção de grau de mestre em Ensino de 1.º e 2.º Ciclos do Ensino Básico
Resumo:
Relatório Final de Estágio apresentado à Escola Superior de Educação de Lisboa para obtenção do grau de mestre em Ensino do 1.º e do 2.º Ciclo do Ensino Básico
Resumo:
The study of transient dynamical phenomena near bifurcation thresholds has attracted the interest of many researchers due to the relevance of bifurcations in different physical or biological systems. In the context of saddle-node bifurcations, where two or more fixed points collide annihilating each other, it is known that the dynamics can suffer the so-called delayed transition. This phenomenon emerges when the system spends a lot of time before reaching the remaining stable equilibrium, found after the bifurcation, because of the presence of a saddle-remnant in phase space. Some works have analytically tackled this phenomenon, especially in time-continuous dynamical systems, showing that the time delay, tau, scales according to an inverse square-root power law, tau similar to (mu-mu (c) )(-1/2), as the bifurcation parameter mu, is driven further away from its critical value, mu (c) . In this work, we first characterize analytically this scaling law using complex variable techniques for a family of one-dimensional maps, called the normal form for the saddle-node bifurcation. We then apply our general analytic results to a single-species ecological model with harvesting given by a unimodal map, characterizing the delayed transition and the scaling law arising due to the constant of harvesting. For both analyzed systems, we show that the numerical results are in perfect agreement with the analytical solutions we are providing. The procedure presented in this work can be used to characterize the scaling laws of one-dimensional discrete dynamical systems with saddle-node bifurcations.
Resumo:
Relatório de investigação apresentado à Escola Superior de Educação de Lisboa para obtenção de grau de mestre em Ensino de 1º e 2º ciclo do Ensino Básico
Resumo:
In this paper, we introduce an innovative course in the Portuguese Context, the Master's Course in “Integrated Didactics in Mother Tongue, Maths, Natural and Social Sciences”, taking place at the Lisbon School of Education and discussing in particular the results of the evaluation made by the students who attended the Curricular Unit - Integrated Didactics (CU-ID). This course was designed for in-service teachers of the first six years of schooling and intends to improve connections between different curriculum areas. In this paper, we start to present a few general ideas about curriculum development; to discuss the concept of integration; to present the principles and objectives of the course created as well as its structure; to describe the methodology used in the evaluation process of the above mentioned CU-ID. The results allow us to state that the students recognized, as positive features of the CU-ID, the presence in all sessions of two teachers simultaneously from different scientific areas, as well as invitations issued to specialists on the subject of integration and to other teachers that already promote forms of integration in schools. As negative features, students noted a lack of integrated purpose, applying simultaneously the four scientific areas of the course, and also indicated the need to be familiar with more models of integrated education. Consequently, the suggestions for improvement derived from these negative features. The students also considered that their evaluation process was correct, due to the fact that it was focused on the design of an integrated project for one of the school years already mentioned.
Resumo:
In this paper a new method for self-localization of mobile robots, based on a PCA positioning sensor to operate in unstructured environments, is proposed and experimentally validated. The proposed PCA extension is able to perform the eigenvectors computation from a set of signals corrupted by missing data. The sensor package considered in this work contains a 2D depth sensor pointed upwards to the ceiling, providing depth images with missing data. The positioning sensor obtained is then integrated in a Linear Parameter Varying mobile robot model to obtain a self-localization system, based on linear Kalman filters, with globally stable position error estimates. A study consisting in adding synthetic random corrupted data to the captured depth images revealed that this extended PCA technique is able to reconstruct the signals, with improved accuracy. The self-localization system obtained is assessed in unstructured environments and the methodologies are validated even in the case of varying illumination conditions.