DOCSLIB.ORG

Btech Cse Syllabus 2017.Pdf

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Btech Cse Syllabus 2017.Pdf NATIONAL INSTITUTE OF TECHNOLOGY WARANGAL RULES AND REGULATIONS SCHEME OF INSTRUCTION AND SYLLABI FOR B.TECH PROGRAM Effective from 2017-18 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING NATIONAL INSTITUTE OF TECHNOLOGY WARANGAL VISION Towards a Global Knowledge Hub, striving continuously in pursuit of excellence in Education, Research, Entrepreneurship and Technological services to the society. MISSION Imparting total quality education to develop innovative, entrepreneurial and ethical future professionals fit for globally competitive environment. Allowing stake holders to share our reservoir of experience in education and knowledge for mutual enrichment in the field of technical education. Fostering product oriented research for establishing a self-sustaining and wealth creating centre to serve the societal needs. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING VISION Attaining global recognition in Computer Science & Engineering education, research and training to meet the growing needs of the industry and society. MISSION Imparting quality education through well-designed curriculum in tune with the challenging software needs of the industry. Providing state-of-art research facilities to generate knowledge and develop technologies in the thrust areas of Computer Science and Engineering. Developing linkages with world class organizations to strengthen industry-academia relationships for mutual benefit. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.TECH IN COMPUTER SCIENCE AND ENGINEERING PROGRAM EDUCATIONAL OBJECTIVES Apply computer science theory blended with mathematics and engineering to model PEO1 computing systems. Design, implement, test and maintain software systems based on requirement PEO2 specifications. Communicate effectively with team members, engage in applying technologies and PEO3 lead teams in industry. Assess the computing systems from the view point of quality, security, privacy, cost, PEO4 utility, etiquette and ethics. Engage in lifelong learning, career enhancement and adapt to changing professional PEO5 and societal needs. PROGRAM ARTICULATION MATRIX Mission Statement PEO1 PEO2 PEO3 PEO4 PEO5 Imparting quality undergraduate and graduate education through well-designed curriculum 3 3 2 3 2 tuned to the changing needs of the software industry Providing state-of-art research facilities to generate knowledge and develop 2 3 3 3 2 technologies in the thrust areas of Computer Science and Engineering Developing linkages with world class organizations to strengthen industry- 2 3 2 3 2 academia relationships for mutual benefits. PROGRAM OUTCOMES (POs) AND PROGRAM SPECIFIC OUTCOMES (PSOs): At the end of the program, the student will be able to: PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the solution of complex engineering problems. PO2 Problem analysis: Identify, formulate, research literature, and analyze complex engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences. PO3 Design/Development of solutions: Design solutions for complex engineering problems and design system components or processes that meet the specified needs with appropriate consideration for the public health and safety, and the cultural, societal, and environmental considerations. PO4 Conduct investigations of complex problems: Use research-based knowledge and research methods including design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid conclusions. PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including prediction and modelling to complex engineering activities with an understanding of the limitations. PO6 The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional engineering practice. PO7 Environment and sustainability: Understand the impact of the professional engineering solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable development. PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice.. PO9 Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings. PO10 Communication: Communicate effectively on complex engineering activities with the engineering community and with society at large, such as, being able to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions. PO11 Project management and Finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments. PO12 Life -long learning: Recognize the need for, and have the preparation and ability to engage in independent and life-long learning in the broadest context of technological change. PSO1 Design algorithms for real world computational problems and analyze their complexities. PSO2 Design and develop interfaces among subsystems of computing. PSO3 Analyze large data samples and discover knowledge to provide solutions to engineering problems. PSO4 Assess security, privacy, quality and cost parameters in developing software systems. Rules and Regulations of B.Tech Programs effective from 2017-18 1. INTRODUCTION: Provision of these regulations shall come into force with effect from the academic year 2017 - 2018 and shall be applicable to all B. Tech courses (unless otherwise stated) offered by the Institute 1.1 B.Tech Degree Programs are offered in the following specializations by the respective engineering departments. S No Department B. Tech Program Name 1 Civil Engineering Civil Engineering 2 Electrical Engineering Electrical and Electronics Engineering 3 Mechanical Engineering Mechanical Engineering 4 Electronics and Electronics and Communication Engineering Communication Engineering 5 Metallurgical and Materials Metallurgical and Materials Engineering Engineering 6 Chemical Engineering Chemical Engineering 7 Computer Science and Computer Science and Engineering Engineering 8 Biotechnology Biotechnology 1.2 The provisions of these regulations shall be applicable to any new discipline that may be introduced from time to time. 1.3 The sanction of stipend will be as per the guidelines prescribed AICTE/MHRD from time to time 1.4 Prescribed service courses for all the programs listed in 1.1 are supported by a) Mathematics b) Humanities and Social Sciences c) Physics d) Chemistry and e) School of Management 1.5 The provisions of these regulations shall be applicable to any new discipline that may be introduced from time to time. 2. ADMISSION: 2.1 Admission to National Institute of Technology Warangal will be made in accordance with the instructions received from the Ministry of Human Resource Development (MHRD), Government of India from time to time. Seats are reserved for candidates belonging to Scheduled Castes (SC), Schedules Tribes (ST), Other Backward Classes (OBC), Persons with Disability (PH/PWD) and other categories as per the guidelines issued by MHRD from time to time. 2.2 Admission to all courses will be made in the odd semester of each academic year at the first year level based on the relative performance in the Joint Entrance Examination (JEE – Mains) as per the guidelines issued by the MHRD, New Delhi from time to time. The candidates should have successfully passed the 12thclass examination or equivalent with the combination of subjects prescribed by the Competent Authority. 2.3 A limited number of admissions are offered to Foreign Nationals and Indians living abroad in accordance with the rules applicable for such admission, from time to time, issued by MHRD. 2.4 If, any time after admission, it is found that a candidate had not in fact fulfilled all the requirements stipulated in the offer of admission, in any form what so ever, including possible misinformation etc., the Dean-Academic shall report the matter to the Senate recommending for cancelling the admission of the candidate. 2.5 The institute reserves the right to cancel the admission of any student and ask him/her to discontinue his/her studies at any stage of his/her career on the grounds of indiscipline or any misconduct. 2.6 The decision of the Senate, regarding sections 2.4 and 2.5 above, is final and binding. 2.7 Candidates must fulfil the medical standards required for admission as prescribed in the Institute Information Brochure or the Prospectus. 2.8 Every Under Graduate student of the Institute shall be associated with the parent department offering the degree program that the student undergoes, throughout his/her study period. 3. COURSE STRUCTURE: 3.1 The total course package for B.Tech Degree Program typically consists of the following components. a) Basic Science Core (BSC) b) Engineering Science Core (ESC) c) Humanities and Social Science Core(HSC) d) Program Core Courses (PCC) e) Departmental Elective Courses (DEC) f) Open Elective Courses (OPC) g) Program Major Project(PRC) h) EAA: Games and Sports (MDC) Note: (Open Elective Courses can be any of the following areas: Basic Sciences, Engineering Science
Load more

Recommended publications
  • Facing the Future: European Research Infrastructures for the Humanities and Social Sciences
    Facing the Future: European Research Infrastructures for the Humanities and Social Sciences Adrian Duşa, Dietrich Nelle, Günter Stock, and Gert G. Wagner (Eds.) Facing the Future: European Research Infrastructures for the Humanities and Social Sciences E d i t o r s : Adrian Duşa (SCI-SWG), Dietrich Nelle (BMBF), Günter Stock (ALLEA), and Gert. G. Wagner (RatSWD) ISBN 978-3-944417-03-5 1st edition © 2014 SCIVERO Verlag, Berlin SCIVERO is a trademark of GWI Verwaltungsgesellschaft für Wissenschaftspoli- tik und Infrastrukturentwicklung Berlin UG (haftungsbeschränkt). This book documents the results of the conference Facing the Future: European Research Infrastructure for Humanities and Social Sciences (November 21/22 2013, Berlin), initiated by the Social and Cultural Innovation Strategy Work- ing Group of ESFRI (SCI-SWG) and the German Federal Ministry of Education and Research (BMBF), and hosted by the European Federation of Academies of Sciences and Humanities (ALLEA) and the German Data Forum (RatSWD). Thanks and appreciation are due to all authors, speakers and participants of the conference, and all involved institutions, in particular the German Federal Ministry of Education and Research (BMBF). The ministry funded the conference and this subsequent publication as part of the Union of the German Academies of Sciences and Humanities’ project “Survey and Analysis of Basic Humanities and Social Science Research at the Science Academies Related Research Insti- tutes of Europe”. The views expressed in this publication are exclusively the opinions of the authors and not those of the German Federal Ministry of Education and Research. Editing: Dominik Adrian, Camilla Leathem, Thomas Runge, Simon Wolff Layout and graphic design: Thomas Runge Contents Preface .
    [Show full text]
  • Extracting Insights from Differences: Analyzing Node-Aligned Social
    Extracting Insights from Differences: Analyzing Node-aligned Social Graphs by Srayan Datta A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Science and Engineering) in The University of Michigan 2019 Doctoral Committee: Associate Professor Eytan Adar, Chair Associate Professor Mike Cafarella Assistant Professor Danai Koutra Associate Professor Clifford Lampe Srayan Datta [email protected] ORCID iD: 0000-0002-5800-830X c Srayan Datta 2019 To my family and friends ii ACKNOWLEDGEMENTS There are several people who made this dissertation possible, first among this long list is my adviser, Eytan Adar. Pursuing a doctoral program after just finishing un- dergraduate studies can be a daunting task but Eytan made it easy with his patience, kindness, and guidance. I learned a lot from our collaborations and idle conversations and I am very grateful for that. I would like to extend my thanks to the rest of my thesis committee, Mike Ca- farella, Danai Koutra and Cliff Lampe for their suggestions and constructive feed- back. I would also like to thank the following faculty members, Daniel Romero, Ceren Budak, Eric Gilbert and David Jurgens for their long insightful conversations and suggestions about some of my projects. I would like to thank all of friends and colleagues who helped (as a co-author or through critique) or supported me through this process. This is an enormous list but I am especially thankful to Chanda Phelan, Eshwar Chandrasekharan, Sam Carton, Cristina Garbacea, Shiyan Yan, Hari Subramonyam, Bikash Kanungo, and Ram Srivatasa. I would like to thank my parents for their unwavering support and faith in me.
    [Show full text]
  • Well-Founded Functions and Extreme Predicates in Dafny: a Tutorial
    EPiC Series in Computing Volume 40, 2016, Pages 52–66 IWIL-2015. 11th International Work- shop on the Implementation of Logics Well-founded Functions and Extreme Predicates in Dafny: A Tutorial K. Rustan M. Leino Microsoft Research [email protected] Abstract A recursive function is well defined if its every recursive call corresponds a decrease in some well-founded order. Such well-founded functions are useful for example in computer programs when computing a value from some input. A boolean function can also be defined as an extreme solution to a recurrence relation, that is, as a least or greatest fixpoint of some functor. Such extreme predicates are useful for example in logic when encoding a set of inductive or coinductive inference rules. The verification-aware programming language Dafny supports both well-founded functions and extreme predicates. This tutorial describes the difference in general terms, and then describes novel syntactic support in Dafny for defining and proving lemmas with extreme predicates. Various examples and considerations are given. Although Dafny’s verifier has at its core a first-order SMT solver, Dafny’s logical encoding makes it possible to reason about fixpoints in an automated way. 0. Introduction Recursive functions are a core part of computer science and mathematics. Roughly speaking, when the definition of such a function spells out a terminating computation from given arguments, we may refer to it as a well-founded function. For example, the common factorial and Fibonacci functions are well-founded functions. There are also other ways to define functions. An important case regards the definition of a boolean function as an extreme solution (that is, a least or greatest solution) to some equation.
    [Show full text]
  • Network Analysis with Nodexl
    Social data: Advanced Methods – Social (Media) Network Analysis with NodeXL A project from the Social Media Research Foundation: http://www.smrfoundation.org About Me Introductions Marc A. Smith Chief Social Scientist Connected Action Consulting Group [email protected] http://www.connectedaction.net http://www.codeplex.com/nodexl http://www.twitter.com/marc_smith http://delicious.com/marc_smith/Paper http://www.flickr.com/photos/marc_smith http://www.facebook.com/marc.smith.sociologist http://www.linkedin.com/in/marcasmith http://www.slideshare.net/Marc_A_Smith http://www.smrfoundation.org http://www.flickr.com/photos/library_of_congress/3295494976/sizes/o/in/photostream/ http://www.flickr.com/photos/amycgx/3119640267/ Collaboration networks are social networks SNA 101 • Node A – “actor” on which relationships act; 1-mode versus 2-mode networks • Edge B – Relationship connecting nodes; can be directional C • Cohesive Sub-Group – Well-connected group; clique; cluster A B D E • Key Metrics – Centrality (group or individual measure) D • Number of direct connections that individuals have with others in the group (usually look at incoming connections only) E • Measure at the individual node or group level – Cohesion (group measure) • Ease with which a network can connect • Aggregate measure of shortest path between each node pair at network level reflects average distance – Density (group measure) • Robustness of the network • Number of connections that exist in the group out of 100% possible – Betweenness (individual measure) F G •
    [Show full text]
  • Programming Language Features for Refinement
    Programming Language Features for Refinement Jason Koenig K. Rustan M. Leino Stanford University Microsoft Research [email protected] [email protected] Algorithmic and data refinement are well studied topics that provide a mathematically rigorous ap- proach to gradually introducing details in the implementation of software. Program refinements are performed in the context of some programming language, but mainstream languages lack features for recording the sequence of refinement steps in the program text. To experiment with the combination of refinement, automated verification, and language design, refinement features have been added to the verification-aware programming language Dafny. This paper describes those features and reflects on some initial usage thereof. 0. Introduction Two major problems faced by software engineers are the development of software and the maintenance of software. In addition to fixing bugs, maintenance involves adapting the software to new or previously underappreciated scenarios, for example, using new APIs, supporting new hardware, or improving the performance. Software version control systems track the history of software changes, but older versions typically do not play any significant role in understanding or evolving the software further. For exam- ple, when a simple but inefficient data structure is replaced by a more efficient one, the program edits are destructive. Consequently, understanding the new code may be significantly more difficult than un- derstanding the initial version, because the source code will only show how the more complicated data structure is used. The initial development of the software may proceed in a similar way, whereby a software engi- neer first implements the basic functionality and then extends it with additional functionality or more advanced behaviors.
    [Show full text]
  • Developing Verified Sequential Programs with Event-B
    UNIVERSITY OF SOUTHAMPTON Developing Verified Sequential Programs with Event-B by Mohammadsadegh Dalvandi A thesis submitted in partial fulfillment for the degree of Doctor of Philosophy in the Faculty of Physical Sciences and Engineering Electronics and Computer Science April 2018 UNIVERSITY OF SOUTHAMPTON ABSTRACT FACULTY OF PHYSICAL SCIENCES AND ENGINEERING ELECTRONICS AND COMPUTER SCIENCE Doctor of Philosophy by Mohammadsadegh Dalvandi The constructive approach to software correctness aims at formal modelling of the in- tended behaviour and structure of a system in different levels of abstraction and verifying properties of models. The target of analytical approach is to verify properties of the final program code. A high level look at these two approaches suggests that the con- structive and analytical approaches should complement each other well. The aim of this thesis is to build a link between Event-B (constructive approach) and Dafny (analytical approach) for developing sequential verified programs. The first contribution of this the- sis is a tool supported method for transforming Event-B models to simple Dafny code contracts (in the form of method pre- and post-conditions). Transformation of Event-B formal models to Dafny method declarations and code contracts is enabled by a set of transformation rules. Using this set of transformation rules, one can generate code contracts from Event-B models but not implementations. The generated code contracts must be seen as an interface that can be implemented. If there is an implementation that satisfies the generated contracts then it is considered to be a correct implementation of the abstract Event-B model. A tool for automatic transformation of Event-B models to simple Dafny code contracts is presented.
    [Show full text]
  • Master's Thesis
    FACULTY OF SCIENCE AND TECHNOLOGY MASTER'S THESIS Study programme/specialisation: Computer Science Spring / Autumn semester, 20......19 Open/Confidential Author: ………………………………………… Nicolas Fløysvik (signature of author) Programme coordinator: Hein Meling Supervisor(s): Hein Meling Title of master's thesis: Using domain restricted types to improve code correctness Credits: 30 Keywords: Domain restrictions, Formal specifications, Number of pages: …………………75 symbolic execution, Rolsyn analyzer, + supplemental material/other: …………0 Stavanger,……………………….15/06/2019 date/year Title page for Master's Thesis Faculty of Science and Technology Domain Restricted Types for Improved Code Correctness Nicolas Fløysvik University of Stavanger Supervised by: Professor Hein Meling University of Stavanger June 2019 Abstract ReDi is a new static analysis tool for improving code correctness. It targets the C# language and is a .NET Roslyn live analyzer providing live analysis feedback to the developers using it. ReDi uses principles from formal specification and symbolic execution to implement methods for performing domain restriction on variables, parameters, and return values. A domain restriction is an invariant implemented as a check function, that can be applied to variables utilizing an annotation referring to the check method. ReDi can also help to prevent runtime exceptions caused by null pointers. ReDi can prevent null exceptions by integrating nullability into the domain of the variables, making it feasible for ReDi to statically keep track of null, and de- tecting variables that may be null when used. ReDi shows promising results with finding inconsistencies and faults in some programming projects, the open source CoreWiki project by Jeff Fritz and several web service API projects for services offered by Innovation Norway.
    [Show full text]
  • Essays on Emotional Well-Being, Health Insurance Disparities and Health Insurance Markets
    University of New Mexico UNM Digital Repository Economics ETDs Electronic Theses and Dissertations Summer 7-15-2020 Essays on Emotional Well-being, Health Insurance Disparities and Health Insurance Markets Disha Shende Follow this and additional works at: https://digitalrepository.unm.edu/econ_etds Part of the Behavioral Economics Commons, Health Economics Commons, and the Public Economics Commons Recommended Citation Shende, Disha. "Essays on Emotional Well-being, Health Insurance Disparities and Health Insurance Markets." (2020). https://digitalrepository.unm.edu/econ_etds/115 This Dissertation is brought to you for free and open access by the Electronic Theses and Dissertations at UNM Digital Repository. It has been accepted for inclusion in Economics ETDs by an authorized administrator of UNM Digital Repository. For more information, please contact [email protected], [email protected], [email protected]. Disha Shende Candidate Economics Department This dissertation is approved, and it is acceptable in quality and form for publication: Approved by the Dissertation Committee: Alok Bohara, Chairperson Richard Santos Sarah Stith Smita Pakhale i Essays on Emotional Well-being, Health Insurance Disparities and Health Insurance Markets DISHA SHENDE B.Tech., Shri Guru Govind Singh Inst. of Engr. and Tech., India, 2010 M.A., Applied Economics, University of Cincinnati, 2015 M.A., Economics, University of New Mexico, 2017 DISSERTATION Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Economics At the The University of New Mexico Albuquerque, New Mexico July 2020 ii DEDICATION To all the revolutionary figures who fought for my right to education iii ACKNOWLEDGEMENT This has been one of the most important bodies of work in my academic career so far.
    [Show full text]
  • Dafny: an Automatic Program Verifier for Functional Correctness K
    Dafny: An Automatic Program Verifier for Functional Correctness K. Rustan M. Leino Microsoft Research [email protected] Abstract Traditionally, the full verification of a program’s functional correctness has been obtained with pen and paper or with interactive proof assistants, whereas only reduced verification tasks, such as ex- tended static checking, have enjoyed the automation offered by satisfiability-modulo-theories (SMT) solvers. More recently, powerful SMT solvers and well-designed program verifiers are starting to break that tradition, thus reducing the effort involved in doing full verification. This paper gives a tour of the language and verifier Dafny, which has been used to verify the functional correctness of a number of challenging pointer-based programs. The paper describes the features incorporated in Dafny, illustrating their use by small examples and giving a taste of how they are coded for an SMT solver. As a larger case study, the paper shows the full functional specification of the Schorr-Waite algorithm in Dafny. 0 Introduction Applications of program verification technology fall into a spectrum of assurance levels, at one extreme proving that the program lives up to its functional specification (e.g., [8, 23, 28]), at the other extreme just finding some likely bugs (e.g., [19, 24]). Traditionally, program verifiers at the high end of the spectrum have used interactive proof assistants, which require the user to have a high degree of prover expertise, invoking tactics or guiding the tool through its various symbolic manipulations. Because they limit which program properties they reason about, tools at the low end of the spectrum have been able to take advantage of satisfiability-modulo-theories (SMT) solvers, which offer some fixed set of automatic decision procedures [18, 5].
    [Show full text]
  • Quick Notes on Nodexl
    Quick notes on NodeXL Programme organisation, 3 components: • NodeXL command ‘ribbon’ – access with menu-like item at top of the screen, contains all network data functions • Data sheets – 5 separate sheets for edges, vertices, metrics etc, switching between them using tabs on the bottom. NB because the screen gets quite crowded the sheet titles sometimes disappear off to one side so use the small arrows (bottom left) to scroll across the tabs if something seems to have gone missing. • Graph viewer – separate window pane labelled ‘Document Actions’ with graphical layout functions. Can be closed while working with data – to open it again click the ‘Show Graph’ button near the left-hand side of the ribbon. Working with data, basic process: 1. Start in ‘Edges’ data sheet (leftmost tab at the bottom); each row represents one connection of the form A links to B (directed graph) OR A and B are linked (undirected). (Directed/Undirected changed in ‘Type’ option on ribbon. In directed graph this sheet might include one row for A->B and one for B->A; in an undirected graph this would be tautologous.) No other data in this sheet is required, although optionally: • Could include text under ‘label’ if the visible label on graphs should be different from the name used in columns A or B. NB These might be overwritten when using ‘autofill columns’. • Could add an extra column at column L to identify weight of links if (as is the case with IssueCrawler data) each connection might represent more than 1 actually existing link between two vertices, hence inclusion of ‘Edge Weight’ in blogs data.
    [Show full text]
  • Livro De Resumos EDITORA DA UNIVERSIDADE FEDERAL DE SERGIPE
    Organizadores: Carlos Alexandre Borges Garcia Marcus Eugênio Oliveira Lima Livro de Resumos EDITORA DA UNIVERSIDADE FEDERAL DE SERGIPE COORDENADORA DO PROGRAMA EDITORIAL Messiluce da Rocha Hansen COORDENADOR GRÁFICO DA EDITORA UFS Germana Gonçalves de Araújo PROJETO GRÁFICO E EDITORAÇÃO ELETRÔNICA Alisson Vitório de Lima FOTOGRAFIAS Disponibilizadas sob licença Creative Commons, ou de domínio público. Adilson Andrade - Foto da página X; FICHA CATALOGRÁFICA ELABORADA PELA BIBLIOTECA CENTRAL UNIVERSIDADE FEDERAL DE SERGIPE Encontro de Pós-Graduação (8. : 2016 : São Cristóvão, SE) Livro de resumos [recurso eletrônico] : VIII Encontro de Pós-Graduação / organizadores: Carlos Alexandre Borges Garcia, Marcus Eugênio Oliveira Lima. – São Cristóvão : Editora UFS : Universidade E56l Federal de Sergipe, Programa de Pós-Graduação, 2016. 353 p. ISBN 978-85-7822-550-6 1. Pós-graduação – Congresso. I. Universidade Federal de Sergipe. II. Garcia, Carlos Alexandre Borges. III. Lima, Marcus Eugênio Oliveira. CDU 378.046-021.68 Cidade Universitária “Prof. José Aloísio de Campos” CEP 49.100-000 – São Cristóvão - SE. Telefone: 3194 - 6922/6923. e-mail: [email protected] http://livraria.ufs.br/ Este portfólio, ou parte dele, não pode ser reproduzido por qualquer meio sem autorização escrita da Editora. Organizadores: Carlos Alexandre Borges Garcia Marcus Eugênio Oliveira Lima Livro de Resumos UFS São Cristóvão/SE - 2016 Ciências Agrárias A (des)realização da estratégia democrático-popular: Uma análise a partir da realidade do movimento dos trabalhadores rurais sem terra (MST) e do Partido dos Trabalhadores (PT) Autor: SOUSA, Ronilson Barboza de. Orientador: RAMOS FILHO, Eraldo da Silva. A referente tese de doutorado, que vem sendo desenvolvida, tem como objetivo analisar o processo de realização da estratégia democrático-popular, adotada pelo Movimento dos Trabalhadores Rurais Sem Terra (MST) e pelo Partido dos Trabalhadores (PT), especial- mente na luta pela terra e pela reforma agrária.
    [Show full text]
  • NODEXL for Beginners Nasri Messarra, 2013‐2014
    NODEXL for Beginners Nasri Messarra, 2013‐2014 http://nasri.messarra.com Why do we study social networks? Definition from: http://en.wikipedia.org/wiki/Social_network: A social network is a social structure made up of a set of social actors (such as individuals or organizations) and a set of the dyadic ties between these actors. Social networks and the analysis of them is an inherently interdisciplinary academic field which emerged from social psychology, sociology, statistics, and graph theory. From http://en.wikipedia.org/wiki/Sociometry: "Sociometric explorations reveal the hidden structures that give a group its form: the alliances, the subgroups, the hidden beliefs, the forbidden agendas, the ideological agreements, the ‘stars’ of the show". In social networks (like Facebook and Twitter), sociometry can help us understand the diffusion of information and how word‐of‐mouth works (virality). Installing NODEXL (Microsoft Excel required) NodeXL Template 2014 ‐ Visit http://nodexl.codeplex.com ‐ Download the latest version of NodeXL ‐ Double‐click, follow the instructions The SocialNetImporter extends the capabilities of NodeXL mainly with extracting data from the Facebook network. To install: ‐ Download the latest version of the social importer plugins from http://socialnetimporter.codeplex.com ‐ Open the Zip file and save the files into a directory you choose, e.g. c:\social ‐ Open the NodeXL template (you can click on the Windows Start button and type its name to search for it) ‐ Open the NodeXL tab, Import, Import Options (see screenshot below) 1 | Page ‐ In the import dialog, type or browse for the directory where you saved your social importer files (screenshot below): ‐ Close and open NodeXL again For older Versions: ‐ Visit http://nodexl.codeplex.com ‐ Download the latest version of NodeXL ‐ Unzip the files to a temporary folder ‐ Close Excel if it’s open ‐ Run setup.exe ‐ Visit http://socialnetimporter.codeplex.com ‐ Download the latest version of the socialnetimporter plug in 2 | Page ‐ Extract the files and copy them to the NodeXL plugin direction.
    [Show full text]