Simulation of physicochemical processes of erosion-corrosion of metals in two-phase flows

Abstract: A computational model for the erosion-corrosion of the metals used in power equipment in two-phase flows (RAMEK-2) was developed. The results of calculations of the dependency of the intensity of the erosion-corrosion of structural steels as a function of the thermodynamic, hydrodynamic and water chemistry parameters of these flows in the working paths of thermal power stations and nuclear power stations are presented in a three-dimensional space. On the basis of mathematical models, application software was created for forecasting the erosion-corrosion resource and for optimizing the rules on diagnosis and protective maintenance of erosion-corrosion of the elements of the wet-steam path in power stations

simul of physicochem process of erosion-corros of metal in two-phas flow
 a comput model for the erosion-corros of the metal use in power equip in two-phas flow ( ramek-2 ) wa develop . the result of calcul of the depend of the intens of the erosion-corros of structur steel as a function of the thermodynam , hydrodynam and water chemistri paramet of these flow in the work path of thermal power station and nuclear power station are present in a three-dimension space . on the basi of mathemat model , applic softwar wa creat for forecast the erosion-corros resourc and for optim the rule on diagnosi and protect mainten of erosion-corros of the element of the wet-steam path in power station

two-phase flows
RAMEK-2
structural steels
three-dimensional space
application software
protective maintenance
wet-steam path
erosion-corrosion computational model
computer simulation
thermodynamic parameters
hydrodynamic parameters
water-chemistry parameters
thermal power plants
nuclear power plants
fault diagnosis


Physical quantum algorithms

Abstract: I review the differences between classical and quantum systems, emphasizing the connection between no-hidden variable theorems and superior computational power of quantum computers. Using quantum lattice gas automata as examples, I describe possibilities for efficient simulation of quantum and classical systems with a quantum computer. I conclude with a list of research directions

physic quantum algorithm
 i review the differ between classic and quantum system , emphas the connect between no-hidden variabl theorem and superior comput power of quantum comput . use quantum lattic ga automata as exampl , i describ possibl for effici simul of quantum and classic system with a quantum comput . i conclud with a list of research direct

physical quantum algorithms
no-hidden variable theorems
quantum computers
quantum lattice gas automata
classical systems


The crossing number of P(N, 3)

Abstract: It is proved that the crossing number of the generalized Petersen graph P(3k + h, 3) is k + h if h in {0, 2} and k + 3 if h = 1, for each k >or= 3, with the single exception of P(9,3), whose crossing number is 2

the cross number of p(n , 3 )
 it is prove that the cross number of the gener petersen graph p(3k + h , 3 ) is k + h if h in { 0 , 2 } and k + 3 if h = 1 , for each k > or= 3 , with the singl except of p(9,3 ) , whose cross number is 2

crossing number
generalized Petersen graph


Enhanced product support through intelligent product manuals

Abstract: The scope of this paper is the provision of intelligent product support within the distributed Intranet/Internet environment. From the point of view of user requirements, the limitations of conventional product manuals and methods of authoring them are first outlined. It is argued that enhanced product support requires new technology solutions both for product manuals and for their authoring and presentation. The concept and the architecture of intelligent product manuals are then discussed. A prototype system called ProARTWeb is presented to demonstrate advanced features of intelligent product manuals. Next, the problem of producing such manuals in a cost-effective way is addressed and a concurrent engineering approach to their authoring is proposed. An integrated environment for collaborative authoring called ProAuthor is described to illustrate the approach suggested and to show how consistent, up-to-date and user-oriented-product manuals can be designed. The solutions presented here enable product knowledge to be captured and delivered to users and developers of product manuals when, where and in the form they need it

enhanc product support through intellig product manual
 the scope of thi paper is the provis of intellig product support within the distribut intranet / internet environ . from the point of view of user requir , the limit of convent product manual and method of author them are first outlin . it is argu that enhanc product support requir new technolog solut both for product manual and for their author and present . the concept and the architectur of intellig product manual are then discuss . a prototyp system call proartweb is present to demonstr advanc featur of intellig product manual . next , the problem of produc such manual in a cost-effect way is address and a concurr engin approach to their author is propos . an integr environ for collabor author call proauthor is describ to illustr the approach suggest and to show how consist , up-to-d and user-oriented-product manual can be design . the solut present here enabl product knowledg to be captur and deliv to user and develop of product manual when , where and in the form they need it

intelligent product manuals
product manuals
intelligent product support
ProARTWeb
concurrent engineering
product knowledge
technical information


Satellite image collection optimization

Abstract: Imaging satellite systems represent a high capital cost. Optimizing the collection of images is critical for both satisfying customer orders and building a sustainable satellite operations business. We describe the functions of an operational, multivariable, time dynamic optimization system that maximizes the daily collection of satellite images. A graphical user interface allows the operator to quickly see the results of what if adjustments to an image collection plan. Used for both long range planning and daily collection scheduling of Space Imaging's IKONOS satellite, the satellite control and tasking (SCT) software allows collection commands to be altered up to 10 min before upload to the satellite

satellit imag collect optim
 imag satellit system repres a high capit cost . optim the collect of imag is critic for both satisfi custom order and build a sustain satellit oper busi . we describ the function of an oper , multivari , time dynam optim system that maxim the daili collect of satellit imag . a graphic user interfac allow the oper to quickli see the result of what if adjust to an imag collect plan . use for both long rang plan and daili collect schedul of space imag 's ikono satellit , the satellit control and task ( sct ) softwar allow collect command to be alter up to 10 min befor upload to the satellit

multivariable time dynamic optimization system


Quantum learning and universal quantum matching machine

Abstract: Suppose that three kinds of quantum systems are given in some unknown states |f>/sup (X)N/, |g/sub 1/>/sup (X)K/, and |g/sub 2/>/sup (X)K/, and we want to decide which template state |g/sub 1/> or |g/sub 2/>, each representing the feature of the pattern class C/sub 1/ or C/sub 2/, respectively, is closest to the input feature state |f>. This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems, we derive two kinds of matching strategies. The first one is a semiclassical strategy that is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure: identification (estimation) of the unknown template states to design the classifier (learning process to train the classifier) and classification of the input system into the appropriate pattern class based on the estimated results. The other is a fully quantum strategy without any intermediate measurement, which we might call as the universal quantum matching machine. We present the Bayes optimal solutions for both strategies in the case of K=1, showing that there certainly exists a fully quantum matching procedure that is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process

quantum learn and univers quantum match machin
 suppos that three kind of quantum system are given in some unknown state |f>/sup ( x)n/ , |g / sub 1/>/sup ( x)k/ , and |g / sub 2/>/sup ( x)k/ , and we want to decid which templat state |g / sub 1/ > or |g / sub 2/ > , each repres the featur of the pattern class c / sub 1/ or c / sub 2/ , respect , is closest to the input featur state |f > . thi is an extens of the pattern match problem into the quantum domain . assum that these state are known a priori to belong to a certain parametr famili of pure qubit system , we deriv two kind of match strategi . the first one is a semiclass strategi that is obtain by the natur extens of convent match strategi and consist of a two-stag procedur : identif ( estim ) of the unknown templat state to design the classifi ( learn process to train the classifi ) and classif of the input system into the appropri pattern class base on the estim result . the other is a fulli quantum strategi without ani intermedi measur , which we might call as the univers quantum match machin . we present the bay optim solut for both strategi in the case of k=1 , show that there certainli exist a fulli quantum match procedur that is strictli superior to the straightforward semiclass extens of the convent match strategi base on the learn process

quantum learning
universal quantum matching machine
pattern class
pattern matching problem
quantum domain
qubit systems
matching strategies
matching strategies
semiclassical strategy
two-stage procedure
learning process
quantum strategy
Bayes optimal solutions
quantum matching procedure
semiclassical extension
matching strategy


Technology CAD of SiGe-heterojunction field effect transistors

Abstract: A 2D virtual wafer fabrication simulation suite has been employed for the technology CAD of SiGe channel heterojunction field effect transistors (HFETs). Complete fabrication process of SiGe p-HFETs has been simulated. The SiGe material parameters and mobility model were incorporated to simulate Si/SiGe p-HFETs with a uniform germanium channel having an L/sub eff/ of 0.5 mu m. A significant improvement in linear transconductance is observed when compared to control-silicon p-MOSFETs

technolog cad of sige-heterojunct field effect transistor
 a 2d virtual wafer fabric simul suit ha been employ for the technolog cad of sige channel heterojunct field effect transistor ( hfet ) . complet fabric process of sige p-hfet ha been simul . the sige materi paramet and mobil model were incorpor to simul si / sige p-hfet with a uniform germanium channel have an l / sub eff/ of 0.5 mu m. a signific improv in linear transconduct is observ when compar to control-silicon p-mosfet

technology CAD
SiGe
heterojunction field effect transistors
fabrication process
material parameters
mobility model
linear transconductance
uniform channel
0.5 micron


Development of visual design steering as an aid in large-scale multidisciplinary design optimization. I. Method development

Abstract: A modified paradigm of computational steering (CS), termed visual design steering (VDS), is developed in this paper. The VDS paradigm is applied to optimal design problems to provide a means for capturing and enabling designer insights. VDS allows a designer to make decisions before, during or after an analysis or optimization via a visual environment, in order to effectively steer the solution process. The objective of VDS is to obtain a better solution in less time through the use of designer knowledge and expertise. Using visual representations of complex systems in this manner enables human experience and judgement to be incorporated into the optimal design process at appropriate steps, rather than having traditional black box solvers return solutions from a prescribed input set. Part I of this paper focuses on the research issues pertaining to the Graph Morphing visualization method created to represent an n-dimensional optimization problem using 2-dimensional and 3-dimensional visualizations. Part II investigates the implementation of the VDS paradigm, using the graph morphing approach, to improve an optimal design process. Specifically, the following issues are addressed: impact of design variable changes on the optimal design space; identification of possible constraint redundancies; impact of constraint tolerances on the optimal solution: and smoothness of the objective function contours. It is demonstrated that graph morphing can effectively reduce the complexity and computational time associated with some optimization problems

develop of visual design steer as an aid in large-scal multidisciplinari design optim . i. method develop
 a modifi paradigm of comput steer ( cs ) , term visual design steer ( vd ) , is develop in thi paper . the vd paradigm is appli to optim design problem to provid a mean for captur and enabl design insight . vd allow a design to make decis befor , dure or after an analysi or optim via a visual environ , in order to effect steer the solut process . the object of vd is to obtain a better solut in less time through the use of design knowledg and expertis . use visual represent of complex system in thi manner enabl human experi and judgement to be incorpor into the optim design process at appropri step , rather than have tradit black box solver return solut from a prescrib input set . part i of thi paper focus on the research issu pertain to the graph morph visual method creat to repres an n-dimension optim problem use 2-dimension and 3-dimension visual . part ii investig the implement of the vd paradigm , use the graph morph approach , to improv an optim design process . specif , the follow issu are address : impact of design variabl chang on the optim design space ; identif of possibl constraint redund ; impact of constraint toler on the optim solut : and smooth of the object function contour . it is demonstr that graph morph can effect reduc the complex and comput time associ with some optim problem


A meteorological fuzzy expert system incorporating subjective user input

Abstract: We present a fuzzy expert system, MEDEX, for forecasting gale-force winds in the Mediterranean basin. The most successful local wind forecasting in this region is achieved by an expert human forecaster with access to numerical weather prediction products. That forecaster's knowledge is expressed as a set of 'rules-of-thumb'. Fuzzy set methodologies have proved well suited for encoding the forecaster's knowledge, and for accommodating the uncertainty inherent in the specification of rules, as well as in subjective and objective input. MEDEX uses fuzzy set theory in two ways: as a fuzzy rule base in the expert system, and for fuzzy pattern matching to select dominant wind circulation patterns as one input to the expert system. The system was developed, tuned, and verified over a two-year period, during which the weather conditions from 539 days were individually analyzed. Evaluations of MEDEX performance for both the onset and cessation of winter and summer winds are presented, and demonstrate that MEDEX has forecasting skill competitive with the US Navy's regional forecasting center in Rota, Spain

a meteorolog fuzzi expert system incorpor subject user input
 we present a fuzzi expert system , medex , for forecast gale-forc wind in the mediterranean basin . the most success local wind forecast in thi region is achiev by an expert human forecast with access to numer weather predict product . that forecast 's knowledg is express as a set of ' rules-of-thumb ' . fuzzi set methodolog have prove well suit for encod the forecast 's knowledg , and for accommod the uncertainti inher in the specif of rule , as well as in subject and object input . medex use fuzzi set theori in two way : as a fuzzi rule base in the expert system , and for fuzzi pattern match to select domin wind circul pattern as one input to the expert system . the system wa develop , tune , and verifi over a two-year period , dure which the weather condit from 539 day were individu analyz . evalu of medex perform for both the onset and cessat of winter and summer wind are present , and demonstr that medex ha forecast skill competit with the us navi 's region forecast center in rota , spain

meteorological fuzzy expert system
subjective user input
MEDEX
Mediterranean basin
numerical weather prediction products
rules-of-thumb
uncertainty
fuzzy set theory
fuzzy rule base
fuzzy pattern matching
wind circulation patterns
gale-force wind forecasting
subjective variables
rule specification


An improved self-organizing CPN-based fuzzy system with adaptive back-propagation algorithm

Abstract: This paper describes an improved self-organizing CPN-based (Counter-Propagation Network) fuzzy system. Two self-organizing algorithms IUSOCPN and ISSOCPN, being unsupervised and supervised respectively, are introduced. The idea is to construct the neural-fuzzy system with a two-phase hybrid learning algorithm, which utilizes a CPN-based nearest-neighbor clustering scheme for both structure learning and initial parameters setting, and a gradient descent method with adaptive learning rate for fine tuning the parameters. The obtained network can be used in the same way as a CPN to model and control dynamic systems, while it has a faster learning speed than the original back-propagation algorithm. The comparative results on the examples suggest that the method is fairly efficient in terms of simple structure, fast learning speed, and relatively high modeling accuracy

an improv self-organ cpn-base fuzzi system with adapt back-propag algorithm
 thi paper describ an improv self-organ cpn-base ( counter-propag network ) fuzzi system . two self-organ algorithm iusocpn and issocpn , be unsupervis and supervis respect , are introduc . the idea is to construct the neural-fuzzi system with a two-phas hybrid learn algorithm , which util a cpn-base nearest-neighbor cluster scheme for both structur learn and initi paramet set , and a gradient descent method with adapt learn rate for fine tune the paramet . the obtain network can be use in the same way as a cpn to model and control dynam system , while it ha a faster learn speed than the origin back-propag algorithm . the compar result on the exampl suggest that the method is fairli effici in term of simpl structur , fast learn speed , and rel high model accuraci

Counter-Propagation Network
neural-fuzzy system
hybrid learning
structure learning
initial parameters setting
gradient descent
self-organizing fuzzy system
back-propagation learning scheme


Quantum sensitive dependence

Abstract: Wave functions of bounded quantum systems with time-independent potentials, being almost periodic functions, cannot have time asymptotics as in classical chaos. However, bounded quantum systems with time-dependent interactions, as used in quantum control, may have continuous spectrum and the rate of growth of observables is an issue of both theoretical and practical concern. Rates of growth in quantum mechanics are discussed by constructing quantities with the same physical meaning as those involved in the classical Lyapunov exponent. A generalized notion of quantum sensitive dependence is introduced and the mathematical structure of the operator matrix elements that correspond to different types of growth is characterized

quantum sensit depend
 wave function of bound quantum system with time-independ potenti , be almost period function , can not have time asymptot as in classic chao . howev , bound quantum system with time-depend interact , as use in quantum control , may have continu spectrum and the rate of growth of observ is an issu of both theoret and practic concern . rate of growth in quantum mechan are discuss by construct quantiti with the same physic mean as those involv in the classic lyapunov expon . a gener notion of quantum sensit depend is introduc and the mathemat structur of the oper matrix element that correspond to differ type of growth is character

quantum sensitive dependence
wave functions
bounded quantum systems
time-independent potentials
periodic functions
time asymptotics
classical chaos
time-dependent interactions
quantum control
classical Lyapunov exponent
operator matrix elements
quantum complexity


Quantum limit on computational time and speed

Abstract: We investigate if physical laws can impose limits on computational time and speed of a quantum computer built from elementary particles. We show that the product of the speed and the running time of a quantum computer is limited by the type of fundamental interactions present inside the system. This will help us to decide as to what type of interaction should be allowed in building quantum computers in achieving the desired speed

quantum limit on comput time and speed
 we investig if physic law can impos limit on comput time and speed of a quantum comput built from elementari particl . we show that the product of the speed and the run time of a quantum comput is limit by the type of fundament interact present insid the system . thi will help us to decid as to what type of interact should be allow in build quantum comput in achiev the desir speed

quantum limit
computational time
quantum computer
fundamental interactions
computational speed


Numerical behaviour of stable and unstable solitary waves

Abstract: In this paper we analyse the behaviour in time of the numerical approximations to solitary wave solutions of the generalized Benjamin-Bona-Mahony equation. This equation possesses an important property: the stability of these solutions depends on their velocity. We identify the error propagation mechanisms in both the stable and unstable case. In particular, we show that in the stable case, numerical methods that preserve some conserved quantities of the problem are more appropriate for the simulation of this kind of solutions

numer behaviour of stabl and unstabl solitari wave
 in thi paper we analys the behaviour in time of the numer approxim to solitari wave solut of the gener benjamin-bona-mahoni equat . thi equat possess an import properti : the stabil of these solut depend on their veloc . we identifi the error propag mechan in both the stabl and unstabl case . in particular , we show that in the stabl case , numer method that preserv some conserv quantiti of the problem are more appropri for the simul of thi kind of solut


Weighted energy linear quadratic regulator vibration control of piezoelectric composite plates

Abstract: In this paper on finite element linear quadratic regulator (LQR) vibration control of smart piezoelectric composite plates, we propose the use of the total weighted energy method to select the weighting matrices. By constructing the optimal performance function as a relative measure of the total kinetic energy, strain energy and input energy of the system, only three design variables need to be considered to achieve a balance between the desired higher damping effect and lower input cost. Modal control analysis is used to interpret the effects of three energy weight factors on the damping ratios and modal voltages and it is shown that the modal damping effect will increase with the kinetic energy weight factor, approaching square root (2/2) as the strain energy weight factor increases and decrease with the input energy weight factor. Numerical results agree well with those from the modal control analysis. Since the control problem is simplified to three design variables only, the computational cost will be greatly reduced and a more accurate structural control analysis becomes more attractive for large systems

weight energi linear quadrat regul vibrat control of piezoelectr composit plate
 in thi paper on finit element linear quadrat regul ( lqr ) vibrat control of smart piezoelectr composit plate , we propos the use of the total weight energi method to select the weight matric . by construct the optim perform function as a rel measur of the total kinet energi , strain energi and input energi of the system , onli three design variabl need to be consid to achiev a balanc between the desir higher damp effect and lower input cost . modal control analysi is use to interpret the effect of three energi weight factor on the damp ratio and modal voltag and it is shown that the modal damp effect will increas with the kinet energi weight factor , approach squar root ( 2/2 ) as the strain energi weight factor increas and decreas with the input energi weight factor . numer result agre well with those from the modal control analysi . sinc the control problem is simplifi to three design variabl onli , the comput cost will be greatli reduc and a more accur structur control analysi becom more attract for larg system


High-speed consistency checking for hypothetical reasoning systems using inference path network

Abstract: Hypothetical reasoning is popular in fault diagnostics and design systems, but slow reasoning speed is its drawback. The goal of the current study is developing hypothetical reasoning based on an inference path network, which would overcome this drawback. In hypothetical reasoning systems based on an inference path network, there is much room for improvement regarding the computing costs of connotation processing and consistency checking. The authors of this study demonstrate improvement ideas regarding one of these problems, namely, consistency checking. First, the authors obtained necessary and sufficient conditions under which inconsistencies occur during hypothesis composition. Based on the obtained results, the authors proposed an algorithm for speeding up the process of consistency checking. Processing with this algorithm in its core consists of transforming the inference path network in such a way that inconsistencies do not occur during the hypothesis composition, under the condition of unchanged solution hypotheses. The efficiency of this algorithm was confirmed by tests

high-spe consist check for hypothet reason system use infer path network
 hypothet reason is popular in fault diagnost and design system , but slow reason speed is it drawback . the goal of the current studi is develop hypothet reason base on an infer path network , which would overcom thi drawback . in hypothet reason system base on an infer path network , there is much room for improv regard the comput cost of connot process and consist check . the author of thi studi demonstr improv idea regard one of these problem , name , consist check . first , the author obtain necessari and suffici condit under which inconsist occur dure hypothesi composit . base on the obtain result , the author propos an algorithm for speed up the process of consist check . process with thi algorithm in it core consist of transform the infer path network in such a way that inconsist do not occur dure the hypothesi composit , under the condit of unchang solut hypothes . the effici of thi algorithm wa confirm by test

high-speed consistency checking
hypothetical reasoning
inference path network
fault diagnostics
reasoning speed
inconsistencies
hypothesis composition
speed up


A knowledge intensive multi-agent framework for cooperative/collaborative design modeling and decision support of assemblies

Abstract: Multi-agent modeling has emerged as a promising discipline for dealing with the decision making process in distributed information system applications. One of such applications is the modeling of distributed design or manufacturing processes which can link up various designs or manufacturing processes to form a virtual consortium on a global basis. This paper proposes a novel knowledge intensive multi-agent cooperative/collaborative framework for concurrent intelligent design and assembly planning, which integrates product design, design for assembly, assembly planning, assembly system design, and assembly simulation subjected to econo-technical evaluations. An AI protocol based method is proposed to facilitate the integration of intelligent agents for assembly design, planning, evaluation and simulation processes. A unified class of knowledge intensive Petri nets is defined using the OO knowledge-based Petri net approach and used as an AI protocol for handling both the integration and the negotiation problems among multi-agents. The detailed cooperative/collaborative mechanism and algorithms are given based on the knowledge object cooperation formalisms. As such, the assembly-oriented design system can easily be implemented under the multi-agent-based knowledge-intensive Petri net framework with concurrent integration of multiple cooperative knowledge sources and software. Thus, product design and assembly planning can be carried out simultaneously and intelligently in an entirely computer-aided concurrent design and assembly planning system

a knowledg intens multi-ag framework for cooper / collabor design model and decis support of assembl
 multi-ag model ha emerg as a promis disciplin for deal with the decis make process in distribut inform system applic . one of such applic is the model of distribut design or manufactur process which can link up variou design or manufactur process to form a virtual consortium on a global basi . thi paper propos a novel knowledg intens multi-ag cooper / collabor framework for concurr intellig design and assembl plan , which integr product design , design for assembl , assembl plan , assembl system design , and assembl simul subject to econo-techn evalu . an ai protocol base method is propos to facilit the integr of intellig agent for assembl design , plan , evalu and simul process . a unifi class of knowledg intens petri net is defin use the oo knowledge-bas petri net approach and use as an ai protocol for handl both the integr and the negoti problem among multi-ag . the detail cooper / collabor mechan and algorithm are given base on the knowledg object cooper formal . as such , the assembly-ori design system can easili be implement under the multi-agent-bas knowledge-intens petri net framework with concurr integr of multipl cooper knowledg sourc and softwar . thu , product design and assembl plan can be carri out simultan and intellig in an entir computer-aid concurr design and assembl plan system


Vibration control of structure by using tuned mass damper (development of system which suppress displacement of auxiliary mass)

Abstract: In vibration control of a structure by using an active tuned mass damper (ATMD), stroke of the auxiliary mass is so limited that it is difficult to control the vibration in the case of large disturbance input. In this paper, two methods are proposed for the problem. One of the methods is a switching control system by two types of controllers. One of the controllers is a normal controller under small relative displacement of the auxiliary mass, and the other is not effective only for first mode of vibration under large relative displacement of the auxiliary mass. New variable gain control system is constructed by switching these two controllers. The other method is the brake system. In active vibration control, it is necessary to use actuator for active control. By using the actuator, the proposed system puts on the brake to suppress displacement increase of the auxiliary mass under large disturbance input. Finally, the systems are designed and the effectiveness of the systems is confirmed by the simulation

vibrat control of structur by use tune mass damper ( develop of system which suppress displac of auxiliari mass )
 in vibrat control of a structur by use an activ tune mass damper ( atmd ) , stroke of the auxiliari mass is so limit that it is difficult to control the vibrat in the case of larg disturb input . in thi paper , two method are propos for the problem . one of the method is a switch control system by two type of control . one of the control is a normal control under small rel displac of the auxiliari mass , and the other is not effect onli for first mode of vibrat under larg rel displac of the auxiliari mass . new variabl gain control system is construct by switch these two control . the other method is the brake system . in activ vibrat control , it is necessari to use actuat for activ control . by use the actuat , the propos system put on the brake to suppress displac increas of the auxiliari mass under larg disturb input . final , the system are design and the effect of the system is confirm by the simul

vibration control
controllers
tuned mass damper
variable gain control system
brake system
actuator
active control
auxiliary mass displacement suppression


PGE helps customers reduce energy costs

Abstract: A new service from Portland General Electric (PGE, Portland, Oregon, US) is saving customers tens of thousands of dollars in energy costs. PGE created E-Manager to allow facility managers to analyze their energy consumption online at 15-minute intervals. Customers can go to the Web for complete data, powerful analysis tools and charts, helping them detect abnormal energy use and focus on costly problem areas

pge help custom reduc energi cost
 a new servic from portland gener electr ( pge , portland , oregon , us ) is save custom ten of thousand of dollar in energi cost . pge creat e-manag to allow facil manag to analyz their energi consumpt onlin at 15-minut interv . custom can go to the web for complet data , power analysi tool and chart , help them detect abnorm energi use and focu on costli problem area

Portland General Electric
Oregon
E-Manager
energy costs reduction
online energy consumption analysis
abnormal energy use detection


A scalable and efficient systolic algorithm for the longest common subsequence problem

Abstract: A longest common subsequence (LCS) of two strings is a common subsequence of two strings of maximal length. The LCS problem is that of finding an LCS of two given strings and the length of the LCS. This problem has been the subject of much research because its solution can be applied in many areas. In this paper, a scalable and efficient systolic algorithm is presented. For two given strings of length m and n, where m>or=n, the algorithm can solve the LCS problem in m+2r-1 (respectively n+2r-1) time steps with r<n/2 (respectively r<m/2) processors. Experimental results show that the algorithm can be faster on multicomputers than all the previous systolic algorithms for the same problem

a scalabl and effici systol algorithm for the longest common subsequ problem
 a longest common subsequ ( lc ) of two string is a common subsequ of two string of maxim length . the lc problem is that of find an lc of two given string and the length of the lc . thi problem ha been the subject of much research becaus it solut can be appli in mani area . in thi paper , a scalabl and effici systol algorithm is present . for two given string of length m and n , where m > or = n , the algorithm can solv the lc problem in m+2r-1 ( respect n+2r-1 ) time step with r < n/2 ( respect r < m/2 ) processor . experiment result show that the algorithm can be faster on multicomput than all the previou systol algorithm for the same problem

systolic algorithm
longest common subsequence problem
scalable algorithm
parallel algorithms


Portal dose image prediction for dosimetric treatment verification in radiotherapy. II. An algorithm for wedged beams

Abstract: A method is presented for calculation of a two-dimensional function, T/sub wedge/(x,y), describing the transmission of a wedged photon beam through a patient. This in an extension of the method that we have published for open (nonwedged) fields [Med. Phys. 25, 830-840 (1998)]. Transmission functions for open fields are being used in our clinic for prediction of portal dose images (PDI, i.e., a dose distribution behind the patient in a plane normal to the beam axis), which are compared with PDIs measured with an electronic portal imaging device (EPID). The calculations are based on the planning CT scan of the patient and on the irradiation geometry as determined in the treatment planning process. Input data for the developed algorithm for wedged beams are derived from (the already available) measured input data set for transmission prediction in open beams, which is extended with only a limited set of measurements in the wedged beam. The method has been tested for a PDI plane at 160 cm from the focus, in agreement with the applied focus-to-detector distance of our fluoroscopic EPIDs. For low and high energy photon beams (6 and 23 MV) good agreement (~1%) has been found between calculated and measured transmissions for a slab and a thorax phantom

portal dose imag predict for dosimetr treatment verif in radiotherapi . ii . an algorithm for wedg beam
 a method is present for calcul of a two-dimension function , t / sub wedge/(x , y ) , describ the transmiss of a wedg photon beam through a patient . thi in an extens of the method that we have publish for open ( nonwedg ) field [ med . phi . 25 , 830 - 840 ( 1998 ) ] . transmiss function for open field are be use in our clinic for predict of portal dose imag ( pdi , i.e. , a dose distribut behind the patient in a plane normal to the beam axi ) , which are compar with pdi measur with an electron portal imag devic ( epid ) . the calcul are base on the plan ct scan of the patient and on the irradi geometri as determin in the treatment plan process . input data for the develop algorithm for wedg beam are deriv from ( the alreadi avail ) measur input data set for transmiss predict in open beam , which is extend with onli a limit set of measur in the wedg beam . the method ha been test for a pdi plane at 160 cm from the focu , in agreement with the appli focus-to-detector distanc of our fluoroscop epid . for low and high energi photon beam ( 6 and 23 mv ) good agreement ( ~1 % ) ha been found between calcul and measur transmiss for a slab and a thorax phantom

portal dose image prediction
dosimetric treatment verification
radiotherapy
two-dimensional function
wedged photon beam
electronic portal imaging devices
planning CT scan
irradiation geometry
open beams
high energy photon beams
23 MV
thorax phantom
transmission dosimetry
wedged beams algorithm
low energy photon beams
slab phantom
in vivo dosimetry
fluoroscopic CCD camera
pencil beam algorithm
CadPlan planning system
virtual wedges
6 MV

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


Blending parametric patches with subdivision surfaces

Abstract: In this paper the problem of blending parametric surfaces using subdivision patches is discussed. A new approach, named removing-boundary, is presented to generate piecewise-smooth subdivision surfaces through discarding the outmost quadrilaterals of the open meshes derived by each subdivision step. Then the approach is employed both to blend parametric bicubic B-spline surfaces and to fill n-sided holes. It is easy to produce piecewise-smooth subdivision surfaces with both convex and concave corners on the boundary, and limit surfaces are guaranteed to be C/sup 2/ continuous on the boundaries except for a few singular points by the removing-boundary approach. Thus the blending method is very efficient and the blending surface generated is of good effect

blend parametr patch with subdivis surfac
 in thi paper the problem of blend parametr surfac use subdivis patch is discuss . a new approach , name removing-boundari , is present to gener piecewise-smooth subdivis surfac through discard the outmost quadrilater of the open mesh deriv by each subdivis step . then the approach is employ both to blend parametr bicub b-spline surfac and to fill n-side hole . it is easi to produc piecewise-smooth subdivis surfac with both convex and concav corner on the boundari , and limit surfac are guarante to be c / sup 2/ continu on the boundari except for a few singular point by the removing-boundari approach . thu the blend method is veri effici and the blend surfac gener is of good effect

subdivision surfaces
subdivision patches
piecewise-smooth subdivision surfaces
quadrilaterals
parametric bicubic B-spline surfaces
parametric surfaces blending
piecewise smooth subdivision surfaces


Excess energy [cooling system]

Abstract: The designers retrofitting a comfort cooling system to offices in Hertfordshire have been able to make use of the waste heat rejected. what's more they're now making it a standard solution for much larger projects

excess energi [ cool system ]
 the design retrofit a comfort cool system to offic in hertfordshir have been abl to make use of the wast heat reject . what 's more they 're now make it a standard solut for much larger project

comfort cooling system
waste heat
Nationwide Trust
air conditioning


Pipelined broadcast with enhanced wormhole routers

Abstract: This paper proposes a pipelined broadcast that broadcasts a message of size m in O(m+n-1) time in an n-dimensional hypercube. It is based on the replication tree, which is derived from reachable sets. It has greatly improved performance compared to Ho-Kao's (1995) algorithm with the time of O(m[n/log(n+1)]). The communication in the broadcast uses an all-port wormhole router with message replication capability. This paper includes the algorithm together with performance comparisons to previous schemes in a practical implementation

pipelin broadcast with enhanc wormhol router
 thi paper propos a pipelin broadcast that broadcast a messag of size m in o(m+n-1 ) time in an n-dimension hypercub . it is base on the replic tree , which is deriv from reachabl set . it ha greatli improv perform compar to ho-kao 's ( 1995 ) algorithm with the time of o(m[n / log(n+1 ) ] ) . the commun in the broadcast use an all-port wormhol router with messag replic capabl . thi paper includ the algorithm togeth with perform comparison to previou scheme in a practic implement

pipelined broadcast
enhanced wormhole routers
n-dimensional hypercube
replication tree
reachable sets
performance
all-port wormhole router
message replication capability
message broadcast
communication complexity
intermediate reception


P2P is dead, long live P2P

Abstract: Picture the problem: a sprawling multinational has hundreds of offices, thousands of workers, and countless amounts of intellectual property scattered here, there, everywhere. In Kuala Lumpur an executive needs to see an internally-generated report on oil futures in central Asia-but where is it? London? New York? Moscow? With a few clicks of the mouse-and the right P2P technology deployed in-house-that executive will find and retrieve the report. Without P2P that might be impossible-certainly it would be time-consuming-and, right there, the argument for P2P implementations inside enterprises becomes clear. Who are the players? No companies have managed to stake out clear leads and the fact is that the P2P marketplace now is up for grabs-but the exciting news is that a range of small and startup businesses are trying to grab turf and quite probably, if the analysts are right, a few of these now little-known companies will emerge as digital content stars within the next few years. Cases in point: Groove Networks, Avaki, WorldStreet, Yaga, NextPage, and Kontiki. Very different companies-their approach to the markets radically differ-but, say the analysts, each is worth a close look because among them they are defining the future of P2P

p2p is dead , long live p2p
 pictur the problem : a sprawl multin ha hundr of offic , thousand of worker , and countless amount of intellectu properti scatter here , there , everywher . in kuala lumpur an execut need to see an internally-gener report on oil futur in central asia-but where is it ? london ? new york ? moscow ? with a few click of the mouse-and the right p2p technolog deploy in-house-that execut will find and retriev the report . without p2p that might be impossible-certainli it would be time-consuming-and , right there , the argument for p2p implement insid enterpris becom clear . who are the player ? no compani have manag to stake out clear lead and the fact is that the p2p marketplac now is up for grabs-but the excit news is that a rang of small and startup busi are tri to grab turf and quit probabl , if the analyst are right , a few of these now little-known compani will emerg as digit content star within the next few year . case in point : groov network , avaki , worldstreet , yaga , nextpag , and kontiki . veri differ companies-their approach to the market radic differ-but , say the analyst , each is worth a close look becaus among them they are defin the futur of p2p

P2P technology
businesses
digital content
Groove Networks
Avaki
WorldStreet
Yaga
NextPage
Kontiki
content owners


Speaker identification from voice using neural networks

Abstract: The paper provides three different schemes for speaker identification of personnel from their voice using artificial neural networks. The first scheme recognizes speakers by employing the classical backpropagation algorithm pre-trained with known voice samples of the persons. The second scheme provides a framework for classifying the known training samples of the voice features using a hierarchical architecture realized with a self-organizing feature map neural net. The first scheme is highly robust as it is capable of identifying the personnel from their noisy voice samples, but because of its excessive training time it has limited applications for a large voice database. The second scheme though not so robust as the former, however, can classify an unknown voice sample to its nearest class. The time needed for classification by the first scheme is always unique irrespective of the voice sample. It is proportional to the number of feedforward layers in the network. The time-requirement of the second classification scheme, however, is not free from the voice features and is proportional to the number of 2D arrays traversed by the algorithm on the hierarchical structure. The third scheme is highly robust and mis-classification is as low as 0.2 per cent. The third scheme combines the composite benefits of a radial basis function neural net and backpropagation trained neural net

speaker identif from voic use neural network
 the paper provid three differ scheme for speaker identif of personnel from their voic use artifici neural network . the first scheme recogn speaker by employ the classic backpropag algorithm pre-train with known voic sampl of the person . the second scheme provid a framework for classifi the known train sampl of the voic featur use a hierarch architectur realiz with a self-organ featur map neural net . the first scheme is highli robust as it is capabl of identifi the personnel from their noisi voic sampl , but becaus of it excess train time it ha limit applic for a larg voic databas . the second scheme though not so robust as the former , howev , can classifi an unknown voic sampl to it nearest class . the time need for classif by the first scheme is alway uniqu irrespect of the voic sampl . it is proport to the number of feedforward layer in the network . the time-requir of the second classif scheme , howev , is not free from the voic featur and is proport to the number of 2d array travers by the algorithm on the hierarch structur . the third scheme is highli robust and mis-classif is as low as 0.2 per cent . the third scheme combin the composit benefit of a radial basi function neural net and backpropag train neural net

speaker identification
personnel
artificial neural networks
backpropagation algorithm
pre-training
known voice samples
classification
hierarchical architecture
self-organizing feature map
feedforward layers
2D arrays
radial basis function neural net


Pioneering women in computer science

Abstract: Although their contributions are not well documented, women have played an important role in the development of computer science. A survey of women pioneers demonstrates their influence in designing and programming the first electronic computers and languages, while laying the groundwork for women's expanding involvement in science

pioneer women in comput scienc
 although their contribut are not well document , women have play an import role in the develop of comput scienc . a survey of women pioneer demonstr their influenc in design and program the first electron comput and languag , while lay the groundwork for women 's expand involv in scienc

pioneering women
electronic computers
computer science development
programming languages
history


A comprehensive chatter prediction model for face turning operation including tool wear effect

Abstract: Presents a three-dimensional mechanistic frequency domain chatter model for face turning processes, that can account for the effects of tool wear including process damping. New formulations are presented to model the variation in process damping forces along nonlinear tool geometries such as the nose radius. The underlying dynamic force model simulates the variation in the chip cross-sectional area by accounting for the displacements in the axial and radial directions. The model can be used to determine stability boundaries under various cutting conditions and different states of flank wear. Experimental results for different amounts of wear are provided as a validation for the model

a comprehens chatter predict model for face turn oper includ tool wear effect
 present a three-dimension mechanist frequenc domain chatter model for face turn process , that can account for the effect of tool wear includ process damp . new formul are present to model the variat in process damp forc along nonlinear tool geometri such as the nose radiu . the underli dynam forc model simul the variat in the chip cross-sect area by account for the displac in the axial and radial direct . the model can be use to determin stabil boundari under variou cut condit and differ state of flank wear . experiment result for differ amount of wear are provid as a valid for the model


Q-learning for risk-sensitive control

Abstract: We propose for risk-sensitive control of finite Markov chains a counterpart of the popular Q-learning algorithm for classical Markov decision processes. The algorithm is shown to converge with probability one to the desired solution. The proof technique is an adaptation of the o.d.e. approach for the analysis of stochastic approximation algorithms, with most of the work involved used for the analysis of the specific o.d.e.s that arise

q-learn for risk-sensit control
 we propos for risk-sensit control of finit markov chain a counterpart of the popular q-learn algorithm for classic markov decis process . the algorithm is shown to converg with probabl one to the desir solut . the proof techniqu is an adapt of the o.d. . approach for the analysi of stochast approxim algorithm , with most of the work involv use for the analysi of the specif o.d.e. that aris

risk-sensitive control
finite Markov chains
Q-learning algorithm
classical Markov decision processes
proof technique
stochastic approximation algorithms
algorithm convergence
reinforcement learning algorithms
dynamic programming
ordinary differential equations


Getting the most out of intrusion detection systems

Abstract: Intrusion detection systems (IDS) can play a very valuable role in the defence of a network. However, it is important to understand not just what it will do (and how it does it) - but what it won't do (and why). This article does not go into the technical working of IDS in too much detail, rather it limits itself to a discussion of some of the capabilities and failings of the technology

get the most out of intrus detect system
 intrus detect system ( id ) can play a veri valuabl role in the defenc of a network . howev , it is import to understand not just what it will do ( and how it doe it ) - but what it wo n't do ( and whi ) . thi articl doe not go into the technic work of id in too much detail , rather it limit itself to a discuss of some of the capabl and fail of the technolog

intrusion detection systems
computer network security
network attacks
firewall


Global action rules in distributed knowledge systems

Abstract: Previously Z. Ras and J.M. Zytkow (2000) introduced and investigated query answering system based on distributed knowledge mining. The notion of an action rule was introduced by Z. Ras and A. Wieczorkowska (2000) and its application domain e-business was taken. In this paper, we generalize the notion of action rules in a similar way to handling global queries. Mainly, when values of attributes for a given customer, used in action rules, can not be easily changed by business user, definitions of these attributes are extracted from other sites of a distributed knowledge system. To be more precise, attributes at every site of a distributed knowledge system are divided into two sets: stable and flexible. Values of flexible attributes, for a given consumer, sometime can be changed and this change can be influenced and controlled by a business user. However, some of these changes (for instance to the attribute "profit') can not be done directly to a chosen attribute. In this case, definitions of such an attribute in terms of other attributes have to be learned. These new definitions are used to construct action rules showing what changes in values of flexible attributes, for a given consumer, are needed in order to re-classify this consumer the way business user wants. But, business user may be either unable or unwilling to proceed with actions leading to such changes. In all such cases we may search for definitions of these flexible attributes looking at either local or remote sites for help

global action rule in distribut knowledg system
 previous z. ra and j.m. zytkow ( 2000 ) introduc and investig queri answer system base on distribut knowledg mine . the notion of an action rule wa introduc by z. ra and a. wieczorkowska ( 2000 ) and it applic domain e-busi wa taken . in thi paper , we gener the notion of action rule in a similar way to handl global queri . mainli , when valu of attribut for a given custom , use in action rule , can not be easili chang by busi user , definit of these attribut are extract from other site of a distribut knowledg system . to be more precis , attribut at everi site of a distribut knowledg system are divid into two set : stabl and flexibl . valu of flexibl attribut , for a given consum , sometim can be chang and thi chang can be influenc and control by a busi user . howev , some of these chang ( for instanc to the attribut " profit ' ) can not be done directli to a chosen attribut . in thi case , definit of such an attribut in term of other attribut have to be learn . these new definit are use to construct action rule show what chang in valu of flexibl attribut , for a given consum , are need in order to re-classifi thi consum the way busi user want . but , busi user may be either unabl or unwil to proceed with action lead to such chang . in all such case we may search for definit of these flexibl attribut look at either local or remot site for help

global action rules
action rules
query answering system
distributed knowledge mining
attributes
e-commerce


High-performance numerical pricing methods

Abstract: The pricing of financial derivatives is an important field in finance and constitutes a major component of financial management applications. The uncertainty of future events often makes analytic approaches infeasible and, hence, time-consuming numerical simulations are required. In the Aurora Financial Management System, pricing is performed on the basis of lattice representations of stochastic multidimensional scenario processes using the Monte Carlo simulation and Backward Induction methods, the latter allowing for the exploitation of shared-memory parallelism. We present the parallelization of a Backward Induction numerical pricing kernel on a cluster of SMPs using HPF+, an extended version of High-Performance Fortran. Based on language extensions for specifying a hierarchical mapping of data onto an SMP cluster, the compiler generates a hybrid-parallel program combining distributed-memory and shared-memory parallelism. We outline the parallelization strategy adopted by the VFC compiler and present an experimental evaluation of the pricing kernel on an NEC SX-5 vector supercomputer and a Linux SMP cluster, comparing a pure MPI version to a hybrid-parallel MPI/OpenMP version

high-perform numer price method
 the price of financi deriv is an import field in financ and constitut a major compon of financi manag applic . the uncertainti of futur event often make analyt approach infeas and , henc , time-consum numer simul are requir . in the aurora financi manag system , price is perform on the basi of lattic represent of stochast multidimension scenario process use the mont carlo simul and backward induct method , the latter allow for the exploit of shared-memori parallel . we present the parallel of a backward induct numer price kernel on a cluster of smp use hpf+ , an extend version of high-perform fortran . base on languag extens for specifi a hierarch map of data onto an smp cluster , the compil gener a hybrid-parallel program combin distributed-memori and shared-memori parallel . we outlin the parallel strategi adopt by the vfc compil and present an experiment evalu of the price kernel on an nec sx-5 vector supercomput and a linux smp cluster , compar a pure mpi version to a hybrid-parallel mpi / openmp version

pricing
finance
financial management
Aurora Financial Management System
Monte Carlo simulation
Backward Induction methods
numerical pricing kernel
stochastic processes
derivative pricing
investment strategies


Comparison of non-stationary time series in the frequency domain

Abstract: In this paper we compare two nonstationary time series using nonparametric procedures. Evolutionary spectra are estimated for the two series. Randomization tests are performed on groups of spectral estimates for both related and independent time series. Simulation studies show that in certain cases the tests perform reasonably well. The tests are applied to observed geological and financial time series

comparison of non-stationari time seri in the frequenc domain
 in thi paper we compar two nonstationari time seri use nonparametr procedur . evolutionari spectra are estim for the two seri . random test are perform on group of spectral estim for both relat and independ time seri . simul studi show that in certain case the test perform reason well . the test are appli to observ geolog and financi time seri

nonstationary time series
nonparametric procedures
randomization tests
spectral estimates
independent time series
simulation
financial time series
evolutionary spectra estimation
related time series
lag window
time window
geological time series


Robust speech recognition using probabilistic union models

Abstract: This paper introduces a new statistical approach, namely the probabilistic union model, for speech recognition involving partial, unknown frequency-band corruption. Partial frequency-band corruption accounts for the effect of a family of real-world noises. Previous methods based on the missing feature theory usually require the identity of the noisy bands. This identification can be difficult for unexpected noise with unknown, time-varying band characteristics. The new model combines the local frequency-band information based on the union of random events, to reduce the dependence of the model on information about the noise. This model partially accomplishes the target: offering robustness to partial frequency-band corruption, while requiring no information about the noise. This paper introduces the theory and implementation of the union model, and is focused on several important advances. These new developments include a new algorithm for automatic order selection, a generalization of the modeling principle to accommodate partial feature stream corruption, and a combination of the union model with conventional noise reduction techniques to deal with a mixture of stationary noise and unknown, nonstationary noise. For the evaluation, we used the TIDIGITS database for speaker-independent connected digit recognition. The utterances were corrupted by various types of additive noise, stationary or time-varying, assuming no knowledge about the noise characteristics. The results indicate that the new model offers significantly improved robustness in comparison to other models

robust speech recognit use probabilist union model
 thi paper introduc a new statist approach , name the probabilist union model , for speech recognit involv partial , unknown frequency-band corrupt . partial frequency-band corrupt account for the effect of a famili of real-world nois . previou method base on the miss featur theori usual requir the ident of the noisi band . thi identif can be difficult for unexpect nois with unknown , time-vari band characterist . the new model combin the local frequency-band inform base on the union of random event , to reduc the depend of the model on inform about the nois . thi model partial accomplish the target : offer robust to partial frequency-band corrupt , while requir no inform about the nois . thi paper introduc the theori and implement of the union model , and is focus on sever import advanc . these new develop includ a new algorithm for automat order select , a gener of the model principl to accommod partial featur stream corrupt , and a combin of the union model with convent nois reduct techniqu to deal with a mixtur of stationari nois and unknown , nonstationari nois . for the evalu , we use the tidigit databas for speaker-independ connect digit recognit . the utter were corrupt by variou type of addit nois , stationari or time-vari , assum no knowledg about the nois characterist . the result indic that the new model offer significantli improv robust in comparison to other model


Reply to "Comment on: Teleportation of an unknown state by W state" [Phys. Lett. A 300 (2002) 324]

Abstract: In our letter (see ibid., vol. 296, p. 161 (2002)), the main question we consider is whether a general three-particle W state can be used to realize the teleportation of an unknown qubit state. We give the positive answer to this question in our letter, and show that W state can be used to realize to do that probabilistically. We also discuss how to do it in detail in our letter. In the previous comment (see ibid., vol. 300, p. 324 (2002)), authors check carefully the mathematics calculation of our letter, find and point out a simple mathematics error about normalization coefficient of Eq. (1). This mathematics error induces the incorrect probability calculation of Eq. (6), and also an incorrect claim in first part of our letter

repli to " comment on : teleport of an unknown state by w state " [ phi . lett . a 300 ( 2002 ) 324 ]
 in our letter ( see ibid . , vol . 296 , p. 161 ( 2002 ) ) , the main question we consid is whether a gener three-particl w state can be use to realiz the teleport of an unknown qubit state . we give the posit answer to thi question in our letter , and show that w state can be use to realiz to do that probabilist . we also discuss how to do it in detail in our letter . in the previou comment ( see ibid . , vol . 300 , p. 324 ( 2002 ) ) , author check care the mathemat calcul of our letter , find and point out a simpl mathemat error about normal coeffici of eq . ( 1 ) . thi mathemat error induc the incorrect probabl calcul of eq . ( 6 ) , and also an incorrect claim in first part of our letter

teleportation
unknown state
three-particle W state
qubit state
normalization coefficient
probability calculation


Soft options for software upgrades?

Abstract: Several new products claim to take the work out of installing software and patches, and even migrating operating systems. Software migration products fall into two broad categories. The drive imaging type is designed to make exact copies of a hard disk, either an entire drive or certain directories, so you can use it to back up data. The application management type is designed for more incremental upgrades and often provides additional features such as the ability to monitor or control users' access to applications

soft option for softwar upgrad ?
 sever new product claim to take the work out of instal softwar and patch , and even migrat oper system . softwar migrat product fall into two broad categori . the drive imag type is design to make exact copi of a hard disk , either an entir drive or certain directori , so you can use it to back up data . the applic manag type is design for more increment upgrad and often provid addit featur such as the abil to monitor or control user ' access to applic

software upgrades
software installation
Microsoft Windows
operating systems migration


A fuzzy logic approach to accommodate thermal stress and improve the start-up phase in combined cycle power plants

Abstract: Use of combined cycle power generation plant has increased dramatically over the last decade. A supervisory control approach based on a dynamic model is developed, which makes use of proportional-integral-derivative (PID), fuzzy logic and fuzzy PID schemes. The aim is to minimize the steam turbine plant start-up time, without violating maximum thermal stress limits. An existing start-up schedule provides the benchmark by which the performance of candidate controllers is assessed. Improvements regarding possible reduced start-up times and satisfaction of maximum thermal stress restrictions have been realized using the proposed control scheme

a fuzzi logic approach to accommod thermal stress and improv the start-up phase in combin cycl power plant
 use of combin cycl power gener plant ha increas dramat over the last decad . a supervisori control approach base on a dynam model is develop , which make use of proportional-integral-deriv ( pid ) , fuzzi logic and fuzzi pid scheme . the aim is to minim the steam turbin plant start-up time , without violat maximum thermal stress limit . an exist start-up schedul provid the benchmark by which the perform of candid control is assess . improv regard possibl reduc start-up time and satisfact of maximum thermal stress restrict have been realiz use the propos control scheme

steam turbine plant start-up time minimization


Using constructed types in C++ unions

Abstract: The C++ Standard states that a union type cannot have a member with a nontrivial constructor or destructor. While at first this seems unreasonable, further thought makes it clear why this is the case: The crux of the problem is that unions don't have built-in semantics for denoting when a member is the "current" member of the union. Therefore, the compiler can't know when it's appropriate to call constructors or destructors on the union members. Still, there are good reasons for wanting to use constructed object types in a union. For example, you might want to implement a scripting language with a single variable type that can either be an integer, a string, or a list. A union is the perfect candidate for implementing such a composite type, but the restriction on constructed union members may prevent you from using an existing string or list class (for example, from the STL) to provide the underlying functionality. Luckily, a feature of C++ called placement new can provide a workaround

use construct type in c++ union
 the c++ standard state that a union type can not have a member with a nontrivi constructor or destructor . while at first thi seem unreason , further thought make it clear whi thi is the case : the crux of the problem is that union do n't have built-in semant for denot when a member is the " current " member of the union . therefor , the compil ca n't know when it 's appropri to call constructor or destructor on the union member . still , there are good reason for want to use construct object type in a union . for exampl , you might want to implement a script languag with a singl variabl type that can either be an integ , a string , or a list . a union is the perfect candid for implement such a composit type , but the restrict on construct union member may prevent you from use an exist string or list class ( for exampl , from the stl ) to provid the underli function . luckili , a featur of c++ call placement new can provid a workaround

C++ Standard
union type
constructors
destructors
union members
scripting language
placement new


A conference's impact on undergraduate female students

Abstract: In September of 2000, the 3rd Grace Hopper Celebration of Women in Computing was held in Cape Cod, Massachusetts. Along with a colleague from a nearby university, we accompanied seven of our female undergraduate students to this conference. This paper reports on how the conference experience immediately affected these students - what impressed them, what scared them, what it clarified for them. It also reports on how the context in which these students currently evaluate their ability, potential and opportunity in computer science is different now from what it was before the conference. Hopefully, by understanding their experience, we can gain some insight into things we can do for all of our undergraduate female students to better support their computer science and engineering education

a confer 's impact on undergradu femal student
 in septemb of 2000 , the 3rd grace hopper celebr of women in comput wa held in cape cod , massachusett . along with a colleagu from a nearbi univers , we accompani seven of our femal undergradu student to thi confer . thi paper report on how the confer experi immedi affect these student - what impress them , what scare them , what it clarifi for them . it also report on how the context in which these student current evalu their abil , potenti and opportun in comput scienc is differ now from what it wa befor the confer . hope , by understand their experi , we can gain some insight into thing we can do for all of our undergradu femal student to better support their comput scienc and engin educ

conference
undergraduate female students
engineering education
computer science education
gender issues


Integration, the Web are key this season [tax]

Abstract: Integration and the Web are driving many of the enhancements planned by tax preparation software vendors for this coming season

integr , the web are key thi season [ tax ]
 integr and the web are drive mani of the enhanc plan by tax prepar softwar vendor for thi come season

accounting packages
tax packages
software integration
Internet
CCH
TaxWorks
People's Choice
Visual Tax
GoSystem Tax RS
Drake
NetConnection
ATX
CPASoftware
Intuit
Petz
TaxSimple
RIA


Enlisting on-line residents: Expanding the boundaries of e-government in a Japanese rural township

Abstract: The purpose of this article is to analyze and learn from an unusual way in which local bureaucrats in a Japanese rural township are using the Internet to serve their constituents by enlisting the support of "on-line residents." Successful e-government requires not only rethinking the potential uses of computer technology, but in adopting new patterns of decision-making, power sharing, and office management that many bureaucrats may not be predisposed to make. The main thesis of this article is that necessity and practicality can play a powerful motivational role in facilitating the incorporation of information technology (IT) at the level of local government. This case study of how bureaucrats in Towa-cho, a small, agricultural town in Northeastern Japan, have harnessed the Internet demonstrates clearly the fundamentals of building a successful e-government framework in this rural municipality, similar to many communities in Europe and North America today

enlist on-lin resid : expand the boundari of e-govern in a japanes rural township
 the purpos of thi articl is to analyz and learn from an unusu way in which local bureaucrat in a japanes rural township are use the internet to serv their constitu by enlist the support of " on-lin resid . " success e-govern requir not onli rethink the potenti use of comput technolog , but in adopt new pattern of decision-mak , power share , and offic manag that mani bureaucrat may not be predispos to make . the main thesi of thi articl is that necess and practic can play a power motiv role in facilit the incorpor of inform technolog ( it ) at the level of local govern . thi case studi of how bureaucrat in towa-cho , a small , agricultur town in northeastern japan , have har the internet demonstr clearli the fundament of build a success e-govern framework in thi rural municip , similar to mani commun in europ and north america today

on-line residents
e-government
Japanese rural township
local bureaucrats
Internet
decision-making
power sharing
office management
Towa-cho
rural municipality


Community technology and democratic rationalization

Abstract: The objective of the paper is to explore questions of human agency and democratic process in the technical sphere through the example of "virtual community." The formation of relatively stable long-term group associations (community in the broad sense of the term), is the scene on which a large share of human development occurs. As such it is a fundamental human value mobilizing diverse ideologies and sensitivities. The promise of realizing this value in a new domain naturally stirs up much excitement among optimistic observers of the Internet. At the same time, the eagerness to place hopes for community in a technical system flies in the face of an influential intellectual tradition of technology criticism. This eagerness seems even more naive in the light of the recent commercialization of so much Internet activity. Despite the widespread skepticism, we believe the growth of virtual community is significant for an inquiry into the democratization of technology. We show that conflicting answers to the central question of the present theoretical debate - Is community possible on computer networks? epsilon neralize from particular features of systems and software prevalent at different stages in the development of computer networking. We conclude that research should focus instead on how to design computer networks to better support community activities and values

commun technolog and democrat ration
 the object of the paper is to explor question of human agenc and democrat process in the technic sphere through the exampl of " virtual commun . " the format of rel stabl long-term group associ ( commun in the broad sens of the term ) , is the scene on which a larg share of human develop occur . as such it is a fundament human valu mobil divers ideolog and sensit . the promis of realiz thi valu in a new domain natur stir up much excit among optimist observ of the internet . at the same time , the eager to place hope for commun in a technic system fli in the face of an influenti intellectu tradit of technolog critic . thi eager seem even more naiv in the light of the recent commerci of so much internet activ . despit the widespread skeptic , we believ the growth of virtual commun is signific for an inquiri into the democrat of technolog . we show that conflict answer to the central question of the present theoret debat - is commun possibl on comput network ? epsilon neral from particular featur of system and softwar preval at differ stage in the develop of comput network . we conclud that research should focu instead on how to design comput network to better support commun activ and valu

community technology
democratic rationalization
human agency
democratic process
technical sphere
virtual community
stable long-term group associations
human development
human value
diverse ideologies
optimistic observers
technical system
intellectual tradition
technology criticism
Internet activity
conflicting answers
computer networks
computer networks
community activities
computer networking


Improved detection of lung nodules by using a temporal subtraction technique

Abstract: The authors evaluated the effect of a temporal subtraction technique for digital chest radiography with regard to the accuracy of detection of lung nodules. Twenty solitary lung nodules smaller than 30 mm in diameter, including 10 lung cancers and 10 benign nodules, were used. The nodules were grouped subjectively according to their subtlety. For nonnodular cases, 20 nodules without perceptible interval changes were selected. All chest radiographs were obtained by using a computed radiographic system, and temporal subtraction images were produced by using a program developed at the University of Chicago. The effect of the temporal subtraction image was evaluated by using an observer performance study, with use of receiver operating characteristic analysis. Observer performance with temporal subtraction images was substantially improved (A/sub z/ = 0.980 and 0.958), as compared with that without temporal subtraction images (A/sub z/ = 0.920 and 0.825) for the certified radiologists and radiology residents, respectively. The temporal subtraction technique clearly improved diagnostic accuracy for detecting lung nodules, especially subtle cases. In conclusion, the temporal subtraction technique is useful for improving detection accuracy for peripheral lung nodules on digital chest radiographs

improv detect of lung nodul by use a tempor subtract techniqu
 the author evalu the effect of a tempor subtract techniqu for digit chest radiographi with regard to the accuraci of detect of lung nodul . twenti solitari lung nodul smaller than 30 mm in diamet , includ 10 lung cancer and 10 benign nodul , were use . the nodul were group subject accord to their subtleti . for nonnodular case , 20 nodul without percept interv chang were select . all chest radiograph were obtain by use a comput radiograph system , and tempor subtract imag were produc by use a program develop at the univers of chicago . the effect of the tempor subtract imag wa evalu by use an observ perform studi , with use of receiv oper characterist analysi . observ perform with tempor subtract imag wa substanti improv ( a / sub z/ = 0.980 and 0.958 ) , as compar with that without tempor subtract imag ( a / sub z/ = 0.920 and 0.825 ) for the certifi radiologist and radiolog resid , respect . the tempor subtract techniqu clearli improv diagnost accuraci for detect lung nodul , especi subtl case . in conclus , the tempor subtract techniqu is use for improv detect accuraci for peripher lung nodul on digit chest radiograph

temporal subtraction technique
digital chest radiography
30 mm
perceptible interval changes
computed radiographic system
University of Chicago
observer performance
certified radiologists
radiology residents
subtle cases
peripheral lung nodules
improved lung nodules detection
medical diagnostic imaging


A scalable model of cerebellar adaptive timing and sequencing: the recurrent slide and latch (RSL) model

Abstract: From the dawn of modern neural network theory, the mammalian cerebellum has been a favored object of mathematical modeling studies. Early studies focused on the fanout, convergence, thresholding, and learned weighting of perceptual-motor signals within the cerebellar cortex. This led to the still viable idea that the granule cell stage in the cerebellar cortex performs a sparse expansive recoding of the time-varying input vector. This recoding reveals and emphasizes combinations in a distributed representation that serves as a basis for the learned, state-dependent control actions engendered by cerebellar outputs to movement related centers. To make optimal use of available signals, the cerebellum must be able to sift the evolving state representation for the most reliable predictors of the need for control actions, and to use those predictors even if they appear only transiently and well in advance of the optimal time for initiating the control action. The paper proposes a modification to prior, population, models for cerebellar adaptive timing and sequencing. Since it replaces a population with a single element, the proposed RSL model is in one sense maximally efficient, and therefore optimal from the perspective of scalability

a scalabl model of cerebellar adapt time and sequenc : the recurr slide and latch ( rsl ) model
 from the dawn of modern neural network theori , the mammalian cerebellum ha been a favor object of mathemat model studi . earli studi focus on the fanout , converg , threshold , and learn weight of perceptual-motor signal within the cerebellar cortex . thi led to the still viabl idea that the granul cell stage in the cerebellar cortex perform a spars expans recod of the time-vari input vector . thi recod reveal and emphas combin in a distribut represent that serv as a basi for the learn , state-depend control action engend by cerebellar output to movement relat center . to make optim use of avail signal , the cerebellum must be abl to sift the evolv state represent for the most reliabl predictor of the need for control action , and to use those predictor even if they appear onli transient and well in advanc of the optim time for initi the control action . the paper propos a modif to prior , popul , model for cerebellar adapt time and sequenc . sinc it replac a popul with a singl element , the propos rsl model is in one sens maxim effici , and therefor optim from the perspect of scalabl

scalable model
cerebellar adaptive timing
neural network theory
mammalian cerebellum
granule cell stage
sparse expansive recoding
time-varying input vector
distributed representation
cerebellar sequencing
recurrent slide and latch model
recurrent network


A static semantics for Haskell

Abstract: This paper gives a static semantics for Haskell 98, a non-strict purely functional programming language. The semantics formally specifies nearly all the details of the Haskell 98 type system, including the resolution of overloading, kind inference (including defaulting) and polymorphic recursion, the only major omission being a proper treatment of ambiguous overloading and its resolution. Overloading is translated into explicit dictionary passing, as in all current implementations of Haskell. The target language of this translation is a variant of the Girard-Reynolds polymorphic lambda calculus featuring higher order polymorphism. and explicit type abstraction and application in the term language. Translated programs can thus still be type checked, although the implicit version of this system is impredicative. A surprising result of this formalization effort is that the monomorphism restriction, when rendered in a system of inference rules, compromises the principal type property

a static semant for haskel
 thi paper give a static semant for haskel 98 , a non-strict pure function program languag . the semant formal specifi nearli all the detail of the haskel 98 type system , includ the resolut of overload , kind infer ( includ default ) and polymorph recurs , the onli major omiss be a proper treatment of ambigu overload and it resolut . overload is translat into explicit dictionari pass , as in all current implement of haskel . the target languag of thi translat is a variant of the girard-reynold polymorph lambda calculu featur higher order polymorph . and explicit type abstract and applic in the term languag . translat program can thu still be type check , although the implicit version of thi system is impred . a surpris result of thi formal effort is that the monomorph restrict , when render in a system of infer rule , compromis the princip type properti

nonstrict purely functional programming language


Vector algebra proofs for geometry theorems

Abstract: Vector mathematics can generate simple and powerful proofs of theorems in plane geometry. These proofs can also be used to generalize plane geometry theorems to higher dimensions. We present three vector proofs that show the power of this technique. 1. For any quadrilateral, the sum of the squares of the diagonals is less than or equal to the sum of the squares of the sides. 2. The area of a quadrilateral is half the product of the diagonals multiplied by the sine of an included angle. 3. One quarter of all triangles are acute (Based upon the options detailed below, with respect to the relative lengths of the sides). This paper presents a set of examples of vector mathematics applied to geometry problems. Some of the most beautiful and sophisticated proofs in mathematics involve using multiple representations of the same data. By leveraging the advantages of each representation one finds new and useful mathematical facts

vector algebra proof for geometri theorem
 vector mathemat can gener simpl and power proof of theorem in plane geometri . these proof can also be use to gener plane geometri theorem to higher dimens . we present three vector proof that show the power of thi techniqu . 1 . for ani quadrilater , the sum of the squar of the diagon is less than or equal to the sum of the squar of the side . 2 . the area of a quadrilater is half the product of the diagon multipli by the sine of an includ angl . 3 . one quarter of all triangl are acut ( base upon the option detail below , with respect to the rel length of the side ) . thi paper present a set of exampl of vector mathemat appli to geometri problem . some of the most beauti and sophist proof in mathemat involv use multipl represent of the same data . by leverag the advantag of each represent one find new and use mathemat fact

vector algebra proofs
proofs
vector mathematics
plane geometry
quadrilateral
multiple representations


Second term [International Telecommunication Union]

Abstract: Later this month Yoshio Utsumi is expected to be re-elected for a second four year term as secretary general of the International Telecommunication Union. Here he talks to Matthew May about getting involved in internet addressing, the prospects for 3g, the need for further reform of his organisation... and the translating telephone

second term [ intern telecommun union ]
 later thi month yoshio utsumi is expect to be re-elect for a second four year term as secretari gener of the intern telecommun union . here he talk to matthew may about get involv in internet address , the prospect for 3 g , the need for further reform of hi organis ... and the translat telephon

International Telecommunication Union
internet addressing
3G
translating telephone


Dynamic spectrum management for next-generation DSL systems

Abstract: The performance of DSL systems is severely constrained by crosstalk due to the electromagnetic coupling among the multiple twisted pairs making up a phone cable. In order to reduce performance loss arising from crosstalk, DSL systems are currently designed under the assumption of worst-case crosstalk scenarios leading to overly conservative DSL deployments. This article presents a new paradigm for DSL system design, which takes into account the multi-user aspects of the DSL transmission environment. Dynamic spectrum management (DSM) departs from the current design philosophy by enabling transceivers to autonomously and dynamically optimize their communication settings with respect to both the channel and the transmissions of neighboring systems. Along with this distributed optimization, when an additional degree of coordination becomes available for future DSL deployment, DSM will allow even greater improvement in DSL performance. Implementations are readily applicable without causing any performance degradation to the existing DSLs under static spectrum management. After providing an overview of the DSM concept, this article reviews two practical DSM methods: iterative water-filling, an autonomous distributed power control method enabling great improvement in performance, which can be implemented through software options in some existing ADSL and VDSL systems; and vectored-DMT, a coordinated transmission/reception technique achieving crosstalk-free communication for DSL systems, which brings within reach the dream of providing universal Internet access at speeds close to 100 Mb/s to 500 m on 1-2 lines and beyond 1 km on 2-4 lines. DSM-capable DSL thus enables the broadband age

dynam spectrum manag for next-gener dsl system
 the perform of dsl system is sever constrain by crosstalk due to the electromagnet coupl among the multipl twist pair make up a phone cabl . in order to reduc perform loss aris from crosstalk , dsl system are current design under the assumpt of worst-cas crosstalk scenario lead to overli conserv dsl deploy . thi articl present a new paradigm for dsl system design , which take into account the multi-us aspect of the dsl transmiss environ . dynam spectrum manag ( dsm ) depart from the current design philosophi by enabl transceiv to autonom and dynam optim their commun set with respect to both the channel and the transmiss of neighbor system . along with thi distribut optim , when an addit degre of coordin becom avail for futur dsl deploy , dsm will allow even greater improv in dsl perform . implement are readili applic without caus ani perform degrad to the exist dsl under static spectrum manag . after provid an overview of the dsm concept , thi articl review two practic dsm method : iter water-fil , an autonom distribut power control method enabl great improv in perform , which can be implement through softwar option in some exist adsl and vdsl system ; and vectored-dmt , a coordin transmiss / recept techniqu achiev crosstalk-fre commun for dsl system , which bring within reach the dream of provid univers internet access at speed close to 100 mb / s to 500 m on 1 - 2 line and beyond 1 km on 2 - 4 line . dsm-capabl dsl thu enabl the broadband age

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


Elastically adaptive deformable models

Abstract: We present a technique for the automatic adaptation of a deformable model's elastic parameters within a Kalman filter framework for shape estimation applications. The novelty of the technique is that the model's elastic parameters are not constant, but spatio-temporally varying. The variation of the elastic parameters depends on the distance of the model from the data and the rate of change of this distance. Each pass of the algorithm uses physics-based modeling techniques to iteratively adjust both the geometric and the elastic degrees of freedom of the model in response to forces that are computed from the discrepancy between the model and the data. By augmenting the state equations of an extended Kalman filter to incorporate these additional variables, we are able to significantly improve the quality of the shape estimation. Therefore, the model's elastic parameters are always initialized to the same value and they are subsequently modified depending on the data and the noise distribution. We present results demonstrating the effectiveness of our method for both two-dimensional and three-dimensional data

elast adapt deform model
 we present a techniqu for the automat adapt of a deform model 's elast paramet within a kalman filter framework for shape estim applic . the novelti of the techniqu is that the model 's elast paramet are not constant , but spatio-tempor vari . the variat of the elast paramet depend on the distanc of the model from the data and the rate of chang of thi distanc . each pass of the algorithm use physics-bas model techniqu to iter adjust both the geometr and the elast degre of freedom of the model in respons to forc that are comput from the discrep between the model and the data . by augment the state equat of an extend kalman filter to incorpor these addit variabl , we are abl to significantli improv the qualiti of the shape estim . therefor , the model 's elast paramet are alway initi to the same valu and they are subsequ modifi depend on the data and the nois distribut . we present result demonstr the effect of our method for both two-dimension and three-dimension data

elastically adaptive deformable models
automatic adaptation
elastic parameters
Kalman filter framework
shape estimation
physics-based modeling techniques
elastic degrees of freedom
state equations
extended Kalman filter
geometric degrees of freedom


An exactly solvable random satisfiability problem

Abstract: We introduce a new model for the generation of random satisfiability problems. It is an extension of the hyper-SAT model of Ricci-Tersenghi, Weigt and Zecchina (2001), which is a variant of the famous K-SAT model: it is extended to q-state variables and relates to a different choice of the statistical ensemble. The model has an exactly solvable statistic: the critical exponents and scaling functions of the SAT/UNSAT transition are calculable at zero temperature, with no need of replicas, also with exact finite-size corrections. We also introduce an exact duality of the model, and show an analogy of thermodynamic properties with the random energy model of disordered spin system theory. Relations with error correcting codes are also discussed

an exactli solvabl random satisfi problem
 we introduc a new model for the gener of random satisfi problem . it is an extens of the hyper-sat model of ricci-tersenghi , weigt and zecchina ( 2001 ) , which is a variant of the famou k-sat model : it is extend to q-state variabl and relat to a differ choic of the statist ensembl . the model ha an exactli solvabl statist : the critic expon and scale function of the sat / unsat transit are calcul at zero temperatur , with no need of replica , also with exact finite-s correct . we also introduc an exact dualiti of the model , and show an analog of thermodynam properti with the random energi model of disord spin system theori . relat with error correct code are also discuss


The use of subtypes and stereotypes in the UML model

Abstract: Based on users' experiences of Version 1.3 of the Unified Modeling Language (UML) of the Object Management Group (OMG), a Request For Information in 1999 elicited several responses which were asked to identify "problems" but not to offer any solutions. One of these responses is examined for "problems" relating to the UML metamodel and here some solutions to the problems identified there are proposed. Specifically, we evaluate the metamodel relating to stereotypes versus subtypes; the various kinds of Classifier (particularly Types, Interfaces and Classes); the introduction of a new subtype for the whole part relationship; as well as identifying areas in the metamodel where the UML seems to have been used inappropriately in the very definition of the UML's metamodel

the use of subtyp and stereotyp in the uml model
 base on user ' experi of version 1.3 of the unifi model languag ( uml ) of the object manag group ( omg ) , a request for inform in 1999 elicit sever respons which were ask to identifi " problem " but not to offer ani solut . one of these respons is examin for " problem " relat to the uml metamodel and here some solut to the problem identifi there are propos . specif , we evalu the metamodel relat to stereotyp versu subtyp ; the variou kind of classifi ( particularli type , interfac and class ) ; the introduct of a new subtyp for the whole part relationship ; as well as identifi area in the metamodel where the uml seem to have been use inappropri in the veri definit of the uml 's metamodel

subtypes
stereotypes
UML model
Unified Modeling Language
Object Management Group
Request For Information
Classifier
whole part relationship


Active vibration control of composite sandwich beams with piezoelectric extension-bending and shear actuators

Abstract: We have used quasi-static equations of piezoelectricity to derive a finite element formulation capable of modelling two different kinds of piezoelastically induced actuation in an adaptive composite sandwich beam. This formulation is made to couple certain piezoelectric constants to a transverse electric field to develop extension-bending actuation and shear-induced actuation. As an illustration, we present a sandwich model of three sublaminates: face/core/face. We develop a control scheme based on the linear quadratic regulator/independent modal space control (LQR/IMSC) method and use this to estimate the active stiffness and the active damping introduced by shear and extension-bending actuators. To assess the performance of each type of actuator, a dynamic response study is carried out in the modal domain. We observe that the shear actuator is more efficient in actively controlling the vibration than the extension-bending actuator for the same control effort

activ vibrat control of composit sandwich beam with piezoelectr extension-bend and shear actuat
 we have use quasi-stat equat of piezoelectr to deriv a finit element formul capabl of model two differ kind of piezoelast induc actuat in an adapt composit sandwich beam . thi formul is made to coupl certain piezoelectr constant to a transvers electr field to develop extension-bend actuat and shear-induc actuat . as an illustr , we present a sandwich model of three sublamin : face / core / face . we develop a control scheme base on the linear quadrat regul / independ modal space control ( lqr / imsc ) method and use thi to estim the activ stiff and the activ damp introduc by shear and extension-bend actuat . to assess the perform of each type of actuat , a dynam respons studi is carri out in the modal domain . we observ that the shear actuat is more effici in activ control the vibrat than the extension-bend actuat for the same control effort

piezoelectricity
shear actuators
quasi-static equations
finite element formulation
piezoelastically
adaptive composite sandwich beam
piezoelectric constants
transverse electric field
extension-bending actuation
extension-bending actuation
shear-induced actuation
sandwich model
sublaminates
linear quadratic regulator
modal space control
active stiffness
active damping
dynamic response
modal domain
finite element procedure
extension-bending actuators

P P P P P P P P P P P P P P P P P P P M P


Extrapolation in Lie groups with approximated BCH-formula

Abstract: We present an extrapolation algorithm for the integration of differential equations in Lie groups which is a suitable generalization of the well-known GBS-algorithm for ODEs. Sufficiently accurate approximations to the BCH-formula are required to reach a given order. We give such approximations with a minimized number of commutators

extrapol in lie group with approxim bch-formula
 we present an extrapol algorithm for the integr of differenti equat in lie group which is a suitabl gener of the well-known gbs-algorithm for ode . suffici accur approxim to the bch-formula are requir to reach a given order . we give such approxim with a minim number of commut

Lie groups
approximated BCH-formula
differential equations
GBS-algorithm
geometric integration
extrapolation methods