{"title":"The role of psychophysics laws in quality of experience assessment: a video streaming case study","authors":"S. Khorsandroo, R. M. Noor, Sayid Khorsandroo","doi":"10.1145/2345396.2345470","DOIUrl":"https://doi.org/10.1145/2345396.2345470","url":null,"abstract":"The wide range of multimedia services has been attracting more users every day, while the increasing number of users plays an important role in the competitive advantage for network/service providers. Due to the fact that the users are the ones who pay for services, their satisfaction is an important goal for each provider in order to survive in the highly competitive market of multimedia services. Because of the nature of multimedia services, users can instantly detect any quality disturbances. For example, users might tolerate several interruptions during a download or upload process, but they may get irritated as soon as they experience a small amount of voice or video disturbance while they are watching their favorite movie through the internet for instance. Thus, quality of experience (QoE) should be maintained at a steady and acceptable level to satisfy users. To do so, it is necessary to identify the contributing factors in the network which affect multimedia quality. Generally speaking, delay, jitter, loss, and bandwidth have considerable impact on multimedia service quality. Because quality of service (QoS) is among the greatest impacting factors of QoE, it seems required to define a quantitative relation between QoE and QoS in order to keep the QoE at an acceptable level. This paper aims to benefit from psychophysics laws to devise quantitative relations which explain the interdependency of QoE and QoS. The proposed quantitative relations are expressed as equations which are then compared in theoretical and experimental setting to indicate which one can better reflect the relationship between QoE and QoS. A video streaming service affected by packet loss was also chosen as a candidate for our test bed. The test-bed results are then estimated by non linear regression and then validated by goodness of fit indexes. In this way, it can be examined how strongly each equation can express the dependency between QoE and QoS.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114534225","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}
S. Balamurugan, Balakumaran Srirangaswamy, R. Marimuthu, P. Mallick
{"title":"FPGA design and implementation of truncated multipliers using bypassing technique","authors":"S. Balamurugan, Balakumaran Srirangaswamy, R. Marimuthu, P. Mallick","doi":"10.1145/2345396.2345574","DOIUrl":"https://doi.org/10.1145/2345396.2345574","url":null,"abstract":"In this paper, we investigate the design and implementation of standard and fixed-width 8 x 8 multipliers using row bypassing technique. The design is described using VERILOG Hardware Descriptive Language and implemented using XILINX ISE 12.1v tool. Multipliers are a core part of any data path circuit and in many multimedia applications; we require both inputs and outputs to have the same bit width. For these type of applications the standard multipliers is not the best choice because an n-bit input will produce a 2n-bit output. An n-bit output i.e., a fixed width multiplier can be obtained by truncating the least significant partial products of the multiplier. The comparison table shows that a significant reduction of FPGA resources and delay can be achieved using fixed-width multipliers instead of standard multipliers.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114084244","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}
{"title":"An effective e-governance model for financial institutions in India","authors":"A. G. Rao, Manish R. Joshi","doi":"10.1145/2345396.2345398","DOIUrl":"https://doi.org/10.1145/2345396.2345398","url":null,"abstract":"Indian post liberalization era witnessed a phenomenal growth in the number of Non Agricultural Cooperative Credit Societies (NACCS) particularly in the state of Maharashtra. The regulatory mechanism however could not cope with the pace and fail to control some of these NACCS. A series of debacle and collapse of several NACCS that cause money loss of several lower, lower-medium income class investors' underlines the importance of prompt, persuasive and trust worthy regulatory mechanism.\u0000 We propose an IT enabled, domain expert knowledge supported (intelligent) model for the regulatory authority to monitor functioning of NACCS. The architectural details and the description of the component modules of the developed system are presented. The financial information of 184 NACCS of Jalgaon district is provided to the model. The effectiveness of the proposed model is tested and verified by the regulating authorities of Jalgaon district.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114236223","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}
{"title":"Resource efficient survivability approach for resilient WDM optical networks","authors":"D. K. Tyagi, V. S. Shekhawat, V. K. Chaubey","doi":"10.1145/2345396.2345497","DOIUrl":"https://doi.org/10.1145/2345396.2345497","url":null,"abstract":"This paper presents an overview of various existing network survivability techniques implemented in optical WDM networks and proposes an efficient network survivability approach. The proposed approach works on the principle of preplanned protection which adopts dynamic restoration strategy to improve the wavelength usages and call connection rate under single link failure scenario. The resiliency in the network is achieved through backup paths utilizing pre-provisioning at the time of connection establishment process and also by reserving wavelengths during the failure recovery time. The proposed approach has been analyzed and compared with the preplanned protection and dynamic restoration method through simulation to confirm an improvement in call acceptance ratio.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127148774","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. S. Hameed, C. N. Subalalitha, T. Geetha, R. Parthasarathi
{"title":"A deconverter framework for Malayalam","authors":"M. S. Hameed, C. N. Subalalitha, T. Geetha, R. Parthasarathi","doi":"10.1145/2345396.2345534","DOIUrl":"https://doi.org/10.1145/2345396.2345534","url":null,"abstract":"This paper discusses the design and implementation of a deconverter framework for the Malayalam Language. The Universal Networking Language or UNL facilitates translation between Natural Languages across the world. The paper focuses on the linguistic aspects of Malayalam required for the deconversion process. The case marking module handles the different UNL relations and their corresponding language features in Malayalam. A Morphological Generator takes care of generation of Malayalam words with the appropriate case endings and features, with respect to the cases and UNL attributes present in the UNL expression. The words are rearranged by the Syntax Planning Module to produce proper Natural Language sentences. These language dependent features for Malayalam have been successfully incorporated into a Deconverter Framework that handles English and Tamil currently. The Deconverter for Malayalam can currently produce simple Malayalam sentences and handle sentences with single clausal phrases also. It is being enhanced to handle more types of sentences. The present system is a small achievement towards attaining a complete translation facility for the Malayalam language. The following sections examine what has been implemented so far in the Deconverter and what more can be done to realize that dream of a translation facility.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125790574","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}
{"title":"Task scheduling using ACO-BP neural network in computational grids","authors":"K. R. R. Babu, P. Mathiyalagan, S. Sivanandam","doi":"10.1145/2345396.2345467","DOIUrl":"https://doi.org/10.1145/2345396.2345467","url":null,"abstract":"Task Scheduling in computational grid is a complex optimization problem which may require consideration of different criteria such as waiting time, makespan time, throughput, communication time, and dispatching time. For optimal scheduling, the scheduler must know about the above factors and status of the resources in the grid and include these dynamic changes in the availability of resources while scheduling the tasks. For all situations, classical algorithms cannot adapt themselves with situations. The heuristic algorithms are proved to be more efficient than classical scheduling algorithms. This paper propose a method that tunes the Back Propagation Neural networks (BPN) using the capability of ACO algorithm to produce an optimal solution. Proposed method reduces the computation time by removing the unnecessary links in the neural network structure. The algorithm increases the efficiency the scheduling process and allocates the tasks to best available resources in the computation grid.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123674915","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. Naeem, G. Dobbie, Imran Sarwar Bajwa, Gerald Weber
{"title":"Resource optimization for processing of stream data in data warehouse environment","authors":"M. Naeem, G. Dobbie, Imran Sarwar Bajwa, Gerald Weber","doi":"10.1145/2345396.2345407","DOIUrl":"https://doi.org/10.1145/2345396.2345407","url":null,"abstract":"To fulfill the increasing demand of business for the latest information, current data integration approaches are moving towards real-time updates. In the case of real-time data integration the updates occurring on the source systems need to be reflected in the data warehouse immediately. One important element in real-time data integration is the join of a continuous incoming data stream with a disk-based master data. In this context a stream-based algorithm called X-HYBRIDJOIN (Extended Hybrid Join) has been proposed earlier, with a favorable asymptotic runtime behavior. However, the absolute performance was not as good as hoped for. In this paper we present results showing that through properly tuning the algorithm, the resulting Tuned X-HYBRIDJOIN performs significantly better than that of the previous X-HYBRIDJOIN, and better as other applicable join operators found in literature. We present the tuning approach, based on measurement techniques and a revised cost model. To evaluate the algorithm's performance we conduct an experimental study that shows that Tuned X-HYBRIDJOIN exhibits the desired performance characteristics.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121742789","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}
{"title":"An effective unsupervised network anomaly detection method","authors":"M. Bhuyan, D. Bhattacharyya, J. Kalita","doi":"10.1145/2345396.2345484","DOIUrl":"https://doi.org/10.1145/2345396.2345484","url":null,"abstract":"In this paper, we present an effective tree based subspace clustering technique (TreeCLUS) for finding clusters in network intrusion data and for detecting unknown attacks without using any labelled traffic or signatures or training. To establish its effectiveness in finding all possible clusters, we perform a cluster stability analysis. We also introduce an effective cluster labelling technique (CLUSLab) to generate labelled dataset based on the stable cluster set generated by TreeCLUS. CLUSLab is a multi-objective technique that exploits an ensemble approach for stability analysis of the clusters generated by TreeCLUS. We evaluate the performance of both TreeCLUS and CLUSLab in terms of several real world intrusion datasets to identify unknown attacks and find that both outperform the competing algorithms.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131314876","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. Kannan, Gerald Q. Maguire, Ayush Sharma, Volker Fusenig, P. Schoo
{"title":"N-ary tree based key distribution in a network as a service provisioning model","authors":"A. Kannan, Gerald Q. Maguire, Ayush Sharma, Volker Fusenig, P. Schoo","doi":"10.1145/2345396.2345550","DOIUrl":"https://doi.org/10.1145/2345396.2345550","url":null,"abstract":"Cloud networking is a new technology which integrates network provisioning with the existing cloud service provisioning models. This integration allows service providers to provision network resources together with network performance guarantees as a part of their service offering. However, the introduction of multiple providers and service levels introduces many security challenges. One such challenge is identity management, especially authentication of different entities. This paper presents an analysis of a management scheme deployed in a simulated cloud network test bed. Our results show that this scheme is faster than binary and erasure encoding schemes. The scheme uses an N-ary approach and thus allows the placement of n entities at each level, unlike the binary scheme which is restricted to two entities.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128281265","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}
{"title":"Time based agent garbage collection algorithm for multicore architectures","authors":"G. Muneeswari, K. L. Shunmuganathan","doi":"10.1145/2345396.2345432","DOIUrl":"https://doi.org/10.1145/2345396.2345432","url":null,"abstract":"Multicore architecture consists of large number of processors that are arranged together on the same chip uses hyper threading technology (using virtualization). The parallel processing exhibited by the large number of processor increases the challenges and design issues for the real time process (critical task) execution on the processor cores. This is a vital part from the operating system scheduling and storage compaction point of view. In this paper we combine the AMAS theory of multiagent system with the affinity based processor scheduling and this will be best suited for critical task execution on multicore platforms. This hard-soft processor affinity scheduling algorithm promises in minimizing the average waiting time of the non critical tasks in the centralized queue and avoids the context switching of critical tasks. That is we assign hard affinity for critical tasks and soft affinity for non critical tasks. The algorithm is applicable for the system that consists of both critical and non critical tasks in the ready queue. Since we use the actual round robin scheduling for non critical tasks and due to soft affinity the load balancing is done automatically for non critical tasks. The novel storage compaction (garbage collection) algorithm consists of local and global garbage collectors which efficiently identifies and removes the unwanted files or information in the distributed or multicore environment making a room for efficient scheduling. We actually modified and simulated the linux 2.6.11 kernel process scheduler to incorporate this scheduling concept. Our result shows the maximum cpu utilization for the non critical tasks and high throughput for the critical tasks.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130439624","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}