Project scheduling under time dependent costs-a branch and bound algorithm

Abstract: In a given project network, execution of each activity in normal duration requires utilization of certain resources. If faster execution of an activity is desired then additional resources at extra cost would be required. Given a project network, the cost structure for each activity and a planning horizon, the project compression problem is concerned with the determination of optimal schedule of performing each activity while satisfying given restrictions and minimizing the total cost of project execution. The paper considers the project compression problem with time dependent cost structure for each activity. The planning horizon is divided into several regular time intervals over which the cost structure of an activity may vary. But the cost structure of the activities remains the same within a time interval. The objective is to find an optimal project schedule minimizing the total project cost. We present a mathematical model for this problem, develop some heuristics and an exact branch and bound algorithm. Using simulated problems we provide an insight into the computational performances of heuristics and the branch and bound algorithm

project schedul under time depend costs-a branch and bound algorithm
 in a given project network , execut of each activ in normal durat requir util of certain resourc . if faster execut of an activ is desir then addit resourc at extra cost would be requir . given a project network , the cost structur for each activ and a plan horizon , the project compress problem is concern with the determin of optim schedul of perform each activ while satisfi given restrict and minim the total cost of project execut . the paper consid the project compress problem with time depend cost structur for each activ . the plan horizon is divid into sever regular time interv over which the cost structur of an activ may vari . but the cost structur of the activ remain the same within a time interv . the object is to find an optim project schedul minim the total project cost . we present a mathemat model for thi problem , develop some heurist and an exact branch and bound algorithm . use simul problem we provid an insight into the comput perform of heurist and the branch and bound algorithm

project scheduling
time dependent costs
branch and bound algorithm
project network
planning horizon
project compression problem
optimal schedule
heuristics


E-learning on the college campus: a help or hindrance to students learning objectives: a case study

Abstract: If you know how to surf the World Wide Web, have used email before, and can learn how to send an email attachment, then learning how to interact in an online course should not be difficult at all. In a way to find out, I decided to offer two identical courses, one of which would be offered online and the other the "traditional way". I wanted to see how students would fare with identical material provided in each course. I wanted their anonymous feedback, when the course was over

e-learn on the colleg campu : a help or hindranc to student learn object : a case studi
 if you know how to surf the world wide web , have use email befor , and can learn how to send an email attach , then learn how to interact in an onlin cours should not be difficult at all . in a way to find out , i decid to offer two ident cours , one of which would be offer onlin and the other the " tradit way " . i want to see how student would fare with ident materi provid in each cours . i want their anonym feedback , when the cours wa over

e-learning
distance education
William Paterson University


Nurturing clients' trust to encourage engagement success during the customization of ERP systems

Abstract: Customization is a crucial, lengthy, and costly aspect in the successful implementation of ERP systems, and has, accordingly, become a major specialty of many vendors and consulting companies. The study examines how such companies can increase their clients' perception of engagement success through increased client trust that is brought about through responsive and dependable customization. Survey data from ERP customization clients show that, as hypothesized, clients' trust influenced their perception of engagement success with the company. The data also show that clients' trust in the customization company was increased when the company behaved in accordance with client expectations by being responsive, and decreased when the company behaved in a manner that contradicted these expectations by not being dependable. Responses to an open-ended question addendum attached to the survey corroborated the importance of responsiveness and dependability. Implications for customization companies and research on trust are discussed

nurtur client ' trust to encourag engag success dure the custom of erp system
 custom is a crucial , lengthi , and costli aspect in the success implement of erp system , and ha , accordingli , becom a major specialti of mani vendor and consult compani . the studi examin how such compani can increas their client ' percept of engag success through increas client trust that is brought about through respons and depend custom . survey data from erp custom client show that , as hypothes , client ' trust influenc their percept of engag success with the compani . the data also show that client ' trust in the custom compani wa increas when the compani behav in accord with client expect by be respons , and decreas when the compani behav in a manner that contradict these expect by not be depend . respons to an open-end question addendum attach to the survey corrobor the import of respons and depend . implic for custom compani and research on trust are discuss

engagement success
customization
ERP systems
vendors
consulting companies
client trust
dependability
enterprise resource planning systems
perceived responsiveness
MRP II implementation
integrity
benevolence


Records role in e-business

Abstract: Records management standards are now playing a key role in e-business strategy

record role in e-busi
 record manag standard are now play a key role in e-busi strategi


Improved approximation of Max-Cut on graphs of bounded degree

Abstract: Let alpha approximately=0.87856 denote the best approximation ratio currently known for the Max-Cut problem on general graphs. We consider a semidefinite relaxation of the Max-Cut problem, round it using the random hyperplane rounding technique of M.X. Goemans and D.P. Williamson (1995), and then add a local improvement step. We show that for graphs of degree at most Delta , our algorithm achieves an approximation ratio of at least alpha + epsilon , where epsilon >0 is a constant that depends only on Delta .. Using computer assisted analysis, we show that for graphs of maximal degree 3 our algorithm obtains an approximation ratio of at least 0.921, and for 3-regular graphs the approximation ratio is at least 0.924. We note that for the semidefinite relaxation of Max-Cut used by Goemans and Williamson the integrality gap is at least 1/0.885, even for 2-regular graphs

improv approxim of max-cut on graph of bound degre
 let alpha approximately=0.87856 denot the best approxim ratio current known for the max-cut problem on gener graph . we consid a semidefinit relax of the max-cut problem , round it use the random hyperplan round techniqu of m.x. goeman and d.p. williamson ( 1995 ) , and then add a local improv step . we show that for graph of degre at most delta , our algorithm achiev an approxim ratio of at least alpha + epsilon , where epsilon > 0 is a constant that depend onli on delta .. use comput assist analysi , we show that for graph of maxim degre 3 our algorithm obtain an approxim ratio of at least 0.921 , and for 3-regular graph the approxim ratio is at least 0.924 . we note that for the semidefinit relax of max-cut use by goeman and williamson the integr gap is at least 1/0.885 , even for 2-regular graph

best approximation ratio
approximation ratio
semidefinite relaxation
computer assisted analysis
2-regular graphs
Max-Cut approximation
bounded degree graph


Reconstruction of time-varying 3-D left-ventricular shape from multiview X-ray cineangiocardiograms

Abstract: This paper reports on the clinical application of a system for recovering the time-varying three-dimensional (3-D) left-ventricular (LV) shape from multiview X-ray cineangiocardiograms. Considering that X-ray cineangiocardiography is still commonly employed in clinical cardiology and computational costs for 3-D recovery and visualization are rapidly decreasing, it is meaningful to develop a clinically applicable system for 3-D LV shape recovery from X-ray cineangiocardiograms. The system is based on a previously reported closed-surface method of shape recovery from two-dimensional occluding contours with multiple views. To apply the method to "real" LV cineangiocardiograms, user-interactive systems were implemented for preprocessing, including detection of LV contours, calibration of the imaging geometry, and setting of the LV model coordinate system. The results for three real LV angiographic image sequences are presented, two with fixed multiple views (using supplementary angiography) and one with rotating views. 3-D reconstructions utilizing different numbers of views were compared and evaluated in terms of contours manually traced by an experienced radiologist. The performance of the preprocesses was also evaluated, and the effects of variations in user-specified parameters on the final 3-D reconstruction results were shown to be sufficiently small. These experimental results demonstrate the potential usefulness of combining multiple views for 3-D recovery from "real" LV cineangiocardiograms

reconstruct of time-vari 3-d left-ventricular shape from multiview x-ray cineangiocardiogram
 thi paper report on the clinic applic of a system for recov the time-vari three-dimension ( 3-d ) left-ventricular ( lv ) shape from multiview x-ray cineangiocardiogram . consid that x-ray cineangiocardiographi is still commonli employ in clinic cardiolog and comput cost for 3-d recoveri and visual are rapidli decreas , it is meaning to develop a clinic applic system for 3-d lv shape recoveri from x-ray cineangiocardiogram . the system is base on a previous report closed-surfac method of shape recoveri from two-dimension occlud contour with multipl view . to appli the method to " real " lv cineangiocardiogram , user-interact system were implement for preprocess , includ detect of lv contour , calibr of the imag geometri , and set of the lv model coordin system . the result for three real lv angiograph imag sequenc are present , two with fix multipl view ( use supplementari angiographi ) and one with rotat view . 3-d reconstruct util differ number of view were compar and evalu in term of contour manual trace by an experienc radiologist . the perform of the preprocess wa also evalu , and the effect of variat in user-specifi paramet on the final 3-d reconstruct result were shown to be suffici small . these experiment result demonstr the potenti use of combin multipl view for 3-d recoveri from " real " lv cineangiocardiogram

time-varying 3-D left-ventricular shape reconstruction


On a general constitutive description for the inelastic and failure behavior of fibrous laminates. II. Laminate theory and applications

Abstract: For pt. I see ibid., pp. 1159-76. The two papers report systematically a constitutive description for the inelastic and strength behavior of laminated composites reinforced with various fiber preforms. The constitutive relationship is established micromechanically, through layer-by-layer analysis. Namely, only the properties of the constituent fiber and matrix materials of the composites are required as input data. In the previous part lamina theory was presented. Three fundamental quantities of the laminae, i.e. the internal stresses generated in the constituent fiber and matrix materials and the instantaneous compliance matrix, with different fiber preform (including woven, braided, and knitted fabric) reinforcements were explicitly obtained by virtue of the bridging micromechanics model. In this paper, the laminate stress analysis is shown. The purpose of this analysis is to determine the load shared by each lamina in the laminate, so that the lamina theory can be applied. Incorporation of the constitutive equations into an FEM software package is illustrated. A number of application examples are given to demonstrate the efficiency of the constitutive theory. The predictions made include: failure envelopes of multidirectional laminates subjected to biaxial in-plane loads, thermomechanical cycling stress-strain curves of a titanium metal matrix composite laminate, S-N curves of multilayer knitted fabric reinforced laminates under tensile fatigue, and bending load-deflection plots and ultimate bending strengths of laminated braided fabric reinforced beams subjected to lateral loads

on a gener constitut descript for the inelast and failur behavior of fibrou lamin . ii . lamin theori and applic
 for pt . i see ibid . , pp . 1159 - 76 . the two paper report systemat a constitut descript for the inelast and strength behavior of lamin composit reinforc with variou fiber preform . the constitut relationship is establish micromechan , through layer-by-lay analysi . name , onli the properti of the constitu fiber and matrix materi of the composit are requir as input data . in the previou part lamina theori wa present . three fundament quantiti of the lamina , i.e. the intern stress gener in the constitu fiber and matrix materi and the instantan complianc matrix , with differ fiber preform ( includ woven , braid , and knit fabric ) reinforc were explicitli obtain by virtu of the bridg micromechan model . in thi paper , the lamin stress analysi is shown . the purpos of thi analysi is to determin the load share by each lamina in the lamin , so that the lamina theori can be appli . incorpor of the constitut equat into an fem softwar packag is illustr . a number of applic exampl are given to demonstr the effici of the constitut theori . the predict made includ : failur envelop of multidirect lamin subject to biaxial in-plan load , thermomechan cycl stress-strain curv of a titanium metal matrix composit lamin , s-n curv of multilay knit fabric reinforc lamin under tensil fatigu , and bend load-deflect plot and ultim bend strength of lamin braid fabric reinforc beam subject to later load

P P P P P P P P P P P P P P P P P P P P P P P P P P R M


On trajectory and force tracking control of constrained mobile manipulators with parameter uncertainty

Abstract: Studies the trajectory and force tracking control problem of mobile manipulators subject to holonomic and nonholonomic constraints with unknown inertia parameters. Adaptive controllers are proposed based on a suitable reduced dynamic model, the defined reference signals and the mixed tracking errors. The proposed controllers not only ensure the entire state of the system to asymptotically converge to the desired trajectory but also ensure the constraint force to asymptotically converge to the desired force. A detailed numerical example is presented to illustrate the developed methods

on trajectori and forc track control of constrain mobil manipul with paramet uncertainti
 studi the trajectori and forc track control problem of mobil manipul subject to holonom and nonholonom constraint with unknown inertia paramet . adapt control are propos base on a suitabl reduc dynam model , the defin refer signal and the mix track error . the propos control not onli ensur the entir state of the system to asymptot converg to the desir trajectori but also ensur the constraint forc to asymptot converg to the desir forc . a detail numer exampl is present to illustr the develop method

force tracking control
constrained mobile manipulators
parameter uncertainty
nonholonomic constraints
adaptive controllers
reduced dynamic model
mixed tracking errors
asymptotic convergence
trajectory control
holonomic constraints
position control
mobile robots


Decentralized adaptive output feedback stabilization for a class of interconnected systems with unknown bound of uncertainties

Abstract: The problem of adaptive decentralized stabilization for a class of linear time-invarying large-scale systems with nonlinear interconnectivity and uncertainties is discussed. The bounds of uncertainties are assumed to be unknown. For such uncertain dynamic systems, an adaptive decentralized controller is presented. The resulting closed-loop systems are asymptotically stable in theory. Moreover, an adaptive decentralized control scheme is given. The scheme ensures the closed-loop systems exponentially practically stable and can be used in practical engineering. Finally, simulations show that the control scheme is effective

decentr adapt output feedback stabil for a class of interconnect system with unknown bound of uncertainti
 the problem of adapt decentr stabil for a class of linear time-invari large-scal system with nonlinear interconnect and uncertainti is discuss . the bound of uncertainti are assum to be unknown . for such uncertain dynam system , an adapt decentr control is present . the result closed-loop system are asymptot stabl in theori . moreov , an adapt decentr control scheme is given . the scheme ensur the closed-loop system exponenti practic stabl and can be use in practic engin . final , simul show that the control scheme is effect

adaptive decentralized stabilization
uncertain dynamic systems
closed-loop systems
robust control
large scale systems


Breast MR imaging with high spectral and spatial resolutions: preliminary experience

Abstract: The authors evaluated magnetic resonance (MR) imaging with high spectral and spatial resolutions (HSSR) of water and fat in breasts of healthy volunteers (n=6) and women with suspicious lesions (n=6). Fat suppression, edge delineation, and image texture were improved on MR images derived from HSSR data compared with those on conventional MR images. HSSR MR imaging data acquired before and after contrast medium injection showed spectrally inhomogeneous changes in the water resonances in small voxels that were not detectable with conventional MR imaging

breast mr imag with high spectral and spatial resolut : preliminari experi
 the author evalu magnet reson ( mr ) imag with high spectral and spatial resolut ( hssr ) of water and fat in breast of healthi volunt ( n=6 ) and women with suspici lesion ( n=6 ) . fat suppress , edg delin , and imag textur were improv on mr imag deriv from hssr data compar with those on convent mr imag . hssr mr imag data acquir befor and after contrast medium inject show spectral inhomogen chang in the water reson in small voxel that were not detect with convent mr imag

healthy volunteers
women
suspicious lesions
fat suppression
edge delineation
image texture
contrast medium injection
water resonances
small voxels
breast magnetic resonance imaging
high spectral spatial resolutions
magnetic resonance images
magnetic resonance imaging data


Combining constraint programming and linear programming on an example of bus driver scheduling

Abstract: Provides details of a successful application where the column generation algorithm was used to combine constraint programming and linear programming. In the past, constraint programming and linear programming were considered to be two competing technologies that solved similar types of problems. Both these technologies had their strengths and weaknesses. The paper shows that the two technologies can be combined together to extract the strengths of both these technologies. Details of a real-world application to optimize bus driver duties are given. This system was developed by ILOG for a major software house in Japan using ILOG-Solver and ILOG-CPLEX, constraint programming and linear programming C/C++ libraries

combin constraint program and linear program on an exampl of bu driver schedul
 provid detail of a success applic where the column gener algorithm wa use to combin constraint program and linear program . in the past , constraint program and linear program were consid to be two compet technolog that solv similar type of problem . both these technolog had their strength and weak . the paper show that the two technolog can be combin togeth to extract the strength of both these technolog . detail of a real-world applic to optim bu driver duti are given . thi system wa develop by ilog for a major softwar hous in japan use ilog-solv and ilog-cplex , constraint program and linear program c / c++ librari

constraint programming
linear programming
bus driver scheduling
column generation algorithm
ILOG
ILOG-Solver
ILOG-CPLEX
C/C++ libraries


Error resilient intra refresh scheme for H.26L stream

Abstract: Recently much attention has been focused on video streaming through IP-based networks. An error resilient RD intra macro-block refresh scheme for H.26L Internet video streaming is introduced. Various channel simulations have proved that this scheme is more effective than those currently adopted in H.26L

error resili intra refresh scheme for h.26l stream
 recent much attent ha been focus on video stream through ip-bas network . an error resili rd intra macro-block refresh scheme for h.26l internet video stream is introduc . variou channel simul have prove that thi scheme is more effect than those current adopt in h.26l

IP-based networks
intra macro-block refresh scheme
Internet
channel simulations
H.26L video streaming
error resilient scheme
RD intra refresh scheme
video communication
RDerr scheme
RDall scheme


Knowledge model reuse: therapy decision through specialisation of a generic decision model

Abstract: We present the definition of the therapy decision task and its associated Heuristic Multi-Attribute (HM) solving method, in the form of a KADS-style specification. The goal of the therapy decision task is to identify the ideal therapy, for a given patient, in accordance with a set of objectives of a diverse nature constituting a global therapy-evaluation framework in which considerations such as patient preferences and quality-of-life results are integrated. We give a high-level overview of this task as a specialisation of the generic decision task, and additional decomposition methods for the subtasks involved. These subtasks possess some reflective capabilities for reasoning about self-models, particularly the learning subtask, which incrementally corrects and refines the model used to assess the effects of the therapies. This work illustrates the process of reuse in the framework of AI software development methodologies such as KADS-CommonKADS in order to obtain new (more specialised but still generic) components for the analysis libraries developed in this context. In order to maximise reuse benefits, where possible, the therapy decision task and HM method have been defined in terms of regular components from the earlier-mentioned libraries. To emphasise the importance of using a rigorous approach to the modelling of domain and method ontologies, we make extensive use of the semi-formal object-oriented analysis notation UML, together with its associated constraint language OCL, to illustrate the ontology of the decision method and the corresponding specific one of the therapy decision domain, the latter being a refinement via inheritance of the former

knowledg model reus : therapi decis through specialis of a gener decis model
 we present the definit of the therapi decis task and it associ heurist multi-attribut ( hm ) solv method , in the form of a kads-styl specif . the goal of the therapi decis task is to identifi the ideal therapi , for a given patient , in accord with a set of object of a divers natur constitut a global therapy-evalu framework in which consider such as patient prefer and quality-of-lif result are integr . we give a high-level overview of thi task as a specialis of the gener decis task , and addit decomposit method for the subtask involv . these subtask possess some reflect capabl for reason about self-model , particularli the learn subtask , which increment correct and refin the model use to assess the effect of the therapi . thi work illustr the process of reus in the framework of ai softwar develop methodolog such as kads-commonkad in order to obtain new ( more specialis but still gener ) compon for the analysi librari develop in thi context . in order to maximis reus benefit , where possibl , the therapi decis task and hm method have been defin in term of regular compon from the earlier-ment librari . to emphasis the import of use a rigor approach to the model of domain and method ontolog , we make extens use of the semi-form object-ori analysi notat uml , togeth with it associ constraint languag ocl , to illustr the ontolog of the decis method and the correspond specif one of the therapi decis domain , the latter be a refin via inherit of the former

Heuristic Multi-Attribute solving method


A numerical C/sup 1/-shadowing result for retarded functional differential equations

Abstract: This paper gives a numerical C/sup 1/-shadowing between the exact solutions of a functional differential equation and its numerical approximations. The shadowing result is obtained by comparing exact solutions with numerical approximation which do not share the same initial value. Behavior of stable manifolds of functional differential equations under numerics will follow from the shadowing result

a numer c / sup 1/-shadow result for retard function differenti equat
 thi paper give a numer c / sup 1/-shadow between the exact solut of a function differenti equat and it numer approxim . the shadow result is obtain by compar exact solut with numer approxim which do not share the same initi valu . behavior of stabl manifold of function differenti equat under numer will follow from the shadow result


Process specialization: defining specialization for state diagrams

Abstract: A precise definition of specialization and inheritance promises to be as useful in organizational process modeling as it is in object modeling. It would help us better understand, maintain, reuse, and generate process models. However, even though object-oriented analysis and design methodologies take full advantage of the object specialization hierarchy, the process specialization hierarchy is not supported in major process representations, such as the state diagram, data flow diagram, and UML representations. Partly underlying this lack of support is an implicit assumption that we can always specialize a process by treating it as "just another object." We argue in this paper that this is not so straightforward as it might seem; we argue that a process-specific approach must be developed. We propose such an approach in the form of a set of transformations which, when applied to a process description, always result in specialization. We illustrate this approach by applying it to the state diagram representation and demonstrate that this approach to process specialization is not only theoretically possible, but shows promise as a method for categorizing and analyzing processes. We point out apparent inconsistencies between our notion of process specialization and existing work on object specialization but show that these inconsistencies are superficial and that the definition we provide is compatible with the traditional notion of specialization

process special : defin special for state diagram
 a precis definit of special and inherit promis to be as use in organiz process model as it is in object model . it would help us better understand , maintain , reus , and gener process model . howev , even though object-ori analysi and design methodolog take full advantag of the object special hierarchi , the process special hierarchi is not support in major process represent , such as the state diagram , data flow diagram , and uml represent . partli underli thi lack of support is an implicit assumpt that we can alway special a process by treat it as " just anoth object . " we argu in thi paper that thi is not so straightforward as it might seem ; we argu that a process-specif approach must be develop . we propos such an approach in the form of a set of transform which , when appli to a process descript , alway result in special . we illustr thi approach by appli it to the state diagram represent and demonstr that thi approach to process special is not onli theoret possibl , but show promis as a method for categor and analyz process . we point out appar inconsist between our notion of process special and exist work on object special but show that these inconsist are superfici and that the definit we provid is compat with the tradit notion of special

process specialization
state diagrams
inheritance
organizational process modeling
object-oriented analysis
object specialization hierarchy
process representation
object-oriented design


The theory of information reversal

Abstract: The end of the industrial age coincides with the advent of the information society as the next model of social and economic organization, which brings about significant changes in the way modern man conceives work and the social environment. The functional basis of the new model is pivoted upon the effort to formulate the theory on the violent reversal of the basic relationship between man and information, and isolate it as one of the components for the creation of the new electronic reality. The objective of the theory of reversal is to effectively contribute to the formulation of a new definition consideration in regards to the concept of the emerging information society. In order to empirically apply the theory of reversal, we examine a case study based on the example of the digital library

the theori of inform revers
 the end of the industri age coincid with the advent of the inform societi as the next model of social and econom organ , which bring about signific chang in the way modern man conceiv work and the social environ . the function basi of the new model is pivot upon the effort to formul the theori on the violent revers of the basic relationship between man and inform , and isol it as one of the compon for the creation of the new electron realiti . the object of the theori of revers is to effect contribut to the formul of a new definit consider in regard to the concept of the emerg inform societi . in order to empir appli the theori of revers , we examin a case studi base on the exampl of the digit librari

industrial age
information society
economic organization
case study
digital library
information reversal theory
social organization
information systems


Supporting global user profiles through trusted authorities

Abstract: Personalization generally refers to making a Web site more responsive to the unique and individual needs of each user. We argue that for personalization to work effectively, detailed and interoperable user profiles should be globally available for authorized sites, and these profiles should dynamically reflect changes in user interests. Creating user profiles from user click-stream data seems to be an effective way of generating detailed and dynamic user profiles. However, a user profile generated in this way is available only on the computer where the user accesses his browser, and is inaccessible when the same user works on a different computer. On the other hand, integration of the Internet with telecommunication networks has made it possible for the users to connect to the Web with a variety of mobile devices as well as desktops. This requires that user profiles should be available to any desktop or mobile device on the Internet that users choose to work with. In this paper, we address these problems through the concept of "trusted authority". A user agent at the client side that captures the user click stream, dynamically generates a navigational history 'log' file in Extensible Markup Language (XML). This log file is then used to produce 'user profiles' in a resource description framework (RDF). A user's right to privacy is provided through the Platform for Privacy Preferences (P3P) standard. User profiles are uploaded to the trusted authority and served next time the user connects to the Web

support global user profil through trust author
 person gener refer to make a web site more respons to the uniqu and individu need of each user . we argu that for person to work effect , detail and interoper user profil should be global avail for author site , and these profil should dynam reflect chang in user interest . creat user profil from user click-stream data seem to be an effect way of gener detail and dynam user profil . howev , a user profil gener in thi way is avail onli on the comput where the user access hi browser , and is inaccess when the same user work on a differ comput . on the other hand , integr of the internet with telecommun network ha made it possibl for the user to connect to the web with a varieti of mobil devic as well as desktop . thi requir that user profil should be avail to ani desktop or mobil devic on the internet that user choos to work with . in thi paper , we address these problem through the concept of " trust author " . a user agent at the client side that captur the user click stream , dynam gener a navig histori ' log ' file in extens markup languag ( xml ) . thi log file is then use to produc ' user profil ' in a resourc descript framework ( rdf ) . a user 's right to privaci is provid through the platform for privaci prefer ( p3p ) standard . user profil are upload to the trust author and serv next time the user connect to the web

Platform for Privacy Preferences standard

globally unique user ID/password identification


Control of integral processes with dead-time. 2. Quantitative analysis

Abstract: For part 1, see ibid., p.285-90, (2002). Several different control schemes for integral processes with dead time resulted in the same disturbance response. It has already been shown that such a response is subideal. Hence, it is necessary to quantitatively analyse the achievable specifications and the robust stability regions. The control parameter can be quantitatively determined with a compromise between the disturbance response and the robustness. Four specifications: (normalised) maximum dynamic error, maximum decay rate, (normalised) control action bound and approximate recovery time are used to characterise the step-disturbance response. It is shown that any attempt to obtain a (normalised) dynamic error less than tau /sub m/ is impossible and a sufficient condition on the (relative) gain-uncertainty bound is square root (3)/2

control of integr process with dead-tim . 2 . quantit analysi
 for part 1 , see ibid . , p.285 - 90 , ( 2002 ) . sever differ control scheme for integr process with dead time result in the same disturb respons . it ha alreadi been shown that such a respons is subid . henc , it is necessari to quantit analys the achiev specif and the robust stabil region . the control paramet can be quantit determin with a compromis between the disturb respons and the robust . four specif : ( normalis ) maximum dynam error , maximum decay rate , ( normalis ) control action bound and approxim recoveri time are use to characteris the step-disturb respons . it is shown that ani attempt to obtain a ( normalis ) dynam error less than tau /sub m/ is imposs and a suffici condit on the ( rel ) gain-uncertainti bound is squar root ( 3)/2

integral processes
dead-time
quantitative analysis
disturbance response
robust stability regions
robustness
maximum dynamic error
maximum decay rate
control action bound
approximate recovery time
step-disturbance response
sufficient condition
gain-uncertainty bound


Hand-held digital video-camera for eye examination and follow-up

Abstract: We developed a hand-held digital colour video-camera for eye examination in primary care. The device weighed 550 g. It featured a charge-coupled device (CCD) and corrective optics. Both colour video and digital still images could be taken. The video-camera was connected to a PC with software for database storage, image processing and telecommunication. We studied 88 normal subjects (38 male, 50 female), aged 7-62 years. It was not necessary to use mydriatic eye drops for pupillary dilation. Satisfactory digital images of the whole face and the anterior eye were obtained. The optic disc and the central part of the ocular fundus could also be recorded. Image quality of the face and the anterior eye were excellent; image quality of the optic disc and macula were good enough for tele-ophthalmology. Further studies are needed to evaluate the usefulness of the equipment in different clinical conditions

hand-held digit video-camera for eye examin and follow-up
 we develop a hand-held digit colour video-camera for eye examin in primari care . the devic weigh 550 g. it featur a charge-coupl devic ( ccd ) and correct optic . both colour video and digit still imag could be taken . the video-camera wa connect to a pc with softwar for databas storag , imag process and telecommun . we studi 88 normal subject ( 38 male , 50 femal ) , age 7 - 62 year . it wa not necessari to use mydriat eye drop for pupillari dilat . satisfactori digit imag of the whole face and the anterior eye were obtain . the optic disc and the central part of the ocular fundu could also be record . imag qualiti of the face and the anterior eye were excel ; imag qualiti of the optic disc and macula were good enough for tele-ophthalmolog . further studi are need to evalu the use of the equip in differ clinic condit

eye examination
follow-up
primary care
charge-coupled device
corrective optics
digital still images
PC
software
database storage
image processing
telecommunication
normal subjects
whole face
anterior eye
optic disc
ocular fundus
image quality
tele-ophthalmology
clinical conditions
hand-held digital colour video camera
colour video images

P P P P P P P P P P P P P P P P P P P M R


Linear tense logics of increasing sets

Abstract: We provide an extension of the language of linear tense logic with future and past connectives F and P, respectively, by a modality that quantifies over the points of some set which is assumed to increase in the course of time. In this way we obtain a general framework for modelling growth qualitatively. We develop an appropriate logical system, prove a corresponding completeness and decidability result and discuss the various kinds of flow of time in the new context. We also consider decreasing sets briefly

linear tens logic of increas set
 we provid an extens of the languag of linear tens logic with futur and past connect f and p , respect , by a modal that quantifi over the point of some set which is assum to increas in the cours of time . in thi way we obtain a gener framework for model growth qualit . we develop an appropri logic system , prove a correspond complet and decid result and discuss the variou kind of flow of time in the new context . we also consid decreas set briefli

linear tense logic
future and past connectives
logical system
completeness
decidability
decreasing sets
temporal reasoning


The open-source HCS project

Abstract: Despite the rumors, the HCS II project is not dead. In fact, HCS has been licensed and is now an open-source project. In this article, the author brings us up to speed on the HCS II project's past, present, and future. The HCS II is an expandable, standalone, network-based (RS-485), intelligent-node, industrial-oriented supervisory control (SC) system intended for demanding home control applications. The HCS incorporates direct and remote digital inputs and outputs, direct and remote analog inputs and outputs, real time or Boolean decision event triggering, X10 transmission and reception, infrared remote control transmission and reception, remote LCDs, and a master console. Its program is compiled on a PC with the XPRESS compiler and then downloaded to the SC where it runs independently of the PC

the open-sourc hc project
 despit the rumor , the hc ii project is not dead . in fact , hc ha been licens and is now an open-sourc project . in thi articl , the author bring us up to speed on the hc ii project 's past , present , and futur . the hc ii is an expand , standalon , network-bas ( rs-485 ) , intelligent-nod , industrial-ori supervisori control ( sc ) system intend for demand home control applic . the hc incorpor direct and remot digit input and output , direct and remot analog input and output , real time or boolean decis event trigger , x10 transmiss and recept , infrar remot control transmiss and recept , remot lcd , and a master consol . it program is compil on a pc with the xpress compil and then download to the sc where it run independ of the pc

HCS II
network-based
home control
supervisory control system


Ethnography, customers, and negotiated interactions at the airport

Abstract: In the late 1990s, tightly coordinated airline schedules unraveled owing to massive delays resulting from inclement weather, overbooked flights, and airline operational difficulties. As schedules slipped, the delayed departures and late arrivals led to systemwide breakdowns, customers missed their connections, and airline work activities fell further out of sync. In offering possible answers, we emphasize the need to consider the customer as participant, following the human-centered computing model. Our study applied ethnographic methods to understand the airline system domain and the nature of airline delays, and it revealed the deficiencies of the airline production system model of operations. The research insights that led us to shift from a production and marketing system perspective to a customer-as-participant view might appear obvious to some readers. However, we do not know of any airline that designs its operations and technologies around any other model than the production and marketing system view. Our human-centered analysis used ethnographic methods to gather information, offering new insight into airline delays and suggesting effective ways to improve operations reliability

ethnographi , custom , and negoti interact at the airport
 in the late 1990 , tightli coordin airlin schedul unravel owe to massiv delay result from inclement weather , overbook flight , and airlin oper difficulti . as schedul slip , the delay departur and late arriv led to systemwid breakdown , custom miss their connect , and airlin work activ fell further out of sync . in offer possibl answer , we emphas the need to consid the custom as particip , follow the human-cent comput model . our studi appli ethnograph method to understand the airlin system domain and the natur of airlin delay , and it reveal the defici of the airlin product system model of oper . the research insight that led us to shift from a product and market system perspect to a customer-as-particip view might appear obviou to some reader . howev , we do not know of ani airlin that design it oper and technolog around ani other model than the product and market system view . our human-cent analysi use ethnograph method to gather inform , offer new insight into airlin delay and suggest effect way to improv oper reliabl

airline production system operations model


Effectiveness of user testing and heuristic evaluation as a function of performance classification

Abstract: For different levels of user performance, different types of information are processed and users will make different types of errors. Based on the error's immediate cause and the information being processed, usability problems can be classified into three categories. They are usability problems associated with skill-based, rule-based and knowledge-based levels of performance. In this paper, a user interface for a Web-based software program was evaluated with two usability evaluation methods, user testing and heuristic evaluation. The experiment discovered that the heuristic evaluation with human factor experts is more effective than user testing in identifying usability problems associated with skill-based and rule-based levels of performance. User testing is more effective than heuristic evaluation in finding usability problems associated with the knowledge-based level of performance. The practical application of this research is also discussed in the paper

effect of user test and heurist evalu as a function of perform classif
 for differ level of user perform , differ type of inform are process and user will make differ type of error . base on the error 's immedi caus and the inform be process , usabl problem can be classifi into three categori . they are usabl problem associ with skill-bas , rule-bas and knowledge-bas level of perform . in thi paper , a user interfac for a web-bas softwar program wa evalu with two usabl evalu method , user test and heurist evalu . the experi discov that the heurist evalu with human factor expert is more effect than user test in identifi usabl problem associ with skill-bas and rule-bas level of perform . user test is more effect than heurist evalu in find usabl problem associ with the knowledge-bas level of perform . the practic applic of thi research is also discuss in the paper

user testing
heuristic evaluation
performance classification
user performance
usability
user interface
Web-based software
experiment
human factors
knowledge-based performance levels
skill-based performance levels
rule-based performance levels


Single machine earliness-tardiness scheduling with resource-dependent release dates

Abstract: This paper deals with the single machine earliness and tardiness scheduling problem with a common due date and resource-dependent release dates. It is assumed that the cost of resource consumption of a job is a non-increasing linear function of the job release date, and this function is common for all jobs. The objective is to find a schedule and job release dates that minimize the total resource consumption, and earliness and tardiness penalties. It is shown that the problem is NP-hard in the ordinary sense even if the due date is unrestricted (the number of jobs that can be scheduled before the due date is unrestricted). An exact dynamic programming (DP) algorithm for small and medium size problems is developed. A heuristic algorithm for large-scale problems is also proposed and the results of a computational comparison between heuristic and optimal solutions are discussed

singl machin earliness-tardi schedul with resource-depend releas date
 thi paper deal with the singl machin earli and tardi schedul problem with a common due date and resource-depend releas date . it is assum that the cost of resourc consumpt of a job is a non-increas linear function of the job releas date , and thi function is common for all job . the object is to find a schedul and job releas date that minim the total resourc consumpt , and earli and tardi penalti . it is shown that the problem is np-hard in the ordinari sens even if the due date is unrestrict ( the number of job that can be schedul befor the due date is unrestrict ) . an exact dynam program ( dp ) algorithm for small and medium size problem is develop . a heurist algorithm for large-scal problem is also propos and the result of a comput comparison between heurist and optim solut are discuss

single machine earliness-tardiness scheduling


The design and implementation of VAMPIRE

Abstract: We describe VAMPIRE: a high-performance theorem prover for first-order logic. As our description is mostly targeted to the developers of such systems and specialists in automated reasoning, it focuses on the design of the system and some key implementation features. We also analyze the performance of the prover at CASC-JC

the design and implement of vampir
 we describ vampir : a high-perform theorem prover for first-ord logic . as our descript is mostli target to the develop of such system and specialist in autom reason , it focus on the design of the system and some key implement featur . we also analyz the perform of the prover at casc-jc

VAMPIRE
high-performance theorem prover
first-order logic
automated reasoning
CASC-JC
performance evaluation
resolution theorem proving


Approximation of pathwidth of outerplanar graphs

Abstract: There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs, but the large exponent makes this algorithm impractical. In this paper, we give an algorithm that, given a biconnected outerplanar graph G, finds a path decomposition of G of pathwidth at most twice the pathwidth of G plus one. To obtain the result, several relations between the pathwidth of a biconnected outerplanar graph and its dual are established

approxim of pathwidth of outerplanar graph
 there exist a polynomi time algorithm to comput the pathwidth of outerplanar graph , but the larg expon make thi algorithm impract . in thi paper , we give an algorithm that , given a biconnect outerplanar graph g , find a path decomposit of g of pathwidth at most twice the pathwidth of g plu one . to obtain the result , sever relat between the pathwidth of a biconnect outerplanar graph and it dual are establish

outerplanar graphs
polynomial time algorithm
biconnected outerplanar graph
path decomposition
pathwidth approximation


L/sub 2/ model reduction and variance reduction

Abstract: We examine certain variance properties of model reduction. The focus is on L/sub 2/ model reduction, but some general results are also presented. These general results can be used to analyze various other model reduction schemes. The models we study are finite impulse response (FIR) and output error (OE) models. We compare the variance of two estimated models. The first one is estimated directly from data and the other one is computed by reducing a high order model, by L/sub 2/ model reduction. In the FIR case we show that it is never better to estimate the model directly from data, compared to estimating it via L/sub 2/ model reduction of a high order FIR model. For OE models we show that the reduced model has the same variance as the directly estimated one if the reduced model class used contains the true system

l / sub 2/ model reduct and varianc reduct
 we examin certain varianc properti of model reduct . the focu is on l / sub 2/ model reduct , but some gener result are also present . these gener result can be use to analyz variou other model reduct scheme . the model we studi are finit impuls respons ( fir ) and output error ( oe ) model . we compar the varianc of two estim model . the first one is estim directli from data and the other one is comput by reduc a high order model , by l / sub 2/ model reduct . in the fir case we show that it is never better to estim the model directli from data , compar to estim it via l / sub 2/ model reduct of a high order fir model . for oe model we show that the reduc model ha the same varianc as the directli estim one if the reduc model class use contain the true system

L/sub 2/ model reduction
variance reduction
FIR models
finite impulse response models
output error models
identification


Non-linear analysis of nearly saturated porous media: theoretical and numerical formulation

Abstract: A formulation for a porous medium saturated with a compressible fluid undergoing large elastic and plastic deformations is presented. A consistent thermodynamic formulation is proposed for the two-phase mixture problem; thus preserving a straightforward and robust numerical scheme. A novel feature is the specification of the fluid compressibility in terms of a volumetric logarithmic strain, which is energy conjugated to the fluid pressure in the entropy inequality. As a result, the entropy inequality is used to separate three different mechanisms representing the response: effective stress response according to Terzaghi in the solid skeleton, fluid pressure response to compressibility of the fluid, and dissipative Darcy flow representing the interaction between the two phases. The paper is concluded with a couple of numerical examples that display the predictive capabilities of the proposed formulation. In particular, we consider results for the kinematically linear theory as compared to the kinematically non-linear theory

non-linear analysi of nearli satur porou media : theoret and numer formul
 a formul for a porou medium satur with a compress fluid undergo larg elast and plastic deform is present . a consist thermodynam formul is propos for the two-phas mixtur problem ; thu preserv a straightforward and robust numer scheme . a novel featur is the specif of the fluid compress in term of a volumetr logarithm strain , which is energi conjug to the fluid pressur in the entropi inequ . as a result , the entropi inequ is use to separ three differ mechan repres the respons : effect stress respons accord to terzaghi in the solid skeleton , fluid pressur respons to compress of the fluid , and dissip darci flow repres the interact between the two phase . the paper is conclud with a coupl of numer exampl that display the predict capabl of the propos formul . in particular , we consid result for the kinemat linear theori as compar to the kinemat non-linear theori

nearly saturated porous media
compressible fluid
consistent thermodynamic formulation
two-phase mixture problem
robust numerical scheme
fluid compressibility
volumetric logarithmic strain
fluid pressure
entropy inequality
effective stress response
solid skeleton
fluid pressure response
dissipative Darcy flow
predictive capabilities
kinematically linear theory
nonlinear analysis
large elastic deformations
large plastic deformations
kinematically nonlinear theory


Two-layer model for the formation of states of the hidden Markov chains

Abstract: Procedures for the formation of states of the hidden Markov models are described. Formant amplitudes and frequencies are used as state features. The training strategy is presented that allows one to calculate the parameters of conditional probabilities of the generation of a given formant set by a given hidden state with the help of the maximum likelihood method

two-lay model for the format of state of the hidden markov chain
 procedur for the format of state of the hidden markov model are describ . formant amplitud and frequenc are use as state featur . the train strategi is present that allow one to calcul the paramet of condit probabl of the gener of a given formant set by a given hidden state with the help of the maximum likelihood method

hidden Markov models
formant amplitudes
state features
conditional probabilities
hidden state
maximum likelihood method
formant frequencies


Numerical studies of 2D free surface waves with fixed bottom

Abstract: The motion of surface waves under the effect of bottom is a very interesting and challenging phenomenon in the nature. we use boundary integral method to compute and analyze this problem. In the linear analysis, the linearized equations have bounded error increase under some compatible conditions. This contributes to the cancellation of instable Kelvin-Helmholtz terms. Under the effect of bottom, the existence of equations is hard to determine, but given some limitations it proves true. These limitations are that the swing of interfaces should be small enough, and the distance between surface and bottom should be large enough. In order to maintain the stability of computation, some compatible relationship must be satisfied. In the numerical examples, the simulation of standing waves and breaking waves are calculated. And in the case of shallow bottom, we found that the behavior of waves are rather singular

numer studi of 2d free surfac wave with fix bottom
 the motion of surfac wave under the effect of bottom is a veri interest and challeng phenomenon in the natur . we use boundari integr method to comput and analyz thi problem . in the linear analysi , the linear equat have bound error increas under some compat condit . thi contribut to the cancel of instabl kelvin-helmholtz term . under the effect of bottom , the exist of equat is hard to determin , but given some limit it prove true . these limit are that the swing of interfac should be small enough , and the distanc between surfac and bottom should be larg enough . in order to maintain the stabil of comput , some compat relationship must be satisfi . in the numer exampl , the simul of stand wave and break wave are calcul . and in the case of shallow bottom , we found that the behavior of wave are rather singular

numerical studies
2D free surface waves
boundary integral method
linear analysis
linearized equations
instable Kelvin-Helmholtz terms


Contracting in the days of ebusiness

Abstract: Putting electronic business on a sound foundation-model theoretically as well as technologically-is a central challenge for research as well as commercial development. This paper concentrates on the discovery and negotiation phase of concluding an agreement based on a contract. We present a methodology for moving seamlessly from a many-to-many relationship in the discovery phase to a one-to-one relationship in the contract negotiation phase. Making the content of contracts persistent is achieved by reconstructing contract templates by means of mereologic (logic of the whole-part relation). Possibly nested sub-structures of the contract template are taken as a basis for negotiation in a dialogical way. For the negotiation itself the contract templates are extended by implications (logical) and sequences (topical)

contract in the day of ebusi
 put electron busi on a sound foundation-model theoret as well as technologically-i a central challeng for research as well as commerci develop . thi paper concentr on the discoveri and negoti phase of conclud an agreement base on a contract . we present a methodolog for move seamlessli from a many-to-mani relationship in the discoveri phase to a one-to-on relationship in the contract negoti phase . make the content of contract persist is achiev by reconstruct contract templat by mean of mereolog ( logic of the whole-part relat ) . possibl nest sub-structur of the contract templat are taken as a basi for negoti in a dialog way . for the negoti itself the contract templat are extend by implic ( logic ) and sequenc ( topic )

contracting
electronic business
many-to-many relationship
discovery phase
one-to-one relationship
contract negotiation phase
contract templates
mereologic
nested sub-structure
implications
sequences


Breast cancer: effectiveness of computer-aided diagnosis-observer study with independent database of mammograms

Abstract: Evaluates the effectiveness of a computerized classification method as an aid to radiologists reviewing clinical mammograms for which the diagnoses were unknown to both the radiologists and the computer. Six mammographers and six community radiologists participated in an observer study. These 12 radiologists interpreted, with and without the computer aid, 110 cases that were unknown to both the 12 radiologist observers and the trained computer classification scheme. The radiologists' performances in differentiating between benign and malignant masses without and with the computer aid were evaluated with receiver operating characteristic (ROC) analysis. Two-tailed P values were calculated for the Student t test to indicate the statistical significance of the differences in performances with and without the computer aid. When the computer aid was used, the average performance of the 12 radiologists improved, as indicated by an increase in the area under the ROC curve (A/sub z/) from 0.93 to 0.96 (P<.001), by an increase in partial area under the ROC curve (/sub 0.9/0A'/sub z/) from 0.56 to 0.72 (P<.001), and by an increase in sensitivity from 94% to 98% (P=.022). No statistically significant difference in specificity was found between readings with and those without computer aid ( Delta +-0.014; P=.46; 95% Cl: -0.054, 0.026), where Delta is difference in specificity. When we analyzed results from the mammographers and community radiologists as separate groups, a larger improvement was demonstrated for the community radiologists. Computer-aided diagnosis can potentially help radiologists improve their diagnostic accuracy in the task of differentiating between benign and malignant masses seen on mammograms

breast cancer : effect of computer-aid diagnosis-observ studi with independ databas of mammogram
 evalu the effect of a computer classif method as an aid to radiologist review clinic mammogram for which the diagnos were unknown to both the radiologist and the comput . six mammograph and six commun radiologist particip in an observ studi . these 12 radiologist interpret , with and without the comput aid , 110 case that were unknown to both the 12 radiologist observ and the train comput classif scheme . the radiologist ' perform in differenti between benign and malign mass without and with the comput aid were evalu with receiv oper characterist ( roc ) analysi . two-tail p valu were calcul for the student t test to indic the statist signific of the differ in perform with and without the comput aid . when the comput aid wa use , the averag perform of the 12 radiologist improv , as indic by an increas in the area under the roc curv ( a / sub z/ ) from 0.93 to 0.96 ( p<.001 ) , by an increas in partial area under the roc curv ( /sub 0.9/0a'/sub z/ ) from 0.56 to 0.72 ( p<.001 ) , and by an increas in sensit from 94 % to 98 % ( p=.022 ) . no statist signific differ in specif wa found between read with and those without comput aid ( delta + -0.014 ; p=.46 ; 95 % cl : -0.054 , 0.026 ) , where delta is differ in specif . when we analyz result from the mammograph and commun radiologist as separ group , a larger improv wa demonstr for the commun radiologist . computer-aid diagnosi can potenti help radiologist improv their diagnost accuraci in the task of differenti between benign and malign mass seen on mammogram

receiver operating characteristic analysis

P P P P P P P P P P P P P P P P P P R R R


New Jersey African American women writers and their publications: a study of identification from written and oral sources

Abstract: This study examines the use of written sources, and personal interviews and informal conversations with individuals from New Jersey's religious, political, and educational community to identify African American women writers in New Jersey and their intellectual output. The focus on recognizing the community as an oral repository of history and then tapping these oral sources for collection development and acquisition purposes is supported by empirical and qualitative evidence. Findings indicate that written sources are so limited that information professionals must rely on oral sources to uncover local writers and their publications

new jersey african american women writer and their public : a studi of identif from written and oral sourc
 thi studi examin the use of written sourc , and person interview and inform convers with individu from new jersey 's religi , polit , and educ commun to identifi african american women writer in new jersey and their intellectu output . the focu on recogn the commun as an oral repositori of histori and then tap these oral sourc for collect develop and acquisit purpos is support by empir and qualit evid . find indic that written sourc are so limit that inform profession must reli on oral sourc to uncov local writer and their public


Unlocking the potential of videoconferencing

Abstract: I propose in this paper to show, through a number of case studies, that videoconferencing is user-friendly, cost-effective, time-effective and life-enhancing for people of all ages and abilities and that it requires only a creative and imaginative approach to unlock its potential. I believe that these benefits need not, and should not, be restricted to the education sector. My examples will range from simple storytelling, through accessing international experts, professional development and distance learning in a variety of forms, to the use of videoconferencing for virtual meetings and planning sessions. In some cases, extracts from the reactions and responses of the participants will be included to illustrate the impact of the medium

unlock the potenti of videoconferenc
 i propos in thi paper to show , through a number of case studi , that videoconferenc is user-friendli , cost-effect , time-effect and life-enhanc for peopl of all age and abil and that it requir onli a creativ and imagin approach to unlock it potenti . i believ that these benefit need not , and should not , be restrict to the educ sector . my exampl will rang from simpl storytel , through access intern expert , profession develop and distanc learn in a varieti of form , to the use of videoconferenc for virtual meet and plan session . in some case , extract from the reaction and respons of the particip will be includ to illustr the impact of the medium

videoconferencing
case studies
benefits
education


A winning combination [wireless health care]

Abstract: Three years ago, the Institute of Medicine (IOM) reported that medical errors result in at least 44,000 deaths each year-more than deaths from highway accidents, breast cancer or AIDS. That report, and others which placed serious errors as high as 98,000 annually, served as a wake-up call for healthcare providers such as the CareGroup Healthcare System Inc., a Boston-area healthcare network that is the second largest integrated delivery system in the northeastern United States. With annual revenues of $1.2B, CareGroup provides primary care and specialty services to more than 1,000,000 patients. CareGroup combined wireless technology with the Web to create a provider order entry (POE) system designed to reduce the frequency of costly medical mistakes. The POE infrastructure includes InterSystems Corporation's CACHE database, Dell Computer C600 laptops and Cisco Systems' Aironet 350 wireless networks

a win combin [ wireless health care ]
 three year ago , the institut of medicin ( iom ) report that medic error result in at least 44,000 death each year-mor than death from highway accid , breast cancer or aid . that report , and other which place seriou error as high as 98,000 annual , serv as a wake-up call for healthcar provid such as the caregroup healthcar system inc. , a boston-area healthcar network that is the second largest integr deliveri system in the northeastern unit state . with annual revenu of $ 1.2b , caregroup provid primari care and specialti servic to more than 1,000,000 patient . caregroup combin wireless technolog with the web to creat a provid order entri ( poe ) system design to reduc the frequenc of costli medic mistak . the poe infrastructur includ intersystem corpor 's cach databas , dell comput c600 laptop and cisco system ' aironet 350 wireless network

Cisco Systems Aironet 350 wireless networks


Superconvergence of discontinuous Galerkin method for nonstationary hyperbolic equation

Abstract: For the first order nonstationary hyperbolic equation taking the piecewise linear discontinuous Galerkin solver, we prove that under the uniform rectangular partition, such a discontinuous solver, after postprocessing, can have two and half approximative order which is half order higher than the optimal estimate by P. Lesaint and P. Raviart (1974) under the rectangular partition

superconverg of discontinu galerkin method for nonstationari hyperbol equat
 for the first order nonstationari hyperbol equat take the piecewis linear discontinu galerkin solver , we prove that under the uniform rectangular partit , such a discontinu solver , after postprocess , can have two and half approxim order which is half order higher than the optim estim by p. lesaint and p. raviart ( 1974 ) under the rectangular partit

superconvergence of discontinuous Galerkin method


One and two facility network design revisited

Abstract: The one facility one commodity network design problem (OFOC) with nonnegative flow costs considers the problem of sending d units of flow from a source to a destination where arc capacity is purchased in batches of C units. The two facility problem (TFOC) is similar, but capacity can be purchased either in batches of C units or one unit. Flow costs are zero. These problems are known to be NP-hard. We describe an exact O(n/sup 3/3/sup n/) algorithm for these problems based on the repeated use of a bipartite matching algorithm. We also present a better lower bound of Omega (n/sup 2k*/) for an earlier Omega (n/sup 2k/) algorithm described in the literature where k = [d/C] and k* = min{k, [(n 2)/2]}. The matching algorithm is faster than this one for k >or= [(n - 2)/2]. Finally, we provide another reformulation of the problem that is quasi integral. This property could be useful in designing a modified version of the simplex method to solve the problem using a sequence of pivots with integer extreme solutions, referred to as the integral simplex method in the literature

one and two facil network design revisit
 the one facil one commod network design problem ( ofoc ) with nonneg flow cost consid the problem of send d unit of flow from a sourc to a destin where arc capac is purchas in batch of c unit . the two facil problem ( tfoc ) is similar , but capac can be purchas either in batch of c unit or one unit . flow cost are zero . these problem are known to be np-hard . we describ an exact o(n / sup 3/3 / sup n/ ) algorithm for these problem base on the repeat use of a bipartit match algorithm . we also present a better lower bound of omega ( n / sup 2k*/ ) for an earlier omega ( n / sup 2k/ ) algorithm describ in the literatur where k = [ d / c ] and k * = min{k , [ ( n 2)/2 ] } . the match algorithm is faster than thi one for k > or= [ ( n - 2)/2 ] . final , we provid anoth reformul of the problem that is quasi integr . thi properti could be use in design a modifi version of the simplex method to solv the problem use a sequenc of pivot with integ extrem solut , refer to as the integr simplex method in the literatur


A heuristic approach to resource locations in broadband networks

Abstract: In broadband networks, such as ATM, the importance of dynamic migration of data resources is increasing because of its potential to improve performance especially for transaction processing. In environments with migratory data resources, it is necessary to have mechanisms to manage the locations of each data resource. In this paper, we present an algorithm that makes use of system state information and heuristics to manage locations of data resources in a distributed network. In the proposed algorithm, each site maintains information about state of other sites with respect to each data resource of the system and uses it to find: (1) a subset of sites likely to have the requested data resource; and (2) the site where the data resource is to be migrated from the current site. The proposed algorithm enhances its effectiveness by continuously updating system state information stored at each site. It focuses on reducing the overall average time delay needed by the transaction requests to locate and access the migratory data resources. We evaluated the performance of the proposed algorithm and also compared it with one of the existing location management algorithms, by simulation studies under several system parameters such as the frequency of requests generation, frequency of data resource migrations, network topology and scale of network. The experimental results show the effectiveness of the proposed algorithm in all cases

a heurist approach to resourc locat in broadband network
 in broadband network , such as atm , the import of dynam migrat of data resourc is increas becaus of it potenti to improv perform especi for transact process . in environ with migratori data resourc , it is necessari to have mechan to manag the locat of each data resourc . in thi paper , we present an algorithm that make use of system state inform and heurist to manag locat of data resourc in a distribut network . in the propos algorithm , each site maintain inform about state of other site with respect to each data resourc of the system and use it to find : ( 1 ) a subset of site like to have the request data resourc ; and ( 2 ) the site where the data resourc is to be migrat from the current site . the propos algorithm enhanc it effect by continu updat system state inform store at each site . it focus on reduc the overal averag time delay need by the transact request to locat and access the migratori data resourc . we evalu the perform of the propos algorithm and also compar it with one of the exist locat manag algorithm , by simul studi under sever system paramet such as the frequenc of request gener , frequenc of data resourc migrat , network topolog and scale of network . the experiment result show the effect of the propos algorithm in all case

heuristics
resource locations
broadband networks
ATM
distributed network
data resource migrations
network topology


A novel preterm respiratory mechanics active simulator to test the performances of neonatal pulmonary ventilators

Abstract: A patient active simulator is proposed which is capable of reproducing values of the parameters of pulmonary mechanics of healthy newborns and preterm pathological infants. The implemented prototype is able to: (a) let the operator choose the respiratory pattern, times of apnea, episodes of cough, sobs, etc., (b) continuously regulate and control the parameters characterizing the pulmonary system; and, finally, (c) reproduce the attempt of breathing of a preterm infant. Taking into account both the limitation due to the chosen application field and the preliminary autocalibration phase automatically carried out by the proposed device, accuracy and reliability on the order of 1% is estimated. The previously indicated value has to be considered satisfactory in light of the field of application and the small values of the simulated parameters. Finally, the achieved metrological characteristics allow the described neonatal simulator to be adopted as a reference device to test performances of neonatal ventilators and, more specifically, to measure the time elapsed between the occurrence of a potentially dangerous condition to the patient and the activation of the corresponding alarm of the tested ventilator

a novel preterm respiratori mechan activ simul to test the perform of neonat pulmonari ventil
 a patient activ simul is propos which is capabl of reproduc valu of the paramet of pulmonari mechan of healthi newborn and preterm patholog infant . the implement prototyp is abl to : ( a ) let the oper choos the respiratori pattern , time of apnea , episod of cough , sob , etc . , ( b ) continu regul and control the paramet character the pulmonari system ; and , final , ( c ) reproduc the attempt of breath of a preterm infant . take into account both the limit due to the chosen applic field and the preliminari autocalibr phase automat carri out by the propos devic , accuraci and reliabl on the order of 1 % is estim . the previous indic valu ha to be consid satisfactori in light of the field of applic and the small valu of the simul paramet . final , the achiev metrolog characterist allow the describ neonat simul to be adopt as a refer devic to test perform of neonat ventil and , more specif , to measur the time elaps between the occurr of a potenti danger condit to the patient and the activ of the correspond alarm of the test ventil

P P P P P P P P R M U U U M M U U U U U U


On the design of gain-scheduled trajectory tracking controllers [AUV application]

Abstract: A new methodology is proposed for the design of trajectory tracking controllers for autonomous vehicles. The design technique builds on gain scheduling control theory. An application is made to the design of a trajectory tracking controller for a prototype autonomous underwater vehicle (AUV). The effectiveness and advantages of the new control laws derived are illustrated in simulation using a full set of non-linear equations of motion of the vehicle

on the design of gain-schedul trajectori track control [ auv applic ]
 a new methodolog is propos for the design of trajectori track control for autonom vehicl . the design techniqu build on gain schedul control theori . an applic is made to the design of a trajectori track control for a prototyp autonom underwat vehicl ( auv ) . the effect and advantag of the new control law deriv are illustr in simul use a full set of non-linear equat of motion of the vehicl

gain-scheduled trajectory tracking controller design


New hub gears up for algorithmic exchange

Abstract: Warwick University in the UK is on the up and up. Sometimes considered a typical 1960s, middle-of-the-road redbrick institution-not known for their distinction the 2001 UK Research Assessment Exercise (RAE) shows its research to be the fifth most highly-rated in the country, with outstanding standards in the sciences. This impressive performance has rightly given Warwick a certain amount of muscle, which it is flexing rather effectively, aided by a snappy approach to making things happen that leaves some older institutions standing. The result is a brand new Centre for Scientific Computing (CSC), launched within a couple of years of its initial conception

new hub gear up for algorithm exchang
 warwick univers in the uk is on the up and up . sometim consid a typic 1960 , middle-of-the-road redbrick institution-not known for their distinct the 2001 uk research assess exercis ( rae ) show it research to be the fifth most highly-r in the countri , with outstand standard in the scienc . thi impress perform ha rightli given warwick a certain amount of muscl , which it is flex rather effect , aid by a snappi approach to make thing happen that leav some older institut stand . the result is a brand new centr for scientif comput ( csc ) , launch within a coupl of year of it initi concept

Warwick University Centre for Scientific Computing


Development through gaming

Abstract: Mainstream observers commonly underestimate the role of fringe activities in propelling science and technology. Well-known examples are how wars have fostered innovation in areas such as communications, cryptography, medicine and aerospace; and how erotica has been a major factor in pioneering visual media, from the first printed books to photography, cinematography, videotape, or the latest online video streaming. The article aims to be a sampler of a less controversial, but still often underrated, symbiosis between scientific computing and computing for leisure and entertainment

develop through game
 mainstream observ commonli underestim the role of fring activ in propel scienc and technolog . well-known exampl are how war have foster innov in area such as commun , cryptographi , medicin and aerospac ; and how erotica ha been a major factor in pioneer visual media , from the first print book to photographi , cinematographi , videotap , or the latest onlin video stream . the articl aim to be a sampler of a less controversi , but still often underr , symbiosi between scientif comput and comput for leisur and entertain

scientific computing
leisure
entertainment
computer games
graphics


Improving supply-chain performance by sharing advance demand information

Abstract: In this paper, we analyze how sharing advance demand information (ADI) can improve supply-chain performance. We consider two types of ADI, aggregated ADI (A-ADI) and detailed ADI (D-ADI). With A-ADI, customers share with manufacturers information about whether they will place an order for some product in the next time period, but do not share information about which product they will order and which of several potential manufacturers will receive the order. With D-ADI, customers additionally share information about which product they will order, but which manufacturer will receive the order remains uncertain. We develop and solve mathematical models of supply chains where ADI is shared. We derive exact expressions and closed-form approximations for expected costs, expected base-stock levels, and variations of the production quantities. We show that both the manufacturer and the customers benefit from sharing ADI, but that sharing ADI increases the bullwhip effect. We also show that under certain conditions it is optimal to collect ADI from either none or all of the customers. We study two supply chains in detail: a supply chain with an arbitrary number of products that have identical demand rates, and a supply chain with two products that have arbitrary demand rates. For these two supply chains, we analyze how the values of A-ADI and D-ADI depend on the characteristics of the supply chain and on the quality of the shared information, and we identify conditions under which sharing A-ADI and D-ADI can significantly reduce cost. Our results can be used by decision makers to analyze the cost savings that can be achieved by sharing ADI and help them to determine if sharing ADI is beneficial for their supply chains

improv supply-chain perform by share advanc demand inform
 in thi paper , we analyz how share advanc demand inform ( adi ) can improv supply-chain perform . we consid two type of adi , aggreg adi ( a-adi ) and detail adi ( d-adi ) . with a-adi , custom share with manufactur inform about whether they will place an order for some product in the next time period , but do not share inform about which product they will order and which of sever potenti manufactur will receiv the order . with d-adi , custom addit share inform about which product they will order , but which manufactur will receiv the order remain uncertain . we develop and solv mathemat model of suppli chain where adi is share . we deriv exact express and closed-form approxim for expect cost , expect base-stock level , and variat of the product quantiti . we show that both the manufactur and the custom benefit from share adi , but that share adi increas the bullwhip effect . we also show that under certain condit it is optim to collect adi from either none or all of the custom . we studi two suppli chain in detail : a suppli chain with an arbitrari number of product that have ident demand rate , and a suppli chain with two product that have arbitrari demand rate . for these two suppli chain , we analyz how the valu of a-adi and d-adi depend on the characterist of the suppli chain and on the qualiti of the share inform , and we identifi condit under which share a-adi and d-adi can significantli reduc cost . our result can be use by decis maker to analyz the cost save that can be achiev by share adi and help them to determin if share adi is benefici for their suppli chain

advance demand information
aggregated ADI
detailed ADI
manufacturing
mathematical models
closed-form approximations
expected costs
expected base-stock levels
bullwhip effect
identical demand rates
arbitrary demand rates
decision makers
cost savings
supply-chain performance improvement
information sharing
production quantity variations
arbitrary product number
shared information quality
forecasting


Model checking games for branching time logics

Abstract: This paper defines and examines model checking games for the branching time temporal logic CTL*. The games employ a technique called focus which enriches sets by picking out one distinguished element. This is necessary to avoid ambiguities in the regeneration of temporal operators. The correctness of these games is proved, and optimizations are considered to obtain model checking games for important fragments of CTL*. A game based model checking algorithm that matches the known lower and upper complexity bounds is sketched

model check game for branch time logic
 thi paper defin and examin model check game for the branch time tempor logic ctl * . the game employ a techniqu call focu which enrich set by pick out one distinguish element . thi is necessari to avoid ambigu in the regener of tempor oper . the correct of these game is prove , and optim are consid to obtain model check game for import fragment of ctl * . a game base model check algorithm that match the known lower and upper complex bound is sketch

model checking games
branching time logics
temporal logic
temporal operators
complexity bounds


Adaptive thinning for bivariate scattered data

Abstract: This paper studies adaptive thinning strategies for approximating a large set of scattered data by piecewise linear functions over triangulated subsets. Our strategies depend on both the locations of the data points in the plane, and the values of the sampled function at these points - adaptive thinning. All our thinning strategies remove data points one by one, so as to minimize an estimate of the error that results by the removal of a point from the current set of points (this estimate is termed "anticipated error"). The thinning process generates subsets of "most significant" points, such that the piecewise linear interpolants over the Delaunay triangulations of these subsets approximate progressively the function values sampled at the original scattered points, and such that the approximation errors are small relative to the number of points in the subsets. We design various methods for computing the anticipated error at reasonable cost, and compare and test the performance of the methods. It is proved that for data sampled from a convex function, with the strategy of convex triangulation, the actual error is minimized by minimizing the best performing measure of anticipated error. It is also shown that for data sampled from certain quadratic polynomials, adaptive thinning is equivalent to thinning which depends only on the locations of the data points - nonadaptive thinning. Based on our numerical tests and comparisons, two practical adaptive thinning algorithms are proposed for thinning large data sets, one which is more accurate and another which is faster

adapt thin for bivari scatter data
 thi paper studi adapt thin strategi for approxim a larg set of scatter data by piecewis linear function over triangul subset . our strategi depend on both the locat of the data point in the plane , and the valu of the sampl function at these point - adapt thin . all our thin strategi remov data point one by one , so as to minim an estim of the error that result by the remov of a point from the current set of point ( thi estim is term " anticip error " ) . the thin process gener subset of " most signific " point , such that the piecewis linear interpol over the delaunay triangul of these subset approxim progress the function valu sampl at the origin scatter point , and such that the approxim error are small rel to the number of point in the subset . we design variou method for comput the anticip error at reason cost , and compar and test the perform of the method . it is prove that for data sampl from a convex function , with the strategi of convex triangul , the actual error is minim by minim the best perform measur of anticip error . it is also shown that for data sampl from certain quadrat polynomi , adapt thin is equival to thin which depend onli on the locat of the data point - nonadapt thin . base on our numer test and comparison , two practic adapt thin algorithm are propos for thin larg data set , one which is more accur and anoth which is faster

adaptive thinning
scattered data
piecewise linear functions
triangulated subsets
error
Delaunay triangulations
convex function


Modeling and simulating practices, a work method for work systems design

Abstract: Work systems involve people engaging in activities over time-not just with each other, but also with machines, tools, documents, and other artifacts. These activities often produce goods, services, or-as is the case in the work system described in this article-scientific data. Work systems and work practice evolve slowly over time. The integration and use of technology, the distribution and collocation of people, organizational roles and procedures, and the facilities where the work occurs largely determine this evolution

model and simul practic , a work method for work system design
 work system involv peopl engag in activ over time-not just with each other , but also with machin , tool , document , and other artifact . these activ often produc good , servic , or-a is the case in the work system describ in thi article-scientif data . work system and work practic evolv slowli over time . the integr and use of technolog , the distribut and colloc of peopl , organiz role and procedur , and the facil where the work occur larg determin thi evolut

work practice simulation
work practice modeling
work system design method
complex system interactions
human activity
communication
collaboration
teamwork
tool usage
workspace usage
problem solving
learning behavior


Strong completeness of lattice-valued logic

Abstract: This paper shows strong completeness of the system L for lattice valued logic given by S. Titani (1999), in which she formulates a lattice-valued set theory by introducing the logical implication which represents the order relation on the lattice. Syntax and semantics concerned are described and strong completeness is proved

strong complet of lattice-valu logic
 thi paper show strong complet of the system l for lattic valu logic given by s. titani ( 1999 ) , in which she formul a lattice-valu set theori by introduc the logic implic which repres the order relat on the lattic . syntax and semant concern are describ and strong complet is prove

strong completeness
lattice-valued logic
lattice-valued set theory
order relation
syntax
semantics


A linear time algorithm for recognizing regular Boolean functions

Abstract: A positive (or monotone) Boolean function is regular if its variables are naturally ordered, left to fight, by decreasing strength, so that shifting the nonzero component of any true vector to the left always yields another true vector. This paper considers the problem of recognizing whether a positive function f is regular, where f is given by min T(f) (the set of all minimal true vectors of f). We propose a simple linear time (i.e., O(n|min T(f)|)-time) algorithm for it. This improves upon the previous algorithm by J.S. Provan and M.O. Ball (1988) which requires O(n/sup 2/|min T(f)|) time. As a corollary, we also present an O(n(n+|min T(f)|))-time algorithm for the recognition problem of 2-monotonic functions

a linear time algorithm for recogn regular boolean function
 a posit ( or monoton ) boolean function is regular if it variabl are natur order , left to fight , by decreas strength , so that shift the nonzero compon of ani true vector to the left alway yield anoth true vector . thi paper consid the problem of recogn whether a posit function f is regular , where f is given by min t(f ) ( the set of all minim true vector of f ) . we propos a simpl linear time ( i.e. , o(n|min t(f)|)-time ) algorithm for it . thi improv upon the previou algorithm by j.s. provan and m.o. ball ( 1988 ) which requir o(n / sup 2/|min t(f)| ) time . as a corollari , we also present an o(n(n+|min t(f)|))-time algorithm for the recognit problem of 2-monoton function

linear time algorithm
regular Boolean functions
nonzero component
true vector
positive function
2-monotonic functions
monotone Boolean function


The UPS as network management tool

Abstract: Uninterrupted power supplies (UPS), or battery backup systems, once provided a relatively limited, although important, function-continual battery support to connected equipment in the event of a power failure. However, yesterday's "battery in a box" has evolved into a sophisticated network power management tool that can monitor and actively correct many of the problems that might plague a healthy network. This new breed of UPS system provides such features as automatic voltage regulation, generous runtimes and unattended system shutdown, and now also monitors and automatically restarts critical services and operating systems if they lock up or otherwise fail

the up as network manag tool
 uninterrupt power suppli ( up ) , or batteri backup system , onc provid a rel limit , although import , function-continu batteri support to connect equip in the event of a power failur . howev , yesterday 's " batteri in a box " ha evolv into a sophist network power manag tool that can monitor and activ correct mani of the problem that might plagu a healthi network . thi new breed of up system provid such featur as automat voltag regul , gener runtim and unattend system shutdown , and now also monitor and automat restart critic servic and oper system if they lock up or otherwis fail

uninterrupted power supplies
network power management
automatic voltage regulation
unattended system shutdown


The BIOGENES system for knowledge-based bioprocess control

Abstract: The application of knowledge-based control systems in the area of biotechnological processes has become increasingly popular over the past decade. This paper outlines the structure of the advanced knowledge-based part of the BIOGENES Copyright control system for the control of bioprocesses such as the fed-batch Saccharomyces cerevisiae cultivation. First, a brief overview of all the tasks implemented in the knowledge-based level including process data classification, qualitative process state identification and supervisory process control is given. The procedures performing the on-line identification of metabolic states and supervisory process control (setpoint calculation and control strategy selection) are described in more detail. Finally, the performance of the system is discussed using results obtained from a number of experimental cultivation runs in a laboratory unit

the biogen system for knowledge-bas bioprocess control
 the applic of knowledge-bas control system in the area of biotechnolog process ha becom increasingli popular over the past decad . thi paper outlin the structur of the advanc knowledge-bas part of the biogen copyright control system for the control of bioprocess such as the fed-batch saccharomyc cerevisia cultiv . first , a brief overview of all the task implement in the knowledge-bas level includ process data classif , qualit process state identif and supervisori process control is given . the procedur perform the on-lin identif of metabol state and supervisori process control ( setpoint calcul and control strategi select ) are describ in more detail . final , the perform of the system is discuss use result obtain from a number of experiment cultiv run in a laboratori unit


Asymptotic normality for the K/sub phi /-divergence goodness-of-fit tests

Abstract: In this paper for a wide class of goodness-of-fit statistics based K/sub phi /-divergences, the asymptotic normality is established under the assumption n/m/sub n/ to a in (0, infinity ), where n denotes sample size and m/sub n/ the number of cells. This result is extended to contiguous alternatives to study asymptotic efficiency

asymptot normal for the k / sub phi /-diverg goodness-of-fit test
 in thi paper for a wide class of goodness-of-fit statist base k / sub phi /-diverg , the asymptot normal is establish under the assumpt n / m / sub n/ to a in ( 0 , infin ) , where n denot sampl size and m / sub n/ the number of cell . thi result is extend to contigu altern to studi asymptot effici


Optimal multi-degree reduction of Bezier curves with constraints of endpoints continuity

Abstract: Given a Bezier curve of degree n, the problem of optimal multi-degree reduction (degree reduction of more than one degree) by a Bezier curve of degree m (m<n-1) with constraints of endpoint continuity is investigated. With respect to L/sub 2/ norm, this paper presents an approximate method (MDR by L/sub 2/) that gives an explicit solution to deal with it. The method has good properties of endpoint interpolation: continuity of any r, s (r, s>or=0) orders can be preserved at two endpoints respectively. The method in the paper performs multi-degree reduction at one time and does not need stepwise computing. When applied to multi-degree reduction with endpoint continuity of any order, the MDR by L/sub 2/ obtains the best least squares approximation. Comparison with another method of multi-degree reduction (MDR by L/sub infinity /), which achieves the nearly best uniform approximation with respect to L/sub infinity / norm, is also given. The approximate effect of the MDR by L/sub 2/ is better than that of the MDR by L/sub infinity /. Explicit approximate error analysis of the multi-degree reduction methods is presented

optim multi-degre reduct of bezier curv with constraint of endpoint continu
 given a bezier curv of degre n , the problem of optim multi-degre reduct ( degre reduct of more than one degre ) by a bezier curv of degre m ( m < n-1 ) with constraint of endpoint continu is investig . with respect to l / sub 2/ norm , thi paper present an approxim method ( mdr by l / sub 2/ ) that give an explicit solut to deal with it . the method ha good properti of endpoint interpol : continu of ani r , s ( r , s > or=0 ) order can be preserv at two endpoint respect . the method in the paper perform multi-degre reduct at one time and doe not need stepwis comput . when appli to multi-degre reduct with endpoint continu of ani order , the mdr by l / sub 2/ obtain the best least squar approxim . comparison with anoth method of multi-degre reduct ( mdr by l / sub infin / ) , which achiev the nearli best uniform approxim with respect to l / sub infin / norm , is also given . the approxim effect of the mdr by l / sub 2/ is better than that of the mdr by l / sub infin /. explicit approxim error analysi of the multi-degre reduct method is present

optimal multi-degree reduction
Bezier curves
approximate method
explicit solution
endpoint interpolation
least squares approximation
uniform approximation
explicit approximate error analysis
endpoint continuity constraints


Exact frequency-domain reconstruction for thermoacoustic tomography. I. Planar geometry

Abstract: We report an exact and fast Fourier-domain reconstruction algorithm for thermoacoustic tomography in a planar configuration assuming thermal confinement and constant acoustic speed. The effects of the finite size of the detector and the finite length of the excitation pulse are explicitly included in the reconstruction algorithm. The algorithm is numerically and experimentally verified. We also demonstrate that the blurring caused by the finite size of the detector surface is the primary limiting factor on the resolution and that it can be compensated for by deconvolution

exact frequency-domain reconstruct for thermoacoust tomographi . i. planar geometri
 we report an exact and fast fourier-domain reconstruct algorithm for thermoacoust tomographi in a planar configur assum thermal confin and constant acoust speed . the effect of the finit size of the detector and the finit length of the excit puls are explicitli includ in the reconstruct algorithm . the algorithm is numer and experiment verifi . we also demonstr that the blur caus by the finit size of the detector surfac is the primari limit factor on the resolut and that it can be compens for by deconvolut

exact frequency-domain reconstruction
thermoacoustic tomography
planar geometry
reconstruction algorithm
planar configuration
thermal confinement
constant acoustic speed
excitation pulse
blurring
primary limiting factor
deconvolution
medical diagnostic imaging
finite detector surface size
resolution limitation