Simulating fermions on a quantum computer

Abstract: The real-time probabilistic simulation of quantum systems in classical computers is known to be limited by the so-called dynamical sign problem, a problem leading to exponential complexity. In 1981 Richard Feynman raised some provocative questions in connection to the "exact imitation" of such systems using a special device named a "quantum computer". Feynman hesitated about the possibility of imitating fermion systems using such a device. Here we address some of his concerns and, in particular, investigate the simulation of fermionic systems. We show how quantum computers avoid the sign problem in some cases by reducing the complexity from exponential to polynomial. Our demonstration is based upon the use of isomorphisms of algebras. We present specific quantum algorithms that illustrate the main points of our algebraic approach

simul fermion on a quantum comput
 the real-tim probabilist simul of quantum system in classic comput is known to be limit by the so-cal dynam sign problem , a problem lead to exponenti complex . in 1981 richard feynman rais some provoc question in connect to the " exact imit " of such system use a special devic name a " quantum comput " . feynman hesit about the possibl of imit fermion system use such a devic . here we address some of hi concern and , in particular , investig the simul of fermion system . we show how quantum comput avoid the sign problem in some case by reduc the complex from exponenti to polynomi . our demonstr is base upon the use of isomorph of algebra . we present specif quantum algorithm that illustr the main point of our algebra approach

quantum computer
real-time probabilistic simulation
classical computers
dynamical sign problem
sign problem
exponential complexity
fermion systems
isomorphisms
algebras
fermions simulation


19in monitors [CRT survey]

Abstract: Upgrade your monitor from as little as Pounds 135. With displays on test and ranging up to Pounds 400, whether you're after the last word in quality or simply looking for again, this Labs holds the answer. Looks at ADI MicroScan M900, CTX PR960F, Eizo FlexScan T766, Hansol 920D, Hansol920P, Hitachi CM715ET, Hitachi CM721FET, liyama Vision Master Pro 454, LG Flatron 915FT Plus, Mitsubishi Diamond Pro 920, NEC MultiSync FE950+, Philips 109S40, Samsung SyncMaster 959NF, Sony Multiscan CPD-G420, and ViewSonic G90f

19 in monitor [ crt survey ]
 upgrad your monitor from as littl as pound 135 . with display on test and rang up to pound 400 , whether you 're after the last word in qualiti or simpli look for again , thi lab hold the answer . look at adi microscan m900 , ctx pr960f , eizo flexscan t766 , hansol 920d , hansol920p , hitachi cm715et , hitachi cm721fet , liyama vision master pro 454 , lg flatron 915ft plu , mitsubishi diamond pro 920 , nec multisync fe950 + , philip 109s40 , samsung syncmast 959nf , soni multiscan cpd-g420 , and viewson g90f

19in monitors
19 in
CRT survey
ADI MicroScan M900
CTX PR960F
Eizo FlexScan T766
Hansol 920D
Hansol920P
Hitachi CM715ET
Hitachi CM721FET
liyama Vision Master Pro 454
LG Flatron 915FT Plus
Mitsubishi Diamond Pro 920
NEC MultiSync FE950
Philips 109S40
Samsung SyncMaster 959NF
Sony Multiscan CPD-G420
ViewSonic G90f


Evaluation of the usability of digital maintenance manuals developed without either user input or a task analysis

Abstract: The primary objective was to investigate the value that can be added to a low-cost digital maintenance manual by the addition of a navigational aid. Two versions of a digital maintenance manual were developed, the difference between them being the number of design heuristics observed when designing navigational aids. Neither version was based on an analysis of the tasks carried out by users, nor were users involved in the design process. Instead, the manuals were developed directly from the digital information used to produce the existing paper manual. Usability trials were carried out to test both versions according to the time taken and errors committed by users during typical information retrieval tasks. Users were questioned to determine their ease of use (EOU) perceptions for each manual. The main outcomes were that the navigation aid used in the second version reduced the time taken to use the manual but increased the number of errors made by users. The navigational aid also seemed to reduce the perceived EOU compared with the first version. In both cases, the perceived EOU was lower than for a previous digital manual that had been developed using a task analysis and user input. The paper concludes by recommending the development of a generic task model of user interaction with digital maintenance manuals

evalu of the usabl of digit mainten manual develop without either user input or a task analysi
 the primari object wa to investig the valu that can be ad to a low-cost digit mainten manual by the addit of a navig aid . two version of a digit mainten manual were develop , the differ between them be the number of design heurist observ when design navig aid . neither version wa base on an analysi of the task carri out by user , nor were user involv in the design process . instead , the manual were develop directli from the digit inform use to produc the exist paper manual . usabl trial were carri out to test both version accord to the time taken and error commit by user dure typic inform retriev task . user were question to determin their eas of use ( eou ) percept for each manual . the main outcom were that the navig aid use in the second version reduc the time taken to use the manual but increas the number of error made by user . the navig aid also seem to reduc the perceiv eou compar with the first version . in both case , the perceiv eou wa lower than for a previou digit manual that had been develop use a task analysi and user input . the paper conclud by recommend the develop of a gener task model of user interact with digit mainten manual

task analysis
navigational aid
usability trials
information retrieval
generic task model
user interaction
digital maintenance manuals usability


Strobbe Graphics' next frontier: CTP for commercial printers

Abstract: Strobbe is one of the more successful makers of newspaper platesetters, which are sold by Agfa under the Polaris name. But the company also has a growing presence in commercial printing markets, where it sells under its own name

strobb graphic ' next frontier : ctp for commerci printer
 strobb is one of the more success maker of newspap platesett , which are sold by agfa under the polari name . but the compani also ha a grow presenc in commerci print market , where it sell under it own name

Strobbe Graphics
commercial printing
platesetters
Agfa
Polaris
Punch International
workflow


Direct gear tooth contact analysis for hypoid bevel gears

Abstract: A new methodology for tooth contact analysis based on a very general mathematical model of the generating process is proposed. Considering the line of action as a first order singularity of a certain operator equation we develop first and second order conditions for a pair of generated gear tooth flanks to be in contact. The constructive approach allows the direct computation of the paths of contact as the solution of a nonlinear equation system including the exact determination of the bounds of the paths of contact. The transmission error as well as curvature properties in the contact points are obtained in a convenient way. The resulting contact ellipses approximate the bearing area. Through the use of automatic differentiation all the geometric quantities are calculable within the machine accuracy of the computer

direct gear tooth contact analysi for hypoid bevel gear
 a new methodolog for tooth contact analysi base on a veri gener mathemat model of the gener process is propos . consid the line of action as a first order singular of a certain oper equat we develop first and second order condit for a pair of gener gear tooth flank to be in contact . the construct approach allow the direct comput of the path of contact as the solut of a nonlinear equat system includ the exact determin of the bound of the path of contact . the transmiss error as well as curvatur properti in the contact point are obtain in a conveni way . the result contact ellips approxim the bear area . through the use of automat differenti all the geometr quantiti are calcul within the machin accuraci of the comput

direct gear tooth contact analysis
hypoid bevel gears
mathematical model
generating process
first order singularity
operator equation
second order conditions
generated gear tooth flanks
computer
nonlinear equation system
transmission error
curvature properties
contact ellipses
bearing area
automatic differentiation
geometric quantities
machine accuracy
first order conditions
contact paths
exact bound determination


Accuracy and stability of splitting with Stabilizing Corrections

Abstract: This paper contains a convergence analysis for the method of stabilizing corrections, which is an internally consistent splitting scheme for initial-boundary value problems. To obtain more accuracy and a better treatment of explicit terms several extensions are regarded and analyzed. The relevance of the theoretical results is tested for convection-diffusion-reaction equations

accuraci and stabil of split with stabil correct
 thi paper contain a converg analysi for the method of stabil correct , which is an intern consist split scheme for initial-boundari valu problem . to obtain more accuraci and a better treatment of explicit term sever extens are regard and analyz . the relev of the theoret result is test for convection-diffusion-react equat

stability
stabilizing corrections
convergence analysis
splitting scheme
initial-boundary value problems
convection-diffusion-reaction equations


Four-terminal quantum resistor network for electron-wave computing

Abstract: Interconnected ultrathin conducting wires or, equivalently, interconnected quasi-one-dimensional electron waveguides, which form a quantum resistor network, are presented here in four-terminal configurations. The transmission behaviors through such four-terminal networks are evaluated and classified. In addition, we show that such networks can be used as the basic building blocks for a possible massive wave computing machine in the future. In a network, each interconnection, a node point, is an elastic scatterer that routes the electron wave. Routing and rerouting of electron waves in a network is described in the framework of quantum transport from Landauer-Buttiker theory in the presence of multiple elastic scatterers. Transmissions through various types of four-terminal generalized clean Aharonov-Bohm rings are investigated at zero temperature. Useful logic functions are gathered based on the transmission probability to each terminal with the use of the Buttiker symmetry rule. In the generalized rings, even and odd numbers of terminals can possess some distinctly different transmission characteristics as we have shown here and earlier. Just as an even or odd number of atoms in a ring is an important quantity for classifying the transmission behavior, we show here that whether the number of terminals is an even or an odd number is just as important in understanding the physics of transmission through such a ring. Furthermore, we show that there are three basic classes of four-terminal rings and the scaling relation for each class is provided. In particular, the existence of equitransmission among all four terminals is shown here. This particular physical phenomena cannot exist in any three-terminal ring. Comparisons and discussions of transmission characteristics between three-terminal and four-terminal rings are also presented. The node-equation approach by considering the Kirchhoff current conservation law at each node point is used for this analysis. Many useful logic functions for electron-wave computing are shown here. In particular, we show that a full adder can be constructed very simply using the equitransmission property of the four-terminal ring. This is in sharp contrast with circuits based on transistor logic

four-termin quantum resistor network for electron-wav comput
 interconnect ultrathin conduct wire or , equival , interconnect quasi-one-dimension electron waveguid , which form a quantum resistor network , are present here in four-termin configur . the transmiss behavior through such four-termin network are evalu and classifi . in addit , we show that such network can be use as the basic build block for a possibl massiv wave comput machin in the futur . in a network , each interconnect , a node point , is an elast scatter that rout the electron wave . rout and rerout of electron wave in a network is describ in the framework of quantum transport from landauer-buttik theori in the presenc of multipl elast scatter . transmiss through variou type of four-termin gener clean aharonov-bohm ring are investig at zero temperatur . use logic function are gather base on the transmiss probabl to each termin with the use of the buttik symmetri rule . in the gener ring , even and odd number of termin can possess some distinctli differ transmiss characterist as we have shown here and earlier . just as an even or odd number of atom in a ring is an import quantiti for classifi the transmiss behavior , we show here that whether the number of termin is an even or an odd number is just as import in understand the physic of transmiss through such a ring . furthermor , we show that there are three basic class of four-termin ring and the scale relat for each class is provid . in particular , the exist of equitransmiss among all four termin is shown here . thi particular physic phenomena can not exist in ani three-termin ring . comparison and discuss of transmiss characterist between three-termin and four-termin ring are also present . the node-equ approach by consid the kirchhoff current conserv law at each node point is use for thi analysi . mani use logic function for electron-wav comput are shown here . in particular , we show that a full adder can be construct veri simpli use the equitransmiss properti of the four-termin ring . thi is in sharp contrast with circuit base on transistor logic

interconnected ultrathin conducting wires


Reconstructing surfaces by volumetric regularization using radial basis functions

Abstract: We present a new method of surface reconstruction that generates smooth and seamless models from sparse, noisy, nonuniform, and low resolution range data. Data acquisition techniques from computer vision, such as stereo range images and space carving, produce 3D point sets that are imprecise and nonuniform when compared to laser or optical range scanners. Traditional reconstruction algorithms designed for dense and precise data do not produce smooth reconstructions when applied to vision-based data sets. Our method constructs a 3D implicit surface, formulated as a sum of weighted radial basis functions. We achieve three primary advantages over existing algorithms: (1) the implicit functions we construct estimate the surface well in regions where there is little data, (2) the reconstructed surface is insensitive to noise in data acquisition because we can allow the surface to approximate, rather than exactly interpolate, the data, and (3) the reconstructed surface is locally detailed, yet globally smooth, because we use radial basis functions that achieve multiple orders of smoothness

reconstruct surfac by volumetr regular use radial basi function
 we present a new method of surfac reconstruct that gener smooth and seamless model from spars , noisi , nonuniform , and low resolut rang data . data acquisit techniqu from comput vision , such as stereo rang imag and space carv , produc 3d point set that are imprecis and nonuniform when compar to laser or optic rang scanner . tradit reconstruct algorithm design for dens and precis data do not produc smooth reconstruct when appli to vision-bas data set . our method construct a 3d implicit surfac , formul as a sum of weight radial basi function . we achiev three primari advantag over exist algorithm : ( 1 ) the implicit function we construct estim the surfac well in region where there is littl data , ( 2 ) the reconstruct surfac is insensit to nois in data acquisit becaus we can allow the surfac to approxim , rather than exactli interpol , the data , and ( 3 ) the reconstruct surfac is local detail , yet global smooth , becaus we use radial basi function that achiev multipl order of smooth

volumetric regularization
radial basis functions
surfaces reconstruction
low resolution range data
data acquisition techniques
computer vision
stereo range images
space carving
3D point sets
vision-based data sets
3D implicit surface
weighted radial basis functions
sparse range data
noisy data
nonuniform data


PDF subscriptions bolster revenue

Abstract: In 1999 SD Times offered prospective subscribers the option of receiving their issues as Adobe Acrobat PDF files. What set the proposal apart from what other publishers were doing electronically on the Web was that readers would get the entire version of the paper-including both advertising and editorial just as it looked when it was laid out and went to press. SD Times is only one of a small, but growing, number of publications that are taking on the electronic world and finding success. In the past six months alone, the New York Times, Popular Mechanics, trade magazine Electronic Buyers' News, and the Harvard Business Review have launched digital versions of their newspapers and magazines to augment their online and print versions. The reasons are as varied as the publishers themselves. Some companies are finding that readers don't like their Web-based versions either due to poor navigation or missing graphics and images. Others want to expand their publications nationally and internationally, but don't want the added cost of postage and printing. Still others are looking for ways to give advertisers additional visibility and boost advertising and subscription revenues. No matter what the reason, it's a trend worth watching

pdf subscript bolster revenu
 in 1999 sd time offer prospect subscrib the option of receiv their issu as adob acrobat pdf file . what set the propos apart from what other publish were do electron on the web wa that reader would get the entir version of the paper-includ both advertis and editori just as it look when it wa laid out and went to press . sd time is onli one of a small , but grow , number of public that are take on the electron world and find success . in the past six month alon , the new york time , popular mechan , trade magazin electron buyer ' news , and the harvard busi review have launch digit version of their newspap and magazin to augment their onlin and print version . the reason are as vari as the publish themselv . some compani are find that reader do n't like their web-bas version either due to poor navig or miss graphic and imag . other want to expand their public nation and intern , but do n't want the ad cost of postag and print . still other are look for way to give advertis addit visibl and boost advertis and subscript revenu . no matter what the reason , it 's a trend worth watch

PDF subscriptions
SD Times
Adobe Acrobat PDF files
magazines
digital versions
newspaper
electronic issue


Recruitment and retention of women graduate students in computer science and engineering: results of a workshop organized by the Computing Research Association

Abstract: This document is the report of a workshop that convened a group of experts to discuss the recruitment and retention of women in computer science and engineering (CSE) graduate programs. Participants included long-time members of the CSE academic and research communities, social scientists engaged in relevant research, and directors of successful retention efforts. The report is a compendium of the experience and expertise of workshop participants, rather than the result of a full-scale, scholarly study into the range of issues. Its goal is to provide departments with practical advice on recruitment and retention in the form of a set of specific recommendations

recruit and retent of women graduat student in comput scienc and engin : result of a workshop organ by the comput research associ
 thi document is the report of a workshop that conven a group of expert to discuss the recruit and retent of women in comput scienc and engin ( cse ) graduat program . particip includ long-tim member of the cse academ and research commun , social scientist engag in relev research , and director of success retent effort . the report is a compendium of the experi and expertis of workshop particip , rather than the result of a full-scal , scholarli studi into the rang of issu . it goal is to provid depart with practic advic on recruit and retent in the form of a set of specif recommend

recruitment
retention
women graduate students
computer science
engineering
Computing Research Association
research communities
social scientists
directors
workshop participants
academic communities


Programmatic efforts encouraging women to enter the information technology workforce

Abstract: For over a decade the National Science Foundation (NSF) has been supporting projects designed to improve opportunities for women in computing. From an initial emphasis on increasing the number of women in graduate school studying computer science and engineering, NSF's current emphasis has broadened to include research studies examining the underlying reasons why women are underrepresented in the information technology (IT) workforce. This paper describes the recent history of NSF's activities in this area and the subsequent emergence of a research portfolio addressing the underrepresentation issue

programmat effort encourag women to enter the inform technolog workforc
 for over a decad the nation scienc foundat ( nsf ) ha been support project design to improv opportun for women in comput . from an initi emphasi on increas the number of women in graduat school studi comput scienc and engin , nsf 's current emphasi ha broaden to includ research studi examin the underli reason whi women are underrepres in the inform technolog ( it ) workforc . thi paper describ the recent histori of nsf 's activ in thi area and the subsequ emerg of a research portfolio address the underrepresent issu

women
National Science Foundation
computing
graduate school
engineering
history
IT workforce


A typed representation for HTML and XML documents in Haskell

Abstract: We define a family of embedded domain specific languages for generating HTML and XML documents. Each language is implemented as a combinator library in Haskell. The generated HTML/XML documents are guaranteed to be well-formed. In addition, each library can guarantee that the generated documents are valid XML documents to a certain extent (for HTML only a weaker guarantee is possible). On top of the libraries, Haskell serves as a meta language to define parameterized documents, to map structured documents to HTML/XML, to define conditional content, or to define entire Web sites. The combinator libraries support element-transforming style, a programming style that allows programs to have a visual appearance similar to HTML/XML documents, without modifying the syntax of Haskell

a type represent for html and xml document in haskel
 we defin a famili of embed domain specif languag for gener html and xml document . each languag is implement as a combin librari in haskel . the gener html / xml document are guarante to be well-form . in addit , each librari can guarante that the gener document are valid xml document to a certain extent ( for html onli a weaker guarante is possibl ) . on top of the librari , haskel serv as a meta languag to defin parameter document , to map structur document to html / xml , to defin condit content , or to defin entir web site . the combin librari support element-transform style , a program style that allow program to have a visual appear similar to html / xml document , without modifi the syntax of haskel

typed representation
XML documents
Haskell
embedded domain specific languages
combinator library
meta language
parameterized documents
conditional content
Web sites
element-transforming style
syntax
HTML documents
software libraries
functional programming


The contiguity in R/M

Abstract: An r.e. degree c is contiguous if deg/sub wtt/(A)=deg/sub wtt/(B) for any r.e. sets A,B in c. In this paper, we generalize the notation of contiguity to the structure R/M, the upper semilattice of the r.e. degree set R modulo the cappable r.e. degree set M. An element [c] in R/M is contiguous if [deg/sub wtt/(A)]=[deg/sub wtt/(B)] for any r.e. sets A, B such that deg/sub T/(A),deg/sub T/(B) in [c]. It is proved in this paper that every nonzero element in R/M is not contiguous, i.e., for every element [c] in R/M, if [c] not=[o] then there exist at least two r.e. sets A, B such that deg/sub T/(A), deg/sub T/(B) in [c] and [deg/sub wtt/(A)] not=[deg/sub wtt/(B)]

the contigu in r / m
 an r.e . degre c is contigu if deg / sub wtt/(a)=deg / sub wtt/(b ) for ani r.e . set a , b in c. in thi paper , we gener the notat of contigu to the structur r / m , the upper semilattic of the r.e . degre set r modulo the cappabl r.e . degre set m. an element [ c ] in r / m is contigu if [ deg / sub wtt/(a)]=[deg / sub wtt/(b ) ] for ani r.e . set a , b such that deg / sub t/(a),deg / sub t/(b ) in [ c ] . it is prove in thi paper that everi nonzero element in r / m is not contigu , i.e. , for everi element [ c ] in r / m , if [ c ] not=[o ] then there exist at least two r.e . set a , b such that deg / sub t/(a ) , deg / sub t/(b ) in [ c ] and [ deg / sub wtt/(a ) ] not=[deg / sub wtt/(b ) ]

contiguity
upper semilattice
nonzero element
Turing degree
recursively enumerable set
recursion theory


The effect of voxel size on the accuracy of dose-volume histograms of prostate /sup 125/I seed implants

Abstract: Cumulative dose-volume histograms (DVH) are crucial in evaluating the quality of radioactive seed prostate implants. When calculating DVHs, the choice of voxel size is a compromise between computational speed (larger voxels) and accuracy (smaller voxels). We quantified the effect of voxel size on the accuracy of DVHs using an in-house computer program. The program was validated by comparison with a hand-calculated DVH for a single 0.4-U iodine-125 model 6711 seed. We used the program to find the voxel size required to obtain accurate DVHs of five iodine-125 prostate implant patients at our institution. One-millimeter cubes were sufficient to obtain DVHs that are accurate within 5% up to 200% of the prescription dose. For the five patient plans, we obtained good agreement with the VariSeed (version 6.7, Varian, USA) treatment planning software's DVH algorithm by using voxels with a sup-inf dimension equal to the spacing between successive transverse seed implant planes (5 mm). The volume that receives at least 200% of the target dose, V/sub 200/, calculated by VariSeed was 30% to 43% larger than that calculated by our program with small voxels. The single-seed DVH calculated by VariSeed fell below the hand calculation by up to 50% at low doses (30 Gy), and above it by over 50% at high doses (>250 Gy)

the effect of voxel size on the accuraci of dose-volum histogram of prostat /sup 125 / i seed implant
 cumul dose-volum histogram ( dvh ) are crucial in evalu the qualiti of radioact seed prostat implant . when calcul dvh , the choic of voxel size is a compromis between comput speed ( larger voxel ) and accuraci ( smaller voxel ) . we quantifi the effect of voxel size on the accuraci of dvh use an in-hous comput program . the program wa valid by comparison with a hand-calcul dvh for a singl 0.4-u iodine-125 model 6711 seed . we use the program to find the voxel size requir to obtain accur dvh of five iodine-125 prostat implant patient at our institut . one-millimet cube were suffici to obtain dvh that are accur within 5 % up to 200 % of the prescript dose . for the five patient plan , we obtain good agreement with the varise ( version 6.7 , varian , usa ) treatment plan softwar 's dvh algorithm by use voxel with a sup-inf dimens equal to the space between success transvers seed implant plane ( 5 mm ) . the volum that receiv at least 200 % of the target dose , v / sub 200/ , calcul by varise wa 30 % to 43 % larger than that calcul by our program with small voxel . the single-se dvh calcul by varise fell below the hand calcul by up to 50 % at low dose ( 30 gy ) , and abov it by over 50 % at high dose ( > 250 gy )

VariSeed treatment planning software's dose-volume histogram algorithm


A large deviations analysis of the transient of a queue with many Markov fluid inputs: approximations and fast simulation

Abstract: This article analyzes the transient buffer content distribution of a queue fed by a large number of Markov fluid sources. We characterize the probability of overflow at time t, given the current buffer level and the number of sources in the on-state. After scaling buffer and bandwidth resources by the number of sources n, we can apply large deviations techniques. The transient overflow probability decays exponentially in n. In the case of exponential on/off sources, we derive an expression for the decay rate of the rare event probability under consideration. For general Markov fluid sources, we present a plausible conjecture. We also provide the "most likely path" from the initial state to overflow (at time t). Knowledge of the decay rate and the most likely path to overflow leads to (i) approximations of the transient overflow probability and (ii) efficient simulation methods of the rare event of buffer overflow. The simulation methods, based on importance sampling, give a huge speed-up compared to straightforward simulations. The approximations are of low computational complexity and are accurate, as verified by means of simulation experiments

a larg deviat analysi of the transient of a queue with mani markov fluid input : approxim and fast simul
 thi articl analyz the transient buffer content distribut of a queue fed by a larg number of markov fluid sourc . we character the probabl of overflow at time t , given the current buffer level and the number of sourc in the on-stat . after scale buffer and bandwidth resourc by the number of sourc n , we can appli larg deviat techniqu . the transient overflow probabl decay exponenti in n. in the case of exponenti on / off sourc , we deriv an express for the decay rate of the rare event probabl under consider . for gener markov fluid sourc , we present a plausibl conjectur . we also provid the " most like path " from the initi state to overflow ( at time t ) . knowledg of the decay rate and the most like path to overflow lead to ( i ) approxim of the transient overflow probabl and ( ii ) effici simul method of the rare event of buffer overflow . the simul method , base on import sampl , give a huge speed-up compar to straightforward simul . the approxim are of low comput complex and are accur , as verifi by mean of simul experi

large deviations analysis
Markov fluid inputs
approximations
transient buffer content distribution
bandwidth resources
transient overflow probability
simulation methods
importance sampling
computational complexity
buffer resources
ATM multiplexers
IP routers
queuing theory


Virtual reality treatment of flying phobia

Abstract: Flying phobia (FP) might become a very incapacitating and disturbing problem in a person's social, working, and private areas. Psychological interventions based on exposure therapy have proved to be effective, but given the particular nature of this disorder they bear important limitations. Exposure therapy for FP might be excessively costly in terms of time, money, and efforts. Virtual reality (VR) overcomes these difficulties as different significant environments might be created, where the patient can interact with what he or she fears while in a totally safe and protected environment, the therapist's consulting room. This paper intends, on one hand, to show the different scenarios designed by our team for the VR treatment of FP, and on the other, to present the first results supporting the effectiveness of this new tool for the treatment of FP in a multiple baseline study

virtual realiti treatment of fli phobia
 fli phobia ( fp ) might becom a veri incapacit and disturb problem in a person 's social , work , and privat area . psycholog intervent base on exposur therapi have prove to be effect , but given the particular natur of thi disord they bear import limit . exposur therapi for fp might be excess costli in term of time , money , and effort . virtual realiti ( vr ) overcom these difficulti as differ signific environ might be creat , where the patient can interact with what he or she fear while in a total safe and protect environ , the therapist 's consult room . thi paper intend , on one hand , to show the differ scenario design by our team for the vr treatment of fp , and on the other , to present the first result support the effect of thi new tool for the treatment of fp in a multipl baselin studi

flying phobia
psychology
psychological interventions
exposure therapy
medical virtual reality
patient treatment
anxiety disorders
virtual exposure


Bit-serial AB/sup 2/ multiplier using modified inner product

Abstract: This paper presents a new multiplication algorithm and, based on this algorithm, proposes a hardware architecture, called modified inner-product multiplier (MIPM), which computes AB/sup 2/ multiplication based on a linear feedback shift register (LFSR). The algorithm is based on the property of the irreducible all one polynomial (AOP) over the finite field GF(2/sup m/). The proposed architecture reduces the time and space complexity for computing AB/sup 2/. The proposed architecture has a potential application to implementing exponentiation architecture for a public-key cryptosystem

bit-seri ab / sup 2/ multipli use modifi inner product
 thi paper present a new multipl algorithm and , base on thi algorithm , propos a hardwar architectur , call modifi inner-product multipli ( mipm ) , which comput ab / sup 2/ multipl base on a linear feedback shift regist ( lfsr ) . the algorithm is base on the properti of the irreduc all one polynomi ( aop ) over the finit field gf(2 / sup m/ ) . the propos architectur reduc the time and space complex for comput ab / sup 2/. the propos architectur ha a potenti applic to implement exponenti architectur for a public-key cryptosystem

bit-serial AB/sup 2/ multiplier
modified inner product
multiplication algorithm
hardware architecture
modified inner-product multiplier
linear feedback shift register
irreducible all one polynomial
space complexity
public-key cryptosystem
time complexity


Adaptive optimizing compilers for the 21st century

Abstract: Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This paper describes a prototype system that uses biased random search to discover a program-specific compilation sequence that minimizes an explicit, external objective function. The result is a compiler framework that adapts its behavior to the application being compiled, to the pool of available transformations, to the objective function, and to the target machine. This paper describes experiments that attempt to characterize the space that the adaptive compiler must search. The preliminary results suggest that optimal solutions are rare and that local minima are frequent. If this holds true, biased random searches, such as a,genetic algorithm, should find good solutions more quickly than simpler strategies, such as hill climbing

adapt optim compil for the 21st centuri
 histor , compil have oper by appli a fix set of optim in a predetermin order . we call such an order list of optim a compil sequenc . thi paper describ a prototyp system that use bias random search to discov a program-specif compil sequenc that minim an explicit , extern object function . the result is a compil framework that adapt it behavior to the applic be compil , to the pool of avail transform , to the object function , and to the target machin . thi paper describ experi that attempt to character the space that the adapt compil must search . the preliminari result suggest that optim solut are rare and that local minima are frequent . if thi hold true , bias random search , such as a , genet algorithm , should find good solut more quickli than simpler strategi , such as hill climb

optimizations
optimizing compilers
compilers
compilation sequence
biased random search
adaptive compiler
configurable compilers


Succession in standardization: grafting XML onto SGML

Abstract: Succession in standardization is often a problem. The advantages of improvements must be weighed against those of compatibility. If compatibility considerations dominate, a grafting process takes place. According to our taxonomy of succession, there are three types of outcomes. A Type I succession, where grafting is successful, entails compatibility between successors, technical paradigm compliance and continuity in the standards trajectory. In this paper, we examine issues of succession and focus on the Extensible Markup Language (XML). It was to be grafted on the Standard Generalized Markup Language (SGML), a stable standard since 1988. However, XML was a profile, a subset and an extension of SGML (1988). Adaptation of SGML was needed (SGML 1999) to forge full (downward) compatibility with XML (1998). We describe the grafting efforts and analyze their outcomes. Our conclusion is that although SGML was a technical exemplar for XML developers, full compatibility was not achieved. The widespread use of HyperText Mark-up Language (HTML) exemplified the desirability of simplicity in XML, standardization. This and HTML's user market largely explain the discontinuity in SGML-XML succession

success in standard : graft xml onto sgml
 success in standard is often a problem . the advantag of improv must be weigh against those of compat . if compat consider domin , a graft process take place . accord to our taxonomi of success , there are three type of outcom . a type i success , where graft is success , entail compat between successor , technic paradigm complianc and continu in the standard trajectori . in thi paper , we examin issu of success and focu on the extens markup languag ( xml ) . it wa to be graft on the standard gener markup languag ( sgml ) , a stabl standard sinc 1988 . howev , xml wa a profil , a subset and an extens of sgml ( 1988 ) . adapt of sgml wa need ( sgml 1999 ) to forg full ( downward ) compat with xml ( 1998 ) . we describ the graft effort and analyz their outcom . our conclus is that although sgml wa a technic exemplar for xml develop , full compat wa not achiev . the widespread use of hypertext mark-up languag ( html ) exemplifi the desir of simplic in xml , standard . thi and html 's user market larg explain the discontinu in sgml-xml success

standardization
XML
SGML
grafting process
Type I succession
Extensible Markup Language
Standard Generalized Markup Language


Development of railway VR safety simulation system

Abstract: Abnormal conditions occur in railway transportation due to trouble or accidents and it affects a number of passengers. It is very important, therefore, to quickly recover and return to normal train operation. For this purpose we developed a system, "Computer VR Simulation System for the Safety of Railway Transportation." It is a new type simulation system to evaluate measures to be taken under abnormal conditions. Users of this simulation system cooperate with one another to correct the abnormal conditions that have occurred in virtual reality. This paper reports the newly developed simulation system

develop of railway vr safeti simul system
 abnorm condit occur in railway transport due to troubl or accid and it affect a number of passeng . it is veri import , therefor , to quickli recov and return to normal train oper . for thi purpos we develop a system , " comput vr simul system for the safeti of railway transport . " it is a new type simul system to evalu measur to be taken under abnorm condit . user of thi simul system cooper with one anoth to correct the abnorm condit that have occur in virtual realiti . thi paper report the newli develop simul system

railway transportation
accidents
normal train operation
Computer VR Simulation System
virtual reality simulation system
abnormal conditions correction


Oxygen-enhanced MRI of the brain

Abstract: Blood oxygenation level-dependent (BOLD) contrast MRI is a potential method for a physiological characterization of tissue beyond mere morphological representation. The purpose of this study was to develop evaluation techniques for such examinations using a hyperoxia challenge. Administration of pure oxygen was applied to test these techniques, as pure oxygen can be expected to induce relatively small signal intensity (SI) changes compared to CO/sub 2/-containing gases and thus requires very sensitive evaluation methods. Fourteen volunteers were investigated by alternating between breathing 100% O/sub 2/ and normal air, using two different paradigms of administration. Changes ranged from >30% in large veins to 1.71%+or-0.14% in basal ganglia and 0.82%+or-0.08% in white matter. To account for a slow physiological response function, a reference for correlation analysis was derived from the venous reaction. An objective method is presented that allows the adaptation of the significance threshold to the complexity of the paradigm used. Reference signal characteristics in representative brain tissue regions were established. As the presented evaluation scheme proved its applicability to small SI changes induced by pure oxygen, it can readily be used for similar experiments with other gases

oxygen-enhanc mri of the brain
 blood oxygen level-depend ( bold ) contrast mri is a potenti method for a physiolog character of tissu beyond mere morpholog represent . the purpos of thi studi wa to develop evalu techniqu for such examin use a hyperoxia challeng . administr of pure oxygen wa appli to test these techniqu , as pure oxygen can be expect to induc rel small signal intens ( si ) chang compar to co / sub 2/-contain gase and thu requir veri sensit evalu method . fourteen volunt were investig by altern between breath 100 % o / sub 2/ and normal air , use two differ paradigm of administr . chang rang from > 30 % in larg vein to 1.71%+or-0.14 % in basal ganglia and 0.82%+or-0.08 % in white matter . to account for a slow physiolog respons function , a refer for correl analysi wa deriv from the venou reaction . an object method is present that allow the adapt of the signific threshold to the complex of the paradigm use . refer signal characterist in repres brain tissu region were establish . as the present evalu scheme prove it applic to small si chang induc by pure oxygen , it can readili be use for similar experi with other gase

oxygen-enhanced MRI
brain
hyperoxia
physiological response function
correlation analysis
venous reaction
significance threshold
BOLD contrast MRI
oxygen breathing
normal air breathing
paradigm complexity
MRI contrast agent
functional imaging
Fourier transform Analysis


Construction of double sampling s-control charts for agile manufacturing

Abstract: Double sampling (DS) X-control charts are designed to allow quick detection of a small shift of process mean and provides a quick response in an agile manufacturing environment. However, the DS X-control charts assume that the process standard deviation remains unchanged throughout the entire course of the statistical process control. Therefore, a complementary DS chart that can be used to monitor the process variation caused by changes in process standard deviation should be developed. In this paper, the development of the DS s-charts for quickly detecting small shift in process standard deviation for agile manufacturing is presented. The construction of the DS s-charts is based on the same concepts in constructing the DS X-charts and is formulated as an optimization problem and solved with a genetic algorithm. The efficiency of the DS s-control chart is compared with that of the traditional s-control chart. The results show that the DS s-control charts can be a more economically preferable alternative in detecting small shifts than traditional s-control charts

construct of doubl sampl s-control chart for agil manufactur
 doubl sampl ( ds ) x-control chart are design to allow quick detect of a small shift of process mean and provid a quick respons in an agil manufactur environ . howev , the ds x-control chart assum that the process standard deviat remain unchang throughout the entir cours of the statist process control . therefor , a complementari ds chart that can be use to monitor the process variat caus by chang in process standard deviat should be develop . in thi paper , the develop of the ds s-chart for quickli detect small shift in process standard deviat for agil manufactur is present . the construct of the ds s-chart is base on the same concept in construct the ds x-chart and is formul as an optim problem and solv with a genet algorithm . the effici of the ds s-control chart is compar with that of the tradit s-control chart . the result show that the ds s-control chart can be a more econom prefer altern in detect small shift than tradit s-control chart

double sampling s-control charts
agile manufacturing
process standard deviation
statistical process control
genetic algorithm
double sampling X-control charts
process mean shift detection


Anti-spam suit attempts to hold carriers accountable

Abstract: A lawsuit alleges that Sprint has violated Utah's new anti-spam act. The action could open the door to new regulations on telecom service providers

anti-spam suit attempt to hold carrier account
 a lawsuit alleg that sprint ha violat utah 's new anti-spam act . the action could open the door to new regul on telecom servic provid

lawsuit
Sprint
anti-spam act
regulations
telecom service providers


IT: Utilities

Abstract: A look at five utilities to make your PCs more, efficient, effective, and efficacious

it : util
 a look at five util to make your pc more , effici , effect , and efficaci

utilities
PCs
MobileMessenger
Post-it software
EasyNotes
Print Shop Pro
Download Accelerator Plus


A study on an automatic seam tracking system by using an electromagnetic sensor for sheet metal arc welding of butt joints

Abstract: Many sensors, such as the vision sensor and the laser displacement sensor, have been developed to automate the arc welding process. However, these sensors have some problems due to the effects of arc light, fumes and spatter. An electromagnetic sensor, which utilizes the generation of an eddy current, was developed for detecting the weld line of a butt joint in which the root gap size was zero. An automatic seam tracking system designed for sheet metal arc welding was constructed with a sensor. Through experiments, it was revealed that the system had an excellent seam tracking accuracy of the order of +or-0.2 mm

a studi on an automat seam track system by use an electromagnet sensor for sheet metal arc weld of butt joint
 mani sensor , such as the vision sensor and the laser displac sensor , have been develop to autom the arc weld process . howev , these sensor have some problem due to the effect of arc light , fume and spatter . an electromagnet sensor , which util the gener of an eddi current , wa develop for detect the weld line of a butt joint in which the root gap size wa zero . an automat seam track system design for sheet metal arc weld wa construct with a sensor . through experi , it wa reveal that the system had an excel seam track accuraci of the order of + or-0.2 mm

automatic seam tracking system
electromagnetic sensor
sheet metal arc welding
butt joints
root gap size
seam tracking accuracy
eddy current generation
weld line detection


The Tattletale technique

Abstract: Practical experience has taught many Java developers one thing: critical resources (mutexes, database connections, transactions, file handles, etc.) require timely and systematic release. Unfortunately, Java's garbage collector is not up to that job. According to the Java Language Specification, there are no guarantees when a garbage collector will run, when it will collect an object, or when it will finalize an object - if ever. Even more unfortunately, Java's counterpart to the C++ destructor (the finally block) is both tedious and error-prone, requiring developers to constantly remember and duplicate resource-releasing code. Consequently, even good Java developers can forget to release critical resources. There is a light at the end of the tunnel. Java may make it easier to leak critical resources, but it also provides the necessary mechanisms to easily track them down. The Tattletale technique is a simple method for designing new classes and retrofitting existing classes to quickly and easily detect the offending code responsible for leaking resources

the tattletal techniqu
 practic experi ha taught mani java develop one thing : critic resourc ( mutex , databas connect , transact , file handl , etc . ) requir time and systemat releas . unfortun , java 's garbag collector is not up to that job . accord to the java languag specif , there are no guarante when a garbag collector will run , when it will collect an object , or when it will final an object - if ever . even more unfortun , java 's counterpart to the c++ destructor ( the final block ) is both tediou and error-pron , requir develop to constantli rememb and duplic resource-releas code . consequ , even good java develop can forget to releas critic resourc . there is a light at the end of the tunnel . java may make it easier to leak critic resourc , but it also provid the necessari mechan to easili track them down . the tattletal techniqu is a simpl method for design new class and retrofit exist class to quickli and easili detect the offend code respons for leak resourc

Tattletale technique
Java
critical resources
mutexes
database connections
transactions
file handles
garbage collector
resource-releasing code
resources leaking


Encouraging women in computer science

Abstract: At a cost to both their own opportunities and society's ability to produce people with much-needed technical skills, women continue to be underrepresented in computer science degree programs at both the undergraduate and graduate level. Although some of the barriers that women face have their foundations in cultural expectations established well before the college level, we believe that departments can take effective steps to increase recruitment and retention of women students. This paper describes several strategies we have adopted at Stanford over the past decade

encourag women in comput scienc
 at a cost to both their own opportun and societi 's abil to produc peopl with much-need technic skill , women continu to be underrepres in comput scienc degre program at both the undergradu and graduat level . although some of the barrier that women face have their foundat in cultur expect establish well befor the colleg level , we believ that depart can take effect step to increas recruit and retent of women student . thi paper describ sever strategi we have adopt at stanford over the past decad

technical skills
computer science degree programs
graduate level
cultural expectations
undergraduate level
women student recruitment
women student retention


The canonical dual frame of a wavelet frame

Abstract: We show that there exist wavelet frames that have nice dual wavelet frames, but for which the canonical dual frame does not consist of wavelets, i.e., cannot be generated by the translates and dilates of a single function

the canon dual frame of a wavelet frame
 we show that there exist wavelet frame that have nice dual wavelet frame , but for which the canon dual frame doe not consist of wavelet , i.e. , can not be gener by the translat and dilat of a singl function

canonical dual frame
wavelet frame
Gabor frames
multiresolution hierarchy
compact support


A comparative study of some generalized rough approximations

Abstract: In this paper we focus upon a comparison of some generalized rough approximations of sets, where the classical indiscernibility relation is generalized to any binary reflexive relation. We aim at finding the best of several candidates for generalized rough approximation mappings, where both definability of sets by elementary granules of information as well as the issue of distinction among positive, negative, and border regions of a set are taken into account

a compar studi of some gener rough approxim
 in thi paper we focu upon a comparison of some gener rough approxim of set , where the classic indiscern relat is gener to ani binari reflex relat . we aim at find the best of sever candid for gener rough approxim map , where both defin of set by elementari granul of inform as well as the issu of distinct among posit , neg , and border region of a set are taken into account


Advanced optimization strategies in the Rice dHPF compiler

Abstract: High-Performance Fortran (HPF) was envisioned as a vehicle for modernizing legacy Fortran codes to achieve scalable parallel performance. To a large extent, today's commercially available HPF compilers have failed to deliver scalable parallel performance for a broad spectrum of applications because of insufficiently powerful compiler analysis and optimization. Substantial restructuring and hand-optimization can be required to achieve acceptable performance with an HPF port of an existing Fortran application, even for regular data-parallel applications. A key goal of the Rice dHPF compiler project has been to develop optimization techniques that enable a wide range of existing scientific applications to be ported easily to efficient HPF with minimal restructuring. This paper describes the challenges to effective parallelization presented by complex (but regular) data-parallel applications, and then describes how the novel analysis and optimization technologies in the dHPF compiler address these challenges effectively, without major rewriting of the applications. We illustrate the techniques by describing their use for parallelizing the NAS SP and BT benchmarks. The dHPF compiler generates multipartitioned parallelizations of these codes that are approaching the scalability and efficiency of sophisticated hand-coded parallelizations

advanc optim strategi in the rice dhpf compil
 high-perform fortran ( hpf ) wa envis as a vehicl for modern legaci fortran code to achiev scalabl parallel perform . to a larg extent , today 's commerci avail hpf compil have fail to deliv scalabl parallel perform for a broad spectrum of applic becaus of insuffici power compil analysi and optim . substanti restructur and hand-optim can be requir to achiev accept perform with an hpf port of an exist fortran applic , even for regular data-parallel applic . a key goal of the rice dhpf compil project ha been to develop optim techniqu that enabl a wide rang of exist scientif applic to be port easili to effici hpf with minim restructur . thi paper describ the challeng to effect parallel present by complex ( but regular ) data-parallel applic , and then describ how the novel analysi and optim technolog in the dhpf compil address these challeng effect , without major rewrit of the applic . we illustr the techniqu by describ their use for parallel the na sp and bt benchmark . the dhpf compil gener multipartit parallel of these code that are approach the scalabl and effici of sophist hand-cod parallel

Rice dHPF compiler
HPF compilers
legacy Fortran codes
parallel performance
compiler analysis
multipartitioning
Mgh-Performance Fortran
compiler optimization
automatic parallelization


Stochastic recurrences of Jackpot Keno

Abstract: We describe a mathematical model and simulation study for Jackpot Keno, as implemented by Jupiters Network Gaming (JNG) in the Australian state of Queensland, and as controlled by the Queensland Office of Gaming Regulation (QOGR) (http://www.qogr.qld.gov.au/keno.shtml). The recurrences for the house net hold are derived and it is seen that these are piecewise linear with a ternary domain split, and further, the split points are stochastic in nature. Since this structure is intractable (Brockett and Levine, Statistics & Probability & their Applications, CBS College Publishing, 1984), estimation of house net hold obtained through an appropriately designed simulator using a random number generator with desirable properties is described. Since the model and simulation naturally derives hold given payscale, but JNG and QOGR require payscale given hold, an inverse problem was required to be solved. This required development of a special algorithm, which may be described as a stochastic binary search. Experimental results are presented, in which the simulator is used to determine jackpot pay-scales so as to satisfy legal requirements of approximately 75% of net revenue returned to the players, i.e., 25% net hold for the house (JNG). Details of the algorithm used to solve this problem are presented, and notwithstanding the stochastic nature of the simulation, convergence to a specified hold for the inverse problem has been achieved to within 0.1% in all cases of interest to date

stochast recurr of jackpot keno
 we describ a mathemat model and simul studi for jackpot keno , as implement by jupit network game ( jng ) in the australian state of queensland , and as control by the queensland offic of game regul ( qogr ) ( http://www.qogr.qld.gov.au/keno.shtml ) . the recurr for the hous net hold are deriv and it is seen that these are piecewis linear with a ternari domain split , and further , the split point are stochast in natur . sinc thi structur is intract ( brockett and levin , statist & probabl & their applic , cb colleg publish , 1984 ) , estim of hous net hold obtain through an appropri design simul use a random number gener with desir properti is describ . sinc the model and simul natur deriv hold given payscal , but jng and qogr requir payscal given hold , an invers problem wa requir to be solv . thi requir develop of a special algorithm , which may be describ as a stochast binari search . experiment result are present , in which the simul is use to determin jackpot pay-scal so as to satisfi legal requir of approxim 75 % of net revenu return to the player , i.e. , 25 % net hold for the hous ( jng ) . detail of the algorithm use to solv thi problem are present , and notwithstand the stochast natur of the simul , converg to a specifi hold for the invers problem ha been achiev to within 0.1 % in all case of interest to date

stochastic recurrences
Jackpot Keno
mathematical model
simulation
Jupiters Network Gaming
house net hold
piecewise linear
ternary domain split
probability
random number generator
inverse problem
stochastic binary search
experimental results
legal requirement
Chinese lottery game


Multivariable H/sub infinity // mu feedback control design for high-precision wafer stage motion

Abstract: Conventional PID-like SISO controllers are still the most common in industry, but with performance requirements becoming tighter there is a growing need for advanced controllers. For the positioning devices in IC-manufacturing, plant interaction is a major performance-limiting factor. MIMO control can be invoked to tackle this problem. A practically feasible procedure is presented to design MIMO feedback controllers for electromechanical positioning devices, using H/sub infinity // mu techniques. Weighting filters are proposed to straightforwardly and effectively impose performance and uncertainty specifications. Experiments show that MIMO control can considerably improve upon the performance with multiloop SISO control. Some problems are highlighted that are important for industrial practice, but lacking a workable solution

multivari h / sub infin // mu feedback control design for high-precis wafer stage motion
 convent pid-lik siso control are still the most common in industri , but with perform requir becom tighter there is a grow need for advanc control . for the posit devic in ic-manufactur , plant interact is a major performance-limit factor . mimo control can be invok to tackl thi problem . a practic feasibl procedur is present to design mimo feedback control for electromechan posit devic , use h / sub infin // mu techniqu . weight filter are propos to straightforwardli and effect impos perform and uncertainti specif . experi show that mimo control can consider improv upon the perform with multiloop siso control . some problem are highlight that are import for industri practic , but lack a workabl solut

feedback
weighting filters
IC manufacture
multivariable control systems
MIMO systems
H/sub infinity / control
servo systems
model uncertainty
motion control
mechatronics
mu synthesis


Comparative statistical analysis of hole taper and circularity in laser percussion drilling

Abstract: Investigates the relationships and parameter interactions between six controllable variables on the hole taper and circularity in laser percussion drilling. Experiments have been conducted on stainless steel workpieces and a comparison was made between stainless steel and mild steel. The central composite design was employed to plan the experiments in order to achieve required information with reduced number of experiments. The process performance was evaluated. The ratio of minimum to maximum Feret's diameter was considered as circularity characteristic of the hole. The models of these three process characteristics were developed by linear multiple regression technique. The significant coefficients were obtained by performing analysis of variance (ANOVA) at 1, 5 and 7% levels of significance. The final models were checked by complete residual analysis and finally were experimentally verified. It was found that the pulse frequency had a significant effect on the hole entrance diameter and hole circularity in drilling stainless steel unlike the drilling of mild steel where the pulse frequency had no significant effect on the hole characteristics

compar statist analysi of hole taper and circular in laser percuss drill
 investig the relationship and paramet interact between six control variabl on the hole taper and circular in laser percuss drill . experi have been conduct on stainless steel workpiec and a comparison wa made between stainless steel and mild steel . the central composit design wa employ to plan the experi in order to achiev requir inform with reduc number of experi . the process perform wa evalu . the ratio of minimum to maximum feret 's diamet wa consid as circular characterist of the hole . the model of these three process characterist were develop by linear multipl regress techniqu . the signific coeffici were obtain by perform analysi of varianc ( anova ) at 1 , 5 and 7 % level of signific . the final model were check by complet residu analysi and final were experiment verifi . it wa found that the puls frequenc had a signific effect on the hole entranc diamet and hole circular in drill stainless steel unlik the drill of mild steel where the puls frequenc had no signific effect on the hole characterist

comparative statistical analysis
hole taper
circularity
laser percussion drilling
stainless steel workpieces
mild steel
central composite design
process performance
linear multiple regression technique
analysis of variance
ANOVA
complete residual analysis
pulse frequency
laser peak power
laser pulse width
assist gas pressure
focal plane position
equivalent entrance diameter
Ferets diameter
least squares procedure
stepwise regression method

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


Semidefinite programming vs. LP relaxations for polynomial programming

Abstract: We consider the global minimization of a multivariate polynomial on a semi-algebraic set Omega defined with polynomial inequalities. We then compare two hierarchies of relaxations, namely, LP relaxations based on products of the original constraints, in the spirit of the RLT procedure of Sherali and Adams (1990), and recent semidefinite programming (SDP) relaxations introduced by the author. The comparison is analyzed in light of recent results in real algebraic geometry on various representations of polynomials, positive on a compact semi-algebraic set

semidefinit program vs. lp relax for polynomi program
 we consid the global minim of a multivari polynomi on a semi-algebra set omega defin with polynomi inequ . we then compar two hierarchi of relax , name , lp relax base on product of the origin constraint , in the spirit of the rlt procedur of sherali and adam ( 1990 ) , and recent semidefinit program ( sdp ) relax introduc by the author . the comparison is analyz in light of recent result in real algebra geometri on variou represent of polynomi , posit on a compact semi-algebra set

LP relaxations
polynomial programming
global minimization
multivariate polynomial
semi-algebraic set
polynomial inequalities
RLT procedure
real algebraic geometry
semidefinite programming relaxations
reformulation linearization technique
constraint products


Hidden Markov model-based tool wear monitoring in turning

Abstract: This paper presents a new modeling framework for tool wear monitoring in machining processes using hidden Markov models (HMMs). Feature vectors are extracted from vibration signals measured during turning. A codebook is designed and used for vector quantization to convert the feature vectors into a symbol sequence for the hidden Markov model. A series of experiments are conducted to evaluate the effectiveness of the approach for different lengths of training data and observation sequence. Experimental results show that successful tool state detection rates as high as 97% can be achieved by using this approach

hidden markov model-bas tool wear monitor in turn
 thi paper present a new model framework for tool wear monitor in machin process use hidden markov model ( hmm ) . featur vector are extract from vibrat signal measur dure turn . a codebook is design and use for vector quantiz to convert the featur vector into a symbol sequenc for the hidden markov model . a seri of experi are conduct to evalu the effect of the approach for differ length of train data and observ sequenc . experiment result show that success tool state detect rate as high as 97 % can be achiev by use thi approach

hidden Markov models
tool wear monitoring
machining processes
vibration signals
codebook
vector quantization
tool state detection
feature extraction
turning process
HMM training
discrete wavelet transform


Application of time-frequency principal component analysis to text-independent speaker identification

Abstract: We propose a formalism, called vector filtering of spectral trajectories, that allows the integration of a number of speech parameterization approaches (cepstral analysis, Delta and Delta Delta parameterizations, auto-regressive vector modeling, ...) under a common formalism. We then propose a new filtering, called contextual principal components (CPC) or time-frequency principal components (TFPC). This filtering consists in extracting the principal components of the contextual covariance matrix, which is the covariance matrix of a sequence of vectors expanded by their context. We apply this new filtering in the framework of closed-set speaker identification, using a subset of the POLYCOST database. When using speaker-dependent TFPC filters, our results show a relative improvement of approximately 20% compared to the use of the classical cepstral coefficients augmented by their Delta -coefficients, which is significantly better with a 90% confidence level

applic of time-frequ princip compon analysi to text-independ speaker identif
 we propos a formal , call vector filter of spectral trajectori , that allow the integr of a number of speech parameter approach ( cepstral analysi , delta and delta delta parameter , auto-regress vector model , ... ) under a common formal . we then propos a new filter , call contextu princip compon ( cpc ) or time-frequ princip compon ( tfpc ) . thi filter consist in extract the princip compon of the contextu covari matrix , which is the covari matrix of a sequenc of vector expand by their context . we appli thi new filter in the framework of closed-set speaker identif , use a subset of the polycost databas . when use speaker-depend tfpc filter , our result show a rel improv of approxim 20 % compar to the use of the classic cepstral coeffici augment by their delta -coeffici , which is significantli better with a 90 % confid level


Experimental feedforward and feedback control of a one-dimensional SMA composite

Abstract: The control of embedded shape memory alloy (SMA) actuators has recently become a topic of interest in the field of smart structures. The inherent difficulties associated with SMA actuators has resulted in a variety of approaches. Homogenization provides a simplified, yet mathematically rigorous, method of determining average stress and strain fields in a composite. A modified constitutive model is presented based on experimental results demonstrating the inability of most simple phenomenological models to capture the effective behavior of SMAs during thermal activation. A feedforward controller is presented for a SMA composite based on the homogenization of a modified phenomenological model for SMAs in a linear matrix

experiment feedforward and feedback control of a one-dimension sma composit
 the control of embed shape memori alloy ( sma ) actuat ha recent becom a topic of interest in the field of smart structur . the inher difficulti associ with sma actuat ha result in a varieti of approach . homogen provid a simplifi , yet mathemat rigor , method of determin averag stress and strain field in a composit . a modifi constitut model is present base on experiment result demonstr the inabl of most simpl phenomenolog model to captur the effect behavior of sma dure thermal activ . a feedforward control is present for a sma composit base on the homogen of a modifi phenomenolog model for sma in a linear matrix

SMA
embedded shape memory alloy
smart structures
SMA actuators
homogenization
models
thermal activation
linear matrix


Complex dynamics in nearly symmetric three-cell cellular neural networks

Abstract: The paper introduces a class of third-order nonsymmetric Cellular Neural Networks (CNNs), and shows through computer simulations that they undergo a cascade of period doubling bifurcations which leads to the birth of a large-size complex attractor. A major point is that these bifurcations and complex dynamics happen in a small neighborhood of a particular CNN with a symmetric interconnection matrix

complex dynam in nearli symmetr three-cel cellular neural network
 the paper introduc a class of third-ord nonsymmetr cellular neural network ( cnn ) , and show through comput simul that they undergo a cascad of period doubl bifurc which lead to the birth of a large-s complex attractor . a major point is that these bifurc and complex dynam happen in a small neighborhood of a particular cnn with a symmetr interconnect matrix


L/sub p/ stability and linearization

Abstract: A theorem by Hadamard gives a two-part condition under which a map from one Banach space to another is a homeomorphism. The theorem, while often very useful, is incomplete in the sense that it does not explicitly specify the family of maps for which the condition is met. Recently, under a typically weak additional assumption on the map, it was shown that Hadamard's condition is met if and only if the map is a homeomorphism with a Lipschitz continuous inverse. Here, an application is given concerning the relation between the L/sub p/ stability (with 1 <or= p < infinity ) of a nonlinear system and the stability of related linear systems. We also give a result that directs attention to a fundamental limitation concerning what can be proved about linearization and stability for a related familiar family of feedback systems

l / sub p/ stabil and linear
 a theorem by hadamard give a two-part condit under which a map from one banach space to anoth is a homeomorph . the theorem , while often veri use , is incomplet in the sens that it doe not explicitli specifi the famili of map for which the condit is met . recent , under a typic weak addit assumpt on the map , it wa shown that hadamard 's condit is met if and onli if the map is a homeomorph with a lipschitz continu invers . here , an applic is given concern the relat between the l / sub p/ stabil ( with 1 < or= p < infin ) of a nonlinear system and the stabil of relat linear system . we also give a result that direct attent to a fundament limit concern what can be prove about linear and stabil for a relat familiar famili of feedback system

L/sub p/ stability
Banach space
Hadamard's condition
Lipschitz continuous inverse
nonlinear system
linear systems
feedback systems


Direct self control with minimum torque ripple and high dynamics for a double three-level GTO inverter drive

Abstract: A highly dynamic control scheme with very low torque ripple-direct self control (DSC) with torque hysteresis control-for very high-power medium-voltage induction motor drives fed by a double three-level inverter (D3LI) is presented. In this arrangement, two three-level inverters that are connected in parallel at their DC sides are feeding the open motor windings. The DSC, well known from two- and three-level inverters, is adapted to the D3LI and optimized for a minimum torque ripple. An 18-corner trajectory is chosen for the stator flux of the induction machine since it is approaching the ideal circle much better than the hexagon known from DSC for two-level inverters, without any detriment to the torque ripple. The machine and inverter control are explained and the proposed torque quality and dynamics are verified by measurements on a 180-kW laboratory drive

direct self control with minimum torqu rippl and high dynam for a doubl three-level gto invert drive
 a highli dynam control scheme with veri low torqu ripple-direct self control ( dsc ) with torqu hysteresi control-for veri high-pow medium-voltag induct motor drive fed by a doubl three-level invert ( d3li ) is present . in thi arrang , two three-level invert that are connect in parallel at their dc side are feed the open motor wind . the dsc , well known from two- and three-level invert , is adapt to the d3li and optim for a minimum torqu rippl . an 18-corner trajectori is chosen for the stator flux of the induct machin sinc it is approach the ideal circl much better than the hexagon known from dsc for two-level invert , without ani detriment to the torqu rippl . the machin and invert control are explain and the propos torqu qualiti and dynam are verifi by measur on a 180-kw laboratori drive

direct self control
highly dynamic control scheme
medium-voltage induction motor drives
double three-level inverter
open motor windings
stator flux
torque quality
very low torque ripple
torque hysteresis control
parallel connected inverters
variable-speed drives
multilevel converters
machine observer
180 kW


Real-time transmission of pediatric echocardiograms using a single ISDN line

Abstract: We tested the adequacy of a videoconferencing system using a single integrated systems digital network (ISDN) line (128 kilobits per second) for the remote diagnosis of children with suspected congenital heart disease (CHD). Real-time echocardiogram interpretation was compared to subsequent videotape review in 401 studies with concordance in 383 (95.5%) studies. A new diagnosis of CHD was made in 98 studies. Immediate patient transfer was arranged based upon a real-time diagnosis in five studies. In 300 studies, a normal diagnosis obviated further evaluation. A single ISDN line is adequate for transmission of pediatric echocardiograms and it allows for remote management of patients with CHD

real-tim transmiss of pediatr echocardiogram use a singl isdn line
 we test the adequaci of a videoconferenc system use a singl integr system digit network ( isdn ) line ( 128 kilobit per second ) for the remot diagnosi of children with suspect congenit heart diseas ( chd ) . real-tim echocardiogram interpret wa compar to subsequ videotap review in 401 studi with concord in 383 ( 95.5 % ) studi . a new diagnosi of chd wa made in 98 studi . immedi patient transfer wa arrang base upon a real-tim diagnosi in five studi . in 300 studi , a normal diagnosi obviat further evalu . a singl isdn line is adequ for transmiss of pediatr echocardiogram and it allow for remot manag of patient with chd

real-time pediatric echocardiogram transmission


A collocation formulation of multistep methods for variable step-size extensions

Abstract: Multistep methods are classically constructed by specially designed difference operators on an equidistant time grid. To make them practically useful, they have to be implemented by varying the step-size according to some error-control algorithm. It is well known how to extend Adams and BDF formulas to a variable step-size formulation. In this paper we present a collocation approach to construct variable step-size formulas. We make use of piecewise polynomials to show that every k-step method of order k+1 has a variable step-size polynomial collocation formulation

a colloc formul of multistep method for variabl step-siz extens
 multistep method are classic construct by special design differ oper on an equidist time grid . to make them practic use , they have to be implement by vari the step-siz accord to some error-control algorithm . it is well known how to extend adam and bdf formula to a variabl step-siz formul . in thi paper we present a colloc approach to construct variabl step-siz formula . we make use of piecewis polynomi to show that everi k-step method of order k+1 ha a variabl step-siz polynomi colloc formul


Five-axis NC milling of ruled surfaces: optimal geometry of a conical tool

Abstract: The side milling of ruled surfaces using a conical milling cutter was studied. This is a field that has largely been ignored by research scientists, but it is much used in industry, especially to machine turbine blades. We first suggest an improved positioning with respect to the directrices of the ruled surface. As compared with the methods already developed for the cylindrical cutter, this positioning enables the error between the cutter and the work-piece to be reduced. An algorithm is then introduced to calculate error so one can determine the cutter dimensions (cone radius and angle) in order to respect the tolerance interval imposed by the design office. This study provides an opportunity to determine cutters with greater dimensions, thus alleviating bending problems during milling

five-axi nc mill of rule surfac : optim geometri of a conic tool
 the side mill of rule surfac use a conic mill cutter wa studi . thi is a field that ha larg been ignor by research scientist , but it is much use in industri , especi to machin turbin blade . we first suggest an improv posit with respect to the directric of the rule surfac . as compar with the method alreadi develop for the cylindr cutter , thi posit enabl the error between the cutter and the work-piec to be reduc . an algorithm is then introduc to calcul error so one can determin the cutter dimens ( cone radiu and angl ) in order to respect the toler interv impos by the design offic . thi studi provid an opportun to determin cutter with greater dimens , thu allevi bend problem dure mill

five-axis NC milling
ruled surfaces
optimal geometry
conical
side milling
conical milling cutter
positioning
cutter dimensions
tolerance interval


Verizon leapfrogs Sprint PCS with Q2 subscriber numbers

Abstract: The wireless carrier industry's second-quarter results showed a surprising shift in market share as Sprint PCS fell from grace after a nearly four-year lead in subscriber additions and Verizon Wireless added considerably more customers than analysts expected

verizon leapfrog sprint pc with q2 subscrib number
 the wireless carrier industri 's second-quart result show a surpris shift in market share as sprint pc fell from grace after a nearli four-year lead in subscrib addit and verizon wireless ad consider more custom than analyst expect

Sprint PCS
wireless carrier industry
Verizon Wireless


Multiple criteria decision making without optimization

Abstract: We present a development intended to make interactive decision making schemes accessible for a wider spectrum of decision makers. To this aim we propose to eliminate the need to solve optimization problems at successive iterations of interactive decision processes. We show that the need for optimization can be eliminated by the ability of establishing sufficiently tight bounds on criteria values for efficient decisions prior to explicit identification of such decisions. We present a technique, fully operational and numerically simple, for establishing such bounds. Bounds are dynamic, i.e., they become stronger with the growing number of decisions explicitly identified. They are also parametric with respect to weighting coefficients. We also point out how this technique can enhance the existing interactive decision making methods

multipl criteria decis make without optim
 we present a develop intend to make interact decis make scheme access for a wider spectrum of decis maker . to thi aim we propos to elimin the need to solv optim problem at success iter of interact decis process . we show that the need for optim can be elimin by the abil of establish suffici tight bound on criteria valu for effici decis prior to explicit identif of such decis . we present a techniqu , fulli oper and numer simpl , for establish such bound . bound are dynam , i.e. , they becom stronger with the grow number of decis explicitli identifi . they are also parametr with respect to weight coeffici . we also point out how thi techniqu can enhanc the exist interact decis make method

multiple criteria decision making
interactive decision making schemes
decision makers
efficient decisions
criteria values bounds


Evolving receptive-field controllers for mobile robots

Abstract: The use of evolutionary methods to generate controllers for real-world autonomous agents has attracted attention. Most of the pertinent research has employed genetic algorithms or variations thereof. Research has applied an alternative evolutionary method, evolution strategies, to the generation of simple Braitenberg vehicles. This application accelerates the development of such controllers by more than an order of magnitude (a few hours compared to more than two days). Motivated by this useful speedup, the paper investigates the evolution of more complex architectures, receptive-field controllers, that can employ nonlinear interactions and, therefore, can yield more complex behavior. It is interesting to note that the evolution strategy yields the same efficacy in terms of function evaluations, even though the second class of controllers requires up to 10 times more parameters than the simple Braitenberg architecture. In addition to the speedup, there is an important theoretical reason for preferring an evolution strategy over a genetic algorithm for this problem, namely the presence of epistasis

evolv receptive-field control for mobil robot
 the use of evolutionari method to gener control for real-world autonom agent ha attract attent . most of the pertin research ha employ genet algorithm or variat thereof . research ha appli an altern evolutionari method , evolut strategi , to the gener of simpl braitenberg vehicl . thi applic acceler the develop of such control by more than an order of magnitud ( a few hour compar to more than two day ) . motiv by thi use speedup , the paper investig the evolut of more complex architectur , receptive-field control , that can employ nonlinear interact and , therefor , can yield more complex behavior . it is interest to note that the evolut strategi yield the same efficaci in term of function evalu , even though the second class of control requir up to 10 time more paramet than the simpl braitenberg architectur . in addit to the speedup , there is an import theoret reason for prefer an evolut strategi over a genet algorithm for thi problem , name the presenc of epistasi

receptive-field controllers
mobile robots
evolutionary methods
real-world autonomous agents
evolution strategies
simple Braitenberg vehicles
nonlinear interactions
complex behavior
radial basis functions
scalability


Acceptance of a price discount: the role of the semantic relatedness between purchases and the comparative price format

Abstract: Two studies are reported where people are asked to accept or not a price reduction on a target product. In the high (low) relative saving version, the regular price of the target product is low (high). In both versions, the absolute value of the price reduction is the same as well as the total of regular prices of planned purchases. As first reported by Tversky and Kahneman (1981), findings show that the majority of people accept the price discount in the high-relative saving version whereas the minority do it in the low one. In Study 1, findings show that the previous preference reversal disappears when planned purchases are strongly related. Also, a previously unreported preference reversal is found. The majority of people accept the price discount when the products are weakly related whereas the minority accept when the products are strongly related. In Study 2, findings show that the classic preference reversal disappears as a function of the comparative price format. Also, another previously unreported preference reversal is found. When the offered price reduction relates to a low-priced product, people are more inclined to accept it with a control than a minimal comparative price format. Findings reported in Studies 1 and 2 are interpreted in terms of mental accounting shifts

accept of a price discount : the role of the semant related between purchas and the compar price format
 two studi are report where peopl are ask to accept or not a price reduct on a target product . in the high ( low ) rel save version , the regular price of the target product is low ( high ) . in both version , the absolut valu of the price reduct is the same as well as the total of regular price of plan purchas . as first report by tverski and kahneman ( 1981 ) , find show that the major of peopl accept the price discount in the high-rel save version wherea the minor do it in the low one . in studi 1 , find show that the previou prefer revers disappear when plan purchas are strongli relat . also , a previous unreport prefer revers is found . the major of peopl accept the price discount when the product are weakli relat wherea the minor accept when the product are strongli relat . in studi 2 , find show that the classic prefer revers disappear as a function of the compar price format . also , anoth previous unreport prefer revers is found . when the offer price reduct relat to a low-pric product , peopl are more inclin to accept it with a control than a minim compar price format . find report in studi 1 and 2 are interpret in term of mental account shift

comparative price format
planned purchases
preference reversal
low-priced product
mental accounting shifts
price discount acceptance
semantic relatedness hypothesis
high relative saving version
low relative saving version


Scheduling schemes for an integrated flight and propulsion control system

Abstract: We describe two schemes for scheduling an integrated flight and propulsion control system for an experimental vertical/short take-off and landing (V/STOL) aircraft concept in the acceleration from hover (0-120 kn) flight phase. Multivariable integrated flight and propulsion controllers are designed at several points over the V/STOL envelope and implemented as exact plant observers with state feedback. In the first scheduling scheme, the values of the state feedback and observer gain matrices are interpolated between the fixed-point designs as a function of aircraft speed. In the second approach, the control signals produced by the different fixed-point controllers are blended, allowing a significant reduction in the order of the scheduled controllers. Both scheduling schemes are shown in nonlinear simulation to provide excellent handling qualities as the aircraft accelerates from the hover

schedul scheme for an integr flight and propuls control system
 we describ two scheme for schedul an integr flight and propuls control system for an experiment vertic / short take-off and land ( v / stol ) aircraft concept in the acceler from hover ( 0 - 120 kn ) flight phase . multivari integr flight and propuls control are design at sever point over the v / stol envelop and implement as exact plant observ with state feedback . in the first schedul scheme , the valu of the state feedback and observ gain matric are interpol between the fixed-point design as a function of aircraft speed . in the second approach , the control signal produc by the differ fixed-point control are blend , allow a signific reduct in the order of the schedul control . both schedul scheme are shown in nonlinear simul to provid excel handl qualiti as the aircraft acceler from the hover

vertical short take-off landing aircraft


Neural networks in optimal filtration

Abstract: The combined use and mutual influence of neural networks and optimal filtering is considered; the neural-network and filtering approaches are compared by solving two simple optimal-filtering problems: linear filtering and the filtering of a binary telegraph signal corresponding to observations in discrete white noise

neural network in optim filtrat
 the combin use and mutual influenc of neural network and optim filter is consid ; the neural-network and filter approach are compar by solv two simpl optimal-filt problem : linear filter and the filter of a binari telegraph signal correspond to observ in discret white nois

neural networks
optimal filtering
linear filtering
binary telegraph signal
observations
discrete white noise


Caring for your new lawyers

Abstract: In any given year, a striking number of lawyers are in a state of flux, from newly minted law school graduates looking for their first job, to senior litigators migrating to new challenges with new firms. The one certainty is that lawyers new to any firm need care and feeding in myriad ways. All of them need to know and understand three things: (1) the firm's culture; (2) the resources available to help them develop their practices; and (3) where to get help and guidance for research and practice purposes. Obtaining a thorough understanding of a new firm's workings may be the greatest research project lawyers face. How can a firm help its new lawyers learn what they need to know? To offer an example, here are programs in place at my firm

care for your new lawyer
 in ani given year , a strike number of lawyer are in a state of flux , from newli mint law school graduat look for their first job , to senior litig migrat to new challeng with new firm . the one certainti is that lawyer new to ani firm need care and feed in myriad way . all of them need to know and understand three thing : ( 1 ) the firm 's cultur ; ( 2 ) the resourc avail to help them develop their practic ; and ( 3 ) where to get help and guidanc for research and practic purpos . obtain a thorough understand of a new firm 's work may be the greatest research project lawyer face . how can a firm help it new lawyer learn what they need to know ? to offer an exampl , here are program in place at my firm


Multiresolution Markov models for signal and image processing

Abstract: Reviews a significant component of the rich field of statistical multiresolution (MR) modeling and processing. These MR methods have found application and permeated the literature of a widely scattered set of disciplines, and one of our principal objectives is to present a single, coherent picture of this framework. A second goal is to describe how this topic fits into the even larger field of MR methods and concepts-in particular, making ties to topics such as wavelets and multigrid methods. A third goal is to provide several alternate viewpoints for this body of work, as the methods and concepts we describe intersect with a number of other fields. The principle focus of our presentation is the class of MR Markov processes defined on pyramidally organized trees. The attractiveness of these models stems from both the very efficient algorithms they admit and their expressive power and broad applicability. We show how a variety of methods and models relate to this framework including models for self-similar and 1/f processes. We also illustrate how these methods have been used in practice

multiresolut markov model for signal and imag process
 review a signific compon of the rich field of statist multiresolut ( mr ) model and process . these mr method have found applic and permeat the literatur of a wide scatter set of disciplin , and one of our princip object is to present a singl , coher pictur of thi framework . a second goal is to describ how thi topic fit into the even larger field of mr method and concepts-in particular , make tie to topic such as wavelet and multigrid method . a third goal is to provid sever altern viewpoint for thi bodi of work , as the method and concept we describ intersect with a number of other field . the principl focu of our present is the class of mr markov process defin on pyramid organ tree . the attract of these model stem from both the veri effici algorithm they admit and their express power and broad applic . we show how a varieti of method and model relat to thi framework includ model for self-similar and 1 / f process . we also illustr how these method have been use in practic

multiresolution Markov models
wavelets
multigrid methods
pyramidally organized trees
1/f processes
statistical multiresolution modeling
self-similar processes


Operator splitting and approximate factorization for taxis-diffusion-reaction models

Abstract: In this paper we consider the numerical solution of 2D systems of certain types of taxis-diffusion-reaction equations from mathematical biology. By spatial discretization these PDE systems are approximated by systems of positive, nonlinear ODEs (Method of Lines). The aim of this paper is to examine the numerical integration of these ODE systems for low to moderate accuracy by means of splitting techniques. An important consideration is maintenance of positivity. We apply operator splitting and approximate matrix factorization using low order explicit Runge-Kutta methods and linearly implicit Runge-Kutta-Rosenbrock methods. As a reference method the general purpose solver VODPK is applied

oper split and approxim factor for taxis-diffusion-react model
 in thi paper we consid the numer solut of 2d system of certain type of taxis-diffusion-react equat from mathemat biolog . by spatial discret these pde system are approxim by system of posit , nonlinear ode ( method of line ) . the aim of thi paper is to examin the numer integr of these ode system for low to moder accuraci by mean of split techniqu . an import consider is mainten of posit . we appli oper split and approxim matrix factor use low order explicit runge-kutta method and linearli implicit runge-kutta-rosenbrock method . as a refer method the gener purpos solver vodpk is appli


Information and information technology

Abstract: This paper reveals the concepts of information and information technology. It also describes the close relationship between information and information technology. It explains a basic mechanism of different devices of information technology and connotes how they are useful to store, process and retrieve the information. In addition of this, the paper shows the present status of information technology and Indian universities

inform and inform technolog
 thi paper reveal the concept of inform and inform technolog . it also describ the close relationship between inform and inform technolog . it explain a basic mechan of differ devic of inform technolog and connot how they are use to store , process and retriev the inform . in addit of thi , the paper show the present statu of inform technolog and indian univers

information
information technology
Indian universities
information storage
information processing
information retrieval


The heat is on [building automation systems]

Abstract: Integrating building automation systems (BASs) can result in systems that have the ability to sense changes in the air temperature through a building's heating, ventilation, and air conditioning (HVAC) systems. Taking advantages of the Internet, using remote monitoring, and building interoperability through open protocol systems are some of the issues discussed throughout the BAS/HVAC community. By putting information over the Internet, facility managers get real-time data on energy usage and performance issues

the heat is on [ build autom system ]
 integr build autom system ( bass ) can result in system that have the abil to sens chang in the air temperatur through a build 's heat , ventil , and air condit ( hvac ) system . take advantag of the internet , use remot monitor , and build interoper through open protocol system are some of the issu discuss throughout the ba / hvac commun . by put inform over the internet , facil manag get real-tim data on energi usag and perform issu

heating
building automation systems
ventilation
air conditioning
HVAC
Internet
remote monitoring
interoperability
real-time data