CPO - Carteira de projetos online.

2008

AINFO 2001: manual online.

Conhecendo o AINFO 2001. Gerenciador de dados AINFO 2001. Operando o AINFO 2001. Atualizando as bases de dados. Sobre as bases de dados. Gerando e imprimindo relatórios. Sobre o SIR - Recuperação da Informação. Descrição dos campos. Descrição dos campos. Descrição dos relatórios.

Reconceptualising moderation in asynchronous online discussions using grounded theory.

This paper reports a grounded theory study of e-moderation of asynchronous online discussions, to explore the processes by which tutors in higher education decide when and how to e-moderate. It aims to construct a theory of e-moderation based on some key factors which appear to influence e-moderation. It discusses previous research on the definition and practice of e-moderation, and then describes the study, which involved four e-moderators working in two different university contexts. Key themes on e-moderation, which emerged using a grounded theory approach, are discussed. It proposes a paradigm framework for e-moderation and suggests that as a facilitative activity, it should be sufficiently contained within ‘a ring-fenced learning arena’. Factors outwith and inside the ring-fence which appear to influence e-moderation and their implications for future theory development and validation are discussed. Keywords: e-moderation; grounded theory; online learning; asynchronous discussions; ring-fence

Community Councils online: a survey.

A survey of Scottish Community Councils found that only 22% have up-to-date online public presences. Only 4% of Community Councils have easily accessible online planning content. Most Community Councils websites communicate from Community Councils to citizen – only 10% use social media to host online discussion and opinion-gathering. Local Authority-hosted presences guarantee that Community Councils have presence but not that they are up to date. Such presences are also not content-rich. Community Councils’ own volition makes the difference between having no presence at all, mediocre presences and informative, content-rich presences that may serve citizens well. Suggestions to improve matters include broadening the scope of Local Authority-hosted presences and CCs mentoring each other.

Scottish Community Councils online: the 2014 survey.

This document reports the results of a survey, carried out in late spring 2014, of the public web presences of potentially over 1300 Scottish Community Councils (CCs). It follows on from similar survey in summer 2012. The report reviews content-types associated with up-to-date presences and examines Community Councils’ social media use, using three archetypes which may be used to derive models and examples of good practice, and create recommendations for Community Councils and their Local Authorities (LAs). The research found that there has little change overall since 2012, which combined with a high level of churn implies an increasing number of digitally disengaged Community Councils. A good way forward would be for to CCs emulate and adapt the examples of good practice identified, by publishing minutes, news, planning and local area information, limiting publication of other types of content, and using social media to engage with citizens. A number of broader recommendations are made to LAs, including that that they publish CC schemes on their websites, provide training in online methods and work together via their CCLOs and IT teams to support CCs

Local studies collections online: an investigation in Irish public libraries

Barry, L., Tedd, L.A. (2008). Local studies collections online: an investigation in Irish public libraries. Program: electronic library and information systems, 42(2), 163-186.

Who has the Right to Govern Online Activity? A Criminal and Civil Point of View

Kohl, U. (2004). Who has the right to govern online activity? A criminal and civil point of view. International Review of Law, Computers & Technology 18 (3), 387-410 RAE2008

Jurisdiction and the Internet: Regulatory Competence over Online Activity

null RAE2008

Ignorance is no Defence but is Inaccessibility? On the Accessibility of National Laws to Foreign Online Publishers

Kohl, U. (2005). Ignorance is no Defence but is Inaccessibility? On the Accessibility of National Laws to Foreign Online Publishers. Information & Communities Technology Law, 14 (1), 25-41. RAE2008 Information & Communications Technology Law Volume 14, Issue 1, 2005 Special Issue: GATED COMMUNITIES

Modelo de Aceitação da Tecnologia adaptado às compras online

Dissertação apresentada à Universidade Fernando Pessoa como parte dos requisitos de obtenção do grau de Mestre em Ciências da Comunicação, ramo de Marketing e Publicidade

An Online Distributed Algorithm for Inferring Policy Routing Configurations

We present an online distributed algorithm, the Causation Logging Algorithm (CLA), in which Autonomous Systems (ASes) in the Internet individually report route oscillations/flaps they experience to a central Internet Routing Registry (IRR). The IRR aggregates these reports and may observe what we call causation chains where each node on the chain caused a route flap at the next node along the chain. A chain may also have a causation cycle. The type of an observed causation chain/cycle allows the IRR to infer the underlying policy routing configuration (i.e., the system of economic relationships and constraints on route/path preferences). Our algorithm is based on a formal policy routing model that captures the propagation dynamics of route flaps under arbitrary changes in topology or path preferences. We derive invariant properties of causation chains/cycles for ASes which conform to economic relationships based on the popular Gao-Rexford model. The Gao-Rexford model is known to be safe in the sense that the system always converges to a stable set of paths under static conditions. Our CLA algorithm recovers the type/property of an observed causation chain of an underlying system and determines whether it conforms to the safe economic Gao-Rexford model. Causes for nonconformity can be diagnosed by comparing the properties of the causation chains with those predicted from different variants of the Gao-Rexford model.

Online and Offline Character Recognition Using Alignment to Prototypes

Nearest neighbor classifiers are simple to implement, yet they can model complex non-parametric distributions, and provide state-of-the-art recognition accuracy in OCR databases. At the same time, they may be too slow for practical character recognition, especially when they rely on similarity measures that require computationally expensive pairwise alignments between characters. This paper proposes an efficient method for computing an approximate similarity score between two characters based on their exact alignment to a small number of prototypes. The proposed method is applied to both online and offline character recognition, where similarity is based on widely used and computationally expensive alignment methods, i.e., Dynamic Time Warping and the Hungarian method respectively. In both cases significant recognition speedup is obtained at the expense of only a minor increase in recognition error.

An overview of online-research in information systems

As the Internet has changed communication, commerce, and the distribution of information, so it is changing Information Systems Research (ISR). The goal of this paper is to put the topic of application and reliability of online research into the focus of ISR by exploring the extension of online research methods (ORM) into its popular publication outlets. 513 articles from high ranked ISR publication outlets from the last decade have been analyzed using online content analysis. The findings show that in ISR online research methods are applied despite the missing discussion on the validity of the theories and methods that were defined offline within the new environment and the associated challenges.

Matching and sorting in online dating

Using data on user attributes and interactions from an online dating site, we estimate mate preferences, and use the Gale-Shapley algorithm to predict stable matches. The predicted matches are similar to the actual matches achieved by the dating site, and the actual matches are approximately efficient. Out-of-sample predictions of offline matches, i.e., marriages, exhibit assortative mating patterns similar to those observed in actual marriages. Thus, mate preferences, without resort to search frictions, can generate sorting in marriages. However, we underpredict some of the correlation patterns; search frictions may play a role in explaining the discrepancy.