Sciweavers

JNCA
2008
117views more  JNCA 2008»
13 years 4 months ago
Assessing readiness of IP networks to support desktop videoconferencing using OPNET
OPNET is a powerful network design and simulation tool that has gained popularity in industry and academia. However, there exists no known simulation approach on how to deploy a p...
Khaled Salah, Prasad Calyam, M. I. Buhari
JNCA
2008
104views more  JNCA 2008»
13 years 4 months ago
Computing in social networks with relationship algebra
Communities are the latest phenomena on the Internet. At the heart of each community lies a social network. In this paper, we show a generalized framework to understand and reason...
Javed I. Khan, Sajid S. Shaikh
JMIV
2008
92views more  JMIV 2008»
13 years 4 months ago
The Classification of Digital Covering Spaces
Abstract. In this paper we classify digital covering spaces using the conjugacy class corresponding to a digital covering space.
Laurence Boxer, Ismet Karaca
JKM
2008
161views more  JKM 2008»
13 years 4 months ago
A semantic web architecture for integrating competence management and learning paths
Purpose
Fotis Draganidis, Paraskevi Chamopoulou, Gregoris ...
JKM
2008
90views more  JKM 2008»
13 years 4 months ago
Learning processes and processing learning: from organizational needs to learning designs
Purpose
Ambjörn Naeve, Miguel-Ángel Sicilia, M...
CRYPTOLOGIA
2007
366views more  CRYPTOLOGIA 2007»
13 years 4 months ago
A Simplified Idea Algorithm
Abstract. In this paper, a simplified version of the International Data Encryption Algorithm (IDEA) is described. This simplified version, like simplified versions of DES [8] [1...
Nick Hoffman
CORR
2007
Springer
79views Education» more  CORR 2007»
13 years 4 months ago
L'analyse de l'expertise du point de vue de l'ergonomie cognitive
This paper presents a review of methods for collecting and analysing data on complex activities. Starting with methods developed for design, we examine the possibility to transpos...
Willemien Visser
JCT
2008
70views more  JCT 2008»
13 years 4 months ago
Connectivity keeping edges in graphs with large minimum degree
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G - v is still k-connec...
Shinya Fujita, Ken-ichi Kawarabayashi
JCP
2008
126views more  JCP 2008»
13 years 4 months ago
Extension Information-Knowledge-Strategy System for Semantic Interoperability
This paper discusses the issue of information interoperability. In view of the problems that it is difficult to solve the semantic conflicts in information interoperability, the pa...
Li Weihua, Yang Chunyan