Wednesday, 8 July 2020

PhD by publication

"PhD by publication is an alternative that can help address the growing need for qualified academic professionals while maintaining the quality standards demanded by the research community."

PhD is the highest academic qualification conferred to the students who excel in research in their corresponding field of study and is also a necessary requirement for various professions. Various academic bodies award thousands of PhD’s each year and this number is growing as many universities have made it compulsory for lecturers to attain a Phd within a specific period after their appointment. According to Universityworldnews.com the ”massification” of PhD enrolment is putting a lot of pressure on the universities and the academic world is experiencing serious issues related to the quality of the doctoral education.

Similarly, making it mandatory to hold a PhD degree is also increasing the stress level on lecturers as it now requires them to earn a degree to be eligible for further employment. Prabhat Kumar, a lecturer enrolled in part-time PhD said, “Most of my colleagues have enrolled in distant PhD or part-time PhD programme and are facing a lot of difficulties as the time frame of getting a PhD via the above modes may take four to eight years and also involves a lot of money.” He further added, “Unlike full time PhD students we do not get any scholarships so it is very hard for us to manage the finances and once I have taken a decision to do a full-time PhD but did not proceed further as the scholarship amount was very less and sometimes given at regular intervals.” In the recent years countries such as India have discontinued PhD through distance further adding to the woes of the doctoral students.

Another full-time scholar Ritika Rastogi added, ”I have enrolled in a full-time program after leaving my previous job as this is necessary to excel my carrier but have realized that I am wasting a lot of my time in doing courses that I have studied during my Masters coursework. Also, availability of mentor is limiting my freedom in choosing a domain for my PhD thesis.” A report by theguardian.com further confirms that PhD scholars also considered as a source of cheap labour as the institutes also use them for multiple jobs while offering a waiver in the fees or a fellowship.

While bureaucracy is rampant in the academic world, there are further higher instances of degrading research quality especially in developing countries such as India and Africa. Report by natureasia.com reveals that making it mandatory for lecturers and academic students to publish before getting promotions or doctoral degree in India has increased the number of fake publications from India. This has much to do with the quality of doctoral education as students are not getting sufficient resources to improve their research aptitude because they have to balance their education and job simultaneously. 

PhD by publication is another alternative for obtaining a PhD and is being awarded by few prominent universities such as the University of Westminster, University of Warwick, Kingston University (London), University of Portsmouth, University of East Anglia. The universities aim this mode of education for professionals in the middle of their carrier pathway and cannot leave their jobs for a doctoral programme. Enrolling in this mode of education requires the applicants to fulfill certain requirements such as being a working professional in a related discipline for a certain number of years, possessing basic academic qualifications such as a bachelor or a master degree and the degree is awarded when the applicants have published required number of papers (which may range from three to eight based on the academic discipline and university awarding the degree) in peer reviewed journals.

While PhD by publication is not a replacement for a regular mode of doctoral education, it may act as a substitute for improving the quality of PhD program in developing countries that cannot allocate funds to support the increasing number of PhD applications. The mode also helps the doctoral students in focussing on the research-related activities and their job without being exploited by institutions that would use doctoral students as cheap labour for institutions. Similarly, doctoral students will achieve more freedom as they need not go through the highly bureaucratic procedures and can allocate more time for self-study leading to more performance oriented outcomes such as top quality research.

There are various steps the countries and educational bodies have to take to ensure that PhD by publication method will b beneficial to both the students and the countries. First. the governing bodies should set first the minimum basic criteria to be eligible for candidates to be eligible for this course correctly.  A preferred criteria would be a master of philosophy degree and minimum three years of work experience in the related discipline. A master of philosophy degree ensures that the candidate has the basic knowledge of the prerequisites of conducting the research.

Similarly, the candidate should clear a national level or equivalent entrance exam that would test the candidates aptitude in the discipline the candidate wishes to get a PhD. The governing bodies should also provide the minimum number of articles and a quality list of journals in which the candidate needs to publish his research article to be eligible for the PhD. The governing bodies should also provide a mechanism of getting access to various equipment and journals to scholars by paying a subsidized amount of fees.

The scholars enrolled in such programs can get a card issues and can use the government or institutional laboratories for conducting the experiments by booking the dates on which they wish to use the equipment. This is like the way people use a library to issue the books but here we are talking about equipment in the laboratory. Finally, every university that has a full time doctoral program should provide this mode of education should as the additional cost incurred in providing such a program is minimal and also this mode ensures equal access to quality education for all the aspirants.

Sources:
https://www.universityworldnews.com/post.php?story=20200609091837168
https://www.theguardian.com/higher-education-network/2018/mar/23/they-called-my-university-a-phd-factory-now-i-understand-why
https://www.natureasia.com/en/nindia/article/10.1038/nindia.2017.115

Wednesday, 1 March 2017

Java collection Notes



Java Collections and Generics
·        The Java Collections Framework
·        Java Generics
13.1. The Java Collections Framework
·        Java arrays have limitations.
o   They cannot dynamically shrink and grow.
o   They have limited type safety.
o   Implementing efficient, complex data structures from scratch would be difficult.

·        The Java Collections Framework is a set of classes and interfaces implementing complex collection data structures.
o   collection is an object that represents a group of objects.

·        The Java Collections Framework provides many benefits:
o   Reduces programming effort (already there)
o   Increases performance (tested and optimized)
o   Part of the core API (available, easy to learn)
o   Promotes software reuse (standard interface)
o   Easy to design APIs based on generic collections

Sunday, 16 October 2016

Selenium find element Notes

8 locations for selecting object: (Firebug and firepath for visualising)

by.id:
id attribute is availble, value must be unique, should be constant(not dynamic),

name:
name attribute is availble, value must be unique, should be constant,

classname:
attribute is availble, value must be unique, should be constant, no space(compound name)-if space use only any one word

linktext:
must be a link, must have text, unique

paritlalinktext:
must be a link, must have text(paritlaltext can be taken)

tagname:
any html tag

cssselector:
rules of css, even if no attributes, use tag+atttrib combination
css rules:
using id selector: tag#id or #id (button#epam)
using class selector: tag.class or .class
********** using attribute selector: tag[att='attvalue'][att='attvalue']
using id,class and attributeselector: tag#id[class='value'] or tag.class[id='value']
using attributrnameselector:  css=tag[attribute], not pseudo class syntax: css=tag:not([attribute])
using innertext: css=tag.contains("inner text") supports link+other elements without text
partial match on attribute values:
^= input[id^='ctri'] starting with ctrl
$= input[id$='_ctri'] ending with _ctrl
*= input[id*='ctri'] containing ctrl
TIP:
Absolute: Starting from html tag
Relative: relative to tag
While going through nested elements use > for child elements + for sibling elements
*:nth-child(number) for the nth child element

Xpath: 
xml path language 
query language, search backward forward, slow, flexible
absolutepath: start with /  ,  [1] index starts from 1, [@attribute='value'], structure changes wont work, lengthy 
relativepath:
starts with // , use attributes rather than index, //*[@attribute='value'] - any element in html document, using index use parent for sure
multiple attributes: //tag[@attribute='value'][@attribute='value']   //tag[@attribute='value' and @attribute='value']  //tag[@attribute='value' or @attribute='value']
using attributes: //tag[@attribute]
//tag[starts-with(@att,'val')] //tag[ends-with(@att,'val')] //tag[contains(@att,'val')] //not works in fire bug
//tag[@*='value'] -any attribute with value
//tag[@text()='unicode value'] -alternative to link text
**********Xpath Axis- locate elements based on relationship with other elements
axiselement:: - axis elements are ancestor, descendant, following(everything after closing of current tag), following-sibling(after current node), preceding(nodes appear before except ancestor ) , preceding-sibling(before current node)

Sunday, 25 September 2016

CAT preparation 2016

Quantitative Aptitude (QA),
Verbal and Reading Comprehension (VRC)
Data Interpretation & Logical Reasoning (DLIR)

# Verbal & Reading Comprehension

This section will comprise of questions that will be based on Reading comprehension, fill in the blanks, verbal reasoning, antonyms and synonyms, syllogisms, analogies,  sentence correction, idioms, etc.

Types of Questions

•    Vocabulary Based (Synonyms Antonyms)    
•    Sentence Correction
•    Fill in the blanks
•    English Usage or Grammar
•    Cloze Passage
•    Jumbled Paragraph
•    Meaning-Usage Match
•    Analogies or Reverse Analogies
•    Summary Questions
•    Verbal Reasoning –
•    Facts / Inferences / Judgements
•    Reading Comprehension

# Quantitative Aptitude

Quantitative section plays a major role in the test and usually have questions with a little higher difficulty level.

Types of Questions

    Number Systems
    LCM and HCF
    Speed, Time and Distance
    Profit and Loss
    Interest (Simple and Compound)
    Percentages
    Ratio and Proportion
    Time and Work
    Averages
    Logarithm
    Linear Equations
    Inequalities
    Quadratic Equations
    Progressions
    Co-ordinate Geometry
    Surds and Indices
    Set Theory
    Permutation and Combination
    Probability
    Binomial Theorem
    Functions
    Mensuration
    Mixtures and Alligations
    Geometry
    Permutation and Combination
    Trigonometry
    Complex Numbers

# Data Interpretation

Data interpretation on the other hand will have questions, divided in 4 sets. The information sets, that will be based on bar diagrams, statistical representation of data, tables, charts, graphical representation. In this section it is tested that how candidates can interpret the given data and answer questions based on it.

Types of Questions

    Tables
    Line Charts
    Column Graphs
    Venn Diagram
    Bar Graphs
    Pie Chart

# Logical Reasoning

Questions from this section will carry a logic in them and the key to solving such questions is to quickly analyze and unveil the hidden logic.

Types of Questions

    Number and Letter Series
    Calendars
    Clocks
    Venn Diagrams
    Cubes
    Binary Logic
    Logical Matching
    Seating Arrangement
    Logical Sequence
    Syllogism
    Logical Connectives
    Blood Relations

Recommended Books

# Quantitative Aptitude

    How to Prepare for Quantitative Aptitude for the CAT Common Admission Test 5th Edition (Paperback) by Arun Sharma, Publisher: Tata McGraw Hill 2012 Rs. 625, 2012 edition

    The Pearson Guide To Quantitative Aptitude And Data Interpretation For The CAT by Nishit Sinha, Publisher: Pearson. Rs. 650, 2012 edition.

    Quantum CAT: Quantitative Aptitude Common Admission Test for Admission Into IIMs (Paperback) by Sarvesh K Verma Publisher: Arihant, Rs. 650, 2013 edition.

# Data Interpretation & Logical Reasoning

    How to Prepare for Data Interpretation for the CAT Common Admission Test 1st Edition (Paperback) by Arun Sharma Publisher: Tata McGraw-Hill Rs. 550, 2012 edition.

    How to Prepare for Logical Reasoning for the CAT Common Admission Test by Arun Sharma Publisher: Tata McGraw-Hill Rs. 450, 2012 edition.

    The Pearson Guide To Verbal Ability And Logical Reasoning For The CAT 1st Edition (Paperback) by Nishit K. Sinha. Publisher: Pearson. Rs. 599, 2012 edition.


# Verbal Ability

    How to Prepare for Verbal Ability and Reading  Comprehension for the CAT Common Admission Test 4th Edition (Paperback)  by Meenakshi Upadhyay, Arun Sharma. Publisher: Tata McGraw Hill, Rs.  575, 2011 Edition.

   The Pearson Guide To Verbal Ability And Logical Reasoning For The  CAT 1st Edition (Paperback) by Nishit K. Sinha Publisher: Pearson, Rs.  599, 2012 edition.
   

Monday, 15 August 2016

Sanfoundry 1000 Java MCQS Notes

Networking:
How many ports of TCP/IP are reserved for specific protocols?
1024

Which of these exception is thrown by URL class’s constructors?
MalformedURLException

Which of these methods is used to know the full URL of an URL object?
toExternalForm()

What is the output of this program?
                URL obj = new URL("http://www.sanfoundry.com/javamcq");
                System.out.print(obj.getPort());
Ans. -1

Which of these method of DatagramPacket is used to find the port number?
port()

Which of these method of DatagramPacket is used to obtain the byte array of data contained in a datagram?
getData()

Sunday, 7 August 2016

Java Random Notes


throws is used to postpone the handling of a checked exception and throw is used to invoke an exception explicitly. Mainly used for user defined exceptions.
public class className
{
   public void deposit(double amount) throws RemoteException
   {
      // Method implementation
      throw new RemoteException();
   }
   //Remainder of class definition
}

Sunday, 31 July 2016

HEAP SORT JAVA

import java.util.Scanner;

// Java program for implementation of Heap Sort
public class HeapSort
{
public void sort(int arr[])
{
int n = arr.length;

// Build heap (rearrange array)
for (int i = n / 2 - 1; i >= 0; i--)
heapify(arr, n, i);

// One by one extract an element from heap
for (int i=n-1; i>=0; i--)
{
// Move current root to end
int temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;

// call max heapify on the reduced heap
heapify(arr, i, 0);
}
}

// To heapify a subtree rooted with node i which is
// an index in arr[]. n is size of heap
void heapify(int arr[], int n, int i)
{
int largest = i; // Initialize largest as root
int l = 2*i + 1; // left = 2*i + 1
int r = 2*i + 2; // right = 2*i + 2

// If left child is larger than root
if (l < n && arr[l] > arr[largest])
largest = l;

// If right child is larger than largest so far
if (r < n && arr[r] > arr[largest])
largest = r;

// If largest is not root
if (largest != i)
{
int swap = arr[i];
arr[i] = arr[largest];
arr[largest] = swap;

// Recursively heapify the affected sub-tree
heapify(arr, n, largest);
}
}

/* A utility function to print array of size n */
static void printArray(int arr[])
{
int n = arr.length;
for (int i=0; i<n; ++i)
System.out.print(arr[i]+" ");
System.out.println();
}

// Driver program
public static void main(String args[])
{
        Scanner scan = new Scanner( System.in );      
        System.out.println("Heap Sort Test\n");
        int n, i;
        /* Accept number of elements */
        System.out.println("Enter number of integer elements");
        n = scan.nextInt();
        /* Create integer array on n elements */
        int arr[] = new int[ n ];
        /* Accept elements */
        System.out.println("\nEnter "+ n +" integer elements");
        for (i = 0; i < n; i++)
            arr[i] = scan.nextInt();
       
HeapSort ob = new HeapSort();
ob.sort(arr);

System.out.println("Sorted array is");
printArray(arr);
}
}