Search results for: permutation representation
1244 Linear Codes Afforded by the Permutation Representations of Finite Simple Groups and Their Support Designs
Authors: Amin Saeidi
Abstract:
Using a representation-theoretic approach and considering G to be a finite primitive permutation group of degree n, our aim is to determine linear codes of length n that admit G as a permutation automorphism group. We can show that in some cases, every binary linear code admitting G as a permutation automorphism group is a submodule of a permutation module defined by a primitive action of G. As an illustration of the method, we consider the sporadic simple group M₁₁ and the unitary group U(3,3). We also construct some point- and block-primitive 1-designs from the supports of some codewords of the codes in the discussion.Keywords: linear code, permutation representation, support design, simple group
Procedia PDF Downloads 731243 A Genetic Algorithm Based Permutation and Non-Permutation Scheduling Heuristics for Finite Capacity Material Requirement Planning Problem
Authors: Watchara Songserm, Teeradej Wuttipornpun
Abstract:
This paper presents a genetic algorithm based permutation and non-permutation scheduling heuristics (GAPNP) to solve a multi-stage finite capacity material requirement planning (FCMRP) problem in automotive assembly flow shop with unrelated parallel machines. In the algorithm, the sequences of orders are iteratively improved by the GA characteristics, whereas the required operations are scheduled based on the presented permutation and non-permutation heuristics. Finally, a linear programming is applied to minimize the total cost. The presented GAPNP algorithm is evaluated by using real datasets from automotive companies. The required parameters for GAPNP are intently tuned to obtain a common parameter setting for all case studies. The results show that GAPNP significantly outperforms the benchmark algorithm about 30% on average.Keywords: capacitated MRP, genetic algorithm, linear programming, automotive industries, flow shop, application in industry
Procedia PDF Downloads 4851242 The Permutation of Symmetric Triangular Equilateral Group in the Cryptography of Private and Public Key
Authors: Fola John Adeyeye
Abstract:
In this paper, we propose a cryptosystem private and public key base on symmetric group Pn and validates its theoretical formulation. This proposed system benefits from the algebraic properties of Pn such as noncommutative high logical, computational speed and high flexibility in selecting key which makes the discrete permutation multiplier logic (DPML) resist to attack by any algorithm such as Pohlig-Hellman. One of the advantages of this scheme is that it explore all the possible triangular symmetries. Against these properties, the only disadvantage is that the law of permutation multiplicity only allow an operation from left to right. Many other cryptosystems can be transformed into their symmetric group.Keywords: cryptosystem, private and public key, DPML, symmetric group Pn
Procedia PDF Downloads 1961241 Automatic Seizure Detection Using Weighted Permutation Entropy and Support Vector Machine
Authors: Noha Seddik, Sherine Youssef, Mohamed Kholeif
Abstract:
The automated epileptic seizure detection research field has emerged in the recent years; this involves analyzing the Electroencephalogram (EEG) signals instead of the traditional visual inspection performed by expert neurologists. In this study, a Support Vector Machine (SVM) that uses Weighted Permutation Entropy (WPE) as the input feature is proposed for classifying normal and seizure EEG records. WPE is a modified statistical parameter of the permutation entropy (PE) that measures the complexity and irregularity of a time series. It incorporates both the mapped ordinal pattern of the time series and the information contained in the amplitude of its sample points. The proposed system utilizes the fact that entropy based measures for the EEG segments during epileptic seizure are lower than in normal EEG.Keywords: electroencephalogram (EEG), epileptic seizure detection, weighted permutation entropy (WPE), support vector machine (SVM)
Procedia PDF Downloads 3621240 Search for APN Permutations in Rings ℤ_2×ℤ_2^k
Authors: Daniel Panario, Daniel Santana de Freitas, Brett Stevens
Abstract:
Almost Perfect Nonlinear (APN) permutations with optimal resistance against differential cryptanalysis can be found in several domains. The permutation used in the standard for symmetric cryptography (the AES), for example, is based on a special kind of inversion in GF(28). Although very close to APN (2-uniform), this permutation still contains one number 4 in its differential spectrum, which means that, rigorously, it must be classified as 4-uniform. This fact motivates the search for fully APN permutations in other domains of definition. The extremely high complexity associated to this kind of problem precludes an exhaustive search for an APN permutation with 256 elements to be performed without the support of a suitable mathematical structure. On the other hand, in principle, there is nothing to indicate which mathematically structured domains can effectively help the search, and it is necessary to test several domains. In this work, the search for APN permutations in rings ℤ2×ℤ2k is investigated. After a full, exhaustive search with k=2 and k=3, all possible APN permutations in those rings were recorded, together with their differential profiles. Some very promising heuristics in these cases were collected so that, when used as a basis to prune backtracking for the same search in ℤ2×ℤ8 (search space with size 16! ≅244), just a few tenths of a second were enough to produce an APN permutation in a single CPU. Those heuristics were empirically extrapolated so that they could be applied to a backtracking search for APNs over ℤ2×ℤ16 (search space with size 32! ≅2117). The best permutations found in this search were further refined through Simulated Annealing, with a definition of neighbors suitable to this domain. The best result produced with this scheme was a 3-uniform permutation over ℤ2×ℤ16 with only 24 values equal to 3 in the differential spectrum (all the other 968 values were less than or equal 2, as it should be the case for an APN permutation). Although far from being fully APN, this result is technically better than a 4-uniform permutation and demanded only a few seconds in a single CPU. This is a strong indication that the use of mathematically structured domains, like the rings described in this work, together with heuristics based on smaller cases, can lead to dramatic cuts in the computational resources involved in the complexity of the search for APN permutations in extremely large domains.Keywords: APN permutations, heuristic searches, symmetric cryptography, S-box design
Procedia PDF Downloads 1521239 An Efficient Separation for Convolutive Mixtures
Authors: Salah Al-Din I. Badran, Samad Ahmadi, Dylan Menzies, Ismail Shahin
Abstract:
This paper describes a new efficient blind source separation method; in this method we use a non-uniform filter bank and a new structure with different sub-bands. This method provides a reduced permutation and increased convergence speed comparing to the full-band algorithm. Recently, some structures have been suggested to deal with two problems: reducing permutation and increasing the speed of convergence of the adaptive algorithm for correlated input signals. The permutation problem is avoided with the use of adaptive filters of orders less than the full-band adaptive filter, which operate at a sampling rate lower than the sampling rate of the input signal. The decomposed signals by analysis bank filter are less correlated in each sub-band than the input signal at full-band, and can promote better rates of convergence.Keywords: Blind source separation, estimates, full-band, mixtures, sub-band
Procedia PDF Downloads 4401238 Electroencephalography (EEG) Analysis of Alcoholic and Control Subjects Using Multiscale Permutation Entropy
Authors: Lal Hussain, Wajid Aziz, Sajjad Ahmed Nadeem, Saeed Arif Shah, Abdul Majid
Abstract:
Brain electrical activity as reflected in Electroencephalography (EEG) have been analyzed and diagnosed using various techniques. Among them, complexity measure, nonlinearity, disorder, and unpredictability play vital role due to the nonlinear interconnection between functional and anatomical subsystem emerged in brain in healthy state and during various diseases. There are many social and economical issues of alcoholic abuse as memory weakness, decision making, impairments, and concentrations etc. Alcoholism not only defect the brains but also associated with emotional, behavior, and cognitive impairments damaging the white and gray brain matters. A recently developed signal analysis method i.e. Multiscale Permutation Entropy (MPE) is proposed to estimate the complexity of long-range temporal correlation time series EEG of Alcoholic and Control subjects acquired from University of California Machine Learning repository and results are compared with MSE. Using MPE, coarsed grained series is first generated and the PE is computed for each coarsed grained time series against the electrodes O1, O2, C3, C4, F2, F3, F4, F7, F8, Fp1, Fp2, P3, P4, T7, and T8. The results computed against each electrode using MPE gives higher significant values as compared to MSE as well as mean rank differences accordingly. Likewise, ROC and Area under the ROC also gives higher separation against each electrode using MPE in comparison to MSE.Keywords: electroencephalogram (EEG), multiscale permutation entropy (MPE), multiscale sample entropy (MSE), permutation entropy (PE), mann whitney test (MMT), receiver operator curve (ROC), complexity measure
Procedia PDF Downloads 4871237 A General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem
Authors: G. M. Komaki, S. Mobin, E. Teymourian, S. Sheikh
Abstract:
This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attention and due to NP-Hard nature of the problem, metaheuristic algorithms have been proposed to tackle it. Majority of the proposed algorithms require large computational time which is the main drawback. In this study, a general variable neighborhood search algorithm (GVNS) is proposed where several time-saving schemes have been incorporated into it. Also, the GVNS uses the sophisticated method to change the shaking procedure or perturbation depending on the progress of the incumbent solution to prevent stagnation of the search. The performance of the proposed algorithm is compared to the state-of-the-art algorithms based on standard benchmark instances.Keywords: distributed permutation flow shop, scheduling, makespan, general variable neighborhood search algorithm
Procedia PDF Downloads 3481236 The Representation of J. D. Salinger’s Views on Changes in American Society in the 1940s in The Catcher in the Rye
Authors: Jessadaporn Achariyopas
Abstract:
The objectives of this study aim to analyze both the protagonist in The Catcher in the Rye in terms of ideological concepts and narrative techniques which influence the construction of the representation and the relationship between the representation and J. D. Salinger’s views on changes in American society in the 1940s. This area of study might concern two theories: namely, a theory of representation and narratology. In addition, this research is intended to answer the following three questions. Firstly, how is the production of meaning through language in The Catcher in the Rye constructed? Secondly, what are J. D. Salinger’s views on changes in American society in the 1940s? Lastly, how is the relationship between the representation and J. D. Salinger’s views? The findings showed that the protagonist’s views, J. D. Salinger’s views, and changes in American society in the 1940s are obviously interrelated. The production of meaning which is the representation of the protagonist’s views was constructed of narrative techniques. J. D. Salinger’s views on changes in American society in the 1940s were the same antisocial perspectives as Holden Caulfield’s which are phoniness, alienation and meltdown.Keywords: representation, construction of the representation, systems of representation, phoniness, alienation, meltdown
Procedia PDF Downloads 3091235 Innovative Pictogram Chinese Characters Representation
Authors: J. H. Low, S. H. Hew, C. O. Wong
Abstract:
This paper proposes an innovative approach to represent the pictogram Chinese characters. The advantage of this representation is using an extraordinary to represent the pictogram Chinese character. This extraordinary representation is created accordingly to the original pictogram Chinese characters revolution. The purpose of this innovative creation is to assistant the learner learning Chinese as second language (SCL) in Chinese language learning specifically on memorize Chinese characters. Commonly, the SCL will give up and frustrate easily while memorize the Chinese characters by rote. So, our innovative representation is able to help on memorize the Chinese character by the help of visually storytelling. This innovative representation enhances the Chinese language learning experience of SCL.Keywords: Chinese e-learning, innovative Chinese character representation, knowledge management, language learning
Procedia PDF Downloads 4791234 Mathematical Model That Using Scrambling and Message Integrity Methods in Audio Steganography
Authors: Mohammed Salem Atoum
Abstract:
The success of audio steganography is to ensure imperceptibility of the embedded message in stego file and withstand any form of intentional or un-intentional degradation of message (robustness). Audio steganographic that utilized LSB of audio stream to embed message gain a lot of popularity over the years in meeting the perceptual transparency, robustness and capacity. This research proposes an XLSB technique in order to circumvent the weakness observed in LSB technique. Scrambling technique is introduce in two steps; partitioning the message into blocks followed by permutation each blocks in order to confuse the contents of the message. The message is embedded in the MP3 audio sample. After extracting the message, the permutation codebook is used to re-order it into its original form. Md5sum and SHA-256 are used to verify whether the message is altered or not during transmission. Experimental result shows that the XLSB performs better than LSB.Keywords: XLSB, scrambling, audio steganography, security
Procedia PDF Downloads 3601233 A Heuristic Approach for the General Flowshop Scheduling Problem to Minimize the Makespan
Authors: Mohsen Ziaee
Abstract:
Almost all existing researches on the flowshop scheduling problems focus on the permutation schedules and there is insufficient study dedicated to the general flowshop scheduling problems in the literature, since the modeling and solving of the general flowshop scheduling problems are more difficult than the permutation ones, especially for the large-size problem instances. This paper considers the general flowshop scheduling problem with the objective function of the makespan (F//Cmax). We first find the optimal solution of the problem by solving a mixed integer linear programming model. An efficient heuristic method is then presented to solve the problem. An ant colony optimization algorithm is also proposed for the problem. In order to evaluate the performance of the methods, computational experiments are designed and performed. Numerical results show that the heuristic algorithm can result in reasonable solutions with low computational effort and even achieve optimal solutions in some cases.Keywords: scheduling, general flow shop scheduling problem, makespan, heuristic
Procedia PDF Downloads 2011232 An Improved Ant Colony Algorithm for Genome Rearrangements
Authors: Essam Al Daoud
Abstract:
Genome rearrangement is an important area in computational biology and bioinformatics. The basic problem in genome rearrangements is to compute the edit distance, i.e., the minimum number of operations needed to transform one genome into another. Unfortunately, unsigned genome rearrangement problem is NP-hard. In this study an improved ant colony optimization algorithm to approximate the edit distance is proposed. The main idea is to convert the unsigned permutation to signed permutation and evaluate the ants by using Kaplan algorithm. Two new operations are added to the standard ant colony algorithm: Replacing the worst ants by re-sampling the ants from a new probability distribution and applying the crossover operations on the best ants. The proposed algorithm is tested and compared with the improved breakpoint reversal sort algorithm by using three datasets. The results indicate that the proposed algorithm achieves better accuracy ratio than the previous methods.Keywords: ant colony algorithm, edit distance, genome breakpoint, genome rearrangement, reversal sort
Procedia PDF Downloads 3381231 A Parallel Algorithm for Solving the PFSP on the Grid
Authors: Samia Kouki
Abstract:
Solving NP-hard combinatorial optimization problems by exact search methods, such as Branch-and-Bound, may degenerate to complete enumeration. For that reason, exact approaches limit us to solve only small or moderate size problem instances, due to the exponential increase in CPU time when problem size increases. One of the most promising ways to reduce significantly the computational burden of sequential versions of Branch-and-Bound is to design parallel versions of these algorithms which employ several processors. This paper describes a parallel Branch-and-Bound algorithm called GALB for solving the classical permutation flowshop scheduling problem as well as its implementation on a Grid computing infrastructure. The experimental study of our distributed parallel algorithm gives promising results and shows clearly the benefit of the parallel paradigm to solve large-scale instances in moderate CPU time.Keywords: grid computing, permutation flow shop problem, branch and bound, load balancing
Procedia PDF Downloads 2801230 Non Commutative Lᵖ Spaces as Hilbert Modules
Authors: Salvatore Triolo
Abstract:
We discuss the possibility of extending the well-known Gelfand-Naimark-Segal representation to modules over a C*algebra. We focus our attention on the case of Hilbert modules. We consider, in particular, the problem of the existence of a faithful representation. Non-commutative Lᵖ-spaces are shown to constitute examples of a class of CQ*-algebras. Finally, we have shown that any semisimple proper CQ*-algebra (X, A#), with A# a W*-algebra can be represented as a CQ*-algebra of measurable operators in Segal’s sense.Keywords: Gelfand-Naimark-Segal representation, CQ*-algebras, faithful representation, non-commutative Lᵖ-spaces, operator in Hilbert spaces
Procedia PDF Downloads 2441229 Modeling Generalization in the Acquired Equivalence Paradigm with the Successor Representation
Authors: Troy M. Houser
Abstract:
The successor representation balances flexible and efficient reinforcement learning by learning to predict the future, given the present. As such, the successor representation models stimuli as what future states they lead to. Therefore, two stimuli that are perceptually dissimilar but lead to the same future state will come to be represented more similarly. This is very similar to an older behavioral paradigm -the acquired equivalence paradigm, which measures the generalization of learned associations. Here, we test via computational modeling the plausibility that the successor representation is the mechanism by which people generalize knowledge learned in the acquired equivalence paradigm. Computational evidence suggests that this is a plausible mechanism for acquired equivalence and thus can guide future empirical work on individual differences in associative-based generalization.Keywords: acquired equivalence, successor representation, generalization, decision-making
Procedia PDF Downloads 91228 Hierarchical Piecewise Linear Representation of Time Series Data
Authors: Vineetha Bettaiah, Heggere S. Ranganath
Abstract:
This paper presents a Hierarchical Piecewise Linear Approximation (HPLA) for the representation of time series data in which the time series is treated as a curve in the time-amplitude image space. The curve is partitioned into segments by choosing perceptually important points as break points. Each segment between adjacent break points is recursively partitioned into two segments at the best point or midpoint until the error between the approximating line and the original curve becomes less than a pre-specified threshold. The HPLA representation achieves dimensionality reduction while preserving prominent local features and general shape of time series. The representation permits course-fine processing at different levels of details, allows flexible definition of similarity based on mathematical measures or general time series shape, and supports time series data mining operations including query by content, clustering and classification based on whole or subsequence similarity.Keywords: data mining, dimensionality reduction, piecewise linear representation, time series representation
Procedia PDF Downloads 2721227 The Potential Benefits of Multimedia Information Representation in Enhancing Students’ Critical Thinking and History Reasoning
Authors: Ang Ling Weay, Mona Masood
Abstract:
This paper discusses the potential benefits of an interactive multimedia information representation in enhancing students’ critical thinking aligned with history reasoning in learning history between Secondary School students in Malaysia. Two modes of multimedia information representation implemented which are chronological and thematic information representation. A qualitative study of an unstructured interview was conducted among two history teachers, one history education lecturer, two i-think expert and program trainers and five form 4 secondary school students. The interview was to elicit their opinions on the implementation of thinking maps and interactive multimedia information representation in history learning. The key elements of interactive multimedia (e.g. multiple media, user control, interactivity, and use of timelines and concept maps) were then considered to improve the learning process. Findings of the preliminary investigation reveal that the interactive multimedia information representations have the potential benefits to be implemented as instructional resource in enhancing students’ higher order thinking skills (HOTs). This paper concludes by giving suggestions for future work.Keywords: multimedia information representation, critical thinking, history reasoning, chronological and thematic information representation
Procedia PDF Downloads 3431226 An Application of Graph Theory to The Electrical Circuit Using Matrix Method
Authors: Samai'la Abdullahi
Abstract:
A graph is a pair of two set and so that a graph is a pictorial representation of a system using two basic element nodes and edges. A node is represented by a circle (either hallo shade) and edge is represented by a line segment connecting two nodes together. In this paper, we present a circuit network in the concept of graph theory application and also circuit models of graph are represented in logical connection method were we formulate matrix method of adjacency and incidence of matrix and application of truth table.Keywords: euler circuit and path, graph representation of circuit networks, representation of graph models, representation of circuit network using logical truth table
Procedia PDF Downloads 5511225 Frobenius Manifolds Pairing and Invariant Theory
Authors: Zainab Al-Maamari, Yassir Dinar
Abstract:
The orbit space of an irreducible representation of a finite group is a variety with the ring of invariant polynomials as a coordinate ring. The invariant ring is a polynomial ring if and only if the representation is a reflection representation. Boris Dubrovin shows that the orbits spaces of irreducible real reflection representations acquire the structure of polynomial Frobenius manifolds. Dubrovin's method was also used to construct different examples of Frobenius manifolds on certain reflection representations. By successfully applying Dubrovin’s method on non-polynomial invariant rings of linear representations of dicyclic groups, it gives some results that magnify the relation between invariant theory and Frobenius manifolds.Keywords: invariant ring, Frobenius manifold, inversion, representation theory
Procedia PDF Downloads 921224 Cities Simulation and Representation in Locative Games from the Perspective of Cultural Studies
Authors: B. A. A. Paixão, J. V. B. Gomide
Abstract:
This work aims to analyze the locative structure used by the locative games of the company Niantic. To fulfill this objective, a literature review on the representation and simulation of cities was developed; interviews with Ingress players and playing Ingress. Relating these data, it was possible to deepen the relationship between the virtual and the real to create the simulation of cities and their cultural objects in locative games. Cities representation associates geo-location provided by the Global Positioning System (GPS), with augmented reality and digital image, and provides a new paradigm in the city interaction with its parts and real and virtual world elements, homeomorphic to real world. Bibliographic review of papers related to the representation and simulation study and their application in locative games was carried out and is presented in the present paper. The cities representation and simulation concepts in locative games, and how this setting enables the flow and immersion in urban space, are analyzed. Some examples of games are discussed for this new setting development, which is a mix of real and virtual world. Finally, it was proposed a Locative Structure for electronic games using the concepts of heterotrophic representations and isotropic representations conjoined with immediacy and hypermediacy.Keywords: cities representation, cities simulation, games simulation, immersion, locative games
Procedia PDF Downloads 1991223 On-Screen Disability Delineation and Social Representation: An Evaluation
Authors: Chetna Jaswal, Nishi Srivastava, Ahammedul Kabeer AP, Puja Prasad
Abstract:
We are a culture of mass media consumers and cinema as its integral part has high visibility and potential influence on public attitude towards disability which maintains no sociocultural boundaries but experiences substantial social marginalization. Given the lack of awareness and direct experience with disability, on-screen or film representations can give powerful and memorable definitions for the public that can contribute to framing the perception and attitude change. Social representation refers to common ways of thinking, conceiving about and evaluating social reality. It is a product of collective cognition, common sense and thought system. This study aims at analyzing the representations and narratives of disability in Indian cinema and Hollywood with the help of a conceptual understanding of social representation and its theoretical framework.Keywords: disability, social representation, mainstream cinema, diversity
Procedia PDF Downloads 1631222 Knowledge Representation Based on Interval Type-2 CFCM Clustering
Authors: Lee Myung-Won, Kwak Keun-Chang
Abstract:
This paper is concerned with knowledge representation and extraction of fuzzy if-then rules using Interval Type-2 Context-based Fuzzy C-Means clustering (IT2-CFCM) with the aid of fuzzy granulation. This proposed clustering algorithm is based on information granulation in the form of IT2 based Fuzzy C-Means (IT2-FCM) clustering and estimates the cluster centers by preserving the homogeneity between the clustered patterns from the IT2 contexts produced in the output space. Furthermore, we can obtain the automatic knowledge representation in the design of Radial Basis Function Networks (RBFN), Linguistic Model (LM), and Adaptive Neuro-Fuzzy Networks (ANFN) from the numerical input-output data pairs. We shall focus on a design of ANFN in this paper. The experimental results on an estimation problem of energy performance reveal that the proposed method showed a good knowledge representation and performance in comparison with the previous works.Keywords: IT2-FCM, IT2-CFCM, context-based fuzzy clustering, adaptive neuro-fuzzy network, knowledge representation
Procedia PDF Downloads 3171221 Modification Encryption Time and Permutation in Advanced Encryption Standard Algorithm
Authors: Dalal N. Hammod, Ekhlas K. Gbashi
Abstract:
Today, cryptography is used in many applications to achieve high security in data transmission and in real-time communications. AES has long gained global acceptance and is used for securing sensitive data in various industries but has suffered from slow processing and take a large time to transfer data. This paper suggests a method to enhance Advance Encryption Standard (AES) Algorithm based on time and permutation. The suggested method (MAES) is based on modifying the SubByte and ShiftRrows in the encryption part and modification the InvSubByte and InvShiftRows in the decryption part. After the implementation of the proposal and testing the results, the Modified AES achieved good results in accomplishing the communication with high performance criteria in terms of randomness, encryption time, storage space, and avalanche effects. The proposed method has good randomness to ciphertext because this method passed NIST statistical tests against attacks; also, (MAES) reduced the encryption time by (10 %) than the time of the original AES; therefore, the modified AES is faster than the original AES. Also, the proposed method showed good results in memory utilization where the value is (54.36) for the MAES, but the value for the original AES is (66.23). Also, the avalanche effects used for calculating diffusion property are (52.08%) for the modified AES and (51.82%) percentage for the original AES.Keywords: modified AES, randomness test, encryption time, avalanche effects
Procedia PDF Downloads 2361220 Second Representation of Modules over Commutative Rings
Authors: Jawad Abuhlail, Hamza Hroub
Abstract:
Let R be a commutative ring. Representation theory studies the representation of R-modules as (possibly finite) sums of special types of R-submodules. Here we are interested in a class of R-modules between the class of semisimple R-modules and the class of R-modules that can be written as (possibly finite) sums of secondary R-submodules (we know that every simple R-submodule is secondary). We investigate R-modules which can be written as (possibly finite) sums of second R-submodules (we call those modules second representable). Moreover, we investigate the class of (main) second attached prime ideals related to a module with such representation. We provide sufficient conditions for an R-module M to get a (minimal) second representation. We also found the collection of second attached prime ideals for some types of second representable R-modules, in particular within the class of injective R-modules. As we know that every simple R-submodule is second and every second R-submodule is secondary, we can see the importance of the second representable R-module.Keywords: lifting modules, second attached prime ideals, second representations, secondary representations, semisimple modules, second submodules
Procedia PDF Downloads 1851219 Me and My Selfie: Identity Building Through Self Representation in Social Media
Authors: Revytia Tanera
Abstract:
This research is a pilot study to examine the rise of selfie trend in dealing with individual self representation and identity building in social media. The symbolic interactionism theory is used as the concept of the desired self image, and Cooley’s looking glass-self concept is used to analyze the mechanical reflection of ourselves; how do people perform their “digital self” in social media. In-depth interviews were conducted in the study with a non-random sample who owns a smartphone with a front camera feature and are active in social media. This research is trying to find out whether the selfie trend brings any influence on identity building on each individual. Through analysis of interview results, it can be concluded that people take selfie photos in order to express themselves and to boost their confidence. This study suggests a follow up and more in depth analysis on identity and self representation from various age groups.Keywords: self representation, selfie, social media, symbolic interaction, looking glass-self
Procedia PDF Downloads 2941218 An Assessment of Female Representation in Philippine Cinema in Comparison to American Cinema (1975 to 2020)
Authors: Amanda Julia Binay, Patricia Elise Suarez
Abstract:
Female representation in media is an important subject in the discussion of gender equality, especially in impactful and influential media like film. As the Filipino film industry continues to grow and evolve, the need for analysis on Filipino female representation on screen is imperative. Additionally, there has been limited research made on female representation in the Philippine film scene. Thus, the paper aims to analyze the presence and evolution of female representation in Philippine cinema and compare the findings with that of American films to see how Filipino filmmakers hold their own against the standards of international movements that call for more and better female representation, especially in Hollywood. The participants selected were Filipino and American films released within the years 1975 to 2020 in five (5) year intervals. Twenty (20) critically acclaimed and highest-grossing Filipino films and twenty (20) critically acclaimed and highest-grossing Hollywood films were then subject to the Bechdel and Peirce tests to obtain statistical measures of their female representation. The findings of the study reveal that the presence of female representation in Philippine film history has been consistent and has continued to grow and evolve throughout the years, with strong female leads with vibrant characteristics and diverse stories. However, analysis of female representation regarding American films has shown an extreme lack thereof with more misogynistic, sexist, and limiting ideals. Thus, the study concludes that the state of female representation in Philippine cinema and film industry holds its own when compared to American cinema and film industry and even outperforms it in many aspects of female representation, such as consistent inclusion and depiction of multi-dimensional female leads and female relationships. Hence, the study implies that women’s consistent presence in Philippine cinema mirrors Filipino women’s prominent role in Philippine society and that American cinema must continue to make efforts to change their portrayals of female characters, leads, and relationships to make them more grounded in reality.Keywords: female representation, gender studies, feminism, philippine cinema, American cinema, bechdel test, peirce test, comparative analysis
Procedia PDF Downloads 3541217 Representation of Reality in Nigerian Poetry
Authors: Zainab Abdulkarim
Abstract:
Literature is the study of life, a source of knowledge. It involves the truth about many things in life. Most of these creative artistes most especially the poets are representatives of the voices of the people. These set of artistes have been the critics to all involved in the development of their nation. This paper will examine how Nigerian Poets goes further not just by writing but by showing the different ways the country has been convoluted. This paper intends to show the power and ability literature has in representation. The power is to represent the important values of life. There is no doubt that literature asserts truth. Through the various poems examined in this paper, Nigerian Poets have proved to portray the realities of the nation.Keywords: literature, poets, reality, representation
Procedia PDF Downloads 3051216 Image Transform Based on Integral Equation-Wavelet Approach
Authors: Yuan Yan Tang, Lina Yang, Hong Li
Abstract:
Harmonic model is a very important approximation for the image transform. The harmanic model converts an image into arbitrary shape; however, this mode cannot be described by any fixed functions in mathematics. In fact, it is represented by partial differential equation (PDE) with boundary conditions. Therefore, to develop an efficient method to solve such a PDE is extremely significant in the image transform. In this paper, a novel Integral Equation-Wavelet based method is presented, which consists of three steps: (1) The partial differential equation is converted into boundary integral equation and representation by an indirect method. (2) The boundary integral equation and representation are changed to plane integral equation and representation by boundary measure formula. (3) The plane integral equation and representation are then solved by a method we call wavelet collocation. Our approach has two main advantages, the shape of an image is arbitrary and the program code is independent of the boundary. The performance of our method is evaluated by numerical experiments.Keywords: harmonic model, partial differential equation (PDE), integral equation, integral representation, boundary measure formula, wavelet collocation
Procedia PDF Downloads 5471215 Representation of the Kurdish Opposition: From Periphery to Center
Authors: Songul Miftakhov
Abstract:
This study explores political representation and engagement of Eastern and Southeastern Anatolia regions, known to have dense Kurdish population and referred further to as Eastern region, in the Turkish parliament between 1946 and 1980. Traditional local notables had most of the privileges to be represented given their connectedness with political parties. Traditional local notables integrated into right-wing parties considering political and economic aspects. At the same time, they kept control over local political involvement channels. As a result, political representation and presence were monopolized at central, local and civil society levels. One part of Kurdish intellectuals was marginalized from the parliament after addressing issues in Eastern Anatolia and trying to develop solutions apart from the mainstream. Some of them took part in Kurdish oppositional left wing in the 1960s and jounced power of settled notables in 1970s in local administrations or as independent members of the parliament.Keywords: Kurdish representation, parliament, local nobles, Eastern and Southeastern Anatolia
Procedia PDF Downloads 151