Examining the significance of high-level programming features in source code author classification

The use of Source Code Author Profiles (SCAP) represents a new, highly accurate approach to source code authorship identification that is, unlike previous methods, language independent. While accuracy is clearly a crucial requirement of any author identification method, in cases of litigation regarding authorship, plagiarism, and so on, there is also a need to know why it is claimed that a piece of code is written by a particular author. What is it about that piece of code that suggests a particular author? What features in the code make one author more likely than another? In this study, we describe a means of identifying the high-level features that contribute to source code authorship identification using as a tool the SCAP method. A variety of features are considered for Java and Common Lisp and the importance of each feature in determining authorship is measured through a sequence of experiments in which we remove one feature at a time. The results show that, for these programs, comments, layout features and package-related naming influence classification accuracy whereas user-defined naming, an obvious programmer related feature, does not appear to influence accuracy. A comparison is also made between the relative feature contributions in programs written in the two languages.     

Avoiding semantic and temporal gaps in developing software intensive systems

Development of software intensive systems (systems) in practice involves a series of self-contained phases for the lifecycle of a system. Semantic and temporal gaps, which occur among phases and among developer disciplines within and across phases, hinder the ongoing development of a system because of the interdependencies among phases and among disciplines. Such gaps are magnified among systems that are developed at different times by different development teams, which may limit reuse of artifacts of systems development and interoperability among the systems. This article discusses such gaps and a systems development process for avoiding them.     

Trust in consumer-to-consumer electronic commerce

We developed a model of consumer-to-consumer (C2C) e-commerce trust and tested it. We expected that two influences: internal (natural propensity to trust [NPT] and perception of web site quality [PWSQ]) and external (other's trust of buyers/sellers [OTBS] and third party recognition [TPR]) would affect an individual's trust in C2C e-commerce. However contrary to studies of other types of e-commerce, support was only found for PWSQ and TPR; we therefore discussed possible reasons for this contradiction. Suggestions are made of ways to help e-commerce site developers provide a trustworthy atmosphere and identify trustworthy consumers.     

Performance analysis of an adaptive dynamic grid-based approach to data distribution management

Data distribution management (DDM) plays a key role in traffic control for large-scale distributed simulations. In recent years, several solutions have been devised to make DDM more efficient and adaptive to different traffic conditions. Examples of such systems include the region-based, fixed grid-based, and dynamic grid-based (DGB) schemes, as well as grid-filtered region-based and agent-based DDM schemes. However, less effort has been directed toward improving the processing performance of DDM techniques. This paper presents a novel DDM scheme called the adaptive dynamic grid-based (ADGB) scheme that optimizes DDM time through the analysis of matching performance. ADGB uses an advertising scheme in which information about the target cell involved in the process of matching subscribers to publishers is known in advance. An important concept known as the distribution rate (DR) is devised. The DR represents the relative processing load and communication load generated at each federate. The DR and the matching performance are used as part of the ADGB method to select, throughout the simulation, the devised advertisement scheme that achieves the maximum gain with acceptable network traffic overhead. If we assume the same worst case propagation delays, when the matching probability is high, the performance estimation of ADGB has shown that a maximum efficiency gain of 66% can be achieved over the DGB scheme. The novelty of the ADGB scheme is its focus on improving performance, an important (and often forgotten) goal of DDM strategies.     

A high performance algorithm for static task scheduling in heterogeneous distributed computing systems

Effective task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (HeDCSs). However, finding an effective task schedule in HeDCSs requires the consideration of both the heterogeneity of processors and high interprocessor communication overhead, which results from non-trivial data movement between tasks scheduled on different processors. In this paper, we present a new high-performance scheduling algorithm, called the longest dynamic critical path (LDCP) algorithm, for HeDCSs with a bounded number of processors. The LDCP algorithm is a list-based scheduling algorithm that uses a new attribute to efficiently select tasks for scheduling in HeDCSs. The efficient selection of tasks enables the LDCP algorithm to generate high-quality task schedules in a heterogeneous computing environment. The performance of the LDCP algorithm is compared to two of the best existing scheduling algorithms for HeDCSs: the HEFT and DLS algorithms. The comparison study shows that the LDCP algorithm outperforms the HEFT and DLS algorithms in terms of schedule length and speedup. Moreover, the improvement in performance obtained by the LDCP algorithm over the HEFT and DLS algorithms increases as the inter-task communication cost increases. Therefore, the LDCP algorithm provides a practical solution for scheduling parallel applications with high communication costs in HeDCSs.     

Resource allocation optimization for quantitative service differentiation on server clusters

The goal of service differentiation is to provide different service quality levels to meet changing system configuration and resource availability and to satisfy different requirements and expectations of applications and users. In this paper, we investigate the problem of quantitative service differentiation on cluster-based delay-sensitive servers. The goal is to support a system-wide service quality optimization with respect to resource allocation on a computer system while provisioning proportionality fairness to clients. We first propose and promote a square-root proportional differentiation model. Interestingly, both popular delay factors, queueing delay and slowdown, are reciprocally proportional to the allocated resource usage. We formulate the problem of quantitative service differentiation as a generalized resource allocation optimization towards the minimization of system delay, defined as the sum of weighted delay of client requests. We prove that the optimization-based resource allocation scheme essentially provides square-root proportional service differentiation to clients. We then study the problem of service differentiation provisioning from an important relative performance metric, slowdown. We give a closed-form expression of the expected slowdown of a popular heavy-tailed workload model with respect to resource allocation on a server cluster. We design a two-tier resource management framework, which integrates a dispatcher-based node partitioning scheme and a server-based adaptive process allocation scheme. We evaluate the resource allocation framework with different models via extensive simulations. Results show that the square-root proportional model provides service differentiation at a minimum cost of system delay. The two-tier resource allocation framework can provide fine-grained and predictable service differentiation on cluster-based servers.     

Parallel and distributed simulation of sediment dynamics in shallow water using particle decomposition approach

This paper describes the parallel simulation of sediment dynamics in shallow water. By using a Lagrangian model, the problem is transformed to one in which a large number of independent particles must be tracked. This results in a technique that can be parallelised with high efficiency. We have developed a sediment transport model using three different sediment suspension methods. The first method uses a modified mean for the Poisson distribution function to determine the expected number of the suspended particles in each particular grid cell of the domain over all available processors. The second method determines the number of particles to suspend with the aid of the Poisson distribution function only in those grid cells which are assigned to that processor. The third method is based on the technique of using a synchronised pseudo-random-number generator to generate identical numbers of suspended particles in all valid grid cells for each processor. Parallel simulation experiments are performed in order to investigate the efficiency of these three methods. Also the parallel performance of the implementations is analysed. We conclude that the second method is the best method on distributed computing systems (e.g., a Beowulf cluster), whereas the third maintains the best load distribution.     

Ontological approach for products-centric information system interoperability in networked manufacturing enterprises

Standardisation initiatives (ISO and IEC) try to answer the problem of managing heterogeneous information, scattered within organizations, by formalising the knowledge related to products technical data. While the product is the centred object from which, along its lifecycle, all enterprise systems, either inside a single enterprise or between cooperating networked enterprises, have a specific view, we may consider it as active as far as it participates to the decisions making by providing knowledge about itself. This paper proposes a novel approach, postulating that the product, represented by its technical data, may be considered as interoperable per se with the many applications involved in manufacturing enterprises as far as it embeds knowledge about itself, as it stores all its technical data, provided that these are embedded on a common model. The matter of this approach is to formalise of all technical data and concepts contributing to the definition of a Product Ontology, embedded into the product itself and making it interoperable with applications, minimising loss of semantics.     

Usability Research in the Writing Lab: Sustaining Discourse and Pedagogy

Redesigning Purdue's Online Writing Lab (OWL) presented the opportunity for collaboration among Writing Center and Professional Writing Program members. While the article briefly describes the OWL redesign process, the argument focuses on collaboration and presents a model for sustainable intraprogram collaboration. Following Hawhee, usability research is defined as “invention-in-the-middle,” which offers a model for understanding research process as part of the infrastructure of new media instruction as described by DeVoss, Cushman, and Grabill. This article offers four stakeholder perspectives on the process of participatory technology design: of writing center administrators, graduate students, technical writing practitioners, and writing program graduate faculty members. The model asserted by this article presents a dynamic understanding of expertise and of fluidity in the roles of participants. Collaborative usability research, seen as invention-in-the-middle, contributes both to long-term sustainability of technological artifacts as well as the discursive interactions among stakeholders whose work supports these artifacts.     

Developing Sustainable Research Networks in Graduate Education

The traditional modes of knowledge production and circulation in academia are (slowly but surely) shifting from the hierarchical, top-down systems of print to the distributed, bottom-up systems of the Web. It is in the context of these shifts and the rapid development of Web 2.0 tools and methods that we argue for a concomitant shift in the predominant practices of graduate education in rhetoric—particularly for students of digital rhetoric. In this article, we describe the development of a research network that combines the power of digital networking with the collaborative facilitation offered by communities of practice and consider how research networks can be grown and sustained as part of the graduate education of technorhetoricians.