Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5658951
Ruixia Tong, Xiongfeng Zhu
Load balance is an important problem of cluster. The core of cluster task distribution is the load balance algorithm. LVS load balance technology is introduced briefly, the known load balancing algorithms and their merits and demerits are discussed in this paper; A Residual Load Rate based the combination of static and dynamic balance strategy is proposed after analyzing static balance technology and dynamic balance technology on the purpose of improving the performance of cluster systems. The balance strategy combination of static and dynamic balance algorithm, not only to overcome the static load balancing does not take into account real-time loads and reduces times of dispatching assignments between nodes, prevents the servers to be skew, and improves the performance of cluster systems.
{"title":"A Load Balancing Strategy Based on the Combination of Static and Dynamic","authors":"Ruixia Tong, Xiongfeng Zhu","doi":"10.1109/DBTA.2010.5658951","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5658951","url":null,"abstract":"Load balance is an important problem of cluster. The core of cluster task distribution is the load balance algorithm. LVS load balance technology is introduced briefly, the known load balancing algorithms and their merits and demerits are discussed in this paper; A Residual Load Rate based the combination of static and dynamic balance strategy is proposed after analyzing static balance technology and dynamic balance technology on the purpose of improving the performance of cluster systems. The balance strategy combination of static and dynamic balance algorithm, not only to overcome the static load balancing does not take into account real-time loads and reduces times of dispatching assignments between nodes, prevents the servers to be skew, and improves the performance of cluster systems.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117136781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5659033
Zhonghe Li, Ah Han, Dongseop Kwon, Youngbae Park
Reverse skyline queries are difficult to process because of the massive amount of computations for checking candidates because existing algorithms for reverse skylines are generally based on pre-processing. Although pre-processing reduces the number of computations on processing queries, it requires re-computations of pre-processed result every time data change. To overcome this limitation, we propose an efficient algorithm to reduce the number of computation in processing reverse skyline queries with a two-phased refinement step. Before refining the final result from candidates, the proposed algorithm has an additional refinement step for decreasing the number of candidates, so that it can handle reverse skyline queries more effectively without any pre-processing. Since not based on pre-processing, our algorithm is more suitable for frequently updated data. Experimental results show that the performance of the proposed algorithm is better than those of the existing pre-processing-based ones.
{"title":"A Two-Phased Refinement Algorithm to Process Reverse Skylines without Pre-Processing","authors":"Zhonghe Li, Ah Han, Dongseop Kwon, Youngbae Park","doi":"10.1109/DBTA.2010.5659033","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5659033","url":null,"abstract":"Reverse skyline queries are difficult to process because of the massive amount of computations for checking candidates because existing algorithms for reverse skylines are generally based on pre-processing. Although pre-processing reduces the number of computations on processing queries, it requires re-computations of pre-processed result every time data change. To overcome this limitation, we propose an efficient algorithm to reduce the number of computation in processing reverse skyline queries with a two-phased refinement step. Before refining the final result from candidates, the proposed algorithm has an additional refinement step for decreasing the number of candidates, so that it can handle reverse skyline queries more effectively without any pre-processing. Since not based on pre-processing, our algorithm is more suitable for frequently updated data. Experimental results show that the performance of the proposed algorithm is better than those of the existing pre-processing-based ones.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125056378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5659041
Hui-Sheng Cheng
Task scheduling is an important part of high performance multi-core building. The shortcomings of existing task scheduling algorithms is analyzed, and a new efficient heuristic task scheduling algorithm, namely,HCDDSL is proposed in this paper. Firstly, the new algorithm optimizes DAG graph by using clustering, then the nodes are descended by the values of Succ_sum,the task schedule has been processed in the case of insert interval and task duplication are considered. The weight of task in the DAG is considered in the process of schedule. By this means, the result of task schedule is optimized effectively,and the makespan of all tasks is reduced also.The proposed task scheduling algorithm has been analyzed through simulation, the results show that compare to old scheduling algorithm,this new algorithm can shorten the scheduling length of the task graph greatly.
{"title":"A High Efficient Task Scheduling Algorithm Based on Heterogeneous Multi-Core Processor","authors":"Hui-Sheng Cheng","doi":"10.1109/DBTA.2010.5659041","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5659041","url":null,"abstract":"Task scheduling is an important part of high performance multi-core building. The shortcomings of existing task scheduling algorithms is analyzed, and a new efficient heuristic task scheduling algorithm, namely,HCDDSL is proposed in this paper. Firstly, the new algorithm optimizes DAG graph by using clustering, then the nodes are descended by the values of Succ_sum,the task schedule has been processed in the case of insert interval and task duplication are considered. The weight of task in the DAG is considered in the process of schedule. By this means, the result of task schedule is optimized effectively,and the makespan of all tasks is reduced also.The proposed task scheduling algorithm has been analyzed through simulation, the results show that compare to old scheduling algorithm,this new algorithm can shorten the scheduling length of the task graph greatly.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123429271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5658946
Ding-zhen Li, Ruimin Jin
Considering the disadvantages of conventional dynamic strain measurement system such as large outlines, inconvenient usage and liable to various interferences, A new dynamic strain measurement system is designed based on the modern embedded computer technology and strain measurement technology, which is the integration of signal conditioning, data acquiring and data issuing. This measurement system is built based on the advanced ARM9 processor, which is the controller of signal condition part, A/D conversion part, data memory part and others. And the data transmission and communication is realized via the Ethernet interface. Based on embedded Linux operation system, the software part of this measurement system is composed of the realization of monitor and control system in B/S mode by building embedded Web Server and the operation of the hardware part in the CGI program by calling hardware drivers. Users may access this measurement instrument for setting sample parameter, starting a sample, viewing data curve and downloading data directly by any Web Server without special application software. Based on system debugging and experiments, it is proved that the system had achieved the requirements that are put forward. The result shows that the properties of the system are superior to the existing measurement system．
{"title":"Study of Dynamic Strain Measurement System Based on Embedded Technology","authors":"Ding-zhen Li, Ruimin Jin","doi":"10.1109/DBTA.2010.5658946","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5658946","url":null,"abstract":"Considering the disadvantages of conventional dynamic strain measurement system such as large outlines, inconvenient usage and liable to various interferences, A new dynamic strain measurement system is designed based on the modern embedded computer technology and strain measurement technology, which is the integration of signal conditioning, data acquiring and data issuing. This measurement system is built based on the advanced ARM9 processor, which is the controller of signal condition part, A/D conversion part, data memory part and others. And the data transmission and communication is realized via the Ethernet interface. Based on embedded Linux operation system, the software part of this measurement system is composed of the realization of monitor and control system in B/S mode by building embedded Web Server and the operation of the hardware part in the CGI program by calling hardware drivers. Users may access this measurement instrument for setting sample parameter, starting a sample, viewing data curve and downloading data directly by any Web Server without special application software. Based on system debugging and experiments, it is proved that the system had achieved the requirements that are put forward. The result shows that the properties of the system are superior to the existing measurement system．","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115250561","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5659110
Wei Zhou, Jinxian Tan, Yeyu Xie, Qian Xu
Current advances in portable devices, wireless technologies have created a mobile computing environment which is characterized by a large scale of dynamism. But mobile computing is quite different from traditional middleware while addressing the dynamic and pervasive aspects of mobile systems. This paper represents the experience of our project related to next generation middleware systems, with high scalability in architecture, mechanism of multi-service, easiness for business logic development, to support collaboration applications.
{"title":"A Scalable Multi-Service Collaboration Mobile Computing Middleware System Architecture","authors":"Wei Zhou, Jinxian Tan, Yeyu Xie, Qian Xu","doi":"10.1109/DBTA.2010.5659110","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5659110","url":null,"abstract":"Current advances in portable devices, wireless technologies have created a mobile computing environment which is characterized by a large scale of dynamism. But mobile computing is quite different from traditional middleware while addressing the dynamic and pervasive aspects of mobile systems. This paper represents the experience of our project related to next generation middleware systems, with high scalability in architecture, mechanism of multi-service, easiness for business logic development, to support collaboration applications.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122341789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5659101
Jian Tian, Tao Wei, Hai'jun Xu
Crystal morphology, crystal structure and atomic coordinates of tricalcium silicate （C3S，3CaO • SiO2）which is the main components of cement clinker were studied. Through X-ray powder diffraction analysis and associated calculation, we gained the C3S precision cell parameters and atomic coordinates, then built three-dimensional models of C3S crystal structure. A C3S crystal electron backscatter scattering diffraction（EBSD）precise crystallographic database is established by EBSD test, [1] and it lays the foundation of study C3S from orientation angles[2-3], we standardized electron backscatter diffraction pattern (EBSP) of C3S crystal and took its EBSD phase identification test too by the database and its conclusions tally with that of X-ray powder diffraction test and calculation quite well.
{"title":"Extensity of C3S EBSD Database and Its Structure Calculation","authors":"Jian Tian, Tao Wei, Hai'jun Xu","doi":"10.1109/DBTA.2010.5659101","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5659101","url":null,"abstract":"Crystal morphology, crystal structure and atomic coordinates of tricalcium silicate （C3S，3CaO • SiO2）which is the main components of cement clinker were studied. Through X-ray powder diffraction analysis and associated calculation, we gained the C3S precision cell parameters and atomic coordinates, then built three-dimensional models of C3S crystal structure. A C3S crystal electron backscatter scattering diffraction（EBSD）precise crystallographic database is established by EBSD test, [1] and it lays the foundation of study C3S from orientation angles[2-3], we standardized electron backscatter diffraction pattern (EBSP) of C3S crystal and took its EBSD phase identification test too by the database and its conclusions tally with that of X-ray powder diffraction test and calculation quite well.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129728999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5659014
G. Lai, Shengyun Yang, D. Yuan
Current resource locating algorithms either cannot yield good lookup performance,or incur high search cost and system maintenance overhead.The poor search efficiency of these approaches may seriously limit the scalability of current P2P systems.In this paper,we propose to exploit two-dimensional locality to improve P2P system search efficiency. We present a locality-aware P2P system architecture called Forecast, which explicitly exploits temporal locality and semantic locality by constructing a temporal neighbor overlay and a semantic friend overlay, respectively. Given a query, Forecast first looks for the target resource among the query generator's temporal neighbors, and if it fails to hit the targets,the query will be forwarded to the relevant semantic friend overlay for the second search.Simulation results show that our scheme can greatly improves the system performance.
{"title":"Structuring Peer-to-Peer Networks Using Temporal and Semantic Locality","authors":"G. Lai, Shengyun Yang, D. Yuan","doi":"10.1109/DBTA.2010.5659014","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5659014","url":null,"abstract":"Current resource locating algorithms either cannot yield good lookup performance,or incur high search cost and system maintenance overhead.The poor search efficiency of these approaches may seriously limit the scalability of current P2P systems.In this paper,we propose to exploit two-dimensional locality to improve P2P system search efficiency. We present a locality-aware P2P system architecture called Forecast, which explicitly exploits temporal locality and semantic locality by constructing a temporal neighbor overlay and a semantic friend overlay, respectively. Given a query, Forecast first looks for the target resource among the query generator's temporal neighbors, and if it fails to hit the targets,the query will be forwarded to the relevant semantic friend overlay for the second search.Simulation results show that our scheme can greatly improves the system performance.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128644265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5658957
Changying Dai, Wentao Gong, Jing Liu
Access control is one of the key technologies used in Web services, which can make sure the security of web services. The traditional access control models such as mandatory access control couldn't make the access control flexible and enable due to their design limitations, and then the access process of authorization in web services becomes fuzzy. Usage control model (UCON) is proposed to strengthen the expression of access control model, but UCON is an only conceptual model. How to use it in access process still have much work to do, In order to solve the problem, the paper proposes the usage control model in web services, and proposes the process of access control for the requesters and services in web services based on XACML. Finally, a small example is given to verify the availability of the access control model and access process.
{"title":"The Research of Access Process in Web Services Based on XACML","authors":"Changying Dai, Wentao Gong, Jing Liu","doi":"10.1109/DBTA.2010.5658957","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5658957","url":null,"abstract":"Access control is one of the key technologies used in Web services, which can make sure the security of web services. The traditional access control models such as mandatory access control couldn't make the access control flexible and enable due to their design limitations, and then the access process of authorization in web services becomes fuzzy. Usage control model (UCON) is proposed to strengthen the expression of access control model, but UCON is an only conceptual model. How to use it in access process still have much work to do, In order to solve the problem, the paper proposes the usage control model in web services, and proposes the process of access control for the requesters and services in web services based on XACML. Finally, a small example is given to verify the availability of the access control model and access process.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128992623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5658741
Qin Li, Sheng Chang
An approach is proposed to discover closed frequent itemsets with a simple linear list structure called the Frequent Pattern List(FPL) in transaction database. The approach selects representation patterns from candidate itemsets to reduce combinational space of frequent patterns. By performing two operations, signature vertex conjunction and vertex counting, it simplify the process of closed itemsets generation.
{"title":"Generating Closed Frequent Itemsets with the Frequent Pattern List","authors":"Qin Li, Sheng Chang","doi":"10.1109/DBTA.2010.5658741","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5658741","url":null,"abstract":"An approach is proposed to discover closed frequent itemsets with a simple linear list structure called the Frequent Pattern List(FPL) in transaction database. The approach selects representation patterns from candidate itemsets to reduce combinational space of frequent patterns. By performing two operations, signature vertex conjunction and vertex counting, it simplify the process of closed itemsets generation.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123529558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5659023
Na Li, Junhui Liu
This paper studies the design of data fusion algorithm for asynchronous system with integer times sampling. Firstly, the multisensor asynchronous samplings is mapped to the basic axis, accordingly a sampling sequence of single sensor can be taken. Secondly, aiming at the sensor with the densest sampling points, the modified parallel filtering is given. Afterwards, the sequential filtering fusion method is introduced to deal with the case that there are multiple mapped measurements at some sampling point. Finally, a novel parallel filtering fusion algorithm for asynchronous system with integer times sampling is proposed. Besides, a judgment scheme to distinguish measurement number at every sampling point in the fusion period is also discussed.
{"title":"Parallel Filtering Fusion for Asynchronous System with Integer Times Sampling","authors":"Na Li, Junhui Liu","doi":"10.1109/DBTA.2010.5659023","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5659023","url":null,"abstract":"This paper studies the design of data fusion algorithm for asynchronous system with integer times sampling. Firstly, the multisensor asynchronous samplings is mapped to the basic axis, accordingly a sampling sequence of single sensor can be taken. Secondly, aiming at the sensor with the densest sampling points, the modified parallel filtering is given. Afterwards, the sequential filtering fusion method is introduced to deal with the case that there are multiple mapped measurements at some sampling point. Finally, a novel parallel filtering fusion algorithm for asynchronous system with integer times sampling is proposed. Besides, a judgment scheme to distinguish measurement number at every sampling point in the fusion period is also discussed.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116476400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：