No abstract

No abstract

No abstract

An exploratory study was conducted in Feni, in southeast Bangladesh, to determine the status and potentials of palm husbandry in the rural economy. A total of 48 households in the study area were interviewed using a semi-structured questionnaire. The farmers were categorized into five groups based on their landholdings. Palms comprised the highest percentage (53%) of homegarden species. The most common palm was betel nut (Areca catechu). This species was distributed over five different geographical sites, of which roadsides were most common. Farmers with medium landholdings had the greatest number of palms. Farmers typically received considerably less compensation than distributors higher in the marketing chain who handled their product. Juice or sap from the wild date palm (Phoenix sylvestris) gave the highest net average profit per liter and annual income per tree. Landless farmers gain the highest proportion of their mean annual income from palm husbandry.

Many metal complexes of Schiff base derived from different amino acids are widely employed as biologically active materials, especially as antibacterial agents. Three new metal [Co(III), Mn(II) and La(III)] complexes with the Schiff base (L) derived from salicylaldehyde and amino acid (methionine) were synthesized and investigated by using various physico-chemical techniques such as elemental analysis, FTIR, UV-visible spectroscopy, magnetic measurement, thermo gravimetric analysis (TGA) and X-ray powder diffraction (XRD) method. From spectral studies, it has been concluded that the synthesized ligand acts as a tetra-dentate molecule, coordinates metal through azomethine nitrogen, sulfur, phenolic oxygen and carboxylate oxygen. UV-visible spectrophotometry showed the characteristic absorption bands corresponding to a square planar geometry for La(III) and Mn(II) metal complexes and tetrahedral geometry for Co(III) complex. The XRD data demonstrated that the manganese and cobalt complexes were crystalline but the lanthanum complex was amorphous in nature. The empirical formula of the synthesized complexes based on analytical data were [Co(C 12 H 13 SNO 3)] (NO 3), [La(C 12 H 13 SNO 3)](Cl)(H 2 O) and [Mn (C 12 H 13 SNO 3)].

The purpose of this paper is to explore the Knowledge Sharing (KS) patterns among the students of the Arts faculty, University of Dhaka (DU). In order to investigate the KS patterns, a structured questionnaire was used which included different parameters such as background information of the respondents, their purpose, frequency, preferred channels, benefits and motivators for Knowledge Sharing. The data were collected from a total number of 372 students and later analysed using SPSS and Microsoft Excel. The study revealed that, majority of the students of the Arts faculty share their knowledge for self-satisfaction. Although, largest numbers of the students also believe knowledge sharing help them to create new knowledge and ideas, while, learning from each other is their prime motivator for KS.

No abstract

Data mining is a relatively new and promising field of computer science. It is used for extracting valuable information or knowledge from large database. Data mining requires searching for frequent patterns from large database. Frequent substructure mining is also denoted by graph mining. Some of the graph mining algorithms were Apriori based and path based. gIndex is more robust algorithm for mining graphs. Given a query graph, this algorithm finds the supergraphs of that query graph from the graph database. gIndex maintains an index of graph database according to discriminative fragments. In this paper, a further improvement over the existing gIndex algorithm is proposed. More information is stored in the index data structure to quickly answer the graph query, discarding the unnecessary graphs. The proposed method in this paper handles sudden change in database graph patterns efficiently and is capable of processing queries in dynamic and evolving database which gIndex can not handle. It also ensures a good running time for processing graph queries.