An Accountable Source-To-Source Transformation System

Though one is led to believe that program transformation systems which perform source-to-source transformations enable the user to understand and appreciate the resulting source program, this is not always the case. Transformations are capable of behaving and/or interacting in unexpected ways. The user who is interested in understanding the whats, whys, wheres, and hows of the transformation process is left without tools for discovering them. I provide an initial step towards the solution of this problem in the form of an accountable source-to-source transformation system. It carefully records the information necessary to answer such questions, and provides mechanisms for the retrieval of this information. It is observed that though this accountable system allows the user access to relevant facts from which he may draw conclusions, further study is necessary to make the system capable of analyzing these facts itself.

A Multiple-Context Equality-Based Reasoning System

Expert systems are too slow. This work attacks that problem by speeding up a useful system component that remembers facts and tracks down simple consequences. The redesigned component can assimilate new facts more quickly because it uses a compact, grammar-based internal representation to deal with whole classes of equivalent expressions at once. It can support faster hypothetical reasoning because it remembers the consequences of several assumption sets at once. The new design is targeted for situations in which many of the stored facts are equalities. The deductive machinery considered here supplements stored premises with simple new conclusions. The stored premises include permanently asserted facts and temporarily adopted assumptions. The new conclusions are derived by substituting equals for equals and using the properties of the logical connectives AND, Or, and NOT. The deductive system provides supporting premises for its derived conclusions. Reasoning that involves quantifiers is beyond the scope of its limited and automatic operation. The expert system of which the reasoning system is a component is expected to be responsible for overall control of reasoning.

Development of a LCST membrane forming system for cellulose acetate ultrafiltration hollow fiber

A novel lower critical solution temperature (LCST) membrane forming system containing cellulose acetate (CA)/poly (vinyl pyrrolidone) (PVP 3 60K)/N-methyl-2-pyrrolidone (NMP)/1,2-propanediol with a weight ratio of 24.0:5.0:62.6:8.4 had been developed. CA hollow fiber ultrafiltration (UF) membranes were fabricated using the dry-wet spinning technique. The fibers were post-treated with a 200 mg/L hypochlorite solution over a period of 6 It at pH 7. The experimental results showed that water flux of a membrane decreased while retention increased with increasing CA concentration in a dope. It was concluded that the membrane pore size decreased with increasing CA concentration. The membrane fouling tendency for BSA was 3 times higher than that for PVP 24K. (C) 2004 Elsevier B.V. All rights reserved.

Design and analysis of kinetic energy recovery system for automobiles: a case study for commuters in Edinburgh.

Transport and its energetic and environmental impacts affect our daily lives. The transport sector is the backbone of the United Kingdom’s economy with 2.3 million people being employed in this sector. With a high dependency on transport for passengers and freight and with the knowledge that oil reserves are rapidly decreasing a solution has to be identified for conserving fuel. Passenger vehicles account for 61% of the transport fuel consumed in the U.K. and should be seen as a key area to tackle. Despite the introduction and development of electric powered cars, the widespread infrastructure that is required is not in place and has attributed to their slow uptake, as well as the fact that the electric car’s performance is not yet comparable with the conventional internal combustion engine. The benefits of the introduction of kinetic energy recovery systems to be used in conjunction with internal combustion engines and designed such that the system could easily be fitted into future passenger vehicles are examined. In this article, a review of automobile kinetic energy recovery system is presented. It has been argued that the ultracapacitor technology offers a sustainable solution. An optimum design for the urban driving cycle experienced in the city of Edinburgh has been introduced. The potential for fuel savings is also presented

An artificial immune system for continuous analysis of time-varying data

M. Neal, An Artificial Immune System for Continuous Analysis of Time-Varying Data, in Proceedings of the 1st International Conference on Artificial Immune Systems (ICARIS), 2002, eds J Timmis and P J Bentley, volume 1, pages 76-85,

An application of a multiple agent system for flexible assemble tasks

C.H. Orgill, N.W. Hardy, M.H. Lee, and K.A.I. Sharpe. An application of a multiple agent system for flexible assemble tasks. In Knowledge based envirnments for industrial applications including cooperating expert systems in control. IEE London, 1989.

A resource limited artificial immune system for data analysis.

Timmis J and Neal M J. A resource limited artificial immune system for data analysis. In Proceedings of ES2000 - Research and Development of Intelligent Systems, pages 19-32, Cambrige, U.K., 2000. Springer.

Investigating the evolution and stability of a resource limited artificial immune system.

Timmis J and Neal M J. Investigating the evolution and stability of a resource limited artificial immune system. In Proceedings of GECCO - special workshop on artificial immune systems, pages 40-41. AAAI press, 2000.

A scenario-driven decision support system for serious crime investigation

Q. Shen, J. Keppens, C. Aitken, B. Schafer, and M. Lee. A scenario driven decision support system for serious crime investigation. Law, Probability and Risk, 5(2):87-117, 2006. Sponsorship: UK Engineering and Physical Sciences Research Council grant GR/S63267; partially supported by grant GR/S98603

Brachypodium distachyon. A new model system for functional genomics in grasses

John Draper, Luis A.J. Mur, Glyn Jenkins, Gadab C. Ghosh-Biswas, Pauline Bablak, Robert Hasterok,and Andrew P.M. Routledge (2001). Brachypodium distachyon. A new model system for functional genomics in grasses. Plant Physiology, 127 (4), 1539-1555. Sponsorship: BBSRC / Gatsby Foundation RAE2008

AIDA-Based Distributed File System

This paper describes a prototype implementation of a Distributed File System (DFS) based on the Adaptive Information Dispersal Algorithm (AIDA). Using AIDA, a file block is encoded and dispersed into smaller blocks stored on a number of DFS nodes distributed over a network. The implementation devises file creation, read, and write operations. In particular, when reading a file, the DFS accepts an optional timing constraint, which it uses to determine the level of redundancy needed for the read operation. The tighter the timing constraint, the more nodes in the DFS are queried for encoded blocks. Write operations update all blocks in all DFS nodes--with future implementations possibly including the use of read and write quorums. This work was conducted under the supervision of Professor Azer Bestavros (best@cs.bu.edu) in the Computer Science Department as part of Mohammad Makarechian's Master's project.

Integrated Chest Image Analysis System "BU-MIA"

We introduce "BU-MIA," a Medical Image Analysis system that integrates various advanced chest image analysis methods for detection, estimation, segmentation, and registration. BU-MIA evaluates repeated computed tomography (CT) scans of the same patient to facilitate identification and evaluation of pulmonary nodules for interval growth. It provides a user-friendly graphical user interface with a number of interaction tools for development, evaluation, and validation of chest image analysis methods. The structures that BU-MIA processes include the thorax, lungs, and trachea, pulmonary structures, such as lobes, fissures, nodules, and vessels, and bones, such as sternum, vertebrae, and ribs.

To Queue or Not to Queue: When Queueing is Better Than Timesharing in a Distributed System

We examine the question of whether to employ the first-come-first-served (FCFS) discipline or the processor-sharing (PS) discipline at the hosts in a distributed server system. We are interested in the case in which service times are drawn from a heavy-tailed distribution, and so have very high variability. Traditional wisdom when task sizes are highly variable would prefer the PS discipline, because it allows small tasks to avoid being delayed behind large tasks in a queue. However, we show that system performance can actually be significantly better under FCFS queueing, if each task is assigned to a host based on the task's size. By task assignment, we mean an algorithm that inspects incoming tasks and assigns them to hosts for service. The particular task assignment policy we propose is called SITA-E: Size Interval Task Assignment with Equal Load. Surprisingly, under SITA-E, FCFS queueing typically outperforms the PS discipline by a factor of about two, as measured by mean waiting time and mean slowdown (waiting time of task divided by its service time). We compare the FCFS/SITA-E policy to the processor-sharing case analytically; in addition we compare it to a number of other policies in simulation. We show that the benefits of SITA-E are present even in small-scale distributed systems (four or more hosts). Furthermore, SITA-E is a static policy that does not incorporate feedback knowledge of the state of the hosts, which allows for a simple and scalable implementation.

Task Assignment in a Distributed System: Improving Performance by Unbalancing Load

We consider the problem of task assignment in a distributed system (such as a distributed Web server) in which task sizes are drawn from a heavy-tailed distribution. Many task assignment algorithms are based on the heuristic that balancing the load at the server hosts will result in optimal performance. We show this conventional wisdom is less true when the task size distribution is heavy-tailed (as is the case for Web file sizes). We introduce a new task assignment policy, called Size Interval Task Assignment with Variable Load (SITA-V). SITA-V purposely operates the server hosts at different loads, and directs smaller tasks to the lighter-loaded hosts. The result is that SITA-V provably decreases the mean task slowdown by significant factors (up to 1000 or more) where the more heavy-tailed the workload, the greater the improvement factor. We evaluate the tradeoff between improvement in slowdown and increase in waiting time in a system using SITA-V, and show conditions under which SITA-V represents a particularly appealing policy. We conclude with a discussion of the use of SITA-V in a distributed Web server, and show that it is attractive because it has a simple implementation which requires no communication from the server hosts back to the task router.

Small-World Internet Topologies: Possible Causes and Implications on Scalability of End-System Multicast

Recent work has shown the prevalence of small-world phenomena [28] in many networks. Small-world graphs exhibit a high degree of clustering, yet have typically short path lengths between arbitrary vertices. Internet AS-level graphs have been shown to exhibit small-world behaviors [9]. In this paper, we show that both Internet AS-level and router-level graphs exhibit small-world behavior. We attribute such behavior to two possible causes–namely the high variability of vertex degree distributions (which were found to follow approximately a power law [15]) and the preference of vertices to have local connections. We show that both factors contribute with different relative degrees to the small-world behavior of AS-level and router-level topologies. Our findings underscore the inefficacy of the Barabasi-Albert model [6] in explaining the growth process of the Internet, and provide a basis for more promising approaches to the development of Internet topology generators. We present such a generator and show the resemblance of the synthetic graphs it generates to real Internet AS-level and router-level graphs. Using these graphs, we have examined how small-world behaviors affect the scalability of end-system multicast. Our findings indicate that lower variability of vertex degree and stronger preference for local connectivity in small-world graphs results in slower network neighborhood expansion, and in longer average path length between two arbitrary vertices, which in turn results in better scaling of end system multicast.