bluuebunny/crossref_metadata_2025_split huggingface dataset:
Mutations in
pfmdr1
Modulate the Sensitivity of
Plasmodium falciparum
to the Intrinsic Antiplasmodial Activity of Verapamil
Authors: Hayward Rhys , Saliba Kevin J. , Kirk Kiaran 
Published: January 2005

ABSTRACT

As well as having the ability to reverse chloroquine resistance in the human malaria parasite
Plasmodium falciparum
, verapamil has itself an innate antiplasmodial activity. We show here that mutations in Pgh1, the product of the malaria parasite's
pfmdr1
gene, influence the parasite's susceptibility to the toxic effects of verapamil.
Effects of Cetylpyridinium Chloride Resistance and Treatment on Fluconazole Activity versus
Candida albicans
Authors: Edlind Merritt P. , Smith W. Lamar , Edlind Thomas D. 
Published: January 2005

ABSTRACT

Mouthwash antiseptic cetylpyridinium chloride (CPC) has potent activity against
Candida albicans
; however, two of five azole-resistant strains showed reduced CPC susceptibility. To further examine the potential for cross-resistance, CPC-resistant mutants were selected in vitro and their fluconazole susceptibility was tested. MICs were unchanged, and trailing growth generally decreased. With CPC-fluconazole combinations, both antagonism and synergism were observed, which can be explained, in part, by
CDR1
-
CDR2
multidrug transporter upregulation.
Modeling In Vivo Pharmacokinetics and Pharmacodynamics of Moxifloxacin Therapy forMycobacterium tuberculosisInfection by Using a Novel Cartridge System
Authors: Ginsburg Amy Sarah , Lee Jin , Woolwine Samuel C. , Grosset Jacques H. , Hamzeh Fayez M. , Bishai William R. 
Published: January 2005

ABSTRACTTo study the efficacy of moxifloxacin treatment for tuberculosis, we utilized a novel cartridge system to simulate in vivo pharmacokinetics. We found this system to be a robust method for modeling in vivo pharmacokinetics and present data supporting the utility of intermittent moxifloxacin treatment as a component of antituberculosis chemotherapy.
Lighting sensitive display
Authors: Nayar Shree K. , Belhumeur Peter N. , Boult Terry E. 
Published: January 2005

Although display devices have been used for decades, they have functioned without taking into account the illumination of their environment. We present the concept of a lighting sensitive display (LSD)---a display that measures the incident illumination and modifies its content accordingly. An ideal LSD would be able to measure the 4D illumination field incident upon it and generate a 4D light field in response to the illumination. However, current sensing and display technologies do not allow for such an ideal implementation. Our initial LSD prototype uses a 2D measurement of the illumination field and produces a 2D image in response to it. In particular, it renders a 3D scene such that it always appears to be lit by the real environment that the display resides in. The current system is designed to perform best when the light sources in the environment are distant from the display, and a single user in a known location views the display.The displayed scene is represented by compressing a very large set of images (acquired or rendered) of the scene that correspond to different lighting conditions. The compression algorithm is a lossy one that exploits not only image correlations over the illumination dimensions but also coherences over the spatial dimensions of the image. This results in a highly compressed representation of the original image set. This representation enables us to achieve high quality relighting of the scene in real time. Our prototype LSD can render 640 × 480 images of scenes under complex and varying illuminations at 15 frames per second using a 2 GHz processor. We conclude with a discussion on the limitations of the current implementation and potential areas for future research.
Etude on theme of Dijkstra
Authors: Shilova S. O. , Shilov N. V. 
Published: January 2005

We present a tutorial for undergraduate students who are interested in different programming contests like National Programming Olympiads or regional ACM International Collegiate Programming Contests (ACM ICPC). It is based on a problem discussed by E. W. Dijkstra in a public lecture in 1994. The tutorial was a part of a special undergraduate course presented for students of Novosibirsk State University in 2003-04 academic year during their preparation for ACM ICPC Final at Prague (2004).
The original problem is how to couple <i>N</i> black and <i>N</i> white points on the plane by intervals without intersections. E. W. Dijkstra suggested a nice heuristic search algorithm and proved its termination and correctness by the method of R. W. Floyd. Unfortunately, the upper bound of his algorithm was exponential. Due to this reason, he suggested to audience investigation of the problem complexity and development of an efficient algorithm.
We demonstrate that the problem is decidable in cubic time by quadratic reduction to the classical assignment problem. We also discuss how to solve the coupling problem in pure geometric/topological way. We also present some examples of utility of the coupling problem.
Computational geometry column 46
Authors: O'Rourke Joseph 
Published: January 2005

The old problem of determining the chromatic number of the plane is revisited.
The question of the chromatic number of the Euclidean plane E<sup>2</sup> has been unresolved for over fifty years. Informally, the question asks: How many colors are needed to paint the plane so that no two points a unit distance apart are painted the same color? If the same question is asked of the line, the answer is 2: Coloring [0,1) red, [1,2) blue, etc., ensures that no two unit-separated points have the same color. Here I report on a few new developments, and some related open problems that are perhaps easier.
One can view the question as asking for the chromatic number X(E<sup>2</sup>) of the infinite <i>unit-distance graph G</i>, with every point in the plane a node, and an are between two nodes if they are separated by a unit distance. Erdös and de Bruijn showed [EdB51] that the chromatic number of the plane is attained for some finite subgraph of <i>G.</i> This result led to narrowing the answer to 4 ≤ X(E<sup>2</sup>) ≤7. For example, the lower bound of 4 is established by the "Moser graph" shown in Fig. 1, which needs 4 colors.
When good things happen to bad products
Authors: Jokela Timo 
Published: January 2005

Consider the following three stories about usability and consumer appliances.
• A cellular phone with significant usability problems was launched. Still, the product was a great sales success and many users even seemed to have enjoyed using the product.
• A new generation game device was developed. It had usability problems that led to wide-spread user dissatisfaction and the reputation of the product was severely damaged.
• Some users of a new generation smart phone were happy with the product while others rejected it, finding its usability problems intolerable.
Distributed scheduling policies in networks of input-queued packet switches
Authors: Bauer Claus 
Published: January 2005

Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability and on average delay for single switches. However, recent research has demonstrated that most of these scheduling algorithms do not guarantee stability for networks of switches.
Most of the research that treats networks of switches proposes switching policies that require coordination among the single switches. The problem to find <i>distributed</i> scheduling policies that guarantee the stability of a network of switches has so far only been investigated for a policy based on a computationally very complex maximum weight matching algorithm.
In this paper, we investigate <i>distributed</i> scheduling algorithms of <i>low complexity</i> that belong to the classes of maximal weight matching algorithms, <i>p</i>-maximal weight matching algorithms for switch architectures based on a space-division multiplexing extension, and MNCM algorithms. For these scheduling algorithms, we prove the stability of networks of input-queued switches where all switches deploy the same scheduling policy. We also show that networks of input-queued switches in which specific classes of different switching policies are deployed simultaneously at different switches are stable.
Experience with "link-up notification" over a mobile satellite link
Authors: Duke Martin , Henderson Thomas R. , Meegan Jeff 
Published: January 2005

Over paths characterized by extended outage periods, a TCP connection can suffer a severe performance penalty due to its Retransmission Timeout (RTO) backoff mechanism. If outages are long enough, the RTO can grow large enough to cause unacceptably long pauses when the link is eventually restored. One proposed solution is "Link-Up Notification" (LUN), which involves an intermediate device that can detect the link state. When the link is restored, the device immediately sends a packet that causes traffic to resume, terminating the TCP timeout.
We have implemented a version of LUN that we call "kickstart." A kickstart gateway buffers a packet from each connection and uses them to restart the connections when the channel is restored. Based on empirical data, we have built a mobile satellite channel emulator and demonstrated how the technique can effectively eliminate the pause in restarting a TCP flow once a blocked channel is reestablished. When conducting experiments with shorter channel outages and shorter TCP flows, a different picture emerges; in this case, while connection transfer times are not noticeably reduced by a kickstart gateway, the overall completion ratio of TCP connections is increased, as fewer connections are dropped due to exceeding the maximum number of retransmissions. Our experiments also exposed some problems in the Linux and FreeBSD end host TCP implementations that impair performance in such an environment. Correcting these problems improves success ratios still more, while having little positive effect on transfer times.
From the chair
Authors: Sipior Janice C. , Schatzberg Laurie , Leidner Dorothy , Lending Diane , Vowels Susan 
Published: January 2005

I would like to extend a warm invitation to you and your invited guests to attend "<i>The Fourth Annual ACM-SIGMIS Reception,</i>" to be held as an ACM-SIGMIS event prior to the International Conference on Information Systems (ICIS2004) in Washington, D.C. USA, December 12--15, 2004. Light refreshments will be served.
<ul><li>What: <i>Fourth Annual ACM-SIGMIS Reception</i></li> <li>Where: International Conference on Information Systems (ICIS2004) Washington, D.C. USA Grand Hyatt Washington Room to be announced</li> <li>When: 6:00 to 8:00 pm Saturday, December 11, 2004</li> <li>Who: All ACM-SIGMIS members and their invited guests are welcome</li></ul>
Please consider hosting a future SIGMIS CPR (Computer Personnel Research) Conference. We are currently accepting Calls For Proposals for the SIGMIS CPR'06 Conference. Let's make the SIGMIS CPR Conference a continuing success! If you are interested, please email me (janice.sipior@villanova.edu) to briefly provide insight about your interest, potential locations, potential conference committee members, potential themes if you have any, and any other relevant information. For your reference, the website for CPR'04 held April 22-24, 2004 in Tucson, AZ USA was: http://monet.ecom.arizona.edu/~misweb/cgi-bin/transition/web/sigmis2004
The Call For Papers for SIGMIS CPR'05, to be held April 14-16, 2005 in Atlanta, GA USA can be found at: http://www.acm.org/sigmis/CFP2005.html
Finally, I would like to encourage you to become an officer of SIGMIS. The slate of candidates for Chair, Vice Chair, and Secretary/Treasurer is to be sent to ACM headquarters by December 1, 2004. If you would like to run for office, please email the following information to George Kasper (gmkasper@vcu.edu), Chair of the Nominating Committee: <ul><li>The office for which you are a candidate</li> <li>Name</li> <li>Address (current and future if an address change is expected before elections are completed)</li> <li>Phone</li> <li>Email address</li> <li>ACM Membership Number</li></ul> Candidate's name as it appears on the ACM Membership Roster
Thank you for your continued support of SIGMIS. Your comments and suggestions are encouraged. Please feel free to contact any one of us.
We look forward to seeing you at ICIS'04!
A Linux networking study
Authors: Serral René , Gil Marisa 
Published: January 2005

The fast evolution and increase in use of nowadays networks forces researchers to look for efficient ways of managing all the information that travels through those networks. Added to that, the growing use of Linux as main operating system for servers and big grid computing farms, has developed many research lines for increasing the networking capabilities and efficiency of the kernel code.
Having that in mind, this document shows the basic internals of the networking code of Linux kernel and discusses the efficiency of the existing implementation in the 2.6 version. Besides, various tests are done for detecting existing bottlenecks in the networking core. Finally are also exposed guidelines for improving certain aspects of the kernel networking behaviour.
Feature-based surface parameterization and texture mapping
Authors: Zhang Eugene , Mischaikow Konstantin , Turk Greg 
Published: January 2005

Surface parameterization is necessary for many graphics tasks: texture-preserving simplification, remeshing, surface painting, and precomputation of solid textures. The stretch caused by a given parameterization determines the sampling rate on the surface. In this article, we present an automatic parameterization method for segmenting a surface into patches that are then flattened with little stretch.Many objects consist of regions of relatively simple shapes, each of which has a natural parameterization. Based on this observation, we describe a three-stage feature-based patch creation method for manifold surfaces. The first two stages, genus reduction and feature identification, are performed with the help of distance-based surface functions. In the last stage, we create one or two patches for each feature region based on a covariance matrix of the feature's surface points.To reduce stretch during patch unfolding, we notice that stretch is a 2 × 2 tensor, which in ideal situations is the identity. Therefore, we use the <i>Green-Lagrange tensor</i> to measure and to guide the optimization process. Furthermore, we allow the boundary vertices of a patch to be optimized by adding <i>scaffold triangles</i>. We demonstrate our feature-based patch creation and patch unfolding methods for several textured models.Finally, to evaluate the quality of a given parameterization, we describe an image-based error measure that takes into account stretch, seams, smoothness, packing efficiency, and surface visibility.
The usability problem for home appliances
Authors: Marks Joe 
Published: January 2005

Ordinary people already have great difficulty using the advanced features of digitally enabled household appliances, and the problem grows worse with time as more customization and programming features are added. This usability problem cannot be solved using the tiny displays and limited control buttons typically found on such devices. In this talk I will describe a new type of collaborative interface in which the appliance actively helps the user, especially with complex features that are only used occasionally. This interface provides a consistent and pervasive mechanism for answering the who-what-where-when-why-how questions that often cause users to consult a manual, call a help line, or simply give up. A crucial aspect of the interface architecture is the use of home networking to share a physically large and computationally powerful display among multiple appliances.
Why is this a relevant talk for a software-engineering conference? A contributing factor to the usability crisis is the dominance of engineers in product design at many companies. The development of more-usable devices requires a broader conception of engineering that includes interaction design, artificial intelligence, and human factors - at a minimum. I will describe how these disciplines can complement traditional electrical and software engineering in the context of attempting to solve a commercially significant real-world problem.
Resolving uncertainties during trace analysis
Authors: Egyed Alexander 
Published: January 2005

Software models provide independent perspectives onto software systems. Ideally, all models should use the same model element to describe the same part of a system. Practically, models elements are not shared because of syntactic and semantic differences among modeling notations. Trace dependencies explicitly maintain the commonalities among the distinct model elements.
Generating and maintaining trace dependencies is difficult, costly, and highly error-prone. Automated trace analysis techniques are scarce. This paper extends an existing, testing-based technique for generating and maintaining trace dependencies. It is based on the commonality principle: if two model elements of different perspectives are the same then they must have the same source code. The existing approach associates test scenarios with model elements, tests them, and observes what lines of code are being executed. Model elements are considered the same/similar if their testing uses the same/overlapping lines of code.
This paper extends the existing approach (and tool) by giving the user a richer, more powerful, yet precise language on how to relate model elements, test scenarios, and source code (the input). This allows some forms of uncertainties to exist in input data without sacrificing reliability. The extended approach also identifies "shared code." Shared code works against the commonality principle in that model elements do not relate if they overlap solely on their use of generic source code (e.g., queue). As a pre-requisite, our approach requires an executable and observable software system and test scenarios.
Automating comprehensive safety analysis of concurrent programs using verisoft and TXL
Authors: Dingel Juergen , Liang Hongzhi 
Published: January 2005

In run-time safety analysis the executions of a concurrent program are monitored and analyzed with respect to safety properties. Similar to testing, run-time analysis is quite efficient, but it also tends to be incomplete. The results pertain only to the observed executions which may constitute just a small subset of all possible executions.
In this paper, we describe a tool called ViP which uses the software model checker VeriSoft to perform comprehensive run-time safety analyses of concurrent C/C++ programs. A ViP analysis proceeds in three fully automated steps: First, the input program is prepared for a VeriSoft analysis through instrumentation. Next, VeriSoft is invoked to generate the traces corresponding to all possible executions of the program. Then, the traces are checked efficiently for specification violations. The instrumentation is based on the source code transformation language TXL. TXL allows for the instrumentation to be described in terms of rewrite rules and gives ViP a remarkable amount of flexibility.
The paper describes ViP together with its use of VeriSoft and TXL. Several sample analyses are discussed to illustrate the use of ViP.
Merging partial behavioural models
Authors: Uchitel Sebastian , Chechik Marsha 
Published: January 2005

Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners have adopted techniques that support incremental elaboration of partial behaviour descriptions. A noteworthy example is the wide adoption of scenario-based notations such as message sequence charts. Scenario-based specifications are partial descriptions that can be incrementally elaborated to cover the system behaviour that is of interest. However, how should partial behavioural models described by different stakeholders with different viewpoints covering different aspects of behaviour be composed? How should partial models of component instances of the same type be put together.
In this paper, we propose model merging as a general solution to these questions. We formally define model merging based on observational refinement and show that merging consistent models is a process that should result in a minimal common refinement. Because minimal common refinements are not guaranteed to be unique, we argue that the modeller should participate in the process of elaborating such a model. We also discuss the role of the least common refinement and the greatest lower bound of all minimal common refinements in this elaboration process. In addition, we provide algorithms for i) checking consistency between two models; ii) constructing their least common refinement if one exists; iii) supporting the construction of a minimal common refinement if there is no least common refinement.
Reasoning about partial goal satisfaction for requirements and design engineering
Authors: Letier Emmanuel , van Lamsweerde Axel 
Published: January 2005

Exploring alternative options is at the heart of the requirements and design processes. Different alternatives contribute to different degrees of achievement of non-functional goals about system safety, security, performance, usability, and so forth. Such goals in general cannot be satisfied in an absolute, clear-cut sense. Various qualitative and quantitative frameworks have been proposed to support the assessment of alternatives for design decision making. In general they lead to limited conclusions due to the lack of accuracy and measurability of goal formulations and the lack of impact propagation rules along goal contribution links.
The paper presents techniques for specifying partial degrees of goal satisfaction and for quantifying the impact of alternative system designs on the degree of goal satisfaction. The approach consists in enriching goal refinement models with a probabilistic layer for reasoning about partial satisfaction. Within such models, non-functional goals are specified in a precise, probabilistic way; their specification is interpreted in terms of application-specific measures; impact of alternative goal refinements is evaluated in terms of refinement equations over random variables involved in the system's functional goals. A systematic method is presented for guiding the elaboration of such models. The latter can then be used to assess the impact of alternative decisions on the degree of goal satisfaction or to derive quantitative, fine-grained requirements on the software to achieve the higher-level goals.