Volume 18, Issue 6, November 2015
Submission: 10 October 2015
Notification: 15 October 2015
Revision: 20 October 2015
Publication: 01 November 2015
Submit Your Research Paper/Article to
along with Copyright Form
Global Impact Factor(2014): 0.715
Index Copernicus Value(2013): 6.68
InfoBase Index Value(2015): 3.51
The International Journal of Computational Engineering and Management (IJCEM) is an Open Access, Indexed, Peer Reviewed International Journal with a key objective to provide Academic, Industrial and Scientific Community a medium for presenting original cutting edge research related to Computational Science, Management, Engineering and Technology disciplines and their applications.
IJCEM invites authors to submit their original and unpublished work that communicates current research on Computational Sciences, Engineering, Management disciplines on Theoretical, Methodological and Practical Aspects, as well as their applications from real world problems like Science, Business, Commerce, Engineering and Technology.
Prospective authors should note that only original and previously unpublished manuscripts will be considered. Furthermore, simultaneous submissions are not acceptable.
Submission of a manuscript is interpreted as a statement of certification that no part of the manuscript is copyrighted by any other publication nor is under review by any other formal publication. It is the primary responsibility of the author to obtain proper permission for the use of any copyrighted materials in the manuscript, prior to the submission of the manuscript to International Journal of Computational Engineering and Management (IJCEM).
The International Journal of Computational Engineering and Management (IJCEM), the only English Language Journal in the Computational Science and Management fields published in India, is an international forum for academicians, researchers, engineers and scientists involved in all aspects of Computational Science, Management, Engineering and Technology to publish high quality, refereed papers.
The journal offers survey, experimental and review articles/research papers from experts in the field, promoting insight, state of the art understanding, and trends in Technology and Management. Contents include original research and innovative applications from all parts of the world. The papers for publication in IJCEM are selected through rigorous peer reviews to ensure originality, timeliness, relevance and readability. IJCEM presents mostly previously unpublished materials, selected conference papers with exceptional merit are also published, at the discretion of the editors.
With the outgrowth of cloud computing, a large amount of private information is stored over cloud servers, which is in encrypted format. But searching over encrypted data is very difficult. Earlier search schemes were based on Boolean search through keywords. But don’t consider relevance of files. After that ranked search comes into its role, which uses searchable symmetric encryption (SSE). To achieve more practical and efficient design method was further modified to “Order preserving symmetric encryption” (OPSE), which uses primitives and indexed metadata files used in ranked SSE. In this proposed work further enhancements are done to reduce storage space for encrypted metadata using Porter Stemming method. Improvements in retrieval time are also done by using Boyer Moore’s searching algorithm.
Download Full Text
Design of optimized symmetric key encryption algorithm for increasing security had been covered in this paper using International Data Encryption Algorithm (IDEA). The current era has seen an explosive growth in communication. Applications like online banking, personal digital assistants, mobile communication, smartcards, etc. have emphasized the need for security in resource constrained environment. International Data Encryption Algorithm (IDEA) cryptography serves as a perfect encryption tool because of its 128 bits key sizes and high security comparable to that of other algorithms. However, to match the ever increasing requirement for speed in today’s applications, hardware acceleration of the cryptographic algorithms is a necessity. This study presents an efficient hardware structure for the modulo (2n + 1) Multiplier and modulo(2n ) adder which is the most time and space consuming operation in IDEA. The proposed design saves more time, area and cost. The block size considered here is same as of traditional IDEA encryption algorithm which is of 64 bits with 16 bit sub-blocks.
Download Full Text
In the era of commercialization and industrialization, people work day and night to survive in the market. In the struggle of survival, they forget the real meaning of the life. They measure everything in terms of the money. They forget that “Sat”—“Chit”—“Ananda” is the real form of a human being. Human beings in their life pursuing in the search of a true happiness. They identify the man, money, and material as the real source of happiness. Throughout their life, they seek happiness from each of these sources. In fact, they fail to get the same. The present paper is an attempt to reveal the views of ancient Indian scripture on happiness. The paper uses the dialectic method to prove and disprove the various definitions of happiness. The definitions pointing to the material happiness; physical happiness; sensual happiness; intellectual happiness; psychological happiness; and spiritual happiness have been studied. The paper concludes the scope of various sources of happiness. The article ends with various auspicious (Aum Aano Bhadra) things explained in our ancient Indian scripture that can be the sources of happiness.
Download Full Text
06 issues per year
The journal welcomes publications of high quality papers on theoretical developments and practical applications in Computer Science, Engineering and Management. Original research papers, state-of-the-art reviews and high quality technical notes are invited for publications.
Paper registration is now open for papers that will be published in Volume 18 Issue 6, November 2015.
We have 9 guests and no members online