An Event-Based Approach to Visualization
|
|
|
- Amos Bishop
- 10 years ago
- Views:
Transcription
1 An Event-Based Approach to Vsualzaton Chrstan Tomns Hedrun Schumann Insttute for Computer Scence Unversty of Rostoc, Germany Abstract Vsualzaton of large data sets s a demandng tas, especally f dfferent users are nterested n dfferent aspects of the same data set. Today s vsualzaton technques often do not dstngush dfferent aspects and thus vsualze all aspects of the data, whch leads to overcrowded and cluttered representatons. Moreover, users are provded wth nformaton rrelevant to them. In ths paper we descrbe an event-based approach for vsualzng large data sets. The basc dea s to let users descrbe nterestng aspects of the data by means of events and then adapt the vsual representaton of the data on occurrence of events. We present a formal descrpton of events, assumng that the data are gven n relatonal form. Furthermore, a model for eventbased vsualzaton s developed. A bref overvew of an early realzaton of the model along wth frst vsual results s part of ths paper.. Introducton Nowadays modern database technology enables scentfc nsttutons, governmental authortes, and companes to collect large amounts of data. These data are for nstance expermental datasets, health statstcs, or customer surveys. Vsualzaton has been proven to be an effcent method for analyzng such data. Therefore, (abstract) data are mapped to vsual representatons n order to beneft form the capabltes of the human vsual system. North, Conln, and San state n [] that modern relatonal database technologes allow effcent and flexble data management, but today s vsualzaton technques do not reach ths level of flexblty. Developed by a sngle programmer, vsualzaton technques are often specfc to only one certan problem. Moreover, n the case of large datasets t s common that dfferent users explore the data wth respect to dfferent aspects. Ths means that a vsualzaton technque must be able to represent any of these dfferent aspects. However, most vsualzatons do not dstngush between dfferent aspects and thus, users are oblged to create a dataset consstng of only relevant data aspects pror to vsualzaton. Otherwse, users are provded wth a lot of nformaton they are not nterested n at all. Wth respect to modern vsualzaton methods for large datasets and dfferent users, ths leads to the followng two demands: Increase of flexblty,.e. allow users to specfy ther nterests and then adapt the vsualzaton automatcally. Increases of effcency,.e. emphaszng portons of the data users are nterested n and reduce nformaton rrelevant to them. In ths paper we present a model for event-based nformaton vsualzaton, whch can help to reach the descrbed goals. The basc dea of the event-based vsualzaton s to allow users to specfy pattern they are nterested n. Once a pattern s detected wthn the data (ether a statc or a dynamc dataset) an event s trggered. Accordng to the event and ts propertes the vsualzaton s adapted automatcally. The followng sectons wll ntroduce our deas for event-based vsualzaton. Related wor and a state-ofthe-art overvew are gven n Secton 2. The descrpton of events (Secton 3) s the bass for the development of our model n Secton 4. Furthermore, n Secton 5 we show frst results of a realzaton of our model n the axes-based vsualzaton framewor VsAxes. 2. Related wor Events and event-based approaches are wdely used n a varety of nformaton technology related problems. Events are a prerequste for reactve
2 behavor and thus a requrement for automatcally adaptng software systems. Wth respect to vsualzaton, only events lmted to specfc problems have been used n the past years. Matowc et.al. [2] descrbe how smple events can be used n order to adapt vrtual nstruments n process vsualzaton. In fact, the vsual representaton and thus the level of detal of vrtual nstruments s changed f certan thresholds are reached. In ths way the vsualzaton supports an observer n fndng crtcal ponts n a real tme process. From the area of flow vsualzaton the approach from Renders et al. [3] s nown to mae use of events. Based on feature extracton relevant portons (.e. features) of tme-dependent flow data are vsualzed. Addtonally, events descrbed as any development n the evoluton of a feature that s sgnfcant ([4] p.07) are detected and presented n an event graph. Brth and death, entry and ext, as well as splt and merge of features are consdered sgnfcant and thus relevant for the vsualzaton of features n the event graph. By representng relevant events n combnaton wth con-based flow vsualzaton t s easer for users to comprehend the characterstcs of the flow data. The vsual representaton of algorthms [5] as well as dstrbuted program debuggng and vsualzaton [6], [7] can also be enhanced by means of event-based technques. The transton from one state of a program or algorthm to another s consdered an event. There s an ongong dscusson [5] whether state-based or eventbased approaches are more expressve for the purpose of specfyng program vsualzaton. Intruson and msuse detecton [8] n IT-networs s an evolvng area of vsualzaton. In [9] an event-based archtecture for such vsualzatons s descrbed. Based on events read from server log fles n combnaton wth events generated by the user nterface, the vsualzaton s refreshed automatcally at runtme. By such means, events le port scans, fle transfers, or arbtrary net connectons are represented vsually. Ths helps admnstrators to fnd wea spots n a networ, heavy load tmes, or msuse of resources. These examples for vsualzatons show that eventbased approaches can be used to ease the analyss of arbtrary data. However, all descrbed systems developed ther own propretary events and are lmted to a specfc vsualzaton problem. Our am s to defne a more general event-based approach n order to allow an effectve and flexble analyss of large statc or dynamc data sets. We assume that these data sets are gven n relatonal form. 3. Events The essental requrement for a general event-based vsualzaton model s the descrpton of the term event. In our context we consder events wth respect to relatonal data sets, attrbutes, and data records (.e. tuples). By dong so, we want to close the gap n flexblty (cp. []) between relatonal data management and data representaton. 3.. Event descrpton Events n our words are specal portons of a data set complyng wth certan condtons and constrants regardng attrbutes and records. Specal about these portons s that a user s nterested n them. Once detected, events may have assocated a varety of parameters, le attrbutes nvolved, data records nvolved, relatons to other events, mportance, and so forth. Concrete values for these parameters are determned ether by means of the event detecton (e.g. for nvolved records) or by users themselves (e.g. for mportance). An example of an elementary event s an exceedng of a certan threshold of an attrbute (e.g. cases of nfluenza > 300). Snce elementary events are elgble for smple vsualzaton tass only, t s necessary to allow for composte events created from elementary events and certan operators (for nstance logcal operators le and, or, not). By dong so, certan combnatons of values n a data record (e.g. sex = male and professon = manager and dagnoss = S.A.R.S.) can be detected Event formalsm Requrements: Suppose, = { A,, An } = { R R } A and R,, m are fnte and non-empty sets of attrbutes and value ranges, respectvely, and a functon range : A R assgnng each attrbute a range. We call U = m = R the data unverse. Then, a data set can be modeled as a fnte set of tupels { : and ( ) ( )} T = t t A U t A range A where a tuple s a functon that assocates each attrbute wth a value from the attrbute s value range. Event defnton: We now want to gve a general defnton of events. An event can be descrbed by means of frst order predcate logc (PL-I) formulas. The tuple relatonal calculus nown form relatonal
3 database theory [0] defnes formulas whch can be adapted to our needs. Symbols that mght appear n a formula are: tuple varables (elements of a countable nfnte set V dsjont from the unverse U ), aggregate functons over attrbutes h : A U, -ary functons of the form = then g s g : U U U (f 0 a constant), and -ary logcal predcates P U U. These symbols except the latter one are used to defne atoms, whch are then used to construct formulas. Atoms are defned as follows:. If x V s a tuple varable and A A an attrbute, then xa. s an atom denotng the value of attrbute A n the tuple represented by x. 2. If h s an aggregate functon and 3. If A A an attrbute, then ha ( ) s an atom denotng the value of the functon for A. g s a -ary functon and α,, α are atoms, then g ( α,, α ) s an atom denotng the value of the functon. We now can defne an elementary formula usng the defned atoms and predcates as follows. If P s an α α are atoms (as -ary logcal predcate and,, elem defned n.-3.), then f = P( α,, α ) s an elementary formula. In order to evaluate a formula we requre a substtuton of tuple varables wth tuples of the data set gven by a complete functon s: V T. We denote as ( ) tuple varable n α. s α the atom after applyng s to each elem Now we can state that a formula f evaluates to true ff there exsts a substtuton s so that (( s α ),, s( α )) P. Elementary formulas (wth predcates le <=,, ), common logcal connectors ( ),,, and quantfers ( ), can now be used to construct general event formulas f as usual. Followng [0], we defne the general form of an event as { x f}, where f s a formula (the event formula) and ẋ (the target) s a tuple varable n f. We call et { x f s} { x f} = an nstance of an event for a concrete tuple t T ff f s true under. substtuton s and sx ( ) = t Examples: These defntons provde us wth a powerful formalsm for descrbng a varety of events wth respect to the relatonal data model. Some formal examples of event types shall be gven. The exceedng of a threshold can be descrbed as { x x.nfluenza 300} detected wth { x x.temp x.temp 7}. A certan range of values s. An unusual networ load per user event can be defned. If a user s as { x (.load/ x x.users) >.024} nterested n maxmum values of the pollutant carbonmonoxde (CO) a correspondng event can be defned ether by usng more than one tuple varable (.e. xy, ) or by means of an aggregate n { x yy (.co x.co) } functon { x x.co = max(co) }. An ncrease of the pollutant wth respect to the prevous measurement can be descrbed by usng two tuple varables n { x x.co > y.co x.date = ( y.date+ ) }. 4. Processng events for vsualzaton Havng defned our nterpretaton of events, we now wll descrbe how these events can be ncorporated to vsualzaton. 4.. Event specfcaton The frst queston arsng s how events can be specfed by users. For that we dentfed the followng requrements: Intutve event specfcaton s requred to allow dfferent user groups (e.g. decson maers or data analysts) worng wth events effcently. Events must be storable wth respect to the dataset addressed and events must be edtable to allow an easy adaptaton to changes n the worng envronment. The specfed events should be tested for satsfablty.
4 In order to reach these goals we ntend to use event templates n combnaton wth a vsual nterface. The templates are descrbed by means of XML grammar. They provde parameters, whch are set by users. Instances of parameterzed templates can then be used for event detecton. Fgure gves an example of an event template and ts parameterzed vsual representaton. In order to create a vsual representaton of an event, symbols occurrng n event formulas are mapped to vsual prmtves, whch are lned regardng the symbol s poston n the formula. Ths allows for event specfcaton by means of draggng and lnng the prmtves n a vsual edtor. <event name= threshold > <param name= attrbute type= strng /> <param name= relaton type= choce data= <,=,> /> <param name= value type= strng /> </event> nfluenza > 300 Fgure. Exemplary threshold event template and ts parameterzed vsual representaton Event detecton Gven a set of events, t s the tas of the event detecton to determne, for whch data records these events evaluate to concrete event nstances. Ths means, that each event formula has to be evaluated regardng each data record of a data set. The result of the event detecton s a set of event nstances bound to data records. Wth respect to statc (.e. nvarant) data sets, event detecton can be easly realzed n a pre-process pror to vsualzaton. On the other hand, for dynamc data sets, whose content could be changng durng vsualzaton (e.g. records are nserted, altered, or removed) a pre-process can only ntally detect events. If a change to the data occurs, event detecton must be re-performed for each data record. Ths s necessary snce a change to a sngle data record may nfluence the detecton of events regardng other records. The event detecton can be realzed by mplementng the descrbed formalsm. In fact, the event formulas can be mapped to SQL-queres. After query executon a non-empty result-set ndcates an evaluaton of a formula to true (.e an event s detected). Technques requred for mplementng event detecton (e.g. SQL connectvty, XML handlng or table data structures) are nherent to modern programmng envronments le.net or Java Event representaton The man tas of event-based vsualzaton s to represent detected events. Dependng on the actual applcaton a varety of events may occur. Therefore, t s mportant that: occurrences of events are hghlghted for easy recognton and that dfferent event types are vsually dfferentated so that they can be easly dstngushed. Current vsualzatons represent events by means of some sort of a temporal axs (e.g. a tmelne [6], [7] or an event graph [4]) or by adaptng a gven vsual representaton (e.g. dfferent levels of detal n [2]). Therefore, we dfferentate: explct event representaton (.e. usng separate representatons for events and data) and mplct event representaton (.e. adaptng the data vsualzaton). Though our man nterest regards mplct representaton, n most applcatons t s useful to addtonally provde explct event vsualzaton upon user request (e.g. by hghlghtng rows n a table vew). In order to allow an adaptaton of a vsualzaton technque t s necessary to fnd expressve parameters that can be altered. Furthermore, t must be descrbed how these parameters change. Instantaneous changes can be expressed by actons. Moreover, n dynamc vsualzaton envronments parameter changes can be dynamc as well. Therefore, processes are defned, whch descrbe such changes. Frst results of how vsualzaton can be adapted by means of actons are gven n Secton Model of event-based vsualzaton We use the classc vsualzaton model as bass for our model. The three man steps of the classc model are flterng (.e. preprocessng the raw data), mappng (.e. mappng the data to geometrc prmtves and ther attrbutes), and renderng (.e. renderng geometrc data to mages). We extend ths model wth our event-based concepts. Therefore, parameters nfluencng each step of the classc model are ntroduced. Furthermore, events and actons/processes as well as the event detecton are ntegrated n the model (cp. Fgure 2). The presented model of event-based vsualzaton can now be used as bass for an actual realzaton presented n Secton 5.
5 Events Event detecton Actons / Processes Vsualzaton Parameters Data Flterng Mappng Renderng Fgure 2. Model of event-based vsualzaton. 5. Realzaton and prelmnary results Images Especally when data sets are large, representng all nformaton vsually s a demandng tas. Parallel Coordnates [] are commonly used for multvarate data vsualzaton. They consttute a projecton of n- dmensonal data space onto 2-dmensonal screen by means of parallel axes representng attrbutes. The data records are then represented by lne segments crossng the axes regardng the attrbute values. Wth extensons le hstograms and brushng (cp. [2], [3]) Parallel Coordnates are a powerful tool, whch s applcable for ntegraton of a general event-based model for vsualzaton. Therefore, we decded to realze our event-based model n an axes-based vsualzaton framewor called VsAxes. Ths led to the followng desgn goals: ntegraton of the event-based vsualzaton model, expressve vsual representaton of relatonal data, hgh degree of adaptablty of the vsual representaton by means of events, and hgh degree of nteractvty for easy data exploraton. In order to reach these goals a modular objectorented class desgn was chosen, whereas the eventbased model s combned wth axes-based vsualzaton by means of well defned nterfaces. Wth respect to axes-based vsual representatons, conceptually t s mportant to separate the desgn of an axs, whch s used to represent the values of an attrbute, from the arrangement of all axes on the screen. Besdes a smple statc axs, we have ntegrated three nteractve axes for easy data exploraton [4]: scroll axs, whch allows for a selecton of a value range of nterest, focus+context axs, whch allows for an emphass of a certan pont of nterest on an axs, and herarchcal axs, whch s useful for herarchcally structured value ranges. These axes can be adapted by nteractons of a user or automatcally as a result to the detecton of a certan event. Dependng on the actual data set several axes of certan types are arranged as Parallel Coordnates or as a Coordnates Wheel. The Coordnates Wheel s a novel radal arrangement for axes-based vsualzaton (and was ntroduced n [4] as TmeWheel). It s used f an attrbute of a data set provdes an order of the records of the data set (e.g. for tme-dependent data) and furthermore, the user ntends to explore the data wth respect to ths attrbute (.e. the attrbute of reference). The basc dea of the Coordnates Wheel s to place one axs representng the attrbute of reference exposed n the center of the dsplay and radally arrange further axes representng the remanng attrbutes. Just le for axes, t s possble to adapt arrangements ether nteractvely or on occurrence of events. Some examples for adaptaton shall be gven realzed by nstantaneous actons. For a frst example we vsualze a dynamc health data set consstng of the daly reported number of cases for a varety of dseases. Suppose an event { x x.nfluenza 300} occurs f the number of cases of nfluenza exceeds a threshold ndcatng an epdemc. Automatc brushng can be used n order to emphasze such crtcal data records. Fgure 3 clarfes that brushng s an effectve means for adaptng the vsual representaton n an event-based envronment. Fgure 3. Brushng data records wth respect to crtcal events. In a second example we use the Coordnates Wheel to represent a multvarate tme seres of clmate related attrbutes. The Coordnates Wheel n Fgure 4 shows sx of these tme-dependent attrbutes, each of whch mapped to one crcular axs. The central axs represents tme steps. In our case the relaton between tme and temperature represented by blue lnes s of specal nterest. If we assume a scentst analyzng the data wth respect to a specal range of temperatures crtcal regardng a certan chemcal process the event { x x.temp x.temp 7} can be defned. On occurrence of such an event t s useful to de-clutter the
6 vsual representaton by omttng rrelevant nformaton. In Fgure 4 the usefulness of such operaton becomes obvous. It can be seen, that the reducton of blue lnes n the Coordnates Wheel allows a better nsght to the sub-range of nterest. The same operaton could be performed for more than one attrbute to further de-clutter the vsual representaton. Moreover, other scentsts may defne dfferent events of nterest, whch results n adapted vsualzatons for each of them Fgure 4. Usng a scroll axs wth respect to an event reduces rrelevant nformaton and thus, clutterng n the mage. A more global adaptaton than n the prevous examples s realzable f the arrangement of the axes s calculated accordng to events. Fgure 5 (left) depcts far outlers for the attrbute precptaton from the clmate data mapped onto the upper left axs connected wth blue lnes to the central tme axs. An aggregate functon outler : A R can be used to determne outlers n the event { x x.prec > outler(prec)}. Once ths event s detected the arrangement can be adapted automatcally by means of rotatng the Coordnates Wheel and scalng ts axes. Ths leads to an arrangement, where the axs representng outlers s centered above the central tme axs and furthermore, s provded wth more drawng space. These examples show that a varety of vsual adaptatons s possble and useful. Further vsual event clues have to be examned wth respect to ther expressveness and effcency. Especally for dynamc vsualzaton enhanced technques le anmaton or color fadng are promsng. 6. Concluson and future wor In ths paper we addressed problems that arse f large data sets are analyzed vsually by dfferent users regardng dfferent aspects of the data. An event-based approach s suggested as elgble means to solve these problems. We presented a formal descrpton of events that allows for a varety of events to be specfed by users. Furthermore, the model of event-based vsualzaton descrbes how events can be ncorporated to vsualzaton. Our approach has been evaluated n frst user tests consderng human health data and clmate data n combnaton wth smple event templates. In general, our test users gave us postve feedbac regardng the adaptaton of the vsual representaton. However, event specfcaton turned out to be dffcult. Therefore, we thn our event-based approach ncreases the flexblty (user specfed events) as well as effcency (relevant nformaton emphaszed) of vsualzaton. However, more wor has to be done n the future. As yet, events are formally descrbed wth respect to tuples. On the other hand, events regardng attrbutes could be of nterest as well. Therefore, a formal descrpton of attrbute events s requred. Furthermore, n a varety of applcatons tme plays an mportant role. Although tme-dependent events can be expressed by our formalsm, the event specfcaton can be mproved by a vsual nterface whch taes tme nto account (e.g. for specfyng sequences of events [5]). The development of such a vsual edtor allowng users to specfy events n a drag and drop manner and map them to acton/processes s stll n progress. Addtonally, further parameters of vsualzaton must be revealed to be able to defne expressve actons and processes for adaptaton of the vsualzaton. Regardng ths, t s necessary to nvestgate solutons for concurrent actons and processes. Fnally, after ncorporatng the mentoned extensons, our approach has to undergo an extensve evaluaton n order to fully prove ts elgblty. References [] C. North, N. Conln, and V. San, Vsualzaton Schemas for Flexble Informaton Vsualzaton, Proceedngs of Symposum on Informaton Vsualzaton 2002, Boston, October, 28-29, 2002, pp [2] K. Matovc, H. Hauser, R. Santzer, and M.E. Gröller, Process Vsualzaton wth Levels of Detal, Proceedngs of Symposum on Informaton Vsualzaton 2002, Boston, October, 28-29, 2002, pp [3] F. Renders, F.H. Post, and H.J.W. Spoelder, Vsualzaton of tme-dependent data wth feature tracng and event detecton, The Vsual Computer, Vol. 7, No., Sprnger Verlag, Hedelberg, 200, pp
7 [4] Renders, F., Feature-Based Vsualzaton of Tme- Dependent Data, Dssertaton, Delft Unversty of Technology, 200. [5] C. Demetrescul, I. Fnocch, and J.T. Staso, Specfyng Algorthm Vsualzatons: Interestng Events or State Mappng?, In: Dehl, S. (ed.): Software Vsualzaton, LNCS 2269, Sprnger-Verlag, Berln, 2002, pp [6] T. Kunz, Vsualzng abstract events, Proceedngs of CAS Conference 994, IBM Canada Ltd. Laboratory and Natonal Research Councl of Canada, 994, pp [7] M. Khouzam and T. Kunz, Sngle Steppng n Event Vsualzaton, Proceedngs of CAS Conference 996, IBM Canada Ltd. Laboratory and Natonal Research Councl of Canada, 996, pp [8] R.F. Erbacher, K.L. Waler, and D.A. Frce, Intruson and Msuse Detecton n Large-Scale Systems, IEEE Computer Graphcs and Applcatons, Vol. 22, No., 2002, pp [9] R.F. Erbacher, A Component-Based Event-Drven Interactve Vsualzaton Software Archtecture, Proceedngs of Symposum on Informaton Systems and Engneerng (ISE 00), San Dego, July, 2000, pp [0] Atzen, P. and V. de Antonells, Relatonal Database Theory, Benjamn/Cummngs, Redwood Cty, 993. [] A. Inselberg and B. Dmsdale, Parallel Coordnates: A Tool for Vsualzaton Mult-dmensonal Geometry, Proceedngs of IEEE Vsualzaton (Vs 90), IEEE Computer Socety Press, Los Alamtos, 990, pp [2] M. Ward, Xmdvtool: Integratng multple methods for vsualzng multvarate data, Proceedngs of IEEE Vsualzaton (Vs 94), IEEE Computer Socety Press, Los Alamtos, 994, pp [3] H. Hauser, F. Ledermann, and H. Dolesch, Angular Brushng for Extended Parallel Coordnates, Proceedngs of Symposum on Informaton Vsualzaton 2002, Boston, October, 28-29, 2002, pp [4] C. Tomns, J. Abello, and H. Schumann, Axes-Based Vsualzatons wth Radal Layouts, Proceedngs of ACM Symposum on Appled Computng (SAC 04), Ncosa, Cyprus, March, 4-7, 2004, (to appear). [5] E. Hajncz, Tme Structures Formal Descrpton and Algorthmc Representaton, In: Carbonel, J.B. and J. Semann (eds.): Lecture Notes n Artfcal Intellgence 047, Sprnger-Verlag, Berln, 996. Fgure 5. Adaptaton of the axes arrangement can be used to focus on axes and to provde focused axes wth more drawng space.
The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna [email protected] Abstract.
Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
COMPUTER SUPPORT OF SEMANTIC TEXT ANALYSIS OF A TECHNICAL SPECIFICATION ON DESIGNING SOFTWARE. Alla Zaboleeva-Zotova, Yulia Orlova
Internatonal Book Seres "Informaton Scence and Computng" 29 COMPUTE SUPPOT O SEMANTIC TEXT ANALYSIS O A TECHNICAL SPECIICATION ON DESIGNING SOTWAE Alla Zaboleeva-Zotova, Yula Orlova Abstract: The gven
Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
An Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
Extending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
IMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
Forecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye [email protected] [email protected] [email protected] Abstract - Stock market s one of the most complcated systems
Luby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
Recurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
Towards Specialization of the Contract-Aware Software Development Process
Towards Specalzaton of the Contract-Aware Software Development Process Anna Derezńska, Przemysław Ołtarzewsk Insttute of Computer Scence, Warsaw Unversty of Technology, Nowowejska 5/9, 00-665 Warsaw, Poland
Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION
Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble
What is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
A Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
Study on Model of Risks Assessment of Standard Operation in Rural Power Network
Study on Model of Rsks Assessment of Standard Operaton n Rural Power Network Qngj L 1, Tao Yang 2 1 Qngj L, College of Informaton and Electrcal Engneerng, Shenyang Agrculture Unversty, Shenyang 110866,
Project Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION
A Dynamic Energy-Efficiency Mechanism for Data Center Networks
A Dynamc Energy-Effcency Mechansm for Data Center Networks Sun Lang, Zhang Jnfang, Huang Daochao, Yang Dong, Qn Yajuan A Dynamc Energy-Effcency Mechansm for Data Center Networks 1 Sun Lang, 1 Zhang Jnfang,
Using Content-Based Filtering for Recommendation 1
Usng Content-Based Flterng for Recommendaton 1 Robn van Meteren 1 and Maarten van Someren 2 1 NetlnQ Group, Gerard Brandtstraat 26-28, 1054 JK, Amsterdam, The Netherlands, [email protected] 2 Unversty of
"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
How To Understand The Results Of The German Meris Cloud And Water Vapour Product
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
Activity Scheduling for Cost-Time Investment Optimization in Project Management
PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng
Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)
Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton
Traffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal [email protected] Peter Möhl, PTV AG,
PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12
14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
BUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK. 0688, [email protected]
Proceedngs of the 41st Internatonal Conference on Computers & Industral Engneerng BUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK Yeong-bn Mn 1, Yongwoo Shn 2, Km Jeehong 1, Dongsoo
An Enhanced Super-Resolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement
An Enhanced Super-Resoluton System wth Improved Image Regstraton, Automatc Image Selecton, and Image Enhancement Yu-Chuan Kuo ( ), Chen-Yu Chen ( ), and Chou-Shann Fuh ( ) Department of Computer Scence
The OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
An Analysis of Dynamic Severity and Population Size
An Analyss of Dynamc Severty and Populaton Sze Karsten Wecker Unversty of Stuttgart, Insttute of Computer Scence, Bretwesenstr. 2 22, 7565 Stuttgart, Germany, emal: [email protected]
Design and Development of a Security Evaluation Platform Based on International Standards
Internatonal Journal of Informatcs Socety, VOL.5, NO.2 (203) 7-80 7 Desgn and Development of a Securty Evaluaton Platform Based on Internatonal Standards Yuj Takahash and Yoshm Teshgawara Graduate School
Damage detection in composite laminates using coin-tap method
Damage detecton n composte lamnates usng con-tap method S.J. Km Korea Aerospace Research Insttute, 45 Eoeun-Dong, Youseong-Gu, 35-333 Daejeon, Republc of Korea [email protected] 45 The con-tap test has the
Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters
Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany [email protected],
A FEATURE SELECTION AGENT-BASED IDS
A FEATURE SELECTION AGENT-BASED IDS Emlo Corchado, Álvaro Herrero and José Manuel Sáz Department of Cvl Engneerng, Unversty of Burgos C/Francsco de Vtora s/n., 09006, Burgos, Span Phone: +34 947259395,
Can Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang
v a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features
On-Lne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: [email protected]
Ring structure of splines on triangulations
www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon
1 Example 1: Axis-aligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
Mining Multiple Large Data Sources
The Internatonal Arab Journal of Informaton Technology, Vol. 7, No. 3, July 2 24 Mnng Multple Large Data Sources Anmesh Adhkar, Pralhad Ramachandrarao 2, Bhanu Prasad 3, and Jhml Adhkar 4 Department of
Calculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
RELIABILITY, RISK AND AVAILABILITY ANLYSIS OF A CONTAINER GANTRY CRANE ABSTRACT
Kolowrock Krzysztof Joanna oszynska MODELLING ENVIRONMENT AND INFRATRUCTURE INFLUENCE ON RELIABILITY AND OPERATION RT&A # () (Vol.) March RELIABILITY RIK AND AVAILABILITY ANLYI OF A CONTAINER GANTRY CRANE
Efficient Project Portfolio as a tool for Enterprise Risk Management
Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse
A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
DEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
BERNSTEIN POLYNOMIALS
On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
A Simple Approach to Clustering in Excel
A Smple Approach to Clusterng n Excel Aravnd H Center for Computatonal Engneerng and Networng Amrta Vshwa Vdyapeetham, Combatore, Inda C Rajgopal Center for Computatonal Engneerng and Networng Amrta Vshwa
iavenue iavenue i i i iavenue iavenue iavenue
Saratoga Systems' enterprse-wde Avenue CRM system s a comprehensve web-enabled software soluton. Ths next generaton system enables you to effectvely manage and enhance your customer relatonshps n both
A Programming Model for the Cloud Platform
Internatonal Journal of Advanced Scence and Technology A Programmng Model for the Cloud Platform Xaodong Lu School of Computer Engneerng and Scence Shangha Unversty, Shangha 200072, Chna [email protected]
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
Realistic Image Synthesis
Realstc Image Synthess - Combned Samplng and Path Tracng - Phlpp Slusallek Karol Myszkowsk Vncent Pegoraro Overvew: Today Combned Samplng (Multple Importance Samplng) Renderng and Measurng Equaton Random
A Secure Password-Authenticated Key Agreement Using Smart Cards
A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
FORMAL ANALYSIS FOR REAL-TIME SCHEDULING
FORMAL ANALYSIS FOR REAL-TIME SCHEDULING Bruno Dutertre and Vctora Stavrdou, SRI Internatonal, Menlo Park, CA Introducton In modern avoncs archtectures, applcaton software ncreasngly reles on servces provded
RequIn, a tool for fast web traffic inference
RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France [email protected], [email protected] Abstract As networked
Statistical Approach for Offline Handwritten Signature Verification
Journal of Computer Scence 4 (3): 181-185, 2008 ISSN 1549-3636 2008 Scence Publcatons Statstcal Approach for Offlne Handwrtten Sgnature Verfcaton 2 Debnath Bhattacharyya, 1 Samr Kumar Bandyopadhyay, 2
L10: Linear discriminants analysis
L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss
Support Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada [email protected] Abstract Ths s a note to explan support vector machnes.
A Dynamic Load Balancing for Massive Multiplayer Online Game Server
A Dynamc Load Balancng for Massve Multplayer Onlne Game Server Jungyoul Lm, Jaeyong Chung, Jnryong Km and Kwanghyun Shm Dgtal Content Research Dvson Electroncs and Telecommuncatons Research Insttute Daejeon,
Optimization of network mesh topologies and link capacities for congestion relief
Optmzaton of networ mesh topologes and ln capactes for congeston relef D. de Vllers * J.M. Hattngh School of Computer-, Statstcal- and Mathematcal Scences Potchefstroom Unversty for CHE * E-mal: [email protected]
A General Simulation Framework for Supply Chain Modeling: State of the Art and Case Study
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 7, Issue 2, No 3, March 2010 ISSN (Onlne): 1694-0784 ISSN (Prnt): 1694-0814 1 A General Smulaton Framework for Supply Chan Modelng: State of the
A Probabilistic Theory of Coherence
A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want
POLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and
POLYSA: A Polynomal Algorthm for Non-bnary Constrant Satsfacton Problems wth and Mguel A. Saldo, Federco Barber Dpto. Sstemas Informátcos y Computacón Unversdad Poltécnca de Valenca, Camno de Vera s/n
CVSscan: Visualization of Code Evolution
CVSscan: Vsualzaton of Code Evoluton Lucan Vonea Technsche Unverstet Endhoven Wskunde & Informatca PO Box 53, 56 MB Endhoven +3-44748 [email protected] Alex Telea Technsche Unverstet Endhoven Wskunde &
Testing Database Programs using Relational Symbolic Execution
Testng Database Programs usng Relatonal Symbolc Executon Mchaël Marcozz 1, Wm Vanhoof, Jean-Luc Hanaut Faculty of Computer Scence Unversty of Namur Rue Grandgagnage, 21 5000 Namur, Belgum Abstract Symbolc
Methodology to Determine Relationships between Performance Factors in Hadoop Cloud Computing Applications
Methodology to Determne Relatonshps between Performance Factors n Hadoop Cloud Computng Applcatons Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng and
Multiple-Period Attribution: Residuals and Compounding
Multple-Perod Attrbuton: Resduals and Compoundng Our revewer gave these authors full marks for dealng wth an ssue that performance measurers and vendors often regard as propretary nformaton. In 1994, Dens
IWFMS: An Internal Workflow Management System/Optimizer for Hadoop
IWFMS: An Internal Workflow Management System/Optmzer for Hadoop Lan Lu, Yao Shen Department of Computer Scence and Engneerng Shangha JaoTong Unversty Shangha, Chna [email protected], [email protected]
Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
Rate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer
Single and multiple stage classifiers implementing logistic discrimination
Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,
Ants Can Schedule Software Projects
Ants Can Schedule Software Proects Broderck Crawford 1,2, Rcardo Soto 1,3, Frankln Johnson 4, and Erc Monfroy 5 1 Pontfca Unversdad Católca de Valparaíso, Chle [email protected] 2 Unversdad Fns Terrae,
Cloud Auto-Scaling with Deadline and Budget Constraints
Prelmnary verson. Fnal verson appears In Proceedngs of 11th ACM/IEEE Internatonal Conference on Grd Computng (Grd 21). Oct 25-28, 21. Brussels, Belgum. Cloud Auto-Scalng wth Deadlne and Budget Constrants
Loop Parallelization
- - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze
WISE-Integrator: An Automatic Integrator of Web Search Interfaces for E-Commerce
WSE-ntegrator: An Automatc ntegrator of Web Search nterfaces for E-Commerce Ha He, Wey Meng Dept. of Computer Scence SUNY at Bnghamton Bnghamton, NY 13902 {hahe,meng}@cs.bnghamton.edu Clement Yu Dept.
Application of Multi-Agents for Fault Detection and Reconfiguration of Power Distribution Systems
1 Applcaton of Mult-Agents for Fault Detecton and Reconfguraton of Power Dstrbuton Systems K. Nareshkumar, Member, IEEE, M. A. Choudhry, Senor Member, IEEE, J. La, A. Felach, Senor Member, IEEE Abstract--The
METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS
METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng
Complex Service Provisioning in Collaborative Cloud Markets
Melane Sebenhaar, Ulrch Lampe, Tm Lehrg, Sebastan Zöller, Stefan Schulte, Ralf Stenmetz: Complex Servce Provsonng n Collaboratve Cloud Markets. In: W. Abramowcz et al. (Eds.): Proceedngs of the 4th European
Distributed Multi-Target Tracking In A Self-Configuring Camera Network
Dstrbuted Mult-Target Trackng In A Self-Confgurng Camera Network Crstan Soto, B Song, Amt K. Roy-Chowdhury Department of Electrcal Engneerng Unversty of Calforna, Rversde {cwlder,bsong,amtrc}@ee.ucr.edu
Watermark-based Provable Data Possession for Multimedia File in Cloud Storage
Vol.48 (CIA 014), pp.103-107 http://dx.do.org/10.1457/astl.014.48.18 Watermar-based Provable Data Possesson for Multmeda Fle n Cloud Storage Yongjun Ren 1,, Jang Xu 1,, Jn Wang 1,, Lmng Fang 3, Jeong-U
Form-finding of grid shells with continuous elastic rods
Page of 0 Form-fndng of grd shells wth contnuous elastc rods Jan-Mn L PhD student Insttute of Buldng Structures and Structural Desgn (tke), Unversty Stuttgart Stuttgar, Germany [email protected] Jan
How To Know The Components Of Mean Squared Error Of Herarchcal Estmator S
S C H E D A E I N F O R M A T I C A E VOLUME 0 0 On Mean Squared Error of Herarchcal Estmator Stans law Brodowsk Faculty of Physcs, Astronomy, and Appled Computer Scence, Jagellonan Unversty, Reymonta
Research of Network System Reconfigurable Model Based on the Finite State Automation
JOURNAL OF NETWORKS, VOL., NO. 5, MAY 24 237 Research of Network System Reconfgurable Model Based on the Fnte State Automaton Shenghan Zhou and Wenbng Chang School of Relablty and System Engneerng, Behang
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho
A heuristic task deployment approach for load balancing
Xu Gaochao, Dong Yunmeng, Fu Xaodog, Dng Yan, Lu Peng, Zhao Ja Abstract A heurstc task deployment approach for load balancng Gaochao Xu, Yunmeng Dong, Xaodong Fu, Yan Dng, Peng Lu, Ja Zhao * College of
An Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
