Volume-06 , Special Issue-02 , Mar - 2018 Go Back

Event-based mobile social networks (MSNs) are a special type of MSN that has an immanently temporal common feature, which allows any smart phone user to create events to share group messaging, locations, photos, and insights among participants. The emergence of Internet of Things and event-based social applications integrated with context-awareness ability can be helpful in planning and organizing social events like meetings, conferences, and tradeshows. This paper _rst provides review of the event-based social networks and the basic principles and architecture of event-based MSNs. Next, event-based MSNs with Smartphone contained technology elements, such as context-aware mobility and multimedia sharing, are presented. By combining the feature of context-aware mobility with multimedia sharing in event-based MSNs, event organizers, and planners with the service providers optimize their capability to recognize value for the multimedia services they deliver. The unique features of the current event-based MSNs give rise to the major technology trends to watch for designing applications. These mobile applications and their main features are described. At the end, discussions on the evaluation of the event-based mobile applications based on their main features are presented. Some open research issues and challenges in this important area of research are also outlined.

Mobile application, mobile social networks, mobile event guide, context-awareness, mobility, multimedia

[1] Chun, S. G., Chung, D. and Shin, Y. B (2013) Are students satisfied with the use of smartphone apps? 24.
[2] Ford, C. M. (2012) Smartphone Apps on the Mobile Web: An Exploratory Case Study of Business Models. 14-17
[3] Hee-Woong Kim, Yonsei University, Korea,kimhw@yonsei.ac.kr, Hyun Lyung Lee, LG Electronics, Korea, hyunlyung@lge.com, Jung Eun Son, Yonsei University, Korea, jeson@yonsei.ac.kr (2011), An Exploratory Study On The Determinants Of Smartphone App Purchase
[4] Hwang S. J (2012) Investigation toward smartphone users‟ need before develop mobile application program, 5-6.
[5] Jyoti, C., Sutee, P. and Efpraxia, Z. (2014). Investigating the adoption and use of smartphones in the uk: A silver-surfers perspective. 2.
[6] Karrigan, K. (2011). Saving time and money with mobile apps: A small business “App ”opportunity. 3.
[7] Kirk, G. A (2011) There‟s an app for that, but is there a market for that app? An exploration of the app market as an avenue for entrepreneurship. 1-4.
[8] Martijn Terpstra July 2, 2013 WhatsApp & privacy
[9] Richardson, K. (2008) Benefits of Smart Phones. 2-5
[10] Yee, K. L. L., Siew, H. K., Fah, B.C. Y (2013) Factors affecting smartphone purchase decision among malaysian generation Y. 3 - 6.
[11] http://www.techterms.com/definiti on/smartphone-Date taken

T. Chithambaram, S.Raja, "A Novel Based Android Smartphone Social communication Application Developments", International Journal of Computer Sciences and Engineering, Vol.06, Issue.02, pp.347-353, 2018.

Opportunistic mobile phone networks consist of cell phone devices which are occasionally linked via restricted radios. Forward in such networks relies on select relay to bring and convey records to destinations leading opportunistic links. Due to the alternating network connectivity, relays in present forwarding schemes are chosen separately in a circulated manner. The contact capabilities of relays therefore may overlap when they contact the same nodes and cause forwarding redundancy. These redundancies reduce the effectiveness of source utilization in the network, and may impair the forwarding performance if being unconsciously ignored. This observation is confirmed using eight distinct experimental data sets. It is at chances by the exponential decay indirect by the most commonly used mobility models. In this paper, we study how this recently discovered characteristic of human mobility impacts one class of forwarding algorithms earlier proposed. We use a make simpler model found on the renewal theory to study how the parameters of the distribution impact the show in terms of the release delay of these algorithms. We make recommendations for the design of well-founded opportunistic forward algorithms in the situation of human carry devices.

Computer systems organization, communication/networking and information technology, mobile computing, algorithm/ protocol design and analysis, mobile environments, mathematics of computing, probability and statistics

[1] M. Bakht, M. Trower, and R. H. Kravets. Searchlight: Won’t you be my neighbor? In Proceedings of the 18th annual international conference on Mobile Computing and Networking (MobiCom), pages 185–196. ACM, 2012.
[2] A. Balasubramanian, B. Levine, and A. Venkataramani. DTN Routing As a Resource Allocation Problem. In Proceedings of SIGCOMM, 2007.
[3] A. Balasubramanian, R. Mahajan, A. Venkataramani, B. Levine, and J. Zahorjan. Interactive wifi connectivity for moving vehicles. In Proceedings of ACM SIGCOMM, pages 427–438, 2008.
[4] G. Box, G. M. Jenkins, and G. C. Reinsel. Time Series Analysis: Forecasting and Control. Prentice-Hall, 3rd edition, 1994.
[5] J. Burgess, B. Gallagher, D. Jensen, and B. Levine. Maxprop: Routing for vehicle-based disruption-tolerant networks. Proc. INFOCOM, 2006. [6] H. Cai and D. Y. Eun. Crossing over the bounded domain: from exponential to power-law inter-meeting time in manet. Proc. MobiCom, pages 159–170, 2007.
[7] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of Human Mobility on Opportunistic Forwarding Algorithms. IEEE Trans. on Mobile Computing, 6(6):606–620, 2007.

T.Ganesh Kannan, Kasthuri, T.Dineshkumar , "A Reliable Communication and Rate Control for Mobile Network through Efficient Routing Protocol", International Journal of Computer Sciences and Engineering, Vol.06, Issue.02, pp.354-357, 2018.

Detection of brain tumor is very common fatality in current scenario of health care society. Image segmentation is used to extract the abnormal tumor portion in brain. Brain tumor is an abnormal mass of tissue in which cells grow and multiply uncontrollably, apparently unregulated by mechanisms that control cells. Segmentation of brain tissue in the magnetic resonance image (MRI) is very important for detecting and existence of outlines the brain tumor. In this research an algorithm for segmentation based on the symmetry character of brain image is presented. Our goal is to detect the position and edge of tumors automatically. Experiments were carried on real pictures, and the results show that the algorithm is flexible and convenient. This proposed method is more efficient and faster to identify the detecting the tumor region from T1, T2-weighted MRI brain images. The proposed Neural Network technique consists of some stages, namely, feature extraction, dimensionality reduction, detection, segmentation and classification. In this paper, the purposed method is more accurate and effective for the brain tumor detection and segmentation. Various techniques have been formulated for detection of tumor in brain. Our main concentration is on the techniques which use image segmentation to detect brain tumor. Tumor classification and segmentation from brain computed tomography image data is an important but time consuming task performed by medical experts. For the implementation of this proposed work we use the Image Processing Toolbox under Matlab Tool.

Brain Tumor, GA, And Image Segmentation.

[1] Anithadevi D, Perumal K. Brain tumor extraction based on segmentation. IJRITCC. 2014; 2(9):2682–9.
[2] Anithadevi D, Perumal K. Generic evaluation of automat¬ic segmentation with seed selection. National Conference
Contemporary Developments in Information and Commu¬nication Technologies; Madurai. 2014. p. 14 24.
[3] Anithadevi D, Perumal K. Novel approach for noise remov¬al of brain tumor MRI images. JBEMi. 2015; 2(3):1–14.
[5] Chang-Tsun Li and Randy Chiao (2003), ‘Multiresolution genetic clustering algorithm for texture segmentation’, Image and
Vision Computing, Vol. 21, pp. 955 - 966.
[6]. Kim E.Y., Park S.H. and Kim H.J. (2000), ‘A genetic algorithm-based segmentation of Markov random field modeled
images’, Signal Processing Letters, IEEE, Digital Object Identifier10.1109/ 97.873564. Vol. 7, No. 11, pp. 301- 315.
[7]. Minglun Gong and Yee-Hong Yang (2001), ‘Genetic-based multiresolution color image segmentation’, Vision Interface, pp. 141–148.
[8]. Nordin P. and Banzhaf W. (1996), ‘Programmatic compression of images and sound’, In Genetic Programming 1996,Proceedings of the First
Annual Conference, Koza J. R. Editors, MIT Press, pp. 345-350.
[9] Ou Y., Cheng W. and Han Ferng-ching (2004), ‘Based on genetic algorithm fuzzy c- means clustering algorithm’, Journal of Chongqing
University, Vol. 27 No. 6, pp. 89 - 926 . Philippe Andrey (1999), ‘Genetic algorithms applied to image segmentation’ Image and Vision Computing, Vol. 17, pp.175- 187.
[10] M. S. Yang, Y. J. Hu, Karen, C. R. Lin and C. C. Lin, ―Segmentation techniques for tissue differentiation in MRI of Ophthalmology using fuzzy clustering algorithms,‖ Magnetic Resonance Imaging, vol. 20, issue 2, pp. 173-179, 2002.
[11] G. C. Karmakar and L. S. Dooley, ―A generic fuzzy rule based image segmentation algorithm,‖ Pattern Recognition Letters, vol. 23, issue 10, pp. 1215-1227, 2002.
[12] D. L. Pham and J. L. Prince, ―An adaptive fuzzy C-means algorithm for image segmentation in the presence of intensity inhomogeneities,‖ Pattern Recognition Letters, vol. 20, issue 1, pp. 57–68, 1999.
[13] Y. A. Tolias and S. M. Panas, ―On applying spatial constraints in fuzzy image clustering using a fuzzy rule-based system,‖ IEEE Signal Processing Letters, vol. 5, issue 10, pp. 245–247, 1998.
[14] Y. A. Tolias and S. M. Panas, ―Image segmentation by a fuzzy clustering algorithm using adaptive spatially constrained membership functions,‖ IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, vol. 28, issue 3, pp. 359–369, 1998.
[15] A. W. C. Liew, S. H. Leung, and W. H. Lau, ―Fuzzy image clustering incorporating spatial continuity,‖ IEE Proceedings - Vision, Image and Signal Processing, vol. 147, issue 2, pp. 185–192, 2000.
[16] D. L. Pham, ―Fuzzy clustering with spatial constraints,‖ in IEEE Proceedings International Conference on Image Processing, New York, II-65–II-68, 2002.
[17] M. N. Ahmed, S. M. Yamany, N. Mohamed, A. A. Farag, T. Moriarty, ―A modified fuzzy C-means algorithm for bias field estimation and segmentation of MRI data,‖ IEEE Transactions on Medical Imaging, vol. 21, issue 3, pp. 193–199, 2002.
[18] S. C. Chen and D. Q. Zhang, ―Robust image segmentation using FCM with spatial constraints based on new kernel-induced distance measure,‖ IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 34, issue 4, pp. 1907-1916, 2004.
[19] L. Szilágyi, Z. Benyó, S. M. Szilágyii, H. S. Adam, and M. R. Brain ―Image segmentation using an enhanced fuzzy C-means algorithm,‖ in 25th Annual International Conference of IEEE EMBS, pp. 17-21, 2003.
[20] M. N. Ahmed, S. M. Yamany, N. A. Mohamed, A. A. Farag, and T. Moriarty, ―Bias field estimation and adaptive segmentation of MRI data using modified fuzzy C-means algorithm,‖ IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 250–255, 1999.

S. Josephine, "Brain Tumor MRI Image Detection and Segmentation Using Genetic Algorithm", International Journal of Computer Sciences and Engineering, Vol.06, Issue.02, pp.358-364, 2018.

The explosion of varied Linked information on the Web poses new challenges to file systems. In exacting, the ability to store, track, and query origin data is flattering a essential characteristic of modern triple stores. Here, present methods extending a inhabitant RDF accumulate to professionally handle the storage, tracking, and querying of provenance in RDF data. Here, explain a dependable and comprehensible requirement of the way consequences was resultant from the information and how particular pieces of data were combined to answer a query. Subsequently, there techniques to mold queries with attribution data. To empirically judge the accessible methods and reveal that the transparency of storing and track attribution is suitable. Finally, show that dressmaking a query with origin information can also considerably get better the presentation of inquiry execution.

Storage

[1] T. Heath and C. Bizer, Linked Data: Evolving the Web into a Global Data Space, ser. Synthesis Lectures on the Semantic Web. Morgan & Claypool Publishers, 2011.
[2] C. A. Knoblock, P. Szekely, J. L. Ambite, S. Gupta, A. Goel, M. Muslea, K. Lerman, M. Taheriyan, and P. Mallick, “Semi-automatically mapping structured sources into the semantic web,” in Proceedings of the Extended Semantic Web Conference, Crete, Greece, 2012.
[3] A. Schultz, A. Matteini, R. Isele, C. Bizer, and C. Becker, “Ldif - linked data integration framework,” in COLD, 2011.
[4] P. Groth and L. Moreau (eds.), “PROV-Overview. An Overview of the PROV Family of Documents,” World Wide Web Consortium, W3C Working Group Note NOTE-prov-overview-20130430, Apr. 2013.
[5] J. J. Carroll, C. Bizer, P. Hayes, and P. Stickler, “Named graphs, provenance and trust,” in Proceedings of the 14th International Conference on World Wide Web, ser. WWW ’05. New York, NY, USA: ACM, 2005, pp. 613–622.
[6] D. W. R. Cyganiak and M. L. (Ed.), “RDF 1.1 Concepts and Abstract Syntax,” W3C Recommendation, February 2014, http://www.w3.org/TR/rdf11-concepts/.
[7] M. Schmachtenberg, C. Bizer, and H. Paulheim, “Adoption of the linked data best practices in di_erent topical domains,” in The Semantic Web, ISWC 2014, ser. Lecture Notes in Computer Science, P. Mika, T. Tudorache, A. Bernstein, C. Welty, C. Knoblock, D. Vrandei, P. Groth, N. Noy, K. Janowicz, and C. Goble, Eds. Springer International Publishing, 2014, vol. 8796, pp. 245–260. [Online]. Available: http://dx.doi.org/10.1007/978-3-319-11964-9 16
[8] G. Grimnes. (2012) BTC2012 Stats. [Online]. Available: http: //gromgull.net/blog/2012/07/some-basic-btc2012-stats/
[9] P. Groth and W. Beek. (2016) Measuring PROV Provenance on the Web of Data. [Online]. Available: https://nbviewer.jupyter.org/github/pgroth/prov-wod-analysis/ blob/master/MeasuringPROVProvenanceWebofData.ipynb
[10] M. Wylot, J. Pont, M. Wisniewski, and P. Cudr´e-Mauroux, “dipLODocus[RDF]: short and long-tail RDF analytics for massive webs of data,” in Proceedings of the 10th international conference on The semantic web - Volume Part I, ser. ISWC’11. Berlin, Heidelberg: Springer-Verlag, 2011, pp. 778–793. [Online]. Available: http: //dl.acm.org/citation.cfm?id=2063016.2063066
[11] M. Wylot and P. Cudr´e-Mauroux, “DiploCloud: E_cient and Scalable Management of RDF Data in the Cloud,” IEEE Transactions on Knowledge and Data Engineering, vol. 28, no. 3, pp. 659–674, March 2016.
[12] M. Wylot, P. Cudre-Mauroux, and P. Groth, “TripleProv: E_cient Processing of Lineage Queries in a Native RDF Store,” in Proceedings of the 23rd International Conference on World Wide Web, ser. WWW ’14. Republic and Canton of Geneva, Switzerland: International World Wide Web Conferences Steering Committee, 2014, pp. 455–466.
[13] M. Wylot, P. Cudr´e-Mauroux, and P. Groth, “Executing Provenance-Enabled Queries over Web Data,” in Proceedings of the 24rd International Conference on World Wide Web, ser. WWW ’15. Republic and Canton of Geneva, Switzerland: International World Wide Web Conferences Steering Committee, 2015.
[14] “A demonstration of TripleProv: tracking and querying provenance over web data,” vol. 8, no. 12. VLDB Endowment, 2015, pp. 1992–1995.
[15] L. Moreau, “The foundations for provenance on the web,” Foundations and Trends in Web Science, vol. 2, no. 2–3, pp. 99–241, Nov. 2010. [Online]. Available: http://eprints.ecs.soton.ac.uk/21691/

M. Kalaivani, J.Jayanthi, S.Hareesh, "Efficient Storage and Accessing Through Query Process", International Journal of Computer Sciences and Engineering, Vol.06, Issue.02, pp.365-367, 2018.

When the workload of a service increases quickly, obtainable approaches cannot respond to the growing performance necessity. To efficiently because of either inaccuracy of adaptation decisions or the slow process of adjustments, both of which may result insufficient resource provisioning. The main concept of this paper is ability to add or remove the cloud resource provisioning. To improve the Quality of Service in the resource management, Resource management policies and objective separately in each jobs. Large scale problems are handled In online scheduling the decisions regarding how to schedule tasks are done during the runtime of the system. The scheduling decisions are based on the tasks priorities which are either assigned dynamically or statically. Static priority driven algorithms assign fixed priorities to the tasks before the start of the system. Dynamic priority driven algorithms assign the priorities to tasks during runtime. An online algorithm is forced to make decisions that may later turn out not to be optimal, and the study of online algorithms has focused on the quality of decision-making that is possible in this setting. Online resource placement develops systems to predict the dynamic resource demand of resources and guide the placement process considers minimizing the long-term routing cost between resources.

Data mining, frequent sequence mining, parallel algorithms, static load-balancing, probabilistic algorithms

[1] Description of the round robin tournament on Wikipedia. http://en.wikipedia.org/wiki/Round_robin_tournament.
[2] R. Agrawal and J. C. Shafer. Parallel mining of association rules. IEEE Transactions On Knowledge And Data Engineering, 8(6):962–969, 1996.
[3] R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of 20th International Conference on Very Large Data Bases, pages 487–499. Morgan Kaufmann, 1994.
[4] R. Agrawal and R. Srikant. Mining sequential patterns. In Data Engineering, 1995. Proceedings of the Eleventh International Conference on, pages 3–14. IEEE, 1995.
[5] V. Chv´atal. The tail of the hypergeometric distribution. Discrete Mathematics, 25(3):285 – 287, 1979.
[6] S. Cong, J. Han, J. Hoeflinger, and D. Padua. A samplingbased framework for parallel data mining. In Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 255–265. ACM, 2005.
[7] R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2):416–429, 1969.
[8] D. Gunopulos, R. Khardon, and R. S. Sharma. Discovering all most specific sentences. ACM Transactions on Database Systems, 28:140–174, 2003.
[9] D. Gunopulos, H. Mannila, and S. Saluja. Discovering all most specific sentences by randomized algorithms. In ICDT, pages 215–229, 1997.
[10] V. Guralnik, N. Garg, and G. Karypis. Parallel tree projection algorithm for sequence mining. Euro-Par 2001 Parallel Processing, pages 310–320, 2001.
[11] V. Guralnik and G. Karypis. Dynamic load balancing algorithms for sequence mining. Univeristy of Minnesota Technical Report TR 00, 56, 2001.
[12] J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu. Freespan: frequent pattern-projected sequential pattern mining. In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 355– 359. ACM, 2000.
[13] R. Kessl. Static load balancing of parallel mining of frequent itemsets using reservoir sampling. In LNCS 6871, Machine Learning and Data Mining in Pattern Recognition - 7th International Conference, pages 553–567. Springer, 2011.
[14] R. Kessl and P. Tvrd´ık. Probabilistic load balancing method for parallel mining of all frequent itemsets. In PDCS ’06: Proceedings of the 18th IASTED International Conference on Parallel and Distributed Computing and Systems, pages 578–586, Anaheim, CA, USA, 2006. ACTA Press.
[15] R. Kessl and P. Tvrd´ık. Toward more parallel frequent itemset mining algorithms. In PDCS ’07: Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems, pages 97–103, Anaheim, CA, USA, 2007. ACTA Press.

L.Malarvizhi, R.Umadevi,V.Upendran, "A Reliable Workload Distribution in Frequent Sequence Using Load Balancing Algorithm", International Journal of Computer Sciences and Engineering, Vol.06, Issue.02, pp.368-371, 2018.

Cloud computing has become the defacto standard for communication for multiple applications in real world. This is becoming essential as mobile networks use clouds for application and data access but the problem remains for efficient resource utilization and energy use. The proposed model is JRP – Joint Resource Provisioning, which dynamically estimates jobs and switches on only the servers required and complete the jobs thereby saving the energy costs in a significant manner.

Resource Provisioning, Energy Savings , Cloud Computing, Allocation, Resource Pooling

[1] A. Checko, H. L. Christiansen, Y. Yan, L. Scolari, G. Kardaras, M. S.Berger, and L. Dittmann, “Cloud RAN for mobile networks – a technology overview,” IEEE Commun. Surveys Tut., vol. 17, no. 1, pp. 405–426, First Quarter 2015.
[2] M. Peng, Y. Sun, X. Li, Z. Mao, and C. Wang, “Recent advances in cloud radio access networks: System architectures, key techniques, and open issues,” IEEE Commun. Surveys Tut., vol. 18, no. 3, pp. 2282–2308, Third Quarter 2016.
[3] P. Rost, C. J. Bernardos, A. D. Domenico, M. D. Girolamo, M. Lalam, A. Maeder, D. Sabella, and D. WÃijbben, “Cloud technologies for flexible 5G radio access networks,” IEEE Commun. Mag., vol. 52, no. 5, pp. 68–76, May 2014.
[4] N. Saxena, A. Roy, and H. Kim, “Traffic-aware cloud RAN: A key for green 5G networks,” IEEE J. Sel. Areas Commun., vol. 34, no. 4, pp. 1010–1021, Apr. 2016.
[5] T. Werthmann, H. Grob-Lipski, and M. Proebster, “Multiplexing gains achieved in pools of baseband computation units in 4G cellular networks,” in Proc. IEEE PIMRC ’13, Sep. 2013, pp. 3328–3333.
[6] D. Wubben, P. Rost, J. S. Bartelt, M. Lalam, V. Savin, M. Gorgoglione, A. Dekorsy, and G. Fettweis, “Benefits and impact of cloud computing on 5G signal processing: Flexible centralization through cloud-RAN,” IEEE Signal Process. Mag., vol. 31, no. 6, pp. 35–44, Nov. 2014.
[7] D. Pompili, A. Hajisami, and H. Viswanathan, “Dynamic provisioning and allocation in cloud radio access networks (C-RANs),” Ad Hoc Netw., vol. 30, pp. 128–143, 2015.
[8] Y. Shi, J. Zhang, and K. B. Letaief, “Group sparse beamforming for green Cloud-RAN,” IEEE Trans. Wireless Commun., vol. 13, no. 5, pp. 2809–2823, May 2014.
[9] Y. Shi, J. Zhang, K. B. Letaief, B. Bai, and W. Chen, “Large-scale convex optimization for ultra-dense Cloud-RAN,” IEEE Wireless Commun., vol. 22, no. 3, pp. 84–91, Jun. 2015.
[10] M. Qian, W. Hardjawana, J. Shi, and B. Vucetic, “Baseband processing units virtualization for cloud radio access networks,” IEEE Wireless Commun. Lett., vol. 4, no. 2, pp. 189–192, April 2015.
[11] X. Wang, S. Thota, M. Tornatore, H. S. Chung, H. H. Lee, S. Park, and B. Mukherjee, “Energy-efficient virtual base station formation in optical-access-enabled Cloud-RAN,” IEEE J. Sel. Areas Commun., vol. 34, no. 5, pp. 1130–1139, May 2016.
[12] J. Tang, W. P. Tay, and T. Q. S. Quek, “Cross-layer resource allocation with elastic service scaling in cloud radio access network,” IEEE Trans. Wireless Commun., vol. 14, no. 9, pp. 5068–5081, Sep. 2015.
[13] Y. Lin, L. Shao, Z. Zhu, Q. Wang, and R. K. Sabhikhi, “Wireless network cloud: Architecture and system requirements,” IBM J. Res. Develop., vol. 54, no. 1, pp. 4:1–4:12, Jan. 2010.
[14] China Mobile, “C-RAN: the road towards green RAN,” White Paper, Dec. 2011.
[15] S. Bhaumik, S. P. Chandrabose, M. K. Jataprolu, G. Kumar, A. Muralidhar, P. Polakos, V. Srinivasan, and T. Woo, “CloudIQ: A framework for processing base stations in a data center,” in Proc. ACM MobiCom ’12. New York, NY, USA: ACM, 2012, pp. 125–136.
[16] K. Sundaresan, M. Y. Arslan, S. Singh, S. Rangarajan, and S. V. Krishnamurthy, “FluidNet: A flexible cloud-based radio access network for small cells,” IEEE/ACM Trans. Netw., vol. 24, no. 2, pp. 915–928, Apr. 2016.
[17] D. Pompili, A. Hajisami, and T. X. Tran, “Elastic resource utilization framework for high capacity and energy efficiency in cloud RAN,” IEEE Commun. Mag., vol. 54, no. 1, pp. 26–32, Jan. 2016.
[18] M. Peng, K. Zhang, J. Jiang, J. Wang, and W. Wang, “Energyefficient resource assignment and power allocation in heterogeneous cloud radio access networks,” IEEE Trans. Veh. Technol.,
vol. 64, no. 11, pp. 5275–5287, Nov. 2015.
[19] K. Guo, M. Sheng, J. Tang, T. Q. Quek, X. Wang, and Z. Qiu, “Cooperative transmission meets computation provisioning in downlink C-RAN,” in Proc. IEEE ICC ’16, 2016.
[20] N. Yu, Z. Song, H. Du, H. Huang, and X. Jia, “Multi-resource allocation in cloud radio access networks,” in Proc. IEEE ICC’17, 2017

S.Mekala, J.Jayanthi, K.Shankar, "A Novel Dynamic and Effective Resource Allocation in Cloud for Energy Efficiency and Computing", International Journal of Computer Sciences and Engineering, Vol.06, Issue.02, pp.372-374, 2018.

Autism Spectrum Disorders (ASD) refers to a composite group of related disorders marked by impaired communication and socialization and by a limited (and often uncommon) range of interests. Although sometimes not identified until school age, Autism Spectrum Disorders develop early in life and are life-long conditions with implications for education, social development, and communal adjustment. Autism developed an eligibility category for special education services. Since that time an enormous amount of investigation has been conducted about identification and operative interventions for children with Autism Spectrum Disorders. The good news is that information learned over the years has resulted in a wider definition of autism and many strategies for parents and instructors to use in supporting the development of these children, starting in early childhood. However, distinguishing misinformation from accurate information can be anintimidating task. It is critical that parents and educators understand this multifaceted disorder. Teachers and parents working together will help children achieve optimistic outcomes.

Early intervention, Learning Language, Education, Disability of children, Child Autism

[1] Bilmes, J. 2008. Beyond behavior management. St. Paul, MN: Redleaf. CCSSO (Council of Chief State School Officers), Early Childhood Education Assessment Consortium. 2008. Glossary. Washington.
[2] Hannaford, C. 1995. Smart moves: Why learning is not all in your head. Arlington, Va: Great Ocean Publishers.
[3] Jensen, E. 2001. Fragile brains—Damage to the brain and environmental influences can account for certain learning problems. Educational Leadership 59 (3): 32.
[4] Jensen, E. 2005. Teaching with the brain in mind. 2nd ed. Alexandria, VA: Association for Supervision and Curriculum Development.
[5] NAEYC & NAECS/SDE (National Association of Early Childhood Specialists in State Departments of Education). 2002. Early learning standards: Creating the conditions for success. Joint position statement. www.naeyc.org/about/positions/pdf/position_statement.pdf.
[6] National Institute for Early Education Research (NIEER). 2008. State standards database. http://nieer.org/standards/statelist.phpSchiller, P. 1999. Start smart: Building brain power in the early years. Beltsville, MD. GryphonHouse.
[7] Schiller, P., & C. Willis. 2008. Inclusive literacy lessons for early childhood. Beltsville, MD: Gryphon House.
[8] Shonkoff, J.P., & D.A. Phillips, eds. 2000. From neurons to neighborhoods: The science of early childhood development. Report of the National Research Council and Institute of Medicine.
[9] Washington, DC: National Academies Press. Sousa, D. 2006. How the brain learns. 3rd ed. Thousand Oaks, CA: Corwin.
[10] Willis, C. In press. Creating inclusive learning environments for young children. Thousand Oaks,CA: Corwin Press.

Mary perpetual succor, S. Padmapriya, "Communicative Involvement for Young Children with Autism to Develop Communication and Socialization", International Journal of Computer Sciences and Engineering, Vol.06, Issue.02, pp.375-379, 2018.

Broadcasting the encrypted data via cloud storage may greatly ease security concerns.. Security is provided to access data in wireless broadcast services. Symmetric-key-based encryption is used to ensure the authorized users who own the valid keys can decrypt the data. With regard to various subscription activities, an efficient key management for distributing and changing keys is in great demand for the access control in broadcast services. Hence the proposed system namely, key tree reuse (KTR) to handle key distribution with regard to complex subscription options and user activities. It contributes all subscription activities in wireless broadcast services. Instead of separate sets of keys for each program, a user only needs to hold one set of keys for all subscribed programs. KTR identifies the minimum set of keys that must be altered to ensure broadcast security and minimize the rekey cost.

Searchable encryption, data sharing, data privacy

[1] S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Computing”, Proc. IEEE INFOCOM, pp. 534-542, 2010.
[2] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance: The Essential of Bread and Butter of Data Forensics in Cloud Computing”, Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010.
[3] X. Liu, Y. Zhang, B. Wang, and J. Yan. “Mona: secure multiowner data sharing for dynamic groups in the cloud”, IEEE Transactions on Parallel and Distributed Systems, 2013, 24(6): 1182- 1191.
[4] C. Chu, S. Chow,W. Tzeng, et al. “Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage”, IEEE Transactions on Parallel and Distributed Systems, 2014, 25(2): 468-477.
[5] X. Song, D.Wagner, A. Perrig. “Practical techniques for searches on encrypted data”, IEEE Symposium on Security and Privacy, IEEE Press, pp. 44C55, 2000.
[6] R. Curtmola, J. Garay, S. Kamara, R. Ostrovsky. “Searchable symmetric encryption: improved definitions and efficient constructions”, In: Proceedings of the 13th ACM conference on Computer and Communications Security, ACM Press, pp. 79-88, 2006.
[7] P. Van,S. Sedghi, JM. Doumen. “Computationally efficient searchable symmetric encryption”, Secure Data Management, pp. 87-100, 2010.
[8] S. Kamara, C. Papamanthou, T. Roeder. “Dynamic searchable symmetric encryption”, Proceedings of the 2012 ACM conference on Computer and communications security (CCS), ACM, pp. 965- 976, 2012.
[9] D. Boneh, C. G, R. Ostrovsky, G. Persiano. “Public Key Encryption with Keyword Search”, EUROCRYPT 2004, pp. 506C522, 2004.
[10] Y. Hwang, P. Lee. “Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System”, In: Pairing-Based Cryptography C Pairing 2007, LNCS, pp. 2-22, 2007.

Paramasivam, L.Jayasimman, R.Saradha, "An Efficient Cloud Storage Based On Key Aggregate Searchable Encryption for Group Data Sharing", International Journal of Computer Sciences and Engineering, Vol.06, Issue.02, pp.380-384, 2018.

Attribute-based encryption has been widely second-hand in cloud computing where a data provider outsources his/her encrypted data to a blur service provider, and can split the data with users possessing specific qualifications. However, the standard ABE scheme does not support protected deduplication, which is crucial for eliminating duplicate copies of the same data in arrange to save cargo space space and system bandwidth. Here, present an attribute-based storage system with protected deduplication in a hybrid cloud setting, where a confidential cloud is in charge for duplicate uncovering and a public blur manages the storage. Compared with the prior data deduplication systems, our scheme has two advantages. Firstly, it can be second-hand to in secret share data by means of users by specifying admission policies rather than distribution decryption keys. Secondly, it achieves the standard view of semantic refuge for data discretion while existing systems only attain it by defining a weaker refuge notion. In addition, put forth a method to modify a ciphertext over one admission policy into ciphertexts of the same plaintext but beneath other right of entry policies without enlightening the underlying plaintext.

Cloud Computing, ABE, Architecture

[1] D. Quick, B. Martini, and K. R. Choo, Cloud Storage Forensics. Syngress Publishing / Elsevier, 2014. [Online]. Available: http://www.elsevier.com/books/cloud-storageforensics/ quick/978-0-12-419970-5
[2] K. R. Choo, J. Domingo-Ferrer, and L. Zhang, “Cloud cryptography: Theory, practice and future research directions,” Future Generation Comp. Syst., vol. 62, pp. 51–53, 2016.
[3] K. R. Choo, M. Herman, M. Iorga, and B. Martini, “Cloud forensics: State-of-the-art and future directions,” Digital Investigation, vol. 18, pp. 77–78, 2016.
[4] Y. Yang, H. Zhu, H. Lu, J.Weng, Y. Zhang, and K. R. Choo, “Cloud based data sharing with fine-grained proxy re-encryption,” Pervasive and Mobile Computing, vol. 28, pp. 122–134, 2016.
[5] D. Quick and K. R. Choo, “Google drive: Forensic analysis of data remnants,” J. Network and Computer Applications, vol. 40, pp. 179– 193, 2014.
[6] A. Sahai and B. Waters, “Fuzzy identity-based encryption,” in Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings, ser. Lecture Notes in Computer Science, vol. 3494. Springer, 2005, pp. 457–473.
[7] B. Zhu, K. Li, and R. H. Patterson, “Avoiding the disk bottleneck in the data domain deduplication file system,” in 6th USENIX Conference on File and Storage Technologies, FAST 2008, February 26- 29, 2008, San Jose, CA, USA. USENIX, 2008, pp. 269–282.
[8] M. Bellare, S. Keelveedhi, and T. Ristenpart, “Message-locked encryption and secure deduplication,” in Advances in Cryptology - EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings, ser. Lecture Notes in Computer Science, vol. 7881. Springer, 2013, pp. 296–312.
[9] M. Abadi, D. Boneh, I. Mironov, A. Raghunathan, and G. Segev, “Message-locked encryption for lock-dependent messages,” in Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I, ser. Lecture Notes in Computer Science, vol. 8042. Springer, 2013, pp. 374–391.
[10] S. Keelveedhi, M. Bellare, and T. Ristenpart, “Dupless: Serveraided encryption for deduplicated storage,” in Proceedings of the 22th USENIX Security Symposium, Washington, DC, USA, August 14-16, 2013. USENIX Association, 2013, pp. 179–194.
[11] M. Bellare and S. Keelveedhi, “Interactive message-locked encryption and secure deduplication,” in Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, ser. Lecture Notes in Computer Science, vol. 9020. Springer, 2015, pp. 516–538.
[12] S. Bugiel, S. N¨ urnberger, A. Sadeghi, and T. Schneider, “Twin clouds: Secure cloud computing with low latency - (full version),” in Communications and Multimedia Security, 12th IFIP TC 6 / TC 11 International Conference, CMS 2011, Ghent, Belgium, October 19- 21,2011. Proceedings, ser. Lecture Notes in Computer Science, vol. 7025. Springer, 2011, pp. 32–44.
[13] S. Goldwasser, S. Micali, and C. Rackoff, “The knowledge complexity of interactive proof-systems (extended abstract),” in Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA. ACM, 1985, pp. 291– 304.
[14] M. Fischlin and R. Fischlin, “Efficient non-malleable commitment schemes,” in Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000, Proceedings, ser. Lecture Notes in Computer Science, vol. 1880. Springer, 2000, pp. 413–431.
[15] S. Goldwasser and S. Micali, “Probabilistic encryption,” J. Comput. Syst. Sci., vol. 28, no. 2, pp. 270–299, 1984.

P.Parameshwari, S.Padmapriya, G.Lakshmipriya, "Avoid Deduplication on Cloud through ABE", International Journal of Computer Sciences and Engineering, Vol.06, Issue.02, pp.385-388, 2018.

Social network platforms have hastily changed the way that people communicate and interact. They have enabled the establishment of, and participation in, digital communities as well as the representation, documentation and exploration of social relationships. We believe that as ‘apps’ become more sophisticated, it will happen to easier for users to share their own services, resources and data via social networks. One essential topic in today On-line Social Networks (OSNs) is to give users the ability to control the messages post on their own confidential space to avoid that unnecessary content is displayed. Up to nowadays OSNs present modest sustain to this requirement. To fill the gap, in this paper, we suggest a system allowing OSN users to have a direct control on the messages posted on their walls. This is reach during a flexible rule-based scheme, that allow users to adapt the filtering criterion to be practical to their walls, and a Machine Learning base soft classifier instinctively category messages in bear of content-based filtering. Index Terms—On-line Social Networks, Information Filtering, Short Text Classification, Policy-based Personalization The key findings of this work demonstrate how social networks can be leveraged in the construction of cloud computing infrastructures and how resources can be due in the occurrence of user sharing preferences.

Social Netowrk

[1] B. Wang, G. Chen, L. Fu, L. Song, and X. Wang, “Drimux: Dynamic rumor influence minimization with user experience in social networks,” in Proc. 30th AAAI Int. Conf. Artif. Intell., Feb. 2016.
[2] D. N. Yang, H. J. Hung, W. C. Lee, and W. Chen, “Maximizing acceptance probability for active friending in online social networks,” in Proc. 19th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2013, pp. 713–721.
[3] J. Leskovec, L. A. Adamic, and B. A. Huberman, “The dynamics oviral marketing,” in Proc. 7th ACM Conf. Electronic Commerce, 2006, pp. 228–237.
[4] A. McCallum, A. Corrada-Emmanuel, and X. Wang, “Topic and role discovery in social networks,” in Proc. 19th Int. Joint Conf. Artif. Intell., 2005, pp. 786–791.
[5] M. E. J. Newman, “The structure of scientific collaboration networks,” in Proceedings of National Academy of Science, 2001, pp. 404–409.
[6] L. Fu, W. Huang, X. Gan, F. Yang, and X. Wang, “Capacity of wireless networks with social characteristics,” IEEE Trans. Wireless Commun., vol. 15, pp. 1505–1516, Feb. 2016.
[7] A. Montanari and A. Saberi, “The spread of innovations in social networks,” in Proc. National Academy of Sciences of the United States of America PNAS, Aug. 2010, pp. 20 196–20 201.
[8] X. Rong and Q. Mei, “Diffusion of innovations revisited: From social network to innovation network,” in Proc. 22Nd ACM Int. Conf. Inf. Knowl. Manag., 2013, pp. 499–508.
[9] C. Budak, D. Agrawal, and A. E. Abbadi, “Limiting the spread of misinformation in social networks,” in Proc. 20th Int. Conf. World Wide Web, 2011, pp. 665–674.
[10] A. Bessi, F. Petroni, M. Del Vicario, F. Zollo, A. Anagnostopoulos, A. Scala, G. Caldarelli, and W. Quattrociocchi, “Viral misinformation: The role of homophily and polarization,” in Proc. 24th Int.
Conf. World Wide Web, 2015, pp. 355–356.
[11] E. Serrano, C. A. Iglesias, and M. Garijo, “A novel agent-based rumor spreading model in twitter,” in Proc. 24th Int. Conf. World Wide Web, 2015, pp. 811–814.
[12] S. Fiegerman, “Facebook, google, twitter accused of enabling isis,” http://money.cnn.com/2016/12/20/technology/twitterfacebook- google-lawsuit-isis, 2016.
[13] Facebook, “Facebook community standards,” https://www.facebook.com/communitystandards.
[14] D. Kempe, J. Kleinberg, and E. Tardos, “Maximizing the spread of influence through a social network,” in Proc. 9th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2003, pp. 1175–1180.
[15] W. Chen, C.Wang, and Y.Wang, “Scalable influence maximization
for prevalent viral marketing in large-scale social networks,” in
Proc. 16th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2010, pp. 1029–1038

S. Pauline Priya, L. Jayasimman, P. Nithya, "Predicting Unwanted Conversation in Online Social Networks", International Journal of Computer Sciences and Engineering, Vol.06, Issue.02, pp.389-392, 2018.