Search results for: Involutary dually residuated lattice ordered semigroup

Authors: Zelalem Teshome Wale

Abstract:

The notions of I-vague groups with membership and non-membership functions taking values in an involutary dually residuated lattice ordered semigroup are introduced which generalize the notions with truth values in a Boolean algebra as well as those usual vague sets whose membership and non-membership functions taking values in the unit interval [0, 1]. Moreover, various operations and properties are established.

Keywords: Involutary dually residuated lattice ordered semigroup, I-vague set and I-vague group.

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

Authors: Zelalem Teshome Wale

Abstract:

The notions of I-vague normal groups with membership and non-membership functions taking values in an involutary dually residuated lattice ordered semigroup are introduced which generalize the notions with truth values in a Boolean algebra as well as those usual vague sets whose membership and non-membership functions taking values in the unit interval [0, 1]. Various operations and properties are established.

Keywords: Involutary dually residuated lattice ordered semigroup, I-vague set, I-vague group and I-vague normal group.

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

Authors: Jian Tang

Abstract:

In this paper, we first introduce the new concept of completely semiprime fuzzy ideals of an ordered semigroup S, which is an extension of completely semiprime ideals of ordered semigroup S, and investigate some its related properties. Especially, we characterize an ordered semigroup that is a semilattice of simple ordered semigroups in terms of completely semiprime fuzzy ideals of ordered semigroups. Furthermore, we introduce the notion of semiprime fuzzy ideals of ordered semigroup S and establish the relations between completely semiprime fuzzy ideals and semiprime fuzzy ideals of S. Finally, we give a characterization of prime fuzzy ideals of an ordered semigroup S and show that a nonconstant fuzzy ideal f of an ordered semigroup S is prime if and only if f is twovalued, and max{f(a), f(b)} = inf f((aSb]), ∀a, b ∈ S.

Keywords: Ordered fuzzy point, fuzzy left (right) ideal of anordered semigroup, completely semiprime fuzzy ideal, semiprimefuzzy ideal, prime fuzzy ideal.

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

Authors: Jian Tang

Abstract:

Let S be an ordered semigroup. In this paper we first introduce the concepts of (∈,∈ ∨q)-fuzzy ideals, (∈,∈ ∨q)-fuzzy bi-ideals and (∈,∈ ∨q)-fuzzy generalized bi-ideals of an ordered semigroup S, and investigate their related properties. Furthermore, we also define the upper and lower parts of fuzzy subsets of an ordered semigroup S, and investigate the properties of (∈,∈ ∨q)-fuzzy ideals of S. Finally, characterizations of regular ordered semigroups and intra-regular ordered semigroups by means of the lower part of (∈ ,∈ ∨q)-fuzzy left ideals, (∈,∈ ∨q)-fuzzy right ideals and (∈,∈ ∨q)- fuzzy (generalized) bi-ideals are given.

Keywords: Ordered semigroup, regular ordered semigroup, intraregular ordered semigroup, (∈, ∈ ∨q)-fuzzy left (right) ideal of an ordered semigroup, (∈, ∈ ∨q)-fuzzy (generalized) bi-ideal of an ordered semigroup.

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

Authors: Jian Tang

Abstract:

In this paper, we first introduce the concepts of weakly prime and weakly quasi-prime fuzzy left ideals of an ordered semigroup S. Furthermore, we give some characterizations of weakly prime and weakly quasi-prime fuzzy left ideals of an ordered semigroup S by the ordered fuzzy points and fuzzy subsets of S.

Keywords: Ordered semigroup, ordered fuzzy point, weakly prime fuzzy left ideal, weakly quasi-prime fuzzy left ideal.

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

Authors: Liew Siaw Yee, Tahir Ahmad

Abstract:

In this paper, the Fuzzy Autocatalytic Set (FACS) is composed into Omega Algebra by embedding the membership value of fuzzy edge connectivity using the property of transitive affinity. Then, the Omega Algebra of FACS is a transformation semigroup which is a special class of semigroup is shown.

Keywords: Fuzzy autocatalytic set, omega algebra, semigroup, transformation semigroup.

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

Authors: František Včelař, Zuzana Pátíková

Abstract:

Recently a new type of very general relational structures, the so called (L-)complete propelattices, was introduced. These significantly generalize complete lattices and completely lattice L-ordered sets, because they do not assume the technically very strong property of transitivity. For these structures also the main part of the original Tarski’s fixed point theorem holds for (L-fuzzy) isotone maps, i.e., the part which concerns the existence of fixed points and the structure of their set. In this paper, fundamental properties of (L-)complete propelattices are recalled and the so called L-fuzzy relatively isotone maps are introduced. For these maps it is proved that they also have fixed points in L-complete propelattices, even if their set does not have to be of an awaited analogous structure of a complete propelattice.

Keywords: Fixed point, L-complete propelattice, L-fuzzy (relatively) isotone map, residuated lattice, transitivity.

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

Authors: Samit Kumar Majumder

Abstract:

In this paper the concept of Q-fuzzification of ideals of Γ-semigroups has been introduced and some important properties have been investigated. A characterization of regular Γ-semigroup in terms of Q-fuzzy ideals has been obtained. Operator semigroups of a Γ-semigroup has been made to work by obtaining various relationships between Q-fuzzy ideals of a Γ-semigroup and that of its operator semigroups.

Keywords: Q-Fuzzy set, Γ-semigroup, Regular Γ-semigroup, Q-Fuzzy left(right) ideal, Operator semigroups.

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

Authors: Enxiao Yuan, Xiaomin Zhang

Abstract:

It is known that a left C-wrpp semigroup can be described as curler structure of a left band and a C-wrpp semigroup. In this paper, we introduce the class of weakly left C-wrpp semigroups which includes the class of weakly left C-rpp semigroups as a subclass. We shall particularly show that the spined product of a left C-wrpp semigroup and a right normal band is a weakly left C-wrpp semifroup. Some equivalent characterizations of weakly left C-wrpp semigroups are obtained. Our results extend that of left C-wrpp semigroups.

Keywords: Left C-wrpp semigroup, left quasi normal regular band, weakly left C-wrpp semigroup.

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

Authors: Xiaomin Zhang

Abstract:

In this paper, the class of weakly left C-wrpp semigroups which includes the class of weakly left C-rpp semigroups as a subclass is introduced. To particularly show that the spined product of a left C-wrpp semigroup and a right normal band which is a weakly left C-wrpp semifroup by virtue of left C-full Ehremann cyber groups recently obtained by authors Li-Shum, results obtained by Tang and Du-Shum are extended and strengthened.

Keywords: Left C-semigroup, left C-wrpp semigroup, left quasinormal band, weakly left C-wrpp semigroup

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

Authors: Shin-Shin Kao, Hsiu-Chunj Pan

Abstract:

Given a graph G. A cycle of G is a sequence of vertices of G such that the first and the last vertices are the same. A hamiltonian cycle of G is a cycle containing all vertices of G. The graph G is k-ordered (resp. k-ordered hamiltonian) if for any sequence of k distinct vertices of G, there exists a cycle (resp. hamiltonian cycle) in G containing these k vertices in the specified order. Obviously, any cycle in a graph is 1-ordered, 2-ordered and 3- ordered. Thus the study of any graph being k-ordered (resp. k-ordered hamiltonian) always starts with k = 4. Most studies about this topic work on graphs with no real applications. To our knowledge, the chordal ring families were the first one utilized as the underlying topology in interconnection networks and shown to be 4-ordered. Furthermore, based on our computer experimental results, it was conjectured that some of them are 4-ordered hamiltonian. In this paper, we intend to give some possible directions in proving the conjecture.

Keywords: Hamiltonian cycle, 4-ordered, Chordal rings, 3-regular.

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

Authors: Sujit Kumar Sardar Manasi Mandal Samit Kumar Majumder

Abstract:

The notion of intuitionistic fuzzy sets was introduced by Atanassov as a generalization of the notion of fuzzy sets. Y.B. Jun and S.Z. Song introduced the notion of intuitionistic fuzzy points. In this paper we find some relations between the intuitionistic fuzzy ideals of a semigroup S and the set of all intuitionistic fuzzy points of S.

Keywords: Semigroup, Regular(intra-regular) semigroup, Intuitionistic fuzzy point, Intuitionistic fuzzy subsemigroup, Intuitionistic fuzzy ideal, Intuitionistic fuzzy interior ideal, Intuitionistic fuzzy semiprime ideal, Intuitionistic fuzzy prime ideal.

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

Authors: S.K.Sardar, B.Davvaz, S.Kayal, S.K.Majumdar

Abstract:

The purpose of this note is to obtain some properties of (∈,∈ ∨q)- fuzzy bi-ideals in a Γ-semigroup in order to characterize regular and intra-regular Γ-semigroups.

Keywords: Regular Γ-semigroup, belong to or quasi-coincident, (∈, ∈ ∨q)-fuzzy subsemigroup, (∈, ∈ ∨q)-fuzzy bi-ideals.

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

Authors: D.R Prince Williams

Abstract:

In this paper,we introduce a notion of fuzzy ideals in near-subtraction semigroups and study their related properties.

Keywords: subtraction algebra, subtraction semigroup, an ideal, near-subtraction semigroup, fuzzy level set, fuzzy ideal, fuzzy homomorphism.

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

Authors: Yi Liu, Yang Xu

Abstract:

Applying the idea of soft set theory to lattice implication algebras, the novel concept of (implicative) filteristic soft lattice implication algebras which related to (implicative) filter(for short, (IF-)F-soft lattice implication algebras) are introduced. Basic properties of (IF-)F-soft lattice implication algebras are derived. Two kinds of fuzzy filters (i.e.(2, 2 _qk)((2, 2 _ qk))-fuzzy (implicative) filter) of L are introduced, which are generalizations of fuzzy (implicative) filters. Some characterizations for a soft set to be a (IF-)F-soft lattice implication algebra are provided. Analogously, this idea can be used in other types of filteristic lattice implication algebras (such as fantastic (positive implicative) filteristic soft lattice implication algebras).

Keywords: Soft set, (implicative) filteristic lattice implication algebras, fuzzy (implicative) filters, ((2, 2 _qk)) (2, 2 _ qk)-fuzzy(implicative) filters.

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

Authors: José M. Merigó, Anna M. Gil-Lafuente

Abstract:

Different types of aggregation operators such as the ordered weighted quasi-arithmetic mean (Quasi-OWA) operator and the normalized Hamming distance are studied. We introduce the use of the OWA operator in generalized distances such as the quasiarithmetic distance. We will call these new distance aggregation the ordered weighted quasi-arithmetic distance (Quasi-OWAD) operator. We develop a general overview of this type of generalization and study some of their main properties such as the distinction between descending and ascending orders. We also consider different families of Quasi-OWAD operators such as the Minkowski ordered weighted averaging distance (MOWAD) operator, the ordered weighted averaging distance (OWAD) operator, the Euclidean ordered weighted averaging distance (EOWAD) operator, the normalized quasi-arithmetic distance, etc.

Keywords: Aggregation operators, Distance measures, Quasi- OWA operator.

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

Authors: Thomas Fiedler, Irina V. Belova, Graeme E. Murch

Abstract:

Lattice Monte Carlo methods are an excellent choice for the simulation of non-linear thermal diffusion problems. In this paper, and for the first time, Lattice Monte Carlo analysis is performed on thermal diffusion combined with convective heat transfer. Laminar flow of water modeled as an incompressible fluid inside a copper pipe with a constant surface temperature is considered. For the simulation of thermal conduction, the temperature dependence of the thermal conductivity of the water is accounted for. Using the novel Lattice Monte Carlo approach, temperature distributions and energy fluxes are obtained.

Keywords: Coupled Analysis, Laminar Flow, Lattice MonteCarlo, Thermal Diffusion

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

Authors: Kotbi Lakhdar, Hachi Mostefa

Abstract:

We show that a simple transformation between the regular lattices (the square, the triangular, and the honeycomb) belonging to the same dimensionality can explain in a natural way the universality of the critical exponents found in phase transitions and critical phenomena. It suffices that the Hamiltonian and the lattice present similar writing forms. In addition, it appears that if a property can be calculated for a given lattice then it can be extrapolated simply to any other lattice belonging to the same dimensionality. In this study, we have restricted ourselves on the spectral power amplification (SPA), we note that the SPA does not have an effect on the critical exponents but does have an effect by the criticality temperature of the lattice; the generalisation to other lattice could be shown according to the containment principle.

Keywords: Ising model, phase transitions, critical temperature, critical exponent, spectral power amplification.

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

Authors: Ahmet Z. Ozcelik, Serkan Narli

Abstract:

In this study, a minimal submaximal element of LIT(X) (the lattice of all intuitionistic topologies for X, ordered by inclusion) is determined. Afterwards, a new contractive property, intuitionistic mega-connectedness, is defined. We show that the submaximality and mega-connectedness are not complementary intuitionistic topological invariants by identifying those members of LIT(X) which are intuitionistic mega-connected.

Keywords: Intuitionistic set; intuitionistic topology;intuitionistic submaximality and mega-connectedness.

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

Authors: José M. Merigó, Anna M. Gil-Lafuente

Abstract:

We study different types of aggregation operators such as the ordered weighted averaging (OWA) operator and the generalized OWA (GOWA) operator. We analyze the use of OWA operators in the Minkowski distance. We will call these new distance aggregation operator the Minkowski ordered weighted averaging distance (MOWAD) operator. We give a general overview of this type of generalization and study some of their main properties. We also analyze a wide range of particular cases found in this generalization such as the ordered weighted averaging distance (OWAD) operator, the Euclidean ordered weighted averaging distance (EOWAD) operator, the normalized Minkowski distance, etc. Finally, we give an illustrative example of the new approach where we can see the different results obtained by using different aggregation operators.

Keywords: Aggregation operators, Minkowski distance, OWA operators, Selection of strategies.

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

Authors: Seung-Yeon Kim

Abstract:

The square-lattice Ising model is the simplest system showing phase transitions (the transition between the paramagnetic phase and the ferromagnetic phase and the transition between the paramagnetic phase and the antiferromagnetic phase) and critical phenomena at finite temperatures. The exact solution of the squarelattice Ising model with free boundary conditions is not known for systems of arbitrary size. For the first time, the exact solution of the Ising model on the square lattice with free boundary conditions is obtained after classifying all ) spin configurations with the microcanonical transfer matrix. Also, the phase transitions and critical phenomena of the square-lattice Ising model are discussed using the exact solution on the square lattice with free boundary conditions.

Keywords: Phase transition, Ising magnet, Square lattice, Freeboundary conditions, Exact solution.

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

Authors: Ju-Hong Lee, Chong-Jia Ciou, Yuan-Hau Yang

Abstract:

This paper deals with the problem of two-dimensional (2-D) recursive doubly complementary (DC) digital filter design. We present a structure of 2-D recursive DC filters by using 2-D symmetric half-plane (SHP) recursive digital all-pass lattice filters (DALFs). The novelty of using 2-D SHP recursive DALFs to construct a 2-D recursive DC digital lattice filter is that the resulting 2-D SHP recursive DC digital lattice filter provides better performance than the existing 2-D SHP recursive DC digital filter. Moreover, the proposed structure possesses a favorable 2-D DC half-band (DC-HB) property that allows about half of the 2-D SHP recursive DALF’s coefficients to be zero. This leads to considerable savings in computational burden for implementation. To ensure the stability of a designed 2-D SHP recursive DC digital lattice filter, some necessary constraints on the phase of the 2-D SHP recursive DALF during the design process are presented. Design of a 2-D diamond-shape decimation/interpolation filter is presented for illustration and comparison.

Keywords: All-pass digital filter, doubly complementary, lattice structure, symmetric half-plane digital filter, sampling rate conversion.

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

Authors: Ismat Beg, Asma Rashid Butt

Abstract:

Let (X,) be a partially ordered set and d be a metric on X such that (X, d) is a complete metric space. Assume that X satisfies; if a non-decreasing sequence xn → x in X, then xn  x, for all n. Let F be a set valued mapping from X into X with nonempty closed bounded values satisfying; (i) there exists κ ∈ (0, 1) with D(F(x), F(y)) ≤ κd(x, y), for all x  y, (ii) if d(x, y) < ε < 1 for some y ∈ F(x) then x  y, (iii) there exists x0 ∈ X, and some x1 ∈ F(x0) with x0  x1 such that d(x0, x1) < 1. It is shown that F has a fixed point. Several consequences are also obtained.

Keywords: Fixed point, partially ordered set, metric space, set valued mapping.

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

Authors: Wenyu Song, Bingxi Li, Zhongbin Fu, Bo Zhang

Abstract:

Although water only takes a little percentage in the total mass of soil, it indeed plays an important role to the strength of structure. Moisture transfer can be carried out by many different mechanisms which may involve heat and mass transfer, thermodynamic phase change, and the interplay of various forces such as viscous, buoyancy, and capillary forces. The continuum models are not well suited for describing those phenomena in which the connectivity of the pore space or the fracture network, or that of a fluid phase, plays a major role. However, Lattice Boltzmann methods (LBMs) are especially well suited to simulate flows around complex geometries. Lattice Boltzmann methods were initially invented for solving fluid flows. Recently, fluid with multicomponent and phase change is also included in the equations. By comparing the numerical result with experimental result, the Lattice Boltzmann methods with phase change will be optimized.

Keywords: Frozen soil, Lattice Boltzmann method, Phase change, Test rig.

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

Authors: Christian H. Sanabria-Montaña, Rodrigo Huerta-Quintanilla

Abstract:

A lattice network is a special type of network in which all nodes have the same number of links, and its boundary conditions are periodic. The most basic lattice network is the ring, a one-dimensional network with periodic border conditions. In contrast, the Cartesian product of d rings forms a d-dimensional lattice network. An analytical expression currently exists for the clustering coefficient in this type of network, but the theoretical value is valid only up to certain connectivity value; in other words, the analytical expression is incomplete. Here we obtain analytically the clustering coefficient expression in d-dimensional lattice networks for any link density. Our analytical results show that the clustering coefficient for a lattice network with density of links that tend to 1, leads to the value of the clustering coefficient of a fully connected network. We developed a model on criminology in which the generalized clustering coefficient expression is applied. The model states that delinquents learn the know-how of crime business by sharing knowledge, directly or indirectly, with their friends of the gang. This generalization shed light on the network properties, which is important to develop new models in different fields where network structure plays an important role in the system dynamic, such as criminology, evolutionary game theory, econophysics, among others.

Keywords: Clustering coefficient, criminology, generalized, regular network d-dimensional.

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

Authors: Ahmed Mahmoudi, Imen Mejri, Mohamed A. Abbassi, Ahmed Omri

Abstract:

In this paper, the 1-D conduction-radiation problem is solved by the lattice Boltzmann method. The effects of various parameters such as the scattering albedo, the conduction–radiation parameter and the wall emissivity are studied. In order to check on the accuracy of the numerical technique employed for the solution of the considered problem, the present numerical code was validated with the published study. The found results are in good agreement with those published

Keywords: Conduction, lattice Boltzmann method, planar medium, radiation.

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

Authors: Munehiro Iwami

Abstract:

A property is persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property. Zantema showed that termination is persistent for term rewriting systems without collapsing or duplicating rules. In this paper, we show that the Zantema's result can be extended to term rewriting systems on ordered sorts, i.e., termination is persistent for term rewriting systems on ordered sorts without collapsing, decreasing or duplicating rules. Furthermore we give the example as application of this result. Also we obtain that completeness is persistent for this class of term rewriting systems.

Keywords: Theory of computing, Model-based reasoning, term rewriting system, termination

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

Authors: Mondher Yahyaoui

Abstract:

A generalized vortex lattice method for complex lifting surfaces with flap and aileron deflection is formulated. The method is not restricted by the linearized theory assumption and accounts for all standard geometric lifting surface parameters: camber, taper, sweep, washout, dihedral, in addition to flap and aileron deflection. Thickness is not accounted for since the physical lifting body is replaced by a lattice of panels located on the mean camber surface. This panel lattice setup and the treatment of different wake geometries is what distinguish the present work form the overwhelming majority of previous solutions based on the vortex lattice method. A MATLAB code implementing the proposed formulation is developed and validated by comparing our results to existing experimental and numerical ones and good agreement is demonstrated. It is then used to study the accuracy of the widely used classical vortex-lattice method. It is shown that the classical approach gives good agreement in the clean configuration but is off by as much as 30% when a flap or aileron deflection of 30° is imposed. This discrepancy is mainly due the linearized theory assumption associated with the conventional method. A comparison of the effect of four different wake geometries on the values of aerodynamic coefficients was also carried out and it is found that the choice of the wake shape had very little effect on the results.

Keywords: Aileron deflection, camber-surface-bound vortices, classical VLM, Generalized VLM, flap deflection.

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

Authors: Ezequiel Herruzo, Juan José Cruz, José Ignacio Benavides, Oscar Plata

Abstract:

This paper describes a new algorithm of arrangement in parallel, based on Odd-Even Mergesort, called division and concurrent mixes. The main idea of the algorithm is to achieve that each processor uses a sequential algorithm for ordering a part of the vector, and after that, for making the processors work in pairs in order to mix two of these sections ordered in a greater one, also ordered; after several iterations, the vector will be completely ordered. The paper describes the implementation of the new algorithm on a Message Passing environment (such as MPI). Besides, it compares the obtained experimental results with the quicksort sequential algorithm and with the parallel implementations (also on MPI) of the algorithms quicksort and bitonic sort. The comparison has been realized in an 8 processors cluster under GNU/Linux which is running on a unique PC processor.

Keywords: Parallel algorithm, arrangement, MPI, sorting, parallel program.

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

Authors: Ryuya Uda

Abstract:

On existing online shopping on the web, SSL and password are usually used to achieve the secure trades. SSL shields communication from the third party who is not related with the trade, and indicates that the trader's web site is authenticated by one of the certification authority. Password certifies a customer as the same person who has visited the trader's web site before, and protects the customer's privacy such as what the customer has bought on the site. However, there is no forensics for the trades in those cased above. With existing methods, no one can prove what is ordered by customers, how many products are ordered and even whether customers have ordered or not. The reason is that the third party has to guess what were traded with logs that are held by traders and by customers. The logs can easily be created, deleted and forged since they are electronically stored. To enhance security with digital forensics for electronic commerce on the web, I indicate a secure method with cellular phones.

Keywords: Cellular Phone, Digital Forensics, ElectronicCommerce, Information Security

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