Hierarchical Clustering and Sampling Techniques for Network Monitoring
|
|
- Tamsyn Todd
- 8 years ago
- Views:
Transcription
1 S. Sindhuja Hierarhial Clustering and Sampling Tehniques for etwork Monitoring S. Sindhuja ME ABSTRACT: etwork monitoring appliations are used to monitor network traffi flows. Clustering tehniques are used to extrat network traffi patterns. Anomaly detetion shemes are used to detet network attaks. Hierarhial and partitional lustering shemes are used to analyze network traffi data values. The hierarhial data analysis uses the struture and data values for the lustering proess. The patterns are minimized using the summarization tehniques. Keywords: Categorial, luster feature, itemset, sampling. I. ITRODUCTIO The hierarhial lustering based network monitoring system uses a distane measure to alulate distane between the hierarhial strutures. umerial, ategorial and hierarhial data values are ompared using the behavior in order to plan network apaity. As network apaities inrease, traffi analysis tools fae the problem of salability due to high paket arrival rates and limited memory. In this paper, we present a hierarhial lustering tehnique for identifying signifiant traffi flow patterns. In partiular, we present a novel way of exploiting the hierarhial struture of traffi attributes, suh as IP addresses, in ombination with ategorial and numerial attributes. This algorithm addresses the above problems in previous approahes [3] of network traffi analysis as it is a one-pass, fixed memory algorithm. We demonstrate the advantages of our lustering in terms of improved auray and signifiantly redued omputation time in omparison to an earlier approah, on a standard benhmark dataset. distane measure. The network pattern analysis system uses the data values from the database. All the network traffi information are olleted and updated into the database. The traffi analysis is arried out on the stored data values. The proposed system is designed to perform instant network traffi pattern analysis proess. All the network traffi information are aptured and transferred to the data analysis tool. The data values are transferred through data streams. TCP data streams are used to transfer network traffi information. The pattern extration tool analyzes the data values and assigns the relevant data into the hierarhy. Traffi flow, aess pattern and servie information are extrated from the system. Data sampling tehniques are used in high-speed data ommuniations and list of S.Sindhuja is working as Asst Professor in SS College of Engineering, Tamilnadu. s: sindhugubi@gmail.om There is a growing need for effiient algorithms to detet important trends and anomalies in network traffi data. For example, network managers need to understand user. A key hallenge in lustering multi-dimensional network traffi data is the need to deal with various types of attributes: numerial attributes with real values, ategorial attributes with unranked nominal values and attributes with hierarhial struture [6]. For example, byte ounts are numerial, protools are ategorial and IP addresses have hierarhial struture. A key issue for these shemes is how to represent a distane funtion inorporating hierarhial attributes to help find meaningful lusters. We have proposed a hierarhial approah to lustering network traffi data that exploits the hierarhial struture present in real life data. In network traffi a hierarhial relation between two IP addresses an reflet traffi flow to or from a ommon sub-network. The hierarhial representation of suh attributes thus gives more meaning to a general luster, whih an reflet a trend in traffi flows. We propose a ommon framework to inorporate suh hierarhial attributes in the distane funtion of our lustering algorithm II RELATED WORK The problem of identifying network trends has been studied by [3]. One of the earlier works is whih studied several sampling Analysis. In [9], a probabilisti model of network traffi is estimated using the Expetation Maximization (EM) tehnique. There are several existing tools for network traffi analysis []. Some graphially [] depit the traffi like flow-san [3], while others provide top K reports like flowd [3] and flow-tools [4]. A typial graphial report might look at the soure IP addresses that are sending the most traffi, or the ports that reeive the most onnetion attempts. A problem with this approah to reporting is that it tells us nothing about soures that only send a small volume of traffi. If these small flows are ombined, then they may form a large portion of the overall traffi. Consequently, these trends maybe overlooked, unless we an identify patterns among traffi flows. The graphial tools annot in general ope well with high dimensions and fail to generalize patterns. In [6], the authors address the problem of finding patterns in network traffi by proposing a frequent itemset mining algorithm. Their tool, alled AutoFous [5], desribes the traffi mix on a network link by using textual reports as well as time series plots. It also produes onise reports that an show general trends in the data. In Setion. we desribe frequent itemset mining of network data in more detail. In [], the authors build on the work of [6] and suggest a tehnique for traffi anomaly detetion based on analyzing orrelations of destination IP addresses in outgoing traffi. This address orrelation data is modeled International Journal of Sientifi Researh in Computer Siene (IJSRCS) Vol., Issue. 4, ov. 03
2 S. Sindhuja using disrete wavelet transformation for detetion of anomalies. In [], the authors use the ombination of a rule based flow header detetion and a traffi aggregation based pattern detetion algorithm. Although our work shares a ommon philosophy of traffi aggregation using traffi headers with the tehniques mentioned above, our approah differs in the effiieny and expressiveness of our lustering tehnique. A. Frequent Itemset Clustering using AutoFous AutoFous identifies signifiant patterns in traffi flows by using frequent itemset mining. It first reates a report based on unidimensional lusters of network flows and then ombines these unidimensional lusters in a lattie to reate a traffi report based on multidimensional lusters. Unidimensional lustering: For eah attribute, AutoFous builds a one-dimension tree by ounting frequent itemsets in the network traffi data [6]. This is straightforward for Protools and Ports. It requires only those values with more than a ertain frequeny to be tallied. For IP addresses, it builds a tree of ounters to reflet the struture of the IP address spae. Counters at the leaves of the tree orrespond to the original IP addresses that appeared in the traffi. Higher level nodes in the tree orrespond to lusters of addresses that have the same ommon prefix, i.e., addresses with the first l bits in ommon, where l is the level of the node in the tree. In order to prune the tree, only those nodes having traffi volumes above a threshold are retained. Multidimensional lustering: For multidimensional lustering, AutoFous uses unidimensional luster trees to reate an m-dimensional lattie struture. Building the omplete lattie would be expensive sine it involves all possible ombinations among the values of different attributes. Instead, AutoFous uses ertain properties of the lattie struture to avoid brute fore enumeration. evertheless, AutoFous still requires multiple passes through the network traffi dataset in order to generate signifiant multidimensional lusters. An open issue for researh is how to find multidimensional lusters in network traffi in a omputationally effiient manner. To address this problem, we onsider the use of a hierarhial lustering algorithm. B. Hierarhial Clustering Our approah to finding multidimensional lusters of network data builds on the BIRCH framework [7], whih is a lustering algorithm that uses a Cluster Feature (CF) to represent a luster of reords. Instead of individual reords, a CF only keeps their suffiient statistis as a vetor <n, LS, SS> where n is the number of reords in the luster, LS is the linear sum and SS is the square sum of the attributes of the reords. Clusters are built using a hierarhial tree alled a Cluster Feature Tree (CFTree) to summarize t he input reords. The tree is built in an agglomerative hierarhial manner. Eah leaf node onsists of l lusters, where eah luster is represented by its CF reord. These CF reords an themselves be lustered at the non-leaf nodes in a reursive manner, due to the additive property of the statistis in the reord. Consequently, the lusters in the root of the tree represent the most abstrat summary of the dataset. As the CF-tree grows, more nodes are alloated to the tree. An important advantage of the CF-tree struture is that the luster hierarhy an be maintained in a fixed memory size M by re-lustering the leaf-level CF reords if neessary. If P denotes the size of a node in the tree, then it takes only O (B*(+log B M/P)) omparisons to find the losest leaf node in the tree for a given reord [7]. An open issue for using the BIRCH approah to luster network traffi reords is how to ope with numerial, ategorial and hierarhial attributes whih are used to desribe the network traffi. For example, in traffi reords, the number of bytes in a flow is represented as an integer, the type of network protool is represented using a ategorial attribute and IP addresses are attributes with a hierarhial struture. This requires a method for representing the summary statistis and alulating distanes for lusters based on these types of attributes. We also require a method for extrating signifiant lusters from the CF-tree in order to generate a onise and informative report on the given network traffi data. In the next setion we propose several modifiations to the BIRCH lustering approah to address these problems. III CLUSTERIG ETWORK TRAFFIC USIG ECHIDA The key problem in lustering network traffi data is the representation of various distanes for different data types in order to aurately desribe the relationships among different reords and lusters. We propose a framework that exploits the natural hierarhy of an attribute and ombines different distane funtions for our lustering algorithm. The input data is extrated from network traffi as 6-tuple reords <SrIP, DstIP, Protool, SrPort, DstPort, bytes>, where SrIP, DstIP are hierarhial attributes, bytes is numerial and the rest are ategorial attributes. Our algorithm takes eah reord and iteratively builds a hierarhial tree of lusters alled a CF-Tree. As the tree is built, eah reord is inserted into the losest luster using a ombined distane funtion for all attributes (Setion 3.). The radius of a luster determines if a reord should be absorbed into the luster or if the luster should be split (Setion 3.). In Setion 3.3, the luster formation proess is explained in detail. One the luster tree is reated, signifiant nodes are identified in the summarization proess (Setion 3.4). ext, the luster tree is further ompressed (Setion 3.5) to reate a onise and meaningful report. All of these require one additional pass over the luster tree. A. Distane Funtions When lustering network traffi reords we need to onsider three kinds of attributes: numerial, ategorial and hierarhial. For eah type of attribute, we define the representation that we have used for reords, lusters and distane funtions in eah ase. a) umerial Attributes: A numerial attribute is represented by a salar x[i] R The entroid [i] of a numerial attribute i in luster C having points is given by C[ i] X j [ i] - - () j International Journal of Sientifi Researh in Computer Siene (IJSRCS) Vol., Issue. 4, ov. 03
3 S. Sindhuja 3 We alulate the distane d n between the entroids of two lusters C and C by using the Eulidean distane metri. d n ( ( C, C) ) () b) Categorial Attributes: In the ase of a ategorial attribute x[i] is a vetor Z, where is the number of possible values that the ategorial attribute i an take. For a d-dimensional ategorial attribute vetor X, let the i th attribute x[i] be represented as x[i] ={a, a,,a }, where a k {0,}a. Any ategorial attribute of a reord an only take one value at a time. If a k =, then a j = 0 for j I so that, the sum of ak in a single reord is always, i.e., a k k, where a k x[i] The entroid [i]of a ategorial attribute i in luster C having points is represented by a histogram of the frequenies of the attribute values: i] j A A A X j[ i],,..., [ (3) where, k A k A k j k ak, j x j[ i] { a, j, a, j,..., a, j}, and d ( C, C ) [ ( A A ) ] (4) k, k, For example, onsider an attribute x[i] that represents Color, whih has values {Red, Green, Blue}. A value X[i]={,0,0}represents the olor Red. In addition, onsider a luster C that ontains 5 reords desribed by the Color attribute. If there are 3 instanes of Red, instanes of Green and 0 instanes of Blue, then [ i] {3,,0}. ) Hierarhial Attributes: We define a hierarhial attribute H as a generalization hierarhy in the form of an L- level tree applied to a domain of values HL whih form the leaves of the tree at level L.A non-leaf node h H l, i l, in the hierarhy represents a generalization of the leaf nodes in the subtree rooted at h,. l i Similarly, IP addresses an be represented as a hierarhial attribute using a 3-level generalization hierarhy (i.e. L=3) on the domain of integer IP address values in the range [0,3 -]. Before desribing the IP address hierarhy in detail we need to define the following: B. Radius Calulation In order to ontrol the variane of data reords within a luster, we need some measure of the radius of a luster. This gives us a sense of how ompat the luster is. The radius for numerial and ategorial attributes an be represented in a straightforward manner as the standard deviation of the attribute values of the reords in the luster. In the ase of hierarhial attributes, we need to define a new measure of radius. The final radius value of the luster is simply a linear ombination of the individual radius values of different attributes types. C. Cluster Formation We follow the general approah of BIRCH [5] for luster formation, whih results in a hierarhial set of lusters in the form of a CF-tree. The leaves of the CF-tree represent the most detailed set of lusters, and the root of the CF-tree represents the most general set of lusters desribing the input reords. Cluster formation proeeds by adding eah input data reord X to a luster C l in a leaf node of the CF-tree, suh that C l is losest to X using the distane measure D(X,C l ), given in Equation 7. If the addition of X to C l would ause the radius R l of the luster to grow above a threshold T, then a new luster is reated. We now summarize the main steps in this proess. Eah data reord X, orresponding to a 6-tuple traffi flow reord is ompared to the losest luster starting from the root along a path P to a leaf node, where the losest C arg min{ X, Cl} At the leaf node, the data reord X is inserted into the losest C l and the radius R l of the updated luster is alulated. If R l > T, where T is a threshold value in the range [0,], and if the number of CF entries in the node is less than a minimum m, then X is inserted into the node as a new luster D. Summarization Beause of the hierarhial nature of the CF-Tree, we an think of the lusters at the index nodes as holding summaries of the leaf nodes. Thus the levels of the CF-Tree form a hierarhial struture with lusters at leaf level, and super-lusters at the index levels. ote that eah node orresponds to a luster C, and the CF-entries in the node orrespond to the sub-lusters C,,C l of C. This hierarhial struture provides a natural framework to reate a summary report of the hierarhial lusters. The lusters at eah level represent a generalized set of traffi flows, whih an be used to desribe the traffi flows in the network. Sine there is redundant information between different levels, the summary report should ontain only those nodes of any level having signifiant additional information ompared to their desendant levels. In order to keep the report onise but meaningful, the summary ontains only signifiant nodes. IV OLIE ETWORK MOITORIG WITH SAMPLIG TECHIQUE The proposed system is designed to monitor stream based network traffi analysis. All network traffi information are olleted and transferred to the monitoring appliation. The lustering tehnique is used to extrat network traffi patterns. The anomalies are identified with respet to the luster information. The system uses a new hierarhial distane measure to ompare network transations. The distane measure ompares numerial, ategorial and hierarhial data values. The lustering results are hierarhially assigned in a tree view. All the traffi flow information are ompared with the distane measure. Traffi information s are assigned in the luster International Journal of Sientifi Researh in Computer Siene (IJSRCS) Vol., Issue. 4, ov. 03
4 S. Sindhuja 4 based on the distane value. Patterns are extrated with referene to the luster intervals. etwork monitoring system is divided into four modules. Transation observer module is designed to ollet network traffi information. Clustering module is used to group up the network traffi information. Data sampling module is designed to perform the pattern extration using the sample data value. Summary analysis module is used to extrat summary information about the network. V EVALUATIO Our aim was to test the auray and salability of our hierarhial traffi summarization algorithm. As a basis for omparison, we have ompared the performane of our algorithm to AutoFous [6]. In order to provide a quantitative omparison of the algorithms, and to test their ability to generalize patterns of usage, we require network data ontaining known traffi patterns. In the absene of suh publily available data with known patterns, we deided to use a widely aepted syntheti dataset for intrusion detetion from the MIT Linoln Lab. The 998 DARPA dataset [6] provides traffi files that ontain raw traffi flow reords with an assoiated label to indiate whether the reord was part of a normal or attak flow. Testing methodology We have onduted tests to ompare our algorithm with AutoFous: luster auray, detetion auray and run-time performane. Cluster Auray: The aim of this test is to hek if the lusters ontain reords that reflet known patterns present in the traffi files. The CF-Tree represents a hierarhial model of the traffi data built without supervision. The objetive of this test is to determine how aurately the lustering algorithm an group traffi reords from two different populations, ) DR = TP/(TP+F). ) FPR = FP/(TP+FP). that hooses lasses at random. It an be seen that 3 out of 4 traffi files ahieve a luster auray that is above the diagonal. In 6 out of 4 ases, the DR exeeds 50%, while the FPR is less than 50% in 4 out 6 ases. Given that we are lustering on a very limited 6-tuple of traffi features, this result supports the reliability of our algorithm in terms of luster auray. VI PERFORMACE AALYSIS Our aim was to test the auray and salability of our hierarhial traffi summarization algorithm. As a basis for omparison, we have ompared the performane of our algorithm to Ehidna. In order to provide a quantitative omparison of the algorithms, and to test their ability to generalize patterns of usage, we require network data ontaining known traffi patterns. Testing methodology We have onduted two types of tests to ompare our algorithm with Ehidna: Detetion auray and runtime performane. Detetion Auray: In partiular, our aim is to generate a summary traffi report that identifies important flows in network traffi. In this ase, we use the DARPA traes to test whether the reports generated by Ehidna or Hierarhial stream lustering () identify speifi attaks that appear in the traes. We assess the omparative utility of eah approah in finding signifiant traffi patterns by omparing the number and type of attaks reported by eah algorithm. umber of Attaks Detetion Ratio of Attaks Ipsweep eptune map Pod Satan Syslog Smurf Ehidna Attak Type Figure:. Detetion auray of Ehidna and by attak types Table o:. Detetion auray of Ehidna and by attak types Figure:. Cluster auray of Ehidna in terms of Detetion Rate and False Positive Rate on 4 files from weeks 3 through 7 of the 998 DARPA traes. Figure shows the luster auray for eah network traffi file in terms of the Detetion Rate and False Positive Rate. The diagonal line orresponds to a lassifier umber of Deteted Attaks Attak Total Ehidna Ipsweep eptune map 3 Pod 7 4 Satan 4 3 Syslog 3 Smurf International Journal of Sientifi Researh in Computer Siene (IJSRCS) Vol., Issue. 4, ov. 03
5 S. Sindhuja 5 In order to evaluate detetion auray, we applied Ehidna and Hierarhial stream lustering () to 5 daily network traffi files, whih orrespond to weeks 3-5 of the DARPA traes. For eah file, we identified the number and type of attaks, reported as lusters in the summary reports from Ehidna and Hierarhial stream lustering (). We then identified the total number of ourrenes of these attak types in the traes. An attak ourrene was deteted by Ehidna or Hierarhial stream lustering () if the desription of a luster generated by the system mathed the desription of the attak in the DARPA attak signature database. Figure and Table show the number of times eah type of attak was deteted by Ehidna and Hierarhial stream lustering (). ote that was able to produe aurate results in detetion proess than Ehidna. Run-time performane: A key motivation for using a hierarhial lustering sheme suh as Ehidna is to redue the amount of time required to find the losest luster for a traffi reord. Hierarhial stream lustering () redues mush more amount of time to detet traffi flows. This is partiularly important when the number of traffi flows is large. Table o: : Comparison of Run-time Performane on DARPA traffi Ehidna VII COCLUSIO In this paper, we have presented a lustering sheme alled Ehidna for generating summary reports of signifiant traffi flows in network traes. The key ontributions of our sheme are the introdution of a new distane measure for hierarhially-strutured attributes, suh as IP addresses, and a set of heuristis to summarize and ompress reports of signifiant traffi lusters from a hierarhial lustering algorithm. Based on an evaluation using standard benhmark traffi traes, we have demonstrated that our lustering sheme ahieves greater luster auray and omputational effiieny in omparison to previous work. REFERECES [] tools.html [] ml [3] [4] [5] [6] C. Estan, S. Savage and G. Varghese. Automatially Inferring Patterns of Resoure Consumption in etwork Traffi problem. In Proeedings of SIGCOMM 003 [7] Abdun Mahmood, Christopher Lekie, Parampalli Udaya Ehidna: Effiient Clustering of Hierarhial Data for etwork Traffi Analysis 008. Figure shows the run-time performane of Ehidna and with traffi samples varying from approximately 50x0 3 to 750x0 3 traffi reords. The input file is ombined from all days of week 6 of the 998 DARPA traffi traes. For eah sample size, the tests were repeated 3 times to give the average exeution time and error bars. The omputational omplexity of is linear with respet to the number of input traffi flow reords. S.Sindhuja is working as a Assistant Professor in Dept of CSE, SSCE. She published international journal and international onferenes. Run-time Performane on DARPA traffi Time (s) umber of Traffi Reords (x000) Ehidna Figure 3 Comparison of Run-time Performane on DARPA traffi International Journal of Sientifi Researh in Computer Siene (IJSRCS) Vol., Issue. 4, ov. 03
Echidna: Efficient Clustering of Hierarchical Data for Network Traffic Analysis
Echidna: Efficient Clustering of Hierarchical Data for Network Traffic Analysis Abdun Mahmood, Christopher Leckie, Parampalli Udaya Department of Computer Science and Software Engineering University of
More informationAn Efficient Network Traffic Classification Based on Unknown and Anomaly Flow Detection Mechanism
An Effiient Network Traffi Classifiation Based on Unknown and Anomaly Flow Detetion Mehanism G.Suganya.M.s.,B.Ed 1 1 Mphil.Sholar, Department of Computer Siene, KG College of Arts and Siene,Coimbatore.
More informationImproved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules
Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu
More informationImproved SOM-Based High-Dimensional Data Visualization Algorithm
Computer and Information Siene; Vol. 5, No. 4; 2012 ISSN 1913-8989 E-ISSN 1913-8997 Published by Canadian Center of Siene and Eduation Improved SOM-Based High-Dimensional Data Visualization Algorithm Wang
More informationBehavior Analysis-Based Learning Framework for Host Level Intrusion Detection
Behavior Analysis-Based Learning Framework for Host Level Intrusion Detetion Haiyan Qiao, Jianfeng Peng, Chuan Feng, Jerzy W. Rozenblit Eletrial and Computer Engineering Department University of Arizona
More informationStatic Fairness Criteria in Telecommunications
Teknillinen Korkeakoulu ERIKOISTYÖ Teknillisen fysiikan koulutusohjelma 92002 Mat-208 Sovelletun matematiikan erikoistyöt Stati Fairness Criteria in Teleommuniations Vesa Timonen, e-mail: vesatimonen@hutfi
More informationA Context-Aware Preference Database System
J. PERVASIVE COMPUT. & COMM. (), MARCH 005. TROUBADOR PUBLISHING LTD) A Context-Aware Preferene Database System Kostas Stefanidis Department of Computer Siene, University of Ioannina,, kstef@s.uoi.gr Evaggelia
More informationComputer Networks Framing
Computer Networks Framing Saad Mneimneh Computer Siene Hunter College of CUNY New York Introdution Who framed Roger rabbit? A detetive, a woman, and a rabbit in a network of trouble We will skip the physial
More informationA Holistic Method for Selecting Web Services in Design of Composite Applications
A Holisti Method for Seleting Web Servies in Design of Composite Appliations Mārtiņš Bonders, Jānis Grabis Institute of Information Tehnology, Riga Tehnial University, 1 Kalu Street, Riga, LV 1658, Latvia,
More informationA Keyword Filters Method for Spam via Maximum Independent Sets
Vol. 7, No. 3, May, 213 A Keyword Filters Method for Spam via Maximum Independent Sets HaiLong Wang 1, FanJun Meng 1, HaiPeng Jia 2, JinHong Cheng 3 and Jiong Xie 3 1 Inner Mongolia Normal University 2
More informationDiscovering Trends in Large Datasets Using Neural Networks
Disovering Trends in Large Datasets Using Neural Networks Khosrow Kaikhah, Ph.D. and Sandesh Doddameti Department of Computer Siene Texas State University San Maros, Texas 78666 Abstrat. A novel knowledge
More informationChannel Assignment Strategies for Cellular Phone Systems
Channel Assignment Strategies for Cellular Phone Systems Wei Liu Yiping Han Hang Yu Zhejiang University Hangzhou, P. R. China Contat: wliu5@ie.uhk.edu.hk 000 Mathematial Contest in Modeling (MCM) Meritorious
More informationRobust Classification and Tracking of Vehicles in Traffic Video Streams
Proeedings of the IEEE ITSC 2006 2006 IEEE Intelligent Transportation Systems Conferene Toronto, Canada, September 17-20, 2006 TC1.4 Robust Classifiation and Traking of Vehiles in Traffi Video Streams
More informationPattern Recognition Techniques in Microarray Data Analysis
Pattern Reognition Tehniques in Miroarray Data Analysis Miao Li, Biao Wang, Zohreh Momeni, and Faramarz Valafar Department of Computer Siene San Diego State University San Diego, California, USA faramarz@sienes.sdsu.edu
More informationChapter 6 A N ovel Solution Of Linear Congruenes Proeedings NCUR IX. (1995), Vol. II, pp. 708{712 Jerey F. Gold Department of Mathematis, Department of Physis University of Utah Salt Lake City, Utah 84112
More informationDeadline-based Escalation in Process-Aware Information Systems
Deadline-based Esalation in Proess-Aware Information Systems Wil M.P. van der Aalst 1,2, Mihael Rosemann 2, Marlon Dumas 2 1 Department of Tehnology Management Eindhoven University of Tehnology, The Netherlands
More informationIntelligent Measurement Processes in 3D Optical Metrology: Producing More Accurate Point Clouds
Intelligent Measurement Proesses in 3D Optial Metrology: Produing More Aurate Point Clouds Charles Mony, Ph.D. 1 President Creaform in. mony@reaform3d.om Daniel Brown, Eng. 1 Produt Manager Creaform in.
More informationUnit 12: Installing, Configuring and Administering Microsoft Server
Unit 12: Installing, Configuring and Administering Mirosoft Server Learning Outomes A andidate following a programme of learning leading to this unit will be able to: Selet a suitable NOS to install for
More informationDesign Implications for Enterprise Storage Systems via Multi-Dimensional Trace Analysis
Design Impliations for Enterprise Storage Systems via Multi-Dimensional Trae Analysis Yanpei Chen, Kiran Srinivasan, Garth Goodson, Randy Katz University of California, Berkeley, NetApp In. {yhen2, randy}@ees.berkeley.edu,
More informationFIRE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero
FE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero Robotis, Computer Vision and Intelligent Control Group. University
More informationTECHNOLOGY-ENHANCED LEARNING FOR MUSIC WITH I-MAESTRO FRAMEWORK AND TOOLS
TECHNOLOGY-ENHANCED LEARNING FOR MUSIC WITH I-MAESTRO FRAMEWORK AND TOOLS ICSRiM - University of Leeds Shool of Computing & Shool of Musi Leeds LS2 9JT, UK +44-113-343-2583 kia@i-maestro.org www.i-maestro.org,
More informationInterpretable Fuzzy Modeling using Multi-Objective Immune- Inspired Optimization Algorithms
Interpretable Fuzzy Modeling using Multi-Objetive Immune- Inspired Optimization Algorithms Jun Chen, Mahdi Mahfouf Abstrat In this paper, an immune inspired multi-objetive fuzzy modeling (IMOFM) mehanism
More informationMATE: MPLS Adaptive Traffic Engineering
MATE: MPLS Adaptive Traffi Engineering Anwar Elwalid Cheng Jin Steven Low Indra Widjaja Bell Labs EECS Dept EE Dept Fujitsu Network Communiations Luent Tehnologies Univ. of Mihigan Calteh Pearl River,
More informationScalable Hierarchical Multitask Learning Algorithms for Conversion Optimization in Display Advertising
Salable Hierarhial Multitask Learning Algorithms for Conversion Optimization in Display Advertising Amr Ahmed Google amra@google.om Abhimanyu Das Mirosoft Researh abhidas@mirosoft.om Alexander J. Smola
More informationWeighting Methods in Survey Sampling
Setion on Survey Researh Methods JSM 01 Weighting Methods in Survey Sampling Chiao-hih Chang Ferry Butar Butar Abstrat It is said that a well-designed survey an best prevent nonresponse. However, no matter
More informationSebastián Bravo López
Transfinite Turing mahines Sebastián Bravo López 1 Introdution With the rise of omputers with high omputational power the idea of developing more powerful models of omputation has appeared. Suppose that
More informationPerformance Analysis of IEEE 802.11 in Multi-hop Wireless Networks
Performane Analysis of IEEE 80.11 in Multi-hop Wireless Networks Lan Tien Nguyen 1, Razvan Beuran,1, Yoihi Shinoda 1, 1 Japan Advaned Institute of Siene and Tehnology, 1-1 Asahidai, Nomi, Ishikawa, 93-19
More informationBig Data Analysis and Reporting with Decision Tree Induction
Big Data Analysis and Reporting with Deision Tree Indution PETRA PERNER Institute of Computer Vision and Applied Computer Sienes, IBaI Postbox 30 11 14, 04251 Leipzig GERMANY pperner@ibai-institut.de,
More informationSLA-based Resource Allocation for Software as a Service Provider (SaaS) in Cloud Computing Environments
2 th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing SLA-based Resoure Alloation for Software as a Servie Provider (SaaS) in Cloud Computing Environments Linlin Wu, Saurabh Kumar
More informationAUTOMATED VISUAL TRAFFIC MONITORING AND SURVEILLANCE THROUGH A NETWORK OF DISTRIBUTED UNITS
AUTOMATED VISUAL TRAFFIC MOITORIG AD SURVEILLACE THROUGH A ETWORK OF DISTRIBUTED UITS A. Koutsia a, T. Semertzidis a, K. Dimitropoulos a,. Grammalidis a and K. Georgouleas b a Informatis and Telematis
More informationParametric model of IP-networks in the form of colored Petri net
Parametri model of IP-networks in the form of olored Petri net Shmeleva T.R. Abstrat A parametri model of IP-networks in the form of olored Petri net was developed; it onsists of a fixed number of Petri
More informationOpen and Extensible Business Process Simulator
UNIVERSITY OF TARTU FACULTY OF MATHEMATICS AND COMPUTER SCIENCE Institute of Computer Siene Karl Blum Open and Extensible Business Proess Simulator Master Thesis (30 EAP) Supervisors: Luiano Garía-Bañuelos,
More informationRecommending Questions Using the MDL-based Tree Cut Model
WWW 2008 / Refereed Trak: Data Mining - Learning April 2-25, 2008 Beijing, China Reommending Questions Using the MDL-based Tree Cut Model Yunbo Cao,2, Huizhong Duan, Chin-Yew Lin 2, Yong Yu, and Hsiao-Wuen
More informationNOMCLUST: AN R PACKAGE FOR HIERARCHICAL CLUSTERING OF OBJECTS CHARACTERIZED BY NOMINAL VARIABLES
The 9 th International Days of Statistis and Eonomis, Prague, September 10-1, 015 NOMCLUST: AN R PACKAGE FOR HIERARCHICAL CLUSTERING OF OBJECTS CHARACTERIZED BY NOMINAL VARIABLES Zdeněk Šul Hana Řezanková
More informationHenley Business School at Univ of Reading. Pre-Experience Postgraduate Programmes Chartered Institute of Personnel and Development (CIPD)
MS in International Human Resoure Management For students entering in 2012/3 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date of speifiation:
More informationCapacity at Unsignalized Two-Stage Priority Intersections
Capaity at Unsignalized Two-Stage Priority Intersetions by Werner Brilon and Ning Wu Abstrat The subjet of this paper is the apaity of minor-street traffi movements aross major divided four-lane roadways
More informationFOOD FOR THOUGHT Topical Insights from our Subject Matter Experts
FOOD FOR THOUGHT Topial Insights from our Sujet Matter Experts DEGREE OF DIFFERENCE TESTING: AN ALTERNATIVE TO TRADITIONAL APPROACHES The NFL White Paper Series Volume 14, June 2014 Overview Differene
More informationGABOR AND WEBER LOCAL DESCRIPTORS PERFORMANCE IN MULTISPECTRAL EARTH OBSERVATION IMAGE DATA ANALYSIS
HENRI COANDA AIR FORCE ACADEMY ROMANIA INTERNATIONAL CONFERENCE of SCIENTIFIC PAPER AFASES 015 Brasov, 8-30 May 015 GENERAL M.R. STEFANIK ARMED FORCES ACADEMY SLOVAK REPUBLIC GABOR AND WEBER LOCAL DESCRIPTORS
More informationIEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 9, NO. 3, MAY/JUNE 2012 401
IEEE TRASACTIOS O DEPEDABLE AD SECURE COMPUTIG, VOL. 9, O. 3, MAY/JUE 2012 401 Mitigating Distributed Denial of Servie Attaks in Multiparty Appliations in the Presene of Clok Drifts Zhang Fu, Marina Papatriantafilou,
More informationAgent-Based Grid Load Balancing Using Performance-Driven Task Scheduling
Agent-Based Grid Load Balaning Using Performane-Driven Task Sheduling Junwei Cao *1, Daniel P. Spooner, Stephen A. Jarvis, Subhash Saini and Graham R. Nudd * C&C Researh Laboratories, NEC Europe Ltd.,
More informationGranular Problem Solving and Software Engineering
Granular Problem Solving and Software Engineering Haibin Zhu, Senior Member, IEEE Department of Computer Siene and Mathematis, Nipissing University, 100 College Drive, North Bay, Ontario, P1B 8L7, Canada
More informationLearning Curves and Stochastic Models for Pricing and Provisioning Cloud Computing Services
T Learning Curves and Stohasti Models for Priing and Provisioning Cloud Computing Servies Amit Gera, Cathy H. Xia Dept. of Integrated Systems Engineering Ohio State University, Columbus, OH 4310 {gera.,
More informationi_~f e 1 then e 2 else e 3
A PROCEDURE MECHANISM FOR BACKTRACK PROGRAMMING* David R. HANSON + Department o Computer Siene, The University of Arizona Tuson, Arizona 85721 One of the diffiulties in using nondeterministi algorithms
More informationRELEASING MICRODATA: DISCLOSURE RISK ESTIMATION, DATA MASKING AND ASSESSING UTILITY
Setion on Survey Researh Methods JSM 008 RELEASING MICRODATA: DISCLOSURE RISK ESTIMATION, DATA MASKING AND ASSESSING UTILITY Natalie Shlomo 1 1 Southampton Statistial Sienes Researh Institute, University
More informationState of Maryland Participation Agreement for Pre-Tax and Roth Retirement Savings Accounts
State of Maryland Partiipation Agreement for Pre-Tax and Roth Retirement Savings Aounts DC-4531 (08/2015) For help, please all 1-800-966-6355 www.marylandd.om 1 Things to Remember Complete all of the setions
More informationChapter 1 Microeconomics of Consumer Theory
Chapter 1 Miroeonomis of Consumer Theory The two broad ategories of deision-makers in an eonomy are onsumers and firms. Eah individual in eah of these groups makes its deisions in order to ahieve some
More informationProgramming Basics - FORTRAN 77 http://www.physics.nau.edu/~bowman/phy520/f77tutor/tutorial_77.html
CWCS Workshop May 2005 Programming Basis - FORTRAN 77 http://www.physis.nau.edu/~bowman/phy520/f77tutor/tutorial_77.html Program Organization A FORTRAN program is just a sequene of lines of plain text.
More informationAn Enhanced Critical Path Method for Multiple Resource Constraints
An Enhaned Critial Path Method for Multiple Resoure Constraints Chang-Pin Lin, Hung-Lin Tai, and Shih-Yan Hu Abstrat Traditional Critial Path Method onsiders only logial dependenies between related ativities
More informationSolving the Game of Awari using Parallel Retrograde Analysis
Solving the Game of Awari using Parallel Retrograde Analysis John W. Romein and Henri E. Bal Vrije Universiteit, Faulty of Sienes, Department of Mathematis and Computer Siene, Amsterdam, The Netherlands
More informationRanking Community Answers by Modeling Question-Answer Relationships via Analogical Reasoning
Ranking Community Answers by Modeling Question-Answer Relationships via Analogial Reasoning Xin-Jing Wang Mirosoft Researh Asia 4F Sigma, 49 Zhihun Road Beijing, P.R.China xjwang@mirosoft.om Xudong Tu,Dan
More informationNeural network-based Load Balancing and Reactive Power Control by Static VAR Compensator
nternational Journal of Computer and Eletrial Engineering, Vol. 1, No. 1, April 2009 Neural network-based Load Balaning and Reative Power Control by Stati VAR Compensator smail K. Said and Marouf Pirouti
More informationTo Coordinate Or Not To Coordinate? Wide-Area Traffic Management for Data Centers
To Coordinate Or Not To Coordinate? Wide-Area Traffi Management for Data Centers Srinivas Narayana, Joe Wenjie Jiang, Jennifer Rexford, Mung Chiang Department of Computer Siene, and Department of Eletrial
More informationOn the Characteristics of Spectrum-Agile Communication Networks
1 On the Charateristis of Spetrum-Agile Communiation Networks Xin Liu Wei Wang Department of Computer Siene University of California, Davis, CA 95616 Email:{liu,wangw}@s.udavis.edu Abstrat Preliminary
More informationImpedance Method for Leak Detection in Zigzag Pipelines
10.478/v10048-010-0036-0 MEASUREMENT SCIENCE REVIEW, Volume 10, No. 6, 010 Impedane Method for Leak Detetion in igzag Pipelines A. Lay-Ekuakille 1, P. Vergallo 1, A. Trotta 1 Dipartimento d Ingegneria
More informationarxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrence Berkeley National Laboratory One Cyclotron Road Berkeley, CA 94720 USA
LBNL-52402 Marh 2003 On the Speed of Gravity and the v/ Corretions to the Shapiro Time Delay Stuart Samuel 1 arxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrene Berkeley National Laboratory
More informationBandwidth Allocation and Session Scheduling using SIP
JOURAL OF COUICAIS, VOL., O. 5, AUGUS 006 7 Bandwidth Alloation and Session Sheduling using SIP Hassan HASSA, Jean-arie GARCIA and Olivier BRU LAAS-CRS, oulouse, Frane Email: {hhassan}@laas.fr Abstrat
More informationMarker Tracking and HMD Calibration for a Video-based Augmented Reality Conferencing System
Marker Traking and HMD Calibration for a Video-based Augmented Reality Conferening System Hirokazu Kato 1 and Mark Billinghurst 2 1 Faulty of Information Sienes, Hiroshima City University 2 Human Interfae
More informationImpact Simulation of Extreme Wind Generated Missiles on Radioactive Waste Storage Facilities
Impat Simulation of Extreme Wind Generated issiles on Radioative Waste Storage Failities G. Barbella Sogin S.p.A. Via Torino 6 00184 Rome (Italy), barbella@sogin.it Abstrat: The strutural design of temporary
More informationElectrician'sMathand BasicElectricalFormulas
Eletriian'sMathand BasiEletrialFormulas MikeHoltEnterprises,In. 1.888.NEC.CODE www.mikeholt.om Introdution Introdution This PDF is a free resoure from Mike Holt Enterprises, In. It s Unit 1 from the Eletrial
More informationi e AT 1 of 2012 DEBT RECOVERY AND ENFORCEMENT ACT 2012
i e AT 1 of 2012 DEBT RECOVERY AND ENFORCEMENT ACT 2012 Debt Reovery and Enforement At 2012 Index i e DEBT RECOVERY AND ENFORCEMENT ACT 2012 Index Setion Page PART 1 INTRODUCTORY 5 1 Short title... 5
More informationDeduplication with Block-Level Content-Aware Chunking for Solid State Drives (SSDs)
23 IEEE International Conferene on High Performane Computing and Communiations & 23 IEEE International Conferene on Embedded and Ubiquitous Computing Dedupliation with Blok-Level Content-Aware Chunking
More informationAn integrated optimization model of a Closed- Loop Supply Chain under uncertainty
ISSN 1816-6075 (Print), 1818-0523 (Online) Journal of System and Management Sienes Vol. 2 (2012) No. 3, pp. 9-17 An integrated optimization model of a Closed- Loop Supply Chain under unertainty Xiaoxia
More informationThe Application of Mamdani Fuzzy Model for Auto Zoom Function of a Digital Camera
(IJCSIS) International Journal of Computer Siene and Information Seurity, Vol. 6, No. 3, 2009 The Appliation of Mamdani Fuzzy Model for Auto Funtion of a Digital Camera * I. Elamvazuthi, P. Vasant Universiti
More informationRecovering Articulated Motion with a Hierarchical Factorization Method
Reovering Artiulated Motion with a Hierarhial Fatorization Method Hanning Zhou and Thomas S Huang University of Illinois at Urbana-Champaign, 405 North Mathews Avenue, Urbana, IL 680, USA {hzhou, huang}@ifpuiuedu
More informationWireless Transmission Systems. Instructor
Teleommuniation Engineering Tehnology, Texas A&M University Wireless Transmission Systems Leture Notes - Copyright Jeff M. MDougall 2 Wireless Transmission Systems Teleommuniation Engineering Tehnology,
More informationHenley Business School at Univ of Reading. Chartered Institute of Personnel and Development (CIPD)
MS in International Human Resoure Management (full-time) For students entering in 2015/6 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date
More informationSoft-Edge Flip-flops for Improved Timing Yield: Design and Optimization
Soft-Edge Flip-flops for Improved Timing Yield: Design and Optimization Abstrat Parameter variations ause high yield losses due to their large impat on iruit delay. In this paper, we propose the use of
More informationA Three-Hybrid Treatment Method of the Compressor's Characteristic Line in Performance Prediction of Power Systems
A Three-Hybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition of Power Systems A Three-Hybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition
More informationCustomer Efficiency, Channel Usage and Firm Performance in Retail Banking
Customer Effiieny, Channel Usage and Firm Performane in Retail Banking Mei Xue Operations and Strategi Management Department The Wallae E. Carroll Shool of Management Boston College 350 Fulton Hall, 140
More informationAutomated Test Generation from Vulnerability Signatures
Automated Test Generation from Vulneraility Signatures Adulaki Aydin, Muath Alkhalaf, and Tevfik Bultan Computer Siene Department University of California, Santa Barara Email: {aki,muath,ultan}@s.us.edu
More informationBypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems
Bypassing Spae Explosion in Regular Expression Mathing for Network Intrusion Detetion and Prevention Systems Jignesh Patel Alex X. Liu Eri Torng Department of Computer Siene and Engineering Mihigan State
More informationModeling and analyzing interference signal in a complex electromagnetic environment
Liu et al. EURASIP Journal on Wireless Communiations and Networking (016) 016:1 DOI 10.1186/s13638-015-0498-8 RESEARCH Modeling and analyzing interferene signal in a omplex eletromagneti environment Chun-tong
More informationi e AT 8 of 1938 THE PERSONAL INJURIES (EMERGENCY PROVISIONS) ACT 1939
i e AT 8 of 1938 THE PERSONAL INJURIES (EMERGENCY PROVISIONS) ACT 1939 The Personal Injuries (Emergeny Provisions) At 1939 Index i e THE PERSONAL INJURIES (EMERGENCY PROVISIONS) ACT 1939 Index Setion
More informationContext-Sensitive Adjustments of Cognitive Control: Conflict-Adaptation Effects Are Modulated by Processing Demands of the Ongoing Task
Journal of Experimental Psyhology: Learning, Memory, and Cognition 2008, Vol. 34, No. 3, 712 718 Copyright 2008 by the Amerian Psyhologial Assoiation 0278-7393/08/$12.00 DOI: 10.1037/0278-7393.34.3.712
More informationINCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS
Virginia Department of Taxation INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS www.tax.virginia.gov 2614086 Rev. 07/14 * Table of Contents Introdution... 1 Important... 1 Where to Get Assistane... 1 Online
More informationHow To Fator
CHAPTER hapter 4 > Make the Connetion 4 INTRODUCTION Developing seret odes is big business beause of the widespread use of omputers and the Internet. Corporations all over the world sell enryption systems
More informationAngelCast: Cloud-based Peer-Assisted Live Streaming Using Optimized Multi-Tree Construction
AngelCast: Cloud-based Peer-Assisted Live Streaming Using Optimized Multi-Tree Constrution Raymond Sweha Boston University remos@s.bu.edu Vathe Ishakian Boston University visahak@s.bu.edu Azer Bestavros
More informationFrom a strategic view to an engineering view in a digital enterprise
Digital Enterprise Design & Management 2013 February 11-12, 2013 Paris From a strategi view to an engineering view in a digital enterprise The ase of a multi-ountry Telo Hervé Paault Orange Abstrat In
More informationDownlink Scheduling and Radio Resource Allocation in Adaptive OFDMA Wireless Communication Systems for User-Individual QoS
Downlin Sheduling and Radio Resoure Alloation in Adaptive OFDMA Wireless Communiation Systems for User-Individual QoS Lu Yanhui, Wang Chunming, Yin Changhuan, and Yue Guangxin Abstrat In this paper, we
More informationUNIVERSITY AND WORK-STUDY EMPLOYERS WEB SITE USER S GUIDE
UNIVERSITY AND WORK-STUDY EMPLOYERS WEB SITE USER S GUIDE September 8, 2009 Table of Contents 1 Home 2 University 3 Your 4 Add 5 Managing 6 How 7 Viewing 8 Closing 9 Reposting Page 1 and Work-Study Employers
More informationSupply chain coordination; A Game Theory approach
aepted for publiation in the journal "Engineering Appliations of Artifiial Intelligene" 2008 upply hain oordination; A Game Theory approah Jean-Claude Hennet x and Yasemin Arda xx x LI CNR-UMR 668 Université
More informationA Survey of Usability Evaluation in Virtual Environments: Classi cation and Comparison of Methods
Doug A. Bowman bowman@vt.edu Department of Computer Siene Virginia Teh Joseph L. Gabbard Deborah Hix [ jgabbard, hix]@vt.edu Systems Researh Center Virginia Teh A Survey of Usability Evaluation in Virtual
More informationSrinivas Bollapragada GE Global Research Center. Abstract
Sheduling Commerial Videotapes in Broadast Television Srinivas Bollapragada GE Global Researh Center Mihael Bussiek GAMS Development Corporation Suman Mallik University of Illinois at Urbana Champaign
More informationTHE PERFORMANCE OF TRANSIT TIME FLOWMETERS IN HEATED GAS MIXTURES
Proeedings of FEDSM 98 998 ASME Fluids Engineering Division Summer Meeting June 2-25, 998 Washington DC FEDSM98-529 THE PERFORMANCE OF TRANSIT TIME FLOWMETERS IN HEATED GAS MIXTURES John D. Wright Proess
More informationRISK-BASED IN SITU BIOREMEDIATION DESIGN JENNINGS BRYAN SMALLEY. A.B., Washington University, 1992 THESIS. Urbana, Illinois
RISK-BASED IN SITU BIOREMEDIATION DESIGN BY JENNINGS BRYAN SMALLEY A.B., Washington University, 1992 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Siene in Environmental
More informationINCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS
Virginia Department of Taxation INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS www.tax.virginia.gov 2614086 Rev. 01/16 Table of Contents Introdution... 1 Important... 1 Where to Get Assistane... 1 Online File
More informationCriminal Geographical Profiling: Using FCA for Visualization and Analysis of Crime Data
Criminal Georaphial rofilin: Usin FCA for Visualization and Analysis of Crime Data Quist-Aphetsi Kester, MIEEE Leturer, Faulty of Informatis Ghana Tehnoloy University Collee Ara, Ghana Email: kquist-aphetsi@tu.edu.h
More informationA novel active mass damper for vibration control of bridges
IABMAS 08, International Conferene on Bridge Maintenane, Safety and Management, 3-7 July 008, Seoul, Korea A novel ative mass damper for vibration ontrol of bridges U. Starossek & J. Sheller Strutural
More informationChapter 1: Introduction
Chapter 1: Introdution 1.1 Pratial olumn base details in steel strutures 1.1.1 Pratial olumn base details Every struture must transfer vertial and lateral loads to the supports. In some ases, beams or
More informationRATING SCALES FOR NEUROLOGISTS
RATING SCALES FOR NEUROLOGISTS J Hobart iv22 WHY Correspondene to: Dr Jeremy Hobart, Department of Clinial Neurosienes, Peninsula Medial Shool, Derriford Hospital, Plymouth PL6 8DH, UK; Jeremy.Hobart@
More informationComputational Analysis of Two Arrangements of a Central Ground-Source Heat Pump System for Residential Buildings
Computational Analysis of Two Arrangements of a Central Ground-Soure Heat Pump System for Residential Buildings Abstrat Ehab Foda, Ala Hasan, Kai Sirén Helsinki University of Tehnology, HVAC Tehnology,
More informationA Comparison of Service Quality between Private and Public Hospitals in Thailand
International Journal of Business and Soial Siene Vol. 4 No. 11; September 2013 A Comparison of Servie Quality between Private and Hospitals in Thailand Khanhitpol Yousapronpaiboon, D.B.A. Assistant Professor
More informationSocial Network Analysis Based on BSP Clustering Algorithm
Soial Network Analysis Based on BSP Clustering Algorithm ong Shool of Business Administration China University of Petroleum ABSRAC Soial network analysis is a new researh field in data mining. he lustering
More informationOptimal Allocation of Filters against DDoS Attacks
Optimal Alloation of Filters against DDoS Attaks Karim El Defrawy ICS Dept. University of California, Irvine Email: keldefra@ui.edu Athina Markopoulou EECS Dept. University of California, Irvine Email:
More informationBENEFICIARY CHANGE REQUEST
Poliy/Certifiate Number(s) BENEFICIARY CHANGE REQUEST *L2402* *L2402* Setion 1: Insured First Name Middle Name Last Name Permanent Address: City, State, Zip Code Please hek if you would like the address
More informationCombining refractive and topographic data in corneal refractive surgery for astigmatism
Combining refrative and topographi data in orneal refrative surgery for astigmatism A new method based on polar value analysis and mathematial optimization Kristian Næser Department of Ophthalmology, Randers
More informationprotection p1ann1ng report
f1re~~ protetion p1ann1ng report BUILDING CONSTRUCTION INFORMATION FROM THE CONCRETE AND MASONRY INDUSTRIES Signifiane of Fire Ratings for Building Constrution NO. 3 OF A SERIES The use of fire-resistive
More informationOpenSession: SDN-based Cross-layer Multi-stream Management Protocol for 3D Teleimmersion
: SN-based ross-layer Multi-stream Management Protool for 3 Teleimmersion hsan refin Raoul Rivas Rehana Tabassum Klara Nahrstedt University of Illinois at Urbana-hampaign, Urbana, IL {marefin2, trivas,
More informationThe Advantages of Using Aountable Care Organizations ( ACOs)
JLEO, V3 S i77 Struturing Inentives within Aountable Care Organizations Brigham Frandsen Brigham Young University James B. Rebitzer* Boston University Shool of Management and ational Bureau of Eonomi Researh
More informationA Reputation Management Approach for Resource Constrained Trustee Agents
A Reputation Management Approah for Resoure Constrained rustee Agents Han Yu, Chunyan Miao, Bo An 2, Cyril Leung 3, and Vitor R. Lesser 4 Nanyang ehnologial University, Singapore 2 he Key Lab of Intelligent
More information