Search results for: regular term
1223 Commuting Regular Γ-Semiring
Authors: S.Krishnamoorthy, R.Arul Doss
Abstract:
We introduce the notion of commuting regular Γ- semiring and discuss some properties of commuting regular Γ- semiring. We also obtain a necessary and sufficient condition for Γ-semiring to possess commuting regularity.Keywords: Commutative Γ-semiring, Idempotent Γ-semiring, Rectangular Γ-band, Commuting regular Γ-semiring, Clifford Γ-semiring.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 22671222 A Note on Characterization of Regular Γ-Semigroups in terms of (∈,∈ ∨q)-Fuzzy Bi-ideal
Authors: S.K.Sardar, B.Davvaz, S.Kayal, S.K.Majumdar
Abstract:
The purpose of this note is to obtain some properties of (∈,∈ ∨q)- fuzzy bi-ideals in a Γ-semigroup in order to characterize regular and intra-regular Γ-semigroups.Keywords: Regular Γ-semigroup, belong to or quasi-coincident, (∈, ∈ ∨q)-fuzzy subsemigroup, (∈, ∈ ∨q)-fuzzy bi-ideals.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 22251221 Regular Generalized Star Star closed sets in Bitopological Spaces
Authors: K. Kannan, D. Narasimhan, K. Chandrasekhara Rao, R. Ravikumar
Abstract:
The aim of this paper is to introduce the concepts of τ1τ2-regular generalized star star closed sets , τ1τ2-regular generalized star star open sets and study their basic properties in bitopological spaces.
Keywords: τ1τ2-regular closed sets, τ1τ2-regular open sets, τ1τ2-regular generalized closed sets, τ1τ2-regular generalized star closed sets, τ1τ2-regular generalized star star closed sets.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 22131220 Characterization of Monoids by a Generalization of Flatness Property
Authors: Mahdiyeh Abbasi, Akbar Golchin
Abstract:
It is well-known that, using principal weak flatness property, some important monoids are characterized, such as regular monoids, left almost regular monoids, and so on. In this article, we define a generalization of principal weak flatness called GP-Flatness, and will characterize monoids by this property of their right (Rees factor) acts. Also we investigate new classes of monoids called generally regular monoids and generally left almost regular monoids.Keywords: G-left stabilizing, GP-flatness, generally regular, principal weak flatness.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21671219 A Comparison Study of Inspector's Performance between Regular and Complex Tasks
Authors: Santirat Nansaarng, Sittichai Kaewkuekool, Supreeya Siripattanakunkajorn
Abstract:
This research was to study a comparison of inspector-s performance between regular and complex visual inspection task. Visual task was simulated on DVD read control circuit. Inspection task was performed by using computer. Subjects were 10 undergraduate randomly selected and test for 20/20. Then, subjects were divided into two groups, five for regular inspection (control group) and five for complex inspection (treatment group) tasks. Result was showed that performance on regular and complex inspectors was significantly difference at the level of 0.05. Inspector performance on regular inspection was showed high percentage on defects detected by using equal time to complex inspection. This would be indicated that inspector performance was affected by visual inspection task.
Keywords: Visual inspection task, regular and complex task.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 12571218 Restrictedly-Regular Map Representation of n-Dimensional Abstract Polytopes
Authors: Antonio Breda d’Azevedo
Abstract:
Regularity has often been present in the form of regular polyhedra or tessellations; classical examples are the nine regular polyhedra consisting of the five Platonic solids (regular convex polyhedra) and the four Kleper-Poinsot polyhedra. These polytopes can be seen as regular maps. Maps are cellular embeddings of graphs (with possibly multiple edges, loops or dangling edges) on compact connected (closed) surfaces with or without boundary. The n-dimensional abstract polytopes, particularly the regular ones, have gained popularity over recent years. The main focus of research has been their symmetries and regularity. Planification of polyhedra helps its spatial construction, yet it destroys its symmetries. To our knowledge there is no “planification” for n-dimensional polytopes. However we show that it is possible to make a “surfacification” of the n-dimensional polytope, that is, it is possible to construct a restrictedly-marked map representation of the abstract polytope on some surface that describes its combinatorial structures as well as all of its symmetries. We also show that there are infinitely many ways to do this; yet there is one that is more natural that describes reflections on the sides ((n−1)-faces) of n-simplices with reflections on the sides of n-polygons. We illustrate this construction with the 4-tetrahedron (a regular 4-polytope with automorphism group of size 120) and the 4-cube (a regular 4-polytope with automorphism group of size 384).Keywords: Maps, representation, polytopes.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 6661217 Characterizations of Γ-Semirings by Their Cubic Ideals
Authors: Debabrata Mandal
Abstract:
Cubic ideals, cubic bi-ideals and cubic quasi-ideals of a Γ-semiring are introduced and various properties of these ideals are investigated. Among all other results, some characterizations of regular Γ-semirings are achieved.Keywords: Γ-semiring, cubic ideal, normal cubic ideal, cubic bi-ideal, cubic quasi-ideal, cartesian product, regular, intra-regular.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 6241216 Persistence of Termination for Term Rewriting Systems with Ordered Sorts
Authors: Munehiro Iwami
Abstract:
A property is persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property. Zantema showed that termination is persistent for term rewriting systems without collapsing or duplicating rules. In this paper, we show that the Zantema's result can be extended to term rewriting systems on ordered sorts, i.e., termination is persistent for term rewriting systems on ordered sorts without collapsing, decreasing or duplicating rules. Furthermore we give the example as application of this result. Also we obtain that completeness is persistent for this class of term rewriting systems.Keywords: Theory of computing, Model-based reasoning, term rewriting system, termination
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13901215 Some Algebraic Properties of Universal and Regular Covering Spaces
Authors: Ahmet Tekcan
Abstract:
Let X be a connected space, X be a space, let p : X -→ X be a continuous map and let (X, p) be a covering space of X. In the first section we give some preliminaries from covering spaces and their automorphism groups. In the second section we derive some algebraic properties of both universal and regular covering spaces (X, p) of X and also their automorphism groups A(X, p).
Keywords: covering space, universal covering, regular covering, fundamental group, automorphism group.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20231214 The Different Ways to Describe Regular Languages by Using Finite Automata and the Changing Algorithm Implementation
Authors: Abdulmajid Mukhtar Afat
Abstract:
This paper aims at introducing finite automata theory, the different ways to describe regular languages and create a program to implement the subset construction algorithms to convert nondeterministic finite automata (NFA) to deterministic finite automata (DFA). This program is written in c++ programming language. The program reads FA 5tuples from text file and then classifies it into either DFA or NFA. For DFA, the program will read the string w and decide whether it is acceptable or not. If accepted, the program will save the tracking path and point it out. On the other hand, when the automation is NFA, the program will change the Automation to DFA so that it is easy to track and it can decide whether the w exists in the regular language or not.
Keywords: Finite Automata, subset construction DFA, NFA.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19861213 Persistence of Termination for Non-Overlapping Term Rewriting Systems
Authors: Munehiro Iwami
Abstract:
A property is called persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property. In this paper,we show that termination is persistent for non-overlapping term rewriting systems and we give the example as application of this result. Furthermore we obtain that completeness is persistent for non-overlapping term rewriting systems.Keywords: Theory of computing, Model-based reasoning, termrewriting system, termination
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13921212 Awareness and Attitudes of Primary Grade Teachers (1-4thGrade) towards Inclusive Education
Authors: P. Maheshwari, M. Shapurkar
Abstract:
The present research aimed at studying the awareness and attitudes of teachers towards inclusive education. The sample consisted of 60 teachers, teaching in the primary section (1st – 4th) of regular schools affiliated to the SSC board in Mumbai. Sample was selected by Multi-stage cluster sampling technique. A semi-structured self-constructed interview schedule and a self-constructed attitude scale was used to study the awareness of teachers about disability and Inclusive education, and their attitudes towards inclusive education respectively. Themes were extracted from the interview data and quantitative data was analyzed using SPSS package. Results revealed that teachers had some amount of awareness but an inadequate amount of information on disabilities and inclusive education. Disability to most (37) teachers meant “an inability to do something”. The difference between disability and handicap was stated by most as former being cognitive while handicap being physical in nature. With regard to Inclusive education, a large number (46) stated that they were unaware of the term and did not know what it meant. Majority (52) of them perceived maximum challenges for themselves in an inclusive set up, and emphasized on the role of teacher training courses in the area of providing knowledge (49) and training in teaching methodology (53). Although, 83.3% of teachers held a moderately positive attitude towards inclusive education, a large percentage (61.6%) of participants felt that being in inclusive set up would be very challenging for both children with special needs and without special needs. Though, most (49) of the teachers stated that children with special needs should be educated in regular classroom but they further clarified that only those should be in a regular classroom who have physical impairments of mild or moderate degree.
Keywords: Attitudes, awareness, inclusive education, teachers.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 33961211 Pattern Matching Based on Regular Tree Grammars
Authors: Riad S. Jabri
Abstract:
Pattern matching based on regular tree grammars have been widely used in many areas of computer science. In this paper, we propose a pattern matcher within the framework of code generation, based on a generic and a formalized approach. According to this approach, parsers for regular tree grammars are adapted to a general pattern matching solution, rather than adapting the pattern matching according to their parsing behavior. Hence, we first formalize the construction of the pattern matches respective to input trees drawn from a regular tree grammar in a form of the so-called match trees. Then, we adopt a recently developed generic parser and tightly couple its parsing behavior with such construction. In addition to its generality, the resulting pattern matcher is characterized by its soundness and efficient implementation. This is demonstrated by the proposed theory and by the derived algorithms for its implementation. A comparison with similar and well-known approaches, such as the ones based on tree automata and LR parsers, has shown that our pattern matcher can be applied to a broader class of grammars, and achieves better approximation of pattern matches in one pass. Furthermore, its use as a machine code selector is characterized by a minimized overhead, due to the balanced distribution of the cost computations into static ones, during parser generation time, and into dynamic ones, during parsing time.
Keywords: Bottom-up automata, Code selection, Pattern matching, Regular tree grammars, Match trees.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 12691210 Performance Evaluation of Low Density Parity Check Codes
Authors: Othman O. Khalifa, Sheroz khan, Mohamad Zaid, Muhamad Nawawi
Abstract:
This paper mainly about the study on one of the widely used error correcting codes that is Low parity check Codes (LDPC). In this paper, the Regular LDPC code has been discussed The LDPC codes explained in this paper is about the Regular Binary LDPC codes or the Gallager.Keywords: LDPC, channel coding.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 28241209 Using the Transtheoretical Model to Investigate Stages of Change in Regular Volunteer Service among Seniors in Community
Authors: Pei-Ti Hsu, I-Ju Chen, Jeu-Jung Chen, Cheng-Fen Chang, Shiu-Yan Yang
Abstract:
Background: Taiwan now is an aging society. Research on the elderly should not be confined to caring for seniors, but should also be focused on ways to improve health and the quality of life. Senior citizens who participate in volunteer services could become less lonely, have new growth opportunities, and regain a sense of accomplishment. Thus, the question of how to get the elderly to participate in volunteer service is worth exploring. Objective: Apply the Transtheoretical Model to understand stages of change in regular volunteer service and voluntary service behaviour among the seniors. Methods: 1525 adults over the age of 65 from the Renai district of Keelung City were interviewed. The research tool was a self-constructed questionnaire, and individual interviews were conducted to collect data. Then the data was processed and analyzed using the IBM SPSS Statistics 20 (Windows version) statistical software program. Results: In the past six months, research subjects averaged 9.92 days of volunteer services. A majority of these elderly individuals had no intention to change their regular volunteer services. We discovered that during the maintenance stage, the self-efficacy for volunteer services was higher than during all other stages, but self-perceived barriers were less during the preparation stage and action stage. Self-perceived benefits were found to have an important predictive power for those with regular volunteer service behaviors in the previous stage, and self-efficacy was found to have an important predictive power for those with regular volunteer service behaviors in later stages. Conclusions/Implications for Practice: The research results support the conclusion that community nursing staff should group elders based on their regular volunteer services change stages and design appropriate behavioral change strategies.
Keywords: Seniors, stages of change in regular volunteer services, volunteer service behavior, self-efficacy, self-perceived benefits.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19601208 Regular Data Broadcasting Plan with Grouping in Wireless Mobile Environment
Authors: John T. Tsiligaridis
Abstract:
The broadcast problem including the plan design is considered. The data are inserted and numbered at predefined order into customized size relations. The server ability to create a full, regular Broadcast Plan (RBP) with single and multiple channels after some data transformations is examined. The Regular Geometric Algorithm (RGA) prepares a RBP and enables the users to catch their items avoiding energy waste of their devices. Moreover, the Grouping Dimensioning Algorithm (GDA) based on integrated relations can guarantee the discrimination of services with a minimum number of channels. This last property among the selfmonitoring, self-organizing, can be offered by servers today providing also channel availability and less energy consumption by using smaller number of channels. Simulation results are provided.Keywords: Broadcast, broadcast plan, mobile computing, wireless networks, scheduling.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14541207 Optimization of a Three-Term Backpropagation Algorithm Used for Neural Network Learning
Authors: Yahya H. Zweiri
Abstract:
The back-propagation algorithm calculates the weight changes of an artificial neural network, and a two-term algorithm with a dynamically optimal learning rate and a momentum factor is commonly used. Recently the addition of an extra term, called a proportional factor (PF), to the two-term BP algorithm was proposed. The third term increases the speed of the BP algorithm. However, the PF term also reduces the convergence of the BP algorithm, and optimization approaches for evaluating the learning parameters are required to facilitate the application of the three terms BP algorithm. This paper considers the optimization of the new back-propagation algorithm by using derivative information. A family of approaches exploiting the derivatives with respect to the learning rate, momentum factor and proportional factor is presented. These autonomously compute the derivatives in the weight space, by using information gathered from the forward and backward procedures. The three-term BP algorithm and the optimization approaches are evaluated using the benchmark XOR problem.Keywords: Neural Networks, Backpropagation, Optimization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15421206 Fuzzy Bi-ideals in Ternary Semirings
Authors: Kavikumar, Azme Khamis, Young Bae Jun,
Abstract:
The purpose of the present paper is to study the concept of fuzzy bi-ideals in ternary semirings. We give some characterizations of fuzzy bi-ideals. Characterizations of regular ternary semirings are provided.Keywords: Fuzzy ternary subsemiring, fuzzy quasi-ideal, fuzzy bi-ideal, regular ternary semiring
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15711205 Strongly Screenableness and its Tychonoff Products
Authors: Jianjun Wang, Peiyong Zhu
Abstract:
In this paper, we prove that if X is regular strongly screenable DC-like (C-scattered), then X ×Y is strongly screenable for every strongly screenable space Y . We also show that the product i∈ω Yi is strongly screenable if every Yi is a regular strongly screenable DC-like space. Finally, we present that the strongly screenableness are poorly behaved with its Tychonoff products.
Keywords: Topological game, strongly screenable, scattered, Cscattered.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13341204 Inheritance Growth: a Biology Inspired Method to Build Structures in P2P
Authors: Panchalee Sukjit, Herwig Unger
Abstract:
IT infrastructures are becoming more and more difficult. Therefore, in the first industrial IT systems, the P2P paradigm has replaced the traditional client server and methods of self-organization are gaining more and more importance. From the past it is known that especially regular structures like grids may significantly improve the system behavior and performance. This contribution introduces a new algorithm based on a biologic analogue, which may provide the growth of several regular structures on top of anarchic grown P2P- or social network structures.Keywords: P2P, Pattern generation, Grid, Social network, Inheritance, Reproduction
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14641203 1/Sigma Term Weighting Scheme for Sentiment Analysis
Authors: Hanan Alshaher, Jinsheng Xu
Abstract:
Large amounts of data on the web can provide valuable information. For example, product reviews help business owners measure customer satisfaction. Sentiment analysis classifies texts into two polarities: positive and negative. This paper examines movie reviews and tweets using a new term weighting scheme, called one-over-sigma (1/sigma), on benchmark datasets for sentiment classification. The proposed method aims to improve the performance of sentiment classification. The results show that 1/sigma is more accurate than the popular term weighting schemes. In order to verify if the entropy reflects the discriminating power of terms, we report a comparison of entropy values for different term weighting schemes.
Keywords: Sentiment analysis, term weighting scheme, 1/sigma.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 5361202 Long-Term On-Chip Storage and Release of Liquid Reagents for Diagnostic Lab-on-a-Chip Applications
Authors: D. Czurratis, Y. Beyl, S. Zinober, R. Zengerle, F. Lärmer
Abstract:
A new concept for long-term reagent storage for Labon- a-Chip (LoC) devices is described. Here we present a polymer multilayer stack with integrated stick packs for long-term storage of several liquid reagents, which are necessary for many diagnostic applications. Stick packs are widely used in packaging industry for storing solids and liquids for long time. The storage concept fulfills two main requirements: First, a long-term storage of reagents in stick packs without significant losses and interaction with surroundings, second, on demand releasing of liquids, which is realized by pushing a membrane against the stick pack through pneumatic pressure. This concept enables long-term on-chip storage of liquid reagents at room temperature and allows an easy implementation in different LoC devices.
Keywords: Lab-on-a-Chip, long-term storage, reagent storage, stick pack.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 30631201 Characterizations of Ordered Semigroups by (∈,∈ ∨q)-Fuzzy Ideals
Authors: Jian Tang
Abstract:
Let S be an ordered semigroup. In this paper we first introduce the concepts of (∈,∈ ∨q)-fuzzy ideals, (∈,∈ ∨q)-fuzzy bi-ideals and (∈,∈ ∨q)-fuzzy generalized bi-ideals of an ordered semigroup S, and investigate their related properties. Furthermore, we also define the upper and lower parts of fuzzy subsets of an ordered semigroup S, and investigate the properties of (∈,∈ ∨q)-fuzzy ideals of S. Finally, characterizations of regular ordered semigroups and intra-regular ordered semigroups by means of the lower part of (∈ ,∈ ∨q)-fuzzy left ideals, (∈,∈ ∨q)-fuzzy right ideals and (∈,∈ ∨q)- fuzzy (generalized) bi-ideals are given.
Keywords: Ordered semigroup, regular ordered semigroup, intraregular ordered semigroup, (∈, ∈ ∨q)-fuzzy left (right) ideal of an ordered semigroup, (∈, ∈ ∨q)-fuzzy (generalized) bi-ideal of an ordered semigroup.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20161200 Evolutionary Dynamics on Small-World Networks
Authors: Jan Rychtar, Brian Stadler
Abstract:
We study how the outcome of evolutionary dynamics on graphs depends on a randomness on the graph structure. We gradually change the underlying graph from completely regular (e.g. a square lattice) to completely random. We find that the fixation probability increases as the randomness increases; nevertheless, the increase is not significant and thus the fixation probability could be estimated by the known formulas for underlying regular graphs.Keywords: evolutionary dynamics, small-world networks
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 12381199 Influence of Sports Participation on Academic Performance among Afe Babalola University Student-Athletes
Authors: B. O. Diyaolu
Abstract:
The web created by sport in academics has made it difficult for it to be separated from adolescent educational development. The enthusiasm expressed towards sport by students in higher institutions is quite enormous. Primarily, academic performance should be the pride of all students but whether sports affect the academic performance of student-athletes remain an unknown fact. This study investigated the influence of sports participation on academic performance among Afe Babalola University student-athletes. Ex post facto research design was used. Two groups of students were used for the study; Student-athlete (SA) and Regular Students (RS). Purposive sampling technique was used to select 224 student-athletes, only those that are regular in the university sports team training were considered and their records (i.e. name, department, level, matriculation number, and phone number) were collected through the assistance of their coaches. For the regular students, purposive sampling technique was used to select 224 participants, only those that have no interest in sports were considered and their records were retrieved from the college registration officer. The first and second semester examination results of the two groups were compared in 10 general study courses without their knowledge, using descriptive statistics of frequency counts, mean, and standard deviation. Out of the 10 compared courses, 7 courses result showed no significant difference between students-athlete and regular students while student-athletes perform better in 3 practically oriented courses. Sports role in academics is quite significant. Exposure to sports can help build the confidence that athletes need especially when it comes to practical courses. Student-athletes can perform better in academics if the environment is friendly and not intimidating. Lecturers and coaches need to work together in order to build a well cultured and intelligent graduate.
Keywords: Academic performance, regular students, sports participation, student-athlete, university sports team.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15001198 On Q-Fuzzy Ideals in Γ-Semigroups
Authors: Samit Kumar Majumder
Abstract:
In this paper the concept of Q-fuzzification of ideals of Γ-semigroups has been introduced and some important properties have been investigated. A characterization of regular Γ-semigroup in terms of Q-fuzzy ideals has been obtained. Operator semigroups of a Γ-semigroup has been made to work by obtaining various relationships between Q-fuzzy ideals of a Γ-semigroup and that of its operator semigroups.
Keywords: Q-Fuzzy set, Γ-semigroup, Regular Γ-semigroup, Q-Fuzzy left(right) ideal, Operator semigroups.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 28641197 A New Approach for the Fingerprint Classification Based On Gray-Level Co- Occurrence Matrix
Authors: Mehran Yazdi, Kazem Gheysari
Abstract:
In this paper, we propose an approach for the classification of fingerprint databases. It is based on the fact that a fingerprint image is composed of regular texture regions that can be successfully represented by co-occurrence matrices. So, we first extract the features based on certain characteristics of the cooccurrence matrix and then we use these features to train a neural network for classifying fingerprints into four common classes. The obtained results compared with the existing approaches demonstrate the superior performance of our proposed approach.
Keywords: Biometrics, fingerprint classification, gray level cooccurrence matrix, regular texture representation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19671196 Intuitionistic Fuzzy Points in Semigroups
Authors: Sujit Kumar Sardar Manasi Mandal Samit Kumar Majumder
Abstract:
The notion of intuitionistic fuzzy sets was introduced by Atanassov as a generalization of the notion of fuzzy sets. Y.B. Jun and S.Z. Song introduced the notion of intuitionistic fuzzy points. In this paper we find some relations between the intuitionistic fuzzy ideals of a semigroup S and the set of all intuitionistic fuzzy points of S.Keywords: Semigroup, Regular(intra-regular) semigroup, Intuitionistic fuzzy point, Intuitionistic fuzzy subsemigroup, Intuitionistic fuzzy ideal, Intuitionistic fuzzy interior ideal, Intuitionistic fuzzy semiprime ideal, Intuitionistic fuzzy prime ideal.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 18511195 A New Hybrid Model with Passive Congregation for Stock Market Indices Prediction
Authors: Tarek Aboueldahab
Abstract:
In this paper, we propose a new hybrid learning model for stock market indices prediction by adding a passive congregation term to the standard hybrid model comprising Particle Swarm Optimization (PSO) with Genetic Algorithm (GA) operators in training Neural Networks (NN). This new passive congregation term is based on the cooperation between different particles in determining new positions rather than depending on the particles selfish thinking without considering other particles positions, thus it enables PSO to perform both the local and global search instead of only doing the local search. Experiment study carried out on the most famous European stock market indices in both long term and short term prediction shows significantly the influence of the passive congregation term in improving the prediction accuracy compared to standard hybrid model.
Keywords: Global Search, Hybrid Model, Passive Congregation, Stock Market Prediction.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15051194 Long-term Flexural Behavior of HSC Beams
Authors: Andreea Muntean, Cornelia Măgureanu
Abstract:
This article presents the analysis of experimental values regarding cracking pattern, specific strains and deformability for reinforced high strength concrete beams. The beams have the concrete class C80/95 and a longitudinal reinforcement ratio of 2.01%, respectively 3.39%. The elements were subjected to flexure under static short-term and long-term loading. The experimental values are compared with calculation values using the design relationships according to Eurocode 2.
Keywords: High strength concrete, beams, flexure.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1593