In this paper, we build a sponsored search auction platform to simulate and analysis the auction result for auctioneers. We propose to use geometrically decreasing sequence to capture the click behavior of internet users. In our simulations, the results show that theoretical properties of the charging mechanisms are captured, and the proposed platform reflects the charging mechanism's property. Therefore, the auctioneer can use the proposed platform to simulate the auction and estimate the result in expectations.
{"title":"An Evaluation for Different Pricing Mechanisms under the Sponsored Search with Various Bidding Processes","authors":"Chen-Kun Tsung, H. Ho, Sing-Ling Lee","doi":"10.1109/ICS.2016.0015","DOIUrl":"https://doi.org/10.1109/ICS.2016.0015","url":null,"abstract":"In this paper, we build a sponsored search auction platform to simulate and analysis the auction result for auctioneers. We propose to use geometrically decreasing sequence to capture the click behavior of internet users. In our simulations, the results show that theoretical properties of the charging mechanisms are captured, and the proposed platform reflects the charging mechanism's property. Therefore, the auctioneer can use the proposed platform to simulate the auction and estimate the result in expectations.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128399427","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}
M. Schofield, M. Z. Ahmed, I. Stengel, M. Tomlinson
Secure data transfer is often achieved by encryption. However, if transmitting across a Binary Symmetric Channel while an eavesdropper listens via a Wiretap Channel, the difference in signal quality can be exploited to improve the inherent transmission secrecy. If this exploitation involves the managed use of erasures, then the secrecy of a code transmitted across the channel can be improved whilst simultaneously reducing the volume of data that is transmitted.
{"title":"Intentional Erasures and Equivocation on the Binary Symmetric Channel","authors":"M. Schofield, M. Z. Ahmed, I. Stengel, M. Tomlinson","doi":"10.1109/ICS.2016.0053","DOIUrl":"https://doi.org/10.1109/ICS.2016.0053","url":null,"abstract":"Secure data transfer is often achieved by encryption. However, if transmitting across a Binary Symmetric Channel while an eavesdropper listens via a Wiretap Channel, the difference in signal quality can be exploited to improve the inherent transmission secrecy. If this exploitation involves the managed use of erasures, then the secrecy of a code transmitted across the channel can be improved whilst simultaneously reducing the volume of data that is transmitted.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127352606","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}
PrefixSpan is a pattern-growth method for mining sequential patterns, and it is employed in this research for identifying disease trajectory patterns based on frequent subsequence analysis. One of the most beneficial features of this algorithm is the maintainable characteristics of original data order, especially for effectively and efficiently searching sequential patterns within a huge database. In this study, a medical database was adopted for disease transition analysis, and seven chronic diseases including diabetes, hyperlipidemia, hypertension, cerebrovascular disease, kidney disease, heart failure, and chronic obstructive pulmonary disease were mainly considered. By employing PrefixSpan algorithms, the statistical results of various combinations of chronic diseases with specific orders could be observed and compared. The results shows that patients suffered from hypertension (HTN) and followed by hyperlipidemia (DP) possess the most proportion among all subjects with a percentage of 37% (89,058/241,017). All statistical results of different combinations of seven chronic diseases, transition order, and proportional ranking were shown and discussed.
{"title":"Application of PrefixSpan Algorithms for Disease Pattern Analysis","authors":"Chi-Jane Chen, Tun-Wen Pai, Shih-Syun Lin, Chun-Chao Yeh, Min-Hui Liu, Chao-Hung Wang","doi":"10.1109/ICS.2016.0062","DOIUrl":"https://doi.org/10.1109/ICS.2016.0062","url":null,"abstract":"PrefixSpan is a pattern-growth method for mining sequential patterns, and it is employed in this research for identifying disease trajectory patterns based on frequent subsequence analysis. One of the most beneficial features of this algorithm is the maintainable characteristics of original data order, especially for effectively and efficiently searching sequential patterns within a huge database. In this study, a medical database was adopted for disease transition analysis, and seven chronic diseases including diabetes, hyperlipidemia, hypertension, cerebrovascular disease, kidney disease, heart failure, and chronic obstructive pulmonary disease were mainly considered. By employing PrefixSpan algorithms, the statistical results of various combinations of chronic diseases with specific orders could be observed and compared. The results shows that patients suffered from hypertension (HTN) and followed by hyperlipidemia (DP) possess the most proportion among all subjects with a percentage of 37% (89,058/241,017). All statistical results of different combinations of seven chronic diseases, transition order, and proportional ranking were shown and discussed.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130537033","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}
Minh-Khoi Le, Hsien-Tsung Chang, Yi-Min Chang, Yi-Hao Hu, Huan-Ting Chen
Nowadays, we can find part of people into the suboptimal health status. However, most of them have not enough time for health examinations regularly. Smart clothes which are wearable and convenient devices for monitoring physiological signals solve this problem. In this study, we develop an efficient multilevel healthy cloud system to analyzing data collected from CGU smart clothes. The cloud system classifies the raw data into three types: normal data, continuous data, and multimedia data. After that, the cloud system analyzes data and predict diseases using Apache Spark. And then, the system will transfer final results to smartphones. The experimental result shows that the cloud system achieves very high-speed performance. Moreover, the system has friendly health information presentation and effective authorization process to help doctors and patients contact each other.
{"title":"An Efficient Multilevel Healthy Cloud System Using Spark for Smart Clothes","authors":"Minh-Khoi Le, Hsien-Tsung Chang, Yi-Min Chang, Yi-Hao Hu, Huan-Ting Chen","doi":"10.1109/ICS.2016.0044","DOIUrl":"https://doi.org/10.1109/ICS.2016.0044","url":null,"abstract":"Nowadays, we can find part of people into the suboptimal health status. However, most of them have not enough time for health examinations regularly. Smart clothes which are wearable and convenient devices for monitoring physiological signals solve this problem. In this study, we develop an efficient multilevel healthy cloud system to analyzing data collected from CGU smart clothes. The cloud system classifies the raw data into three types: normal data, continuous data, and multimedia data. After that, the cloud system analyzes data and predict diseases using Apache Spark. And then, the system will transfer final results to smartphones. The experimental result shows that the cloud system achieves very high-speed performance. Moreover, the system has friendly health information presentation and effective authorization process to help doctors and patients contact each other.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130543260","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}
Recently, Chen et al. (DOI 10.1109/SMC.2015. 281) proposed a multiparty quantum key agreement protocol based on Greenberger—Horne—Zeilinger (GHZ) state. They claimed that their protocol can achieve both the security property and the fairness property. However, this study points out that Chen et al.'s protocol cannot achieve the fairness property by an Internal Attack. That is, one of the involved participant (Alice) can determine the final key alone without being detected by other participants.
{"title":"Comment on 'Multiparty Quantum Key Agreement with GHZ State'","authors":"Jun Gu, T. Hwang","doi":"10.1109/ICS.2016.0055","DOIUrl":"https://doi.org/10.1109/ICS.2016.0055","url":null,"abstract":"Recently, Chen et al. (DOI 10.1109/SMC.2015. 281) proposed a multiparty quantum key agreement protocol based on Greenberger—Horne—Zeilinger (GHZ) state. They claimed that their protocol can achieve both the security property and the fairness property. However, this study points out that Chen et al.'s protocol cannot achieve the fairness property by an Internal Attack. That is, one of the involved participant (Alice) can determine the final key alone without being detected by other participants.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131937458","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}
The development of Doppler ultrasound allows us to convert the distribution of reflective ultrasound energy into colored blood flow imaging. The Doppler spectrogram also reveals the change of flow velocity over time when specifying an observation window inside the vessel wall. With the information doctors can visually search for abnormalities in blood vessels or valves from irregular patterns in the Doppler spectrogram within several cardiac cycles. Currently there are very few automatic analysis that can be applied to either color flow imaging or Doppler spectrogram. We hypothesize that the dynamics of flow speed in carotid could be an indicator to abnormalities on vascular wall like arteriosclerosis and stenosis. In this work the time-varying Doppler spectrogram during a carotid ultrasound exam was recorded as a video clip, and the image series were concatenated as a long spectrogram waveform image. To assess the carotid stiffness with previously developed nonlinear analysis and measures, the waveform image was further converted to 1-D signal by several proposed methods. Among them we found one that generated the most reasonable and less noisy curve, and expressed the dynamics of flow speed with minimal distortion.
{"title":"Envelope Approximation on Doppler Ultrasound Spectrogram for Estimating Flow Speed in Carotid Artery","authors":"Wei-Che Chien, Wei-Min Liu, An‐Bang Liu","doi":"10.1109/ICS.2016.0090","DOIUrl":"https://doi.org/10.1109/ICS.2016.0090","url":null,"abstract":"The development of Doppler ultrasound allows us to convert the distribution of reflective ultrasound energy into colored blood flow imaging. The Doppler spectrogram also reveals the change of flow velocity over time when specifying an observation window inside the vessel wall. With the information doctors can visually search for abnormalities in blood vessels or valves from irregular patterns in the Doppler spectrogram within several cardiac cycles. Currently there are very few automatic analysis that can be applied to either color flow imaging or Doppler spectrogram. We hypothesize that the dynamics of flow speed in carotid could be an indicator to abnormalities on vascular wall like arteriosclerosis and stenosis. In this work the time-varying Doppler spectrogram during a carotid ultrasound exam was recorded as a video clip, and the image series were concatenated as a long spectrogram waveform image. To assess the carotid stiffness with previously developed nonlinear analysis and measures, the waveform image was further converted to 1-D signal by several proposed methods. Among them we found one that generated the most reasonable and less noisy curve, and expressed the dynamics of flow speed with minimal distortion.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127959928","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}
Ming-Tsung Kao, Bo-Xiang Huang, S. Kao, Hsueh-Wen Tseng
In the network environment with limited network resources, the overall bandwidth is usually competitively shared among various application users. The traffic engineering techniques presented for resolving the bandwidth sharing, e.g. limited traffic rate and traffic blocking, may not be able to satisfy the requirement for all types of services. In this paper, we propose an effective routing mechanism for link congestion avoidance in the software-defined networking (SDN) environment. We use a SDN controller to handle actions and forwarding rules. The bandwidth is dynamically allocated to deal with link congestion using a centralized control mechanism. According to the bandwidth utilization, we redirect the traffic from congested links to enhance the efficiency of link usage. In the experiments of emulating congested traffic, we are capable of getting better network performance of throughput, jitter, and packet loss rate using the proposed traffic rerouting, as opposed to the environment without traffic rerouting.
{"title":"An Effective Routing Mechanism for Link Congestion Avoidance in Software-Defined Networking","authors":"Ming-Tsung Kao, Bo-Xiang Huang, S. Kao, Hsueh-Wen Tseng","doi":"10.1109/ICS.2016.0039","DOIUrl":"https://doi.org/10.1109/ICS.2016.0039","url":null,"abstract":"In the network environment with limited network resources, the overall bandwidth is usually competitively shared among various application users. The traffic engineering techniques presented for resolving the bandwidth sharing, e.g. limited traffic rate and traffic blocking, may not be able to satisfy the requirement for all types of services. In this paper, we propose an effective routing mechanism for link congestion avoidance in the software-defined networking (SDN) environment. We use a SDN controller to handle actions and forwarding rules. The bandwidth is dynamically allocated to deal with link congestion using a centralized control mechanism. According to the bandwidth utilization, we redirect the traffic from congested links to enhance the efficiency of link usage. In the experiments of emulating congested traffic, we are capable of getting better network performance of throughput, jitter, and packet loss rate using the proposed traffic rerouting, as opposed to the environment without traffic rerouting.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126726803","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}
Manh-Quan Bui, Viet-Hang Duong, S. Mathulaprangsan, Bach-Tung Pham, Wei-Jing Lee, Jia-Ching Wang
Nowadays, sound event detection (SED) is a popular study in machine listening area. Detecting overlapping sound events, in which many sound events occur simultaneously, is challenging and interesting topic. Besides, non-negative matrix factorization (NMF) and its derived methods are suitably used to perform SED. This paper presents a survey of recent approaches in SED based on NMF methods that provides the understanding and strategies for detecting polyphonic sound events.
{"title":"A Survey of Polyphonic Sound Event Detection Based on Non-Negative Matrix Factorization","authors":"Manh-Quan Bui, Viet-Hang Duong, S. Mathulaprangsan, Bach-Tung Pham, Wei-Jing Lee, Jia-Ching Wang","doi":"10.1109/ICS.2016.0077","DOIUrl":"https://doi.org/10.1109/ICS.2016.0077","url":null,"abstract":"Nowadays, sound event detection (SED) is a popular study in machine listening area. Detecting overlapping sound events, in which many sound events occur simultaneously, is challenging and interesting topic. Besides, non-negative matrix factorization (NMF) and its derived methods are suitably used to perform SED. This paper presents a survey of recent approaches in SED based on NMF methods that provides the understanding and strategies for detecting polyphonic sound events.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124994632","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}
Object errors affect the time cost and effectiveness in uncertain data clustering. For decreasing the time cost and increasing the effectiveness, we propose two mechanisms for the centroid based clustering, UKmeans. The first mechanism is an improved similarity. Similarity is an intuitive factor that immediately affects the time cost and effectiveness. For example, similarity calculations with integration focus on the effectiveness of clustering but ignore the time cost. On the contrary, the similarity calculations by simplified approaches address on the issue of time cost but ignore the effectiveness. In this study, for considering both the time cost and effectiveness, we use a simplified similarity for reducing the time cost, and add additional two factors, namely intersection and density of clusters, to increase the effectiveness of clustering. The former factor can increase the degree of the object belongingness when a cluster overlaps the object. The latter factor can avoid objects to be attracted by clusters which have large errors. The other proposed mechanism is the definition of the centroid boundary. In clustering, the position of a cluster centroid is in an average range which contributes from the belonging objects' errors. However, the large average range causes the low effectiveness of clustering. For decreasing the range, we propose the square root boundary mechanism to limit the upper bound of possible positions of centroids to increase the effectiveness of clustering. In experiments, the results suggest that our two mechanisms work well in the time cost and effectiveness and these two mechanisms complete the UKmeans approaches in uncertain data clustering.
{"title":"An Effective Clustering Mechanism for Uncertain Data Mining Using Centroid Boundary in UKmeans","authors":"Kuan-Teng Liao, Chuan-Ming Liu","doi":"10.1109/ICS.2016.0067","DOIUrl":"https://doi.org/10.1109/ICS.2016.0067","url":null,"abstract":"Object errors affect the time cost and effectiveness in uncertain data clustering. For decreasing the time cost and increasing the effectiveness, we propose two mechanisms for the centroid based clustering, UKmeans. The first mechanism is an improved similarity. Similarity is an intuitive factor that immediately affects the time cost and effectiveness. For example, similarity calculations with integration focus on the effectiveness of clustering but ignore the time cost. On the contrary, the similarity calculations by simplified approaches address on the issue of time cost but ignore the effectiveness. In this study, for considering both the time cost and effectiveness, we use a simplified similarity for reducing the time cost, and add additional two factors, namely intersection and density of clusters, to increase the effectiveness of clustering. The former factor can increase the degree of the object belongingness when a cluster overlaps the object. The latter factor can avoid objects to be attracted by clusters which have large errors. The other proposed mechanism is the definition of the centroid boundary. In clustering, the position of a cluster centroid is in an average range which contributes from the belonging objects' errors. However, the large average range causes the low effectiveness of clustering. For decreasing the range, we propose the square root boundary mechanism to limit the upper bound of possible positions of centroids to increase the effectiveness of clustering. In experiments, the results suggest that our two mechanisms work well in the time cost and effectiveness and these two mechanisms complete the UKmeans approaches in uncertain data clustering.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122907862","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}
A fuzzy string matching approach is proposed to solve the pattern recognition problems in this paper. The edit cost is presented as a fuzzy number. The string matching problem with fuzzy edit cost was then equivalent to a shortest path problem with fuzzy weights. By ranking the fuzzy numbers, the object is classified as the reference object that has the minimum fuzzy distance. Some testing objects have been used to show the proposed method can improve the recognition rates.
{"title":"A Method for Fuzzy String Matching","authors":"Wen-Yen Wu","doi":"10.1109/ICS.2016.0083","DOIUrl":"https://doi.org/10.1109/ICS.2016.0083","url":null,"abstract":"A fuzzy string matching approach is proposed to solve the pattern recognition problems in this paper. The edit cost is presented as a fuzzy number. The string matching problem with fuzzy edit cost was then equivalent to a shortest path problem with fuzzy weights. By ranking the fuzzy numbers, the object is classified as the reference object that has the minimum fuzzy distance. Some testing objects have been used to show the proposed method can improve the recognition rates.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134645406","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
扫码关注我们
求助内容：
应助结果提醒方式：