Search results for: automorphism group
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 1441

Search results for: automorphism group

1441 BIBD-s for (13, 5, 5), (16, 6, 5) and (21, 6, 4) Possessing Possibly an Automorphism of Order 3

Authors: Ivica Martinjak, Mario-Osvin Pavcevic

Abstract:

When trying to enumerate all BIBD-s for given parameters, their natural solution space appears to be huge and grows extremely with the number of points of the design. Therefore, constructive enumerations are often carried out by assuming additional constraints on design-s structure, automorphisms being mostly used ones. It remains a hard task to construct designs with trivial automorphism group – those with no additional symmetry – although it is believed that most of the BIBD-s belong to that case. In this paper, very many new designs with parameters 2-(13, 5, 5), 2-(16, 6, 5) and 2-(21, 6, 4) are constructed, assuming an action of an automorphism of order 3. Even more, it was possible to construct millions of such designs with no non-trivial automorphisms.

Keywords: BIBD, incidence matrix, automorphism group, tactical decomposition, deterministic algorithm.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1260
1440 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 1972
1439 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 614
1438 A Hamiltonian Decomposition of 5-star

Authors: Walter Hussak, Heiko Schröder

Abstract:

Star graphs are Cayley graphs of symmetric groups of permutations, with transpositions as the generating sets. A star graph is a preferred interconnection network topology to a hypercube for its ability to connect a greater number of nodes with lower degree. However, an attractive property of the hypercube is that it has a Hamiltonian decomposition, i.e. its edges can be partitioned into disjoint Hamiltonian cycles, and therefore a simple routing can be found in the case of an edge failure. The existence of Hamiltonian cycles in Cayley graphs has been known for some time. So far, there are no published results on the much stronger condition of the existence of Hamiltonian decompositions. In this paper, we give a construction of a Hamiltonian decomposition of the star graph 5-star of degree 4, by defining an automorphism for 5-star and a Hamiltonian cycle which is edge-disjoint with its image under the automorphism.

Keywords: interconnection networks, paths and cycles, graphs andgroups.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1698
1437 A Fragile Watermarking Scheme for Color Image Authentication

Authors: M. Hamad Hassan, S.A.M. Gilani

Abstract:

In this paper, a fragile watermarking scheme is proposed for color image specified object-s authentication. The color image is first transformed from RGB to YST color space, suitable for watermarking the color media. The T channel corresponds to the chrominance component of a color image andYS ÔèÑ T , therefore selected for embedding the watermark. The T channel is first divided into 2×2 non-overlapping blocks and the two LSBs are set to zero. The object that is to be authenticated is also divided into 2×2 nonoverlapping blocks and each block-s intensity mean is computed followed by eight bit encoding. The generated watermark is then embedded into T channel randomly selected 2×2 block-s LSBs using 2D-Torus Automorphism. Selection of block size is paramount for exact localization and recovery of work. The proposed scheme is blind, efficient and secure with ability to detect and locate even minor tampering applied to the image with full recovery of original work. The quality of watermarked media is quite high both subjectively and objectively. The technique is suitable for class of images with format such as gif, tif or bitmap.

Keywords: Image Authentication, LSBs, PSNR, 2D-Torus Automorphism, YST Color Space.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1842
1436 Skew Cyclic Codes over Fq+uFq+…+uk-1Fq

Authors: Jing Li, Xiuli Li

Abstract:

This paper studies a special class of linear codes, called skew cyclic codes, over the ring R= Fq+uFq+…+uk-1Fq, where q is a prime power. A Gray map ɸ from R to Fq and a Gray map ɸ' from Rn to Fnq are defined, as well as an automorphism Θ over R. It is proved that the images of skew cyclic codes over R under map ɸ' and Θ are cyclic codes over Fq, and they still keep the dual relation.

Keywords: Skew cyclic code, gray map, automophism, cyclic code.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1030
1435 A Social Decision Support Mechanism for Group Purchasing

Authors: Lien-Fa Lin, Yung-Ming Li, Fu-Shun Hsieh

Abstract:

With the advancement of information technology and development of group commerce, people have obviously changed in their lifestyle. However, group commerce faces some challenging problems. The products or services provided by vendors do not satisfactorily reflect customers’ opinions, so that the sale and revenue of group commerce gradually become lower. On the other hand, the process for a formed customer group to reach group-purchasing consensus is time-consuming and the final decision is not the best choice for each group members. In this paper, we design a social decision support mechanism, by using group discussion message to recommend suitable options for group members and we consider social influence and personal preference to generate option ranking list. The proposed mechanism can enhance the group purchasing decision making efficiently and effectively and venders can provide group products or services according to the group option ranking list.

Keywords: Social network, group decision, text mining, group commerce.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1348
1434 A Weighted Group EI Incorporating Role Information for More Representative Group EI Measurement

Authors: Siyu Wang, Anthony Ward

Abstract:

Emotional intelligence (EI) is a well-established personal characteristic. It has been viewed as a critical factor which can influence an individual's academic achievement, ability to work and potential to succeed. When working in a group, EI is fundamentally connected to the group members' interaction and ability to work as a team. The ability of a group member to intelligently perceive and understand own emotions (Intrapersonal EI), to intelligently perceive and understand other members' emotions (Interpersonal EI), and to intelligently perceive and understand emotions between different groups (Cross-boundary EI) can be considered as Group emotional intelligence (Group EI). In this research, a more representative Group EI measurement approach, which incorporates the information of the composition of a group and an individual’s role in that group, is proposed. To demonstrate the claim of being more representative Group EI measurement approach, this study adopts a multi-method research design, involving a combination of both qualitative and quantitative techniques to establish a metric of Group EI. From the results, it can be concluded that by introducing the weight coefficient of each group member on group work into the measurement of Group EI, Group EI will be more representative and more capable of understanding what happens during teamwork than previous approaches.

Keywords: Emotional intelligence, EI, Group EI, multi-method research, teamwork.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 572
1433 Privacy Threats in RFID Group Proof Schemes

Authors: HyoungMin Ham, JooSeok Song

Abstract:

RFID tag is a small and inexpensive microchip which is capable of transmitting unique identifier through wireless network in a short distance. If a group of RFID tags can be scanned simultaneously by one reader, RFID Group proof could be generated. Group proof can be used in various applications, such as good management which is usually achieved using barcode system. A lot of RFID group proof schemes have been proposed by many researchers. In this paper, we introduce some existing group proof schemes and then analyze their vulnerabilities to the privacy. Moreover, we propose a new attack model, which threats the privacy of user by tracking tags in a group.

Keywords: grouping proof, privacy, RFID, yoking proof

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1138
1432 Group Key Management Protocols: A Novel Taxonomy

Authors: Yacine Challal, Hamida Seba

Abstract:

Group key management is an important functional building block for any secure multicast architecture. Thereby, it has been extensively studied in the literature. In this paper we present relevant group key management protocols. Then, we compare them against some pertinent performance criteria.

Keywords: Multicast, Security, Group Key Management.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1781
1431 A Taxonomy of Group Key Management Protocols: Issues and Solutions

Authors: Yacine Challal, Abdelmadjid Bouabdallah, Hamida Seba

Abstract:

Group key management is an important functional building block for any secure multicast architecture. Thereby, it has been extensively studied in the literature. In this paper we present relevant group key management protocols. Then, we compare them against some pertinent performance criteria.

Keywords: Multicast, Security, Group Key Management.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1949
1430 Effects of Different Dietary Crude Fiber Levels on the Growth Performance of Finishing Su-Shan Pigs

Authors: Li Bixia, Ren Shouwen, Fu Yanfeng, Tu Feng, Xiaoming Fang, Xueming Wang

Abstract:

The utilization of dietary crude fiber in different breed pigs is not the same. Su-shan pigs are a new breed formed by crossing Taihu pigs and Yorkshire pigs. In order to understand the resistance of Su-shan pigs to dietary crude fiber, 150 Su-shan pigs with 60 kg of average body weight and similar body conditions were allocated to three groups randomly, and there are 50 pigs in each group. The percentages of dietary crude fiber were 8.35%, 9.10%, and 11.39%, respectively. At the end of the experiment, 15 pigs randomly selected from each group were slaughtered. The results showed as follows: average daily gain of the 9.10% group was higher than that of the 8.35% group and the 11.39% group; there was a significant difference between the 9.10% group and the 8.35% group (p < 0.05. Levels of urea nitrogen, total cholesterol and high density lipoprotein in the 9.10% group were significantly higher than those in the 8.35% group and the 11.39% group (p < 0.05). Ratios of meat to fat in the 9.10% group and the 11.39% group were significantly higher than that in the 8.35% group (p < 0.05). Lean percentage of 9.10% group was higher than that of 8.35% group and 11.39% group, but there was no significant difference in three groups (p > 0.05). The weight of small intestine and large intestine in the 11.39% group was higher than that in the 8.35% group, and the 9.10% group and the difference reached a significant level (p < 0.05). In conclusion, increasing dietary crude fiber properly could reduce fat percentage, and improve the ratio of meat to fat of finishing Su-shan pigs. The digestion and metabolism of dietary crude fiber promoted the development of stomach and intestine of finishing Su-shan pig.

Keywords: Su-Shan pigs, dietary crude fiber, growth performance, serum biochemical indexes.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 907
1429 A New Extended Group Mutual Exclusion Algorithm with Low Message Complexity in Distributed Systems

Authors: S. Dehghan, A.M. Rahmani

Abstract:

The group mutual exclusion (GME) problem is an interesting generalization of the mutual exclusion problem. In the group mutual exclusion, multiple processes can enter a critical section simultaneously if they belong to the same group. In the extended group mutual exclusion, each process is a member of multiple groups at the same time. As a result, after the process by selecting a group enter critical section, other processes can select the same group with its belonging group and can enter critical section at the moment, so that it avoids their unnecessary blocking. This paper presents a quorum-based distributed algorithm for the extended group mutual exclusion problem. The message complexity of our algorithm is O(4Q ) in the best case and O(5Q) in the worst case, where Q is a quorum size.

Keywords: Group Mutual Exclusion (GME), Extended GME, Distributed systems.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1477
1428 Design of Middleware for Mobile Group Control in Physical Proximity

Authors: Moon-Tak Oh, Kyung-Min Park, Tae-Eun Yoon, Hoon Choi, Chil-Woo Lee

Abstract:

This paper is about middleware which enables group-user applications on mobile devices in physical proximity to interact with other devices without intervention of a central server. Requirements of the middleware are identified from service usage scenarios, and the functional architecture of the middleware is specified. These requirements include Group Management, Synchronization, and Resource Management. Group Management needs to provide various capabilities to such applications with respect to managing multiple users (e.g., creation of groups, discovery of group or individual users, member join/leave, election of a group manager and service-group association) using D2D communication technology. We designed the middleware for the above requirements on the Android platform.

Keywords: Group user, middleware, mobile service, physical proximity.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1519
1427 Quasi-Permutation Representations for the Group SL(2, q) when Extended by a Certain Group of Order Two

Authors: M. Ghorbany

Abstract:

A square matrix over the complex field with non- negative integral trace is called a quasi-permutation matrix. For a finite group G the minimal degree of a faithful representation of G by quasi-permutation matrices over the rationals and the complex numbers are denoted by q(G) and c(G) respectively. Finally r (G) denotes the minimal degree of a faithful rational valued complex character of C. The purpose of this paper is to calculate q(G), c(G) and r(G) for the group S L(2, q) when extended by a certain group of order two.

Keywords: General linear group, Quasi-permutation

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1028
1426 Combining Mobile Intelligence with Formation Mechanism for Group Commerce

Authors: Lien Fa Lin, Yung Ming Li, Hsin Chen Hsieh

Abstract:

The rise of smartphones brings new concept So-Lo-Mo (social-local-mobile) in mobile commerce area in recent years. However, current So-Lo-Mo services only focus on individual users but not a group of users, and the development of group commerce is not enough to satisfy the demand of real-time group buying and less to think about the social relationship between customers. In this research, we integrate mobile intelligence with group commerce and consider customers' preference, real-time context, and social influence as components in the mechanism. With the support of this mechanism, customers are able to gather near customers with the same potential purchase willingness through mobile devices when he/she wants to purchase products or services to have a real-time group-buying. By matching the demand and supply of mobile group-buying market, this research improves the business value of mobile commerce and group commerce further.

Keywords: Group formation, group commerce, mobile commerce, So-Lo-Mo, social influence.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1377
1425 Improving Students’ Participation in Group Tasks: Case Study of Adama Science and Technology University

Authors: Fiseha M. Guangul, Annissa Muhammed, Aja O. Chikere

Abstract:

Group task is one method to create the conducive environment for the active teaching-learning process. Performing group task with active involvement of students will benefit the students in many ways. However, in most cases all students do not participate actively in the group task, and hence the intended benefits are not acquired. This paper presents the improvements of students’ participation in the group task and learning from the group task by introducing different techniques to enhance students’ participation. For the purpose of this research Carpentry and Joinery II (WT-392) course from Wood Technology Department at Adama Science and Technology University was selected, and five groups were formed. Ten group tasks were prepared and the first five group tasks were distributed to the five groups in the first day without introducing the techniques that are used to enhance participation of students in the group task. On another day, the other five group tasks were distributed to the same groups and various techniques were introduced to enhance students’ participation in the group task. The improvements of students’ learning from the group task after the implementation of the techniques. After implementing the techniques the evaluation showed that significant improvements were obtained in the students’ participation and learning from the group task.

Keywords: Active learning, evaluation method, group task, students participation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 689
1424 Dynamic Authenticated Secure Group Communication

Authors: R. Aparna, B. B. Amberker

Abstract:

Providing authentication for the messages exchanged between group members in addition to confidentiality is an important issue in Secure Group communication. We develop a protocol for Secure Authentic Communication where we address authentication for the group communication scheme proposed by Blundo et al. which only provides confidentiality. Authentication scheme used is a multiparty authentication scheme which allows all the users in the system to send and receive messages simultaneously. Our scheme is secure against colluding malicious parties numbering fewer than k.

Keywords: Secure Group Communication, Secret key, Authentication, Authentication code, Threshold.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1315
1423 Sound Exposure Effects towards Ross Broilers Growth Rate

Authors: Rashidah Ghazali, Herlina Abdul Rahim, Mashitah Shikh Maidin, Shafishuhaza Sahlan, Noramli Abdul Razak

Abstract:

Sound exposure effects have been investigated by broadcasting a group of broilers with sound of Quran verses (Group B) whereas the other group is the control broilers (Group C). The growth rate comparisons in terms of weight and raw meat texture measured by shear force have been investigated. Twenty-seven broilers were randomly selected from each group on Day 24 and weight measurement was carried out every week till the harvest day (Day 39).Group B showed a higher mean weight on Day 24 (1.441 ± 0.013 kg) than Group C. Significant difference in the weight on Day 39 existed for Group B compared to Group C (p < 0.05). However, there was no significant (p >0.05) difference of shear force in the same muscles (breast and drumstick raw meat) of both groups but the shear force of the breast meat for Group B and C broilers was lower (p < 0.05) than that of their drumstick meat. Thus, broadcasting the sound of Quran verses in the coop can be applied to improve the growth rate of broilers for producing better quality poultry.

Keywords: Broilers, sound, shear force, weight.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3083
1422 The Integrated Studies of Infectious Disease Using Mathematical Modeling and Computer Simulation

Authors: R. Kongnuy, E. Naowanich

Abstract:

In this paper we develop and analyze the model for the spread of Leptospirosis by age group in Thailand, between 1997 and 2010 by using mathematical modeling and computer simulation. Leptospirosis is caused by pathogenic spirochetes of the genus Leptospira. It is a zoonotic disease of global importance and an emerging health problem in Thailand. In Thailand, leptospirosis is a reportable disease, the top three age groups are 23.31% in 35-44 years olds group, 22.76% in 25-34 year olds group, 17.60% in 45-54 year olds group from reported leptospirosis between 1997 and 2010, with a peak in 35-44 year olds group. Our paper, the Leptosipirosis transmission by age group in Thailand is studied on the mathematical model. Some analytical and simulation results are presented.

Keywords: Age Group, Equilibrium State, Leptospirosis, Mathematical Modeling.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1576
1421 Parallel Explicit Group Domain Decomposition Methods for the Telegraph Equation

Authors: Kew Lee Ming, Norhashidah Hj. Mohd. Ali

Abstract:

In a previous work, we presented the numerical solution of the two dimensional second order telegraph partial differential equation discretized by the centred and rotated five-point finite difference discretizations, namely the explicit group (EG) and explicit decoupled group (EDG) iterative methods, respectively. In this paper, we utilize a domain decomposition algorithm on these group schemes to divide the tasks involved in solving the same equation. The objective of this study is to describe the development of the parallel group iterative schemes under OpenMP programming environment as a way to reduce the computational costs of the solution processes using multicore technologies. A detailed performance analysis of the parallel implementations of points and group iterative schemes will be reported and discussed.

Keywords: Telegraph equation, explicit group iterative scheme, domain decomposition algorithm, parallelization.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1473
1420 Correspondence Theorem for Anti L-fuzzy Normal Subgroups

Authors: Jian Tang, Yunfei Yao

Abstract:

In this paper the concept of the cosets of an anti Lfuzzy normal subgroup of a group is given. Furthermore, the group G/A of cosets of an anti L-fuzzy normal subgroup A of a group G is shown to be isomorphic to a factor group of G in a natural way. Finally, we prove that if f : G1 -→ G2 is an epimorphism of groups, then there is a one-to-one order-preserving correspondence between the anti L-fuzzy normal subgroups of G2 and those of G1 which are constant on the kernel of f.

Keywords: Group; anti L-fuzzy subgroups; anti L-fuzzy normal subgroups; cosets of an anti L-fuzzy normal subgroup.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1661
1419 Group Invariant Solutions for Radial Jet Having Finite Fluid Velocity at Orifice

Authors: I. Naeem, R. Naz

Abstract:

The group invariant solution for Prandtl-s boundary layer equations for an incompressible fluid governing the flow in radial free, wall and liquid jets having finite fluid velocity at the orifice are investigated. For each jet a symmetry is associated with the conserved vector that was used to derive the conserved quantity for the jet elsewhere. This symmetry is then used to construct the group invariant solution for the third-order partial differential equation for the stream function. The general form of the group invariant solution for radial jet flows is derived. The general form of group invariant solution and the general form of the similarity solution which was obtained elsewhere are the same.

Keywords: Two-dimensional jets, radial jets, group invariant solution.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1408
1418 Oxygen-Interstitials and Group-V Element Doping for p-Type ZnO

Authors: A. M. Gsiea, J. P. Goss, P. R. Briddon, K. M. Etmimi

Abstract:

In realizing devices using ZnO, a key challenge is the production of p-type material. Substitution of oxygen by a group-V impurity is thought to result in deep acceptor levels, but a candidate made up from a complex of a group-V impurity (P, As, Sb) on a Zn site coupled with two vacant Zn sites is widely viewed as a candidate. We show using density-functional simulations that in contrast to such a view, complexes involving oxygen interstitials are energetically more favorable, resulting in group-V impurities coordinated with four, five or six oxygen atoms.

Keywords: DFT, Oxygen, p-Type, ZnO.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2434
1417 Conceptual Overview of Housing Affordability in Selangor, Malaysia

Authors: M. S. Suhaida, N. M. Tawil, N. Hamzah, A. I. Che-Ani, M.M. Tahir

Abstract:

Socioeconomic stability and development of a country, can be describe by housing affordability. It is aimed to ensure the housing provided as one of the key factors that is affordable by every income earner group whether low-income, middle income and high income group. This research carried out is to find out affordability of home ownership level for first medium cost landed-house by the middle-income group in Selangor, Malaysia. It is also hope that it could be seen as able to contribute to the knowledge and understanding on housing affordability level for the middleincome group and variables that influenced the medium income group-s ability to own first medium-cost houses.

Keywords: Residential, Housing Affordability, Middle income.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 4377
1416 A Semi-Fragile Watermarking Scheme for Color Image Authentication

Authors: M. Hamad Hassan, S.A.M. Gilani

Abstract:

In this paper, a semi-fragile watermarking scheme is proposed for color image authentication. In this particular scheme, the color image is first transformed from RGB to YST color space, suitable for watermarking the color media. Each channel is divided into 4×4 non-overlapping blocks and its each 2×2 sub-block is selected. The embedding space is created by setting the two LSBs of selected sub-block to zero, which will hold the authentication and recovery information. For verification of work authentication and parity bits denoted by 'a' & 'p' are computed for each 2×2 subblock. For recovery, intensity mean of each 2×2 sub-block is computed and encoded upto six to eight bits depending upon the channel selection. The size of sub-block is important for correct localization and fast computation. For watermark distribution 2DTorus Automorphism is implemented using a private key to have a secure mapping of blocks. The perceptibility of watermarked image is quite reasonable both subjectively and objectively. Our scheme is oblivious, correctly localizes the tampering and able to recovery the original work with probability of near one.

Keywords: Image Authentication, YST Color Space, Intensity Mean, LSBs, PSNR.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1784
1415 Design of Stable IIR Digital Filters with Specified Group Delay Errors

Authors: Yasunori Sugita, Toshinori Yoshikawa

Abstract:

The design problem of Infinite Impulse Response (IIR) digital filters is usually expressed as the minimization problem of the complex magnitude error that includes both the magnitude and phase information. However, the group delay of the filter obtained by solving such design problem may be far from the desired group delay. In this paper, we propose a design method of stable IIR digital filters with prespecified maximum group delay errors. In the proposed method, the approximation problems of the magnitude-phase and group delay are separately defined, and these two approximation problems are alternately solved using successive projections. As a result, the proposed method can design the IIR filters that satisfy the prespecified allowable errors for not only the complex magnitude but also the group delay by alternately executing the coefficient update for the magnitude-phase and the group delay approximation. The usefulness of the proposed method is verified through some examples.

Keywords: Filter design, Group delay approximation, Stable IIRfilters, Successive projection method.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1509
1414 Effects of Gratitude Practice on Relationship Satisfaction and the Role of Perceived Superiority

Authors: Anomi Bearden, Brooke Goodyear, Alicia Khan

Abstract:

This repeated-measures experiment explored the effects of six weeks of gratitude practice on college students (N = 67) on relationship satisfaction and perceived superiority. Replicating previous research on gratitude practice, it was hypothesized that after consistent gratitude practice, participants in the experimental group (n = 32) would feel increased levels of relationship satisfaction compared to the control group (n = 35). Of particular interest was whether the level of perceived superiority would moderate the effect of gratitude practice on relationship satisfaction. The gratitude group evidenced significantly higher appreciation and marginally higher relationship satisfaction at post-test than the control group (both groups being equal at pre-test). Significant enhancements in gratitude, satisfaction, and feeling both appreciative and appreciated were found in the gratitude group, as well as significant enhancements in gratitude, satisfaction, and feeling appreciated in the control group. Appreciation for one’s partner was the only measure that improved in the gratitude group and not the control group from pre-test to post-test. Perceived superiority did not change significantly from pre-test to post-test in either group, supporting the prevalence and stability of this bias within people’s overall perceptions of their relationships.

Keywords: Gratitude, relationship satisfaction, perceived superiority, partner appreciation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 306
1413 New Explicit Group Newton's Iterative Methods for the Solutions of Burger's Equation

Authors: Tan K. B., Norhashidah Hj. M. Ali

Abstract:

In this article, we aim to discuss the formulation of two explicit group iterative finite difference methods for time-dependent two dimensional Burger-s problem on a variable mesh. For the non-linear problems, the discretization leads to a non-linear system whose Jacobian is a tridiagonal matrix. We discuss the Newton-s explicit group iterative methods for a general Burger-s equation. The proposed explicit group methods are derived from the standard point and rotated point Crank-Nicolson finite difference schemes. Their computational complexity analysis is discussed. Numerical results are given to justify the feasibility of these two proposed iterative methods.

Keywords: Standard point Crank-Nicolson (CN), Rotated point Crank-Nicolson (RCN), Explicit Group (EG), Explicit Decoupled Group (EDG).

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1546
1412 On the Fp-Normal Subgroups of Finite Groups

Authors: Shitian Liu, Deqin Chen

Abstract:

Let G be a finite group, and let F be a formation of finite group. We say that a subgroup H of G is p F -normal in G if there exists a normal subgroup T of G such that HT is a permutable Hall subgroup of G and G G (H

Keywords: Finite group, Fp -normal subgroup, Sylowsubgroup, Maximal subgroup

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1136