Monday, June 29, 2020

KURTOSIS: IS IT AN APPROPRIATE MEASURE TO COMPARE THE EXTENT OF FAT-TAILEDNESS OF THE DEGREE DISTRIBUTION FOR ANY TWO REALWORLD NETWORKS?

Author :  Natarajan Meghanathan

Affiliation :  Jackson State University

Country :  USA

Category :  Computer Science & Information Technology

Volume, Issue, Month, Year :  7, 8, July, 2017

Abstract :

"Kurtosis" has long been considered an appropriate measure to quantify the extent of fattailedness of the degree distribution of a complex real-world network. However, the Kurtosis values for more than one real-world network have not been studied in conjunction with other statistical measures that also capture the extent of variation in node degree. In this paper, we determine the Kurtosis values for a suite of 48 real-world networks along with measures such as SPR(K), Max(K)-Min(K), Max(K)-Avg(K), SD(K)/Avg(K), wherein SPR(K), Max(K), Min(K), Avg(K) and SD(K) represent the spectral radius ratio for node degree, maximum node degree, minimum node degree, average and standard deviation of node degree respectively. Contrary to the conceived notion in the literature, we observe that real-world networks whose degree distribution is Poisson in nature (characterized by lower values of SPR(K), Max(K)-Min(K), Max(K)-Avg(K), SD(K)/Avg(K)) could have Kurtosis values that are larger than that of realworld networks whose degree distribution is scale-free in nature (characterized by larger values of SPR(K), Max(K)-Min(K), Max(K)-Avg(K), SD(K)/Avg(K)). When evaluated for any two realworld networks among all the 48 real-world networks, the Kendall's concordance-based correlation coefficients between Kurtosis and each of SPR, Max(K)-Min(K), Max(K)-Avg(K) and SD(K)/Avg(K) are 0.40, 0.26, 0.34 and 0.50 respectively. Thus, we seriously question the appropriateness of using Kurtosis to compare the extent of fat-tailedness of the degree distribution of the vertices for any two real-world networks.

Keyword :  Fat-tailedness, Degree Distribution, Kurtosis, Real-World Networks, Kendall's Concordancebased Correlation Coefficient

For More Details https://airccj.org/CSCP/vol7/csit77007.pdf

Friday, June 26, 2020

BUILDING A TEXT-TO-SPEECH SYSTEM FOR PUNJABI LANGUAGE

Author :  Rupinderdeep Kaur

Affiliation :  Computer Science and Engineering department, Thapar University

Country :  Punjab

Category :  Computer Science & Information Technology

Volume, Issue, Month, Year :  7, 8, July, 2017

Keyword :  TTS, Phonetics, Prosody, Speech Synthesis

Abstract :

A Text-To-Speech (TTS) system is a computer application that is capable of converting typed text into speech. This paper contains description of working of a TTS system along with architecture of the system and various available TTS systems for Indian Languages with comparison of these systems on the basis of the methods used by them for speech synthesis. TTS system generally involves two steps, text processing and speech generation. Synthetic speech may be used in several applications, like,telecommunications services, language education, aid to handicapped persons, fundamental and applied research etc. TTS involves many challenges during the process of conversion of text to speech. The most important qualities expected from speech synthesis system are naturalness and intelligibility. The general architecture of a TTS system and different waveform generation methods are discussed in this paper. A scheme for developing a TTS system for Punjabi Language is also included in this paper.

For More Details :  https://airccj.org/CSCP/vol7/csit77006.pdf

Thursday, June 25, 2020

A COLLABORATIVE CODING FRAMEWORK OF RS AND H.264

Author :  Jiejun Hu

Affiliation :  Department of Computer Science and Technology, Jilin University

Country :  China

Category :  Computer Science & Information Technology

Volume, Issue, Month, Year :  7, 8, June, 2017

ABSTRACT 
The quality of online multimedia is required higher and higher, yet the uncertainty of network, such as interference, connection failure, still exists. In order to ensure the quality of service in multimedia transmission, we incorporate erasure code with video code together, and present a collaborative coding framework of Reed-Solomon code (RS) and H.264. First of all, we analyze the common coding pattern hidden in RS and H.264. Then, we design the collaborative coding framework of the two codes. Finally, we give a prototype implementation and validate the coding effectiveness using standard dataset. The erasure data slice goes through the redundant data tunnel of H.264, thus it will not involve extra traffic overhead. Experimental results show that the framework can increase the quality of media transmission.  

Keyword :  RS coding, H.264 coding, erasure code, video code, collaborative coding framework

For More Details  :  https://airccj.org/CSCP/vol7/csit77005.pdf

Sunday, June 21, 2020

SCALABLE AND EFFICIENT PATHSENSITIVE ANALYSIS TECHNIQUE SCANNING MANY TYPES OF VULNERABILITY

Author :  Dongok Kang

Affiliation :  PA Division, Fasoo.com R&D Center, Seoul

Country :  Repulic of Korea

Category :  Computer Science & Information Technology

Volume, Issue, Month, Year :  7, 8, June, 2017

Abstract :

The goal of this paper is to present an efficient and effective path-sensitive analysis technique for many types of security vulnerability. We propose two analysis techniques. The first is a scalable path-sensitive analysis technique for security vulnerability with high precision and recall. Our strategies are to allow flexible design of path state and to make an effective path navigation heuristic which achieves both scalability and high recall. Experimental results show that a vulnerability scanner implemented through this technique get precision 100% and recall 93% on OWASP Benchmark. The vulnerability scanner is able to analyze 1 million lines of code. The second is a pre-analysis technique to improve the efficiency of the above analysis technique. The pre-analysis technique improves the path navigation by using an additional cheap anlysis. Despite the additional cost, experimental results show that the total analysis time is reduced by 2.5 times. Simultaneously recall of the analysis is improved by the pre-analysis technique.

Keyword :  Secure coding, Security, Static analysis, Vulnerability scanner, Summary-based, Path-sensitive, Information flow Analysis, Pre-analysis

For More Details https://airccj.org/CSCP/vol7/csit77003.pdf

Friday, June 19, 2020

GÖDEL THEOREM IS INVALID

Author :  J. Ulisses Ferreira

Affiliation :  Trv Pirapora 36 Costa Azul, 41770-220, Salvador

Country :  Brazil

Category :  Computer Science & Information Technology

Volume, Issue, Month, Year :  7, 8, June, 2017

Abstract :

This short and informal article shows that there exists some deductive system that proves that arithmetic is both sound and complete. First, it shows that there exists some four-valued logical system that plays the same role, by presenting a four-valued logic and informally introducing a four-valued Prolog programming language. Finally, it observes that some Boolean formal system can also prove that arithmetic is both sound and complete.

Keyword :  Gödel, incompleteness theorem, four-valued logic, logic, computability theory, philosophy of computer science

For More Details https://airccj.org/CSCP/vol7/csit77002.pdf

Sunday, June 14, 2020

A COMPARATIVE STUDY FOR ICA MULTIUNIT ALGORITHMS

Author :  Doru CONSTANTIN

Affiliation :  Department of Mathematics-Informatics, University of Pitesti

Country :  Romania

Category :  Computer Science & Information Technology

Volume, Issue, Month, Year :  7, 18, December, 2017

Abstract :

We present the comparative study of convergence for multiunit algorithms based on negentropy function for estimating the independent components.

Keyword :  Independent Component Analysis (ICA),Blind Source Separation (BSS), Signal Processing, Negentropy function

URL https://airccj.org/CSCP/vol7/csit78001.pdf