Adaptive course generation through learning styles representation

This paper presents an approach to automatic course generation and student modeling. The method has been developed during the European funded projects Diogene and Intraserv, focused on the construction of an adaptive e-learning platform. The aim of the platform is the automatic generation and personalization of courses, taking into account pedagogical knowledge on the didactic domain as well as statistic information on both the student’s knowledge degree and learning preferences. Pedagogical information is described by means of an innovative methodology suitable for effective and efficient course generation and personalization. Moreover, statistic information can be collected and exploited by the system in order to better describe the student’s preferences and learning performances. Learning material is chosen by the system matching the student’s learning preferences with the learning material type, following a pedagogical approach suggested by Felder and Silverman. The paper discusses how automatic learning material personalization makes it possible to facilitate distance learning access to both able-bodied and disabled people. Results from the Diogene and Intraserv evaluation are reported and discussed.     

Design optimization of an enzymatic assay in an electrokinetically-driven microfluidic device

Microfluidic systems are increasingly popular for rapid and cheap determinations of enzyme assays and other biochemical analysis. In this study reduced order models (ROM) were developed for the optimization of enzymatic assays performed in a microchip. The model enzyme assay used was β-galactosidase (β-Gal) that catalyzes the conversion of Resorufin β-d-galactopyranoside (RBG) to a fluorescent product as previously reported by Hadd et al. (Anal Chem 69(17): 3407–3412, 1997). The assay was implemented in a microfluidic device as a continuous flow system controlled electrokinetically and with a fluorescence detection device. The results from ROM agreed well with both computational fluid dynamic (CFD) simulations and experimental values. While the CFD model allowed for assessment of local transport phenomena, the CPU time was significantly reduced by the ROM approach. The operational parameters of the assay were optimized using the validated ROM to significantly reduce the amount of reagents consumed and the total biochip assay time. After optimization the analysis time would be reduced from 20 to 5.25 min which would also resulted in 50% reduction in reagent consumption.     

Performance evaluation of semantic registries: OWLJessKB and instanceStore

Service discovery is a critical task in distributed computing architectures for finding a particular service instance. Semantic annotations of services help to enrich the service discovery process. Semantic registries are an important component for the discovery of services and they allow for semantic interoperability through ontology-based query formulation and dynamic mapping of terminologies between system domains. This paper evaluates two semantic registries—OWLJessKB implementation and instanceStore—to determine the suitability of these with regards to the query response time and the overall scalability for use in mathematical services. Mathematical ontologies from the MONET project are used to undertake comparison. The results demonstrate that the performance of registries may be compared across two axes: (1) time to initialize (i.e. time to load an initial ontology into memory); (2) time to query (i.e. time to reason with an ontology loaded into memory).     

Distributed computing on oriented anonymous hypercubes with faulty components

We give efficient algorithms for distributed computation on oriented, anonymous, asynchronous hypercubes with possible faulty components (i.e. processors and links) and deterministic processors. Initially, the processors know only the size of the network and that they are inter-connected in a hypercube topology. Faults may occur only before the start of the computation (and that despite this the hypercube remains a connected network). However, the processors do not know where these faults are located. As a measure of complexity we use the total number of bits transmitted during the execution of the algorithm and we concentrate on giving algorithms that will minimize this number of bits. The main result of this paper is an algorithm for computing Boolean functions on anonymous hypercubes with bit cost , where is the number of faulty components (i.e. links plus processors), is the number of links which are either faulty, or non-faulty but adjacent to faulty processors, and is the diameter of the hypercube with faulty components. Received: October 1992 / Accepted: April 2001     

Treatment of acute lymphoblastic leukemia. 30 years' experience at St. Jude Children's Research Hospital

BACKGROUND: Therapy for childhood lymphoblastic leukemia has evolved during the past three decades, but key questions about what are the least toxic, most effective forms of treatment remain unanswered because of the lack of comprehensive follow-up information. METHODS: To assess long-term outcome in the series of clinical trials conducted at St. Jude Hospital, we compared the results of treatment typical of four eras: exploratory combination chemotherapy (era 1, 1962 to 1966; 91 patients), regimens for the control of meningeal leukemia (era 2, 1967 to 1979; 825 patients), limited intensification of therapy (era 3, 1979 to 1983; 428 patients), and extended intensification of therapy (era 4, 1984 to 1988; 358 patients). ("Intensification" refers to strategies of systemic chemotherapy that are more aggressive than conventional ones.) The major end points were survival and event-free survival; we also calculated the relative risk of treatment failure and the rate of relapse or death after treatment ended (post-treatment failure rate). RESULTS: The probability of event-free survival improved significantly in each successive era (P < 0.001 by the log-rank test), reaching 71 percent in era 4. There was a decrease of approximately 50 percent in the risk of treatment failure from one era to the next in each subgroup of patients defined according to different combinations of the leukocyte count, race, age, and sex. Leukemia appeared to be eradicated in patients who remained in complete remission for three years or more after treatment in era 4. The incidence of death due to nonleukemic causes remained 4 to 6 percent despite the trend toward more intensive treatment. An estimated 765 patients (45 percent) are long-term survivors; most of them (80 percent) have no health problems related to leukemia or its treatment. CONCLUSIONS: The development and successful application of preventive therapy for meningeal leukemia, followed by the intensification of systemic chemotherapy, has progressively improved the rate of cure of childhood lymphoblastic leukemia, with relatively few adverse sequelae.     

Multi-product economic lot scheduling problem with manufacturing and remanufacturing using a basic period policy

In this research we study the multi-product Economic Lot Scheduling Problem (ELSP) with manufacturing and remanufacturing opportunities. Manufacturing and remanufacturing operations are performed on the same production line. Both manufactured and remanufactured products have the same quality thus they fulfil the same demand stream. Tang and Teunter (2006) firstly studied this type of Economic Lot Scheduling Problem with Returns (ELSPR) and presented a complex algorithm for the optimal solution. More recently Teunter, Tang, and Kaparis (2009) proposed several heuristics to deal with the same problem using more computational efficient approaches. However, both studies have limited the attention to the common cycle policy with the assumption that a single (re)manufacturing lot is used for each item in each cycle. Relaxing the constraint of common cycle time and a single (re)manufacturing lot for each item in each cycle, we propose a simple, easy to implement algorithm, based on Segerstedt (1999), to solve the model using a basic period policy. Several numerical examples show the applicability of the algorithm and the cost savings.     

Is cheating a human function? The roles of presence,state hostility,and enjoyment in an unfair video game

In sports and board games, when an opponent cheats, the other players typically greet it with disdain, anger, and disengagement. However, work has yet to fully address the role of the computer cheating in video games. In this study, participants played either a cheating or a non-cheating version of a modified open-source tower-defense game. Results indicate that when a computer competitor cheats, players perceive the opponent as being more human. Cheating also increases player aggravation and presence, but does not affect enjoyment of the experience. Additionally, players that firmly believed that their opponent was controlled by the computer exhibited significantly less state hostility compared to players that were less certain of the nature of their competitor. Game designers can integrate subtle levels of cheating into computer opponents without any real negative responses from the players. The results indicate that minor levels of cheating might also increase player engagement with video games.     

Innovation in Industrial Districts: Evidence from Italy

The aim of this paper is to show that Italian manufacturing firms belonging to Marshallian industrial districts carry out a higher innovative effort than is usually acknowledged. The empirical analysis makes use of a panel of 1,218 district and non-district firms belonging to traditional sectors. Data refers to the years 1992 and 1995. We have estimated an augmented Cobb-Douglas production function. The estimates make it possible to empirically identify three different determinants of firms' productivity: (i) the intentional innovative activity; (ii) the “district effect”; and (iii) the joint district and innovation effect. The results show that firms' membership in industrial districts and product innovations are key factors in explaining the productivity of firms working in traditional Italian sectors.     

Quality of Service Networking for High Performance Grid Applications

This paper reports on different efforts to provide quality of service (QoS) Networking to Grid applications done in the context of the MB-NG, GRS and DataTAG EU projects. These are leading edge network research projects involving more that 50 researchers in the UK, Europe and North America, concerned with the development and testing of protocols and standards for the next generation of high speed networks. We have implemented and tested the Differentiated Services Architecture (DiffServ) in a multi-domain, 2.5 Gbits/s network (the first such deployment) defining appropriate Service Level Agreements (SLAs) to be used between administrative domains to guarantee end-to-end Quality of Service. We characterised several hardware implementations of DiffServ and concluded on their appropriateness for several network scenarios. Since current and future Grid applications will have to use modified mechanisms of congestion control we have evaluated old and new TCP implementations over a Differentiated Services Networks. These quality of service tests have also included innovative MPLS (Multi-Protocol Label Switching) experiments to establish guaranteed bandwidth connections to Grid applications in a fast and efficient way. We have also developed a software based bandwidth broker architecture for Grids based on IETF standards which allows applications to transparently request dynamic and advanced reservations and implemented it in a real experimental network. We finally report on experiences delivering Quality of Service networking to high performance applications like Particle Physics data transfer and High Performance Computation. This includes quantitative results on the performance improvements that QoS brought to real data transfers in the context of High Performance Computing.     

Formal methods integration for the specification of dependable distributed systems

This paper describes a real-world case study in the specification and analysis of dependable distributed systems. The case study is an automated transport system with safety requirements. In order to manage the complexity of the problem of specifying the dynamic behavior of the whole system, a compositional approach is used, based on the integration of the trace logic of the Communicating Sequential Processes (CSP) theory, and stochastic Petri nets (SPNs). It is argued that the integration of different formal methods is a useful approach in the definition of practical engineering methodologies for the specification, design and analysis of complex dependable distributed systems.