GENETIC VARIABILITY AND INTERRELATIONSHIP STUDIES IN GREEN SUPER RICE

Field experiment was executed using 18 GSR (green super rice) lines of rice during Kharif 2015 at Agricultural Research Institute, D.I. Khan, KP, Pakistan. The aims of the study were to screen out genetic variability among GSR lines of rice and to assess heritability and genetic advance and correlation between yield and related attributes. The experiment was laid down in a randomized complete block design with three replications and data on eight production traits were recorded and subjected to various statistical analysis. The results corresponding to analysis of variance revealed significant (P ? 0.01) differences among GSR lines of rice for all the studied traits. The presence of slightly higher phenotypic coefficient of variation than genotypic coefficient of variation indicated the negligible influence of environment on the expression of yield and its component traits. Similarly, the highest heritability (>60%) associated with genetic advance were assessed for all the traits, except panicle length, indicating additive gene action in their inheritance hence, amenable for simple selection. Correlation analysis revealed that paddy yield manifested significant correlation with days to panicle emergence (r=0.57**), panicle length (r=0.53*) and number of filled grains panicle-1 (r=0.63*) hence, ample importance should be given to these traits during selection

Improved parallel mesh generation through dynamic load-balancing

Parallel mesh generation is an important feature of any large distributed memory parallel computational mechanics code due to the need to ensure that (i) there are no sequential bottlenecks in the code, (ii) there is no parallel overhead incurred in partitioning an existing mesh, and (iii) that no single processor is required to have enough local memory to be able to store the entire mesh

Investigating Spam Mass Variations for Detecting Web Spam

In this paper, we investigate variations of Spam Mass for filtering web spam. Firstly, we propose two strategies for designing new variations of the Spam Mass algorithm. Then, we perform experiments among different versions of Spam Mass using WEBSPAM-UK2006 data set. Finally, we show improvement through proposed strategy by up to 1.33 times in recall and 1.02 times in precision over the original version of Spam Mass

Subjectivity Detection through Socio-Linguistic Features

Social media platforms have opened new dimensions within the information retrieval domain leading to a novel concept known as Social Information Retrieval. We argue that the concept of Social Information Retrieval can be extended by augmenting the huge amount of content on the traditional Web with the ever-growing rich Social Web content to increase the information richness of today’s search engines. This paper proposes a subjectivity detection framework which can lead towards a proposed emotion-aware search engine interface. Our proposed method differs from previous subjectivity analysis approaches in that it is the first method that takes into account social features of social media platforms for the subjectivity classification task. Through experimental evaluations, we observe the accuracy of the proposed method to be 86.21% which demonstrates a promising outcome for large-scale application of our proposed subjectivity analysis technique

Source Coding for Synthesizing Correlated Randomness

We consider a scenario wherein two parties Alice and Bob are provided $X_{1}^{n}$ and $X_{2}^{n}$ samples that are IID from a PMF $p_{X_1 X_2}$. Alice and Bob can communicate to Charles over (noiseless) communication links of rate $R_1$ and $R_2$ respectively. Their goal is to enable Charles generate samples $Y^{n}$ such that the triple $(X_{1}^{n},X_{2}^{n},Y^{n})$ has a PMF that is close, in total variation, to $\prod p_{X_1 X_2 Y}$. In addition, the three parties may posses shared common randomness at rate $C$. We address the problem of characterizing the set of rate triples $(R_1,R_2,C)$ for which the above goal can be accomplished. We provide a set of sufficient conditions, i.e., an achievable rate region for this three party setup. Our work also provides a complete characterization of a point-to-point setup wherein Bob is absent and Charles is provided with side-information.Comment: 30 page

Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels

We propose a quantum soft-covering problem for a given general quantum channel and one of its output states, which consists in finding the minimum rank of an input state needed to approximate the given channel output. We then prove a one-shot quantum covering lemma in terms of smooth min-entropies by leveraging decoupling techniques from quantum Shannon theory. This covering result is shown to be equivalent to a coding theorem for rate distortion under a posterior (reverse) channel distortion criterion [Atif, Sohail, Pradhan, arXiv:2302.00625]. Both one-shot results directly yield corollaries about the i.i.d. asymptotics, in terms of the coherent information of the channel. The power of our quantum covering lemma is demonstrated by two additional applications: first, we formulate a quantum channel resolvability problem, and provide one-shot as well as asymptotic upper and lower bounds. Secondly, we provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels, in particular separating for the first time the simultaneous identification capacity from the unrestricted one, proving a long-standing conjecture of the last author.Comment: 29 pages, 3 figures; v2 fixes an error in Definition 6.1 and various typos and minor issues throughou