bluuebunny/crossref_metadata_2025_split huggingface dataset:
Semantic Web for Virtual University Using XML and Relational Database
Authors: Nada Yasser A. 
Published: May 2018

In this paper a development of virtual university semantic web service is focused. This approach uses XML, relational database and development of a web application to store, retrieve, and transfer operative notes between database and XML file. To provide an additional management features for this suggested approach, a proposed web application is designed to be intelligent. In addition, the system analysis phase contains a detailed study of various operations performed internally or externally by running system. Activities of the system analysis phase follow iterative approaches where the deliverable is refined in incremental steps.Â In the system design phase, Entity-relationship (ER diagram) and normalization are used to design a database using MySQL. The XML format for operative data is designed using Document Type Declaration (DTD) and XML schema. The interchange model is designed using context diagram, dataflow diagram, system flowchart, and process specification. The proposed web application is developed using VB.Net Interface and VRML modeling 3dmax. Finally, the proposed approach files are transmitted in XML, PDF and HTML formats.
Design and Implementation of RSA Algorithm using FPGA
Authors: Tahir Ari Shawkat 
Published: May 2018

RSA cryptographic algorithm used to encrypt and decrypt the messages to send it over the secure transmission channel like internet.Â The RSA algorithm is a secure, high quality, public key algorithm. In this paper, a new architecture and modeling has been proposed for RSA public key algorithm, the suggested system uses 1024-bit RSA encryption/decryption for restricted system. The system uses the multiply and square algorithm to perform modular operation. The design has been described by VHDL and simulated by using Xilinx ISE 12.2 tool. The architectures have been implemented on reconfigurable platforms FPGAs. Accomplishment when implemented on Xilinx_Spartan3 (device XC3S50, package PG208, speed -4) which confirms that the proposed architectures have minimum hardware resource, where only 29% of the chip resources are used for RSA algorithm design with realizable operating clock frequency of 68.573 MHz.
A Matrix Iterative Approach to Systematically Generate Hilbert-type Space-filling Curves
Authors: Ye Ruisong , Liu Li 
Published: May 2018

Hilbert-type space-filling curve has attracted much interest thanks to its mathematical importance and extensiveÂ applications in signal processing. In this paper, we construct the complete six Hilbert-type space-filling curves form amatrix point of view. The address matrix for each considered Hilbert-type space-filling curve can be easily generated by aÂ recursive manner. Besides the six Hilbert-type space-filling curves, we also construct their corresponding variationÂ versions. The merit of the matrix approach is that the iterative algorithm is easy to implement and can be generalized toÂ produce any other Hilbert-type space-filling curves and their variation versions.
ENHANCED SECURITY MECHANISM IN CLOUD COMPUTING: A REVIEW
Authors: Kaur Gagandeep , Garg Dr. Mohita , Jyoti Mrs. Navjot 
Published: May 2018

Cloud is a term used as a metaphor for the wide area networks (like internet) or any such large networked environment. It came partly from the cloud-like symbol used to represent the complexities of the networks in the schematic diagrams. It represents all the complexities of the network which may include everything from cables, routers, servers, data centers and all such other devices. Cloud based systems saves data off multiple organizations on shared hardware systems. Data segregation is done by encrypting data of users, but encryption is not complete solution. We can do segregate data by creating virtual partitions of data for saving and allowing user to access data in his partition only. We will be implementing cloud security aspects for data mining by implementing cloud system. After implementing cloud infrastructure for data mining for cloud system we shall be evaluating security measure for data mining in cloud. We will be fixing threats in data mining to Personal/private data in cloud systems.Â Â
A Heuristic Algorithm that Finds the Minimum and the Maximum of the Outputs of a Fuzzy Socio-political Model of E-democracy
Authors: Turcoane Ovidiu 
Published: May 2018

Most of the techniques of nonlinear optimization assume the existence of a differential function, but there also exist other approaches. In this paper, we propose a non-differential algorithm that solves the problem of minimization and maximization for any objective function of several unknown variables. The algorithm searches for a solution vector of variables that yields the optimal result of the objective function, using a trial-and-error process. The algorithm is not fast, but it converges to a non-trivial solution, if it exists. The method will be used to determine the minimum and the maximum of the outputs of a socio-political model of E-Democracy. This model of E-Democracy is based on a Mamdani fuzzy inference system.Â We provide formalization and Matlab implementation for our fuzzy system and for the algorithm
Research on Application of Brand building of Chiang Ma Yuan Recreational Farm Area
Authors: Hsin-Ying Liu, , Chih-Yao Lo, , Cheng-I Hou, , Ta-Sheng Lee, 
Published: May 2018

In modern society, people face expedited information communication, fast-paced life, and high-pressure work. People are eager for the natural environment of relaxation. The government in Taiwan has paid special attention to the development of leisure agriculture. Events that incorporate farm landscape and agriculture have been held, and rural living has been promoted. Through public engagement and experience, it is expected that agriculture can be promoted into a leisure industry with unique recreational features, in order to bring in additional incomes for the farmers, drive the regional economic development, elevate the living standards of the farmers, promote employment, protect and develop rural culture, and realize ecological conservation.This paper explores the factors for brand building in leisure agricultural area, and treats Chiang Ma Yuan Recreational Farm Area in Dahu Township, Miaoli County, as the target. Literature review was first conducted to develop the semi-open questionnaire. Then modified Delphi method was adopted for expert interviews, in order to collect expert consensus, and identify the constructs and elements for the brands in hierarchal analysis.Â The results were used to analyze the constructs and elements of brand building in Chiang Ma Yuan Farm Area, and suggest its future development direction.Â
ENHANCED SECURITY MECHANISM IN CLOUD COMPUTING USING HYBRID ENCRYPTION ALGORITHM AND FRAGMENTATION: A REVIEW
Authors: Kaur Amandeep , Luthra Mr. Pawan 
Published: May 2018

Cloud is a term used as a metaphor for the wide area networks (like internet) or any such large networked environment. It came partly from the cloud-like symbol used to represent the complexities of the networks in the schematic diagrams. It represents all the complexities of the network which may include everything from cables, routers, servers, data centers and all such other devices. Cloud based systems saves data off multiple organizations on shared hardware systems. Data segregation is done by encrypting data of users, but encryption is not complete solution. We can do segregate data by creating virtual partitions of data for saving and allowing user to access data in his partition only. We will be implementing cloud security aspects for data mining by implementing cloud system. After implementing cloud infrastructure for data mining for cloud system we shall be evaluating security measure for data mining in cloud. We will be fixing threats in data mining to Personal/private data in cloud systems.Â Â
INTRODUCTION TO CLOUD COMPUTING
Authors: Madaan Pankaj , Singh Jagdeep , Kumar Mukesh , Kumar Sahil 
Published: May 2018

In todayâ€™s era every organization wants to implement Cloud Computing to fullfil their needs ofÂ computing.The Cloud computing is a fastest growing area in every sector like IT industry ,Government organizations etc . The Cloud computing emerges as a new computing paradigm which aims to provide computation, software, data access, and storage services that do not require end-user knowledge of the physical location and configuration of the system that delivers the services. The intent of this paper is to have a review on cloud computing, its working ,its use in various sectors,deployment models and services.
A REVIEW ON MULTIQUERY SYSTEM FOR CONTENT BASED IMAGE RETRIEVAL
Authors: Meenu Meenu , Jindal Sonika 
Published: May 2018

In recent years, very large collections of images and videos have grown rapidly. In parallel with this growth, content-based retrieval and querying the indexed collections are required to access visual information. Two of the main components of the visual information are texture and color. In this thesis, a content-based image retrieval system is presented that computes texture and color similarity among images. Content based image retrieval from large resources has become an area of wide interest now a days in many applications.Â To speed up retrieval and similarity computation, the database images are analysed and the extracted regions are clustered according to their feature vectors. This process is performed offline before query processing, therefore to answer a query our system does not need to search the entire database images; instead just a number of candidate images are required to be searched for image similarity.
ENHANCED CREDIT BASED LOAD BALANCING IN CLOUD ENVIRONMENT
Authors: Singh Jagdeep , Luthra Mr. Pawan 
Published: May 2018

Cloud computing is one of the latest and upcoming paradigm that offers huge benefits such as reduced time to market, unlimited computing power and flexible computing capabilities. It is a model that provides an on-demand network access to a shared pool of computing resources It comprises a large number of concepts primarily Load Balancing, Scheduling, etc. This paper discusses load balancing as a mechanism to distribute the workload evenly to all nodes in the system to achieve a higher resource utilization and user satisfaction. It helps in allocation and de-allocation of instances of applications withoutÂ Â failure. This paper reports a new load balancing technique using modified credit based system using task length, task priority and its cost. The proposed algorithm has been implemented in cloudsim toolkit and its comparison with existing algorithm has been discussed in the paper.
ENHANCED CBIR MECHANISM USING STEERABLE PYRAMID AND MEDIAN VECTOR ALGORITHM
Authors: Pooja Pooja , Jindal Sonika 
Published: May 2018

Recently, digital content has become a significant and inevitable asset of or any enterprise and the need for visual content management is on the rise as well. Content-based image retrieval has attracted voluminous research in the last decade paving way for development of numerous techniques and systems besides creating interest on fields that support these systems. CBIR indexes the images based on the features obtained from visual content so as to facilitate speedy retrieval. In this thesis work, we present a steerable pyramid based image retrieval system that uses color, contours and texture as visual features to describe the content of an image region. We have initially used steerable pyramid to extract texture features from query image and database images and store them in feature vectors. Second, to speed up retrieval and similarity computation, the database images are classified and the extracted regions are clustered according to their feature vectors using median vector algorithm. This process is performed before query matching takes place. Therefore to answer a query our system does not need to search the entire database images; instead just a number of candidate images are required to be searched for image similarity.Â Our proposed system has the advantage of increasing the retrieval accuracy and decreasing the retrieval time. The experimental evaluation of the system is based on a satellite and medical image database. From the experimental results, it is evident that our system performs significantly better and faster compared with other existing systems. In our analysis, we provide a comparison between retrieval results based on features extracted from the whole image using steerable pyramid with median vector and features extracted from same image without median vector. The results demonstrate that each type of feature is effective for a particular type of images according to its semantic contents, and using a combination of them giving better retrieval results for almost all different classes of images in the dataset.Â Â
Reversible data hiding based on histogram modification of difference images by s-type and Hilbert curve scanning
Authors: Chen Jin , Ye Ruisong 
Published: May 2018

Reversible data hiding technology has currently attracted great attention recently. Using reversible data hiding methods,Â original cover images can be recovered losslessly from the cover image embedded information. In this paper, spatialÂ reversible data hiding schemes based on histogram modification of difference images are discussed, in which the pixelÂ gray values of difference image are altered slightly to perform the embedding and extraction. Specifically, we design twoÂ reversible data hiding schemes based on S-type scanning and Hilbert curve scanning, and compare them with the reversibleÂ data hiding scheme by difference between adjacent columns of the cover image. Embedding capacity and PSNRÂ are calculated to figure out how block size, difference manner and embedding level influence the effect of hiding.
Performance Analysis of Amplify and Forward Cooperative Networks over Rayleigh and Nakagami-m Channels based Relaying Selection
Authors: Mohammed Ali Abdulwahhab , Yu Li , Yu Li , Al-Kali Manar , Al-Kali Manar , Wang Desheng , Wang Desheng 
Published: May 2018

In this paper investigates the performance, analysis of amplify and forward (AF) cooperative networks with the relay selection over Â Nakagami-m and Rayleigh fading channels and Â M-ary phase shift keying (MPSK) modulations. New closed form expressions are derived for the general cases of Rayleigh and Nakagami-m fading channels. cumulative density function (CDF), probability density function (PDF) of the end â€“to - end signal â€“to â€“ nois ratio (SNR) of a dual-hop opportunistic AF relaying system, moment generating function (MGF), symbol error rate (SER) and outage probability (Pout). and the firstÂ closed-form study for opportunistic AF relaying system where the best node is selected from a number of candidate intermediate nodes to relay the data signal between the source and the destination. Simulation results reveal that the PDF , CDF, Pout and SER performance downgrades either the m parameter or the number of relays increases. Our simulations compared between Rayleigh and Nakagami-m links for a different number of relays. In addition, different modulation techniques are examined to show the effect of the modulation scheme which was used over Rayleigh and Nakagami-m fading channels on the cooperative networks. The obtained results proved the impact of m parameters, relay selection and modulation index on the pout and SER performance.
The holes problem in wireless sensor netwoks by using the available energy fairly
Authors: Mousavinasab Zohreh , Saadati Zahra 
Published: May 2018

We consider the holes problem in wireless sensor netwoks by using the available energy fairly. The holes problem occurs when the available energy of some sensors are exhausted while others have significant energy. In this circumstance, ehile the total available energy of the network is high, the networkÂ is no longer working. Such a problem mainlyÂ happen due to unbalanced energy consumpsion in clustering and communication protocols. In this paper, we deal with this problem and propose an data aggregation algorithm based on the well-known clustering algorithm LEACH and tree construction mechanisms. In proposed method we consider the available energy of each sensor node as a weigthing parameter in clustering phase and tree-construction phase. Experimental results show the ability of the proposed method to increase the life time of the network and to distribute the energy uniformly along the network.
Impact of using Infinity-Norm with Initial Radius on Performance and Complexity of SD Algorithm in MIMO systems
Authors: Sulttan Mohammed 
Published: May 2018

Â In recent years, the iterative decoding techniques have played a role in improving the performance (e.g., bit error rate) and reducing the complexity of various digital communication systems. Techniques of Multiple-Input Multiple-Output (MIMO) are the main technology to enhance and achieve high-speed, high data rates, improved reliability and coverage in wireless communications. The modern wireless communications require a low complexity system for detection, since a high CPU processing involves more energy consumption and thus less flexibility in mobility terms. The sphere decoding (SD) technique proposed to solve this problem, such as an efficient algorithm. The norm-2 or l^2-norm (Euclidean metric) considered as a traditional norm that is used to achieve the tree traversal stage in SD algorithm. This work is divided into two parts; Firstly, we propose to using Infinity-Norm or l^âˆž-norm instead l^2-norm to decreases the hardware complexity of SD with a loss of performance is negligible, the simulation results show that the proposed l^âˆž-norm SD needs 14.5% to 5.9% fewer complexities than l^2-norm SD. Secondly, we are investigating the impact of choosing initial radius on the performance and complexity of SD algorithm, we can conclude from the simulation results, that gain a better performance requires increasing in the initial radius of an SD algorithm from d1 (Î³ =2) to d3 (Î³ =8), and this mean addition more complexity due to the tradeoff Â between performance and complexity.Â Â Â Â In recent years, the iterative decoding techniques have played a role in improving the performance (e.g., bit error rate) and reducing the complexity of various digital communication systems. Techniques of Multiple-Input Multiple-Output (MIMO) are the main technology to enhance and achieve high-speed, high data rates, improved reliability and coverage in wireless communications. The modern wireless communications require a low complexity system for detection, since a high CPU processing involves more energy consumption and thus less flexibility in mobility terms. The sphere decoding (SD) technique proposed to solve this problem, such as an efficient algorithm. The norm-2 or -norm (Euclidean metric) considered as a traditional norm that is used to achieve the tree traversal stage in SD algorithm. This work is divided into two parts; Firstly, we propose to using Infinity-Norm or -norm instead -norm to decreases the hardware complexity of SD with a loss of performance is negligible, the simulation results show that the proposed -norm SD needs 14.5% to 5.9% fewer complexities than -norm SD. Secondly, we are investigating the impact of choosing initial radius on the performance and complexity of SD algorithm, we can conclude from the simulation results, that gain a better performance require increasing in the initial radius of an SD algorithm from d1 (Â =2) to d3 (Â =8), and this mean addition more complexity due to the tradeoffÂ between performance and complexity.
Data Mining Algorithms: An Overview
Authors: Joseph Sethunya R , Hlomani Hlomani , Letsholo Keletso 
Published: May 2018

The research on data mining has successfully yielded numerous tools, algorithms, methods and approaches for handling large amounts of data for various purposeful use andÂ Â problem solving. Data mining has become an integral part of many application domains such as data ware housing, predictive analytics, business intelligence, bio-informatics and decision support systems. Prime objective of data mining is to effectively handle large scale data, extract actionable patterns, and gain insightful knowledge. Data mining is part and parcel of knowledge discovery in databases (KDD) process. Success and improved decision making normally depends on how quickly one can discover insights from data. These insights could be used to drive better actions which can be used in operational processes and even predict future behaviour. This paper presents an overview of various algorithms necessary for handling large data sets. These algorithms define various structures and methods implemented to handle big data. The review also discusses the general strengths and limitations of these algorithms. This paper can quickly guide or an eye opener to the data mining researchers on which algorithm(s) to select and apply in solving the problems they will be investigating.
Speech Activity Detection and its Evaluation in Speaker Diarization System
Authors: Kaur Sukhvinder , Sohal J. S. 
Published: May 2018

In speaker diarization, the speech/voice activity detection is performed to separate speech, non-speech and silent frames. Zero crossing rate and root mean square value of frames of audio clips has been used to select training data for silent, speech and nonspeech models. The trained models are used by two classifiers, Gaussian mixture model (GMM) and Artificial neural network (ANN), to classify the speech and non-speech frames of audio clip. The results of ANN and GMM classifier are compared by Receiver operating characteristics (ROC) curve and Detection ErrorTradeoff (DET) graph. It is concluded that neural network based SADcomparatively better than Gaussian mixture model based SAD.
Image Processing: Capturing Student Attendance Data
Authors: Kurniawan Hendra - , Agarina Melda , Irianto Suhendro Yusuf 
Published: May 2018

Role of the student attendance record is very important in the primary, secondary, and tertiary education. The purpose of this record is monitoring student activity in the teaching and learning process and regarded as one of the important learning assessments. Moreover, a data processing for recording the student attendance is currently done in various ways such as fingerprint, radio frequent identification (RFID), facial recognition system, android-based application, and others. However, many conventional ways (i.e., using paper-based system) are still used, especially in Indonesia. This is because several universities still rarely have enough funds for developing innovative systems. In this research, the image processing application for capturing student attendance data was built. The objective of this research was to provide an efficient alternative to monitor student activities in teaching and learning process. The image processing produced the information related to student attendance by scanning the attendance file through jpg/jpeg using learning vector quantization (LVG) as the process model.
OPPORTUNISTIC APPROACH TO EXPLOIT WIRELESS SPECTRUM BY USE OF COGNITIVE RADIO
Authors: Preet Tanu Preet Singh , Singh Prof. R.K , Kaur Jaspreet , Sharma Vishal 
Published: May 2018

Cognitive radio (CR) technology is envisaged to solve the problems in wireless networks resulting from the limited available spectrum and the inefficiency in the spectrum usage by exploiting the existing wireless spectrum opportunistically. In this paper, intrinsic properties and research on software defined cognitive radio (SDCR) are presented. Firstly brief introduction of Cognitive Radio is given along with its architecture.Â Then spectrum management of Cognitive Radio ad hoc networks (CRAHNs) and their main features like spectrum sensing, spectrum decision, spectrum selection and spectrum mobility are defined. At the end, Software Defined Cognitive Radio (SDCR), its hardware and software platform, along with research topics on SDCR are defined