A comparison of different decision algorithms used in volumetric storm cells classification

Abstract: Decision algorithms useful in classifying meteorological volumetric radar data are discussed. Such data come from the radar decision support system (RDSS) database of Environment Canada and concern summer storms created in this country. Some research groups used the data completed by RDSS for verifying the utility of chosen methods in volumetric storm cells classification. The paper consists of a review of experiments that were made on the data from RDSS database of Environment Canada and presents the quality of particular classifiers. The classification accuracy coefficient is used to express the quality. For five research groups that led their experiments in a similar way it was possible to compare received outputs. Experiments showed that the support vector machine (SVM) method and rough set algorithms which use object oriented reducts for rule generation to classify volumetric storm data perform better than other classifiers

a comparison of differ decis algorithm use in volumetr storm cell classif
 decis algorithm use in classifi meteorolog volumetr radar data are discuss . such data come from the radar decis support system ( rdss ) databas of environ canada and concern summer storm creat in thi countri . some research group use the data complet by rdss for verifi the util of chosen method in volumetr storm cell classif . the paper consist of a review of experi that were made on the data from rdss databas of environ canada and present the qualiti of particular classifi . the classif accuraci coeffici is use to express the qualiti . for five research group that led their experi in a similar way it wa possibl to compar receiv output . experi show that the support vector machin ( svm ) method and rough set algorithm which use object orient reduct for rule gener to classifi volumetr storm data perform better than other classifi

decision algorithms
volumetric storm cells classification
meteorological volumetric radar data
radar decision support system
summer storms
classification accuracy
support vector machine
rough set algorithms
object oriented reducts


Finding performance bugs with the TNO HPF benchmark suite

Abstract: High-Performance Fortran (HPF) has been designed to provide portable performance on distributed memory machines. An important aspect of portable performance is the behavior of the available HPF compilers. Ideally, a programmer may expect comparable performance between different HPF compilers, given the same program and the same machine. To test the performance portability between compilers, we have designed a special benchmark suite, called the TNO HPF benchmark suite. It consists of a set of HPF programs that test various aspects of efficient parallel code generation. The benchmark suite consists of a number of template programs that are used to generate test programs with different array sizes, alignments, distributions, and iteration spaces. It ranges from very simple assignments to more complex assignments such as triangular iteration spaces, convex iteration spaces, coupled subscripts, and indirection arrays. We have run the TNO HPF benchmark suite on three compilers: the PREPARE prototype compiler, the PGI-HPF compiler, and the GMD Adaptor HPF compiler. Results show performance differences that can be quite large (up to two orders of magnitude for the same test program). Closer inspection reveals that the origin of most of the differences in performance is due to differences in local enumeration and storage of distributed array elements

find perform bug with the tno hpf benchmark suit
 high-perform fortran ( hpf ) ha been design to provid portabl perform on distribut memori machin . an import aspect of portabl perform is the behavior of the avail hpf compil . ideal , a programm may expect compar perform between differ hpf compil , given the same program and the same machin . to test the perform portabl between compil , we have design a special benchmark suit , call the tno hpf benchmark suit . it consist of a set of hpf program that test variou aspect of effici parallel code gener . the benchmark suit consist of a number of templat program that are use to gener test program with differ array size , align , distribut , and iter space . it rang from veri simpl assign to more complex assign such as triangular iter space , convex iter space , coupl subscript , and indirect array . we have run the tno hpf benchmark suit on three compil : the prepar prototyp compil , the pgi-hpf compil , and the gmd adaptor hpf compil . result show perform differ that can be quit larg ( up to two order of magnitud for the same test program ) . closer inspect reveal that the origin of most of the differ in perform is due to differ in local enumer and storag of distribut array element

benchmark suite
High-Performance Fortran
portable performance
distributed memory machines
HPF compilers
performance portability
parallel compilers
compiler optimizations


At your service [agile businesses]

Abstract: Senior software executives from three of the world's leading software companies, and one smaller, entrepreneurial software developer, explain the impact that web services, business process management and integrated application architectures are having on their product development plans, and share their vision of the roles these products will play in creating agile businesses

at your servic [ agil busi ]
 senior softwar execut from three of the world 's lead softwar compani , and one smaller , entrepreneuri softwar develop , explain the impact that web servic , busi process manag and integr applic architectur are have on their product develop plan , and share their vision of the role these product will play in creat agil busi

agile businesses
software companies
web services
business process management
integrated application architectures


Identifying multivariate discordant observations: a computer-intensive approach

Abstract: The problem of identifying multiple outliers in a multivariate normal sample is approached via successive testing using P-values rather than tabled critical values. Caroni and Prescott (Appl. Statist. 41, p.355, 1992) proposed a generalization of the EDR-ESD procedure of Rosner (Technometrics, 25, 1983)). Venter and Viljoen (Comput. Statist. Data Anal. 29, p.261, 1999) introduced a computer intensive method to identify outliers in a univariate outlier situation. We now generalize this method to the multivariate outlier situation and compare this new procedure with that of Caroni and Prescott (Appl. Statist. 4, p.355, 1992)

identifi multivari discord observ : a computer-intens approach
 the problem of identifi multipl outlier in a multivari normal sampl is approach via success test use p-valu rather than tabl critic valu . caroni and prescott ( appl . statist . 41 , p.355 , 1992 ) propos a gener of the edr-esd procedur of rosner ( technometr , 25 , 1983 ) ) . venter and viljoen ( comput . statist . data anal . 29 , p.261 , 1999 ) introduc a comput intens method to identifi outlier in a univari outlier situat . we now gener thi method to the multivari outlier situat and compar thi new procedur with that of caroni and prescott ( appl . statist . 4 , p.355 , 1992 )

multivariate discordant observations
computer-intensive approach
multiple outliers
multivariate normal sample
P-values
tabled critical values
univariate outlier
multivariate outlier
data analysis
EDR-EHD procedure
stepwise testing approach


Manufacturing data analysis of machine tool errors within a contemporary small manufacturing enterprise

Abstract: The main focus of the paper is directed at the determination of manufacturing errors within the contemporary smaller manufacturing enterprise sector. The manufacturing error diagnosis is achieved through the manufacturing data analysis of the results obtained from the inspection of the component on a co-ordinate measuring machine. This manufacturing data analysis activity adopts a feature-based approach and is conducted through the application of a forward chaining expert system, called the product data analysis distributed diagnostic expert system, which forms part of a larger prototype feedback system entitled the production data analysis framework. The paper introduces the manufacturing error categorisations that are associated with milling type operations, knowledge acquisition and representation, conceptual structure and operating procedure of the prototype manufacturing data analysis facility. The paper concludes with a brief evaluation of the logic employed through the simulation of manufacturing error scenarios. This prototype manufacturing data analysis expert system provides a valuable aid for the rapid diagnosis and elimination of manufacturing errors on a 3-axis vertical machining centre in an environment where operator expertise is limited

manufactur data analysi of machin tool error within a contemporari small manufactur enterpris
 the main focu of the paper is direct at the determin of manufactur error within the contemporari smaller manufactur enterpris sector . the manufactur error diagnosi is achiev through the manufactur data analysi of the result obtain from the inspect of the compon on a co-ordin measur machin . thi manufactur data analysi activ adopt a feature-bas approach and is conduct through the applic of a forward chain expert system , call the product data analysi distribut diagnost expert system , which form part of a larger prototyp feedback system entitl the product data analysi framework . the paper introduc the manufactur error categoris that are associ with mill type oper , knowledg acquisit and represent , conceptu structur and oper procedur of the prototyp manufactur data analysi facil . the paper conclud with a brief evalu of the logic employ through the simul of manufactur error scenario . thi prototyp manufactur data analysi expert system provid a valuabl aid for the rapid diagnosi and elimin of manufactur error on a 3-axi vertic machin centr in an environ where oper expertis is limit


Relationship between strong monotonicity property, P/sub 2/-property, and the GUS-property in semidefinite linear complementarity problems

Abstract: In a recent paper on semidefinite linear complementarity problems, Gowda and Song (2000) introduced and studied the P-property, P/sub 2/-property, GUS-property, and strong monotonicity property for linear transformation L: S/sup n/ to S/sup n/, where S/sup n/ is the space of all symmetric and real n * n matrices. In an attempt to characterize the P/sub 2/-property, they raised the following two questions: (i) Does the strong monotonicity imply the P/sub 2/-property? (ii) Does the GUS-property imply the P/sub 2/-property? In this paper, we show that the strong monotonicity property implies the P/sub 2/-property for any linear transformation and describe an equivalence between these two properties for Lyapunov and other transformations. We show by means of an example that the GUS-property need not imply the P/sub 2/-property, even for Lyapunov transformations

relationship between strong monoton properti , p / sub 2/-properti , and the gus-properti in semidefinit linear complementar problem
 in a recent paper on semidefinit linear complementar problem , gowda and song ( 2000 ) introduc and studi the p-properti , p / sub 2/-properti , gus-properti , and strong monoton properti for linear transform l : s / sup n/ to s / sup n/ , where s / sup n/ is the space of all symmetr and real n * n matric . in an attempt to character the p / sub 2/-properti , they rais the follow two question : ( i ) doe the strong monoton impli the p / sub 2/-properti ? ( ii ) doe the gus-properti impli the p / sub 2/-properti ? in thi paper , we show that the strong monoton properti impli the p / sub 2/-properti for ani linear transform and describ an equival between these two properti for lyapunov and other transform . we show by mean of an exampl that the gus-properti need not impli the p / sub 2/-properti , even for lyapunov transform


SubSeven's Honey Pot program

Abstract: A serious security threat today are malicious executables, especially new, unseen malicious executables often arriving as email attachments. These new malicious executables are created at the rate of thousands every year and pose a serious threat. Current anti-virus systems attempt to detect these new malicious programs with heuristics generated by hand. This approach is costly and often ineffective. We introduce the Trojan Horse SubSeven, its capabilities and influence over intrusion detection systems. A Honey Pot program is implemented, simulating the SubSeven Server. The Honey Pot Program provides feedback and stores data to and from the SubSeven's client

subseven 's honey pot program
 a seriou secur threat today are malici execut , especi new , unseen malici execut often arriv as email attach . these new malici execut are creat at the rate of thousand everi year and pose a seriou threat . current anti-viru system attempt to detect these new malici program with heurist gener by hand . thi approach is costli and often ineffect . we introduc the trojan hors subseven , it capabl and influenc over intrus detect system . a honey pot program is implement , simul the subseven server . the honey pot program provid feedback and store data to and from the subseven 's client

SubSeven
Honey Pot program
security threat
malicious executables
email attachments
anti-virus systems
Trojan Horse
intrusion detection systems


Data quality - unlocking the ROI in CRM

Abstract: While many organisations realise their most valuable asset is their customers, many more fail to realise the importance of auditing, maintaining and updating the information contained in their customer databases. Today's growing awareness in the importance of data quality in relation to CRM and ROI will help change this attitude. In response, CRM vendors will follow suit and begin to differentiate themselves by offering data quality as part of an enterprise-wide data management methodology

data qualiti - unlock the roi in crm
 while mani organis realis their most valuabl asset is their custom , mani more fail to realis the import of audit , maintain and updat the inform contain in their custom databas . today 's grow awar in the import of data qualiti in relat to crm and roi will help chang thi attitud . in respons , crm vendor will follow suit and begin to differenti themselv by offer data qualiti as part of an enterprise-wid data manag methodolog

CRM
customer databases
data management
customer relationships
return on investment


Failures and successes: notes on the development of electronic cash

Abstract: Between 1997 and 2001, two mid-sized communities in Canada hosted North America's most comprehensive experiment to introduce electronic cash and, in the process, replace physical cash for casual, low-value payments. The technology used was Mondex, and its implementation was supported by all the country's major banks. It was launched with an extensive publicity campaign to promote Mondex not only in the domestic but also in the global market, for which the Canadian implementation was to serve as a "showcase." However, soon after the start of the first field test it became apparent that the new technology did not work smoothly. On the contrary, it created a host of controversies, in areas as varied as computer security, consumer privacy, and monetary policy. In the following years, few of these controversies could be resolved and Mondex could not be established as a widely used payment mechanism. In 2001, the experiment was finally terminated. Using the concepts developed in recent science and technology studies (STS), the article analyzes these controversies as resulting from the difficulties of fitting electronic cash, a new sociotechnical system, into the complex setting of the existing payment system. The story of Mondex not only offers lessons on why technologies fail, but also offers insight into how short-term failures can contribute to long-term transformations. This suggests the need to rethink the dichotomy of success and failure

failur and success : note on the develop of electron cash
 between 1997 and 2001 , two mid-siz commun in canada host north america 's most comprehens experi to introduc electron cash and , in the process , replac physic cash for casual , low-valu payment . the technolog use wa mondex , and it implement wa support by all the countri 's major bank . it wa launch with an extens public campaign to promot mondex not onli in the domest but also in the global market , for which the canadian implement wa to serv as a " showcas . " howev , soon after the start of the first field test it becam appar that the new technolog did not work smoothli . on the contrari , it creat a host of controversi , in area as vari as comput secur , consum privaci , and monetari polici . in the follow year , few of these controversi could be resolv and mondex could not be establish as a wide use payment mechan . in 2001 , the experi wa final termin . use the concept develop in recent scienc and technolog studi ( st ) , the articl analyz these controversi as result from the difficulti of fit electron cash , a new sociotechn system , into the complex set of the exist payment system . the stori of mondex not onli offer lesson on whi technolog fail , but also offer insight into how short-term failur can contribut to long-term transform . thi suggest the need to rethink the dichotomi of success and failur

electronic cash
Canada
low-value payments
Mondex
major banks
publicity campaign
global market
Canadian implementation
computer security
consumer privacy
monetary policy
payment mechanism
science and technology studies
sociotechnical system
short-term failures
long-term transformations


Effect of insulation layer on transcribability and birefringence distribution in optical disk substrate

Abstract: As the need for information storage media with high storage density increases, digital video disks (DVDs) with smaller recording marks and thinner optical disk substrates than those of conventional DVDs are being required. Therefore, improving the replication quality of land-groove or pit structure and reducing the birefringence distribution are emerging as important criteria in the fabrication of high-density optical disk substrates. We control the transcribability and distribution of birefringence by inserting an insulation layer under the stamper during injection-compression molding of DVD RAM substrates. The effects of the insulation layer on the geometrical and optical properties, such as transcribability and birefringence distribution, are examined experimentally. The inserted insulation layer is found to be very effective in improving the quality of replication and leveling out the first peak of the gapwise birefringence distribution near the mold wall and reducing the average birefringence value, because the insulation layer retarded the growth of the solidified layer

effect of insul layer on transcrib and birefring distribut in optic disk substrat
 as the need for inform storag media with high storag densiti increas , digit video disk ( dvd ) with smaller record mark and thinner optic disk substrat than those of convent dvd are be requir . therefor , improv the replic qualiti of land-groov or pit structur and reduc the birefring distribut are emerg as import criteria in the fabric of high-dens optic disk substrat . we control the transcrib and distribut of birefring by insert an insul layer under the stamper dure injection-compress mold of dvd ram substrat . the effect of the insul layer on the geometr and optic properti , such as transcrib and birefring distribut , are examin experiment . the insert insul layer is found to be veri effect in improv the qualiti of replic and level out the first peak of the gapwis birefring distribut near the mold wall and reduc the averag birefring valu , becaus the insul layer retard the growth of the solidifi layer

insulation layer
transcribability
birefringence distribution
optical disk substrate
information storage media
high storage density
digital video disks
smaller recording marks
thinner optical disk substrates
replication quality
land-groove
pit structure
fabrication
stamper
injection-compression molding
DVD RAM substrates
optical properties
gapwise birefringence distribution
mold wall
geometrical properties
solidified layer growth retardation
polyimide thermal insulation layer

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


Winning post [mail systems]

Abstract: Businesses that take their mail for granted can end up wasting money as well as opportunities. Mike Stecyk, VP of marketing and lines of business at Pitney Bowes, suggests strategies for making more of a great opportunity

win post [ mail system ]
 busi that take their mail for grant can end up wast money as well as opportun . mike stecyk , vp of market and line of busi at pitney bow , suggest strategi for make more of a great opportun

mail
Pitney Bowes
strategies
franking machines
folders
inserters
direct mail shots


Car-caravan snaking. 1. The influence of pintle pin friction

Abstract: A brief review of knowledge of car-caravan snaking is carried out. Against the background described, a fairly detailed mathematical model of a contemporary car-trailer system is constructed and a baseline set of parameter values is given. In reduced form, the model is shown to give results in accordance with literature. The properties of the baseline combination are explored using both linear and non-linear versions of the model. The influences of damping at the pintle joint and of several other design parameters on the stability of the linear system in the neighbourhood of the critical snaking speed are calculated and discussed. Coulomb friction damping at the pintle pin is then included and simulations are used to indicate the consequent amplitude-dependent behaviour. The friction damping, especially when its level has to be chosen by the user, is shown to give dangerous characteristics, despite having some capacity for stabilization of the snaking motions. It is concluded that pintle pin friction damping does not represent a satisfactory solution to the snaking problem. The paper sets the scene for the development of an improved solution

car-caravan snake . 1 . the influenc of pintl pin friction
 a brief review of knowledg of car-caravan snake is carri out . against the background describ , a fairli detail mathemat model of a contemporari car-trail system is construct and a baselin set of paramet valu is given . in reduc form , the model is shown to give result in accord with literatur . the properti of the baselin combin are explor use both linear and non-linear version of the model . the influenc of damp at the pintl joint and of sever other design paramet on the stabil of the linear system in the neighbourhood of the critic snake speed are calcul and discuss . coulomb friction damp at the pintl pin is then includ and simul are use to indic the consequ amplitude-depend behaviour . the friction damp , especi when it level ha to be chosen by the user , is shown to give danger characterist , despit have some capac for stabil of the snake motion . it is conclud that pintl pin friction damp doe not repres a satisfactori solut to the snake problem . the paper set the scene for the develop of an improv solut

car-caravan snaking
pintle pin friction
mathematical model
car-trailer system
linear system
critical snaking speed
Coulomb friction damping
amplitude-dependent behaviour


Application of ultrasonic sensors in the process industry

Abstract: Continuous process monitoring in gaseous, liquid or molten media is a fundamental requirement for process control. Besides temperature and pressure other process parameters such as level, flow, concentration and conversion are of special interest. More qualified information obtained from new or better sensors can significantly enhance the process quality and thereby product properties. Ultrasonic sensors or sensor systems can contribute to this development. The state of the art of ultrasonic sensors and their advantages and disadvantages will be discussed. Commercial examples will be presented. Among others, applications in the food, chemical and pharmaceutical industries are described. Possibilities and limitations of ultrasonic process sensors are discussed

applic of ultrason sensor in the process industri
 continu process monitor in gaseou , liquid or molten media is a fundament requir for process control . besid temperatur and pressur other process paramet such as level , flow , concentr and convers are of special interest . more qualifi inform obtain from new or better sensor can significantli enhanc the process qualiti and therebi product properti . ultrason sensor or sensor system can contribut to thi develop . the state of the art of ultrason sensor and their advantag and disadvantag will be discuss . commerci exampl will be present . among other , applic in the food , chemic and pharmaceut industri are describ . possibl and limit of ultrason process sensor are discuss

process industry
continuous process monitoring
process control
process quality
pharmaceutical industries
ultrasonic sensors application
food industries
chemical industries
acoustic microsensors
ultrasonic measurements
ultrasonic attenuation
acoustic impedance
temperature measurement
pressure measurement
level measurement
distance measurement
flow measurement


People who make a difference: mentors and role models

Abstract: The literature of gender issues in computing steadfastly and uniformly has advocated the use of mentors and role models (M&RM) for recruiting and retaining women in computer science. This paper, therefore, accepts the results of research studies and avoids reiterating details of the projects but offers instead a practical guide for using M&RM to recruit and retain women in computer science. The guide provides pragmatic advice, describing several different facets of the M&RM concept

peopl who make a differ : mentor and role model
 the literatur of gender issu in comput steadfastli and uniformli ha advoc the use of mentor and role model ( m&rm ) for recruit and retain women in comput scienc . thi paper , therefor , accept the result of research studi and avoid reiter detail of the project but offer instead a practic guid for use m&rm to recruit and retain women in comput scienc . the guid provid pragmat advic , describ sever differ facet of the m&rm concept

mentors
role models
gender issues
computing
computer science
women retention
women recruitment


On generalized Gaussian quadratures for exponentials and their applications

Abstract: We introduce new families of Gaussian-type quadratures for weighted integrals of exponential functions and consider their applications to integration and interpolation of bandlimited functions. We use a generalization of a representation theorem due to Caratheodory to derive these quadratures. For each positive measure, the quadratures are parameterized by eigenvalues of the Toeplitz matrix constructed from the trigonometric moments of the measure. For a given accuracy epsilon , selecting an eigenvalue close to epsilon yields an approximate quadrature with that accuracy. To compute its weights and nodes, we present a new fast algorithm. These new quadratures can be used to approximate and integrate bandlimited functions, such as prolate spheroidal wave functions, and essentially bandlimited functions, such as Bessel functions. We also develop, for a given precision, an interpolating basis for bandlimited functions on an interval

on gener gaussian quadratur for exponenti and their applic
 we introduc new famili of gaussian-typ quadratur for weight integr of exponenti function and consid their applic to integr and interpol of bandlimit function . we use a gener of a represent theorem due to caratheodori to deriv these quadratur . for each posit measur , the quadratur are parameter by eigenvalu of the toeplitz matrix construct from the trigonometr moment of the measur . for a given accuraci epsilon , select an eigenvalu close to epsilon yield an approxim quadratur with that accuraci . to comput it weight and node , we present a new fast algorithm . these new quadratur can be use to approxim and integr bandlimit function , such as prolat spheroid wave function , and essenti bandlimit function , such as bessel function . we also develop , for a given precis , an interpol basi for bandlimit function on an interv

generalized Gaussian quadratures
weighted integrals
integration
exponential functions
interpolation
bandlimited functions
eigenvalues
Toeplitz matrix
trigonometric moments
approximation
prolate spheroidal wave functions
Bessel functions
Caratheodory representation theorem


Playing for time [3G networks]

Abstract: The delays in rolling out 3G networks across Europe should not always be seen with a negative slant

play for time [ 3 g network ]
 the delay in roll out 3 g network across europ should not alway be seen with a neg slant

3G networks
delays
Europe
mobile operators


Tablet PCs on the way [publishing markets]

Abstract: Previews of hardware and software look promising for publishing markets

tablet pc on the way [ publish market ]
 preview of hardwar and softwar look promis for publish market


A leaf sequencing algorithm to enlarge treatment field length in IMRT

Abstract: With MLC-based IMRT, the maximum usable field size is often smaller than the maximum field size for conventional treatments. This is due to the constraints of the overtravel distances of MLC leaves and/or jaws. Using a new leaf sequencing algorithm, the usable IMRT field length (perpendicular to the MLC motion) can be mostly made equal to the full length of the MLC field without violating the upper jaw overtravel limit. For any given intensity pattern, a criterion was proposed to assess whether an intensity pattern can be delivered without violation of the jaw position constraints. If the criterion is met, the new algorithm will consider the jaw position constraints during the segmentation for the step and shoot delivery method. The strategy employed by the algorithm is to connect the intensity elements outside the jaw overtravel limits with those inside the jaw overtravel limits. Several methods were used to establish these connections during segmentation by modifying a previously published algorithm (areal algorithm), including changing the intensity level, alternating the leaf-sequencing direction, or limiting the segment field size. The algorithm was tested with 1000 random intensity patterns with dimensions of 21*27 cm/sup 2/, 800 intensity patterns with higher intensity outside the jaw overtravel limit, and three different types of clinical treatment plans that were undeliverable using a segmentation method from a commercial treatment planning system. The new algorithm achieved a success rate of 100% with these test patterns. For the 1000 random patterns, the new algorithm yields a similar average number of segments of 36.9+or-2.9 in comparison to 36.6+or-1.3 when using the areal algorithm. For the 800 patterns with higher intensities outside the jaw overtravel limits, the new algorithm results in an increase of 25% in the average number of segments compared to the areal algorithm. However, the areal algorithm fails to create deliverable segments for 90% of these patterns. Using a single isocenter, the new algorithm provides a solution to extend the usable IMRT field length from 21 to 27 cm for IMRT on a commercial linear accelerator using the step and shoot delivery method

a leaf sequenc algorithm to enlarg treatment field length in imrt
 with mlc-base imrt , the maximum usabl field size is often smaller than the maximum field size for convent treatment . thi is due to the constraint of the overtravel distanc of mlc leav and/or jaw . use a new leaf sequenc algorithm , the usabl imrt field length ( perpendicular to the mlc motion ) can be mostli made equal to the full length of the mlc field without violat the upper jaw overtravel limit . for ani given intens pattern , a criterion wa propos to assess whether an intens pattern can be deliv without violat of the jaw posit constraint . if the criterion is met , the new algorithm will consid the jaw posit constraint dure the segment for the step and shoot deliveri method . the strategi employ by the algorithm is to connect the intens element outsid the jaw overtravel limit with those insid the jaw overtravel limit . sever method were use to establish these connect dure segment by modifi a previous publish algorithm ( areal algorithm ) , includ chang the intens level , altern the leaf-sequenc direct , or limit the segment field size . the algorithm wa test with 1000 random intens pattern with dimens of 21 * 27 cm / sup 2/ , 800 intens pattern with higher intens outsid the jaw overtravel limit , and three differ type of clinic treatment plan that were undeliver use a segment method from a commerci treatment plan system . the new algorithm achiev a success rate of 100 % with these test pattern . for the 1000 random pattern , the new algorithm yield a similar averag number of segment of 36.9+or-2.9 in comparison to 36.6+or-1.3 when use the areal algorithm . for the 800 pattern with higher intens outsid the jaw overtravel limit , the new algorithm result in an increas of 25 % in the averag number of segment compar to the areal algorithm . howev , the areal algorithm fail to creat deliver segment for 90 % of these pattern . use a singl isocent , the new algorithm provid a solut to extend the usabl imrt field length from 21 to 27 cm for imrt on a commerci linear acceler use the step and shoot deliveri method

usable intensity modulated radiation therapy field length

multileaf-based collimators intensity modulated radiation therapy

P P P P P P P P P P P P P P P P P P P M M U M M


A hybrid model for smoke simulation

Abstract: A smoke simulation approach based on the integration of traditional particle systems and density functions is presented in this paper. By attaching a density function to each particle as its attribute, the diffusion of smoke can be described by the variation of particles' density functions, along with the effect on airflow by controlling particles' movement and fragmentation. In addition, a continuous density field for realistic rendering can be generated quickly through the look-up tables of particle's density functions. Compared with traditional particle systems, this approach can describe smoke diffusion, and provide a continuous density field for realistic rendering with much less computation. A quick rendering scheme is also presented in this paper as a useful preview tool for tuning appropriate parameters in the smoke model

a hybrid model for smoke simul
 a smoke simul approach base on the integr of tradit particl system and densiti function is present in thi paper . by attach a densiti function to each particl as it attribut , the diffus of smoke can be describ by the variat of particl ' densiti function , along with the effect on airflow by control particl ' movement and fragment . in addit , a continu densiti field for realist render can be gener quickli through the look-up tabl of particl 's densiti function . compar with tradit particl system , thi approach can describ smoke diffus , and provid a continu densiti field for realist render with much less comput . a quick render scheme is also present in thi paper as a use preview tool for tune appropri paramet in the smoke model

hybrid model
smoke simulation
density functions
continuous density field
rendering
look-up tables


Interaction and presence in the clinical relationship: virtual reality (VR) as communicative medium between patient and therapist

Abstract: The great potential offered by virtual reality (VR) to clinical psychologists derives prevalently from the central role, in psychotherapy, occupied by the imagination and by memory. These two elements, which are fundamental in our life, present absolute and relative limits to the individual potential. Using VR as an advanced imaginal system, an experience that is able to reduce the gap existing between imagination and reality, it is possible to transcend these limits. In this sense, VR can improve the efficacy of a psychological therapy for its capability of reducing the distinction between the computer's reality and the conventional reality. Two are the core characteristics of this synthetic imaginal experience: the perceptual illusion of nonmediation and the possibility of building and sharing a common ground. In this sense, experiencing presence in a clinical virtual environment (VE), such as a shared virtual hospital, requires more than reproduction of the physical features of external reality. It requires the creation and sharing of the cultural web that makes meaningful, and therefore visible, both people and objects populating the environment. The paper outlines a framework for supporting the development and tuning of clinically oriented VR systems

interact and presenc in the clinic relationship : virtual realiti ( vr ) as commun medium between patient and therapist
 the great potenti offer by virtual realiti ( vr ) to clinic psychologist deriv preval from the central role , in psychotherapi , occupi by the imagin and by memori . these two element , which are fundament in our life , present absolut and rel limit to the individu potenti . use vr as an advanc imagin system , an experi that is abl to reduc the gap exist between imagin and realiti , it is possibl to transcend these limit . in thi sens , vr can improv the efficaci of a psycholog therapi for it capabl of reduc the distinct between the comput 's realiti and the convent realiti . two are the core characterist of thi synthet imagin experi : the perceptu illus of nonmedi and the possibl of build and share a common ground . in thi sens , experienc presenc in a clinic virtual environ ( ve ) , such as a share virtual hospit , requir more than reproduct of the physic featur of extern realiti . it requir the creation and share of the cultur web that make meaning , and therefor visibl , both peopl and object popul the environ . the paper outlin a framework for support the develop and tune of clinic orient vr system

presence
virtual reality
psychotherapy
imagination
memory
psychological therapy
clinical virtual environment
shared virtual hospital
patient-therapist communication
clinical psychology


Cross-entropy and rare events for maximal cut and partition problems

Abstract: We show how to solve the maximal cut and partition problems using a randomized algorithm based on the cross-entropy method. For the maximal cut problem, the proposed algorithm employs an auxiliary Bernoulli distribution, which transforms the original deterministic network into an associated stochastic one, called the associated stochastic network (ASN). Each iteration of the randomized algorithm for the ASN involves the following two phases: (1) generation of random cuts using a multidimensional Ber(p) distribution and calculation of the associated cut lengths (objective functions) and some related quantities, such as rare-event probabilities; (2) updating the parameter vector p on the basis of the data collected in the first phase. We show that the Ber(p) distribution converges in distribution to a degenerated one, Ber(p/sub d/*), p/sub d/* = (p/sub d/,/sub 1/, p/sub d,n/) in the sense that some elements of p/sub d/*, will be unities and the rest zeros. The unity elements of p/sub d/* uniquely define a cut which will be taken as the estimate of the maximal cut. A similar approach is used for the partition problem. Supporting numerical results are given as well. Our numerical studies suggest that for the maximal cut and partition problems the proposed algorithm typically has polynomial complexity in the size of the network

cross-entropi and rare event for maxim cut and partit problem
 we show how to solv the maxim cut and partit problem use a random algorithm base on the cross-entropi method . for the maxim cut problem , the propos algorithm employ an auxiliari bernoulli distribut , which transform the origin determinist network into an associ stochast one , call the associ stochast network ( asn ) . each iter of the random algorithm for the asn involv the follow two phase : ( 1 ) gener of random cut use a multidimension ber(p ) distribut and calcul of the associ cut length ( object function ) and some relat quantiti , such as rare-ev probabl ; ( 2 ) updat the paramet vector p on the basi of the data collect in the first phase . we show that the ber(p ) distribut converg in distribut to a degener one , ber(p / sub d/ * ) , p / sub d/ * = ( p / sub d/,/sub 1/ , p / sub d , n/ ) in the sens that some element of p / sub d/ * , will be uniti and the rest zero . the uniti element of p / sub d/ * uniqu defin a cut which will be taken as the estim of the maxim cut . a similar approach is use for the partit problem . support numer result are given as well . our numer studi suggest that for the maxim cut and partit problem the propos algorithm typic ha polynomi complex in the size of the network

partition problems
randomized algorithm
maximal cut problems
Bernoulli distribution
deterministic network
associated stochastic network
random cuts
probability
numerical results
polynomial complexity
cross entropy method
rare event simulation
combinatorial optimization
importance sampling


A distributed mobile agent framework for maintaining persistent distance education

Abstract: Mobile agent techniques involve distributed control if communication is required among different types of agents, especially when mobile agents can migrate from station to station. This technique can be implemented in a distributed distance learning environment, which allows students or instructors to login from anywhere to a central server in an education center while still retaining the look-and-feel of personal setups. In this research paper, we propose a distributed agent framework along with its communication messages to facilitate mobile personal agents, which serve three different groups of distance education users: instructors, students, and system administrators. We propose an agent communication framework as well as agent evolution states of mobile agents. The communication architecture and message transmission protocols are illustrated. The system is implemented on the Windows platform to support nomadic accessibility of remote distance learning users. Personal data also migrate with the mobile agents, allowing users to maintain accessibility to some extent even when the Internet connection is temperately disconnected. Using user-friendly personal agents, a distance education platform can include different tools to meet different needs for users

a distribut mobil agent framework for maintain persist distanc educ
 mobil agent techniqu involv distribut control if commun is requir among differ type of agent , especi when mobil agent can migrat from station to station . thi techniqu can be implement in a distribut distanc learn environ , which allow student or instructor to login from anywher to a central server in an educ center while still retain the look-and-feel of person setup . in thi research paper , we propos a distribut agent framework along with it commun messag to facilit mobil person agent , which serv three differ group of distanc educ user : instructor , student , and system administr . we propos an agent commun framework as well as agent evolut state of mobil agent . the commun architectur and messag transmiss protocol are illustr . the system is implement on the window platform to support nomad access of remot distanc learn user . person data also migrat with the mobil agent , allow user to maintain access to some extent even when the internet connect is temper disconnect . use user-friendli person agent , a distanc educ platform can includ differ tool to meet differ need for user

distributed mobile agent framework
persistent distance education
distributed control
central server
distributed agent framework
message transmission protocols
user-friendly personal agents


Supporting unified interface to wrapper generator in integrated information retrieval

Abstract: Given the ever-increasing scale and diversity of information and applications on the Internet, improving the technology of information retrieval is an urgent research objective. Retrieved information is either semi-structured or unstructured in format and its sources are extremely heterogeneous. In consequence, the task of efficiently gathering and extracting information from documents can be both difficult and tedious. Given this variety of sources and formats, many choose to use mediator/wrapper architecture, but its use demands a fast means of generating efficient wrappers. In this paper, we present a design for an automatic eXtensible Markup Language (XML)-based framework with which to generate wrappers rapidly. Wrappers created with this framework support a unified interface for a meta-search information retrieval system based on the Internet Search Service using the Common Object Request Broker Architecture (CORBA) standard. Greatly advantaged by the compatibility of CORBA and XML, a user can quickly and easily develop information-gathering applications, such as a meta-search engine or any other information source retrieval method. The two main things our design provides are a method of wrapper generation that is fast, simple, and efficient, and a wrapper generator that is CORBA and XML-compliant and that supports a unified interface

support unifi interfac to wrapper gener in integr inform retriev
 given the ever-increas scale and divers of inform and applic on the internet , improv the technolog of inform retriev is an urgent research object . retriev inform is either semi-structur or unstructur in format and it sourc are extrem heterogen . in consequ , the task of effici gather and extract inform from document can be both difficult and tediou . given thi varieti of sourc and format , mani choos to use mediat / wrapper architectur , but it use demand a fast mean of gener effici wrapper . in thi paper , we present a design for an automat extens markup languag ( xml)-base framework with which to gener wrapper rapidli . wrapper creat with thi framework support a unifi interfac for a meta-search inform retriev system base on the internet search servic use the common object request broker architectur ( corba ) standard . greatli advantag by the compat of corba and xml , a user can quickli and easili develop information-gath applic , such as a meta-search engin or ani other inform sourc retriev method . the two main thing our design provid are a method of wrapper gener that is fast , simpl , and effici , and a wrapper gener that is corba and xml-compliant and that support a unifi interfac

unified interface
wrapper generator
integrated information retrieval
Internet
automatic eXtensible Markup Language
CORBA
meta-search engine


Hybrid decision tree

Abstract: In this paper, a hybrid learning approach named hybrid decision tree (HDT) is proposed. HDT simulates human reasoning by using symbolic learning to do qualitative analysis and using neural learning to do subsequent quantitative analysis. It generates the trunk of a binary HDT according to the binary information gain ratio criterion in an instance space defined by only original unordered attributes. If unordered attributes cannot further distinguish training examples falling into a leaf node whose diversity is beyond the diversity-threshold, then the node is marked as a dummy node. After all those dummy nodes are marked, a specific feedforward neural network named FANNC that is trained in an instance space defined by only original ordered attributes is exploited to accomplish the learning task. Moreover, this paper distinguishes three kinds of incremental learning tasks. Two incremental learning procedures designed for example-incremental learning with different storage requirements are provided, which enables HDT to deal gracefully with data sets where new data are frequently appended. Also a hypothesis-driven constructive induction mechanism is provided, which enables HDT to generate compact concept descriptions

hybrid decis tree
 in thi paper , a hybrid learn approach name hybrid decis tree ( hdt ) is propos . hdt simul human reason by use symbol learn to do qualit analysi and use neural learn to do subsequ quantit analysi . it gener the trunk of a binari hdt accord to the binari inform gain ratio criterion in an instanc space defin by onli origin unord attribut . if unord attribut can not further distinguish train exampl fall into a leaf node whose divers is beyond the diversity-threshold , then the node is mark as a dummi node . after all those dummi node are mark , a specif feedforward neural network name fannc that is train in an instanc space defin by onli origin order attribut is exploit to accomplish the learn task . moreov , thi paper distinguish three kind of increment learn task . two increment learn procedur design for example-increment learn with differ storag requir are provid , which enabl hdt to deal grace with data set where new data are frequent append . also a hypothesis-driven construct induct mechan is provid , which enabl hdt to gener compact concept descript


Three-dimensional spiral MR imaging: application to renal multiphase contrast-enhanced angiography

Abstract: A fast MR pulse sequence with spiral in-plane readout and conventional 3D partition encoding was developed for multiphase contrast-enhanced magnetic resonance angiography (CE-MRA) of the renal vasculature. Compared to a standard multiphase 3D CE-MRA with FLASH readout, an isotropic in-plane spatial resolution of 1.4*1.4 mm/sup 2/ over 2.0*1.4 mm/sup 2/ could be achieved with a temporal resolution of 6 sec. The theoretical gain of spatial resolution by using the spiral pulse sequence and the performance in the presence of turbulent flow was evaluated in phantom measurements. Multiphase 3D CE-MRA of the renal arteries was performed in five healthy volunteers using both techniques. A deblurring technique was used to correct the spiral raw data. Thereby, the off-resonance frequencies were determined by minimizing the imaginary part of the data in image space. The chosen correction algorithm was able to reduce image blurring substantially in all MRA phases. The image quality of the spiral CE-MRA pulse sequence was comparable to that of the FLASH CE-MRA with increased spatial resolution and a 25% reduced contrast-to-noise ratio. Additionally, artifacts specific to spiral MRI could be observed which had no impact on the assessment of the renal arteries

three-dimension spiral mr imag : applic to renal multiphas contrast-enhanc angiographi
 a fast mr puls sequenc with spiral in-plan readout and convent 3d partit encod wa develop for multiphas contrast-enhanc magnet reson angiographi ( ce-mra ) of the renal vasculatur . compar to a standard multiphas 3d ce-mra with flash readout , an isotrop in-plan spatial resolut of 1.4 * 1.4 mm / sup 2/ over 2.0 * 1.4 mm / sup 2/ could be achiev with a tempor resolut of 6 sec . the theoret gain of spatial resolut by use the spiral puls sequenc and the perform in the presenc of turbul flow wa evalu in phantom measur . multiphas 3d ce-mra of the renal arteri wa perform in five healthi volunt use both techniqu . a deblur techniqu wa use to correct the spiral raw data . therebi , the off-reson frequenc were determin by minim the imaginari part of the data in imag space . the chosen correct algorithm wa abl to reduc imag blur substanti in all mra phase . the imag qualiti of the spiral ce-mra puls sequenc wa compar to that of the flash ce-mra with increas spatial resolut and a 25 % reduc contrast-to-nois ratio . addit , artifact specif to spiral mri could be observ which had no impact on the assess of the renal arteri


Recent researches of human science on railway systems

Abstract: This paper presents research of human science on railway systems at RTRI. They are roughly divided into two categories: research to improve safety and those to improve comfort. On the former subject, for the safeguard against accidents caused by human errors, we have promoted studies of psychological aptitude test, various research to evaluate train drivers' working conditions and environments, and new investigations to minimize the risk of passenger casualties at train accidents. On the latter subject, we have developed new methods to evaluate the riding comfort including that of tilt train, and started research on the improvement of railway facilities for the aged and the disabled from the viewpoint of universal design

recent research of human scienc on railway system
 thi paper present research of human scienc on railway system at rtri . they are roughli divid into two categori : research to improv safeti and those to improv comfort . on the former subject , for the safeguard against accid caus by human error , we have promot studi of psycholog aptitud test , variou research to evalu train driver ' work condit and environ , and new investig to minim the risk of passeng casualti at train accid . on the latter subject , we have develop new method to evalu the ride comfort includ that of tilt train , and start research on the improv of railway facil for the age and the disabl from the viewpoint of univers design

human science
railway systems
RTRI
accidents
human errors
psychological aptitude test
train drivers' working conditions
train accidents
riding comfort
tilt train
railway facilities
safety improvement
comfort improvement
train drivers' working environments
passenger casualties risk minimisation
aged persons
disabled persons
sight impaired
wakefulness level
ergonomics


Mathematical properties of dominant AHP and concurrent convergence method

Abstract: This study discusses the mathematical structure of the dominant AHP and the concurrent convergence method which were originally developed by Kinoshita and Nakanishi. They introduced a new concept of a regulating alternative into an analyzing tool for a simple evaluation problem with a criterion set and an alternative set. Although the original idea of the dominant AHP and the concurrent convergence method is unique, the dominant AHP and the concurrent convergence method are not sufficiently analyzed in mathematical theory. This study shows that the dominant AHP consists of a pair of evaluation rules satisfying a certain property of overall evaluation vectors. This study also shows that the convergence of concurrent convergence method is guaranteed theoretically

mathemat properti of domin ahp and concurr converg method
 thi studi discuss the mathemat structur of the domin ahp and the concurr converg method which were origin develop by kinoshita and nakanishi . they introduc a new concept of a regul altern into an analyz tool for a simpl evalu problem with a criterion set and an altern set . although the origin idea of the domin ahp and the concurr converg method is uniqu , the domin ahp and the concurr converg method are not suffici analyz in mathemat theori . thi studi show that the domin ahp consist of a pair of evalu rule satisfi a certain properti of overal evalu vector . thi studi also show that the converg of concurr converg method is guarante theoret

dominant AHP
concurrent convergence method
overall evaluation vectors


Efficient simplicial reconstructions of manifolds from their samples

Abstract: An algorithm for manifold learning is presented. Given only samples of a finite-dimensional differentiable manifold and no a priori knowledge of the manifold's geometry or topology except for its dimension, the goal is to find a description of the manifold. The learned manifold must approximate the true manifold well, both geometrically and topologically, when the sampling density is sufficiently high. The proposed algorithm constructs a simplicial complex based on approximations to the tangent bundle of the manifold. An important property of the algorithm is that its complexity depends on the dimension of the manifold, rather than that of the embedding space. Successful examples are presented in the cases of learning curves in the plane, curves in space, and surfaces in space; in addition, a case when the algorithm fails is analyzed

effici simplici reconstruct of manifold from their sampl
 an algorithm for manifold learn is present . given onli sampl of a finite-dimension differenti manifold and no a priori knowledg of the manifold 's geometri or topolog except for it dimens , the goal is to find a descript of the manifold . the learn manifold must approxim the true manifold well , both geometr and topolog , when the sampl densiti is suffici high . the propos algorithm construct a simplici complex base on approxim to the tangent bundl of the manifold . an import properti of the algorithm is that it complex depend on the dimens of the manifold , rather than that of the embed space . success exampl are present in the case of learn curv in the plane , curv in space , and surfac in space ; in addit , a case when the algorithm fail is analyz


Extracting linguistic DNA: NStein goes to work for UPI

Abstract: It's a tantalizing problem for categorization. United Press International (UPI) has more than 700 correspondents creating thousands of stories every week, running the gamut from business news to sports to entertainment to global coverage of America's war on terrorism. And while UPI and others news services have mechanisms for adding keywords and categorizing their content, UPI recognized a need to add more automation to the process. With the recent growth and improvement in tools for Computer-Aided Indexing (CAI), UPI undertook a process of looking at its needs and evaluating the many CAI tools out there. In the end, they chose technology from Montreal-based NStein Technologies. "Our main objective was to acquire the best CAI tool to help improve our customers' access and interaction with our content," says Steve Sweet, CIO at UPI. "We examined a number of solutions, and NStein's NServer suite clearly came out on top. The combination of speed, scalability, accuracy, and flexibility was what really sold us."

extract linguist dna : nstein goe to work for upi
 it 's a tantal problem for categor . unit press intern ( upi ) ha more than 700 correspond creat thousand of stori everi week , run the gamut from busi news to sport to entertain to global coverag of america 's war on terror . and while upi and other news servic have mechan for ad keyword and categor their content , upi recogn a need to add more autom to the process . with the recent growth and improv in tool for computer-aid index ( cai ) , upi undertook a process of look at it need and evalu the mani cai tool out there . in the end , they chose technolog from montreal-bas nstein technolog . " our main object wa to acquir the best cai tool to help improv our custom ' access and interact with our content , " say steve sweet , cio at upi . " we examin a number of solut , and nstein 's nserver suit clearli came out on top . the combin of speed , scalabl , accuraci , and flexibl wa what realli sold us . "

UPI
United Press International
Computer-Aided Indexing
NStein Technologies
electronic archive
wire service stories


Shortchanging the future of information technology: the untapped resource

Abstract: Building on ideas from a virtual workshop and additional input from the scientific community, the CISE Directorate at the National Science Foundation established the Information Technology Workforce Program (ITWF) in March 2000 to support a broad set of scientific research studies focused on the under-representation of women and minorities in the information technology workforce. In this paper, we explore various approaches that the funded researchers are taking to address the problem of women in information technology. We begin with a brief history of the ITWF, and then focus on some of the research projects in terms of their goals, approaches, and expected outcomes

shortchang the futur of inform technolog : the untap resourc
 build on idea from a virtual workshop and addit input from the scientif commun , the cise director at the nation scienc foundat establish the inform technolog workforc program ( itwf ) in march 2000 to support a broad set of scientif research studi focus on the under-represent of women and minor in the inform technolog workforc . in thi paper , we explor variou approach that the fund research are take to address the problem of women in inform technolog . we begin with a brief histori of the itwf , and then focu on some of the research project in term of their goal , approach , and expect outcom


Ten suggestions for a gender-equitable CS classroom

Abstract: Though considerable attention has been paid to the creation of a nurturing environment for women in the field of computer science, proposed solutions have primarily focused on activities outside of the classroom. This paper presents a list of suggestions for modifications to both the pedagogy and content of CS courses designed to make the CS classroom environment more inviting for women students

ten suggest for a gender-equit cs classroom
 though consider attent ha been paid to the creation of a nurtur environ for women in the field of comput scienc , propos solut have primarili focus on activ outsid of the classroom . thi paper present a list of suggest for modif to both the pedagogi and content of cs cours design to make the cs classroom environ more invit for women student

nurturing environment
computer science
pedagogy
CS classroom environment
women students
gender-equitable classroom
CS course content


Parallel and distributed Haskells

Abstract: Parallel and distributed languages specify computations on multiple processors and have a computation language to describe the algorithm, i.e. what to compute, and a coordination language to describe how to organise the computations across the processors. Haskell has been used as the computation language for a wide variety of parallel and distributed languages, and this paper is a comprehensive survey of implemented languages. It outlines parallel and distributed language concepts and classifies Haskell extensions using them. Similar example programs are used to illustrate and contrast the coordination languages, and the comparison is facilitated by the common computation language. A lazy language is not an obvious choice for parallel or distributed computation, and we address the question of why Haskell is a common functional computation language

parallel and distribut haskel
 parallel and distribut languag specifi comput on multipl processor and have a comput languag to describ the algorithm , i.e. what to comput , and a coordin languag to describ how to organis the comput across the processor . haskel ha been use as the comput languag for a wide varieti of parallel and distribut languag , and thi paper is a comprehens survey of implement languag . it outlin parallel and distribut languag concept and classifi haskel extens use them . similar exampl program are use to illustr and contrast the coordin languag , and the comparison is facilit by the common comput languag . a lazi languag is not an obviou choic for parallel or distribut comput , and we address the question of whi haskel is a common function comput languag

distributed Haskell
distributed languages
multiple processors
coordination language
lazy language
functional computation language
parallel Haskell
parallel languages
functional programming


Comparison of automated digital elevation model extraction results using along-track ASTER and across-track SPOT stereo images

Abstract: A digital elevation model (DEM) can be extracted automatically from stereo satellite images. During the past decade, the most common satellite data used to extract DEM was the across-track SPOT. Recently, the addition of along-track ASTER data, which can be downloaded freely, provides another attractive alternative to extract DEM data. This work compares the automated DEM extraction results using an ASTER stereo pair and a SPOT stereo pair over an area of hilly mountains in Drum Mountain, Utah, when compared to a USGS 7.5-min DEM standard product. The result shows that SPOT produces better DEM results in terms of accuracy and details, if the radiometric variations between the images, taken on subsequent satellite revolutions, are small. Otherwise, the ASTER stereo pair is a better choice because of simultaneous along-track acquisition during a single pass. Compared to the USGS 7.5-min DEM, the ASTER and the SPOT extracted DEMs have a standard deviation of 11.6 and 4.6 m, respectively

comparison of autom digit elev model extract result use along-track aster and across-track spot stereo imag
 a digit elev model ( dem ) can be extract automat from stereo satellit imag . dure the past decad , the most common satellit data use to extract dem wa the across-track spot . recent , the addit of along-track aster data , which can be download freeli , provid anoth attract altern to extract dem data . thi work compar the autom dem extract result use an aster stereo pair and a spot stereo pair over an area of hilli mountain in drum mountain , utah , when compar to a usg 7.5-min dem standard product . the result show that spot produc better dem result in term of accuraci and detail , if the radiometr variat between the imag , taken on subsequ satellit revolut , are small . otherwis , the aster stereo pair is a better choic becaus of simultan along-track acquisit dure a singl pass . compar to the usg 7.5-min dem , the aster and the spot extract dem have a standard deviat of 11.6 and 4.6 m , respect


Numerical simulation of information recovery in quantum computers

Abstract: Decoherence is the main problem to be solved before quantum computers can be built. To control decoherence, it is possible to use error correction methods, but these methods are themselves noisy quantum computation processes. In this work, we study the ability of Steane's and Shor's fault-tolerant recovering methods, as well as a modification of Steane's ancilla network, to correct errors in qubits. We test a way to measure correctly ancilla's fidelity for these methods, and state the possibility of carrying out an effective error correction through a noisy quantum channel, even using noisy error correction methods

numer simul of inform recoveri in quantum comput
 decoher is the main problem to be solv befor quantum comput can be built . to control decoher , it is possibl to use error correct method , but these method are themselv noisi quantum comput process . in thi work , we studi the abil of stean 's and shor 's fault-toler recov method , as well as a modif of stean 's ancilla network , to correct error in qubit . we test a way to measur correctli ancilla 's fidel for these method , and state the possibl of carri out an effect error correct through a noisi quantum channel , even use noisi error correct method

numerical simulation
information recovery
quantum computers
error correction methods
noisy quantum computation processes
fault-tolerant recovering methods
ancilla network
qubits
noisy quantum channel
noisy error correction methods
decoherence control
ancilla fidelity


The case for activity based management

Abstract: In today's stormy economic climate businesses need Activity Based Management (ABM) more than ever before. In an economic downturn it is a vital tool for pinpointing a business' most profitable customers, products, regions or channels, as well as uncovering the costs of individual business processes that may need to be improved in order to drive higher profit levels. Changes may be afoot in the ABM market, but Armstrong Laing Group CEO Mike Sherratt argues that businesses need specialists with an ABM focus to keep up with their requirements in such a climate. He looks at what benefits a `best-of-breed' ABM system can offer businesses and contends that businesses must choose carefully when going down the ABM route - and also ask themselves the question whether 'generalist' organisations will be able to deliver the best possible ABM solution

the case for activ base manag
 in today 's stormi econom climat busi need activ base manag ( abm ) more than ever befor . in an econom downturn it is a vital tool for pinpoint a busi ' most profit custom , product , region or channel , as well as uncov the cost of individu busi process that may need to be improv in order to drive higher profit level . chang may be afoot in the abm market , but armstrong la group ceo mike sherratt argu that busi need specialist with an abm focu to keep up with their requir in such a climat . he look at what benefit a ` best-of-bre ' abm system can offer busi and contend that busi must choos care when go down the abm rout - and also ask themselv the question whether ' generalist ' organis will be abl to deliv the best possibl abm solut

activity based management
Armstrong Laing Group
activity based costing
best-of-breed ABM


Electronic reserves at University College London: understanding the needs of academic departments

Abstract: This article describes a recent project at University College London to explore the feasibility of providing a service to improve access to electronic course materials. Funded by the Higher Education Funding Council for England (HEFCE), the project was not simply to set up an electronic reserve. By undertaking a needs analysis of academic departments, the project was able to tailor the design of the new service appropriately. While new initiatives in libraries are often established using project funding, this work was unique in being research-led. It also involved collaboration between library and computing staff and learning technologists

electron reserv at univers colleg london : understand the need of academ depart
 thi articl describ a recent project at univers colleg london to explor the feasibl of provid a servic to improv access to electron cours materi . fund by the higher educ fund council for england ( hefc ) , the project wa not simpli to set up an electron reserv . by undertak a need analysi of academ depart , the project wa abl to tailor the design of the new servic appropri . while new initi in librari are often establish use project fund , thi work wa uniqu in be research-l . it also involv collabor between librari and comput staff and learn technologist


The results of experimental studies of the reflooding of fuel-rod assemblies from above and problems for future investigations

Abstract: Problems in studying the reflooding of assemblies from above conducted at foreign and Russian experimental installations are considered. The efficiency of cooling and flow reversal under countercurrent flow of steam and water, as well as the scale effect are analyzed. The tasks for future experiments that are necessary for the development of modern correlations for the loss-of-coolant accident (LOCA) computer codes are stated

the result of experiment studi of the reflood of fuel-rod assembl from abov and problem for futur investig
 problem in studi the reflood of assembl from abov conduct at foreign and russian experiment instal are consid . the effici of cool and flow revers under countercurr flow of steam and water , as well as the scale effect are analyz . the task for futur experi that are necessari for the develop of modern correl for the loss-of-cool accid ( loca ) comput code are state

Russian experimental installations
flow reversal
countercurrent flow
steam
water
fuel-rod assemblies reflooding
cooling efficiency
loss-of-coolant accident computer codes
LOCA computer codes


Lattice Boltzmann schemes for quantum applications

Abstract: We review the basic ideas behind the quantum lattice Boltzmann equation (LBE), and present a few thoughts on the possible use of such an equation for simulating quantum many-body problems on both (parallel) electronic and quantum computers

lattic boltzmann scheme for quantum applic
 we review the basic idea behind the quantum lattic boltzmann equat ( lbe ) , and present a few thought on the possibl use of such an equat for simul quantum many-bodi problem on both ( parallel ) electron and quantum comput

lattice Boltzmann schemes
quantum applications
quantum many-body problems
quantum computers
parallel computing


Enterprise content integration III: Agari Mediaware's Media Star

Abstract: Since we introduced the term Enterprise Content Integration (ECI) in January, the concept has gained momentum in the market. In addition to Context Media's Interchange Platform and Savantech's Photon Commerce, Agari Mediaware's Media Star is in the fray. It is a middleware platform that allows large media companies to integrate their digital systems with great flexibility

enterpris content integr iii : agari mediawar 's media star
 sinc we introduc the term enterpris content integr ( eci ) in januari , the concept ha gain momentum in the market . in addit to context media 's interchang platform and savantech 's photon commerc , agari mediawar 's media star is in the fray . it is a middlewar platform that allow larg media compani to integr their digit system with great flexibl

enterprise content integration
middleware
Agari Mediaware Media Star


Using technology to facilitate the design and delivery of warnings

Abstract: This paper describes several ways in which new technologies can assist in the design and delivery of warnings. There are four discussion points: (1) current product information can be delivered via the Internet; (2) computer software and hardware are available to assist in the design, construction, and production of visual and auditory warnings; (3) various detection devices can be used to recognize instances in which warnings might be delivered; and (4) a warning presentation can be modified to fit conditions and persons. Implications, example applications and future prospects of these points are described

use technolog to facilit the design and deliveri of warn
 thi paper describ sever way in which new technolog can assist in the design and deliveri of warn . there are four discuss point : ( 1 ) current product inform can be deliv via the internet ; ( 2 ) comput softwar and hardwar are avail to assist in the design , construct , and product of visual and auditori warn ; ( 3 ) variou detect devic can be use to recogn instanc in which warn might be deliv ; and ( 4 ) a warn present can be modifi to fit condit and person . implic , exampl applic and futur prospect of these point are describ

product information
Internet
computer software
auditory warnings
warning presentation
computer hardware


Wave propagation related to high-speed train. A scaled boundary FE-approach for unbounded domains

Abstract: Analysis of wave propagation in solid materials under moving loads is a topic of great interest in railway engineering. The objective of the paper is three-dimensional modelling of high-speed train related ground vibrations; in particular the question of how to account for the unbounded media is addressed. For efficient and accurate modelling of railway structural components taking the unbounded media into account, a hybrid method based on a combination of the conventional finite element method and scaled boundary finite element method is established. In the paper, element matrices and solution procedures for the scaled boundary finite element method (SBFEM) are derived. A non-linear finite element iteration scheme using Lagrange multipliers and coupling between the unbounded domain and the finite element domain are also discussed. Two numerical examples including one example demonstrating the dynamical response of a railroad section are presented to demonstrate the performance of the proposed method

wave propag relat to high-spe train . a scale boundari fe-approach for unbound domain
 analysi of wave propag in solid materi under move load is a topic of great interest in railway engin . the object of the paper is three-dimension model of high-spe train relat ground vibrat ; in particular the question of how to account for the unbound media is address . for effici and accur model of railway structur compon take the unbound media into account , a hybrid method base on a combin of the convent finit element method and scale boundari finit element method is establish . in the paper , element matric and solut procedur for the scale boundari finit element method ( sbfem ) are deriv . a non-linear finit element iter scheme use lagrang multipli and coupl between the unbound domain and the finit element domain are also discuss . two numer exampl includ one exampl demonstr the dynam respons of a railroad section are present to demonstr the perform of the propos method

nonlinear finite element iteration scheme


Parallel implicit predictor corrector methods

Abstract: The performance of parallel codes for the solution of initial value problems is usually strongly sensitive to the dimension of the continuous problem. This is due to the overhead related to the exchange of information among the processors and motivates the problem of minimizing the amount of communications. According to this principle, we define the so called Parallel Implicit Predictor Corrector Methods and in this class we derive A-stable, L-stable and numerically zero-stable formulas. The latter property refers to the zero-stability condition of a given formula when roundoff errors are introduced in its coefficients due to their representation in finite precision arithmetic. Some numerical experiment show the potentiality of this approach

parallel implicit predictor corrector method
 the perform of parallel code for the solut of initi valu problem is usual strongli sensit to the dimens of the continu problem . thi is due to the overhead relat to the exchang of inform among the processor and motiv the problem of minim the amount of commun . accord to thi principl , we defin the so call parallel implicit predictor corrector method and in thi class we deriv a-stabl , l-stabl and numer zero-st formula . the latter properti refer to the zero-st condit of a given formula when roundoff error are introduc in it coeffici due to their represent in finit precis arithmet . some numer experi show the potenti of thi approach

parallel implicit predictor corrector methods


Minimizing the number of successor states in the stubborn set method

Abstract: Combinatorial explosion which occurs in parallel compositions of LTSs can be alleviated by letting the stubborn set method construct on-the-fly a reduced LTS that is CFFD- or CSP-equivalent to the actual parallel composition. This article considers the problem of minimizing the number of successor states of a given state in the reduced LTS. The problem can be solved by constructing an and/or-graph with weighted vertices and by finding a set of vertices that satisfies a certain constraint such that no set of vertices satisfying the constraint has a smaller sum of weights. Without weights, the and/or-graph can be constructed in low-degree polynomial time w.r.t. the length of the input of the problem. However, since actions can be nondeterministic and transitions can share target states, it is not known whether the weights are generally computable in polynomial time. Consequently, it is an open problem whether minimizing the number of successor states is as "easy" as minimizing the number of successor transitions

minim the number of successor state in the stubborn set method
 combinatori explos which occur in parallel composit of ltss can be allevi by let the stubborn set method construct on-the-fli a reduc lt that is cffd- or csp-equival to the actual parallel composit . thi articl consid the problem of minim the number of successor state of a given state in the reduc lt . the problem can be solv by construct an and / or-graph with weight vertic and by find a set of vertic that satisfi a certain constraint such that no set of vertic satisfi the constraint ha a smaller sum of weight . without weight , the and / or-graph can be construct in low-degre polynomi time w.r.t . the length of the input of the problem . howev , sinc action can be nondeterminist and transit can share target state , it is not known whether the weight are gener comput in polynomi time . consequ , it is an open problem whether minim the number of successor state is as " easi " as minim the number of successor transit

stubborn set method
combinatorial explosion
CSP-equivalence
weighted vertices
low-degree polynomial time


Himalayan information system: a proposed model

Abstract: The information explosion and the development in information technology force us to develop information systems in various fields. The research on Himalaya has achieved phenomenal growth in recent years in India. The information requirements of Himalayan researchers are divergent in nature. In order to meet these divergent needs, all information generated in various Himalayan research institutions has to be collected and organized to facilitate free flow of information. This paper describes the need for a system for Himalayan information. It also presents the objectives of Himalayan information system (HIMIS). It discusses in brief the idea of setting up a HIMIS and explains its utility to the users. It appeals to the government for supporting the development of such system

himalayan inform system : a propos model
 the inform explos and the develop in inform technolog forc us to develop inform system in variou field . the research on himalaya ha achiev phenomen growth in recent year in india . the inform requir of himalayan research are diverg in natur . in order to meet these diverg need , all inform gener in variou himalayan research institut ha to be collect and organ to facilit free flow of inform . thi paper describ the need for a system for himalayan inform . it also present the object of himalayan inform system ( himi ) . it discuss in brief the idea of set up a himi and explain it util to the user . it appeal to the govern for support the develop of such system

information explosion
information technology
India
information requirements
HIMIS
government
Himalayan information system model
information network


Efficient transitive closure reasoning in a combined class/part/containment hierarchy

Abstract: Class hierarchies form the backbone of many implemented knowledge representation and reasoning systems. They are used for inheritance, classification and transitive closure reasoning. Part hierarchies are also important in artificial intelligence. Other hierarchies, e.g. containment hierarchies, have received less attention in artificial intelligence. This paper presents an architecture and an implementation of a hierarchy reasoner that integrates a class hierarchy, a part hierarchy, and a containment hierarchy into one structure. In order to make an implemented reasoner useful, it needs to operate at least at speeds comparable to human reasoning. As real-world hierarchies are always large, special techniques need to be used to achieve this. We have developed a set of parallel algorithms and a data representation called maximally reduced tree cover for that purpose. The maximally reduced tree cover is an improvement of a materialized transitive closure representation which has appeared in the literature. Our experiments with a medical vocabulary show that transitive closure reasoning for combined class/part/containment hierarchies in near constant time is possible for a fixed hardware configuration

effici transit closur reason in a combin class / part / contain hierarchi
 class hierarchi form the backbon of mani implement knowledg represent and reason system . they are use for inherit , classif and transit closur reason . part hierarchi are also import in artifici intellig . other hierarchi , e.g. contain hierarchi , have receiv less attent in artifici intellig . thi paper present an architectur and an implement of a hierarchi reason that integr a class hierarchi , a part hierarchi , and a contain hierarchi into one structur . in order to make an implement reason use , it need to oper at least at speed compar to human reason . as real-world hierarchi are alway larg , special techniqu need to be use to achiev thi . we have develop a set of parallel algorithm and a data represent call maxim reduc tree cover for that purpos . the maxim reduc tree cover is an improv of a materi transit closur represent which ha appear in the literatur . our experi with a medic vocabulari show that transit closur reason for combin class / part / contain hierarchi in near constant time is possibl for a fix hardwar configur


Fuzzy system modeling in pharmacology: an improved algorithm

Abstract: In this paper, we propose an improved fuzzy system modeling algorithm to address some of the limitations of the existing approaches identified during our modeling with pharmacological data. This algorithm differs from the existing ones in its approach to the cluster validity problem (i.e., number of clusters), the projection schema (i.e., input membership assignment and rule determination), and significant input determination. The new algorithm is compared with the Bazoon-Turksen model, which is based on the well-known Sugeno-Yasukawa approach. The comparison was made in terms of predictive performance using two different data sets. The first comparison was with a two variable nonlinear function prediction problem and the second comparison was with a clinical pharmacokinetic modeling problem. It is shown that the proposed algorithm provides more precise predictions. Determining the degree of significance for each input variable, allows the user to distinguish their relative importance

fuzzi system model in pharmacolog : an improv algorithm
 in thi paper , we propos an improv fuzzi system model algorithm to address some of the limit of the exist approach identifi dure our model with pharmacolog data . thi algorithm differ from the exist one in it approach to the cluster valid problem ( i.e. , number of cluster ) , the project schema ( i.e. , input membership assign and rule determin ) , and signific input determin . the new algorithm is compar with the bazoon-turksen model , which is base on the well-known sugeno-yasukawa approach . the comparison wa made in term of predict perform use two differ data set . the first comparison wa with a two variabl nonlinear function predict problem and the second comparison wa with a clinic pharmacokinet model problem . it is shown that the propos algorithm provid more precis predict . determin the degre of signific for each input variabl , allow the user to distinguish their rel import

fuzzy system modeling
pharmacology
cluster validity problem
projection schema
significant input determination
predictive performance
pharmacokinetic modeling
fuzzy sets
fuzzy logic


Modification for synchronization of Rossler and Chen chaotic systems

Abstract: Active control is an effective method for making two identical Rossler and Chen systems be synchronized. However, this method works only for a certain class of chaotic systems with known parameters both in drive systems and response systems. Modification based on Lyapunov stability theory is proposed in order to overcome this limitation. An adaptive synchronization controller, which can make the states of two identical Rossler and Chen systems globally asymptotically synchronized in the presence of system's unknown constant parameters, is derived. Especially, when some unknown parameters are positive, we can make the controller more simple, besides, the controller is independent of those positive uncertain parameters. At last, when the condition that arbitrary unknown parameters in two systems are identical constants is cancelled, we demonstrate that it is possible to synchronize two chaotic systems. All results are proved using a well-known Lyapunov stability theorem. Numerical simulations are given to validate the proposed synchronization approach

modif for synchron of rossler and chen chaotic system
 activ control is an effect method for make two ident rossler and chen system be synchron . howev , thi method work onli for a certain class of chaotic system with known paramet both in drive system and respons system . modif base on lyapunov stabil theori is propos in order to overcom thi limit . an adapt synchron control , which can make the state of two ident rossler and chen system global asymptot synchron in the presenc of system 's unknown constant paramet , is deriv . especi , when some unknown paramet are posit , we can make the control more simpl , besid , the control is independ of those posit uncertain paramet . at last , when the condit that arbitrari unknown paramet in two system are ident constant is cancel , we demonstr that it is possibl to synchron two chaotic system . all result are prove use a well-known lyapunov stabil theorem . numer simul are given to valid the propos synchron approach

synchronization
Chen chaotic systems
active control
response systems
Lyapunov stability theory
adaptive synchronization controller
global asymptotic synchronization
Rossler chaotic systems


Sharpening the estimate of the stability constant in the maximum-norm of the Crank-Nicolson scheme for the one-dimensional heat equation

Abstract: This paper is concerned with the stability constant C/sub infinity / in the maximum-norm of the Crank-Nicolson scheme applied. to the one-dimensional heat equation. A well known result due to S.J. Serdyukova is that C/sub infinity / < 23. In the present paper, by using a sharp resolvent estimate for the discrete Laplacian together with the Cauchy formula, it is shown that 3 <or= C/sub infinity / < 4.325. This bound also holds when the heat equation is considered on a bounded interval along with Dirichlet or Neumann boundary conditions

sharpen the estim of the stabil constant in the maximum-norm of the crank-nicolson scheme for the one-dimension heat equat
 thi paper is concern with the stabil constant c / sub infin / in the maximum-norm of the crank-nicolson scheme appli . to the one-dimension heat equat . a well known result due to s.j. serdyukova is that c / sub infin / < 23 . in the present paper , by use a sharp resolv estim for the discret laplacian togeth with the cauchi formula , it is shown that 3 < or= c / sub infin / < 4.325 . thi bound also hold when the heat equat is consid on a bound interv along with dirichlet or neumann boundari condit

stability constant
Crank-Nicolson scheme
one-dimensional heat equation
sharp resolvent estimate
discrete Laplacian
Cauchy formula
Neumann boundary conditions
Dirichlet boundary conditions


Computing failure probabilities. Applications to reliability analysis

Abstract: The paper presents one method for calculating failure probabilities with applications to reliability analysis. The method is based on transforming the initial set of variables to a n-dimensional uniform random variable in the unit hypercube, together with the limit condition set and calculating the associated probability using a recursive method based on the Gauss-Legendre quadrature formulas to calculate the resulting multiple integrals. An example of application is used to illustrate the proposed method

comput failur probabl . applic to reliabl analysi
 the paper present one method for calcul failur probabl with applic to reliabl analysi . the method is base on transform the initi set of variabl to a n-dimension uniform random variabl in the unit hypercub , togeth with the limit condit set and calcul the associ probabl use a recurs method base on the gauss-legendr quadratur formula to calcul the result multipl integr . an exampl of applic is use to illustr the propos method

n-dimensional uniform random variable
unit hypercube
limit condition
recursive method
Gauss-Legendre quadrature formulae
failure probabilities computation
reliability analysis applications
multiple integrals calculation
tail approximation


New approach to standing phase angle reduction for power system restoration

Abstract: During power system restoration, it is necessary to check the phase angle between two buses before closing circuit breakers to connect a line between them. These angles may occur across a tie line between two systems or between two connected subsystems within a system. In case of large standing phase angle (SPA) difference the synchro-check relay does not allow closing of the breaker for this line. Therefore, this excessive SPA has to be reduced before attempting to connect the line. In this paper, a new and fast method for reducing SPA is presented. For this purpose, the standing phase angle difference between two specific buses is represented in terms of sensitivity factors associated with the change in active power generations and consumption at the buses. Then, the proposed method reschedule generation of selected units or shed load of selected buses to reduce excessive SPA difference between two buses based on sensitivity factors

new approach to stand phase angl reduct for power system restor
 dure power system restor , it is necessari to check the phase angl between two buse befor close circuit breaker to connect a line between them . these angl may occur across a tie line between two system or between two connect subsystem within a system . in case of larg stand phase angl ( spa ) differ the synchro-check relay doe not allow close of the breaker for thi line . therefor , thi excess spa ha to be reduc befor attempt to connect the line . in thi paper , a new and fast method for reduc spa is present . for thi purpos , the stand phase angl differ between two specif buse is repres in term of sensit factor associ with the chang in activ power gener and consumpt at the buse . then , the propos method reschedul gener of select unit or shed load of select buse to reduc excess spa differ between two buse base on sensit factor

power system restoration
sensitivity factors
standing phase angle reduction approach
circuit breaker closing
synchrocheck relay
power line connection


Individual decision making using fuzzy set theory

Abstract: The paper shows the importance of decision making by an individual and highlights the prime domain of decision making where fuzzy set theory can be used as a tool. Fuzzy set theory has been used on rational model of decision making to arrive at the desired conclusion

individu decis make use fuzzi set theori
 the paper show the import of decis make by an individu and highlight the prime domain of decis make where fuzzi set theori can be use as a tool . fuzzi set theori ha been use on ration model of decis make to arriv at the desir conclus

individual decision making
fuzzy set theory
rational decision making model


Multicriterion optimization of composite laminates for maximum failure margins with an interactive descent algorithm

Abstract: An interactive multicriterion optimization method for composite laminates subjected to multiple loading conditions is introduced. Laminate margins to initial failure (first ply failure, FPF) with respect of the applied loading conditions are treated as criteria. The original problem is reduced to a, bicriterion problem by introducing parameters to combine criteria in a linear manner. The problem is solved by using an interactive descent algorithm. Both the conditions required for a discrete procedure to converge towards a Pareto optimum and numerical examples are given

multicriterion optim of composit lamin for maximum failur margin with an interact descent algorithm
 an interact multicriterion optim method for composit lamin subject to multipl load condit is introduc . lamin margin to initi failur ( first pli failur , fpf ) with respect of the appli load condit are treat as criteria . the origin problem is reduc to a , bicriterion problem by introduc paramet to combin criteria in a linear manner . the problem is solv by use an interact descent algorithm . both the condit requir for a discret procedur to converg toward a pareto optimum and numer exampl are given

composite laminates
maximum failure margins
interactive descent algorithm
interactive multicriterion optimization
multiple loading conditions
first ply failure
bicriterion problem
discrete procedure
convergence
Pareto optimum


A novel control logic for fast valving operations

Abstract: This letter proposes new control logic for operating parallel valves in fast valving schemes in order to improve the transient stability performance of power systems. A fast valving scheme using parallel valves overcomes many of the limitations of the conventional scheme. The proposed control logic for operating these valves has been applied to a typical single machine infinite bus system. Single as well as multiple stroke operations for controlling the turbine power output have been studied with the new control sequences. Encouraging results have been shown over the conventional schemes of fast valving

a novel control logic for fast valv oper
 thi letter propos new control logic for oper parallel valv in fast valv scheme in order to improv the transient stabil perform of power system . a fast valv scheme use parallel valv overcom mani of the limit of the convent scheme . the propos control logic for oper these valv ha been appli to a typic singl machin infinit bu system . singl as well as multipl stroke oper for control the turbin power output have been studi with the new control sequenc . encourag result have been shown over the convent scheme of fast valv

control logic
transient stability performance
transient stability
single machine infinite bus system
multiple stroke operations
parallel valves operation
single stroke operations
turbine power output control