Fuzziness means different things depending upon the domain of application and the way it is measured. By
means of fuzzy sets, vague notions can be described mathematically now a vigorous area of research with
manifold applications. It should be mentioned that there are natural ways (not necessarily trivial) to fuzzily
various mathematical structures such as topological spaces, algebraic structure etc. The notion of L-fuzzy sets
later more generalizations were also made using various membership sets and operations. In this section we let F
denote the field of integers module 2, we define a fuzzy code as a fuzzy subset of Fn where Fn = {(a1, ....an | a i
F, i = 1, ...n} and n is a fixed arbitrary positive integers we recall that Fn is a vector space over F. We give an
analysis of the Hamming distance between two fuzzy code words and the error – correcting capability of a code
in terms of its corresponding fuzzy codes. The results appearing in the first part of this section are from [17].
This presentation explains basics of Coding Theory in easy and detailed manner with derivations, explanations and examples. It prepares the users for advance Error Control Codes.
The complexity of promise problems with applications to public-key cryptographyXequeMateShannon
A “promise problem” is a formulation of partial decision problem. Complexity issues about promise problems arise from considerations about cracking problems for public-key cryptosystems. Using a notion of Turing reducibility between promise problems, this paper disproves a conjecture made by Even and Yacobi (1980), that would imply nonexistence of public-key cryptosystems with NP-hard cracking problems. In its place a new conjecture is raised having the same consequence. In addition, the new conjecture implies that NP-complete sets cannot be accepted by Turing machines that have at most one accepting computation for each input word.
This presentation explains basics of Coding Theory in easy and detailed manner with derivations, explanations and examples. It prepares the users for advance Error Control Codes.
The complexity of promise problems with applications to public-key cryptographyXequeMateShannon
A “promise problem” is a formulation of partial decision problem. Complexity issues about promise problems arise from considerations about cracking problems for public-key cryptosystems. Using a notion of Turing reducibility between promise problems, this paper disproves a conjecture made by Even and Yacobi (1980), that would imply nonexistence of public-key cryptosystems with NP-hard cracking problems. In its place a new conjecture is raised having the same consequence. In addition, the new conjecture implies that NP-complete sets cannot be accepted by Turing machines that have at most one accepting computation for each input word.
Random numo Galois Field
Polynomial Arithmetic
Example of Polynomial Arithmetic
bers, its types and usage.
TRNG, PRNG, CHPRNG
Review of BBS
Stream Ciphering
RC4 algorithm
Basic Number Theory
Extended Euclidean Algorithm
Relevance of Extended Euclidean Algorithm
Authentication protocols based on zero knowledge proof (Part 2 - Brief talk)Israel Buitron
Second part of a brief introduction to my PhD research titled "Authentication protocols based on zero knowledge proofs".
This presentation was given in a PhD class.
A Primality test is an algorithm for determining whether an input number is Prime. Among other fields of mathematics, it is used for Cryptography. Factorization is thought to be a computationally difficult problem, whereas primality testing is comparatively easy (its running time is polynomial in the size of the input).
Symmetric Key Generation Algorithm in Linear Block Cipher Over LU Decompositi...ijtsrd
In symmetric key algorithm in linear block cipher to encrypt and decrypt the messages using matrix and inverse matrix. In this proposed technique generate lower and upper triangular matrices from the square matrix using decomposition. In encryption process, the key is a lower triangular matrix and decryption process, the key is upper triangular matrix under modulation of the prime number. We illustrate the proposed technique with help of examples. P.Sundarayya | M.G.Vara Prasad"Symmetric Key Generation Algorithm in Linear Block Cipher Over LU Decomposition Method " Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-4 , June 2017, URL: http://www.ijtsrd.com/papers/ijtsrd90.pdf http://www.ijtsrd.com/computer-science/computer-security/90/symmetric-key-generation-algorithm-in--linear-block-cipher-over-lu-decomposition-method--/psundarayya-
Introduction of info theory basis for image/video coding, especially, entropy, rate-distortion theory,
entropy coding, huffman coding, arithmetic coding
I made this presentation for my class presentation. Sorry if there's some mistakes in my way to explain it... This is about the depth-first search algorithm and this is a paper review...the title of the paper is Self-Stabilizing Depth-First Search
Lattice-Based Cryptography: CRYPTANALYSIS OF COMPACT-LWEPriyanka Aash
Destructive and constructive methods in lattice-based cryptography will be discussed. Topic 1: Cryptanalysis of Compact-LWE Authors: Jonathan Bootle; Mehdi Tibouchi; Keita Xagawa Topic 2: Two-message Key Exchange with Strong Security from Ideal Lattices Authors: Zheng Yang; Yu Chen; Song Luo
(Source: RSA Conference USA 2018)
It presents various approximation schemes including absolute approximation, epsilon approximation and also presents some polynomial time approximation schemes. It also presents some probabilistically good algorithms.
arithmetic and adaptive arithmetic codingAyush Gupta
Data compression techniques in Multimedia and data transmission in digital computers. You can solve the given question on board the solution is on YT. If you search there you'll find it in a few minutes. Hope it'll help you.......
Evaluation of Power Conversion on Heavy Payload Tethered Hexarotors: A Strate...IJERA Editor
This research article addresses the evaluation of power conversion on heavy payload tethered hexarotors where
the payloads are high and hovering times are long. Modifications were added to the power conversion unit based
on operation reliability perspective. Since the objective power conversion is large comparing to existing tethered
UAVs today, a strategic engineering approach was proposed and tested based on partial observations on current
spikes and power thresholds of DCDC switching regulators. Research problem is such that, when UAV motors
are consuming low currents, the current spikes are not the plausible cause of direct power failure. But at higher
currents even small current spikes could cause power failures. Risk increase with time and situations worsen
when UAVs operate under high precision flight controls. When the number of parallel converters are small this
becomes a mission critical problem. As a solution, fast switching high current diodes are used at the low voltage
high current output to block reverse currents, and then apply low voltage bus bar to prevent dependency issues
on particular DCDC module. At the cost of a small power dissipations over diodes, the total current thresholds of
UAV become higher. Experiment results shows that with the use of proposed method large number of paralleling
switching regulators become possible and heavy payload flights become reliable.
Random numo Galois Field
Polynomial Arithmetic
Example of Polynomial Arithmetic
bers, its types and usage.
TRNG, PRNG, CHPRNG
Review of BBS
Stream Ciphering
RC4 algorithm
Basic Number Theory
Extended Euclidean Algorithm
Relevance of Extended Euclidean Algorithm
Authentication protocols based on zero knowledge proof (Part 2 - Brief talk)Israel Buitron
Second part of a brief introduction to my PhD research titled "Authentication protocols based on zero knowledge proofs".
This presentation was given in a PhD class.
A Primality test is an algorithm for determining whether an input number is Prime. Among other fields of mathematics, it is used for Cryptography. Factorization is thought to be a computationally difficult problem, whereas primality testing is comparatively easy (its running time is polynomial in the size of the input).
Symmetric Key Generation Algorithm in Linear Block Cipher Over LU Decompositi...ijtsrd
In symmetric key algorithm in linear block cipher to encrypt and decrypt the messages using matrix and inverse matrix. In this proposed technique generate lower and upper triangular matrices from the square matrix using decomposition. In encryption process, the key is a lower triangular matrix and decryption process, the key is upper triangular matrix under modulation of the prime number. We illustrate the proposed technique with help of examples. P.Sundarayya | M.G.Vara Prasad"Symmetric Key Generation Algorithm in Linear Block Cipher Over LU Decomposition Method " Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-4 , June 2017, URL: http://www.ijtsrd.com/papers/ijtsrd90.pdf http://www.ijtsrd.com/computer-science/computer-security/90/symmetric-key-generation-algorithm-in--linear-block-cipher-over-lu-decomposition-method--/psundarayya-
Introduction of info theory basis for image/video coding, especially, entropy, rate-distortion theory,
entropy coding, huffman coding, arithmetic coding
I made this presentation for my class presentation. Sorry if there's some mistakes in my way to explain it... This is about the depth-first search algorithm and this is a paper review...the title of the paper is Self-Stabilizing Depth-First Search
Lattice-Based Cryptography: CRYPTANALYSIS OF COMPACT-LWEPriyanka Aash
Destructive and constructive methods in lattice-based cryptography will be discussed. Topic 1: Cryptanalysis of Compact-LWE Authors: Jonathan Bootle; Mehdi Tibouchi; Keita Xagawa Topic 2: Two-message Key Exchange with Strong Security from Ideal Lattices Authors: Zheng Yang; Yu Chen; Song Luo
(Source: RSA Conference USA 2018)
It presents various approximation schemes including absolute approximation, epsilon approximation and also presents some polynomial time approximation schemes. It also presents some probabilistically good algorithms.
arithmetic and adaptive arithmetic codingAyush Gupta
Data compression techniques in Multimedia and data transmission in digital computers. You can solve the given question on board the solution is on YT. If you search there you'll find it in a few minutes. Hope it'll help you.......
Evaluation of Power Conversion on Heavy Payload Tethered Hexarotors: A Strate...IJERA Editor
This research article addresses the evaluation of power conversion on heavy payload tethered hexarotors where
the payloads are high and hovering times are long. Modifications were added to the power conversion unit based
on operation reliability perspective. Since the objective power conversion is large comparing to existing tethered
UAVs today, a strategic engineering approach was proposed and tested based on partial observations on current
spikes and power thresholds of DCDC switching regulators. Research problem is such that, when UAV motors
are consuming low currents, the current spikes are not the plausible cause of direct power failure. But at higher
currents even small current spikes could cause power failures. Risk increase with time and situations worsen
when UAVs operate under high precision flight controls. When the number of parallel converters are small this
becomes a mission critical problem. As a solution, fast switching high current diodes are used at the low voltage
high current output to block reverse currents, and then apply low voltage bus bar to prevent dependency issues
on particular DCDC module. At the cost of a small power dissipations over diodes, the total current thresholds of
UAV become higher. Experiment results shows that with the use of proposed method large number of paralleling
switching regulators become possible and heavy payload flights become reliable.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Measuring Robustness on Generalized Gaussian DistributionIJERA Editor
Different from previous work that measured robustness its own distribution, measuring robustness with a robust
estimator on a generalized Gaussian distribution is introduced here. In detail, an unbiased Maximum Likelihood
(ML) variance estimator and a robust variance estimator of the Gaussian distribution with a given censoring
value are applied to the generalized Gaussian distribution that represents Gaussian, Laplace, and Cauchy
distributions; then, Mean Square Error (MSE) is calculated to measure robustness. Afterward, how robustness
changes is shown because the actual distribution varies over the generalized Gaussian distribution. The results
indicate that measuring the MSE of the system can be used to point out how robust the system is when the
system distribution changes.
Optimization of Patrol Manpower Allocation Using Goal Programming Approach -A...IJERA Editor
One of the most difficult tasks of the patrol administrators is allocation of manpower; i.e. determining the. most
effective level of operational manpower for patrol tasks. Typically, administrators resolve the allocation
problem by relying on prior statistical data and by employing subjective analysis. In general, only limited
systematic analyses have been applied to the problem. This thesis presents a non linear goal programming model
for allocating patrolmen to road segments within a patrol region. The model is demonstrated via a case example
of the East section of Visakhapatnam. The results of the model are valuable to the patrol administrator for
considering departmental goals and priority structure, in addition to available historical data, in the assignment
of patrol manpower for a given urban area.
Serviceability behavior of Reinforcement Concrete beams with polypropylene an...IJERA Editor
Serviceability Limit States (SLS) may lead to the design of concrete elements internally reinforced with Fiber Reinforced Polymer (FRP).In many types of concrete structure loss the serviceability due to wide cracks, number of cracks or large deflection is not uncommon behaviour in concrete structures or concrete beams.The flexural ductility affects the serviceability deflection of RC beams once flexural cracking take place.Imprvement will be focused on the use of polypropilene fibres , which is the subject of thispaper. The performance of concrete with fibers is judged by the flexural toughness obtained by load-deflection curves. The flexural toughness of concrete is depend on different types of fibersin use.Its tougness will be reperesent in the behaviour of RC memebres at failure. Sometimes, it is difficult to use the flexural toughness to judge the behavior of concrete structures under service load. The result of cracking on concrete beam due to the applied load and the method of loading to monitor and check the performance of concrete with different types of fiber arediscussed in this paper. The reductionin the dimension of cracks and the effect of energy disipations of polypropilene fibres will be the main aim of this research work.
Thermal Simulation of Biogas Plants Using Mat LabIJERA Editor
The major prerequisite for the optimum production of methane from a biogas plant is the sustenance of digester temperature within the narrow limits (300C-350C). It is experimentally investigated that, the MIT biogas plant is not maintaining optimum temperature, this decreases the efficiency and increases the detention time for charge. To maintain the plant in optimum temperature, it is necessary to find out the heat losses from the biogas plant and the external energy inputs need to operate the plant. Rate of gas yield, and the detention time (time necessary to anaerobically digest organic wastes) in a biogas reactor, are favorable functions of the temperature in the digester. A thermal simulation for MIT biogas plant has developed using matlab in order to understand the heat transfer from the slurry and the gas holder to the surrounding earth and air respectively. The computation has been performed when the slurry is maintained at 200C and 300C, optimum temperature of anaerobic fermentation. If the slurry is considered to be at 350C, the optimum temperature of anaerobic fermentation, the total heat loss from the plant is higher than the heat loss when the slurry is maintained at 200C. The heat calculations provide an appraisal for the heat which has to be supplied by external means to compensate for the net heat losses which occur if the slurry is to be maintained at 350C. A solar system with auxiliary electric heater is designed for maintaining the slurry at 350C.In conclusion; the results of thermal analysis are used to define a strategy for operating biogas plant at optimum temperatures.
Scenario of Rural Electrification in India- Challenges and ImpactIJERA Editor
In this paper, the present scenario of rural electrification in India is taken into account. Basically, the electrification in this country is facing a lot of problem and is a growing matter of concern for all. The development in production is not reaching the one who need them. Also taking into picture the present sources of energy it is difficult to make the electricity available to the people belonging to rural areas who don’t have much source of income. To overcome this drawback we can utilise renewable sources of energy which is easily available and accessible. Also harvesting this will not cost much except the initial cost of setting up the device to utilise this type of energy. Many projects have been initiated by the government of India to provide subsidy and equipments like solar lantern and solar cooker etc. to the rural population but this didn’t turn out to be effective as the follow could not be done by the people to maintain the devices. This can be overcome by implementing off-grid projects which can be initiated at small levels so that people don’t have burden to maintain them and it even don’t have any adverse effect to environment or society.
A New Approach to Romanize Arabic WordsIJERA Editor
Romanization of Arabic words has been acquired the interest of the researchers due to its importance in many
fields such as security and terrorism fighting, translation, religious purposes, etc.
In this paper, a proposed method was presented to solve the drawbacks of available methods such as lack of
reverse recognition, using of extra letters and punctuation characters, and neglecting the correlation of the letters
in a word.
This method was implemented and tested using a sample of 100 undergraduate Iraqi students and 150 Arabic
words which romanized using five well-known methods in addition to the proposed one. The test showed that
the proposed method dominants the rest method from the recognition and reverse recognition process in
considerable ratio.
Tenser Product of Representation for the Group CnIJERA Editor
The main objective of this paper is to compute the tenser product of representation for the group Cn. Also
algorithms designed and implemented in the construction of the main program designated for the determination
of the tenser product of representation for the group Cn including a flow-diagram of the main program. Some
algorithms are followed by simple examples for illustration.
Research on Privacy Protection in Big Data EnvironmentIJERA Editor
Now big data has become a hot topic in academia and industry, it is affecting the mode of thinking and working, daily life. But there are many security risks in data collection, storage and use. Privacy leakage caused serious problems to the user, false data will lead to error results of big data analysis. This paper first introduces the security problems faced by big data,analyzes the causes of privacy problems,discussesthe principle to solve the problem. Finally,discusses technical means for privacy protection.
Preparation and Characterization of Lithium Ion Conducting Solid Polymer Elec...IJERA Editor
Solid Polymer electrolyte films have been prepared from Starch-Poly vinyl alcohol (PVA) blend a well acknowledged biodegradable material. Solution cast technique was employed for the preparation of solid polymer electrolyte films added with Lithium Bromide (LiBr) salt. X-ray diffraction (XRD) studies of the prepared films portrayed the evolution of an amorphous structure with increasing content of salt which is an important factor that leads to the augmentation of conductivity. Electrochemical impedance spectroscopic analysis revealed noticeable ionic conductivity ~ 5x 10-3 S/cm for 20 wt% of salt at ambient conditions. Ionic conductivity showed an increasing trend with salt content at ambient conditions. Transference number measurements confirmed the ionic nature of the prepared solid polymer electrolyte films. Dielectric studies revealed a sharp increase in the number of charge carriers which contributed to enhancement in conductivity. Low values of activation energy extracted from temperature dependent conductivity measurements could be favorable for device applications. For the composition with highest conductivity a temperature independent relaxation mechanism was confirmed by electric modulus scaling.
Security Issues related with cloud computingIJERA Editor
The term CLOUD means Common Location Independent Online Utility on Demand. It‟s an emerging technology in IT industries. Cloud technologies are improving day by day and now it become a need for all small and large scale industries. Companies like Google, Amazon, Microsoft etc. is providing virtualized environment for user by which it omits the need for physical storage and others. But as the advantage of cloud computing is increasing day by day the issues are also threatening the IT industries. These issues related with the security of the data. The basic idea of this review paper is to elaborate the security issues related with cloud computing and what methods are implemented to improve these security. Certain algorithms like RSA, DES, and Ceaser Cipher etc. implemented to improve the security issues. In this paper we have implemented Identity based mRSA algorithm in this paper for improving security of data.
Random Lead Time of the acute ghrelin response to a psychological stressIJERA Editor
Ghrelin is a growth hormone and cortisol secretagogue that plays an important role in appetite and weight regulation. It is not known whether ghrelin is involved in the eating response to stress in humans. In the present study we examined the effects of psychologically induced stress on plasma ghrelin levels in patients with binge-eating disorder (BED) and in healthy subjects of normal or increased body mass index (BMI). Volunteers were subjected to the standardized trier social stress test (TSST). Basal ghrelin levels in patients were at an intermediate level between thin and healthy obese subjects, but this difference did not attain statistical significance. There were no differences in ghrelin levels throughout the test among the groups after correction for BMI, age and gender. A significant difference in the trend time of ghrelin was revealed when the three groups were analyzed according to their cortisol response to stress. Ghrelin levels increased in cortisol responders whereas no change or a decrease in ghrelin levels occurred in cortisol non-responders. We also found Optimal time T*, Minimal Repair δ and Random Lead Time g to minimize the ghrelin level.
Mimo radar detection in compound gaussian clutter using orthogonal discrete f...ijma
This paper proposes orthogonal Discrete Frequency Coding Space Time Waveforms (DFCSTW) for
Multiple Input and Multiple Output (MIMO) radar detection in compound Gaussian clutter. The proposed
orthogonal waveforms are designed considering the position and angle of the transmitting antenna when
viewed from origin. These orthogonally optimized show good resolution in spikier clutter with Generalized
Likelihood Ratio Test (GLRT) detector. The simulation results show that this waveform provides better
detection performance in spikier Clutter.
Weight enumerators of block codes and the mc williamsMadhumita Tamhane
Best possible error control codes of a certain rate and block length can be adjudged depending on bounds such that no codes can exist beyond the bounds and codes are sure to exist within the bounds. This presentation gives composition structure of Block codes and the probability of decoding error and of decoding failure.Mac William's Identities is relationship between weight distribution of a linear code and weight distribution of its dual code, which hold for any linear code and are based on vector space structure of linear codes and on the fact that dual code of a code is the orthogonal compliment of the code...
Multi carrier equalization by restoration of redundanc y (merry) for adaptive...IJNSA Journal
This paper proposes a new blind adaptive channel shortening approach for multi-carrier systems. The
performance of the discrete Fourier transform-DMT (DFT-DMT) system is investigated with the proposed
DST-DMT system over the standard carrier serving area (CSA) loop1. Enhanced bit rates demonstrated
and less complexity also involved by the simulation of the DST-DMT system.
A review of literature shows that there is a variety of adaptive filters. In this research study, we propose a new type of an adaptive filter that increases the diversification used to compensate the chan-nel distortion effect in the MC-CDMA transmission. First, we show the expressions of the filter’s impulse responses in the case of a perfect channel. The adaptive filter has been simulated and experienced by blind equalization for different cases of Gaussian white noise in the case of an MC-CDMA transmission with orthogonal frequency baseband for a mobile radio downlink channel Bran A. The simulation results show the performance of the proposed identification and blind equalization algorithm for MC-CDMA transmission chain using IFFT.
ON RUN-LENGTH-CONSTRAINED BINARY SEQUENCESijitjournal
A class of binary sequences, constrained with respect to the length of zero runs, is considered.
For such sequences, termed (d, k)-sequences, new combinatorial and computational results
are established. Explicit expressions for enumerating (d, k)-sequences of finite length are
obtained. Efficient computational procedures for calculating the capacity of a (d, k)-code are
given. A simple method for constructing a near-optimal (d, k)-code is proposed. Illustrative
numerical examples demonstrate further the theoretical results.
Using Subspace Pursuit Algorithm to Improve Performance of the Distributed Co...Polytechnique Montreal
This paper applies a compressed algorithm to improve the spectrum sensing performance of cognitive radio technology.
At the fusion center, the recovery error in the analog to information converter (AIC) when reconstructing the
transmit signal from the received time-discrete signal causes degradation of the detection performance. Therefore, we
propose a subspace pursuit (SP) algorithm to reduce the recovery error and thereby enhance the detection performance.
In this study, we employ a wide-band, low SNR, distributed compressed sensing regime to analyze and evaluate the
proposed approach. Simulations are provided to demonstrate the performance of the proposed algorithm.
Design and Fabrication of a Two Axis Parabolic Solar Dish CollectorIJERA Editor
The work consists of the design of the chain drive system and the fabrication of the two axis parabolic solar dish.
It is a model study of the two axis parabolic dish which worked by the automatic circuit that was developed. Ready
made parabolic solar dish is taken and fabricated. The circular iron ring provides the two axis motion of the dish.
A compound chain drive system was developed for the smooth movement of the dish. An electromechanical
system which tracks the sun on both axes and which is controlled via a programmable logic control (PLC) was
designed and implemented. In this a theoretical study was done. A C program was made which gave the required
result for the graphical representation of the recorded radiation. Programmable Logic Controls (PLC) was used
instead of photo sensors, which are widely used for tracking the sun. The azimuthal angle of the sun from sunrise
to sunset times was calculated for each day of the year at 23.59 Lat & 72.38Longitude in the Northern hemisphere,
the location of the city Mehsana. According to this azimuth angle, the required analog signal was taken from the
PLC analog module and sent to the power window motor, which controlled the position of the panel to ensure that
the rays fall vertically on the panel. After the mechanical control of the system was started, the performance
measurements of the solar panel were carried out. The values obtained from the measurements were compared and
the necessary evaluations were conducted.
Fault Tolerant Parallel Filters Based On Bch CodesIJERA Editor
Digital filters are used in signal processing and communication systems. In some cases, the reliability of those
systems is critical, and fault tolerant filter implementations are needed. Over the years, many techniques that
exploit the filters’ structure and properties to achieve fault tolerance have been proposed. As technology scales,
it enables more complex systems that incorporate many filters. In those complex systems, it is common that
some of the filters operate in parallel, for example, by applying the same filter to different input signals.
Recently, a simple technique that exploits the presence of parallel filters to achieve multiple fault tolerance has
been presented. In this brief, that idea is generalized to show that parallel filters can be protected using Bose–
Chaudhuri–Hocquenghem codes (BCH) in which each filter is the equivalent of a bit in a traditional ECC. This
new scheme allows more efficient protection when the number of parallel filters is large.
Similar to Application of Fuzzy Algebra in Coding Theory (20)
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Pile Foundation by Venkatesh Taduvai (Sub Geotechnical Engineering II)-conver...
Application of Fuzzy Algebra in Coding Theory
1. Kharatti Lal Int. Journal of Engineering Research and Applications www.ijera.com
ISSN: 2248-9622, Vol. 6, Issue 1, (Part - 1) January 2016, pp.88-93
www.ijera.com 88|P a g e
Application of Fuzzy Algebra in Coding Theory
Kharatti Lal
Deptt .of (Applied Science) – Mathematics Govt. Millennium Polytechnic College Chamba Himachal Pradesh -
176310
ABSTRACT
Fuzziness means different things depending upon the domain of application and the way it is measured. By
means of fuzzy sets, vague notions can be described mathematically now a vigorous area of research with
manifold applications. It should be mentioned that there are natural ways (not necessarily trivial) to fuzzily
various mathematical structures such as topological spaces, algebraic structure etc. The notion of L-fuzzy sets
later more generalizations were also made using various membership sets and operations. In this section we let F
denote the field of integers module 2, we define a fuzzy code as a fuzzy subset of Fn
where Fn
= {(a1, ....an | a i
F, i = 1, ...n} and n is a fixed arbitrary positive integers we recall that Fn
is a vector space over F. We give an
analysis of the Hamming distance between two fuzzy code words and the error – correcting capability of a code
in terms of its corresponding fuzzy codes. The results appearing in the first part of this section are from [17].
Key Words: Fuzzy code, Symmetric channel, Hankel matrices, Membership value, Semigroup,
I. INTRODUCTION
Now mention some other way fuzzy abstract algebra has been applied. The paper [35] deals with the
classification of knowledge when they are endowed with some fuzzy algebraic structure. By using the quotient
group of symmetric knowledge as algebraic method is given in [35] to classify them also the anti fuzzy sub
groups construction used to classify knowledge. In the paper [20] fuzzy points are regarded as data and fuzzy
objects are constructed from the set of given data on an arbitrary group. Using the method of least square,
optimal fuzzy subgroups are defined for the set of data and it is shown that one of them is obtained as f fuzzy
subgroup by a set of some modified data.In [55], a decomposition of an valued set given a family of
characteristic functions which can be considered as a binary block code. Conditions are given under which an
arbitrary block code corresponds to L-valued fuzzy set. An explicit description of the Hamming distance, as
well as of any code distance is also given all in lattice-theoretic terms. A necessary and sufficient conditions is
given for a linear code to correspond to an L-valued fuzzy set.
One of the most important problem in coding theory is to define code whose codeword are “far apart” from
each other as possible or whose values EC is maximized. It is also desirable to decode uniquely. For example let
n =3 and c = (0 0 0) (1 0 1). Then d min (C) = 2 suppose that a codeword is transmitted across the channel and (0,
0, 1) is received. Then (0, 0, 1) is of distance 1 from both the code word (0, 0, 0) and (1, 0, 1). Hence (0, 0, 1)
cannot be decoded uniquely. Thus in always order to able be correct a single error we must have d min (c) at least
equal to 3. If c = {[0, 0, 0)(1, 1, 1)} then (0, 0, 1) is decoded as (0, 0, 0) since it is closer to (0, 0, 0) then it is to
(1, 1, 1).We now examine the fuzzy codes. For any code, c Fn
, we have see that there is a corresponding fuzzy
code (c). If u Fn
is a received word and C is a core word,i.e cC then CA (u) is the probability that c was
transmitted. Fuzzy sets appear to be a natural setting for the study of codes in that probability of error in the
channel is included in the definition of fuzzy code. In the following we assume that p q.
Definition 1.1: u = (u1, ....un) Fn
define the fuzzy subset Au of
n
F by u = u1, ...un Fn
,
n d d
Au(u) P q
, where
n
i i
i 1
d | x v |
and p and q are fixed positive real numbers such that p + q = 1
Define n n n
u:F A A | u F by (u) =
n
uA u F . Then is a one to one functions of Fn
onto
n
A .
RESEARCH ARTICLE OPEN ACCESS
2. Kharatti Lal Int. Journal of Engineering Research and Applications www.ijera.com
ISSN: 2248-9622, Vol. 6, Issue 1, (Part - 1) January 2016, pp.88-93
www.ijera.com 89|P a g e
Definition 1.2: If c F n
then (c) is called a fuzzy code corresponding to the code C.If cC then cA is called
a fuzzy code word. We consider an example let n = z and c = {(0, 0, 0) (1, 1, 1). If (0, 0, 0) is transmitted and (0,
1, 0) is received, then assuming
q < ½ there is a greater likelihood that (0, 0, 0,) was transmitted then (1, 1, 1) since we are assuming burst errors
do not occur.
Let u Fn
and un
Fn
then
n
i i
i 1
| u u |
is the number of coordinates position in which u and u differ. The
number of errors required to transform u into U equal this number. We let d(u, v) denote
n
i i
i 1
| u u | d(u,v)
is called the Hamming distance of uv.
Definition 1.3: Let C Fn
be a code the minimum distance c is defined to be
mind (c) d(a,b)|(a,b) c,a b . If C is a subspace of Fn
then dmin(c)
d(a,0)|a c,a 0
0 = (0, ...., 0) now d(a0, 0) is the number of non zero entries in a and is called the weight of a and often is
denoted by | a | when a code C is a subspace of Fn
, we called it a linear code.
Let [[ ]] denote the greater integer function on the real numbers for any code c Fn
E c = [[d min (C) 1)/2]] in the maximum number of errors allowed in the channel for each n bits transmitted for
which received signals may be correctly decoded Definition 1.4: Let Fn
be a code. Define
Q:Fn
{ A/ A is a fuzzy subset of Fn
} by u Fn
,
Q (u) = { cA | c C, cA (u) (u) bA (u) b C}
A code for which | (u) | = 1 u Fn
is uniquely decodable. In such a case u is decoded as 1
((u)). An
important criteria for designing good code is s spasing the code words as far apart from each other as possible,
the Hamming distance is the metric used in Fn
to measure distance. Analogously the generalized Hamming
distance between fuzzy subsets may be used as a metric in
n
A . It is defined by uA . uA
n
A ,
n
u u u u
w F
d(A ,A ) | A (w) A (w) |
.
The theorem which follows show that u ud(A ,A ) is independent of n.
Let u, v Fn
be such that d(u, x) = d), if P q and p 0, then u u d
d(A ,A ) , where
d
i d i d i i
d
i 0
d
| p q P q
i
,
Theorem 2.1: Let C1 and C2 be two codes used in the same channel. If p q and p 0, 1 then
1 2C CE E if
and only if d min ((c1)) = d min ((c2))
d min = ((C1)) = d min((C2)).
Proof: Let d i = d min ((c1)) for i = 1, 2. If
1 2C CE E , then either d1 = d2 in which case the desired result
holds or d2 = d1 + 1, where d1 is a an odd positive integer. From Lemma we have if p q and P 0, 1 then
1 2 2 3 4 5
.....
min 1 min 2d ( (c )) d ( (c )) , then it follows from lemma.
3. Kharatti Lal Int. Journal of Engineering Research and Applications www.ijera.com
ISSN: 2248-9622, Vol. 6, Issue 1, (Part - 1) January 2016, pp.88-93
www.ijera.com 90|P a g e
Conversely if min 1 min 2d ( (c )) d ( (c )) , either d1 = d2 and so
1 2C CE E or d1 = d2 1 where d1
d2 is odd and so
1 2C CE E .Let M be a subset of . Let
n
C F be a code suppose c C is transmitted
across the channel and that u Fn
is received. The signal that are transmitted are usually distorted by varying
degrees.
Let M be a subset of R. Let C F n
be a code.
Suppose cC is transmitted across the channel and that uFn
is received. The signal that are transmitted are
usually destroyed by varying degrees. The electrical receiver may record the signals is one of the two ways. The
electrical waves received representing the word 4 Rs. measured bit by bit as real numbers. The signals then are
either recorded as n types over M or each bit of u is transformed into an element of F. u is then coded in Fm
for
some positive integer’s m. For example suppose that (1, 0, 1) is encoded as C = (1, 0, 1, 0) and transmitted
electronically across the channel. Supposed the received waves are measured as u = (1, 02, 0.52, 0.98, 0.02) and
recorded as U = (1, 1, 1, 0), Then some information is lost in recording u as u – Some possible directories for
further study to overcome this loss and suggested in [15]. For example let x F n
and define the fuzzy subset
xA of M n
by
y M n
xA (y) = p(x, y)
where P(x, y) is the probability that if x is coded and transmitted across the channel, y is received. Then soft
decoding may be studied via { xA /xFm
}We have assumed that error in the transmitted of words across a
noisy channel were symmetric in nature i.e., the probability of 1 0 and 0 1 cross over failures were equally
likely. However error in VSLI circuit and many computer memories are on a undirectional nature [8] A
undirectional error model assumes that both 1 0 1 cross overs can occur, but only are type of error occurs
in a particular data word. This has provided the basis for a new direction in coding theory and fault tolerance
computing. Also the failure of the memory cells of some of the LSI transistor cell memories and NMOS
memories are most likely caused by leakage of charge. If we represent the presence of charge in a cell by 1 and
the absence of charge by 0, then the errors in those type of memories can be modeled as 1 0 type symmetric
errors, [8].The result in the remainder of this section are from [15]. Once again F denotes the field of integers
module 2 and Fn
the vector space of n-tuples over F, we let p denotes the transmitted 1 will be received as a1
and a transmitted 0 will be received as a 0, Let q = 1p. Then q is the probability that there is an error in
transmission in an arbitrary bit
Definition (1.5): Let u = u1, ... , un Fn
. Define the fuzzy subset A(u) of Fn
as follows: u
u = (u1, ..., un) Fn
1 2
u m d d
0 if K K 0
A (U)
P q otherwise
Where, K1 =
n n
i i 2 i i
i 1 i 1
OV(u v ), K OV(u v )
1 2
2 1
K if K 0
d
K if K 0
n
i 2
i 1
n
i 1
i 1
n n
i i 1 2
i 1 i 1
u if K 0
m n u if K 0
u V n u if K K 0
By this definition uA (u) is zero if both one and zero transitions have occurred. It allows either by
themselves, to occur in a given received word. In the case that a received word is the same as that transmitted,
one may choose either the one’s or the zero’s as possible toggling. In our definitions, we choose which ever
there are more of for example: if there are more one’s, the definition would expect 1 0 transitions only.
4. Kharatti Lal Int. Journal of Engineering Research and Applications www.ijera.com
ISSN: 2248-9622, Vol. 6, Issue 1, (Part - 1) January 2016, pp.88-93
www.ijera.com 91|P a g e
Hence in equal to the numbers of is and d = 0. In any event we only allow m one to take the value of the number
of bits which can transition in calculating our membership functions. The bits that cannot change are not
considered in the function. In the following definition .We define a fuzzy word for an asymmetric error model in
which only errors may occour. Example 3.1: Let n = 2 let u
= (0, 0) and d ( A u, A u) = | p2
q0
p0
q2
| +
| p1
q1
p1
q1
| + | p1
q1
p1
q1
| + | p0
q2
p2
q0
| = 2 (p q) and dH(u, u) = 2.
Now let n = 3, w = (1, 1, 1) and x = (0, 0, 1) in F3
then
d( A u, A u) = | p0
q3
p0
q1
| + |p1
q2
p2
q0
| + |p1
q2
0| + |p2
q1
p1
q1
|
+ | p1
q2
0 | + | p2
q1
p1
q1
| + | p3
q0
p0
q2
|
= q q2
q3
+ p3
+ p2
+ 2pq + pq2
p2
q 2(p q) and
DH (u, v) = 2.
We some Hamming distance between u, U, w and x respectively but different distance between the
corresponding fuzzy code word. We now state a result which says that the distance between fuzzy code word is
independent of n for ideal symmetric error. The result holds when the Hamming distance or the as symmetric
distance is used as the distance metric between two code words.
Lemma 4.1: 1 2 n..... 1 . As the asymmetric between code words on which fuzzy codes will be
based become large, there is only a small increase in the measurable distance between codewords. For
unidirectional errors, the case is that the space of the code will effect the distance between the fuzzy code words.
These issues must be taken into account in designing fuzzy codes.
Lemma4.2:1 < 2 < ... n > 2.
Proof: If instead of using the Hamming distance between two fuzzy codes, we used the asymmetric distance, so
that
n n
a u u u u v u
w F w F
D (A ,A ) A (w) A (w) V A (w) A (w) V
Then the
following theorem holds.
Corollary 5.1: A fuzzy column vectors h1
An
is independent of a set of fuzzy column vectors 1 nh ,....,h .
If S(i) = for any i {1, ....,m}.
Proof: We give the algorithm for checking if a non-null column xk in the Sub semimodule F is linearly
dependent on a set of fuzzy vectors at the end of this section. In a set of the column vectors ig , i = 1, ...n, is
given a complete set of independent fuzzy vectors if , i = 1, ....i, can be selected such that subsemimodule
generated by i m{f ,....,f } contains the ig s the procedure is shown in the form of the flow chart.
We now consider a positive sample set R+
= 0.8ab, 0.8aa, bb, 0.3ab, 0.2bc, 0.99bbc. The finite submatrix of the
fuzzy Hankel matrix H(r) is shown.
Using the algorithm DEPENDENCE the independent columns of the fuzzy Hankel matrix have been indicated
as F1, F2, F5, F6, F7.
The finite submatrix of the fuzzy Hankel matrix H(r)2
.
1 2 3 4 5 6 7
1
2
3
4
5
6
7
S S S S S S S
S 0 0 0 0 0 0 0
S 0 0 .03 0 1 0 .08
S 0 0 0 0 0 0 0
(a) S 0 0 0 0 0 0 0
S 0 0 0 0 0 .08 0
S 0 0 0 0 0 0 0
S 0 0 0 0 0 0 0
5. Kharatti Lal Int. Journal of Engineering Research and Applications www.ijera.com
ISSN: 2248-9622, Vol. 6, Issue 1, (Part - 1) January 2016, pp.88-93
www.ijera.com 92|P a g e
1 2 3 4 5 6 7
1
2
3
4
5
6
7
S S S S S S S
S 0 0 0 0 0 0 0
S 0 0 0 0 0 0 0
S 0 0 0 1 0 0 0
(b) S 0 0 0 0 0 0 0
S 0 0 1 0 0 0 0
S 0 0 0 0 0 0 1
S 1 0 0 0 0 0 0
1 2 3 4 5 6 7
1
2
3
4
5
6
7
S S S S S S S
S 0 0 0 0 0 0 0
S 0 0 0 0 0 0 0
S 0 0 0 0 0 0 0
(c) S 1 0 0 0 0 0 0
S 0 0 0 0 0 0 0
S 0 0 0 0 0 0 0
S 0 0 0 0 0 0 0
ab a abc bc c abbc bbc aabb abb bb
0 .8 0 .3 .2 0 .9 0 .8 0 0
a 0 0 .8 0 .3 0 0 .9 0 .8 0
ab .8 0 0 0 .9 .3 0 0 0 0 0
abc .3 0 0 0 0 0 0 0 0 0 0
bc .2 0 0 0 0 0 0 0 0 0 0
(c)
abb 0 0 0 0 0 .9 0 0 0 0 0
abbc .9 0 0 0 0 0 0 0 0 0 0
aa 0 0 0 0 0 0 0 0 0
aab
aabb
1 7 3 4 2 5 6
0 0
0 0 .8 0 0 0 0 0 0 0 0
.8 0 0 0 0 0 0 0 0 0 0
F F F F F F F
The algorithm depends also identifies column if any column vector h(j) is dependent on the set of generator
H (m) = 1 m
ˆ ˆH (m) {f ,....,f } of the Hankel matrix as constructed intable. It also identifies the
coefficient Si, using the procedure ARRANGE CS(i), N, CARD(i) and the procedure COMPARESO(k), SO(K
1).
6. Kharatti Lal Int. Journal of Engineering Research and Applications www.ijera.com
ISSN: 2248-9622, Vol. 6, Issue 1, (Part - 1) January 2016, pp.88-93
www.ijera.com 93|P a g e
Definition 1.6: A code C over the alphabet A is called a prefix (suffix) code if it satisfies CA+
C = (A+
C
C = ). C is called a biprefix code of it is a prefix and a suffix code. A submonoid M of any monoid N.
Satisfying of proposition CA+
C = is called the left unitary in N. M is called right unitary in N if it is
satisfies the dual of x A
, Mw M implies w M namely A+
C C = .
Let M be a submonoid of a free monoid A
and c its base then the following conditions are equivalent:
(i) w A
, Mw M implies w M
(ii) CA+
C =
Proposition 6.1: Let A
be a free monoid and C be a subset of A
. Define the subset Di of A
recursively by
D0 = C and Di = {w A
| Di1w c 0 or Cw Di1 }, i = 1, 2, ..... Then c is a code over A if and only if
C Di = for i = 1,2, ....
Suppose e is a finite then the length of the word in C. Hence there is only a finite number of distinct Di and this
proposition gives an algorithm for deciding whether or c is a code.
II. CONCLUSION
The search for suitable codes for communication theory is known. It was proposed by Garla-that-L-semi-
group theory be used. To this end free, pure, very pure, left unitary, right unitary, unitary such L-
submsemigroup there is a family of codes associated with it. An L-subsemigroup of a free semigroup if free,one
are, pure, very pure, left unitary right unitary respectively. Thus any method used to construct an L-
=subsemigroup of a free semigroup of one of these types yields a family of semigroups of the same types.
Namely the level sets of the L-subsemigroup. The basic idea is that the class of non-fuzzy system, that are
approximately equivalent to a given type of system from the point of view of their behaviours is a fuzzy class of
systems.For instances the class of system that are approximately linear. This idea of fuzzy classification of
system was first hinted at by Zadeh 1965. Saridis 1975 applied it to the classification of nonlinear systems
according to their nonlinearies, pattern recognition methods are first used to build crisp classes. Generally, this
approach does not answer the question of complete identification of the nonlinearlies involved within one class.
To distinguish between the nonlinearlies belonging to a single class, membership value in this class are defined
for each nonlinearly one of thee considered as a references with a membership value 1.The membership value of
each nonlinearity is calculated by comparing the coefficients of its polynomial series expansion to that of the
reference nonlinearlity.
REFERENCES
[1.] Mordeson J.N. ʽʽFuzzy algebraic varieties II advance in fuzzy theory and technologyʼʼ Vol. 1: 9-21
edited by Paul Wang 1994.
[2.] Mordeson J.NB. ʽʽ L-subspace and L-subfield lecture notes in fuzzy mathematics’ʼ and computer
science. Creighton University Vol.2,1996.
[3.] Rosenfeld SA, Fuzzy group J Math Anal. Appl. 35: 512-517, 1971.
[4.] Mordeson J. and Alkhamess Y. ʽʽFuzzy localized subrings inform Sciʼʼ. 99: 183-193, 1997.
[5.] Bourbaki,ʽʽ Elements of mathematics’ commutative algebra ʼʼ, Springer Verlag, New York, 1989.
[6.] Klir G.J. and Floger, T.A.ʽʽ Fuzzy Sets and Uncertainty and Informationʼʼ. Prentice Hall Englewood
Cliffs. N.J. 1988.
[7.] Zadeh-L.A., ʽʽSimilarity relations and fuzzy ordering informations.ʼʼ Sci. 3: 177-200, 1971.
[8.] Goden J.S.ʽʽThe fuzzy of semirings with application in mathematics and theortical computer scienceʼʼ,
Pitam monographs and surveys in pure and applied mathematics 54,longman Scientific and technical
John Wiley and sons Inc. New York, 1992.