Principles versus artifacts in computer science curriculum design

Computer Science is a subject which has difficulty in marketing itself. Further, pinning down a standard curriculum is difficult-there are many preferences which are hard to accommodate. This paper argues the case that part of the problem is the fact that, unlike more established disciplines, the subject does not clearly distinguish the study of principles from the study of artifacts. This point was raised in Curriculum 2001 discussions, and debate needs to start in good time for the next curriculum standard. This paper provides a starting point for debate, by outlining a process by which principles and artifacts may be separated, and presents a sample curriculum to illustrate the possibilities. This sample curriculum has some positive points, though these positive points are incidental to the need to start debating the issue. Other models, with a less rigorous ordering of principles before artifacts, would still gain from making it clearer whether a specific concept was fundamental, or a property of a specific technology. (C) 2003 Elsevier Ltd. All rights reserved.

Segmenting the market of West Australian senior tourists using an artificial neural network

Measuring perceptions of customers can be a major problem for marketers of tourism and travel services. Much of the problem is to determine which attributes carry most weight in the purchasing decision. Older travellers weigh many travel features before making their travel decisions. This paper presents a descriptive analysis of neural network methodology and provides a research technique that assesses the weighting of different attributes and uses an unsupervised neural network model to describe a consumer-product relationship. The development of this rich class of models was inspired by the neural architecture of the human brain. These models mathematically emulate the neurophysical structure and decision making of the human brain, and, from a statistical perspective, are closely related to generalised linear models. Artificial neural networks or neural networks are, however, nonlinear and do not require the same restrictive assumptions about the relationship between the independent variables and dependent variables. Using neural networks is one way to determine what trade-offs older travellers make as they decide their travel plans. The sample of this study is from a syndicated data source of 200 valid cases from Western Australia. From senior groups, active learner, relaxed family body, careful participants and elementary vacation were identified and discussed. (C) 2003 Published by Elsevier Science Ltd.

Product form approximations for highly linear loss networks with trunk reservation

Admission controls, such as trunk reservation, are often used in loss networks to optimise their performance. Since the numerical evaluation of performance measures is complex, much attention has been given to finding approximation methods. The Erlang Fixed-Point (EFP) approximation, which is based on an independent blocking assumption, has been used for networks both with and without controls. Several more elaborate approximation methods which account for dependencies in blocking behaviour have been developed for the uncontrolled setting. This paper is an exploratory investigation of extensions and synthesis of these methods to systems with controls, in particular, trunk reservation. In order to isolate the dependency factor, we restrict our attention to a highly linear network. We will compare the performance of the resulting approximations against the benchmark of the EFP approximation extended to the trunk reservation setting. By doing this, we seek to gain insight into the critical factors in constructing an effective approximation. (C) 2003 Elsevier Ltd. All rights reserved.

Assessing childrens competence in computer interactions: Preliminary reliability and validity of the test of mouse proficiency

The Test of Mouse Proficiency (TOMP) was developed to assist occupational therapists and education professionals assess computer mouse competency skills in children from preschool to upper primary (elementary) school age. The preliminary reliability and validity of TOMP are reported in this paper. Methods used to examine the internal consistency, test-retest reliability, and criterion- and construct-related validity of the test are elaborated. In the continuing process of test refinement, these preliminary studies support to varying degrees the reliability and validity of TOMP. Recommendations for further validation of the assessment are discussed along with indications for potential clinical application.

An electromagnetic-field method modeling of a radial line planar antenna with coupling probes

This communications describes an electromagnetic model of a radial line planar antenna consisting of a radial guide with one central probe and many peripheral probes arranged in concentric circles feeding an array of antenna elements such as patches or wire curls. The model takes into account interactions between the coupling probes while assuming isolation of radiating elements. Based on this model, computer programs are developed to determine equivalent circuit parameters of the feed network and the radiation pattern of the radial line planar antenna. Comparisons are made between the present model and the two-probe model developed earlier by other researchers.

An evaluation of active lecturing in a computer networks course

The article describes an attempt to improve student learning outcomes in a computer networks course by making lectures more active learning experiences. Quick quizzes, group and individual exercises, the review of student questions, as well as multiple breaks, were incorporated into the weekly three-hour lectures. Student responses to the modified lectures was overwhelmingly positive: over 85% of respondents agreed that the lectures aided understanding, with large majorities of the respondents finding the individual activities useful to their learning. Although student examination performance improved over the previous year, performance on an examination question that was designed to examine deep understanding remained unchanged.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

Telehealth responses to bio-terrorism and emerging infections

Emerging infectious diseases, such as severe acute respiratory syndrome (SARS), are of huge economic importance. They are difficult to predict. The World Health Organization has a Global Outbreak Alert and Response Network, which was involved at an early stage in the SARS outbreak in 2003. Three major lessons were learned as a result of the SARS epidemic in 2003, involving communication, evidence-based action and global partnerships. It is proposed that a series of broadband global response networks should be developed. At a technical level the networks are essentially in place, such as the Internet2 global network. Suitable peripheral devices also exist. What has not yet been created is the appropriate software to allow the use of these networks, although a number of commercial products are in the process of development.

GLUT4 recycles via a trans-Golgi network (TGN) subdomain enriched in Syntaxins 6 and 16 but not TGN38: Involvement of an acidic targeting motif

Insulin stimulates glucose transport in fat and muscle cells by triggering exocytosis of the glucose transporter GLUT4. To define the intracellular trafficking of GLUT4, we have studied the internalization of an epitope-tagged version of GLUT4 from the cell surface. GLUT4 rapidly traversed the endosomal system en route to a perinuclear location. This perinuclear GLUT4 compartment did not colocalize with endosomal markers (endosomal antigen I protein, transferrin) or TGN38, but showed significant overlap with the TGN target (t)-soluble N-ethylmaleimide-sensitive factor attachment protein receptors (SNAREs) Syntaxins 6 and 16. These results were confirmed by vesicle immunoisolation. Consistent with a role for Syntaxins 6 and 16 in GLUT4 trafficking we found that their expression was up-regulated significantly during adipocyte differentiation and insulin stimulated their movement to the cell surface. GLUT4 trafficking between endosomes and trans-Golgi network was regulated via an acidic targeting motif in the carboxy terminus of GLUT4, because a mutant lacking this motif was retained in endosomes. We conclude that GLUT4 is rapidly transported from the cell surface to a subdomain of the trans-Golgi network that is enriched in the t-SNAREs Syntaxins 6 and 16 and that an acidic targeting motif in the C-terminal tail of GLUT4 plays an important role in this process.

Learning the dynamics of embedded clauses

Recent work by Siegelmann has shown that the computational power of recurrent neural networks matches that of Turing Machines. One important implication is that complex language classes (infinite languages with embedded clauses) can be represented in neural networks. Proofs are based on a fractal encoding of states to simulate the memory and operations of stacks. In the present work, it is shown that similar stack-like dynamics can be learned in recurrent neural networks from simple sequence prediction tasks. Two main types of network solutions are found and described qualitatively as dynamical systems: damped oscillation and entangled spiraling around fixed points. The potential and limitations of each solution type are established in terms of generalization on two different context-free languages. Both solution types constitute novel stack implementations - generally in line with Siegelmann's theoretical work - which supply insights into how embedded structures of languages can be handled in analog hardware.

GRIP domain-mediated targeting of two new coiled-coil proteins, GCC88 and GCC185, to subcompartments of the trans-Golgi network

The GRIP domain is a targeting sequence found in a family of coiled-coil peripheral Golgi proteins. Previously we demonstrated that the GRIP domain of p230/golgin245 is specifically recruited to tubulovesicular structures of the traps-Golgi network (TGN). Here we have characterized two novel Golgi proteins with functional GRIP domains, designated GCC88 and GCC185. GCC88 cDNA encodes a protein of 88 kDa, and GCC185 cDNA encodes a protein of 185 kDa. Both molecules are brefeldin A-sensitive peripheral membrane proteins and are predicted to have extensive coiled-coil regions with the GRIP domain at the C terminus. By immunofluorescence and immunoelectron microscopy GCC88 and GCC185, and the GRIP protein golgin97, are all localized to the TGN of Hela cells. Overexpression of full-length GCC88 leads to the formation of large electron dense structures that extend from the traps-Golgi. These de novo structures contain GCC88 and co-stain for the TGN markers syntaxin 6 and TGN38 but not for alpha2,6-sialyltransferase, beta-COP, or cis-Golgi GM130. The formation of these abnormal structures requires the N-terminal domain of GCC88. TGN38, which recycles between the TGN and plasma membrane, was transported into and out of the GCC88 decorated structures. These data introduce two new GRIP domain proteins and implicate a role for GCC88 in the organization of a specific TGN subcompartment involved with membrane transport.

GAIP participates in budding of membrane carriers at the trans-Golgi network

Galpha interacting protein (GAIP) is a regulator of G protein signaling protein that associates dynamically with vesicles and has been implicated in membrane trafficking, although its specific role is not yet known. Using an in vitro budding assay, we show that GAIP is recruited to a specific population of trans-Golgi network-derived vesicles and that these are distinct from coatomer or clathrin-coated vesicles. A truncation mutant (NT-GAIP) encoding only the N-terminal half of GAIP is recruited to trans -Golgi network membranes during the formation of vesicle carriers. Overexpression of NT-GAIP induces the formation of long, coated tubules, which are stabilized by microtubules. Results from the budding assay and from imaging in live cells show that these tubules remain attached to the Golgi stack rather than being released as carrier vesicles. NT-GAIP expression blocks membrane budding and results in the accumulation of tubular carrier intermediates. NT-GAIP-decorated tubules are competent to load vesicular stomatitis virus protein G-green fluorescent protein as post-Golgi, exocytic cargo and in cells expressing NT-GAIP there is reduced surface delivery of vesicular stomatitis virus protein G-green fluorescent protein. We conclude that GAIP functions as an essential part of the membrane budding machinery for a subset of post-Golgi exocytic carriers derived from the trans-Golgi network.

A reduced load approximation accounting for link interactions in a loss network

This paper is concerned with evaluating the performance of loss networks. Accurate determination of loss network performance can assist in the design and dimen- sioning of telecommunications networks. However, exact determination can be difficult and generally cannot be done in reasonable time. For these reasons there is much interest in developing fast and accurate approximations. We develop a reduced load approximation that improves on the famous Erlang fixed point approximation (EFPA) in a variety of circumstances. We illustrate our results with reference to a range of networks for which the EFPA may be expected to perform badly.