Recently efficient and scalable live video streaming system over the Internet has become a hot topic. In order to improve the system performance metrics, such as startup delay, source-to-end delay, playback continuity and scalability, many previous works developed two successful cases of content distribution network (CDN) and peer-to-peer (P2P) Network for the design of large-scale live video streaming systems, but no single one has yet delivered both the scale and service quality. To combine the advantages of CDN and P2P network has been considered as a feasible orientation for large-scale video stream delivering. In this paper, we propose a peer-assisted content distribution network, i.e. PACDN, which borrows the mesh-based P2P ideas into the traditional CDN to enhance the performance and scalability. The basic features of PACDN include: 1) To meet the real time requirement of live video stream service, i.e. to ensure that the video stream could be continuously and stably delivered from the source to each edge server for offering good QoS to different regions clients, the placement edge servers and source streaming server(s) build a hierarchical multi-tree based and in-hierarchy peer-assisted overlay, which is optimized according to the knowledge of underlying physical topology. This scheme in the design is called "server side peer-assisted". 2) To enhance the system scalability and reduce the deployment cost, clients and edge servers construct a Client/Server based and P2P network assisted overlay with the increasing of viewers, which is called "client side peer-assisted" in this design. We compare the inner performance of PACDN with existing approaches based on comprehensive simulations and analysis. The results show that our proposed design outperforms previous systems in the service quality and scalability. PACDN has been implemented as an Internet live video streaming service and it was successfully deployed for broadcasting many important live programs in China in 2007. The industrial experiences prove that this design is scalable and reliable. We believe that the wide deployment of PACDN and its further development will soon benefit many more Internet users.
近年来，高效、可扩展的互联网视频直播系统已成为一个热门话题。为了提高系统的性能指标，如启动延迟、源到端延迟、播放连续性和可扩展性，许多前人的工作开发了内容分发网络(CDN)和点对点网络(P2P)两种成功的案例来设计大型视频直播系统，但还没有一种能够同时实现规模和服务质量。结合CDN和P2P网络的优势，被认为是大规模视频流传输的可行方向。本文提出了一种peer-assisted content distribution network，即PACDN，它将基于网格的P2P思想引入到传统的CDN中，以增强其性能和可扩展性。PACDN的基本特征包括:1)为满足视频流直播业务的实时性要求，即确保视频流能够连续稳定地从源端传输到各个边缘服务器，从而为不同区域的客户端提供良好的QoS，放置边缘服务器和源流服务器构建了基于分层多树的分层对等辅助覆盖，并根据底层物理拓扑知识进行优化。该方案在设计中被称为“服务器端对等辅助”。2)为了增强系统的可扩展性，降低部署成本，随着观看者的增加，客户端和边缘服务器构建了基于Client/Server的P2P网络辅助覆盖，本设计称之为“客户端对等辅助”。在综合仿真分析的基础上，比较了PACDN与现有方案的内部性能。结果表明，我们提出的设计在服务质量和可扩展性方面优于以往的系统。PACDN作为一种互联网直播视频流服务已经实现，并于2007年在中国成功部署了许多重要的直播节目。工业实践证明，该设计具有可扩展性和可靠性。我们相信，PACDN的广泛部署和进一步发展将很快使更多的互联网用户受益。
{"title":"Performance Analysis and Industrial Practice of Peer-Assisted Content Distribution Network for Large-Scale Live Video Streaming","authors":"Xuening Liu, H. Yin, Chuang Lin, Yu Liu, Zhijia Chen, Xin Xiao","doi":"10.1109/AINA.2008.132","DOIUrl":"https://doi.org/10.1109/AINA.2008.132","url":null,"abstract":"Recently efficient and scalable live video streaming system over the Internet has become a hot topic. In order to improve the system performance metrics, such as startup delay, source-to-end delay, playback continuity and scalability, many previous works developed two successful cases of content distribution network (CDN) and peer-to-peer (P2P) Network for the design of large-scale live video streaming systems, but no single one has yet delivered both the scale and service quality. To combine the advantages of CDN and P2P network has been considered as a feasible orientation for large-scale video stream delivering. In this paper, we propose a peer-assisted content distribution network, i.e. PACDN, which borrows the mesh-based P2P ideas into the traditional CDN to enhance the performance and scalability. The basic features of PACDN include: 1) To meet the real time requirement of live video stream service, i.e. to ensure that the video stream could be continuously and stably delivered from the source to each edge server for offering good QoS to different regions clients, the placement edge servers and source streaming server(s) build a hierarchical multi-tree based and in-hierarchy peer-assisted overlay, which is optimized according to the knowledge of underlying physical topology. This scheme in the design is called \"server side peer-assisted\". 2) To enhance the system scalability and reduce the deployment cost, clients and edge servers construct a Client/Server based and P2P network assisted overlay with the increasing of viewers, which is called \"client side peer-assisted\" in this design. We compare the inner performance of PACDN with existing approaches based on comprehensive simulations and analysis. The results show that our proposed design outperforms previous systems in the service quality and scalability. PACDN has been implemented as an Internet live video streaming service and it was successfully deployed for broadcasting many important live programs in China in 2007. The industrial experiences prove that this design is scalable and reliable. We believe that the wide deployment of PACDN and its further development will soon benefit many more Internet users.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123377686","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}
PPM models are commonly used to predict the user's next request in Web prefetching by extracting useful knowledge from historical user requests. Any of features such as page access frequency, prediction feedback, context length and conditional probability can influence on the prefetching performance of PPM models. However, existing PPM models only consider one or a few of them. Based on stochastic gradient descent, we present a novel PPM model that takes into account all the above mentioned features. Our model defines a target function to describe a node's prediction capability, which is a linear combination of these features. In order to decrease the number of incorrect predictions, weights of these features are dynamically updated over every example according to the stochastic gradient descent rule. Our model selects a node with the maximum target function value among all matching nodes to predict the next most probable page. We use real web logs to examine proposed model. The simulation shows our model can significantly improve the prefetching performance.
{"title":"A PPM Prediction Model Based on Stochastic Gradient Descent for Web Prefetching","authors":"Zhijie Ban, Zhimin Gu, Yu Jin","doi":"10.1109/AINA.2008.19","DOIUrl":"https://doi.org/10.1109/AINA.2008.19","url":null,"abstract":"PPM models are commonly used to predict the user's next request in Web prefetching by extracting useful knowledge from historical user requests. Any of features such as page access frequency, prediction feedback, context length and conditional probability can influence on the prefetching performance of PPM models. However, existing PPM models only consider one or a few of them. Based on stochastic gradient descent, we present a novel PPM model that takes into account all the above mentioned features. Our model defines a target function to describe a node's prediction capability, which is a linear combination of these features. In order to decrease the number of incorrect predictions, weights of these features are dynamically updated over every example according to the stochastic gradient descent rule. Our model selects a node with the maximum target function value among all matching nodes to predict the next most probable page. We use real web logs to examine proposed model. The simulation shows our model can significantly improve the prefetching performance.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123127275","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. Bottaro, E. Simon, Stéphane Seyvoz, A. Gérodolle
The home network is a pervasive environment by nature. Its openness to dynamic distributed and heterogeneous devices brings great challenges in home application design. We present here an open architecture for home service development. Distribution and heterogeneity are managed by service-oriented drivers leveraging the "service platform" concept. Our project provides an open source driver combining Web services and OSGi standards to compose home services. Performance test results illustrate the service-oriented design.
{"title":"Dynamic Web Services on a Home Service Platform","authors":"A. Bottaro, E. Simon, Stéphane Seyvoz, A. Gérodolle","doi":"10.1109/AINA.2008.14","DOIUrl":"https://doi.org/10.1109/AINA.2008.14","url":null,"abstract":"The home network is a pervasive environment by nature. Its openness to dynamic distributed and heterogeneous devices brings great challenges in home application design. We present here an open architecture for home service development. Distribution and heterogeneity are managed by service-oriented drivers leveraging the \"service platform\" concept. Our project provides an open source driver combining Web services and OSGi standards to compose home services. Performance test results illustrate the service-oriented design.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116099027","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 sophisticated protocols for routing in ad hoc networks have been proposed, but there is still little work on service discovery in such volatile environments. In this paper a mobile agent-based scheme for service discovery in ad hoc networks is introduced. Mobile agents are traveling through the network, collecting the dynamically changing service information. The travel route and the number of travel agents are adjusted according to the information state and the change of network topology. In a quantitative analysis the proposed algorithm is compared with the flooding scheme. The usefulness of the approach is proved by an implementation for mobile devices using J2ME and Bluetooth.
{"title":"Mobile Agents for Service Discovery in Ad Hoc Networks","authors":"R. Meier, J. Dunkel, Y. Kakuda, T. Ohta","doi":"10.1109/AINA.2008.78","DOIUrl":"https://doi.org/10.1109/AINA.2008.78","url":null,"abstract":"Recently sophisticated protocols for routing in ad hoc networks have been proposed, but there is still little work on service discovery in such volatile environments. In this paper a mobile agent-based scheme for service discovery in ad hoc networks is introduced. Mobile agents are traveling through the network, collecting the dynamically changing service information. The travel route and the number of travel agents are adjusted according to the information state and the change of network topology. In a quantitative analysis the proposed algorithm is compared with the flooding scheme. The usefulness of the approach is proved by an implementation for mobile devices using J2ME and Bluetooth.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121148686","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}
Triple loop networks (graphs) are generalizations of the ring topology where every vertex v is linked to 6 vertices v a, v b, v c. In this paper, we study the broadcast problem in optimal triple loop graphs. In 1987 for a restricted case a = -(b + c) the (maximum) number of vertices in the sub- optimal Triple loop graph has been proved to be a quadratic function of diameter d. In 1998 the broadcast time of this graph is proved to be d + 3. Recently, in 2003 the Optimal Triple Loop Graph in general was constructed, where its number of vertices is a cubic function of d. In this paper we prove d + 2 lower bound and d + 5 upper bound for broadcasting in general Optimal Triple Loop Graph. We also generalize our upper bound algorithm in Multiple Loop Graphs giving d + 2 k-1 general upper bound where the degree of every vertex is 2 k.
三环网络(图)是环拓扑的推广，其中每个顶点v连接到6个顶点v a, v b, v c。本文研究了最优三环图中的广播问题。1987年，在a = -(b + c)的限制情况下，证明了次最优三环图的顶点数是直径d的二次函数。1998年，证明了该图的广播时间为d + 3。2003年构造了一般最优三环图，其中顶点数是d的三次函数。本文证明了一般最优三环图广播的d + 2下界和d + 5上界。我们还将上界算法推广到多重循环图中，给出d + 2 k-1一般上界，其中每个顶点的度数为2 k。
{"title":"Near Optimal Broadcasting in Optimal Triple Loop Graphs","authors":"Hovhannes A. Harutyunyan, Edward Maraachlian","doi":"10.1109/AINA.2008.83","DOIUrl":"https://doi.org/10.1109/AINA.2008.83","url":null,"abstract":"Triple loop networks (graphs) are generalizations of the ring topology where every vertex v is linked to 6 vertices v a, v b, v c. In this paper, we study the broadcast problem in optimal triple loop graphs. In 1987 for a restricted case a = -(b + c) the (maximum) number of vertices in the sub- optimal Triple loop graph has been proved to be a quadratic function of diameter d. In 1998 the broadcast time of this graph is proved to be d + 3. Recently, in 2003 the Optimal Triple Loop Graph in general was constructed, where its number of vertices is a cubic function of d. In this paper we prove d + 2 lower bound and d + 5 upper bound for broadcasting in general Optimal Triple Loop Graph. We also generalize our upper bound algorithm in Multiple Loop Graphs giving d + 2 k-1 general upper bound where the degree of every vertex is 2 k.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114279828","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}
Fair certified email is an email system which employs the fair exchange protocol. All existing approaches to fair certified email achieve the fair exchange property between a single sender and a receiver only. But they do not offer the fair exchange between all senders and a receiver. So, a malicious receiver can deny receiving messages from some senders but do receive messages from other senders. Also, the existing certified email protocols do not prevent the distributed denial of service attack by malicious senders. We propose a new certified email protocol which provides the fair exchange for all senders, called the undeniable fairness, and distributed denial of service protection.
{"title":"Dynamic Undeniable Fair Certified Email with DDoS Protection","authors":"Y. Permpoontanalarp, Jatupoom Kanokkanjanapong","doi":"10.1109/AINA.2008.61","DOIUrl":"https://doi.org/10.1109/AINA.2008.61","url":null,"abstract":"Fair certified email is an email system which employs the fair exchange protocol. All existing approaches to fair certified email achieve the fair exchange property between a single sender and a receiver only. But they do not offer the fair exchange between all senders and a receiver. So, a malicious receiver can deny receiving messages from some senders but do receive messages from other senders. Also, the existing certified email protocols do not prevent the distributed denial of service attack by malicious senders. We propose a new certified email protocol which provides the fair exchange for all senders, called the undeniable fairness, and distributed denial of service protection.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125694328","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}
Spectrum sensing is one of the most challenging functions in cognitive radio system. Detection of the presence of signals and distinction of the type of signals in a particular frequency band are critical for cognitive radios to adapt to the radio environment. In this paper, a novel approach to signal classification combining spectral correlation analysis and support vector machine (SVM) is introduced. Four spectral coherence characteristic parameters are chosen via spectral correlation analysis. By utilizing a nonlinear SVM, a significant amount of calculation is performed offline, thus the computational complexity is reduced. Simulations indicate that the overall success rate is above 92.8% with data length of 1000 when SNR is equal to 4 dB. Compared to the existing methods including the classifiers based on binary decision tree (BDT) and multilayer linear perceptron network (MLPN), the proposed approach is more effective in the case of low SNR and limited training numbers.
频谱感知是认知无线电系统中最具挑战性的功能之一。识别信号的存在和识别特定频段信号的类型是认知无线电适应无线电环境的关键。本文提出了一种结合频谱相关分析和支持向量机的信号分类方法。通过光谱相关分析，选择4个光谱相干特征参数。通过使用非线性支持向量机，大量的计算是离线进行的，从而降低了计算复杂度。仿真结果表明，当信噪比为4 dB时，当数据长度为1000时，总体成功率在92.8%以上。与基于二叉决策树(binary decision tree, BDT)和多层线性感知器网络(multilayer linear perceptron network, MLPN)的分类器方法相比，该方法在低信噪比和训练次数有限的情况下更有效。
{"title":"Signal Classification Based on Spectral Correlation Analysis and SVM in Cognitive Radio","authors":"Hao Hu, Yujing Wang, Junde Song","doi":"10.1109/AINA.2008.27","DOIUrl":"https://doi.org/10.1109/AINA.2008.27","url":null,"abstract":"Spectrum sensing is one of the most challenging functions in cognitive radio system. Detection of the presence of signals and distinction of the type of signals in a particular frequency band are critical for cognitive radios to adapt to the radio environment. In this paper, a novel approach to signal classification combining spectral correlation analysis and support vector machine (SVM) is introduced. Four spectral coherence characteristic parameters are chosen via spectral correlation analysis. By utilizing a nonlinear SVM, a significant amount of calculation is performed offline, thus the computational complexity is reduced. Simulations indicate that the overall success rate is above 92.8% with data length of 1000 when SNR is equal to 4 dB. Compared to the existing methods including the classifiers based on binary decision tree (BDT) and multilayer linear perceptron network (MLPN), the proposed approach is more effective in the case of low SNR and limited training numbers.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127616733","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}
As Internet use has proliferated, Web-based learning systems have become more and more popular. Numerous researchers have spent a great deal of effort to facilitate the promotion of high quality Web-based learning environments, such as intelligent Web-based learning systems and adaptive learning. To facilitate such researches, students' behavioral patterns must be observed and experimentally analyzed. However, building a Web-based learning system and the requisite collecting of behavioral patterns usually takes a great deal of time and effort. To solve this problem, this paper proposes a learning behavioral model based on Colored Petri Nets (CPN) to model and generate students' behavioral patterns. To verify the viability of the proposed model, this paper compares actual data collected from elementary school students with the behavioral pattern generated by the proposed model. The results prove: (1) The generated behavioral pattern approaches actual student behavior; (2) The generated behavioral pattern serves as adequate test data to test whether the predicted learning content of an intelligent e-learning system is appropriate; and (3) The proposed model is capable of recommending the appropriate learning content for students utilizing e-learning systems.
{"title":"A Model for Behavioral Patterns in Web-Based Learning Environments","authors":"Chih-Ping Chu, Yi-Chun Chang","doi":"10.1109/AINA.2008.72","DOIUrl":"https://doi.org/10.1109/AINA.2008.72","url":null,"abstract":"As Internet use has proliferated, Web-based learning systems have become more and more popular. Numerous researchers have spent a great deal of effort to facilitate the promotion of high quality Web-based learning environments, such as intelligent Web-based learning systems and adaptive learning. To facilitate such researches, students' behavioral patterns must be observed and experimentally analyzed. However, building a Web-based learning system and the requisite collecting of behavioral patterns usually takes a great deal of time and effort. To solve this problem, this paper proposes a learning behavioral model based on Colored Petri Nets (CPN) to model and generate students' behavioral patterns. To verify the viability of the proposed model, this paper compares actual data collected from elementary school students with the behavioral pattern generated by the proposed model. The results prove: (1) The generated behavioral pattern approaches actual student behavior; (2) The generated behavioral pattern serves as adequate test data to test whether the predicted learning content of an intelligent e-learning system is appropriate; and (3) The proposed model is capable of recommending the appropriate learning content for students utilizing e-learning systems.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127697875","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}
This paper addresses the problem of frequency offsets and channel gains estimation for MIMO system in flat-fading channels. Based on the MUSIC (multiple signal classification) and the ML (maximum likelihood) methods, a new joint estimation algorithm of frequency offsets and channel gains is proposed. The new algorithm has three steps. A subset of frequency offsets is first estimated by the MUSIC algorithm. Then all frequency offsets in the subset are identified by the ML method. Finally channel gains are estimated by the ML estimator. The algorithm is a one- dimensional search scheme and therefore greatly decreases the complexity of the joint ML estimation, which is essentially a multi-dimensional search scheme. The performance of this algorithm is evaluated by Monte Carlo simulations.
{"title":"Parameter Estimation for MIMO Systems with Multiple Frequency Offsets","authors":"Wei Dong, Jiandong Li, Zhuo Lu","doi":"10.1109/AINA.2008.80","DOIUrl":"https://doi.org/10.1109/AINA.2008.80","url":null,"abstract":"This paper addresses the problem of frequency offsets and channel gains estimation for MIMO system in flat-fading channels. Based on the MUSIC (multiple signal classification) and the ML (maximum likelihood) methods, a new joint estimation algorithm of frequency offsets and channel gains is proposed. The new algorithm has three steps. A subset of frequency offsets is first estimated by the MUSIC algorithm. Then all frequency offsets in the subset are identified by the ML method. Finally channel gains are estimated by the ML estimator. The algorithm is a one- dimensional search scheme and therefore greatly decreases the complexity of the joint ML estimation, which is essentially a multi-dimensional search scheme. The performance of this algorithm is evaluated by Monte Carlo simulations.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134185904","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}
Valbona Barolli, Heihachiro Fukuda, L. Barolli, M. Takizawa
In this paper, we introduce and evaluate a computing model for marketable quality and profitability of corporations. We discuss the model prediction of the turning and transition periods based on data from two different sources. By applying these real data of some leading manufacturing corporations in Japan, we analyze the model accuracy. From the analysis, we conclude that even there are some differences between two sources data, the proposed model give a good approximation and prediction of the turning and transition periods of Japanese economy.
{"title":"A Computing Model for Marketable Quality and Profitability of Corporations: Model Evaluation Based on Two Different Sources Data","authors":"Valbona Barolli, Heihachiro Fukuda, L. Barolli, M. Takizawa","doi":"10.1109/AINA.2008.59","DOIUrl":"https://doi.org/10.1109/AINA.2008.59","url":null,"abstract":"In this paper, we introduce and evaluate a computing model for marketable quality and profitability of corporations. We discuss the model prediction of the turning and transition periods based on data from two different sources. By applying these real data of some leading manufacturing corporations in Japan, we analyze the model accuracy. From the analysis, we conclude that even there are some differences between two sources data, the proposed model give a good approximation and prediction of the turning and transition periods of Japanese economy.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115636747","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
扫码关注我们
求助内容：
应助结果提醒方式：