Uso da internet em ambiente acadêmico :estudo com docentes em institruição de educação tecnológica no Brasi

The last decade, characterized by the vertiginous growth of the computers worldwide net, brought radical changes in the use of the information and communication. Internet s use at business world has been largely studied; however, few are the researches about the academic use of this technology, mainly if we take into consideration institutions of technologic education. In this context, this research made an analysis of internet s use in a technologic education institution in Brazil, analyzing, in particular, the Centro Federal de Educação Tecnológica do Rio Grande do Norte CEFET/RN for that standard use of this Information Technology (IT) tools and, at the same time, studying the determinant factors of this use. To reach the considered objectives, a survey research was effected, be given data collected daily through the research s questionnaire application to 150 teachers who answered a set of closed and scaled questions. The quantitative data were qualitatively analyzed, arriving a some significant results related to the standard use and the factors that influenced in the use of these Internet technologies, like: the age scale, the exposition s to the computer level, the area of academic graduation, the area of knowledge where acts and the title, exert significant influence in the academic use of Internet between the professors

Automatic synthesis of VHDL Hardware Components from IOPT Petri Net models

Conferência: 39th Annual Conference of the IEEE Industrial-Electronics-Society (IECON), Vienna, Austria, Nov 10-14, 2013

Intra-organizational use of communication tools in value nets - Cases from the ICT industry

Tutkimuksen tavoitteena oli selvittää sisäisen kommunikoinnin tilannetta case-yrityksissä. Yritykset kuuluvat kahteen case-arvoverkostoon, jotka toimivat informaatio- ja kommunikaatioteknologian alalla. Sisäinen kommunikointi valittiin tutkimusalueeksi, koska se muodostaa perustan ulkoiselle, yritysten väliselle kommunikoinnille. Tutkimuksen painopiste oli web-pohjaisessa kommunikoinnissa ja webin ominaisuuksissa arvoverkoston näkökulmasta. Tutkimusprosessissa käytettiin sekä kvalitatiivisia että kvantitatiivisia menetelmiä. Tutkimuksen kvantitatiivinen osa toteutettiin web-kyselynä, jonka tulokset osoittivat, että case-yritysten sisäinen kommunikointi perustuu pääasiassa perinteisten kommunikointivälineiden käyttöön. Toisin sanoen, webin hyödyntäminen on vähäistä, mihin vaikuttavat monet eri tekijät. Webissä on kuitenkin useita ominaisuuksia, jotka parantavat kommunikointia arvoverkostossa ja siksi nämä web-pohjaiset välineet tulisi huomioida, kun suunnitellaan yleistä kommunikointijärjestelmää. Tutkimuksen teoreettisessa osassa määriteltiin vuorovaikutteisuus-ominaisuuteen perustuva kommunikointivälineiden luokittelu. Tämän lisäksi määriteltiin myös arvoverkoston käsite. Empiirinen osa koostui web-kyselyn toteutuksen ja tulosten raportoinnista, jonka jälkeen yhteenvetokappale koosti merkittävimmät havainnot sekä mahdolliset jatkotutkimusaiheet.

Active networks: an evolution of the internet

Active Networks can be seen as an evolution of the classical model of packet-switched networks. The traditional and ”passive” network model is based on a static definition of the network node behaviour. Active Networks propose an “active” model where the intermediate nodes (switches and routers) can load and execute user code contained in the data units (packets). Active Networks are a programmable network model, where bandwidth and computation are both considered shared network resources. This approach opens up new interesting research fields. This paper gives a short introduction of Active Networks, discusses the advantages they introduce and presents the research advances in this field.

Connectivity measures for internet topologies on the level of autonomous systems

Classical measures of network connectivity are the number of disjoint paths between a pair of nodes and the size of a minimum cut. For standard graphs, these measures can be computed efficiently using network flow techniques. However, in the Internet on the level of autonomous systems (ASs), referred to as AS-level Internet, routing policies impose restrictions on the paths that traffic can take in the network. These restrictions can be captured by the valley-free path model, which assumes a special directed graph model in which edge types represent relationships between ASs. We consider the adaptation of the classical connectivity measures to the valley-free path model, where it is -hard to compute them. Our first main contribution consists of presenting algorithms for the computation of disjoint paths, and minimum cuts, in the valley-free path model. These algorithms are useful for ASs that want to evaluate different options for selecting upstream providers to improve the robustness of their connection to the Internet. Our second main contribution is an experimental evaluation of our algorithms on four types of directed graph models of the AS-level Internet produced by different inference algorithms. Most importantly, the evaluation shows that our algorithms are able to compute optimal solutions to instances of realistic size of the connectivity problems in the valley-free path model in reasonable time. Furthermore, our experimental results provide information about the characteristics of the directed graph models of the AS-level Internet produced by different inference algorithms. It turns out that (i) we can quantify the difference between the undirected AS-level topology and the directed graph models with respect to fundamental connectivity measures, and (ii) the different inference algorithms yield topologies that are similar with respect to connectivity and are different with respect to the types of paths that exist between pairs of ASs.

Closed-loop feedback computation model of dynamical reputation based on the local trust evaluation in business-to-consumer e-commerce

Trust and reputation are important factors that influence the success of both traditional transactions in physical social networks and modern e-commerce in virtual Internet environments. It is difficult to define the concept of trust and quantify it because trust has both subjective and objective characteristics at the same time. A well-reported issue with reputation management system in business-to-consumer (BtoC) e-commerce is the “all good reputation” problem. In order to deal with the confusion, a new computational model of reputation is proposed in this paper. The ratings of each customer are set as basic trust score events. In addition, the time series of massive ratings are aggregated to formulate the sellers’ local temporal trust scores by Beta distribution. A logical model of trust and reputation is established based on the analysis of the dynamical relationship between trust and reputation. As for single goods with repeat transactions, an iterative mathematical model of trust and reputation is established with a closed-loop feedback mechanism. Numerical experiments on repeated transactions recorded over a period of 24 months are performed. The experimental results show that the proposed method plays guiding roles for both theoretical research into trust and reputation and the practical design of reputation systems in BtoC e-commerce.

Dynamical trust and reputation computation model for B2C E-Commerce

Trust is one of the most important factors that influence the successful application of network service environments, such as e-commerce, wireless sensor networks, and online social networks. Computation models associated with trust and reputation have been paid special attention in both computer societies and service science in recent years. In this paper, a dynamical computation model of reputation for B2C e-commerce is proposed. Firstly, conceptions associated with trust and reputation are introduced, and the mathematical formula of trust for B2C e-commerce is given. Then a dynamical computation model of reputation is further proposed based on the conception of trust and the relationship between trust and reputation. In the proposed model, classical varying processes of reputation of B2C e-commerce are discussed. Furthermore, the iterative trust and reputation computation models are formulated via a set of difference equations based on the closed-loop feedback mechanism. Finally, a group of numerical simulation experiments are performed to illustrate the proposed model of trust and reputation. Experimental results show that the proposed model is effective in simulating the dynamical processes of trust and reputation for B2C e-commerce.

Internet e direito autoral: o ciberespaço e as mudanças na distribuição da cultura

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

Artificial Neural Nets with Interaction of Afferents

The aim is to obtain computationally more powerful, neuro physiologically founded, artificial neurons and neural nets. Artificial Neural Nets (ANN) of the Perceptron type evolved from the original proposal by McCulloch an Pitts classical paper [1]. Essentially, they keep the computing structure of a linear machine followed by a non linear operation. The McCulloch-Pitts formal neuron (which was never considered by the author’s to be models of real neurons) consists of the simplest case of a linear computation of the inputs followed by a threshold. Networks of one layer cannot compute anylogical function of the inputs, but only those which are linearly separable. Thus, the simple exclusive OR (contrast detector) function of two inputs requires two layers of formal neurons

Dendritic-Like Reliable Computation in Artificial Neurons

Dendritic computation is a term that has been in neuro physiological research for a long time [1]. It is still controversial and far for been clarified within the concepts of both computation and neurophysiology [2], [3]. In any case, it hasnot been integrated neither in a formal computational scheme or structure, nor into formulations of artificial neural nets. Our objective here is to formulate a type of distributed computation that resembles dendritic trees, in such a way that it shows the advantages of neural network distributed computation, mostly the reliability that is shown under the existence of holes (scotomas) in the computing net, without ?blind spots?.

Distributed, layered and reliable computing nets to represent neuronal receptive fields

Abstract. Receptive fields of retinal and other sensory neurons show a large variety of spatiotemporal linear and non linear types of responses to local stimuli. In visual neurons, these responses present either asymmetric sensitive zones or center-surround organization. In most cases, the nature of the responses suggests the existence of a kind of distributed computation prior to the integration by the final cell which is evidently supported by the anatomy. We describe a new kind of discrete and continuous filters to model the kind of computations taking place in the receptive fields of retinal cells. To show their performance in the analysis of diferent non-trivial neuron-like structures, we use a computer tool specifically programmed by the authors to that efect. This tool is also extended to study the efect of lesions on the whole performance of our model nets.

Multiple precision computation of Legendre functions.

"C00-1469-0167."

Speeding up computation in two-dimensional iterative arrays /

"UILU-ENG 80 1720."-- Cover, p. 1.

Sociopathic knowledge bases : correct knowledge can be harmful even given unlimited computation /

"College of Engineering, UILU-ENG-89-1757."

Analog computation with random pulse sequences.

Vita.