Specifying Data-Flow Requirements for the Automated Composition of Web Services

Size: px
Start display at page:

Download "Specifying Data-Flow Requirements for the Automated Composition of Web Services"

Transcription

1 Specifying Dt-Flow Requirements for the Automted Composition of We Services Annpol Mrconi ITC-Irst - Trento - Itly mrconi@itc.it Mrco Pistore University of Trento - Itly pistore@dit.unitn.it Polo Trverso ITC-Irst - Trento - Itly trverso@itc.it Astrct One of the fundmentl ides of We Services nd Service Oriented Architecture is the possiility to develop new pplictions y composing existing services tht re ville on the We. Severl pproches hve een proposed to tckle the prolem of We Service Composition, ut little effort hs een devoted so fr to the prolem of modeling the requirements of the composition. However, it is cler tht the possiility to express requirements specifying complex interctions ptterns mong the component services is n essentil step to cope with wide rnge of composition prolems. In this pper we present new model which ddresses one of the key spects of composition requirements, nmely the dt flow mong the component services. We develop grphicl nottions nd forml theory for the new model nd we integrte it within n existing utomted composition frmework. 1 Introduction We services re pltform-independent pplictions tht export description of their functionlities nd re ccessile using stndrd network technologies. We services re le to perform wide spectrum of ctivities, from simple receive-response protocols to complicted usiness workflows, nd provide the sis for the development nd execution of usiness processes tht re distriuted over the network. One of the fundmentl ides of We services is the possiility to develop new pplictions y composing existing services tht re ville on the We. The mnul development of the new composite service is often difficult nd error-prone tsk, ecuse humn domin experts hve to tke cre of ll the contingencies tht cn hppen during the service execution process. The ility to support the composition of We services with utomted nd This work is prtilly funded y the MIUR-FIRB project RBNE0195K5 KLASE, y the MIUR-PRIN 2004 project STRAP, nd y the EU-IST project FP SENSORIA. semi-utomted tools is n essentil step to decrese time nd costs in the development, integrtion, nd mintennce of complex services. Severl methods hve een proposed to cope with the utomted composition prolem (see e.g. [10, 9, 11, 13, 7, 2]). In ll those methods, the existing component services re used to define domin to e controlled, composition requirements specify the desired ehviors tht should e enforced on the domin, nd the composition tsk corresponds to synthesize controller for the domin tht relized the desired ehvior. It is widely recognized tht, in generl, utomted synthesis is hrd prolem, oth in theory nd in prctice (see, e.g. [15]). In the cse of We service composition, however, utomted synthesis turns out to e fesile not only in principle, ut lso in prctice on relistic domins of significnt complexity. Indeed, in this setting the synthesized controller hs simply to ct s n orchestrtor which controls nd directs the execution of the existing services, ut delegtes to the services the other computtionl tsks. One of the key spects of We service composition is how to derive nd model composition requirements. It is cler tht, in order to cope with wide rnge of rel composition prolems, we need wy to express complex requirements on the exchnged dt nd on the executions of the component services. Moreover, to mke the utomted composition n effective nd prcticl tsk, the requirements specifiction should e esy to write nd to understnd for the nlyst. Surprisingly, very little effort hs een devoted in the literture to ddress this prolem. In this pper we present new model which ddresses one of the key spects of composition requirements, nmely the dt flow mong the component services. We propose to specify the requirements on the dt flow through set of constrints tht define the vlid routings nd mnipultions of messges tht the orchestrtor cn perform. These constrints cn e descried in grphicl wy, s dt net, i.e., s grph where the input/output ports of the existing services re modeled s nodes, the pths in the grph define the possile routes of the messges, nd the rcs de-

2 fine sic mnipultions of these messges performed y the orchestrtor. In the pper, we develop the forml definition nd the grphicl nottions of dt nets. Moreover, we show how to integrte dt flow requirements expressed s dt nets within n existing utomted composition frmework [13, 14, 12]. Finlly, we show tht the proposed pproch cn hndle relistic composition prolems of significnt complexity. The rest of the document is orgnized s follows. In Section 2 we descrie the prolem of We service composition nd we illustrte the necessity to define complex dt flow requirements. In Section 3 we introduce dt nets nd we formlly define their semntics y descriing the requirements tht dt net defines on the possile ehviors of We service composition. In Section 4 we discuss how dt nets cn e integrted in the utomted composition frmework proposed in [13, 14, 12]. Finlly, Section 5 concludes the pper with relted work nd finl remrks. 2 We Service Composition: A Scenrio By utomted composition of We services we men the genertion of new composite service tht intercts with set of existing component services in order to stisfy given composition requirements. More specificlly, we will ssume tht component services re descried s BPEL4WS processes. 1 Given the descriptions of the component processes nd the composition requirements, we utomticlly generte new BPEL4WS process implementing the required composition. In this section we illustrte on cse study the prolem of the utomted composition of We services. We will focus in prticulr on the prolem of specifying the requirements of such composition. Exmple 1 (Virtul Trvel Agency) Our reference exmple consists in providing virtul trvel gency service, sy the VTA service, which offers holidy pckges to potentil customers, y comining three seprte existing services: flight ooking service Flight, hotel ooking service Hotel, nd service tht provides mps AllMps. The ide is tht of comining these three services so tht the customer my directly interct with the composed service VTA to orgnize nd possily ook his holidy pckge. In the following, we descrie informlly the three ville services, whose interction protocols re depicted in 1 BPEL4WS (Business Process Execution Lnguge for We Services) [1] is n industril lnguge for the specifiction nd execution of usiness processes mde ville thorough We services. In this pper we ssume tht component nd composite services re expressed in BPEL4WS. However, the descried pproch does not depend on the specific spects of the BPEL4WS lnguge. The pper should e understndle lso for reders who re not fmilir with BPEL4WS. Figure 1 2. Hotel ccepts requests for providing informtion on ville hotels for given dte nd given loction. If there re hotels ville, it chooses prticulr hotel nd return n offer with cost nd other hotel informtion. This offer cn e ccepted or refused y the externl service tht hs invoked the Hotel. In cse of refusl, the requester cn either request n offer for different hotel, or terminte the interction with the Hotel. The Flight service receives requests for ooking flights for given dte nd loction. If there re ville flights, it sends n offer with cost nd flight schedule. The client cn either ccept or refuse the offer. If he decides to ccept, the Flight will ook the flight nd provide dditionl informtion such s n electronic ticket. The AllMps service receives requests with two loctions nd provides digitl mp depicting distnce informtion. Intuitively, the VTA service should try to stisfy given customer request y providing informtion on ville flights nd hotels (e.g., holidy cost, flight schedule, hotel description nd mp showing distnce from the irport) nd ook the holidy ccording to customer finl decision. Figure 2 descries possile protocol tht the VTA could expose to the customer. According to it, the customer sends request for n holidy, then, if there is n ville flight, it receives flight offer. If the customer grees on the flight schedule nd cost nd there is n ville hotel, he receives n hotel offer consisting of the hotel cost, the distnce of the hotel from the irport nd other informtion out the hotel. The customer cn either decide to ccept the offer, or to sk for different hotel offer, or to terminte the interction with the VTA. If he decides to ccept, he receives the ooking confirmtion with the overll holidy cost nd other informtion out the chosen hotel nd flight. Given the description of the component services nd of the customer interfce, the next step towrds the definition of the utomted composition domin is the forml specifiction of the composition requirements. As we will see from the exmples presented in the rest of this section, even for simple cse studies we need wy to express requirements tht define complex conditions, oth for wht concerns the control flow nd for the dt exchnged mong the component services. Exmple 2 (Control-flow requirements) The VTA service min gol is to sell holidy pckges. This mens we wnt the VTA to rech sitution where the customer hs ccepted the offer nd flight nd hotel hve een ooked. However, it my e the cse tht there re no ville flights (or no ville hotels) stisfying the customer 2 In the figure, lels of input trnsitions strt with?, lels of output trnsitions strt with!, other trnsitions correspond to internl opertions performed y the services.

3 HOTEL BOOKING SERVICE FLIGHT BOOKING SERVICE START? request(dte,loc)? request(dte,loc) check_vil(dte,loc) check_vil(dte,loc) ALL_MAPS SERVICE! not_vil!offer(cost, hotel_info)! not_vil!offer(cost, schedule)! info(mp) START? request(from_loc, to_loc) NOT_AVAIL NOT_AVAIL CANCELED? cncel? ck? other? ck? cncel CANCELED! ooked! ooked(info) BOOKED BOOKED Figure 1. The Virtul Trvel Agency Component Services CUSTOMER INTERFACE! request(dte, loc)? f_not_vil? f_offer(cost, schedule) F_NOT_AVAIL! cncel! f_ck F_REFUSED? h_not_vil? h_offer(cost, hotel, dist_mp) H_NOT_AVAIL! other! cncel! h_ck H_REFUSED? ooked(cost, info) BOOKED Figure 2. The VTA Customer Interfce Exmple 3 (Dt-flow requirements) In order to provide consistent informtion, the VTA service needs to exchnge dt with the components nd its customer in n pproprite wy. For instnce, when invoking the Flight service, the informtion out the loction nd dte of the flight must e the sme ones tht the VTA received in the customer request; similrly, the informtion sent to the customer out the distnce etween the proposed hotel nd the irport must e those otined from the lst interction with the AllMps service; nd such service must receive the informtion on the irport nd hotel loction ccording to the lst offer proposed y the Hotel service. Moreover, the cost proposed to the customer for the holidy pckge must e the sum of the hotel nd flight cost plus some dditionl fee for the trvel gency service; thus the cost offered to the customer must e computed y mens of function internl to the VTA service. And so on. request, or tht the customer doesn t like the flight or the hotel offer nd thus cncels the ooking. We cnnot void these situtions, therefore we cnnot sk the composite service to gurntee this requirement. In cse this requirement cnnot e stisfied, we do not wnt the VTA to ook flight (nor hotel) without eing sure tht our customer ccepted the offer, s well s we do not wnt displesed customers tht hve ooked holidys for which there re no ville flights or hotels. Thus, our glol termintion requirement would e something like: do whtever is possile to sell holidy pckges nd if something goes wrong gurntee tht there re no single commitments. This termintion requirement is only prtil specifiction of the constrints tht the composition should stisfy. Indeed, we need to specify lso complex requirements on the dt flow. The exmple shows tht, even for pprently simple composition prolems, we need wy to express complex dt flow requirements: from simple dt links etween incoming nd outgoing messge prts (e.g., forwrding the informtion received y the customer out the loction to the Flight service), to the specifiction of complex dt mnipultion (e.g., when computing the holidy pckge cost), to more sutle requirements concerning dt (e.g., ll the time the VTA invokes the AllMps service it must send the loction informtion of the lst hotel offer received, while the sme irport loction informtion cn e used more thn once). The reserch chllenge we ddress in this pper is the definition of modeling lnguge tht llows to cpture dt-flow composition requirements for relistic composition prolems.

4 3 Modeling Dt Flow Requirements The im of the dt flow modeling lnguge is to llow for the specifiction of complex requirements concerning dt mnipultion nd exchnge. In prticulr, dt flow requirements specify how output messges (messges sent to component services) re otined from input messges (messges received from component services). This includes severl importnt spects: whether n input messge cn e used severl times or just once, how severl input messges must e comined to otin n output messge, whether ll messges received must e processed nd sent, etc Syntx In the following we descrie the sic elements of the lnguge, show how they cn e composed to otin complex expressions nd provide n intuitive semntics. Connection Node A connection node cn e externl or internl. An externl connection node is ssocited to n output (or n input) externl port. Intuitively, n externl input (output) node chrcterizes n externl source (trget) of dt nd it is used to exchnge dt with the outside world. Identity It is connected to one connection node in input nd one node in output. The requirement sttes tht dt received from the input node should e forwrded to the output node. The grphicl nottion for the dtflow identity element id()(), with input node nd output node, is the following:! Opertion It is relted to function definition; it is connected to s mny input nodes s the numer of function prmeters nd only to one output node corresponding to the function result. The requirement sttes tht, when dt is received from ll the input nodes, the result of the opertion should e forwrded to the output node. The grphicl nottion for the dt-flow opertion element oper[f](,)(c) chrcterizing function f, with input nodes nd nd output node c, is the following: Fork It is connected to node in input nd to s mny nodes s necessry in output. It forwrds dt received on the input node to ll the output nodes. The grphicl nottion for the dt-flow fork element fork()(,c), with input node nd output nodes nd c, is the following: Merge It is connected to one node in output nd s mny nodes s necessry in input. It forwrds dt received on some input node to the output node. It preserves the temporl order of dt rriving on input nodes (if it receives dt on two or more input nodes t the sme time, the order is nondeterministic). We represent the dt-flow merge element merge(,)(c), with input nodes nd nd output node c s: Cloner It is connected to one node in input nd one node in output. It forwrds, one or more times, dt received from the input node to the output node. The dt-flow cloner element clone()(), with input node nd output node is represented s: f + Filter It is connected to one node in input nd one node in output. When it receives dt on the input node, it either forwrds it to the output node or discrds it. We represent the dt-flow filter element filt()(), hving input node nd output node s:? Lst It is connected to one node in input nd one node in output. It requires tht t most one dt is forwrded to the output node: the lst dt received on the input c c c

5 C.request.dte! F.request.dte C.request.loc F.request.loc H.request.loc H.offer.cost F.offer.cost L prep_cost C.h_offer.cost C.ooked.cost C.f_offer.cost get_dte H.request.dte F.offer.schedule C.f_offer.schedule get_irport + M.request.from_loc get_loc M.request.to_loc H.offer.info C.h_offer.hotel F.ooked.info L prep_info C.ooked.info M.info.mp! C.h_offer.dist_mp Figure 3. The dt flow requirements for the Virtul Trvel Agency node. All other dt tht re received should e discrded. The grphicl nottion for the dt-flow lst element lst()(), with input node nd output node, is the following: The digrm otined y suitly composing dt-flow elements y mens of connection nodes is clled dt net (see Figure 3 for n exmple). A dt net is chrcterized y set of externl connection nodes ssocited to input ports Next, I set of externl connection nodes ssocited to output ports Next, O set of internl connection nodes N int, set of dt-flow elements D (corresponding to the sic elements descried in this section) nd set of dt vlues V. Given dt-flow element d, we denote with in nodes(d) the set of input connection nodes of d nd with out nodes(d) the set of output connection nodes of d. Definition 1 (Dt Net) A dt net D is tuple N I ext, N O ext, N int, D, V where: L for ech n N I ext there exists unique dt-flow element d D s.t. n in nodes(d); for ech n N O ext there exists unique dt-flow element d D s.t. n out nodes(d); for ech n N int there exists unique dt-flow element d 1 D s.t. n in nodes(d 1 ) nd there exists unique dt-flow element d 2 D s.t. n out nodes(d 2 ); for ech d D, in nodes(d) N I ext N int nd out nodes(d) N O ext N int. Notice tht it is possile to ssocite type to ech connection node in the network. Indeed, externl nodes inherit the types from the corresponding BPEL4WS ports, nd the types of internl nodes cn e deduced from the structure of the dt net. We do not consider this spect to mke the formliztion more understndle; completing the model to hndle typed connection nodes is strightforwrd. A possile specifiction of the dt net for the Virtul Trvel Agency exmple is presented in Figure 3, which we will (prtilly) explin in the following exmple. Exmple 4 When the VTA receives request from the Customer, it must forwrd the dte informtion to the Flight nd the loc informtion oth to the Flight nd to the Hotel. To otin the cost to e sent in the offer to the Customer, the VTA must pply its internl function prep cost on the cost received in the offer from the Flight nd on the cost informtion in the lst offer received from the Hotel. The VTA must otin the dte informtion tht it sends in the request to the Hotel y computing its internl function get dte on the schedule received in the offer of the Flight. The schedule received in the offer of the Flight is lso forwrded to the client, s prt of the f offer messge. Finlly, the VTA exploits the internl function get irport

6 on the flight schedule to otin the from loc informtion to e sent to the AllMps; the VTA cn use this sme informtion to send severl requests to the AllMps. And so on. 3.2 Semntics We now formlize the semntics of the dt flow modeling lnguge. Given dt net D = Next, I Next, O N int, D, V, we denote with N ext the sets of ll externl connection nodes, formlly N ext = Next I Next. O An event e of D is couple n, v, where n N ext N int, nd v V, which models the fct tht the dt vlue v psses through the connection node n. An execution ρ of D is finite sequence of events e 0,..., e n. Given n execution ρ we define its projection on set of connection nodes N N ext N int, nd denote it with Π N (ρ), the ordered sequence e 0,..e m representing the events in ρ which correspond to nodes in N. We formlly define the semntics of our lnguge in terms of ccepted executions of dt net D. In the following definition, we exploit regulr expressions to define the ccepted execution. We use nottion Σ to express lterntives tht rnge over ll the possile vlues v V tht cn flow thorough the net. Definition 2 (dt net ccepting execution) An execution ρ is ccepted y dt net D = N I ext, N O ext, N int, D, V if it stisfies ll the following properties: for ech identity element id()() in D: ( Π {,} (ρ) =, v, v ) for ech opertion element oper[f](,)(c) in D: v,w V Π {,,c} (ρ) = (, v, w +, w, v ) c, f(v, w) for ech fork element fork()(,c) in D: Π {,,c} (ρ) = (, v (, v c, v + c, v, v ) ) for ech merge element merge(,)(c) in D: ( Π {,,c} (ρ) = (, v c, v +, v c, v ) for ech cloner element clone()() in D: ( ) Π {,} (ρ) =, v, v, v for ech filter element filt()() in D: ( Π {,} (ρ) =, v (, v + ɛ) for ech lst element lst()() in D: ) ) ( ( ) Π {,} (ρ) =, v ), v, v + ɛ Notice tht this definition considers dt net elements hving t most two input/output nodes, however it cn esily e extended to hndle elements of the dt net hving more input/output nodes. 3.3 Dt Net Stisfiility A dt net cn e used to specify the desired ehvior of service or everything tht concerns the exchnge of dt with its communiction prtners. In prticulr, s shown in the dt net of Figure 3, externl connection nodes re ssocited to input (or output) ports which model BPEL4WS messges, or messge prts, which re used to store dt received (or sent) y the process while intercting with other services. Since the ehviorl spect we re interested in concerns the dt flow mong the process nd its prtners, we chrcterize n execution of BPEL4WS process W, denoted with exec(w ), s the set of ll possile ordered sequence of input/output messges (or messge prts) received nd sent y the process from its ctivtion to its termintion. Notice tht ech messge crries oth the informtion out the externl port on which it hs een sent/received nd out its content (vlue). Definition 3 (dt net stisfiility) Let W e BPEL4WS process nd D = N I ext, N O ext, N int, D, V dt net. We sy tht W stisfies D if for ech process execution ρ W exec(w ) there exists n ccepting execution ρ of D such tht Π Next (ρ) = ρ W.

7 4 Automted Composition of We Services In this section we show how dt nets cn e integrted in generl frmework for the utomted composition of We services. 4.1 An Automted Composition Frmework The work in [13] (see lso [14, 12]) presents forml frmework for the utomted composition of We services which is sed on plnning techniques: component services define the plnning domin, composition requirements re formlized s plnning gol, nd plnning lgorithms re used to generte the composite service. The frmework of [13] differs from other plnning frmeworks since it ssumes n synchronous, messge-sed interction etween the domin (encoding the component services) nd the pln (encoding the composite service). We now recll the most relevnt fetures of the frmework defined in [13]. The composition domin is modeled s stte trnsition system (STS from now on) which descries dynmic system tht cn e in one of its possile sttes (some of which re mrked s initil sttes nd/or s finl sttes) nd cn evolve to new sttes s result of performing some ctions. Actions re distinguished in input ctions, which represent the reception of messges, output ctions, which represent messges sent to externl services, nd internl ctions, which represent internl evolutions tht re not visile to externl services, i.e., dt computtion tht the system performs without intercting with externl services. A trnsition reltion descries how the stte cn evolve on the sis of inputs, outputs, or internl ctions. Definition 4 (stte trnsition system (STS)) A stte trnsition system Σ is tuple S, S 0, I, O, A, R, F where: S is the finite set of sttes; S 0 S is the set of initil sttes; I is the finite set of input ctions; O is the finite set of output ctions; A is the finite set of internl ctions; R S (I O A) S is the trnsition reltion; F S is the set of finl sttes. We hve defined trnsltion tht ssocites stte trnsition system to ech component service, strting from its BPEL4WS specifiction. We omit the forml definition of the trnsltion, which cn e found t Intuitively, input ctions of the STS represent messges received from the component services, output ctions re messges sent to the component services, internl ctions model ssignments nd other opertions which do not involve communictions, nd the trnsition reltion models the evolution of the service. Exmples of the STS representtion of BPEL4WS component services cn e found in Figure 1. The utomted synthesis prolem consists in generting stte trnsition system Σ c tht, once connected to Σ, stisfies the composition requirements. We now recll the definition of the stte trnsition system descriing the ehvior of Σ when connected to Σ c. Definition 5 (Controlled system) Let Σ = S, S 0, I, O, A, R, F nd Σ c = S c, Sc 0, I c, O c, A, R c, F c e two stte trnsition systems such tht I = O c nd O = I c. The stte trnsition system Σ c Σ, descriing the ehviors of system Σ when controlled y Σ c, is defined s follows: Σ c Σ = S c S, S 0 c S 0, I, O, A, R c R, F c F, where: (s c, s),, (s c, s ) (R c R), if s c,, s c R c nd s,, s R In n utomted synthesis prolem, the composition requirements re formlized s specifiction ρ, nd the composition tsk consists in generting Σ c tht gurntees tht the controlled system Σ c Σ stisfies the requirement ρ, written Σ c Σ = ρ. In [13], ρ is formlized using EA- GLE, requirement lnguge which llows to specify conditions of different strengths (like try nd do ), nd preferences mong different (e.g., primry nd secondry) requirements. EAGLE opertors re similr to CTL opertors, ut their semntics, formlly defined in [6], tkes into ccount the notion of preference nd the hndling of filure when sugols cnnot e chieved. Exmple 5 The EAGLE formliztion of the control-flow requirements in Exmple 2 is the following. TryRech C.BOOKED F.BOOKED H.BOOKED M.SUCC Fil DoRech (C.F NOT AVAIL C.F REFUSED C.H NOT AVAIL C.H REFUSED) (H.NOT AVAIL H.CANCELED H.START) (F.NOT AVAIL F.CANCELED) (M.START) The gol is of the form TryRech c Fil DoRech d. TryRech c requires service tht tries to rech condition

8 c, in our cse the condition sell holidy pckges. During the execution of the service, stte my e reched from which it is not possile to rech c, e.g., since the product is not ville. When such stte is reched, the requirement TryRech c fils nd the recovery condition DoRech d, in our cse no single commitments is considered. The definition of whether ρ is stisfied is given in terms of the executions tht Σ c Σ cn perform. Given this, we cn chrcterize formlly n utomted synthesis prolem. Definition 6 (Automted Synthesis) Let Σ e stte trnsition system, nd let ρ e n EA- GLE formul defining composition requirement. The utomted synthesis prolem for Σ nd ρ is the prolem of finding stte trnsition system Σ c such tht Σ c Σ = ρ. The work in [13] shows how to dpt to this tsk the Plnning s Model Checking pproch, which is le to del with lrge nondeterministic domins nd with requirements expressed in EAGLE. It exploit powerful BDD-sed techniques developed for Symolic Model Checking to efficiently explore domin Σ during the construction of Σ c. 4.2 Dt Requirements s STSs As we hve seen in previous sections, dt net D of prticulr composition prolem specifies how messges received from the component services cn e used y the new composite process to generte outgoing messges. Therefore, it is possile to represent D s STS Σ D, which models the llowed dt flow ctions. In prticulr, input ctions in Σ D represent messges received y the component services, output ctions represent messges sent y the component services nd internl ctions represent ssignments tht the composite process performs on its internl vriles. We ssume tht, in the BPEL4WS specifiction of the composite service, vrile will exist for ech connection node in D; vriles ssocited to externl connection nodes re those used y the new composite process to store received messges nd to prepre the messges to e sent, while vriles ssocited to internl connection nodes re those used to mnipulte messges y mens of internl functions nd ssignments. Then Σ D defines constrints on the possile opertions tht the composite process cn perform on these vriles. A nice feture of our pproch is tht this cn e done compositionlly, i.e., smll utomton cn e ssocited to ech element of the dt net, nd STS Σ D is otined s the product of ll these smll utomt. More precisely, for ech output opertion of component service, which is ssocited to some externl input port in the dt net, we define STS which represents the sending of the messge (s n output ction) nd the storing of ll messge prts (s internl ctions). As n exmple, considering the VTA composition prolem, for the output opertion C.request with messge prts dte nd loc we define the following STS: 3 C.request.loc >C_request_loc!C.request C.request.dte >C_request_dte Similrly, for ech input opertion of component service, which is ssocited to some externl output port in the dt net, we define STS which represents the storing of ll messge prts (s internl ctions) nd the reception of the messge (s n input ction). As n exmple, for the input opertion C.ooked with messge prts info nd cost we define the following STS:?C.ooked x >C_ooked_cost x >C_ooked_info x >C_ooked_info x >C_ooked_cost?C.ooked Finlly, we define STS for ech dt-flow element of the dt net. These STSs hve no input/ouput ctions since they model mnipultion of vriles through ssignments. In prticulr: for ech identity element id()() in the dt net we define the following STS: for ech opertion element oper[f](,)(c) in the dt net we define the following STS: 3 In the STS tht we use to model dt net requirements, we represent input opertions y? followed y the opertion nme, output ctions y! followed y the opertion nme, while internl ctions, denoted with ->, model n internl opertion tht copies the vlue of in vrile. We use x s plce-holder for ritrry nodes/expression: so for instnce x-> denotes ll internl ctions copying ny vrile/expression to vrile, nd similrly for ->x. Finl sttes re mrked with n internl circle.

9 x > x > f(,) >c The STS Σ D modeling the dt net D is the synchronized product of ll the STSs corresponding to externl connection nodes nd to dt-flow elements of D. The synchronized product Σ 1 Σ 2 models the fct tht the systems Σ 1 nd Σ 2 evolve simultneously on common ctions nd independently on ctions elonging to single system. for ech fork element fork()(,c) in the dt net we define the following STS: >c >c for ech merge element merge(,)(c) in the dt net we define the following STS: >c x > >c for ech cloner element clone()() in the dt net we define the following STS: 4.3 Generting the Composite Process We re redy to show how we cn integrte the proposed composition pproch within the utomted composition frmework presented in Section 4.1. Given n component services W 1,..., W n nd dt net D modeling the dtflow composition requirements, we encode ech component service W i s STS Σ Wi nd the dt net D s STS Σ D. The composition domin Σ for the utomted composition prolem is the synchronized product of ll these STSs. Formlly, Σ = Σ D Σ W1.. Σ Wn. The plnning gol ρ is the EAGLE formliztion of the composition termintion requirements, enriched with the requirements tht ll the dt flow STS need to terminte in finl stte. Given the domin Σ nd the plnning gol ρ we cn pply the pproch presented in [13] to generte controller Σ c, which is such tht Σ c Σ = ρ. Once the stte trnsition system Σ c hs een generted, it is trnslted into BPEL4WS to otin the new process which implements the required composition. The trnsltion is conceptully simple; intuitively, input ctions in Σ c model the receiving of messge from component service, output ctions in Σ c model the sending of messge to component service, internl ctions model mnipultion of dt y mens expressions nd ssignments. for ech filter element filt()() in the dt net we define the following STS: for ech lst element lst()() in the dt net we define the following STS: 5 Conclusions nd Relted Work In the pper we hve descried new model for defining dt flow requirements for the utomted composition of We services. Its interesting fetures re the possiility to exploit esy to understnd grphicl nottions nd to model the requirements in dt net, s well s the possiility to integrte the requirements in generl frmework for the utomted composition of We services. Future work will include the implementtion of grphicl tool for drwing the requirements nd its inclusion in the AS- TRO toolset ( nd its experimentl evlution. Severl methodologies hve een proposed to model different spects of requirements for service oriented pplictions, from gol-oriented pproches, see, e.g., [8, 5], to UML-sed oject-oriented methodologies, see, e.g., [17]. In these works, high-level requirements re used to guide nd construct y hnd the composition. The prolem of the utomted synthesis of compositions is not ddressed.

10 These methodologies cn e integrted with our pproch nd used in pre-nlysis step to guide the nlyst to the definition of the dt net tht we use to generte utomticlly the composition. Most of the works tht ddress the prolem of the utomted synthesis of process-level compositions do not tke into ccount dt flow specifictions. This is the cse of the work on synthesis sed on utomt theory tht is proposed in [7, 2, 3], nd of work within the semntic we community, see, e.g., [10]. Some other pproches, see, e.g., [16], re limited to simple composition prolems, where component services re either tomic nd/or deterministic. The work closest to ours is the one descried in [4], which proposes n pproch to service ggregtion tht tkes into ccount dt flow requirements. The min difference is tht dt flow requirements in [4] re much simpler nd t lower level thn in our frmework, since they express direct identity routings of dt mong processes, nd do not llow for mnipultions of dt. The exmples reported in this pper clerly show the need for expressing mnipultions in dt-flow requirements nd higher level requirements. [12] M. Pistore, A. Mrconi, P. Trverso, nd P. Bertoli. Automted Composition of We Services y Plnning t the Knowledge Level. In Proc. IJCAI 05, [13] M. Pistore, P. Trverso, nd P. Bertoli. Automted Composition of We Services y Plnning in Asynchronous Domins. In Proc. ICAPS 05, [14] M. Pistore, P. Trverso, P. Bertoli, nd A.Mrconi. Automted Synthesis of Composite BPEL4WS We Services. In Proc. ICWS 05, [15] A. Pnueli nd R. Rosner. Distriuted rective systems re hrd to synthesize. In Proc. of IEEE Symp. of Foundtions of Computer Science, [16] S. Ponneknti nd A. Fox. SWORD: A Developer Toolkit for We Service Composition. In Proc. WWW 02, [17] D. Skogn, R. Gronmo, nd I. Solheim. We Service Composition in UML. In Proc. EDOC 04, References [1] T. Andrews, F. Curer, H. Dolki, J. Golnd, J. Klein, F. Leymnn, K. Liu, D. Roller, D. Smith, S. Thtte, I. Trickovic, nd S. Weervrn. Business Process Execution Lnguge for We Services (version 1.1), [2] D. Berrdi, D. Clvnese, G. D. Gicomo, M. Lenzerini, nd M. Mecell. Automtic composition of E-Services tht export their ehviour. In Proc. ICSOC 03, [3] D. Berrdi, D. Clvnese, G. D. Gicomo, nd M. Mecell. Composition of Services with Nondeterministic Oservle Behviour. In Proc. ICSOC 05, [4] A. Brogi nd R. Popescu. Towrds Semi-utomted Workflow-Bsed Aggregtion of We Services. In Proc. IC- SOC 05, [5] E. Colomo, J. Mylopolous, nd P. Spoletini. Modeling nd Anlyzing Context-Awre Compositions of Services. In Proc. ICSOC 05, [6] U. Dl Lgo, M. Pistore, nd P. Trverso. Plnning with Lnguge for Extended Gols. In Proc. AAAI 02, [7] R. Hull, M. Benedikt, V. Christophides, nd J. Su. E- Services: A Look Behind the Curtin. In Proc. PODS 03, [8] D. Lu nd J. Mylopoulos. Designing We Services with Tropos. In Proc. ICWS 04, [9] S. McIlrith nd R. Fdel. Plnning with Complex Actions. In Proc. NMR 02, [10] S. McIlrith nd S. Son. Adpting Golog for Composition of Semntic We Services. In Proc. KR 02, [11] S. Nrynn nd S. McIlrith. Simultion, Verifiction nd Automted Composition of We Services. In Proc. WWW 02, 2002.

On the Description of Communications Between Software Components with UML

On the Description of Communications Between Software Components with UML On the Description of Communictions Between Softwre Components with UML Zhiwei An Dennis Peters Fculty of Engineering nd Applied Science Memoril University of Newfoundlnd St. John s NL A1B 3X5 zhiwei@engr.mun.c

More information

Service Composition and Synthesis The Roman Model

Service Composition and Synthesis The Roman Model Service Composition nd Synthesis The Romn Model Giuseppe De Gicomo SAPIENZA Università di Rom, Itly Joint work with Dniel Berrdi, Mssimilino de Leoni, Diego Clvnese, Fhim Cheikh, Rick Hull, Murizio Lenzerini,

More information

Math Circles Finite Automata Question Sheet 3 (Solutions)

Math Circles Finite Automata Question Sheet 3 (Solutions) Mth Circles Finite Automt Question Sheet 3 (Solutions) Nickols Rollick nrollick@uwterloo.c Novemer 2, 28 Note: These solutions my give you the nswers to ll the prolems, ut they usully won t tell you how

More information

Dataflow Language Model. DataFlow Models. Applications of Dataflow. Dataflow Languages. Kahn process networks. A Kahn Process (1)

Dataflow Language Model. DataFlow Models. Applications of Dataflow. Dataflow Languages. Kahn process networks. A Kahn Process (1) The slides contin revisited mterils from: Peter Mrwedel, TU Dortmund Lothr Thiele, ETH Zurich Frnk Vhid, University of liforni, Riverside Dtflow Lnguge Model Drsticlly different wy of looking t computtion:

More information

Geometric quantities for polar curves

Geometric quantities for polar curves Roerto s Notes on Integrl Clculus Chpter 5: Bsic pplictions of integrtion Section 10 Geometric quntities for polr curves Wht you need to know lredy: How to use integrls to compute res nd lengths of regions

More information

MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES

MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES Romn V. Tyshchuk Informtion Systems Deprtment, AMI corportion, Donetsk, Ukrine E-mil: rt_science@hotmil.com 1 INTRODUCTION During the considertion

More information

CHAPTER 3 AMPLIFIER DESIGN TECHNIQUES

CHAPTER 3 AMPLIFIER DESIGN TECHNIQUES CHAPTER 3 AMPLIFIER DEIGN TECHNIQUE 3.0 Introduction olid-stte microwve mplifiers ply n importnt role in communiction where it hs different pplictions, including low noise, high gin, nd high power mplifiers.

More information

Sequential Logic (2) Synchronous vs Asynchronous Sequential Circuit. Clock Signal. Synchronous Sequential Circuits. FSM Overview 9/10/12

Sequential Logic (2) Synchronous vs Asynchronous Sequential Circuit. Clock Signal. Synchronous Sequential Circuits. FSM Overview 9/10/12 9//2 Sequentil (2) ENGG5 st Semester, 22 Dr. Hden So Deprtment of Electricl nd Electronic Engineering http://www.eee.hku.hk/~engg5 Snchronous vs Asnchronous Sequentil Circuit This Course snchronous Sequentil

More information

Regular languages can be expressed as regular expressions.

Regular languages can be expressed as regular expressions. Regulr lnguges cn e expressed s regulr expressions. A generl nondeterministic finite utomton (GNFA) is kind of NFA such tht: There is unique strt stte nd is unique ccept stte. Every pir of nodes re connected

More information

CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2005

CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2005 CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2005 EXPERIMENT 1 FUNDAMENTALS 1. GOALS : Lern how to develop cr lrm digitl circuit during which the following re introduced : CS2204 l fundmentls, nd

More information

Digital Design. Sequential Logic Design -- Controllers. Copyright 2007 Frank Vahid

Digital Design. Sequential Logic Design -- Controllers. Copyright 2007 Frank Vahid Digitl Design Sequentil Logic Design -- Controllers Slides to ccompny the tetook Digitl Design, First Edition, y, John Wiley nd Sons Pulishers, 27. http://www.ddvhid.com Copyright 27 Instructors of courses

More information

CHAPTER 2 LITERATURE STUDY

CHAPTER 2 LITERATURE STUDY CHAPTER LITERATURE STUDY. Introduction Multipliction involves two bsic opertions: the genertion of the prtil products nd their ccumultion. Therefore, there re two possible wys to speed up the multipliction:

More information

Mixed CMOS PTL Adders

Mixed CMOS PTL Adders Anis do XXVI Congresso d SBC WCOMPA l I Workshop de Computção e Aplicções 14 20 de julho de 2006 Cmpo Grnde, MS Mixed CMOS PTL Adders Déor Mott, Reginldo d N. Tvres Engenhri em Sistems Digitis Universidde

More information

Multi-beam antennas in a broadband wireless access system

Multi-beam antennas in a broadband wireless access system Multi-em ntenns in rodnd wireless ccess system Ulrik Engström, Mrtin Johnsson, nders Derneryd nd jörn Johnnisson ntenn Reserch Center Ericsson Reserch Ericsson SE-4 84 Mölndl Sweden E-mil: ulrik.engstrom@ericsson.com,

More information

The Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center

The Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center Resource Overview Quntile Mesure: Skill or Concept: 300Q Model the concept of ddition for sums to 10. (QT N 36) Model the concept of sutrction using numers less thn or equl to 10. (QT N 37) Write ddition

More information

Solutions to exercise 1 in ETS052 Computer Communication

Solutions to exercise 1 in ETS052 Computer Communication Solutions to exercise in TS52 Computer Communiction 23 Septemer, 23 If it occupies millisecond = 3 seconds, then second is occupied y 3 = 3 its = kps. kps If it occupies 2 microseconds = 2 6 seconds, then

More information

Example. Check that the Jacobian of the transformation to spherical coordinates is

Example. Check that the Jacobian of the transformation to spherical coordinates is lss, given on Feb 3, 2, for Mth 3, Winter 2 Recll tht the fctor which ppers in chnge of vrible formul when integrting is the Jcobin, which is the determinnt of mtrix of first order prtil derivtives. Exmple.

More information

& Y Connected resistors, Light emitting diode.

& Y Connected resistors, Light emitting diode. & Y Connected resistors, Light emitting diode. Experiment # 02 Ojectives: To get some hndson experience with the physicl instruments. To investigte the equivlent resistors, nd Y connected resistors, nd

More information

(1) Non-linear system

(1) Non-linear system Liner vs. non-liner systems in impednce mesurements I INTRODUCTION Electrochemicl Impednce Spectroscopy (EIS) is n interesting tool devoted to the study of liner systems. However, electrochemicl systems

More information

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad Hll Ticket No Question Pper Code: AEC009 INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigl, Hyderd - 500 043 MODEL QUESTION PAPER Four Yer B.Tech V Semester End Exmintions, Novemer - 2018 Regultions:

More information

10.4 AREAS AND LENGTHS IN POLAR COORDINATES

10.4 AREAS AND LENGTHS IN POLAR COORDINATES 65 CHAPTER PARAMETRIC EQUATINS AND PLAR CRDINATES.4 AREAS AND LENGTHS IN PLAR CRDINATES In this section we develop the formul for the re of region whose oundry is given y polr eqution. We need to use the

More information

SOLVING TRIANGLES USING THE SINE AND COSINE RULES

SOLVING TRIANGLES USING THE SINE AND COSINE RULES Mthemtics Revision Guides - Solving Generl Tringles - Sine nd Cosine Rules Pge 1 of 17 M.K. HOME TUITION Mthemtics Revision Guides Level: GCSE Higher Tier SOLVING TRIANGLES USING THE SINE AND COSINE RULES

More information

Discontinued AN6262N, AN6263N. (planed maintenance type, maintenance type, planed discontinued typed, discontinued type)

Discontinued AN6262N, AN6263N. (planed maintenance type, maintenance type, planed discontinued typed, discontinued type) ICs for Cssette, Cssette Deck ANN, ANN Puse Detection s of Rdio Cssette, Cssette Deck Overview The ANN nd the ANN re the puse detection integrted circuits which select the progrm on the cssette tpe. In

More information

CS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates

CS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates Bsic Logic Gtes : Computer Architecture I Boolen Algebr Instructor: Prof. Bhgi Nrhri Dept. of Computer Science Course URL: www.ses.gwu.edu/~bhgiweb/cs35/ Digitl Logic Circuits We sw how we cn build the

More information

Intention reconsideration in theory and practice

Intention reconsideration in theory and practice Intention reconsidertion in theory nd prctice Simon Prsons nd Ol Pettersson nd lessndro Sffiotti nd Michel Wooldridge bstrct. utonomous gents operting in complex dynmic environments need the bility to

More information

A New Algorithm to Compute Alternate Paths in Reliable OSPF (ROSPF)

A New Algorithm to Compute Alternate Paths in Reliable OSPF (ROSPF) A New Algorithm to Compute Alternte Pths in Relile OSPF (ROSPF) Jin Pu *, Eric Mnning, Gholmli C. Shoj, Annd Srinivsn ** PANDA Group, Computer Science Deprtment University of Victori Victori, BC, Cnd Astrct

More information

Energy Harvesting Two-Way Channels With Decoding and Processing Costs

Energy Harvesting Two-Way Channels With Decoding and Processing Costs IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING, VOL., NO., MARCH 07 3 Energy Hrvesting Two-Wy Chnnels With Decoding nd Processing Costs Ahmed Arf, Student Member, IEEE, Abdulrhmn Bknin, Student

More information

EY-AM 300: novanet BACnet application master, modunet300

EY-AM 300: novanet BACnet application master, modunet300 Product dt sheet 96.010 EY-AM 300: novnet BACnet ppliction mster, modunet300 How energy efficiency is improved Open communiction for interoperle opertion of the entire optimised plnt. Fetures Prt of the

More information

Kirchhoff s Rules. Kirchhoff s Laws. Kirchhoff s Rules. Kirchhoff s Laws. Practice. Understanding SPH4UW. Kirchhoff s Voltage Rule (KVR):

Kirchhoff s Rules. Kirchhoff s Laws. Kirchhoff s Rules. Kirchhoff s Laws. Practice. Understanding SPH4UW. Kirchhoff s Voltage Rule (KVR): SPH4UW Kirchhoff s ules Kirchhoff s oltge ule (K): Sum of voltge drops round loop is zero. Kirchhoff s Lws Kirchhoff s Current ule (KC): Current going in equls current coming out. Kirchhoff s ules etween

More information

Understanding Basic Analog Ideal Op Amps

Understanding Basic Analog Ideal Op Amps Appliction Report SLAA068A - April 2000 Understnding Bsic Anlog Idel Op Amps Ron Mncini Mixed Signl Products ABSTRACT This ppliction report develops the equtions for the idel opertionl mplifier (op mp).

More information

Experimental Application of H Output-Feedback Controller on Two Links of SCARA Robot

Experimental Application of H Output-Feedback Controller on Two Links of SCARA Robot INTERNATIONAL JOURNAL OF CONTROL, AUTOMATION AND SYSTEMS VOL.5 NO. Jnury 6 ISSN 65-877 (Print) ISSN 65-885 (Online) http://www.reserchpu.org/journl/jc/jc.html Experimentl Appliction of H Output-Feedck

More information

Y9.ET1.3 Implementation of Secure Energy Management against Cyber/physical Attacks for FREEDM System

Y9.ET1.3 Implementation of Secure Energy Management against Cyber/physical Attacks for FREEDM System Y9.ET1.3 Implementtion of Secure Energy ngement ginst Cyber/physicl Attcks for FREED System Project Leder: Fculty: Students: Dr. Bruce cillin Dr. o-yuen Chow Jie Dun 1. Project Gols Develop resilient cyber-physicl

More information

Efficient and Resilient Key Discovery based on Pseudo-Random Key Pre-Deployment

Efficient and Resilient Key Discovery based on Pseudo-Random Key Pre-Deployment Efficient nd Resilient Key Discovery sed on Pseudo-Rndom Key Pre-Deployment p. 1 Efficient nd Resilient Key Discovery sed on Pseudo-Rndom Key Pre-Deployment Roerto Di Pietro, Luigi V. Mncini, nd Alessndro

More information

The Discussion of this exercise covers the following points:

The Discussion of this exercise covers the following points: Exercise 4 Bttery Chrging Methods EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the different chrging methods nd chrge-control techniques commonly used when chrging Ni-MI

More information

Student Book SERIES. Fractions. Name

Student Book SERIES. Fractions. Name D Student Book Nme Series D Contents Topic Introducing frctions (pp. ) modelling frctions frctions of collection compring nd ordering frctions frction ingo pply Dte completed / / / / / / / / Topic Types

More information

Computing Logic-Stage Delays Using Circuit Simulation and Symbolic Elmore Analysis

Computing Logic-Stage Delays Using Circuit Simulation and Symbolic Elmore Analysis Computing Logic-Stge Delys Using Circuit Simultion nd Symolic Elmore Anlysis Clyton B. McDonld Rndl E. Brynt Deprtment of Electricl nd Computer Engineering Crnegie Mellon University, Pittsurgh, PA 15213

More information

Magnetic monopole field exposed by electrons

Magnetic monopole field exposed by electrons Mgnetic monopole field exposed y electrons A. Béché, R. Vn Boxem, G. Vn Tendeloo, nd J. Vereeck EMAT, University of Antwerp, Groenenorgerln 171, 22 Antwerp, Belgium Opticl xis Opticl xis Needle Smple Needle

More information

Foot-Pedal: Haptic Feedback Human Interface Bridging Sensational Gap between Remote Places

Foot-Pedal: Haptic Feedback Human Interface Bridging Sensational Gap between Remote Places Foot-Pedl: Hptic Feedbck Humn Interfce Bridging Senstionl Gp between Remote Plces Mincheol Kim 1, De-Keun Yoon 2, Shin-Young Kim 1, Ji-Hi Cho 1, Kwng-Kyu Lee 1, Bum-Je You 1,3 1 Center of Humn-centered

More information

ECE 274 Digital Logic. Digital Design. Datapath Components Shifters, Comparators, Counters, Multipliers Digital Design

ECE 274 Digital Logic. Digital Design. Datapath Components Shifters, Comparators, Counters, Multipliers Digital Design ECE 27 Digitl Logic Shifters, Comprtors, Counters, Multipliers Digitl Design..7 Digitl Design Chpter : Slides to ccompny the textbook Digitl Design, First Edition, by Frnk Vhid, John Wiley nd Sons Publishers,

More information

ABB STOTZ-KONTAKT. ABB i-bus EIB Current Module SM/S Intelligent Installation Systems. User Manual SM/S In = 16 A AC Un = 230 V AC

ABB STOTZ-KONTAKT. ABB i-bus EIB Current Module SM/S Intelligent Installation Systems. User Manual SM/S In = 16 A AC Un = 230 V AC User Mnul ntelligent nstlltion Systems A B 1 2 3 4 5 6 7 8 30 ma 30 ma n = AC Un = 230 V AC 30 ma 9 10 11 12 C ABB STOTZ-KONTAKT Appliction Softwre Current Vlue Threshold/1 Contents Pge 1 Device Chrcteristics...

More information

Exercise 1-1. The Sine Wave EXERCISE OBJECTIVE DISCUSSION OUTLINE. Relationship between a rotating phasor and a sine wave DISCUSSION

Exercise 1-1. The Sine Wave EXERCISE OBJECTIVE DISCUSSION OUTLINE. Relationship between a rotating phasor and a sine wave DISCUSSION Exercise 1-1 The Sine Wve EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the notion of sine wve nd how it cn be expressed s phsor rotting round the center of circle. You

More information

EE Controls Lab #2: Implementing State-Transition Logic on a PLC

EE Controls Lab #2: Implementing State-Transition Logic on a PLC Objective: EE 44 - Controls Lb #2: Implementing Stte-rnsition Logic on PLC ssuming tht speed is not of essence, PLC's cn be used to implement stte trnsition logic. he dvntge of using PLC over using hrdwre

More information

Polar Coordinates. July 30, 2014

Polar Coordinates. July 30, 2014 Polr Coordintes July 3, 4 Sometimes it is more helpful to look t point in the xy-plne not in terms of how fr it is horizontlly nd verticlly (this would men looking t the Crtesin, or rectngulr, coordintes

More information

Asynchronous Data-Driven Circuit Synthesis

Asynchronous Data-Driven Circuit Synthesis Asynchronous Dt-Driven Circuit Synthesis Sm Tylor, Doug Edwrds, Luis A Pln, Senior Memer, IEEE nd Luis A. Trzon D., Student Memer, IEEE Astrct A method is descried for synthesising synchronous circuits

More information

Available online at ScienceDirect. Procedia Engineering 89 (2014 )

Available online at   ScienceDirect. Procedia Engineering 89 (2014 ) Aville online t www.sciencedirect.com ScienceDirect Procedi Engineering 89 (2014 ) 411 417 16th Conference on Wter Distriution System Anlysis, WDSA 2014 A New Indictor for Rel-Time Lek Detection in Wter

More information

To provide data transmission in indoor

To provide data transmission in indoor Hittite Journl of Science nd Engineering, 2018, 5 (1) 25-29 ISSN NUMBER: 2148-4171 DOI: 10.17350/HJSE19030000074 A New Demodultor For Inverse Pulse Position Modultion Technique Mehmet Sönmez Osmniye Korkut

More information

PB-735 HD DP. Industrial Line. Automatic punch and bind machine for books and calendars

PB-735 HD DP. Industrial Line. Automatic punch and bind machine for books and calendars PB-735 HD DP Automtic punch nd bind mchine for books nd clendrs A further step for the utomtion of double loop binding. A clever nd flexible mchine ble to punch nd bind in line up to 9/16. Using the best

More information

Section 16.3 Double Integrals over General Regions

Section 16.3 Double Integrals over General Regions Section 6.3 Double Integrls over Generl egions Not ever region is rectngle In the lst two sections we considered the problem of integrting function of two vribles over rectngle. This sitution however is

More information

Student Book SERIES. Patterns and Algebra. Name

Student Book SERIES. Patterns and Algebra. Name E Student Book 3 + 7 5 + 5 Nme Contents Series E Topic Ptterns nd functions (pp. ) identifying nd creting ptterns skip counting completing nd descriing ptterns predicting repeting ptterns predicting growing

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-297 Technicl notes on using Anlog Devices DSPs, processors nd development tools Visit our Web resources http://www.nlog.com/ee-notes nd http://www.nlog.com/processors or e-mil

More information

Translate and Classify Conic Sections

Translate and Classify Conic Sections TEKS 9.6 A.5.A, A.5.B, A.5.D, A.5.E Trnslte nd Clssif Conic Sections Before You grphed nd wrote equtions of conic sections. Now You will trnslte conic sections. Wh? So ou cn model motion, s in E. 49. Ke

More information

Francis Gaspalou Second edition of February 10, 2012 (First edition on January 28, 2012) HOW MANY SQUARES ARE THERE, Mr TARRY?

Francis Gaspalou Second edition of February 10, 2012 (First edition on January 28, 2012) HOW MANY SQUARES ARE THERE, Mr TARRY? Frncis Gslou Second edition of Ferury 10, 2012 (First edition on Jnury 28, 2012) HOW MANY SQUARES ARE THERE, Mr TARRY? ABSTRACT In this er, I enumerte ll the 8x8 imgic sures given y the Trry s ttern. This

More information

Software for the automatic scaling of critical frequency f 0 F2 and MUF(3000)F2 from ionograms applied at the Ionospheric Observatory of Gibilmanna

Software for the automatic scaling of critical frequency f 0 F2 and MUF(3000)F2 from ionograms applied at the Ionospheric Observatory of Gibilmanna ANNALS OF GEOPHYSICS, VOL. 47, N. 6, Decemer 2004 Softwre for the utomtic scling of criticl frequency f 0 F2 nd MUF(3000)F2 from ionogrms pplied t the Ionospheric Oservtory of Giilmnn Michel Pezzopne nd

More information

Design and implementation of a high-speed bit-serial SFQ adder based on the binary decision diagram

Design and implementation of a high-speed bit-serial SFQ adder based on the binary decision diagram INSTITUTE OFPHYSICS PUBLISHING Supercond. Sci. Technol. 16 (23) 1497 152 SUPERCONDUCTORSCIENCE AND TECHNOLOGY PII: S953-248(3)67111-3 Design nd implementtion of high-speed it-seril SFQ dder sed on the

More information

Electrical data Nominal voltage AC/DC 24 V Nominal voltage frequency

Electrical data Nominal voltage AC/DC 24 V Nominal voltage frequency echnicl dt sheet SR24A-MF Prmeterisle rotry ctutor for ll vlves Nominl torque 20 Nm Nominl voltge AC/DC 24 V Control Modulting DC (0)2...10 V Vrile Position feedck DC 2...10 V Vrile echnicl dt Electricl

More information

Impact of Research Activities on FCH Technologies and Policy Development

Impact of Research Activities on FCH Technologies and Policy Development Impct of Activities on FCH Technologies nd Policy Development for NERGHY Grouping Deborh Jones Centre Ntionl de l Recherche Scientifique, Montpellier, Frnce 1 Europen Community in FCH technologies Europen

More information

CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN fall 2008

CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN fall 2008 CS224 DIGITAL LOGIC & STATE MACHINE DESIGN fll 28 STAND ALONE XILINX PROJECT 2-TO- MULTIPLEXER. Gols : Lern how to develop stnd lone 2-to- multiplexer () Xilinx project during which the following re introduced

More information

Lecture 20. Intro to line integrals. Dan Nichols MATH 233, Spring 2018 University of Massachusetts.

Lecture 20. Intro to line integrals. Dan Nichols MATH 233, Spring 2018 University of Massachusetts. Lecture 2 Intro to line integrls Dn Nichols nichols@mth.umss.edu MATH 233, Spring 218 University of Msschusetts April 12, 218 (2) onservtive vector fields We wnt to determine if F P (x, y), Q(x, y) is

More information

METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN. Inventor: Brian L. Baskin

METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN. Inventor: Brian L. Baskin METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN Inventor: Brin L. Bskin 1 ABSTRACT The present invention encompsses method of loction comprising: using plurlity of signl trnsceivers to receive one or

More information

Module 9. DC Machines. Version 2 EE IIT, Kharagpur

Module 9. DC Machines. Version 2 EE IIT, Kharagpur Module 9 DC Mchines Version EE IIT, Khrgpur esson 40 osses, Efficiency nd Testing of D.C. Mchines Version EE IIT, Khrgpur Contents 40 osses, efficiency nd testing of D.C. mchines (esson-40) 4 40.1 Gols

More information

Algorithms for Memory Hierarchies Lecture 14

Algorithms for Memory Hierarchies Lecture 14 Algorithms for emory Hierrchies Lecture 4 Lecturer: Nodri Sitchinv Scribe: ichel Hmnn Prllelism nd Cche Obliviousness The combintion of prllelism nd cche obliviousness is n ongoing topic of reserch, in

More information

Electrical data Nominal voltage AC/DC 24 V Nominal voltage frequency

Electrical data Nominal voltage AC/DC 24 V Nominal voltage frequency echnicl dt sheet RF24-MF-O Communictive rotry ctutor with emergency control function for ll vlves Nominl torque 2.5 Nm Nominl voltge AC/DC 24 V Control Modulting DC ()2...1 V Position feedck DC 2...1 V

More information

An Approach to Semantic Matching of Web Services

An Approach to Semantic Matching of Web Services An Approch to emntic Mtching of Web ervices Dingjin Chen Jin Wu huyu Li Mnfu M Zhengguo Hu Computer school orthwestern Polytechnicl University Xi n hnxi 7007 Chin Computer school hnxi orml University Xi

More information

Redundancy Data Elimination Scheme Based on Stitching Technique in Image Senor Networks

Redundancy Data Elimination Scheme Based on Stitching Technique in Image Senor Networks Sensors & Trnsducers 204 by IFSA Publishing, S. L. http://www.sensorsportl.com Redundncy Dt Elimintion Scheme Bsed on Stitching Technique in Imge Senor Networks hunling Tng hongqing Technology nd Business

More information

Electrical data Nominal voltage AC/DC 24 V Nominal voltage frequency

Electrical data Nominal voltage AC/DC 24 V Nominal voltage frequency echnicl dt sheet LRF24- Communictive rotry ctutor with emergency control function for ll vlves Nominl torque 4 Nm Nominl voltge AC/DC 24 V Control Modulting DC (0)2...10 V Vrile Position feedck DC 2...10

More information

MATH 118 PROBLEM SET 6

MATH 118 PROBLEM SET 6 MATH 118 PROBLEM SET 6 WASEEM LUTFI, GABRIEL MATSON, AND AMY PIRCHER Section 1 #16: Show tht if is qudrtic residue modulo m, nd b 1 (mod m, then b is lso qudrtic residue Then rove tht the roduct of the

More information

Section 17.2: Line Integrals. 1 Objectives. 2 Assignments. 3 Maple Commands. 1. Compute line integrals in IR 2 and IR Read Section 17.

Section 17.2: Line Integrals. 1 Objectives. 2 Assignments. 3 Maple Commands. 1. Compute line integrals in IR 2 and IR Read Section 17. Section 7.: Line Integrls Objectives. ompute line integrls in IR nd IR 3. Assignments. Red Section 7.. Problems:,5,9,,3,7,,4 3. hllenge: 6,3,37 4. Red Section 7.3 3 Mple ommnds Mple cn ctully evlute line

More information

Homework #1 due Monday at 6pm. White drop box in Student Lounge on the second floor of Cory. Tuesday labs cancelled next week

Homework #1 due Monday at 6pm. White drop box in Student Lounge on the second floor of Cory. Tuesday labs cancelled next week Announcements Homework #1 due Mondy t 6pm White drop ox in Student Lounge on the second floor of Cory Tuesdy ls cncelled next week Attend your other l slot Books on reserve in Bechtel Hmley, 2 nd nd 3

More information

Analysis of circuits containing active elements by using modified T - graphs

Analysis of circuits containing active elements by using modified T - graphs Anlsis of circuits contining ctive elements using modified T - grphs DALBO BOLEK *) nd EA BOLKOA**) Deprtment of Telecommunictions *) dioelectronics **) Brno Universit of Technolog Purknov 8, 6 Brno CECH

More information

Products no longer available

Products no longer available echnicl dt sheet otry ctutor F2-P(-O) ultifunctionl rotry ctutor with emergency control for 2 nd 3 wy control bll vlve orque Nm Nominl voltge C/DC 2 V Control: odulting DC... V or vrible Position feedbck

More information

Triangles and parallelograms of equal area in an ellipse

Triangles and parallelograms of equal area in an ellipse 1 Tringles nd prllelogrms of equl re in n ellipse Roert Buonpstore nd Thoms J Osler Mthemtics Deprtment RownUniversity Glssoro, NJ 0808 USA uonp0@studentsrownedu osler@rownedu Introduction In the pper

More information

Implementation of Different Architectures of Forward 4x4 Integer DCT For H.264/AVC Encoder

Implementation of Different Architectures of Forward 4x4 Integer DCT For H.264/AVC Encoder Implementtion of Different Architectures of Forwrd 4x4 Integer DCT For H.64/AVC Encoder Bunji Antoinette Ringnyu, Ali Tngel, Emre Krulut 3 Koceli University, Institute of Science nd Technology, Koceli,

More information

Spiral Tilings with C-curves

Spiral Tilings with C-curves Spirl Tilings with -curves Using ombintorics to Augment Trdition hris K. Plmer 19 North Albny Avenue hicgo, Illinois, 0 chris@shdowfolds.com www.shdowfolds.com Abstrct Spirl tilings used by rtisns through

More information

Information-Coupled Turbo Codes for LTE Systems

Information-Coupled Turbo Codes for LTE Systems Informtion-Coupled Turbo Codes for LTE Systems Lei Yng, Yixun Xie, Xiowei Wu, Jinhong Yun, Xingqing Cheng nd Lei Wn rxiv:709.06774v [cs.it] 20 Sep 207 Abstrct We propose new clss of informtion-coupled

More information

Algebra Practice. Dr. Barbara Sandall, Ed.D., and Travis Olson, M.S.

Algebra Practice. Dr. Barbara Sandall, Ed.D., and Travis Olson, M.S. By Dr. Brr Sndll, Ed.D., Dr. Melfried Olson, Ed.D., nd Trvis Olson, M.S. COPYRIGHT 2006 Mrk Twin Medi, Inc. ISBN 978-1-58037-754-6 Printing No. 404042-EB Mrk Twin Medi, Inc., Pulishers Distriuted y Crson-Dellos

More information

Genetic Representations for Evolutionary Minimization of Network Coding Resources

Genetic Representations for Evolutionary Minimization of Network Coding Resources Genetic Representtions for Evolutionry Minimiztion of Network Coding Resources Minkyu Kim 1, Vrun Aggrwl 2, Un-My O Reilly 2, Muriel Médrd 1, nd Wonsik Kim 1 1 Lortory for Informtion nd Decision Systems

More information

FOMA M702iG Manual for Data Communication

FOMA M702iG Manual for Data Communication FOMA M702iG Mnul for Dt Communiction Dt Communictions... 1 Before Using... 2 Prepring for Dt Communiction... 3 Instlling the Communiction Configurtion Files (Drivers)... 4 Connecting the FOMA Hndset nd

More information

Area-Time Efficient Digit-Serial-Serial Two s Complement Multiplier

Area-Time Efficient Digit-Serial-Serial Two s Complement Multiplier Are-Time Efficient Digit-Seril-Seril Two s Complement Multiplier Essm Elsyed nd Htem M. El-Boghddi Computer Engineering Deprtment, Ciro University, Egypt Astrct - Multipliction is n importnt primitive

More information

TOWARDS A FLEXIBLE IT-BASED SYSTEM FOR PROCESS STEERING IN ARCHITECTURE DESIGN

TOWARDS A FLEXIBLE IT-BASED SYSTEM FOR PROCESS STEERING IN ARCHITECTURE DESIGN TOWARDS A FLEXIBLE IT-BASED SYSTEM FOR PROCESS STEERING IN ARCHITECTURE DESIGN Ahmed Lroussi 1, Alin Zrli 1, Jen-Clude Bignon 2, Gilles Hlin 2 1 Centre Scientifique et Technique du Bâtiment (CSTB), Sophi

More information

Control of high-frequency AC link electronic transformer

Control of high-frequency AC link electronic transformer Control of high-frequency AC link electronic trnsformer H. Krishnswmi nd V. Rmnrynn Astrct: An isolted high-frequency link AC/AC converter is termed n electronic trnsformer. The electronic trnsformer hs

More information

First Round Solutions Grades 4, 5, and 6

First Round Solutions Grades 4, 5, and 6 First Round Solutions Grdes 4, 5, nd 1) There re four bsic rectngles not mde up of smller ones There re three more rectngles mde up of two smller ones ech, two rectngles mde up of three smller ones ech,

More information

PRACTICE NO. PT-TE-1414 RELIABILITY PAGE 1 OF 6 PRACTICES ELECTROSTATIC DISCHARGE (ESD) TEST PRACTICES

PRACTICE NO. PT-TE-1414 RELIABILITY PAGE 1 OF 6 PRACTICES ELECTROSTATIC DISCHARGE (ESD) TEST PRACTICES PREFERRED PRACTICE NO. PT-TE-1414 RELIABILITY PAGE 1 OF 6 ELECTROSTATIC DISCHARGE (ESD) TEST Prctice: Test stellites for the ility to survive the effects of electrosttic dischrges (ESDs) cused y spce chrging

More information

Proceedings of Meetings on Acoustics

Proceedings of Meetings on Acoustics Proceedings of Meetings on Acoustics Volume 19, 2013 http://cousticlsociety.org/ ICA 2013 Montrel Montrel, Cnd 2-7 June 2013 Signl Processing in Acoustics Session 4SP: Sensor Arry Bemforming nd Its Applictions

More information

Direct Current Circuits. Chapter Outline Electromotive Force 28.2 Resistors in Series and in Parallel 28.3 Kirchhoff s Rules 28.

Direct Current Circuits. Chapter Outline Electromotive Force 28.2 Resistors in Series and in Parallel 28.3 Kirchhoff s Rules 28. P U Z Z L E R If ll these pplinces were operting t one time, circuit reker would proly e tripped, preventing potentilly dngerous sitution. Wht cuses circuit reker to trip when too mny electricl devices

More information

Joanna Towler, Roading Engineer, Professional Services, NZTA National Office Dave Bates, Operations Manager, NZTA National Office

Joanna Towler, Roading Engineer, Professional Services, NZTA National Office Dave Bates, Operations Manager, NZTA National Office . TECHNICA MEMOANDM To Cc repred By Endorsed By NZTA Network Mngement Consultnts nd Contrctors NZTA egionl Opertions Mngers nd Are Mngers Dve Btes, Opertions Mnger, NZTA Ntionl Office Jonn Towler, oding

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION doi:.38/nture14441 1. Mteril nd device stck optimiztion Lower electroforming voltges reduce the electricl stress s well s current overshoot during the forming, which is known risk fctor contriuting to

More information

Network Theorems. Objectives 9.1 INTRODUCTION 9.2 SUPERPOSITION THEOREM

Network Theorems. Objectives 9.1 INTRODUCTION 9.2 SUPERPOSITION THEOREM M09_BOYL3605_13_S_C09.indd Pge 359 24/11/14 1:59 PM f403 /204/PH01893/9780133923605_BOYLSTAD/BOYLSTAD_NTRO_CRCUT_ANALYSS13_S_978013... Network Theorems Ojectives Become fmilir with the superposition theorem

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-236 Technicl notes on using Anlog Devices DSPs, processors nd development tools Contct our technicl support t dsp.support@nlog.com nd t dsptools.support@nlog.com Or visit our

More information

9.4. ; 65. A family of curves has polar equations. ; 66. The astronomer Giovanni Cassini ( ) studied the family of curves with polar equations

9.4. ; 65. A family of curves has polar equations. ; 66. The astronomer Giovanni Cassini ( ) studied the family of curves with polar equations 54 CHAPTER 9 PARAMETRIC EQUATINS AND PLAR CRDINATES 49. r, 5. r sin 3, 5 54 Find the points on the given curve where the tngent line is horizontl or verticl. 5. r 3 cos 5. r e 53. r cos 54. r sin 55. Show

More information

Synchronous Machine Parameter Measurement

Synchronous Machine Parameter Measurement Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions

More information

Radiant systems 0801EN March 2016 Radiant plasterboard ceiling and/or floor system ISO /7

Radiant systems 0801EN March 2016 Radiant plasterboard ceiling and/or floor system ISO /7 RADIANT CEILING SYSTEM Description is rdint ceiling/wll system relized with 600x1200 mm EPS200 preformed pnels coted with 0,3 mm luminium thermo-conductor sheets, where the plstic pipe with n externl Ø

More information

Operation Manual. Addendum. Embroidery Machine. Product Code: 884-T13

Operation Manual. Addendum. Embroidery Machine. Product Code: 884-T13 Emroidery Mchine Opertion Mnul Addendum Product Code: 884-T13 Be sure to red this document efore using the mchine. We recommend tht you keep this document nery for future reference. ABOUT THIS MANUAL ABOUT

More information

A Development of Earthing-Resistance-Estimation Instrument

A Development of Earthing-Resistance-Estimation Instrument A Development of Erthing-Resistnce-Estimtion Instrument HITOSHI KIJIMA Abstrct: - Whenever erth construction work is done, the implnted number nd depth of electrodes hve to be estimted in order to obtin

More information

University of North Carolina-Charlotte Department of Electrical and Computer Engineering ECGR 4143/5195 Electrical Machinery Fall 2009

University of North Carolina-Charlotte Department of Electrical and Computer Engineering ECGR 4143/5195 Electrical Machinery Fall 2009 Problem 1: Using DC Mchine University o North Crolin-Chrlotte Deprtment o Electricl nd Computer Engineering ECGR 4143/5195 Electricl Mchinery Fll 2009 Problem Set 4 Due: Thursdy October 8 Suggested Reding:

More information

Automatic Heuristic Construction in a Complete General Game Player

Automatic Heuristic Construction in a Complete General Game Player Automtic Heuristic Construction in Complete Generl Gme Plyer Gregory Kuhlmnn, Kurt Dresner nd Peter Stone Deprtment of Computer Sciences, The University of Texs t Austin 1 University Sttion C0500, Austin,

More information

ABOUT THIS MANUAL ABOUT THIS MANUAL

ABOUT THIS MANUAL ABOUT THIS MANUAL ABOUT THIS MANUAL ABOUT THIS MANUAL This mnul provides detils on IQ Designer, which is ville with the upgrde. Mke sure tht the mchine hs een upgrded to the most recent version. When you find this icon

More information

A COMPARISON OF CIRCUIT IMPLEMENTATIONS FROM A SECURITY PERSPECTIVE

A COMPARISON OF CIRCUIT IMPLEMENTATIONS FROM A SECURITY PERSPECTIVE A COMPARISON OF CIRCUIT IMPLEMENTATIONS FROM A SECURITY PERSPECTIVE Mster Thesis Division of Electronic Devices Deprtment of Electricl Engineering Linköping University y Timmy Sundström LITH-ISY-EX--05/3698--SE

More information

Study on Application of a Human-Robot Collaborative System Using Hand-Guiding in a Production Line

Study on Application of a Human-Robot Collaborative System Using Hand-Guiding in a Production Line Study on Appliction of Humn-Robot Collbortive System Using Hnd-Guiding in Production Line FUJII Msku : Mnger, Control & Communiction Technology Deprment, Products Development Center, Corporte Reserch &

More information

Electrical data Nominal voltage AC/DC 24 V Nominal voltage frequency

Electrical data Nominal voltage AC/DC 24 V Nominal voltage frequency echnicl dt sheet SF24A-MF Prmeterisle spring-return ctutor with emergency control function for djusting dmpers in technicl uilding instlltions Air dmper size up to pprox. 4 m² Nominl torque 20 Nm Nominl

More information

Electrical data Nominal voltage AC/DC 24 V Nominal voltage frequency

Electrical data Nominal voltage AC/DC 24 V Nominal voltage frequency echnicl dt sheet NR24A- Communictive rotry ctutor for ll vlves Nominl torque Nominl voltge AC/DC 24 V Control Modulting DC (0)2...10 V Vrile Position feedck DC 2...10 V Vrile Conversion of sensor signls

More information