Research on a Kind of QoS-Sensitive Semantic Web Services Composition Method Based on Genetic Algorithm

Size: px
Start display at page:

Download "Research on a Kind of QoS-Sensitive Semantic Web Services Composition Method Based on Genetic Algorithm"

Transcription

1 roceedings of the 7th International Conference on Innovation & Manageent 893 Research on a Kind of QoS-Sensitive Seantic Web Services Coposition Method Based on Genetic Algorith Cao Hongjiang, Nie Guihua, Chen Donglin School of Econoics, Wuhan University of Technology, Wuhan,.R.China, (E-l: chjnewfree@yahoo.co.cn) Abstract In the process of QoS-sensitive business, the user not only cares about whether the function of the process will be finished successfully, but also pays great attention to the QoS of the whole process. Thus, how to ake a choice aong the candidate web services so that the selected ones can not only finish the assigned task and confor to the local restriction, but also can cooperate with other web services and optiize the QoS of the process, becoes a key proble. In order to solve this proble, an ontology odel of the web service quality attributes and an approach based on the generic algorith were proposed. The experiental results show the effectiveness of this ethod. Key words Seantic web services; Ontology odel; Qos; Generic algorith Introduction With the continuous developent of seantic web services, dync service coposition which based on web services as an iportant ethod to achieving a flexible, rapid integration becoe a new hotspot. At present, as the nuber of service coponent growth rapidly, how to select the results to eet the needs of the user QoS requireents quickly in assive result is one of the n objectives of the developent of web service coposition. In the Web service selection, in addition to functional attributes, the user can also in soe non-functional properties of set constrnts to coplete, naely, by constrnt QoS (quality of service) property to choose. QoS contn the attributes are: price, response tie, avlability, and reliability, and so on [,2] and the Web service providers will often set a range of QoS property value, so as to provide reference for potential users. In the process of QoS-sensitive business, the user not only cares about whether the function of the process will be finished successfully, but also pays great attention to the QoS of the whole process. Thus, how to ake a choice aong the candidate web services so that the selected ones can not only finish the assigned task and confor to the local restriction, but also can cooperate with other web services and optiize the QoS of the process, becoes a key proble. We know that QoS query essage forat provided by the different service providers and service users is likely to be a variety of In order to provide QoS achine-readable inforation, the establishent of a QoS ontology odel to standardize the description of the inforation QoS inforation is iperative. This paper presents an ontology odel of web service quality attributes and genetic algoriths ethods to select Web services effectively, and through experients proved the effectiveness of the ethod. Copared with existing ethods, this paper presents the ethod has a better universal. 2 Related Work With the popularity of Web services in recent years, there has been a lot of research work in the area of use of Web service coposition to obtn business processes. L Aversano [3] et al. proposed to use existing Web services, through the dync cobination of the to be business processes As the Internet environent and dync nature of the inherent randoness, people tend to deand through a cobination of Web services have been in business processes to eet certn service level agreeent SLA (service level agree-ent), which satisfy the QoS constrnts. Therefore, how to solve the QoS-sensitive issue of Web service coposition, the researchers ade a lot of discussion. One of typical odel is used eta-process and eta-services concept, a eta-service representative a group of siilar business functions of the Web services. Thus, concrete services that corresponding to the sae eta- service can be replaced with each other. Meta-process is coposed by the eta services to an abstract process odel. In such paradig, soe researchers have proposed ethods based on integer progrng [4, 5] ; this ethod assues that the constrnt conditions and objective function has a linear character. Zeng s research [4] focus on overhead response tie, effectiveness and reliability QoS attributes. And in the course of calculation the objective function used the logarithic strn. Although, Zeng think their odel can extend the other siilar behavior property, in reality, the process required to

2 894 roceedings of the 7th International Conference on Innovation & Manageent eet the constrnts ore coplex, often do not have the linear characteristics. Such as service dependencies and user preferences. Therefore, Zeng proposed odel does not have a good universal. Although Aggarwal [5] referred to the needs of such non-linear constrnt, but did not give the appropriate solutions. Copared with such ethods based on integer progrng, the ethod proposed in this article based on genetic algoriths that can handle ore fors of restrnt, with a better universal. Such paradig is used in another ethod of artificial intelligence query strategy. This ethods fro artificial intelligence constrnt logic CL (constrnt logic progrng), it has the advantage of strong odeling capabilities; Yu T and Berbner R s [6][7] article is the study of this approach. As the CL has the characteristics of transission constrnts, therefore, these ethods are ore efficient query, but the cost of its own is relatively large. In the QoS-sensitive Web service coposition process, but also due to fewer constrnts in general are relatively siple. Therefore, this article considers that the adoption cost of a relatively sall. Genetic algorith is ore suitable. As the genetic algorith itself does not provide echaniss to describe the binding, so a lot of research work to achieve through the penalty function ethod. For QoS- sensitive Web service coposition proble [8, 9, 0]. 3 The Qos Ontology Model Different service providers and service users with the QoS query essage forat is likely to be varied. In order to provide QOS achine-readable inforation, the establishent of a QoS ontology odel to regulate the QOS inforation description is necessary [].This paper presents an ontology odel of the web service quality attributes, to a unified description of the various service quality attributes. Ontology is structured as follows: Top-level ontology Top-level ontology nly definitions soe of the advanced concepts related to QOS odels.for each concept and the relationship between these concepts will be further explanation in this article, Qosrofile is the ost iportant concept, which is the n body of Qos odel. QosAttribute: used to indicate Qos paraeter, which is the super class of all Qos paraeters,in practical situations, it contns the description of the price of Qos paraeters describing the response tie of the Qos paraeters, describing the reliability of the Qos paraeters, etc. Qosrofile through its hasqosatrribute attributes can define all the Qos paraeters of a service Figure QoS Ontology Model In order to eet the needs of Web services atching and choice, QosAirribute derived for the three subclasses: CoonQosAttribute, DonQosAttribute, and SpecialQosAttribute. CoonQosAttribute refers to all WebServiee need to possess Qos paraeters, such as price, response tie, reliability, reputation and so on. DonQosAttribute refers to the Qos paraeters relevant to the don, such as the packaging of the books bought is hardcover" or stripped-down" and so on. SpecialQosAttribute used to describe service-specific QoS paraeters. For service providers in the publication of the QoS inforation or Service requestor proposed QoS requireents. Accordingly, Qosrofile through the three subattributes of hasqosattribute: hascoonqos Attribute, hasdonqosattribute, hasspecialqosattribute link with three subclass.qosattribute is the super class used to describe all the paraeters of QoS. Qos paraeters of the class can b e expressed as etrics, onotonicity, and share of weight in the Qosrofile and so on. If it is

3 roceedings of the 7th International Conference on Innovation & Manageent 895 coposite Qos paraeters, this odel can also describe it with other Qos paraeters. QoS calculation of business processes In order to coplete the Web services choices according to QoS, we need to describe how fro a single Web service QoS attribute value calculating business processes. For a given specific Web services, business processes, Table shows the calculation of the entire process of the QoS rules [2], and lists the calculation function corresponds to the variety of coon processes structure and coon QoS properties. Meanwhile, in the last line of Table also gives the process the calculation of user-defined (such as the don dependent properties) property rules. In this article, due to space liitations, only by tie, cost, QoS, etc. these coon attributes, to deonstrate, validate the ethod proposed in the text. Table The Model for Coputing the QoS of Services Copositon Qos Attribute Sequence Switch arallel Loop Tie Cost Avlability Reliability T(t ) i C(t ) i T(ti) ax{t(t i) i (...p) } kt(t) p C(ti) A(t i) A(ti) R(t ) i R(ti) C(t i) kc(t) A(t i) A(T) k R(t ) i R(t) k User-defined fs(f(t i )) i{...} f R ((,F(t i ))) i{...n} f F (F(t i )) i{...p} f L (k,f(t)) 4 A Method Based on Genetic Algorith Genetic algorith is based on the echanis of natural selection and natural genetic search algorith, which is an effective way to solve the optiization proble. Using genetic algorith for solving optiization probles, we first need to select soe individuals in the feasible don is encoded as a chroosoe to for the first-generation groups, and calculate the fitness of each chroosoe. Next, the algorith uses the selection echanis randoly selected fro the group of chroosoes as the saples before reproductive process. The probability of a chroosoe being selected is proportional to its fitness. In the next reproduction process, Genetic algorith uses crossover and utation operator to the selection of chroosoes after the reproduction processing. Genetic algorith does not require QoS cobination operations (also including the objective function and constrnts) have linear characteristics. This akes our approach ore suitable for (even user-defined) QoS attributes, without the need for linearization. In the QoS-sensitive Web service coposition probles, the chroosoes described as an integer array of S = (S, S 2,... S n ). The S i array corresponds to each eleent of business processes a sub-task. Each eleent contns an index, the index pointing to the eleents in a group with the sae or siilar functionality as Web services in the selected Web services. 4. Dync fitness function According to characteristics of QoS-sensitive Web service coposition proble, the fitness function of chroosoes requires soe QoS attribute value to the axiu, while leaving other parts of the QoS property value of the iniu. Siilarly, if the user-defined QoS properties of a specific area, then the fitness function would also like to ake further adjustents under the circustances. In addition, the fitness function should be able to suppress the chroosoe does not eet the constrnts to guide the direction of the to evolve to eet the constrnts, as well as violations of the different QoS constrnts given different weights: Vl i (g) 0, i =,2...n () Where represents the violation of section i of constrnts on chroosoes brought about the penalty value of fitness. D (g) is defined as: the ipact of current chroosoe breach of the various types of constrnt

4 896 roceedings of the 7th International Conference on Innovation & Manageent n D(g) = Vl i (g)y (2) i = In this forula, if chroosoe violates the constrnt, then y i is, otherwise y i is 0. Because different etrics of its range is usually not the sae. Values are often differences in the direction, if the raw etric data directly to calculate, could ake between the results are not coparable. Therefore, the need for data pre-processing, apping the all to the sae range, and a unified direction for all etrics values. For exaple, etrics M's range is [in, ax], an instance of the raw easureent data is v, If the etrics values upward direction, that is, the greater the value of v, sd the better the quality of service(such as Web service's credibility), then according to the forula (3) to be noralized it v - in,in ax - in V' = (3), v ax 0, v in Conversely, if the etrics values downward direction, that is, the saller the value of v, sd the better the quality of services(such as the Web service operation of the response tie and delay tie), then according to the forula (4) to be noralized it. ax - v,in v ax ax - in V' = (4), v in 0, v ax After standardized processing, with all etrics of the data fall into [0,] interval, and the direction of their values are upward. These values, in the QOS ontology odel presented in this paper have a corresponding classes and attributes to represent According to coon QoS properties in the Table,the fitness function is defined as follows: A(g) + 2R(g) F(g) = + 5 D (5) 3C(g) + 4 T(g) In this forula,,... 5 are positive real nuber, as a paraeter.,... 4 on behalf of the user for a specific QoS attributes to set the weights, 5 is the overall weight of violating the constrnts. Usually, if a penalty factor with a high weight, In the evolutionary process, could ake chroosoe which close to the optial solution but violate the constrnt discarded in the early evolution. To address this issue, this paper presents dync punishent strategies: the penalty weight increases along with the descendant nuber increases. To ake such a chroosoe could be retned, through several generations of evolution; the entire group will eet constrnts. Therefore, dync fitness function can be defined as: F(g) = A(g) C(g) R(g) T(g) 4 i 5 v + D(g) ax gen gen Where gen represents Current evolutionary ties, gen ax represents Maxiu nuber of evolutionary 4.2 Terination conditions of genetic algoriths Specify a axiu nuber of evolutions are a ore efficient way. Therefore, in QoS-sensitive issue of Web service coposition, using the terination condition as follows: set the axiu nuber of offspring gen ax, iterate until the constrnt (D (g) = 0) have been satisfied. If have already reached the axiu nuber of generations, but the constrnts have not been et. Then through the algorith to deterine, we think that there is no corresponding solution. Or until the optiization of the chroosoe in the offspring is not changed so far. ax (6)

5 roceedings of the 7th International Conference on Innovation & Manageent 897 In this way, QoS-sensitive Web service coposition proble can be described by eans of chroosoes. And through repeated chroosoe selection, crossover and utation operators to continuously optiize the results; until the terination condition of the algorith is true, we can get the optial solution of Web service coposition. 5 Experient This section will be through experients analyze and validate the effectiveness of the ethod proposed in this paper. And through analysis of the offspring produced by genetic algorith is to observe the changes in chroosoe fitness. Thus Coparison of static and dync fitness functions. We use elite genetic algorith, in which each evolved to retn only the best two chroosoes. Crossover probability 0.7, utation probability of 0.0, population size of 00, the selection echanis used switch wheel ethod. The ipleentation of genetic algoriths for each experient 50 ties and record the average of the results. In order to observe the different fitness function, to require the evolution to achieve preset nuber of ties, if the descendant has not iproved, then stops the algorith. Business processes used in the experient included 25 service calls, of which there are 6 different tasks, For each task. Were observed when the nuber of optional web services are 5,0,5,20,25 situation at the tie Figure 2 shows, the constrnt is to require the cost and service response tie to reach the optiu, the figure shows the genetic algorith can find solutions that satisfy the constrnt. Figure 2 Coparison of Different Fitness Functions for Different araeter 6 Conclusion This paper presents a ethod based on genetic algoriths to solve the QoS-sensitive Web service coposition proble. Through the use of genetic algoriths for business processes in the task select the appropriate Web services, and binding, So that business processes can not only satisfy the constrnts also ake specified QoS attribute to achieve optial. Experiental data is to prove the effectiveness of this ethod. Meanwhile because of genetic algorith is not subject to linear constrnts, therefore has a better universality and the extendibility. resented in this paper using dync fitness function is to reduce the influence of Constrnts to fine chroosoe, increasing the copetitiveness of fine chroosoes. In addition, the proposed QOS ontology odel enables QOS attributes to get a unified description. In future work, will further optiize the fitness function; and consider the adoption of genetic algorith to solve the autoatic generation of eta-process in seantic web service coposition process.

6 898 roceedings of the 7th International Conference on Innovation & Manageent References [] ISO. UNE-EN-ISO, ISO 8402 (art of the ISO ): Quality Vocabulary[S] [2] IT Recoendation. E800 Quality of Service and Dependability Vocabulary[S] [3] Aversano L, Canfora G, Ciapi A. An Algorith for Web Service Discovery Through Their Coposition[C]. roceedings of the 2004 IEEE International Conference on Web services (ICWS). San Diego, California, USA: IEEE Coputer Society, 2004: [4] Zeng LZ, Benatallah B, Ngu AHH. QoS-Aware Middleware for Web Services Coposition[J]. IEEE Trans. on Software Engineering, 2004, 30(5):3 327 [5] Aggarwal R, Vera K, Miller J, et al. Constrnt Driven Web Service Coposition in METEOR-S[C] IEEE International Conference on ServicesCoputing, (SCC). Shangh, China: IEEE Coputer Society, 2004:23-30 [6] Yu T, Lin KJ. Service Selection Algoriths for Coposing Coplex Services with Multiple QoS Constrnts[C]. ICSOC, Heidelberg: Springer-Verlag, 2005:30 43 [7] Berbner R, Spahn M, Repp N, Heckann O, Steinetz R. Heuristics for QoS Aware Web Service Coposition[C]. ICWS, Chicago: IEEE Coputer Society, 2006:72 82 [8] Liu SL, Liu YX, Zhang F, Tang GF, Jing N. A Dync Web Services Selection Algorith with QoS Global Optial Web Services Coposition[J]. Journal of Software, 2007, 8(3): (In Chinese) [9] Canfora G, enta MD, Esposito R, Villani ML. An Approach for QoS-aware Service Coposition Based on Genetic Algoriths[C]. GECCO, Washington: IEEE Coputer Society, 2005: [0] Zhang CW, Su S, Chen JL. Genetic Algorith on Web Services Selection Supporting QoS[J]. Chinese Journal of Coputers, 2006, 29(7): (In Chinese) [] Li Z, Shuang K, Yang FC, Su S. A Decision Making Approach for Seantic Web Services Selection with Heterogeneous QoS Values[C]. CIICT, 2007: [2] Cardoso J, ShethA, Miller JA, Arnold J, Kochut KJ. Modeling Quality of Service for Workflows and Web Service rocesses[j]. Web Seantics Journals Science, Services and Agents on theworld Wide Web Journal, 2004, (3): 28-30

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented

More information

A Fast Multi-Objective Genetic Algorithm for Hardware-Software Partitioning In Embedded System Design

A Fast Multi-Objective Genetic Algorithm for Hardware-Software Partitioning In Embedded System Design A Fast Multi-Obective Genetic Algorith for Hardware-Software Partitioning In Ebedded Syste Design 1 M.Jagadeeswari, 2 M.C.Bhuvaneswari 1 Research Scholar, P.S.G College of Technology, Coibatore, India

More information

Utility-Based Resource Allocation for Mixed Traffic in Wireless Networks

Utility-Based Resource Allocation for Mixed Traffic in Wireless Networks IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng

More information

Geo-activity Recommendations by using Improved Feature Combination

Geo-activity Recommendations by using Improved Feature Combination Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,

More information

Identifying Converging Pairs of Nodes on a Budget

Identifying Converging Pairs of Nodes on a Budget Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering

More information

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,

More information

Performance Analysis of RAID in Different Workload

Performance Analysis of RAID in Different Workload Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,

More information

The optimization design of microphone array layout for wideband noise sources

The optimization design of microphone array layout for wideband noise sources PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun

More information

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13 Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical

More information

AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM

AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,

More information

Using Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses

Using Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses International Journal of Industrial Engineering & Production Research Septeber 03, Volue 4, Nuber 3 pp. 9-35 ISSN: 008-4889 http://ijiepr.iust.ac.ir/ Using Iperialist Copetitive Algorith in Optiization

More information

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3 2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition

More information

Clustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering

Clustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into

More information

Resource Optimization for Web Service Composition

Resource Optimization for Web Service Composition Resource Optiization for Web Coposition Xia Gao, Ravi Jain, Zulfikar Razan, Ulas Kozat Abstract coposition recently eerged as a costeffective way to quickly create new services within a network. Soe research

More information

The Flaw Attack to the RTS/CTS Handshake Mechanism in Cluster-based Battlefield Self-organizing Network

The Flaw Attack to the RTS/CTS Handshake Mechanism in Cluster-based Battlefield Self-organizing Network The Flaw Attack to the RTS/CTS Handshake Mechanis in Cluster-based Battlefield Self-organizing Network Zeao Zhao College of Counication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China National

More information

Feature Based Registration for Panoramic Image Generation

Feature Based Registration for Panoramic Image Generation IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh

More information

Improve Peer Cooperation using Social Networks

Improve Peer Cooperation using Social Networks Iprove Peer Cooperation using Social Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Noveber 5, 2007 Corresponding

More information

Design Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems

Design Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems Design Optiization of Mixed Tie/Event-Triggered Distributed Ebedded Systes Traian Pop, Petru Eles, Zebo Peng Dept. of Coputer and Inforation Science, Linköping University {trapo, petel, zebpe}@ida.liu.se

More information

Fair Energy-Efficient Sensing Task Allocation in Participatory Sensing with Smartphones

Fair Energy-Efficient Sensing Task Allocation in Participatory Sensing with Smartphones Advance Access publication on 24 February 2017 The British Coputer Society 2017. All rights reserved. For Perissions, please eail: journals.perissions@oup.co doi:10.1093/cojnl/bxx015 Fair Energy-Efficient

More information

Privacy-preserving String-Matching With PRAM Algorithms

Privacy-preserving String-Matching With PRAM Algorithms Privacy-preserving String-Matching With PRAM Algoriths Report in MTAT.07.022 Research Seinar in Cryptography, Fall 2014 Author: Sander Sii Supervisor: Peeter Laud Deceber 14, 2014 Abstract In this report,

More information

Different criteria of dynamic routing

Different criteria of dynamic routing Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich

More information

1 Extended Boolean Model

1 Extended Boolean Model 1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible

More information

Genetic-Based EM Algorithm for Learning Gaussian Mixture Models

Genetic-Based EM Algorithm for Learning Gaussian Mixture Models 1344 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 27, NO. 8, AUGUST 2005 Genetic-Based EM Algorith for Learning Gaussian Mixture Models Franz Pernkopf, Meber, IEEE, and Djael Bouchaffra,

More information

A Low-Cost Multi-Failure Resilient Replication Scheme for High Data Availability in Cloud Storage

A Low-Cost Multi-Failure Resilient Replication Scheme for High Data Availability in Cloud Storage 216 IEEE 23rd International Conference on High Perforance Coputing A Low-Cost Multi-Failure Resilient Replication Schee for High Data Availability in Cloud Storage Jinwei Liu* and Haiying Shen *Departent

More information

QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS

QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755

More information

DYNAMIC ESTIMATION OF BDP IN MANETS FOR EFFECTIVE NEXT NODE SELECTION

DYNAMIC ESTIMATION OF BDP IN MANETS FOR EFFECTIVE NEXT NODE SELECTION www.arpnjournals.co DYNAMIC ESTIMATION OF BDP IN MANETS FOR EFFECTIVE NEXT NODE SELECTION N. Snehalatha 1 and Paul Rodrigues 2 1 School of Coputing, SRM University, Chennai, Tail Nadu, India 2 Departent

More information

ACNS: Adaptive Complementary Neighbor Selection in BitTorrent-like Applications

ACNS: Adaptive Complementary Neighbor Selection in BitTorrent-like Applications ACNS: Adaptive Copleentary Neighbor Selection in BitTorrent-like Applications Zhenbao Zhou 1, 2, Zhenyu Li 1, 2, Gaogang Xie 1 1 Institute of Coputing Technology, Chinese Acadey of Sciences, Beijing 100190,

More information

Problem Solving of graph correspondence using Genetics Algorithm and ACO Algorithm

Problem Solving of graph correspondence using Genetics Algorithm and ACO Algorithm Proble Solving of graph correspondence using Genetics Algorith and ACO Algorith Alireza Rezaee, 1, Azizeh Ajalli 2 Assistant professor,departent of Mechatronics Engineering, Faculty of New Sciences and

More information

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering

More information

A Periodic Dynamic Load Balancing Method

A Periodic Dynamic Load Balancing Method 2016 3 rd International Conference on Engineering Technology and Application (ICETA 2016) ISBN: 978-1-60595-383-0 A Periodic Dynaic Load Balancing Method Taotao Fan* State Key Laboratory of Inforation

More information

Feature Selection to Relate Words and Images

Feature Selection to Relate Words and Images The Open Inforation Systes Journal, 2009, 3, 9-13 9 Feature Selection to Relate Words and Iages Wei-Chao Lin 1 and Chih-Fong Tsai*,2 Open Access 1 Departent of Coputing, Engineering and Technology, University

More information

Adaptive Holistic Scheduling for In-Network Sensor Query Processing

Adaptive Holistic Scheduling for In-Network Sensor Query Processing Adaptive Holistic Scheduling for In-Network Sensor Query Processing Hejun Wu and Qiong Luo Departent of Coputer Science and Engineering Hong Kong University of Science & Technology Clear Water Bay, Kowloon,

More information

An Efficient Approach for Content Delivery in Overlay Networks

An Efficient Approach for Content Delivery in Overlay Networks An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr

More information

Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues

Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues Mapping Data in Peer-to-Peer Systes: Seantics and Algorithic Issues Anastasios Keentsietsidis Marcelo Arenas Renée J. Miller Departent of Coputer Science University of Toronto {tasos,arenas,iller}@cs.toronto.edu

More information

Meta-heuristic Approaches for the Assembly Line Balancing Problem

Meta-heuristic Approaches for the Assembly Line Balancing Problem Proceedings of the 202 International Conference on Industrial Engineering and Operations Manageent Istanbul, Turey, July 3 6, 202 Meta-heuristic Approaches for the Assebly Line Balancing Proble Adil Bayasoğlu

More information

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural

More information

Enhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue

Enhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue Enhancing Real-Tie CAN Counications by the Prioritization of Urgent Messages at the Outgoing Queue ANTÓNIO J. PIRES (1), JOÃO P. SOUSA (), FRANCISCO VASQUES (3) 1,,3 Faculdade de Engenharia da Universidade

More information

Knowledge Discovery Applied to Agriculture Economy Planning

Knowledge Discovery Applied to Agriculture Economy Planning Knowledge Discovery Applied to Agriculture Econoy Planning Bing-ru Yang and Shao-un Huang Inforation Engineering School University of Science and Technology, Beiing, China, 100083 Eail: bingru.yang@b.col.co.cn

More information

Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols

Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols Navodaya Garepalli Kartik Gopalan Ping Yang Coputer Science, Binghaton University (State University of New York) Contact:

More information

News Events Clustering Method Based on Staging Incremental Single-Pass Technique

News Events Clustering Method Based on Staging Incremental Single-Pass Technique News Events Clustering Method Based on Staging Increental Single-Pass Technique LI Yongyi 1,a *, Gao Yin 2 1 School of Electronics and Inforation Engineering QinZhou University 535099 Guangxi, China 2

More information

Collaborative Web Caching Based on Proxy Affinities

Collaborative Web Caching Based on Proxy Affinities Collaborative Web Caching Based on Proxy Affinities Jiong Yang T J Watson Research Center IBM jiyang@usibco Wei Wang T J Watson Research Center IBM ww1@usibco Richard Muntz Coputer Science Departent UCLA

More information

AN HEURISTIC ALTERNATIVE TO OPTIMIZE MAKESPAN OVER M PARALLEL MACHINES WITH RELEASE AND SECUENCE-DEPENDENT SETUP TIMES P m r j, s jk C max

AN HEURISTIC ALTERNATIVE TO OPTIMIZE MAKESPAN OVER M PARALLEL MACHINES WITH RELEASE AND SECUENCE-DEPENDENT SETUP TIMES P m r j, s jk C max AN HEURISTIC ALTERNATIVE TO OTIMIZE MAKESAN OVER M ARALLEL MACHINES WITH RELEASE AND SECUENCE-DEENDENT SETU TIMES r j, s j C ax LOEZ, ulián, ROZO, Viviana, SAAVEDRA, Iván and ATERNINA-ARBOLEDA, Carlos

More information

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem Theoretical Analysis of Local Search and Siple Evolutionary Algoriths for the Generalized Travelling Salesperson Proble Mojgan Pourhassan ojgan.pourhassan@adelaide.edu.au Optiisation and Logistics, The

More information

Database Design on Mechanical Equipment Operation Management System Zheng Qiu1, Wu kaiyuan1, Wu Chengyan1, Liu Lei2

Database Design on Mechanical Equipment Operation Management System Zheng Qiu1, Wu kaiyuan1, Wu Chengyan1, Liu Lei2 2nd International Conference on Advances in Mechanical Engineering and Industrial Inforatics (AMEII 206) Database Design on Mechanical Equipent Manageent Syste Zheng Qiu, Wu kaiyuan, Wu Chengyan, Liu Lei2

More information

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu

More information

Derivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router

Derivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router Derivation of an Analytical Model for Evaluating the Perforance of a Multi- Queue Nodes Network Router 1 Hussein Al-Bahadili, 1 Jafar Ababneh, and 2 Fadi Thabtah 1 Coputer Inforation Systes Faculty of

More information

Joint Measurement- and Traffic Descriptor-based Admission Control at Real-Time Traffic Aggregation Points

Joint Measurement- and Traffic Descriptor-based Admission Control at Real-Time Traffic Aggregation Points Joint Measureent- and Traffic Descriptor-based Adission Control at Real-Tie Traffic Aggregation Points Stylianos Georgoulas, Panos Triintzios and George Pavlou Centre for Counication Systes Research, University

More information

A Novel Fast Constructive Algorithm for Neural Classifier

A Novel Fast Constructive Algorithm for Neural Classifier A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore

More information

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011 EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction

More information

Dynamical Topology Analysis of VANET Based on Complex Networks Theory

Dynamical Topology Analysis of VANET Based on Complex Networks Theory BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volue 14, Special Issue Sofia 014 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.478/cait-014-0053 Dynaical Topology Analysis

More information

Designing High Performance Web-Based Computing Services to Promote Telemedicine Database Management System

Designing High Performance Web-Based Computing Services to Promote Telemedicine Database Management System Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,

More information

The Application of Bandwidth Optimization Technique in SLA Negotiation Process

The Application of Bandwidth Optimization Technique in SLA Negotiation Process The Application of Bandwidth Optiization Technique in SLA egotiation Process Srećko Krile University of Dubrovnik Departent of Electrical Engineering and Coputing Cira Carica 4, 20000 Dubrovnik, Croatia

More information

Minimax Sensor Location to Monitor a Piecewise Linear Curve

Minimax Sensor Location to Monitor a Piecewise Linear Curve NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location to Monitor a Piecewise Linear Curve To M. Cavalier The Pennsylvania State University University Par, PA 680 Whitney A. Conner

More information

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University

More information

THE rapid growth and continuous change of the real

THE rapid growth and continuous change of the real IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa

More information

COMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT

COMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT COMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT B.BOOBA 1 Dr. T.V.GOPAL 2 1 Research Scholar, Assist. Professor(Sl.Gr),Departent of Coputer Applications, Easwari

More information

A Novel 2D Texture Classifier For Gray Level Images

A Novel 2D Texture Classifier For Gray Level Images 2012, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.co A Novel 2D Texture Classifier For Gray Level Iages B.S. Mousavi 1 Young Researchers Club, Zahedan

More information

Secure Wireless Multihop Transmissions by Intentional Collisions with Noise Wireless Signals

Secure Wireless Multihop Transmissions by Intentional Collisions with Noise Wireless Signals Int'l Conf. Wireless etworks ICW'16 51 Secure Wireless Multihop Transissions by Intentional Collisions with oise Wireless Signals Isau Shiada 1 and Hiroaki Higaki 1 1 Tokyo Denki University, Japan Abstract

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN International Journal of Scientific & Engineering Research, Volue 4, Issue 0, October-203 483 Design an Encoding Technique Using Forbidden Transition free Algorith to Reduce Cross-Talk for On-Chip VLSI

More information

Adaptive Parameter Estimation Based Congestion Avoidance Strategy for DTN

Adaptive Parameter Estimation Based Congestion Avoidance Strategy for DTN Proceedings of the nd International onference on oputer Science and Electronics Engineering (ISEE 3) Adaptive Paraeter Estiation Based ongestion Avoidance Strategy for DTN Qicai Yang, Futong Qin, Jianquan

More information

Boosted Detection of Objects and Attributes

Boosted Detection of Objects and Attributes L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly

More information

A Novel Fuzzy Chinese Address Matching Engine Based on Full-text Search Technology

A Novel Fuzzy Chinese Address Matching Engine Based on Full-text Search Technology Based on Full-text Search Technology 12 Institute of Reote Sensing and Digital Earth National Engineering Research Center for Reote Sensing Applications,Beijing,100101, China E-ail: yaoxj@radi.ac.cn Xiang

More information

Vito R. Gervasi, Adam Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin

Vito R. Gervasi, Adam Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin GEOMETRY AND PROCEDURE FOR BENCHMARKING SFF AND HYBRID FABRICATION PROCESS RESOLUTION Vito R. Gervasi, Ada Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin ABSTRACT Since

More information

Leveraging Relevance Cues for Improved Spoken Document Retrieval

Leveraging Relevance Cues for Improved Spoken Document Retrieval Leveraging Relevance Cues for Iproved Spoken Docuent Retrieval Pei-Ning Chen 1, Kuan-Yu Chen 2 and Berlin Chen 1 National Taiwan Noral University, Taiwan 1 Institute of Inforation Science, Acadeia Sinica,

More information

A Distributed Multi-service Resource Allocation Algorithm in Heterogeneous Wireless Access Medium

A Distributed Multi-service Resource Allocation Algorithm in Heterogeneous Wireless Access Medium 1 A Distributed Multi-service Resource Allocation Algorith in Heterogeneous Wireless Access Mediu Muhaad Isail, Student Meber, IEEE, and Weihua Zhuang, Fellow, IEEE Abstract In this paper, radio resource

More information

Analysing Real-Time Communications: Controller Area Network (CAN) *

Analysing Real-Time Communications: Controller Area Network (CAN) * Analysing Real-Tie Counications: Controller Area Network (CAN) * Abstract The increasing use of counication networks in tie critical applications presents engineers with fundaental probles with the deterination

More information

Redundancy Level Impact of the Mean Time to Failure on Wireless Sensor Network

Redundancy Level Impact of the Mean Time to Failure on Wireless Sensor Network (IJACSA) International Journal of Advanced Coputer Science and Applications Vol. 8, No. 1, 217 Redundancy Level Ipact of the Mean Tie to Failure on Wireless Sensor Network Alaa E. S. Ahed 1 College of

More information

An Ad Hoc Adaptive Hashing Technique for Non-Uniformly Distributed IP Address Lookup in Computer Networks

An Ad Hoc Adaptive Hashing Technique for Non-Uniformly Distributed IP Address Lookup in Computer Networks An Ad Hoc Adaptive Hashing Technique for Non-Uniforly Distributed IP Address Lookup in Coputer Networks Christopher Martinez Departent of Electrical and Coputer Engineering The University of Texas at San

More information

A Model Free Automatic Tuning Method for a Restricted Structured Controller. by using Simultaneous Perturbation Stochastic Approximation

A Model Free Automatic Tuning Method for a Restricted Structured Controller. by using Simultaneous Perturbation Stochastic Approximation 28 Aerican Control Conference Westin Seattle Hotel, Seattle, Washington, USA June -3, 28 WeC9.5 A Model Free Autoatic Tuning Method for a Restricted Structured Controller by Using Siultaneous Perturbation

More information

Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression

Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression Sha M. Kakade Microsoft Research and Wharton, U Penn skakade@icrosoft.co Varun Kanade SEAS, Harvard University

More information

Generating Mechanisms for Evolving Software Mirror Graph

Generating Mechanisms for Evolving Software Mirror Graph Journal of Modern Physics, 2012, 3, 1050-1059 http://dx.doi.org/10.4236/jp.2012.39139 Published Online Septeber 2012 (http://www.scirp.org/journal/jp) Generating Mechaniss for Evolving Software Mirror

More information

Optimal Route Queries with Arbitrary Order Constraints

Optimal Route Queries with Arbitrary Order Constraints IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL.?, NO.?,? 20?? 1 Optial Route Queries with Arbitrary Order Constraints Jing Li, Yin Yang, Nikos Maoulis Abstract Given a set of spatial points DS,

More information

Predicting x86 Program Runtime for Intel Processor

Predicting x86 Program Runtime for Intel Processor Predicting x86 Progra Runtie for Intel Processor Behra Mistree, Haidreza Haki Javadi, Oid Mashayekhi Stanford University bistree,hrhaki,oid@stanford.edu 1 Introduction Progras can be equivalent: given

More information

Experiences with complex user profiles for approximate P2P community matching

Experiences with complex user profiles for approximate P2P community matching Experiences with coplex user profiles for approxiate PP counity atching Patrizio Dazzi ISTI-CNR Pisa, Italy p.dazzi@isti.cnr.it Matteo Mordacchini IIT-CNR Pisa, Italy.ordacchini@iit.cnr.it Fabio Baglini

More information

Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms

Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL., NO., NOV 27 Scheduling Parallel Real-Tie Recurrent Tasks on Multicore Platfors Risat Pathan, Petros Voudouris, and Per Stenströ Abstract We

More information

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,

More information

I ve Seen Enough : Incrementally Improving Visualizations to Support Rapid Decision Making

I ve Seen Enough : Incrementally Improving Visualizations to Support Rapid Decision Making I ve Seen Enough : Increentally Iproving Visualizations to Support Rapid Decision Making Sajjadur Rahan Marya Aliakbarpour 2 Ha Kyung Kong Eric Blais 3 Karrie Karahalios,4 Aditya Paraeswaran Ronitt Rubinfield

More information

Medical Biophysics 302E/335G/ st1-07 page 1

Medical Biophysics 302E/335G/ st1-07 page 1 Medical Biophysics 302E/335G/500 20070109 st1-07 page 1 STEREOLOGICAL METHODS - CONCEPTS Upon copletion of this lesson, the student should be able to: -define the ter stereology -distinguish between quantitative

More information

An Optimization Clustering Algorithm Based on Texture Feature Fusion for Color Image Segmentation

An Optimization Clustering Algorithm Based on Texture Feature Fusion for Color Image Segmentation Algoriths 2015, 8, 234-247; doi:10.3390/a8020234 Article OPEN ACCESS algoriths ISSN 1999-4893 www.dpi.co/journal/algoriths An Optiization Clustering Algorith Based on Texture Feature Fusion for Color Iage

More information

Rule Extraction using Artificial Neural Networks

Rule Extraction using Artificial Neural Networks Rule Extraction using Artificial Neural Networks S. M. Karuzzaan 1 Ahed Ryadh Hasan 2 Abstract Artificial neural networks have been successfully applied to a variety of business application probles involving

More information

Research on the Classification and Selection of Archive Texts with the Improved C4.5 Algorithm

Research on the Classification and Selection of Archive Texts with the Improved C4.5 Algorithm INTERNATIONAL JOURNAL OF IRUITS, SYSTEMS AND SIGNAL PROESSING Volue 2, 208 Research on the lassification and Selection of Archive Texts with the Iproved 4.5 Algorith Xianbin Lv Abstract In the age of inforation

More information

Reusability Analysis for Shipbuilding Components Modeled in XML and Java

Reusability Analysis for Shipbuilding Components Modeled in XML and Java Reusability Analysis for Shipbuilding Coponents Modeled in XML and Java Prof. Steven A. Deurjian, Sr., Jeffrey R. Ellis, Rodrigo Caballero, Hai Lin, and Xiaopei Wang Coputer Science & Engineering Departent

More information

Modal Masses Estimation in OMA by a Consecutive Mass Change Method.

Modal Masses Estimation in OMA by a Consecutive Mass Change Method. Modal Masses Estiation in OMA by a Consecutive Mass Change Method. F. Pelayo University of Oviedo, Departent of Construction and Manufacturing Engineering, Gijón, Spain M. López-Aenlle University of Oviedo,

More information

A Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction

A Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao

More information

A simplified approach to merging partial plane images

A simplified approach to merging partial plane images A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D

More information

A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Membership Functions *

A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Membership Functions * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 21, 607-626 (2005) A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Mebership Functions * SHIH-HSU HUANG AND JIAN-YUAN LAI + Departent of

More information

Survivability Function A Measure of Disaster-Based Routing Performance

Survivability Function A Measure of Disaster-Based Routing Performance Survivability Function A Measure of Disaster-Based Routing Perforance Journal Club Presentation on W. Molisz. Survivability function-a easure of disaster-based routing perforance. IEEE Journal on Selected

More information

Approximate String Matching with Reduced Alphabet

Approximate String Matching with Reduced Alphabet Approxiate String Matching with Reduced Alphabet Leena Salela 1 and Jora Tarhio 2 1 University of Helsinki, Departent of Coputer Science leena.salela@cs.helsinki.fi 2 Aalto University Deptartent of Coputer

More information

Reconstruction of Time Series using Optimal Ordering of ICA Components

Reconstruction of Time Series using Optimal Ordering of ICA Components Reconstruction of Tie Series using Optial Ordering of ICA Coponents Ar Goneid and Abear Kael Departent of Coputer Science & Engineering, The Aerican University in Cairo, Cairo, Egypt e-ail: goneid@aucegypt.edu

More information

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles

More information

End-to-end Quality Adaptation Scheme Based on QoE Prediction for Video Streaming Service in LTE Networks

End-to-end Quality Adaptation Scheme Based on QoE Prediction for Video Streaming Service in LTE Networks End-to-end Quality Adaptation Schee Based on QoE Prediction for Video Streaing Service in LTE etworks Huifang Chen 1,2 Xin Yu 1 Lei Xie 1,2 1 Dept. of Inforation Science and Electronic Engineering, Zhejiang

More information

A Hybrid Network Architecture for File Transfers

A Hybrid Network Architecture for File Transfers JOURNAL OF IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO., JANUARY 9 A Hybrid Network Architecture for File Transfers Xiuduan Fang, Meber, IEEE, Malathi Veeraraghavan, Senior Meber,

More information

Efficient Estimation of Inclusion Coefficient using HyperLogLog Sketches

Efficient Estimation of Inclusion Coefficient using HyperLogLog Sketches Efficient Estiation of Inclusion Coefficient using HyperLogLog Sketches Azade Nazi, Bolin Ding, Vivek Narasayya, Surajit Chaudhuri Microsoft Research {aznazi, bolind, viveknar, surajitc}@icrosoft.co ABSTRACT

More information

IN many interactive multimedia streaming applications, such

IN many interactive multimedia streaming applications, such 840 IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 8, NO. 5, MAY 06 A Geoetric Approach to Server Selection for Interactive Video Streaing Yaochen Hu, Student Meber, IEEE, DiNiu, Meber, IEEE, and Zongpeng Li, Senior

More information

PROBABILISTIC LOCALIZATION AND MAPPING OF MOBILE ROBOTS IN INDOOR ENVIRONMENTS WITH A SINGLE LASER RANGE FINDER

PROBABILISTIC LOCALIZATION AND MAPPING OF MOBILE ROBOTS IN INDOOR ENVIRONMENTS WITH A SINGLE LASER RANGE FINDER nd International Congress of Mechanical Engineering (COBEM 3) Noveber 3-7, 3, Ribeirão Preto, SP, Brazil Copyright 3 by ABCM PROBABILISTIC LOCALIZATION AND MAPPING OF MOBILE ROBOTS IN INDOOR ENVIRONMENTS

More information

Planet Scale Software Updates

Planet Scale Software Updates Planet Scale Software Updates Christos Gkantsidis 1, Thoas Karagiannis 2, Pablo Rodriguez 1, and Milan Vojnović 1 1 Microsoft Research 2 UC Riverside Cabridge, UK Riverside, CA, USA {chrisgk,pablo,ilanv}@icrosoft.co

More information

MGS-SIFT: A New Illumination Invariant Feature Based on SIFT Descriptor

MGS-SIFT: A New Illumination Invariant Feature Based on SIFT Descriptor International Journal of Coputer Theory and Engineering, Vol 5, No, February 0 MGS-SIFT: A New Illuination Invariant Feature Based on SIFT Descriptor Reza Javanard Alitappeh and Fariborz Mahoudi Abstract

More information

Integrating fast mobility in the OLSR routing protocol

Integrating fast mobility in the OLSR routing protocol Integrating fast obility in the OLSR routing protocol Mounir BENZAID 1,2, Pascale MINET 1 and Khaldoun AL AGHA 1,2 1 INRIA, Doaine de Voluceau - B.P.105, 78153 Le Chesnay Cedex, FRANCE ounir.benzaid, pascale.inet@inria.fr

More information

Relief shape inheritance and graphical editor for the landscape design

Relief shape inheritance and graphical editor for the landscape design Relief shape inheritance and graphical editor for the landscape design Egor A. Yusov Vadi E. Turlapov Nizhny Novgorod State University after N. I. Lobachevsky Nizhny Novgorod Russia yusov_egor@ail.ru vadi.turlapov@cs.vk.unn.ru

More information

Shape Optimization of Quad Mesh Elements

Shape Optimization of Quad Mesh Elements Shape Optiization of Quad Mesh Eleents Yufei Li 1, Wenping Wang 1, Ruotian Ling 1, and Changhe Tu 2 1 The University of Hong Kong 2 Shandong University Abstract We study the proble of optiizing the face

More information