bluuebunny/crossref_metadata_2025 huggingface dataset:
Simulation of intrafraction motion and overall geometric accuracy of a frameless intracranial radiosurgery process
Authors: Feygelman Vladimir , Walker Luke , Chinnaiyan Prakash , Forster Kenneth
Published: December 2008

We conducted a comprehensive evaluation of the clinical accuracy of an image‐guided frameless intracranial radiosurgery system. All links in the process chain were tested. Using healthy volunteers, we evaluated a novel method to prospectively quantify the range of target motion for optimal determination of the planning target volume (PTV) margin. The overall system isocentric accuracy was tested using a rigid anthropomorphic phantom containing a hidden target. Intrafraction motion was simulated in 5 healthy volunteers. Reinforced head‐and‐shoulders thermoplastic masks were used for immobilization. The subjects were placed in a treatment position for 15 minutes (the maximum expected time between repeated isocenter localizations) and the six‐degrees‐of‐freedom target displacements were recorded with high frequency by tracking infrared markers. The markers were placed on a customized piece of thermoplastic secured to the head independently of the immobilization mask. Additional data were collected with the subjects holding their breath, talking, and deliberately moving. As compared with fiducial matching, the automatic registration algorithm did not introduce clinically significant errors ( difference). The hidden target test confirmed overall system isocentric accuracy of ≤1 mm (total three‐dimensional displacement). The subjects exhibited various patterns and ranges of head motion during the mock treatment. The total displacement vector encompassing 95% of the positional points varied from 0.4 mm to 2.9 mm. Pre‐planning motion simulation with optical tracking was tested on volunteers and appears promising for determination of patient‐specific PTV margins. Further patient study is necessary and is planned. In the meantime, system accuracy is sufficient for confident clinical use with 3 mm PTV margins.

PACS number: 87.53.Ly
Case study of radiation therapy treatment of a patient with a cardiac ventricular assist device∗
Authors: Lasher Donette E. , Wojcicka Jadwiga B. , Malcom Ronald , Shears Lawrence L
Published: December 2008

A patient with a cardiac ventricular assist device (VAD) with computer‐controlled driver presented to our department for radiation therapy. The treatment plan was 4500 cGy to the rectum over 25 fractions with 15MV photon beams. All beams avoided the pump and leads. The response to electromagnetic interference (EMI) was evaluated by observing a duplicate driver in the treatment configuration as the patient's fields were delivered to a solid water equivalent phantom. Pretreatment dose assessment included calculations with Pinnacle treatment planning system, AAPM TG36 data analysis, and MOSFET measurements on the surface of the driver during the phantom irradiation. During the first patient treatment, MOSFETs were placed on the pump and leads, approximately 1cm from the left lateral treatment portal. No additional shielding was applied to the VAD. EMI was absent and the VAD operated normally during the pretreatment test and throughout the treatment course. Radiation to the driver was too low to be detected by the MOSFETS. Cumulative dose estimates to the pump were 425cGy to 0. 1cc (DVH), 368cGy (TG36), and 158.5cGy (MOSFET). MOSFET readings to the leads were 70.5cGy. External beam radiation treatment was safely delivered to a VAD dependent patient. The VAD exhibited no adverse response to EMI and doses up to 425 cGy. Our results are based on one case and further study is encouraged.

PACS number: 87.53.Dq
A Novel Mycovirus That Is Related to the Human PathogenHepatitis E Virusand Rubi-Like Viruses
Authors: Liu Huiquan , Fu Yanping , Jiang Daohong , Li Guoqing , Xie Jun , Peng Youliang , Yi Xianhong , Ghabrial Said A.
Published: December 2008

Previously, we reported that three double-stranded RNA (dsRNA) segments, designated L-, M-, and S-dsRNAs, were detected inSclerotinia sclerotiorumstrain Ep-1PN. Of these, the M-dsRNA segment was derived from the genomic RNA of a potexvirus-like positive-strand RNA virus,Sclerotinia sclerotiorum debilitation-associated RNA virus. Here, we present the complete nucleotide sequence of the L-dsRNA, which is 6,043 nucleotides in length, excluding the poly(A) tail. Sequence analysis revealed the presence of a single open reading frame (nucleotide positions 42 to 5936) that encodes a protein with significant similarity to the replicases of the “alphavirus-like” supergroup of positive-strand RNA viruses. A sequence comparison of the L-dsRNA-encoded putative replicase protein containing conserved methyltransferase, helicase, and RNA-dependent RNA polymerase motifs showed that it has significant sequence similarity to the replicase ofHepatitis E virus, a virus infecting humans. Furthermore, we present convincing evidence that the virus-like L-dsRNA could replicate independently with only a slight impact on growth and virulence of its host. Our results suggest that the L-dsRNA from strain Ep-1PN is derived from the genomic RNA of a positive-strand RNA virus, which we namedSclerotinia sclerotiorum RNA virusL (SsRV-L). As far as we know, this is the first report of a positive-strand RNA mycovirus that is related to a human virus. Phylogenetic and sequence analyses of the conserved motifs of the RNA replicase of SsRV-L showed that it clustered with the rubi-like viruses and that it is related to the plant clostero-, beny- and tobamoviruses and to the insect omegatetraviruses. Considering the fact that these related alphavirus-like positive-strand RNA viruses infect a wide variety of organisms, these findings suggest that the ancestral positive-strand RNA viruses might be of ancient origin and/or they might have radiated horizontally among vertebrates, insects, plants, and fungi.
Hormone-sensitive prostate cancer: a case of ETS gene fusion heterogeneity
Authors: Attard G , Jameson C , Moreira J , Flohr P , Parker C , Dearnaley D , Cooper C S , de Bono J S
Published: December 2008

Fusion of the hormone-regulated geneTMPRSS2withERGoccurs in 50–70% of prostate cancers; fusions ofETV1with one of several partners occur in approximately 10% of prostate cancers. These two translocations are mutually exclusive. The presence of subclasses of these chromosomal rearrangements may indicate worse prognosis, with the subclass 2+Edel, which has duplication ofTMPRSS2:ERGfusion sequences, indicating particularly poor survival. However as this case shows, significant heterogeneity can exist withERGandETV1rearrangements occurring in both prostate intra-epithelial neoplasia and cancer in the same prostatectomy specimen and with adjacent cancer areas containing a single copy, duplication and even triplication of the rearranged locus. As the majority of ETS gene fusions are hormone regulated, they could explain the pathogenesis underlying exquisitely hormone-sensitive prostate cancer. This is exemplified by the case presented here of a patient diagnosed in 1991 who remains asymptomatic and chemotherapy-naïve after having long-lasting tumour responses to multiple lines of systemic hormonal treatments.
ON THE UNIQUENESS OF D = 11 INTERACTIONS AMONG A GRAVITON, A MASSLESS GRAVITINO AND A THREE-FORM III: GRAVITON AND GRAVITINI
Authors: CIOROIANU EUGEN-MIHĂIŢĂ , DIACONU EUGEN , SĂRARU SILVIU CONSTANTIN
Published: December 2008

Under the hypotheses of smoothness of the interactions in the coupling constant, locality, Poincaré invariance, Lorentz covariance and the preservation of the number of derivatives on each field in the Lagrangian of the interacting theory (the same number of derivatives like in the free Lagrangian), we prove that in D = 11 there are no cross-interactions between the graviton and the massless gravitino and also no self-interactions in the Rarita–Schwinger sector. A comparison with the case D = 4 is briefly discussed.
ON THE UNIQUENESS OF D = 11 INTERACTIONS AMONG A GRAVITON, A MASSLESS GRAVITINO AND A THREE-FORM IV: PUTTING THINGS TOGETHER
Authors: CIOROIANU EUGEN-MIHĂIŢĂ , DIACONU EUGEN , SĂRARU SILVIU CONSTANTIN
Published: December 2008

Under the hypotheses of smoothness of the interactions in the coupling constant, locality, Poincaré invariance, Lorentz covariance and the preservation of the number of derivatives on each field in the Lagrangian of the interacting theory (the same number of derivatives like in the free Lagrangian), we prove that the only consistent interactions in D = 11 among massless gravitini, a graviton, and a three-form are described by N = 1, D = 11 SUGRA.
STOP–ANTISTOP AND SBOTTOM–ANTISBOTTOM PRODUCTION AT LHC: A ONE-LOOP SEARCH FOR MODEL PARAMETERS DEPENDENCE
Authors: BECCARIA M. , MACORINI G. , PANIZZI L. , RENARD F. M. , VERZEGNASSI C.
Published: December 2008

We have computed the one-loop electroweak expression of diagonal and nondiagonal stop–antistop and sbottom–antisbottom production from initial state gluons at LHC. We have investigated the possibility that the one-loop effects exhibit a dependence on "extra" supersymmetric parameters different from the final squark masses. Our results, given for a choice of twelve SUSY benchmark points in the MSSM with mSUGRA symmetry breaking, show that in some cases a mild dependence might arise, at the percent relative level, of not simple experimental detection.
TWO COMPONENTS OF DARK MATTER IN THE DAMA DATA
Authors: TOMOZAWA YUKIO
Published: December 2008

It is shown that the DAMA data indicate two dark matter components, one that circulates around the galactic center (GC) and another that is emitted from the GC. From the location of the maximum yearly variation, one can compute the ratio of the two components.
SOME THOUGHTS ON THE COSMOLOGICAL QCD PHASE TRANSITION
Authors: HWANG W-Y. P.
Published: December 2008

The cosmological QCD phase transitions may have taken place between 10-5 s and 10-4 s in the early universe offers us one of the most intriguing and fascinating questions in cosmology. In bag models, the phase transition is described by the first-order phase transition and the role played by the latent "heat" or energy released in the transition is highly nontrivial and is being classified as the first-order phase transition. In this presentation, we assume, first of all, that the cosmological QCD phase transition, which happened at a time between 10-5 s and 10-4 s or at the temperature of about 150 MeV and accounts for confinement of quarks and gluons to within hadrons, would be of first-order. Of course, we may assume that the cosmological QCD phase transition may not be of the first-order. To get the essence out of the first-order scenario, it is sufficient to approximate the true QCD vacuum as one of possibly degenerate vacua and when necessary we try to model it effectively via a complex scalar field with spontaneous symmetry breaking. On the other hand, we may use a real scalar field in describing the non-first-order QCD phase transition. In the first-order QCD phase transition, we could examine how and when "pasted" or "patched" domain walls are formed, how long such walls evolve in the long run, and we believe that the significant portion of dark matter could be accounted for in terms of such domain-wall structure and its remnants. Of course, the cosmological QCD phase transition happened in the way such that the false vacua associated with baryons and many other color-singlet objects did not disappear (that is, using the bag-model language, there are bags of radius 1.0 fermi for the baryons) — but the amount of the energy remained in the false vacua is negligible by comparison. The latent energy released due to the conversion of the false vacua to the true vacua, in the form of "pasted" or "patched" domain walls in the short run and their numerous evolved objects, should make the concept of the "radiation-dominated" epoch, or of the "matter-dominated" epoch to be reexamined.
Scalable approximate query processing with the DBO engine
Authors: Jermaine Chris , Arumugam Subramanian , Pol Abhijit , Dobra Alin
Published: December 2008

This article describes query processing in the DBO database system. Like other database systems designed for ad hoc analytic processing, DBO is able to compute the exact answers to queries over a large relational database in a scalable fashion. Unlike any other system designed for analytic processing, DBO can constantly maintain a guess as to the final answer to an aggregate query throughout execution, along with statistically meaningful bounds for the guess's accuracy. As DBO gathers more and more information, the guess gets more and more accurate, until it is 100% accurate as the query is completed. This allows users to stop the execution as soon as they are happy with the query accuracy, and thus encourages exploratory data analysis.
Forensic analysis of database tampering
Authors: Pavlou Kyriacos E. , Snodgrass Richard T.
Published: December 2008

Regulations and societal expectations have recently expressed the need to mediate access to valuable databases, even by insiders. One approach is tamper detection via cryptographic hashing. This article shows how to determine when the tampering occurred, what data was tampered with, and perhaps, ultimately, who did the tampering, via forensic analysis. We present four successively more sophisticated forensic analysis algorithms: the Monochromatic, RGBY, Tiled Bitmap, and a3D algorithms, and characterize their “forensic cost” under worst-case, best-case, and average-case assumptions on the distribution of corruption sites. A lower bound on forensic cost is derived, with RGBY and a3D being shown optimal for a large number of corruptions. We also provide validated cost formulæ for these algorithms and recommendations for the circumstances in which each algorithm is indicated.
SRPT optimally utilizes faster machines to minimize flow time
Authors: Torng Eric , McCullough Jason
Published: December 2008

We analyze the shortest remaining processing time (SRPT) algorithm with respect to the problem of scheduling
n
jobs with release times on
m
identical machines to minimize total flow time. It is known that SRPT is optimal if
m
= 1 but that SRPT has a worst-case approximation ratio of Θ(min(log
n/m
, log Δ)) for this problem, where Δ is the ratio of the length of the longest job divided by the length of the shortest job. It has previously been shown that SRPT is able to use faster machines to produce a schedule
as good as
an optimal algorithm using slower machines. We now show that SRPT
optimally
uses these faster machines with respect to the worst-case approximation ratio. That is, if SRPT is given machines that are
s
≥ 2 − 1/
m
times as fast as those used by an optimal algorithm, SRPT's flow time is at least
s times smaller
than the flow time incurred by the optimal algorithm. Clearly, no algorithm can offer a better worst-case guarantee, and we show that existing algorithms with similar performance guarantees to SRPT without resource augmentation do not optimally use extra resources.
Online nonpreemptive scheduling of equal-length jobs on two identical machines
Authors: Goldwasser Michael H. , Pedigo Mark
Published: December 2008

We consider the nonpreemptive scheduling of two identical machines for jobs with equal processing times yet arbitrary release dates and deadlines. Our objective is to maximize the number of jobs completed by their deadlines. Using standard nomenclature, this problem is denoted as
P
2 |

p
j

=
p
,

r
j

| Σ

Ū
j

. The problem is known to be polynomially solvable in an offline setting.

In an online variant of the problem, a job's existence and parameters are revealed to the scheduler only upon that job's release date. We present an online deterministic algorithm for the problem and prove that it is 3/2-competitive. A simple lower bound shows that this is the optimal deterministic competitiveness.
On hard instances of approximate vertex cover
Authors: Vishwanathan Sundar
Published: December 2008

We show that if there is a 2 - ϵ approximation algorithm for vertex cover on graphs with vector chromatic number at most 2 + δ, then there is a 2 -
f
(ϵ, δ) approximation algorithm for vertex cover for all graphs.
Combinatorial bounds via measure and conquer
Authors: Fomin Fedor V. , Grandoni Fabrizio , Pyatkin Artem V. , Stepanov Alexey A.
Published: December 2008

We provide an algorithm listing all minimal dominating sets of a graph on
n
vertices in time
O
(1.7159

n

). This result can be seen as an algorithmic proof of the fact that the number of minimal dominating sets in a graph on
n
vertices is at most 1.7159

n

, thus improving on the trivial
O
(2

n

/√
n
) bound. Our result makes use of the measure-and-conquer technique which was recently developed in the area of exact algorithms.

Based on this result, we derive an
O
(2.8718

n

) algorithm for the domatic number problem.
Structure and linear-time recognition of 4-leaf powers
Authors: Brandstädt Andreas , Le Van Bang , Sritharan R.
Published: December 2008

A graph
G
is the
k-leaf power
of a tree
T
if its vertices are leaves of
T
such that two vertices are adjacent in
G
if and only if their distance in
T
is at most
k
. Then
T
is a
k-leaf root
of
G
. This notion was introduced and studied by Nishimura, Ragde, and Thilikos [2002], motivated by the search for underlying phylogenetic trees. Their results imply an
O
(
n
3
)-time recognition algorithm for 4-leaf powers. Recently, Rautenbach [2006] as well as Dom et al. [2005] characterized 4-leaf powers without true twins in terms of forbidden subgraphs. We give new characterizations for 4-leaf powers and squares of trees by a complete structural analysis. As a consequence, we obtain a conceptually simple linear-time recognition of 4-leaf powers.
Multipartite priority queues
Authors: Elmasry Amr , Jensen Claus , Katajainen Jyrki
Published: December 2008

We introduce a framework for reducing the number of element comparisons performed in priority-queue operations. In particular, we give a priority queue which guarantees the worst-case cost of
O
(1) per minimum finding and insertion, and the worst-case cost of
O
(log
n
) with at most log
n
+
O
(1) element comparisons per deletion, improving the bound of 2 log
n
+
O
(1) known for binomial queues. Here,
n
denotes the number of elements stored in the data structure prior to the operation in question, and log
n
equals log
2
(max {2, n}). As an immediate application of the priority queue developed, we obtain a sorting algorithm that is optimally adaptive with respect to the inversion measure of disorder, and that sorts a sequence having
n
elements and
I
inversions with at most
n
log (
I
/
n
) +
O
(
n
) element comparisons.
Self-stabilizing population protocols
Authors: Angluin Dana , Aspnes James , Fischer Michael J. , Jiang Hong
Published: December 2008

This article studies self-stabilization in networks of anonymous, asynchronously interacting nodes where the size of the network is unknown. Constant-space protocols are given for Dijkstra-style round-robin token circulation, leader election in rings, two-hop coloring in degree-bounded graphs, and establishing consistent global orientation in an undirected ring. A protocol to construct a spanning tree in regular graphs using
O
(log
D
) memory is also given, where
D
is the diameter of the graph. A general method for eliminating nondeterministic transitions from the self-stabilizing implementation of a large family of behaviors is used to simplify the constructions, and general conditions under which protocol composition preserves behavior are used in proving their correctness.
An exercise in selfish stabilization
Authors: Cohen Johanne , Dasgupta Anurag , Ghosh Sukumar , Tixeuil Sébastien
Published: December 2008

Stabilizing distributed systems expect all the component processes to run predefined programs that are externally mandated. In Internet scale systems, this is unrealistic, since each process may have selfish interests and motives related to maximizing its own payoff. This article formulates the problem of selfish stabilization to show how competition blends with cooperation in a stabilizing environment.
Circle formation of weak mobile robots
Authors: Dieudonné Yoann , Labbani-Igbida Ouiddad , Petit Franck
Published: December 2008

We consider distributed systems made of
weak mobile
robots, that is, mobile devices, equipped with sensors, that are
anonymous
,
autonomous
,
disoriented
, and
oblivious
. The
Circle Formation Problem
(CFP) consists of the design of a protocol insuring that, starting from an initial arbitrary configuration where no two robots are at the same position, all the robots eventually form a
regular n-gon
—the robots take place on the circumference of a circle
C
with equal spacing between any two adjacent robots on
C
.

CFP is known to be unsolvable by arranging the robots evenly along the circumference of a circle
C
without leaving
C
—that is, starting from a configuration where the robots are on the boundary of
C
. We circumvent this impossibility result by designing a scheme based on
concentric circles
. This is the first scheme that deterministically solves CFP. We present our method with two different implementations working in the semi-synchronous system (SSM) for any number
n
≥ 5 of robots.
Self-stabilizing device drivers
Authors: Dolev Shlomi , Yagel Reuven
Published: December 2008

This work presents approaches for designing the input-output device management components of self-stabilizing operating systems. As an example, we demonstrate the nonstability of the ata standard protocol for storage devices. We state the requirements that an operating system and I/O devices should satisfy in order to become self-stabilizing. Then we suggest two solutions to satisfy these requirements. The first uses leases to guarantee progress from the I/O device side. The second assumes stabilization of the I/O device, and uses snapshots to perform consistency checks. A device driver for a PC hard-disk, using the first solution, was implemented. By supplying an infrastructure for practical self-stabilizing systems, robust and dependable systems can be achieved.
Safe peer-to-peer self-downloading
Authors: Dastidar Kajari Ghosh , Herman Ted , Johnen Colette
Published: December 2008

A goal of peer-to-peer applications is to share files between users themselves rather than downloading files from file servers. Self-downloading protocols have the property that, eventually, every user downloads only from other users. Self-downloading is problematic if users disconnect from the system upon completing file downloading, because they only share with other users while connected. Yet, if users continue to arrive at a sufficient rate, self-downloading protocols are possible. One vulnerability of file sharing between users is the possibility that files or segments could be counterfeit or corrupt. Protocols that are
d
-safe tolerate some number of instances of faulty segments in a file being downloaded, because each segment is downloaded
d
times before being shared. This article shows that
d
-safe self-downloading is possible for a sufficiently large arrival rate of users to the system. Upper and lower connectivity and sharing bounds are given for
d
= 2, and simulation results show effects of relaxing assumptions about arrival rates and bandwidth.
The soft qualities of interaction
Authors: Rullo Alessia
Published: December 2008

This article provides a methodological perspective on the notion of the aesthetics of interaction in ambient computing systems. Aesthetics of interaction is challenged by the design proposal for the soft qualities of interaction, which is used as a tool to complement existing design methodologies. The perspective presented is based on work conducted in the Neonatal Intensive Care Unit at Siena Hospital in Italy, as a part of the EU PalCom project. The early outcomes provide a heuristic account which questions the design process by fostering the novel complexity of ambient technologies in delicate and fragile settings.
Building Scalable Web Services
Authors: Killalea Tom
Published: December 2008

In the early days of the Web we severely lacked tools and frameworks, and in retrospect it seems noteworthy that those early Web services scaled at all. Nowadays, while the tools have progressed, so too have expectations with respect to richness of interaction, performance, and scalability. In view of these raised expectations it is advisable to build only what you really need, relying on other people’s work where possible. Above all, be cautious in choosing when, what, and how to optimize.
High Performance Web Sites
Authors: Souders Steve
Published: December 2008

Google Maps, Yahoo! Mail, Facebook, MySpace, YouTube, and Amazon are examples of Web sites built to scale. They access petabytes of data sending terabits per second to millions of users worldwide. The magnitude is awe-inspiring. Users view these large-scale Web sites from a narrower perspective. The typical user has megabytes of data that are downloaded at a few hundred kilobits per second. Users are not so interested in the massive number of requests per second being served; they care more about their individual requests. As they use these Web applications, they inevitably ask the same question: "Why is this site so slow?"
Review: Practical API Design: Confessions of a Java Framework Architect (1st edition) Jaroslav Tulach, Apress, 2008, $74.99, ISBN: 9781430209737
Authors: Miller J.
Published: December 2008

Review: Practical API Design: Confessions of a Java Framework Architect (1st edition) Jaroslav Tulach, Apress, 2008, $74.99, ISBN: 9781430209737
Thinking professionally
Authors: Gotterbarn Don
Published: December 2008

Many of us are from a generation when video games were wholesome and character building and the games did not reward, murder, torture, or theft. Those early games like Pong morphed into Wii's Family Table Tennis and Major League Eating which can be played even while seated in a retirement home.

The widespread use of video-games in education, training, entertainment and the use of video game technology in the design and control of medical, commercial, and military systems has a significant impact on the present and the future directions of society. As in other rapid advances in technology, the speed of the development and immersion of this technology in our lives has left numerous significant questions.
Taking the high road
Authors: Martin C. Dianne
Published: December 2008

Over the past several years journalists have documented the fact that a number of high profile campaigns have been significantly influenced by the "blogosphere." Many political analysts believe that blogging and online videos are changing the political process in profound, yet not necessarily positive, ways. Politicians are using YouTube, MySpace and Facebook Web sites for everything from recruiting volunteers and spreading their campaign message, to raising millions of dollars of campaign funds, to embarrassing and attempting to discredit their opponents. Not only have political candidates created their own campaign websites, they are now creating profile pages on MySpace and creating video messages forYouTube. In fact, tech-savvy candidates hire young staffers to attempt to coordinate and amplify the activities of bloggers, both verbal and video. In a brave new Internet world, political candidates at all levels of the democratic system are discovering both the benefits and pitfalls of online campaigning.
Reflections
Authors: Kumar Deepak
Published: December 2008

Enter 3747 Ridge Avenue in Philadelphia, Pennsylvania in your GPS systems next time you visit the Philadelphia area for you would be directed to a produce market of historic significance. The building that used to house Eckert & Mauchly Computer Company in the late 1940's has been revived as a produce market to help revitalize a blighted neighborhood on the banks of the Schyulkill River. But don't just poke your head out of your car window to take a picture of the historical marker and drive away. Pull inside, and take a look at the murals decorating the walls. Order a cheesesteak from one of the food counters and spend some time discussing the inner workings of the UNIVAC 1 and its role in the first ever computerized prediction of election result.
IS education
Authors: Topi Heikki
Published: December 2008

One of the most fundamental and most highly debated questions in Information Systems education is the role of programming in undergraduate IS programs. On one hand, there are strong arguments and precedents supporting not only the inclusion of programming in these programs but also a significant role for it. For example, both the most recent model curriculum (IS 2002) and many existing undergraduate IS programs include a significant programming component. IS 2002 incorporates a programming course with a highly complex name reflecting the ambiguity about the focus of the course ("Programming, Data, File, and Object Structures,") but it also includes two additional courses that have significant programming components ("Physical Design and Implementation with DBMS" and "Physical Design and Implementation in Emerging Environments"). The "Analysis and Logical Design" course is directly connected to application development/programming. A closer evaluation of the course descriptions reveals a very ambitious agenda; the topics include items such as "programming in traditional and visual environments that incorporate event-driven, object-oriented design," "algorithm development," "program correctness, verification, and validation," "structured and object design approaches," and "structured, event driven, and object oriented application design." This choice of wording, which is practically unchanged from IS'97, signifies a strong commitment to developing the students' programming and software development capabilities. In addition, the general criteria for accrediting undergraduate computing programs (including those in information systems) clearly include programming activities (3 (c)) "The program enables students to achieve, by the time of graduation, ... an ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs.
CS research
Authors: Lister Raymond
Published: December 2008

If our human bodies are a reflection of what we eat, then the collective body of an academic community is a reflection of what its members cite. To better understand the Computing Education Research Community, I recently counted the conferences, journals and books cited in the 43 papers comprising the first three International Computing Education Research Workshops (i.e. ICERs 2007-2007).

These 43 ICER papers contained 1130 citations, which is a remarkable average of 26 citations per publication. Almost one third (32%) of the citations were to conferences, while 38% of citations were to journals, and 21% to books and book chapters.
Community college corner
Authors: Hawthorne Elizabeth K.
Published: December 2008

Over the past two decades, the ACM Two-Year College Education Committee (TYCEC) has published associate-degree curricular guidelines that correspond to the five major disciplines clearly identifiable within the realm of computing: Computer Science, Computer Engineering, Software Engineering, Information Systems, and Information Technology. All of these reports have been approved by the ACM Education Board and are freely available from www.acmtyc.org/curricula.cfm. As an overview, the committee characterizes these five computing disciplines and corresponding curricula as follow.
IFIP vibes
Authors: Turner A. Joe
Published: December 2008

There is still time to submit a paper to the IFIP World Conference on Computers in Education! The conference, which is held every five years or so, will be in Bento Gonçalves, RS, Brazil, on 27-31 July 2009. The deadline for paper submission is 31 December 2008.
Another brief recursion excursion to Hanoi
Authors: Minsker Steven
Published: December 2008

We propose another simple Towers of Hanoi variant, a hybrid between classical Hanoi and linear Hanoi, in which the rules governing movement depend on ring color. An optimal algorithm is presented. The problem and its heavily recursive solution are
not
difficult; perhaps one of its more interesting facets is that the optimality proof uses simultaneous induction on
four
statements. This paper can be viewed as similar in purpose and spirit to the author's previous work [1]; the goal here is again to present a fun example of potential usefulness in teaching discrete mathematics and data structures courses.
A specimen MPI application
Authors: Rolfe Timothy J.
Published: December 2008

The generalized problem of placing n queens on an
n
-by-
n
board provides an "embarrassingly parallel" problem for parallel solution. This paper expands on the discussion presented in the May 2005 issue of
Dr. Dobb's Journal
[1], specifically taking the parallel execution through Java threads and bringing it into an application in C taking advantage of MPI.
Another approach for resisting student resistance to formal methods
Authors: Zingaro Daniel
Published: December 2008

Students are generally not motivated to take formal methods courses or continue studying the subject. This note introduces an approach based on a new textbook designed to be used in the first year of a computer science curriculum. The essential features are the use of relevant programming tools, early coupling of specification and implementation, informal but "generative" reasoning, and material from several problem areas. The hope is that we can lay a strong foundation for future formal methods courses to build on, while remaining accessible to the wide variety of students taking such an introductory course.
Functional testing for students
Authors: Tomić Bojan , Vlajić Siniša
Published: December 2008

Testing is an integral part of software engineering. When teaching this discipline, educators choose testing approaches to be implemented in their classes. But many of these approaches, no matter how well devised or comprehensive, fall short of being simple and straightforward to use. Furthermore, students still face issues like: where to start, what should tests consist of, how much testing is enough etc. This paper describes a practical approach for functional testing specifically designed for students. It is meant to be intuitive, simple and thorough, so good testing results can be achieved.
Using open-source robocode as a Java programming assignment
Authors: Liu Peter L.
Published: December 2008

This paper is a teacher-researcher's reflection upon the use of open-source Robocode as a Java programming assignment. Following the educational perspectives of Parker Palmer and Elliot Eisner, it is a qualitative inquiry into the learning experiences of the students as well as the inner journey of a teacher. The design of the assignment may be validated by the ITiCSE 2007 Working Group's matrix taxonomy.
Complex game development throughout the college curriculum
Authors: Goulding Tom
Published: December 2008

This case study discusses the incorporation of game development throughout the Daniel Webster College computer science curriculum. During the freshman year all computer science majors develop complex games in C#.net while participating in an instructional game motif method we call the GM method. This freshman educational method combines agile software engineering techniques with an inquiry based, neo-Socratic classroom. The GM method provides freshmen with the core skills necessary to develop complex games throughout their college career. This freshman program of study is followed by more traditional project courses which begin with an encryption system project in the sophomore year. XNA 2-D and XNA 3-D game development soon follow and a C++ game engine development capstone project is undertaken in the senior year.
On the frontier of computer science
Authors: Lapidot Tami , Aharoni Dan
Published: December 2008

In this paper, we describe a six years experience of summer seminars for high-school computer-science (CS) leading teachers in Israel. The seminars, called "On the frontier of computer science", featured encounters between CS researchers and teachers, as well as pedagogy discussions and workshops. The result of these innovative seminars is that they helped strengthen the local leading teachers' community above and beyond expectations.
Rough querying
Authors: Beaubouef Theresa , Alkadi Ghassan
Published: December 2008

This paper discusses the development and implementation of a rough relational database system by students in a junior level information systems course. Team work skills as well as software engineering life cycle models are emphasized throughout the course. Students learn vital software engineering skills while developing a real world system that incorporates rough set uncertainty management in the querying of data.
Imagery training in the teaching of the data structure curriculum
Authors: Rui Deng , Thompson John T. , Hong Yang , Xing-sheng Zhou , Ke-jing Liu , Macintyre Neil Alexander
Published: December 2008

Data Structure Curriculum (DSC) has abstract and dynamic features and it is difficult for learners to gain a full comprehension. According to its abstract features, related algorithms cases should be visualized in order to help learners more easily learn. And according to its dynamic feature, Imagery Training can be introduced into the method of instruction. Resorting to the two modes and the developed demo system of algorithm in DSC, learners can be instructed to comprehend and memorize abstract knowledge better in imaginative ways.
Data and information security (DIS) for BS and MS programs
Authors: Narasimhan V. Lakshmi , Lal Das Manik
Published: December 2008

Data and Information Security (DIS) provides confidence to senior management that the operational systems are secure, and offers challenges to hackers to break the security of operational systems. The more the threats and attacks, the more security patches or plug-in solutions are required to make existing systems secure. It is observed that industry and Government sectors manage their security related issues by spending huge cost for hiring security professionals, conducting training program to train own employees or consulting a security firm for security solution. It is also time that academic institutions seed security expertise, at both undergraduate and graduate levels, in order to fulfill the increasing in demand. This paper proposes structures of DIS programs for bachelor and master degrees.
Teaching tales
Authors: Edmondson Carol
Published: December 2008

Student perceptions of the educational experiences that are provided to them at tertiary institutions do not necessarily match the perceptions of the academics who provide these educational experiences. Mismatches between student perceptions and academic perceptions can adversely affect student learning as well as lead to mutually frustrating encounters between students and academics. This paper presents a selection of nine true teaching tales. Each of the tales recounts an experience which allowed the author to perceive a situation from the student point of view. The paper then discusses the importance of student perceptions in computing courses.
New directions for inroads
Authors: Owens Barbara Boucher
Published: December 2008

The SIGCSE Board is contemplating several changes with regard to its publication inroads -- the SIGCSE Bulletin. The SIGCSE Board would like your opinion on three interconnected proposals. We appreciate your input and value your point of view.
Response summary from the SIGCSE community
Authors: Impagliazzo John
Published: December 2008

Since the issuance of the message above, the response from the SIGCSE community has been overwhelmingly positive. SIGCSE members seem delighted with the prospect that authors submitting articles to inroads will hopefully receive a new level of acceptance from the academic community. That is, their work would not be relegated to "newsletter" status, but to a new and more acceptable level of quality in a magazine.
Enhancing learning management systems to better support computer science education
Authors: Rößling Guido , Joy Mike , Moreno Andrés , Radenski Atanas , Malmi Lauri , Kerren Andreas , Naps Thomas , Ross Rockford J. , Clancy Michael , Korhonen Ari , Oechsle Rainer , Iturbide J. Ángel Velázquez
Published: December 2008

Many individual instructors -- and, in some cases, entire universities -- are gravitating towards the use of comprehensive learning management systems (LMSs), such as Blackboard and Moodle, for managing courses and enhancing student learning. As useful as LMSs are, they are short on features that meet certain needs specific to computer science education. On the other hand, computer science educators have developed--and continue to develop-computer-based software tools that aid in management, teaching, and/or learning in computer science courses. In this report we provide an overview of current CS specific on-line learning resources and guidance on how one might best go about extending an LMS to include such tools and resources. We refer to an LMS that is extended specifically for computer science education as a Computing Augmented Learning Management System, or CALMS. We also discuss sound pedagogical practices and some practical and technical principles for building a CALMS. However, we do not go into details of creating a plug-in for some specific LMS. Further, the report does not favor one LMS over another as the foundation for a CALMS.
Developing a common format for sharing programming assignments
Authors: Edwards Stephen H. , Börstler Jürgen , Cassel Lillian N. , Hall Mark S. , Hollingsworth Joseph
Published: December 2008

Computer science educators spend a lot of effort designing programming assignments, and many are willing to share the results of this investment. However, sharing of programming assignments occurs primarily in an ad hoc manner through informal channels. There are no widely used mechanisms that support instructors in finding and sharing such resources. Often, the additional work required to prepare and self-publish assignment resources in a way that others can then adapt or reuse is a significant inhibitor. Also, other instructors may have to spend an inordinate amount of time and effort to reshape a potential assignment into something that can be used in their own courses. This working group report proposes a common format for packaging assignments for sharing. This format is easy for instructors to create (requiring no specialized tools), is extensible and flexible enough to handle assignments written for any programming language at any level of proficiency, supports appropriate metadata, and is easily manipulated by software tools. As more and more instructors use automated grading tools to process student submissions, it is our hope that such an interchange format can lead to a community practice of sharing resources in a way that overcomes existing barriers to such reuse.
Computing education for sustainability
Authors: Mann Samuel , Smith Lesley , Muller Logan
Published: December 2008

This paper presents policy on Computing Education for Sustainability for adoption by SIGCSE. The paper describes results from a survey of Computing Educators who attended ITiCSE 2008 where such a policy statement was mooted. This survey also provides a comparison of understandings of sustainability held by those computing educators against recognized benchmarks. From these findings and understandings an action plan to integrate Education for Sustainability into computing education is proposed.
Contributing student pedagogy
Authors: Hamer John , Cutts Quintin , Jackova Jana , Luxton-Reilly Andrew , McCartney Robert , Purchase Helen , Riedesel Charles , Saeli Mara , Sanders Kate , Sheard Judithe
Published: December 2008

A Contributing Student Pedagogy (CSP) is a pedagogy that encourages students to contribute to the learning of others and to value the contributions of others. CSP in formal education is anticipatory of learning processes found in industry and research, in which the roles and responsibilities of 'teacher' and 'student' are fluid. Preparing students for this shift is one motivation for use of CSP. Further, CSP approaches are linked to constructivist and community theories of learning, and provide opportunities to engage students more deeply in subject material.

In this paper we advance the concept of CSP and relate it to the particular needs of computer science. We present a number of characteristics of this approach, and use case studies from the available literature to illustrate these characteristics in practice. We discuss enabling technologies, provide guidance to instructors who would like to incorporate this approach in their teaching, and suggest some future directions for the study and evaluation of this technique. We conclude with an extensive bibliography of related research and case studies which exhibit elements of CSP.
Insect Pests of Tea and Their Management
Authors: Hazarika Lakshmi K. , Bhuyan Mantu , Hazarika Budhindra N.
Published: December 2008

Globally, 1031 species of arthropods are associated with the intensively managed tea Camellia sinensis (L.) O. Kuntze monoculture. All parts of the plant, leaf, stem, root, flower, and seed, are fed upon by at least one pest species, resulting in an 11%–55% loss in yield if left unchecked. There has been heavy use of organosynthetic pesticides since the 1950s to defend the plant against these pests, leading to rapid conversion of innocuous species into pests, development of resistance, and undesirable pesticide residues in made tea. As a result of importer and consumer concerns, pesticide residues have become a major problem for the tea industry. Integrated pest management (IPM) may help to overcome the overuse of pesticides and subsequent residues. We review the advances made in our understanding of the biology and ecology of major insect and mite pests of tea, host plant resistance, cultural practices, biocontrol measures, and need-based application of botanicals and safer pesticides to understand the present status of IPM and to identify future challenges to improvement.
Ecology and Geographical Expansion of Japanese Encephalitis Virus
Authors: van den Hurk Andrew F. , Ritchie Scott A. , Mackenzie John S.
Published: December 2008

Japanese encephalitis virus (JEV) (Flavivirus: Flaviviridae) is a leading cause of encephalitis in eastern and southern Asia. The virus is maintained in a zoonotic cycle between ardeid wading birds and/or pigs and Culex mosquitoes. The primary mosquito vector of JEV is Culex tritaeniorhynchus, although species such as Cx. gelidus, Cx. fuscocephala, and Cx. annulirostris are important secondary or regional vectors. Control of JEV is achieved through human and/or swine vaccination, changes in animal husbandry, mosquito control, or a combination of these strategies. This review outlines the ecology of JEV and examines the recent expansion of its geographical range, before assessing its ability to emerge in new regions, using the hypothetical establishment in the United States as a case study.
New Insights into Peritrophic Matrix Synthesis, Architecture, and Function
Authors: Hegedus Dwayne , Erlandson Martin , Gillott Cedric , Toprak Umut
Published: December 2008

The peritrophic matrix (PM) is a chitin and glycoprotein layer that lines the invertebrate midgut. Although structurally different, it is functionally similar to the mucous secretions of the vertebrate digestive tract. The PM is a physical barrier, protecting the midgut epithelium from abrasive food particles, digestive enzymes, and pathogens infectious per os. It is also a biochemical barrier, sequestering and, in some cases, inactivating ingested toxins. Finally, the PM compartmentalizes digestive processes, allowing for efficient nutrient acquisition and reuse of hydrolytic enzymes. The PM consists of an organized lattice of chitin fibrils held together by chitin binding proteins. Glycans fill the interstitial spaces, creating a molecular sieve, the properties of which are dependent on the immediate ion content and pH. In this review, we have integrated recent structural and functional information to create a holistic model for the PM. We also show how this information may generate novel technologies for use in insect pest management.