Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 1195

Search results for: rough sets

1195 Using Gene Expression Programming in Learning Process of Rough Neural Networks

Authors: Sanaa Rashed Abdallah, Yasser F. Hassan

Abstract:

The paper will introduce an approach where a rough sets, gene expression programming and rough neural networks are used cooperatively for learning and classification support. The Objective of gene expression programming rough neural networks (GEP-RNN) approach is to obtain new classified data with minimum error in training and testing process. Starting point of gene expression programming rough neural networks (GEP-RNN) approach is an information system and the output from this approach is a structure of rough neural networks which is including the weights and thresholds with minimum classification error.

Keywords: rough sets, gene expression programming, rough neural networks, classification

Procedia PDF Downloads 241
1194 Nano Generalized Topology

Authors: M. Y. Bakeir

Abstract:

Rough set theory is a recent approach for reasoning about data. It has achieved a large amount of applications in various real-life fields. The main idea of rough sets corresponds to the lower and upper set approximations. These two approximations are exactly the interior and the closure of the set with respect to a certain topology on a collection U of imprecise data acquired from any real-life field. The base of the topology is formed by equivalence classes of an equivalence relation E defined on U using the available information about data. The theory of generalized topology was studied by Cs´asz´ar. It is well known that generalized topology in the sense of Cs´asz´ar is a generalization of the topology on a set. On the other hand, many important collections of sets related with the topology on a set form a generalized topology. The notion of Nano topology was introduced by Lellis Thivagar, which was defined in terms of approximations and boundary region of a subset of an universe using an equivalence relation on it. The purpose of this paper is to introduce a new generalized topology in terms of rough set called nano generalized topology

Keywords: rough sets, topological space, generalized topology, nano topology

Procedia PDF Downloads 344
1193 Frequent Itemset Mining Using Rough-Sets

Authors: Usman Qamar, Younus Javed

Abstract:

Frequent pattern mining is the process of finding a pattern (a set of items, subsequences, substructures, etc.) that occurs frequently in a data set. It was proposed in the context of frequent itemsets and association rule mining. Frequent pattern mining is used to find inherent regularities in data. What products were often purchased together? Its applications include basket data analysis, cross-marketing, catalog design, sale campaign analysis, Web log (click stream) analysis, and DNA sequence analysis. However, one of the bottlenecks of frequent itemset mining is that as the data increase the amount of time and resources required to mining the data increases at an exponential rate. In this investigation a new algorithm is proposed which can be uses as a pre-processor for frequent itemset mining. FASTER (FeAture SelecTion using Entropy and Rough sets) is a hybrid pre-processor algorithm which utilizes entropy and rough-sets to carry out record reduction and feature (attribute) selection respectively. FASTER for frequent itemset mining can produce a speed up of 3.1 times when compared to original algorithm while maintaining an accuracy of 71%.

Keywords: rough-sets, classification, feature selection, entropy, outliers, frequent itemset mining

Procedia PDF Downloads 313
1192 Generalized Rough Sets Applied to Graphs Related to Urban Problems

Authors: Mihai Rebenciuc, Simona Mihaela Bibic

Abstract:

Branch of modern mathematics, graphs represent instruments for optimization and solving practical applications in various fields such as economic networks, engineering, network optimization, the geometry of social action, generally, complex systems including contemporary urban problems (path or transport efficiencies, biourbanism, & c.). In this paper is studied the interconnection of some urban network, which can lead to a simulation problem of a digraph through another digraph. The simulation is made univoc or more general multivoc. The concepts of fragment and atom are very useful in the study of connectivity in the digraph that is simulation - including an alternative evaluation of k- connectivity. Rough set approach in (bi)digraph which is proposed in premier in this paper contribute to improved significantly the evaluation of k-connectivity. This rough set approach is based on generalized rough sets - basic facts are presented in this paper.

Keywords: (bi)digraphs, rough set theory, systems of interacting agents, complex systems

Procedia PDF Downloads 144
1191 Rough Neural Networks in Adapting Cellular Automata Rule for Reducing Image Noise

Authors: Yasser F. Hassan

Abstract:

The reduction or removal of noise in a color image is an essential part of image processing, whether the final information is used for human perception or for an automatic inspection and analysis. This paper describes the modeling system based on the rough neural network model to adaptive cellular automata for various image processing tasks and noise remover. In this paper, we consider the problem of object processing in colored image using rough neural networks to help deriving the rules which will be used in cellular automata for noise image. The proposed method is compared with some classical and recent methods. The results demonstrate that the new model is capable of being trained to perform many different tasks, and that the quality of these results is comparable or better than established specialized algorithms.

Keywords: rough sets, rough neural networks, cellular automata, image processing

Procedia PDF Downloads 340
1190 Using Genetic Algorithms and Rough Set Based Fuzzy K-Modes to Improve Centroid Model Clustering Performance on Categorical Data

Authors: Rishabh Srivastav, Divyam Sharma

Abstract:

We propose an algorithm to cluster categorical data named as ‘Genetic algorithm initialized rough set based fuzzy K-Modes for categorical data’. We propose an amalgamation of the simple K-modes algorithm, the Rough and Fuzzy set based K-modes and the Genetic Algorithm to form a new algorithm,which we hypothesise, will provide better Centroid Model clustering results, than existing standard algorithms. In the proposed algorithm, the initialization and updation of modes is done by the use of genetic algorithms while the membership values are calculated using the rough set and fuzzy logic.

Keywords: categorical data, fuzzy logic, genetic algorithm, K modes clustering, rough sets

Procedia PDF Downloads 49
1189 Formulating Rough Approximations in Information Tables with Possibilistic Information

Authors: Michinori Nakata, Hiroshi Sakai

Abstract:

A rough set, which consists of lower and upper approximations, is formulated in information tables containing possibilistic information. First, lower and upper approximations on the basis of possible world semantics in the same way as Lipski did in the field of incomplete databases are shown in order to clarify fundamentals of rough sets under possibilistic information. Possibility and necessity measures are used, as is done in possibilistic databases. As a result, each object has certain and possible membership degrees to lower and upper approximations, which degrees are the lower and upper bounds. Therefore, the degree that the object belongs to lower and upper approximations is expressed by an interval value. And the complementary property linked with the lower and upper approximations holds, as is valid under complete information. Second, the approach based on indiscernibility relations, which is proposed by Dubois and Prade, are extended in three cases. The first case is that objects used to approximate a set of objects are characterized by possibilistic information. The second case is that objects used to approximate a set of objects with possibilistic information are characterized by complete information. The third case is that objects that are characterized by possibilistic information approximate a set of objects with possibilistic information. The extended approach create the same results as the approach based on possible world semantics. This justifies our extension.

Keywords: rough sets, possibilistic information, possible world semantics, indiscernibility relations, lower approximations, upper approximations

Procedia PDF Downloads 253
1188 Combination of Topology and Rough Set for Analysis of Power System Control

Authors: M. Kamel El-Sayed

Abstract:

In this research, we have linked the concept of rough set and topological structure to the creation of a new topological structure that assists in the analysis of the information systems of some electrical engineering issues. We used non-specific information whose boundaries do not have an empty set in the top topological structure is rough set. It is characterized by the fact that it does not contain a large number of elements and facilitates the establishment of rules. We used this structure in reducing the specifications of electrical information systems. We have provided a detailed example of this method illustrating the steps used. This method opens the door to obtaining multiple topologies, each of which uses one of the non-defined groups (rough set) in the overall information system.

Keywords: electrical engineering, information system, rough set, rough topology, topology

Procedia PDF Downloads 349
1187 Single Valued Neutrosophic Hesitant Fuzzy Rough Set and Its Application

Authors: K. M. Alsager, N. O. Alshehri

Abstract:

In this paper, we proposed the notion of single valued neutrosophic hesitant fuzzy rough set, by combining single valued neutrosophic hesitant fuzzy set and rough set. The combination of single valued neutrosophic hesitant fuzzy set and rough set is a powerful tool for dealing with uncertainty, granularity and incompleteness of knowledge in information systems. We presented both definition and some basic properties of the proposed model. Finally, we gave a general approach which is applied to a decision making problem in disease diagnoses, and demonstrated the effectiveness of the approach by a numerical example.

Keywords: single valued neutrosophic fuzzy set, single valued neutrosophic fuzzy hesitant set, rough set, single valued neutrosophic hesitant fuzzy rough set

Procedia PDF Downloads 93
1186 Thermal Contact Resistance of Nanoscale Rough Surfaces

Authors: Ravi Prasher

Abstract:

In nanostructured material thermal transport is dominated by contact resistance. Theoretical models describing thermal transport at interfaces assume perfectly flat surface whereas in reality surfaces can be rough with roughness ranging from sub-nanoscale dimension to micron scale. Here we introduce a model which includes both nanoscale contact mechanics and nanoscale heat transfer for rough nanoscale surfaces. This comprehensive model accounts for the effect of phonon acoustic mismatch, mechanical properties, chemical properties and randomness of the rough surface.

Keywords: adhesion and contact resistance, Kaptiza resistance of rough surfaces, nanoscale thermal transport

Procedia PDF Downloads 262
1185 Application of IF Rough Data on Knowledge Towards Malaria of Rural Tribal Communities in Tripura

Authors: Chhaya Gangwal, R. N. Bhaumik, Shishir Kumar

Abstract:

Handling uncertainty and impreciseness of knowledge appears to be a challenging task in Information Systems. Intuitionistic fuzzy (IF) and rough set theory enhances databases by allowing it for the management of uncertainty and impreciseness. This paper presents a new efficient query optimization technique for the multi-valued or imprecise IF rough database. The usefulness of this technique was illustrated on malaria knowledge from the rural tribal communities of Tripura where most of the information is multi-valued and imprecise. Then, the querying about knowledge on malaria is executed into SQL server to make the implementation of IF rough data querying simpler.

Keywords: intuitionistic fuzzy set, rough set, relational database, IF rough relational database

Procedia PDF Downloads 355
1184 Some New Hesitant Fuzzy Sets Operator

Authors: G. S. Thakur

Abstract:

In this paper, four new operators (O1, O2, O3, O4) are proposed, defined and considered to study the new properties and identities on hesitant fuzzy sets. These operators are useful for different operation on hesitant fuzzy sets. The various theorems are proved using the new operators. The study of the proposed new operators has opened a new area of research and applications.

Keywords: vague sets, hesitant fuzzy sets, intuitionistic fuzzy set, fuzzy sets, fuzzy multisets

Procedia PDF Downloads 196
1183 Application of Granular Computing Paradigm in Knowledge Induction

Authors: Iftikhar U. Sikder

Abstract:

This paper illustrates an application of granular computing approach, namely rough set theory in data mining. The paper outlines the formalism of granular computing and elucidates the mathematical underpinning of rough set theory, which has been widely used by the data mining and the machine learning community. A real-world application is illustrated, and the classification performance is compared with other contending machine learning algorithms. The predictive performance of the rough set rule induction model shows comparative success with respect to other contending algorithms.

Keywords: concept approximation, granular computing, reducts, rough set theory, rule induction

Procedia PDF Downloads 440
1182 Rough Oscillatory Singular Integrals on Rⁿ

Authors: H. M. Al-Qassem, L. Cheng, Y. Pan

Abstract:

In this paper we establish sharp bounds for oscillatory singular integrals with an arbitrary real polynomial phase P. Our kernels are allowed to be rough both on the unit sphere and in the radial direction. We show that the bounds grow no faster than log(deg(P)), which is optimal and was first obtained by Parissis and Papadimitrakis for kernels without any radial roughness. Among key ingredients of our methods are an L¹→L² estimate and extrapolation.

Keywords: oscillatory singular integral, rough kernel, singular integral, Orlicz spaces, Block spaces, extrapolation, L^{p} boundedness

Procedia PDF Downloads 169
1181 Saudi Teachers’ Perceptions of Rough and Tumble Play in Early Learning

Authors: Rana Alghamdi

Abstract:

This study explored teachers’ perceptions of rough-and-tumble (R&T) play in early childhood education in Saudi Arabia. The literature on rough-and-tumble play in Saudi Arabia is limited in scope, and more research is needed to explore teachers’ perceptions on this type of play for early learners. The pertinent literature reveals that R&T play, which includes running, jumping, fighting, wrestling, chasing, pulling, pushing, and climbing, among other rough playful activities, can positively impact learning and development across psychosocial, emotional, and cognitive domains. Teachers’ understanding of R & T play is key, and the attitudes of Saudi early childhood teachers who are responsible for implementing curriculum-based play have not been fully researched. Four early childhood teachers from an urban Saudi preschool participated in the study. The data collected in this study were interpreted through a sociocultural lens. Data sources included in-depth interviews, photo-elicitation interviews, and participant-generated drawings. Three overarching themes emerged: teachers’ concerns about rough-and-tumble play, teachers’ perceptions about the benefits of rough-and-tumble play, and teachers’ expression of gender roles in R & T play as contextualized within Saudi culture. Saudi teachers’ perceptions are discussed in detail, and implications of the findings and recommendations for future research are put forth.

Keywords: rough and tumble play, gender, culture, early childhood, Saudi Arabia

Procedia PDF Downloads 45
1180 A Study of Closed Sets and Maps with Ideals

Authors: Asha Gupta, Ramandeep Kaur

Abstract:

The purpose of this paper is to study a class of closed sets, called generalized pre-closed sets with respect to an ideal (briefly Igp-closed sets), which is an extension of generalized pre-closed sets in general topology. Then, by using these sets, the concepts of Igp- compact spaces along with some classes of maps like continuous and closed maps via ideals have been introduced and analogues of some known results for compact spaces, continuous maps and closed maps in general topology have been obtained.

Keywords: ideal, gp-closed sets, gp-closed maps, gp-continuous maps

Procedia PDF Downloads 132
1179 A Dynamic Solution Approach for Heart Disease Prediction

Authors: Walid Moudani

Abstract:

The healthcare environment is generally perceived as being information rich yet knowledge poor. However, there is a lack of effective analysis tools to discover hidden relationships and trends in data. In fact, valuable knowledge can be discovered from application of data mining techniques in healthcare system. In this study, a proficient methodology for the extraction of significant patterns from the coronary heart disease warehouses for heart attack prediction, which unfortunately continues to be a leading cause of mortality in the whole world, has been presented. For this purpose, we propose to enumerate dynamically the optimal subsets of the reduced features of high interest by using rough sets technique associated to dynamic programming. Therefore, we propose to validate the classification using Random Forest (RF) decision tree to identify the risky heart disease cases. This work is based on a large amount of data collected from several clinical institutions based on the medical profile of patient. Moreover, the experts’ knowledge in this field has been taken into consideration in order to define the disease, its risk factors, and to establish significant knowledge relationships among the medical factors. A computer-aided system is developed for this purpose based on a population of 525 adults. The performance of the proposed model is analyzed and evaluated based on set of benchmark techniques applied in this classification problem.

Keywords: multi-classifier decisions tree, features reduction, dynamic programming, rough sets

Procedia PDF Downloads 347
1178 Application of Soft Sets to Non-Associative Rings

Authors: Inayatur Rehman

Abstract:

Molodtstove developed the theory of soft sets which can be seen as an effective tool to deal with uncertainties. Since the introduction of this concept, the application of soft sets has been restricted to associative algebraic structures (groups, semi groups, associative rings, semi-rings etc.). Acceptably, though the study of soft sets, where the base set of parameters is a commutative structure, has attracted the attention of many researchers for more than one decade. But on the other hand there are many sets which are naturally endowed by two compatible binary operations forming a non-associative ring and we may dig out examples which investigate a non-associative structure in the context of soft sets. Thus it seems natural to apply the concept of soft sets to non-commutative and non-associative structures. In present paper, we make a new approach to apply Molodtsoves notion of soft sets to LA-ring (a class of non-associative ring). We extend the study of soft commutative rings from theoretical aspect.

Keywords: soft sets, LA-rings, soft LA-rings, soft ideals, soft prime ideals, idealistic soft LA-rings, LA-ring homomorphism

Procedia PDF Downloads 374
1177 Sharp Estimates of Oscillatory Singular Integrals with Rough Kernels

Authors: H. Al-Qassem, L. Cheng, Y. Pan

Abstract:

In this paper, we establish sharp bounds for oscillatory singular integrals with an arbitrary real polynomial phase P. Our kernels are allowed to be rough both on the unit sphere and in the radial direction. We show that the bounds grow no faster than log (deg(P)), which is optimal and was first obtained by Parissis and Papadimitrakis for kernels without any radial roughness. Our results substantially improve many previously known results. Among key ingredients of our methods are an L¹→L² sharp estimate and using extrapolation.

Keywords: oscillatory singular integral, rough kernel, singular integral, orlicz spaces, block spaces, extrapolation, L^{p} boundedness

Procedia PDF Downloads 287
1176 Trait of Sales Professionals

Authors: Yuichi Morita, Yoshiteru Nakamori

Abstract:

In car dealer business of Japan, a sale professional is a key factor of company’s success. We hypothesize that, if a corporation knows what is the sales professionals’ trait of its corporation’s business field, it will be easier for a corporation to secure and nurture sales persons effectively. The lean human resources management will ensure business success and good performance of corporations, especially small and medium ones. The goal of the paper is to determine the traits of sales professionals for small-and medium-size car dealers, using chi-square test and the variable rough set model. As a result, the results illustrate that experience of job change, learning ability and product knowledge are important, and an academic background, building a career with internal transfer, experience of the leader and self-development are not important to be a sale professional. Also, we illustrate sales professionals’ traits are persistence, humility, improvisation and passion at business.

Keywords: traits of sales professionals, variable precision rough sets theory, sales professional, sales professionals

Procedia PDF Downloads 311
1175 Parallel Fuzzy Rough Support Vector Machine for Data Classification in Cloud Environment

Authors: Arindam Chaudhuri

Abstract:

Classification of data has been actively used for most effective and efficient means of conveying knowledge and information to users. The prima face has always been upon techniques for extracting useful knowledge from data such that returns are maximized. With emergence of huge datasets the existing classification techniques often fail to produce desirable results. The challenge lies in analyzing and understanding characteristics of massive data sets by retrieving useful geometric and statistical patterns. We propose a supervised parallel fuzzy rough support vector machine (PFRSVM) for data classification in cloud environment. The classification is performed by PFRSVM using hyperbolic tangent kernel. The fuzzy rough set model takes care of sensitiveness of noisy samples and handles impreciseness in training samples bringing robustness to results. The membership function is function of center and radius of each class in feature space and is represented with kernel. It plays an important role towards sampling the decision surface. The success of PFRSVM is governed by choosing appropriate parameter values. The training samples are either linear or nonlinear separable. The different input points make unique contributions to decision surface. The algorithm is parallelized with a view to reduce training times. The system is built on support vector machine library using Hadoop implementation of MapReduce. The algorithm is tested on large data sets to check its feasibility and convergence. The performance of classifier is also assessed in terms of number of support vectors. The challenges encountered towards implementing big data classification in machine learning frameworks are also discussed. The experiments are done on the cloud environment available at University of Technology and Management, India. The results are illustrated for Gaussian RBF and Bayesian kernels. The effect of variability in prediction and generalization of PFRSVM is examined with respect to values of parameter C. It effectively resolves outliers’ effects, imbalance and overlapping class problems, normalizes to unseen data and relaxes dependency between features and labels. The average classification accuracy for PFRSVM is better than other classifiers for both Gaussian RBF and Bayesian kernels. The experimental results on both synthetic and real data sets clearly demonstrate the superiority of the proposed technique.

Keywords: FRSVM, Hadoop, MapReduce, PFRSVM

Procedia PDF Downloads 419
1174 Investigation of Heat Transfer by Natural Convection in an Open Channel

Authors: Mahmoud S. Ahmed, Hany A. Mohamed, Mohamed A. Omara, Mohamed F. Abdeen

Abstract:

Experimental study of natural convection heat transfer inside smooth and rough surfaces of vertical and inclined equilateral triangular channels of different inclination angles with a uniformly heated surface are performed. The inclination angle is changed from 15º to 90º. Smooth and rough surface of average roughness (0.02 mm) are used and their effect on the heat transfer characteristics are studied. The local and average heat transfer coefficients and Nusselt number are obtained for smooth and rough channels at different heat flux values, different inclination angles and different Rayleigh numbers (Ra) 6.48 × 105 ≤ Ra ≤ 4.78 × 106. The results show that the local Nusselt number decreases with increase of axial distance from the lower end of the triangular channel to a point near the upper end of channel, and then, it slightly increases. Higher values of local Nusselt number for rough channel along the axial distance compared with the smooth channel. The average Nusselt number of rough channel is higher than that of smooth channel by about 8.1% for inclined case at θ = 45o and 10% for vertical case. The results obtained are correlated using dimensionless groups for both rough and smooth surfaces of the inclined and vertical triangular channels.

Keywords: natural heat transfer convection, constant heat flux, open channels, heat transfer

Procedia PDF Downloads 314
1173 Pruning Algorithm for the Minimum Rule Reduct Generation

Authors: Sahin Emrah Amrahov, Fatih Aybar, Serhat Dogan

Abstract:

In this paper we consider the rule reduct generation problem. Rule Reduct Generation (RG) and Modified Rule Generation (MRG) algorithms, that are used to solve this problem, are well-known. Alternative to these algorithms, we develop Pruning Rule Generation (PRG) algorithm. We compare the PRG algorithm with RG and MRG.

Keywords: rough sets, decision rules, rule induction, classification

Procedia PDF Downloads 435
1172 Hardware Implementation on Field Programmable Gate Array of Two-Stage Algorithm for Rough Set Reduct Generation

Authors: Tomasz Grzes, Maciej Kopczynski, Jaroslaw Stepaniuk

Abstract:

The rough sets theory developed by Prof. Z. Pawlak is one of the tools that can be used in the intelligent systems for data analysis and processing. Banking, medicine, image recognition and security are among the possible fields of utilization. In all these fields, the amount of the collected data is increasing quickly, but with the increase of the data, the computation speed becomes the critical factor. Data reduction is one of the solutions to this problem. Removing the redundancy in the rough sets can be achieved with the reduct. A lot of algorithms of generating the reduct were developed, but most of them are only software implementations, therefore have many limitations. Microprocessor uses the fixed word length, consumes a lot of time for either fetching as well as processing of the instruction and data; consequently, the software based implementations are relatively slow. Hardware systems don’t have these limitations and can process the data faster than a software. Reduct is the subset of the decision attributes that provides the discernibility of the objects. For the given decision table there can be more than one reduct. Core is the set of all indispensable condition attributes. None of its elements can be removed without affecting the classification power of all condition attributes. Moreover, every reduct consists of all the attributes from the core. In this paper, the hardware implementation of the two-stage greedy algorithm to find the one reduct is presented. The decision table is used as an input. Output of the algorithm is the superreduct which is the reduct with some additional removable attributes. First stage of the algorithm is calculating the core using the discernibility matrix. Second stage is generating the superreduct by enriching the core with the most common attributes, i.e., attributes that are more frequent in the decision table. Described above algorithm has two disadvantages: i) generating the superreduct instead of reduct, ii) additional first stage may be unnecessary if the core is empty. But for the systems focused on the fast computation of the reduct the first disadvantage is not the key problem. The core calculation can be achieved with a combinational logic block, and thus add respectively little time to the whole process. Algorithm presented in this paper was implemented in Field Programmable Gate Array (FPGA) as a digital device consisting of blocks that process the data in a single step. Calculating the core is done by the comparators connected to the block called 'singleton detector', which detects if the input word contains only single 'one'. Calculating the number of occurrences of the attribute is performed in the combinational block made up of the cascade of the adders. The superreduct generation process is iterative and thus needs the sequential circuit for controlling the calculations. For the research purpose, the algorithm was also implemented in C language and run on a PC. The times of execution of the reduct calculation in a hardware and software were considered. Results show increase in the speed of data processing.

Keywords: data reduction, digital systems design, field programmable gate array (FPGA), reduct, rough set

Procedia PDF Downloads 148
1171 Working Memory in Children: The Relationship with Father-Child Rough-and-Tumble Play

Authors: Robinson, E. L., Freeman, E. E.

Abstract:

Over the last few decades, the social movement of involved fatherhood has stimulated a research focus on fathers, leading to an increase in the body of evidence into the paternal contributions to child development. Past research has suggested that rough-and-tumble play, which involves wrestling, chasing and tumbling, is the preferred play type of western fathers. This type of play remains underutilized and underrepresented in child developmental research as it’s perceived to be dangerous or too aggressive. The limited research available has shown a relationship between high quality rough-and-tumble play interactions, lower childhood aggression and improved child emotional regulation. The aim of this study was to examine father-child rough-and-tumble play and assess the impact on cognitive development in children aged 4-7 years. Father-child dyads completed a 10-minute rough-and-tumble play interaction, which consisted of 2 games, at the University of Newcastle. Children then completed the Wechsler Preschool & Primary Scale of Intelligence - Fourth Edition Australian and New Zealand Standardized Edition (WPPSI-IV A&NZ). Fathers reported on their involvement in various caregiving activities and on their child’s development. Analyses revealed that fathers-child play quality was positively related to working memory outcomes in children. Furthermore, the amount of rough-and-tumble play father and child did together on a regular basis was also related to working memory outcomes. While father-child play interactions remain an understudied area of research, this study outlines the importance of examining the paternal play role in children’s cognitive development.

Keywords: children, development, father, executive function

Procedia PDF Downloads 114
1170 Influence of Cucurbitacin-Containing Phytonematicides on Growth of Rough Lemon (Citrus jambhiri)

Authors: Raisibe V. Mathabatha, Phatu W. Mashela, Nehemiah M. Mokgalong

Abstract:

Occasional incidence of phytotoxicity in Nemarioc-BL and Nemafric-AL phytonematicides to crops raises credibility challenges that could negate their registration as commercial products. Responses of plants to phytonematicides are characterized by the existence of stimulation, neutral and inhibition phases, with the mid-point of the former being referred to as the Mean Concentration Stimulation Point (MSCP = Dm + Rh/2). The objective of this study was to determine the MCSP and the overall sensitivity (∑k) of Nemarioc-AL and Nemafric-BL phytonematicides to rough lemon seedling rootstocks using the Curve-fitting Allelochemical Response Dosage (CARD) computer-based model. Two parallel greenhouse experiments were initiated, with seven dilutions of each phytonematicide arranged in a randomised complete block design, replicated nine times. Six-month-old rough lemon seedlings were transplanted into 20-cm-diameter plastic pots, filled with steam-pasteurised river sand (300°C for 3 h) and Hygromix-T growing mixture. Treatments at 0, 2, 4, 8, 16, 32 and 164% dilutions were applied weekly at 300 ml/plant. At 84 days after the treatments, analysis of variance-significant plant variables was subjected to the CARD model to generate appropriate biological indices. Computed MCSP values for Nemarioc-AL and Nemafric-BL phytonematicides on rough lemon were 29 and 38%, respectively, whereas ∑k values were 1 and 0, respectively. At the applied concentrations, rough lemon seedlings were highly sensitive to Nemarioc-AL and Nemafric-BL phytonematicides.

Keywords: crude extracts, cucurbitacins, effective microbes, fruit extracts

Procedia PDF Downloads 92
1169 Reusing of HSS Hacksaw Blades as Rough Machining Tool

Authors: Raja V., Chokkalingam B.

Abstract:

For rough cutting, in many industries and educational institutions using carbon steels or HSS single point cutting tools in center lathe machine. In power hacksaw blades, only the cutter teeth region used to parting off the given material. The portions other than the teeth can be used as a single point cutting tool for rough turning and facing on soft materials. The hardness and Tensile strength of this used Power hacksaw blade is almost same as conventional cutting tools. In this paper, the effect of power hacksaw blades over conventional tool has been compared. Thickness of the blade (1.6 mm) is very small compared to its length and width. Hence, a special tool holding device is designed to hold the tool.

Keywords: hardness, high speed steels, power hacksaw blade, tensile strength

Procedia PDF Downloads 380
1168 A Fuzzy Nonlinear Regression Model for Interval Type-2 Fuzzy Sets

Authors: O. Poleshchuk, E. Komarov

Abstract:

This paper presents a regression model for interval type-2 fuzzy sets based on the least squares estimation technique. Unknown coefficients are assumed to be triangular fuzzy numbers. The basic idea is to determine aggregation intervals for type-1 fuzzy sets, membership functions of whose are low membership function and upper membership function of interval type-2 fuzzy set. These aggregation intervals were called weighted intervals. Low and upper membership functions of input and output interval type-2 fuzzy sets for developed regression models are considered as piecewise linear functions.

Keywords: interval type-2 fuzzy sets, fuzzy regression, weighted interval

Procedia PDF Downloads 233
1167 Nonlinear Flow Behavior and Validity of the Cubic Law in a Rough Fracture

Authors: Kunwar Mrityunjai Sharma, Trilok Nath Singh

Abstract:

The Navier-Stokes equation is used to study nonlinear fluid flow in rough 2D fractures. The major goal is to investigate the influence of inertial flow owing to fracture wall roughness on nonlinear flow behavior. Roughness profiles are developed using Barton's Joint Roughness Coefficient (JRC) and used as fracture walls to assess wall roughness. Four JRC profiles (5, 11, 15, and 19) are employed in the study, where a higher number indicates higher roughness. A parametric study has been performed using varying pressure gradients, and the corresponding Forchheimer number is calculated to observe the nonlinear behavior. The results indicate that the fracture roughness has a significant effect on the onset of nonlinearity. Additionally, the validity of the cubic law is evaluated and observed that it overestimates the flow in rough fractures and should be used with utmost care.

Keywords: fracture flow, nonlinear flow, cubic law, Navier-stokes equation

Procedia PDF Downloads 33
1166 Enhancement in Bactericidal Activity of Hydantoin Based Microsphere from Smooth to Rough

Authors: Rajani Kant Rai, Jayakrishnan Athipet

Abstract:

There have been several attempts to prepare polymers with antimicrobial properties by doping with various N-halamines. Hydantoins (Cyclic N-halamine) is of importance due to their stability rechargeable chloroamide function, broad-spectrum anti-microbial action and ability to prevent resistance to the organisms. Polymerizable hydantoins are synthesized by tethering vinyl moieties to 5,5,-dialkyl hydantoin sacrificing the imide hydrogen in the molecule thereby restricting the halogen capture only to the amide nitrogen that results in compromised antibacterial activity. In order to increase the activity of the antimicrobial polymer, we have developed a scheme to maximize the attachment of chlorine to the amide and the imide moieties of hydantoin. Vinyl hydantoin monomer, (Z)-5-(4-((3-methylbuta-1,3-dien-2-yl)oxy)benzylidene)imidazolidine-2,4-dione (MBBID) was synthesized and copolymerized with a commercially available monomer, methyl methacrylate, by free radical polymerization. The antimicrobial activity of hydantoin is strongly dependent on their surface area and hence their microbial activity increases when incorporated in microspheres or nanoparticles as compared to their bulk counterpart. In this regard, smooth and rough surface microsphere of the vinyl monomer (MBBID) with commercial monomer was synthesized. The oxidative chlorine content of the copolymer ranged from 1.5 to 2.45 %. Further, to demonstrate the water purification potential, the thin column was packed with smooth or rough microspheres and challenged with simulated contaminated water that exhibited 6 log kill (total kill) of the bacteria in 20 minutes of exposure with smooth (25 mg/ml) and rough microsphere (15.0 mg/ml).

Keywords: cyclic N-halamine, vinyl hydantoin monomer, rough surface microsphere, simulated contaminated water

Procedia PDF Downloads 80