In this paper, the sampling theorem for bandlimited functions over
domains is
generalized to one over ∏
domains. The generalized theorem is applicable to the
experimental design model in which each factor has a different number of levels and enables us
to estimate the parameters in the model by using Fourier transforms. Moreover, the relationship
between the proposed sampling theorem and orthogonal arrays is also provided.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
Symbolic Computation via Gröbner BasisIJERA Editor
The purpose of this paper is to find the orthogonal projection of a rational parametric curve onto a rational parametric surface in 3-space. We show that the orthogonal projection problem can be reduced to the problem of finding elimination ideals via Gröbnerbasis. We provide a computational algorithm to find the orthogonal projection, and include a few illustrative examples. The presented method is effective and potentially useful for many applications related to the design of surfaces and other industrial and research fields.
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.
Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...IJERA Editor
This paper presents a solution methodology for transportation problem in an intuitionistic fuzzy environment in
which cost are represented by pentagonal intuitionistic fuzzy numbers. Transportation problem is a particular
class of linear programming, which is associated with day to day activities in our real life. It helps in solving
problems on distribution and transportation of resources from one place to another. The objective is to satisfy
the demand at destination from the supply constraints at the minimum transportation cost possible. The problem
is solved using a ranking technique called Accuracy function for pentagonal intuitionistic fuzzy numbers and
Russell’s Method
The Fuzzy set Theory has been applied in many fields such as Management, Engineering etc. In this paper a new operation on Hexagonal Fuzzy number is defined where the methods of addition, subtraction, and multiplication has been modified with some conditions. The main aim of this paper is to introduce a new operation for addition, subtraction and multiplication of Hexagonal Fuzzy number on the basis of alpha cut sets of fuzzy numbers
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.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
Symbolic Computation via Gröbner BasisIJERA Editor
The purpose of this paper is to find the orthogonal projection of a rational parametric curve onto a rational parametric surface in 3-space. We show that the orthogonal projection problem can be reduced to the problem of finding elimination ideals via Gröbnerbasis. We provide a computational algorithm to find the orthogonal projection, and include a few illustrative examples. The presented method is effective and potentially useful for many applications related to the design of surfaces and other industrial and research fields.
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.
Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...IJERA Editor
This paper presents a solution methodology for transportation problem in an intuitionistic fuzzy environment in
which cost are represented by pentagonal intuitionistic fuzzy numbers. Transportation problem is a particular
class of linear programming, which is associated with day to day activities in our real life. It helps in solving
problems on distribution and transportation of resources from one place to another. The objective is to satisfy
the demand at destination from the supply constraints at the minimum transportation cost possible. The problem
is solved using a ranking technique called Accuracy function for pentagonal intuitionistic fuzzy numbers and
Russell’s Method
The Fuzzy set Theory has been applied in many fields such as Management, Engineering etc. In this paper a new operation on Hexagonal Fuzzy number is defined where the methods of addition, subtraction, and multiplication has been modified with some conditions. The main aim of this paper is to introduce a new operation for addition, subtraction and multiplication of Hexagonal Fuzzy number on the basis of alpha cut sets of fuzzy numbers
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.
Applied Mathematics and Sciences: An International Journal (MathSJ)mathsjournal
The main goal of this research is to give the complete conception about numerical integration including
Newton-Cotes formulas and aimed at comparing the rate of performance or the rate of accuracy of
Trapezoidal, Simpson’s 1/3, and Simpson’s 3/8. To verify the accuracy, we compare each rules
demonstrating the smallest error values among them. The software package MATLAB R2013a is applied to
determine the best method, as well as the results, are compared. It includes graphical comparisons
mentioning these methods graphically. After all, it is then emphasized that the among methods considered,
Simpson’s 1/3 is more effective and accurate when the condition of the subdivision is only even for solving
a definite integral.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
A Fixed Point Theorem Using Common Property (E. A.) In PM Spacesinventionjournals
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Correlation measure for intuitionistic fuzzy multi setseSAT Journals
Abstract In this paper, the Correlation measure of Intuitionistic Fuzzy Multi sets (IFMS) is proposed. The concept of this Correlation measure of IFMS is the extension of Correlation measure of IFS. Using the Correlation of IFMS measure, the application of medical diagnosis and pattern recognition are presented. The new method also shows that the correlation measure of any two IFMS equals one if and only if the two IFMS are the same. Keywords: Intuitionistic fuzzy set, Intuitionistic Fuzzy Multi sets, Correlation measure.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Conditional mixture model for modeling attributed dyadic dataLoc Nguyen
Dyadic data contains co-occurrences of objects, which is often modeled by finite mixture model which in turn is learned by expectation maximization (EM) algorithm. Objects in traditional dyadic data are identified by names, causing the drawback which is that it is impossible to extract implicit valuable knowledge under objects. In this research, I propose the so-called attributed dyadic data (ADD) in which each object has an informative attribute and each co-occurrence of two objects is associated with a value. ADD is flexible and covers most of structures / forms of dyadic data. Conditional mixture model (CMM), which is a variant of finite mixture model, is applied into learning ADD. Moreover, a significant feature of CMM is that any co-occurrence of two objects is based on some conditional variable. As a result, CMM can predict or estimate co-occurrent values based on regression model, which extends applications of ADD and CMM.
On The Distribution of Non - Zero Zeros of Generalized Mittag – Leffler Funct...IJERA Editor
In this work, we derive some theorems involving distribution of non – zero zeros of generalized Mittag – Leffler functions of one and two variables. Mathematics Subject Classification 2010: Primary; 33E12. Secondary; 33C65, 26A33, 44A20
Applied Mathematics and Sciences: An International Journal (MathSJ)mathsjournal
The main goal of this research is to give the complete conception about numerical integration including
Newton-Cotes formulas and aimed at comparing the rate of performance or the rate of accuracy of
Trapezoidal, Simpson’s 1/3, and Simpson’s 3/8. To verify the accuracy, we compare each rules
demonstrating the smallest error values among them. The software package MATLAB R2013a is applied to
determine the best method, as well as the results, are compared. It includes graphical comparisons
mentioning these methods graphically. After all, it is then emphasized that the among methods considered,
Simpson’s 1/3 is more effective and accurate when the condition of the subdivision is only even for solving
a definite integral.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
A Fixed Point Theorem Using Common Property (E. A.) In PM Spacesinventionjournals
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Correlation measure for intuitionistic fuzzy multi setseSAT Journals
Abstract In this paper, the Correlation measure of Intuitionistic Fuzzy Multi sets (IFMS) is proposed. The concept of this Correlation measure of IFMS is the extension of Correlation measure of IFS. Using the Correlation of IFMS measure, the application of medical diagnosis and pattern recognition are presented. The new method also shows that the correlation measure of any two IFMS equals one if and only if the two IFMS are the same. Keywords: Intuitionistic fuzzy set, Intuitionistic Fuzzy Multi sets, Correlation measure.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Conditional mixture model for modeling attributed dyadic dataLoc Nguyen
Dyadic data contains co-occurrences of objects, which is often modeled by finite mixture model which in turn is learned by expectation maximization (EM) algorithm. Objects in traditional dyadic data are identified by names, causing the drawback which is that it is impossible to extract implicit valuable knowledge under objects. In this research, I propose the so-called attributed dyadic data (ADD) in which each object has an informative attribute and each co-occurrence of two objects is associated with a value. ADD is flexible and covers most of structures / forms of dyadic data. Conditional mixture model (CMM), which is a variant of finite mixture model, is applied into learning ADD. Moreover, a significant feature of CMM is that any co-occurrence of two objects is based on some conditional variable. As a result, CMM can predict or estimate co-occurrent values based on regression model, which extends applications of ADD and CMM.
On The Distribution of Non - Zero Zeros of Generalized Mittag – Leffler Funct...IJERA Editor
In this work, we derive some theorems involving distribution of non – zero zeros of generalized Mittag – Leffler functions of one and two variables. Mathematics Subject Classification 2010: Primary; 33E12. Secondary; 33C65, 26A33, 44A20
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...mathsjournal
In the earlier work, Knuth present an algorithm to decrease the coefficient growth in the Euclidean algorithm of polynomials called subresultant algorithm. However, the output polynomials may have a small factor which can be removed. Then later, Brown of Bell Telephone Laboratories showed the subresultant in another way by adding a variant called 𝜏 and gave a way to compute the variant. Nevertheless, the way failed to determine every 𝜏 correctly.
In this paper, we will give a probabilistic algorithm to determine the variant 𝜏 correctly in most cases by adding a few steps instead of computing 𝑡(𝑥) when given 𝑓(𝑥) and𝑔(𝑥) ∈ ℤ[𝑥], where 𝑡(𝑥) satisfies that 𝑠(𝑥)𝑓(𝑥) + 𝑡(𝑥)𝑔(𝑥) = 𝑟(𝑥), here 𝑡(𝑥), 𝑠(𝑥) ∈ ℤ[𝑥]
In this chapter, the authors extend the theory of
the generalized difference Operator ∆L to the generalized
difference operator of the 풏
풕풉kind denoted by ∆L Where L
=푳 = {풍ퟏ,풍ퟐ,….풍풏} of positive reals풍ퟏ,풍ퟐ,….풍풏and obtain some
interesting results on the relation between the generalized
polynomial factorial of the first kind, 풏
풕풉kind and algebraic
polynomials. Also formulae for the sum of the general
partial sums of products of several powers of consecutive
terms of an Arithmetic progression in number theory are
derived.
THE LEFT AND RIGHT BLOCK POLE PLACEMENT COMPARISON STUDY: APPLICATION TO FLIG...ieijjournal1
It is known that if a linear-time-invariant MIMO system described by a state space equation has a number
of states divisible by the number of inputs and it can be transformed to block controller form, we can
design a state feedback controller using block pole placement technique by assigning a set of desired Block
poles. These may be left or right block poles. The idea is to compare both in terms of system’s response.
THE LEFT AND RIGHT BLOCK POLE PLACEMENT COMPARISON STUDY: APPLICATION TO FLIG...ieijjournal
It is known that if a linear-time-invariant MIMO system described by a state space equation has a number of states divisible by the number of inputs and it can be transformed to block controller form, we can design a state feedback controller using block pole placement technique by assigning a set of desired Block poles. These may be left or right block poles. The idea is to compare both in terms of system’s response.
A PROBABILISTIC ALGORITHM OF COMPUTING THE POLYNOMIAL GREATEST COMMON DIVISOR...ijscmcj
In the earlier work, subresultant algorithm was proposed to decrease the coefficient growth in the Euclidean algorithm of polynomials. However, the output polynomial remainders may have a small factor which can be removed to satisfy our needs. Then later, an improved subresultant algorithm was given by representing the subresultant algorithm in another way, where we add a variant called 𝜏 to express the small factor. There was a way to compute the variant proposed by Brown, who worked at IBM. Nevertheless, the way failed to determine each𝜏 correctly.
Generalized Laplace - Mellin Integral TransformationIJERA Editor
The main propose of this paper is to generalized Laplace-Mellin Integral Transformation in between the positive regions of real axis. We have derived some new properties and theorems .And give selected tables for Laplace-Mellin Integral Transformation.
A Non Local Boundary Value Problem with Integral Boundary ConditionIJMERJOURNAL
ABSTRACT: In this article a three point boundary value problem associated with a second order differential equation with integral type boundary conditions is proposed. Then its solution is developed with the help of the Green’s function associated with the homogeneous equation. Using this idea and Iteration method is proposed to solve the corresponding linear problem.
Time Delay and Mean Square Stochastic Differential Equations in Impetuous Sta...ijtsrd
This paper specially exhibits about the time delay and mean square stochastic differential equations in impetuous stabilization is analyzed. By projecting a delay differential inequality and using the stochastic analysis technique, a few present stage for mean square exponential stabilization are survived. It is express that an unstable stochastic delay system can be achieved some stability by impetuous. This example is also argued to derived the efficiency of the obtained results. G. Pramila | S. Ramadevi"Time Delay and Mean Square Stochastic Differential Equations in Impetuous Stabilization" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: http://www.ijtsrd.com/papers/ijtsrd11062.pdf http://www.ijtsrd.com/humanities-and-the-arts/other/11062/time-delay-and-mean-square-stochastic-differential-equations-in-impetuous-stabilization/g-pramila
The power and beauty of mathematics could work for or against us depending on how we handle its intricacies.
See how easy it is to design a pattern and how illusory is the idea of finding that unique pattern describing the true insight.
APPROACHES IN USING EXPECTATIONMAXIMIZATION ALGORITHM FOR MAXIMUM LIKELIHOOD ...cscpconf
EM algorithm is popular in maximum likelihood estimation of parameters for state-space models. However, extant approaches for the realization of EM algorithm are still not able to fulfill the task of identification systems, which have external inputs and constrained parameters. In this paper, we propose new approaches for both initial guessing and MLE of the parameters of a constrained state-space model with an external input. Using weighted least square for the initial guess and the partial differentiation of the joint log-likelihood function for the EM algorithm, we estimate the parameters and compare the estimated values with the “actual” values, which are set to generate simulation data. Moreover, asymptotic variances of the estimated parameters are calculated when the sample size is large, while statistics of the estimated parameters are obtained through bootstrapping when the sample size issmall. The results demonstrate that the estimated values are close to the “actual” values.Consequently, our approaches are promising and can applied in future research.
Sequence Entropy and the Complexity Sequence Entropy For 𝒁𝒏ActionIJRES Journal
In this paper, we study the complexity of sequence entropy for 𝑍𝑛 actions. After that, we define 𝐶𝛼 𝐹𝛼 𝜏 , ℎ𝛼 𝐹𝛼 𝜏 and the relationships between sequence entropy and complexity sequence entropy. Finally, comparisons between sequence entropy and complexity sequence entropy have been done.
Similar to A GENERALIZED SAMPLING THEOREM OVER GALOIS FIELD DOMAINS FOR EXPERIMENTAL DESIGN (20)
ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR cscpconf
The progressive development of Synthetic Aperture Radar (SAR) systems diversify the exploitation of the generated images by these systems in different applications of geoscience. Detection and monitoring surface deformations, procreated by various phenomena had benefited from this evolution and had been realized by interferometry (InSAR) and differential interferometry (DInSAR) techniques. Nevertheless, spatial and temporal decorrelations of the interferometric couples used, limit strongly the precision of analysis results by these techniques. In this context, we propose, in this work, a methodological approach of surface deformation detection and analysis by differential interferograms to show the limits of this technique according to noise quality and level. The detectability model is generated from the deformation signatures, by simulating a linear fault merged to the images couples of ERS1 / ERS2 sensors acquired in a region of the Algerian south.
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATIONcscpconf
A novel based a trajectory-guided, concatenating approach for synthesizing high-quality image real sample renders video is proposed . The lips reading automated is seeking for modeled the closest real image sample sequence preserve in the library under the data video to the HMM predicted trajectory. The object trajectory is modeled obtained by projecting the face patterns into an KDA feature space is estimated. The approach for speaker's face identification by using synthesise the identity surface of a subject face from a small sample of patterns which sparsely each the view sphere. An KDA algorithm use to the Lip-reading image is discrimination, after that work consisted of in the low dimensional for the fundamental lip features vector is reduced by using the 2D-DCT.The mouth of the set area dimensionality is ordered by a normally reduction base on the PCA to obtain the Eigen lips approach, their proposed approach by[33]. The subjective performance results of the cost function under the automatic lips reading modeled , which wasn’t illustrate the superior performance of the
method.
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...cscpconf
Universities offer software engineering capstone course to simulate a real world-working environment in which students can work in a team for a fixed period to deliver a quality product. The objective of the paper is to report on our experience in moving from Waterfall process to Agile process in conducting the software engineering capstone project. We present the capstone course designs for both Waterfall driven and Agile driven methodologies that highlight the structure, deliverables and assessment plans.To evaluate the improvement, we conducted a survey for two different sections taught by two different instructors to evaluate students’ experience in moving from traditional Waterfall model to Agile like process. Twentyeight students filled the survey. The survey consisted of eight multiple-choice questions and an open-ended question to collect feedback from students. The survey results show that students were able to attain hands one experience, which simulate a real world-working environment. The results also show that the Agile approach helped students to have overall better design and avoid mistakes they have made in the initial design completed in of the first phase of the capstone project. In addition, they were able to decide on their team capabilities, training needs and thus learn the required technologies earlier which is reflected on the final product quality
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIEScscpconf
Using social media in education provides learners with an informal way for communication. Informal communication tends to remove barriers and hence promotes student engagement. This paper presents our experience in using three different social media technologies in teaching software project management course. We conducted different surveys at the end of every semester to evaluate students’ satisfaction and engagement. Results show that using social media enhances students’ engagement and satisfaction. However, familiarity with the tool is an important factor for student satisfaction.
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGICcscpconf
In real world computing environment with using a computer to answer questions has been a human dream since the beginning of the digital era, Question-answering systems are referred to as intelligent systems, that can be used to provide responses for the questions being asked by the user based on certain facts or rules stored in the knowledge base it can generate answers of questions asked in natural , and the first main idea of fuzzy logic was to working on the problem of computer understanding of natural language, so this survey paper provides an overview on what Question-Answering is and its system architecture and the possible relationship and
different with fuzzy logic, as well as the previous related research with respect to approaches that were followed. At the end, the survey provides an analytical discussion of the proposed QA models, along or combined with fuzzy logic and their main contributions and limitations.
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS cscpconf
Human beings generate different speech waveforms while speaking the same word at different times. Also, different human beings have different accents and generate significantly varying speech waveforms for the same word. There is a need to measure the distances between various words which facilitate preparation of pronunciation dictionaries. A new algorithm called Dynamic Phone Warping (DPW) is presented in this paper. It uses dynamic programming technique for global alignment and shortest distance measurements. The DPW algorithm can be used to enhance the pronunciation dictionaries of the well-known languages like English or to build pronunciation dictionaries to the less known sparse languages. The precision measurement experiments show 88.9% accuracy.
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS cscpconf
In education, the use of electronic (E) examination systems is not a novel idea, as Eexamination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments.
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTICcscpconf
African Buffalo Optimization (ABO) is one of the most recent swarms intelligence based metaheuristics. ABO algorithm is inspired by the buffalo’s behavior and lifestyle. Unfortunately, the standard ABO algorithm is proposed only for continuous optimization problems. In this paper, the authors propose two discrete binary ABO algorithms to deal with binary optimization problems. In the first version (called SBABO) they use the sigmoid function and probability model to generate binary solutions. In the second version (called LBABO) they use some logical operator to operate the binary solutions. Computational results on two knapsack problems (KP and MKP) instances show the effectiveness of the proposed algorithm and their ability to achieve good and promising solutions.
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAINcscpconf
In recent years, many malware writers have relied on Dynamic Domain Name Services (DDNS) to maintain their Command and Control (C&C) network infrastructure to ensure a persistence presence on a compromised host. Amongst the various DDNS techniques, Domain Generation Algorithm (DGA) is often perceived as the most difficult to detect using traditional methods. This paper presents an approach for detecting DGA using frequency analysis of the character distribution and the weighted scores of the domain names. The approach’s feasibility is demonstrated using a range of legitimate domains and a number of malicious algorithmicallygenerated domain names. Findings from this study show that domain names made up of English characters “a-z” achieving a weighted score of < 45 are often associated with DGA. When a weighted score of < 45 is applied to the Alexa one million list of domain names, only 15% of the domain names were treated as non-human generated.
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...cscpconf
The amount of piracy in the streaming digital content in general and the music industry in specific is posing a real challenge to digital content owners. This paper presents a DRM solution to monetizing, tracking and controlling online streaming content cross platforms for IP enabled devices. The paper benefits from the current advances in Blockchain and cryptocurrencies. Specifically, the paper presents a Global Music Asset Assurance (GoMAA) digital currency and presents the iMediaStreams Blockchain to enable the secure dissemination and tracking of the streamed content. The proposed solution provides the data owner the ability to control the flow of information even after it has been released by creating a secure, selfinstalled, cross platform reader located on the digital content file header. The proposed system provides the content owners’ options to manage their digital information (audio, video, speech, etc.), including the tracking of the most consumed segments, once it is release. The system benefits from token distribution between the content owner (Music Bands), the content distributer (Online Radio Stations) and the content consumer(Fans) on the system blockchain.
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEMcscpconf
This paper discusses the importance of verb suffix mapping in Discourse translation system. In
discourse translation, the crucial step is Anaphora resolution and generation. In Anaphora
resolution, cohesion links like pronouns are identified between portions of text. These binders
make the text cohesive by referring to nouns appearing in the previous sentences or nouns
appearing in sentences after them. In Machine Translation systems, to convert the source
language sentences into meaningful target language sentences the verb suffixes should be
changed as per the cohesion links identified. This step of translation process is emphasized in
the present paper. Specifically, the discussion is on how the verbs change according to the
subjects and anaphors. To explain the concept, English is used as the source language (SL) and
an Indian language Telugu is used as Target language (TL)
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...cscpconf
In this paper, based on the definition of conformable fractional derivative, the functional
variable method (FVM) is proposed to seek the exact traveling wave solutions of two higherdimensional
space-time fractional KdV-type equations in mathematical physics, namely the
(3+1)-dimensional space–time fractional Zakharov-Kuznetsov (ZK) equation and the (2+1)-
dimensional space–time fractional Generalized Zakharov-Kuznetsov-Benjamin-Bona-Mahony
(GZK-BBM) equation. Some new solutions are procured and depicted. These solutions, which
contain kink-shaped, singular kink, bell-shaped soliton, singular soliton and periodic wave
solutions, have many potential applications in mathematical physics and engineering. The
simplicity and reliability of the proposed method is verified.
AUTOMATED PENETRATION TESTING: AN OVERVIEWcscpconf
The using of information technology resources is rapidly increasing in organizations,
businesses, and even governments, that led to arise various attacks, and vulnerabilities in the
field. All resources make it a must to do frequently a penetration test (PT) for the environment
and see what can the attacker gain and what is the current environment's vulnerabilities. This
paper reviews some of the automated penetration testing techniques and presents its
enhancement over the traditional manual approaches. To the best of our knowledge, it is the
first research that takes into consideration the concept of penetration testing and the standards
in the area.This research tackles the comparison between the manual and automated
penetration testing, the main tools used in penetration testing. Additionally, compares between
some methodologies used to build an automated penetration testing platform.
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORKcscpconf
Since the mid of 1990s, functional connectivity study using fMRI (fcMRI) has drawn increasing
attention of neuroscientists and computer scientists, since it opens a new window to explore
functional network of human brain with relatively high resolution. BOLD technique provides
almost accurate state of brain. Past researches prove that neuro diseases damage the brain
network interaction, protein- protein interaction and gene-gene interaction. A number of
neurological research paper also analyse the relationship among damaged part. By
computational method especially machine learning technique we can show such classifications.
In this paper we used OASIS fMRI dataset affected with Alzheimer’s disease and normal
patient’s dataset. After proper processing the fMRI data we use the processed data to form
classifier models using SVM (Support Vector Machine), KNN (K- nearest neighbour) & Naïve
Bayes. We also compare the accuracy of our proposed method with existing methods. In future,
we will other combinations of methods for better accuracy.
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...cscpconf
In order to treat and analyze real datasets, fuzzy association rules have been proposed. Several
algorithms have been introduced to extract these rules. However, these algorithms suffer from
the problems of utility, redundancy and large number of extracted fuzzy association rules. The
expert will then be confronted with this huge amount of fuzzy association rules. The task of
validation becomes fastidious. In order to solve these problems, we propose a new validation
method. Our method is based on three steps. (i) We extract a generic base of non redundant
fuzzy association rules by applying EFAR-PN algorithm based on fuzzy formal concept analysis.
(ii) we categorize extracted rules into groups and (iii) we evaluate the relevance of these rules
using structural equation model.
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATAcscpconf
In many applications of data mining, class imbalance is noticed when examples in one class are
overrepresented. Traditional classifiers result in poor accuracy of the minority class due to the
class imbalance. Further, the presence of within class imbalance where classes are composed of
multiple sub-concepts with different number of examples also affect the performance of
classifier. In this paper, we propose an oversampling technique that handles between class and
within class imbalance simultaneously and also takes into consideration the generalization
ability in data space. The proposed method is based on two steps- performing Model Based
Clustering with respect to classes to identify the sub-concepts; and then computing the
separating hyperplane based on equal posterior probability between the classes. The proposed
method is tested on 10 publicly available data sets and the result shows that the proposed
method is statistically superior to other existing oversampling methods.
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCHcscpconf
Data collection is an essential, but manpower intensive procedure in ecological research. An
algorithm was developed by the author which incorporated two important computer vision
techniques to automate data cataloging for butterfly measurements. Optical Character
Recognition is used for character recognition and Contour Detection is used for imageprocessing.
Proper pre-processing is first done on the images to improve accuracy. Although
there are limitations to Tesseract’s detection of certain fonts, overall, it can successfully identify
words of basic fonts. Contour detection is an advanced technique that can be utilized to
measure an image. Shapes and mathematical calculations are crucial in determining the precise
location of the points on which to draw the body and forewing lines of the butterfly. Overall,
92% accuracy were achieved by the program for the set of butterflies measured.
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...cscpconf
Smart cities utilize Internet of Things (IoT) devices and sensors to enhance the quality of the city
services including energy, transportation, health, and much more. They generate massive
volumes of structured and unstructured data on a daily basis. Also, social networks, such as
Twitter, Facebook, and Google+, are becoming a new source of real-time information in smart
cities. Social network users are acting as social sensors. These datasets so large and complex
are difficult to manage with conventional data management tools and methods. To become
valuable, this massive amount of data, known as 'big data,' needs to be processed and
comprehended to hold the promise of supporting a broad range of urban and smart cities
functions, including among others transportation, water, and energy consumption, pollution
surveillance, and smart city governance. In this work, we investigate how social media analytics
help to analyze smart city data collected from various social media sources, such as Twitter and
Facebook, to detect various events taking place in a smart city and identify the importance of
events and concerns of citizens regarding some events. A case scenario analyses the opinions of
users concerning the traffic in three largest cities in the UAE
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGEcscpconf
The anonymity of social networks makes it attractive for hate speech to mask their criminal
activities online posing a challenge to the world and in particular Ethiopia. With this everincreasing
volume of social media data, hate speech identification becomes a challenge in
aggravating conflict between citizens of nations. The high rate of production, has become
difficult to collect, store and analyze such big data using traditional detection methods. This
paper proposed the application of apache spark in hate speech detection to reduce the
challenges. Authors developed an apache spark based model to classify Amharic Facebook
posts and comments into hate and not hate. Authors employed Random forest and Naïve Bayes
for learning and Word2Vec and TF-IDF for feature selection. Tested by 10-fold crossvalidation,
the model based on word2vec embedding performed best with 79.83%accuracy. The
proposed method achieve a promising result with unique feature of spark for big data.
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXTcscpconf
This article presents Part of Speech tagging for Nepali text using General Regression Neural
Network (GRNN). The corpus is divided into two parts viz. training and testing. The network is
trained and validated on both training and testing data. It is observed that 96.13% words are
correctly being tagged on training set whereas 74.38% words are tagged correctly on testing
data set using GRNN. The result is compared with the traditional Viterbi algorithm based on
Hidden Markov Model. Viterbi algorithm yields 97.2% and 40% classification accuracies on
training and testing data sets respectively. GRNN based POS Tagger is more consistent than the
traditional Viterbi decoding technique.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
2. 238 Computer Science & Information Technology (CS & IT)
2. PRELIMINARIES
2.1 Fourier Analysis on Finite Abelian Groups
Here, a brief explanation of Fourier analysis on finite Abelian groups is provided. Characters are
important in the context of finite Fourier series.
2.1.1 Characters [5]
Let ܩ be a finite Abelian group (with the additive notation), and let ܵଵ
be the unit circle in the
complex plane. A character on ܩ is a complex-valued function ߯: ܩ → ܵଵ
that satisfies the
condition
߯൫࢞ + ࢞′
൯ = ߯ሺ࢞ሻ߯൫࢞′
൯ ∀࢞, ࢞′
∈ .ܩ (1)
In other words, a character is a homomorphism from ܩ to the circle group.
2.1.2 Fourier Transform [4]
Let ܩ, ݅ = 1,2, ⋯ , ݊, be Abelian groups of respective orders |ܩ| = ݃, ݅ = 1,2, ⋯ ݊, ݃ଵ ≤ ݃ଶ ≤
⋯ ≤ ݃, and
ܩ =×ୀଵ
ܩ ܽ݊݀ ݃ = ෑ ݃
ୀଵ
. ሺ2ሻ
Since the character group of ܩ is isomorphic to ,ܩ we can index the characters by the elements of
,ܩ that is, ሼ ߯࢝ሺ࢞ሻ|࢝ ∈ }ܩ are the characters of .ܩ Note that ߯ሺ࢞ሻ is the principal character, and
it is identically equal to 1. The charactersሼ ߯࢝ሺ࢞ሻ|࢝ ∈ }ܩ form an orthonormal system:
1
݃
߯࢝ሺ࢞ሻ߯ࢠ
∗ሺ࢞ሻ
࢞∈ீ
= ቄ
1, ࢝ = ࢠ,
0, ࢝ ≠ ࢠ,
ሺ3ሻ
where ߯ࢠ
∗ሺ࢞ሻ is the complex conjugate of ߯ࢠሺ࢞ሻ.
Any function ݂: ܩ → ℂ, where ℂ is the field of complex numbers, can be uniquely expressed as a
linear combination of the following characters:
݂ሺ࢞ሻ = ݂࢝
࢝ ∈ீ
߯࢝ሺ࢞ሻ, ሺ4ሻ
where the complex number
݂࢝ =
1
݃
݂ሺ࢞ሻ
࢞ ∈ீ
߯࢝
∗ ሺ࢞ሻ, ሺ5ሻ
is the ࢝-th Fourier coefficient of ݂.
3. Computer Science & Information Technology (CS & IT) 239
2.2 Fourier Analysis on ∏ୀ
ࡳࡲሺሻ
Assume that ݍ, ݅ = 1,2, ⋯ ݊, are prime powers. Let ܨܩሺݍሻ, ݅ = 1,2, ⋯ ݊, be a Galois fields of
respective orders ݍ, ݅ = 1,2, ⋯ ݊, which contain finite numbers of elements. We also use
∏ୀଵ
ܨܩሺݍሻ to denote the set of all ݊-tuples with entries from ܨܩሺݍሻ, ݅ = 1,2, ⋯ ݊. The
elements of ∏ୀଵ
ܨܩሺݍሻ are expressed as vectors.
Example 1: Consider ܨܩሺ2ሻ = ሼ0,1} and ܨܩሺ3ሻ = ሼ0,1,2}. Then, if ݊ = 3 and ݍଵ = 2, ݍଶ =
2, ݍଷ = 3,
ෑ ܨܩሺݍሻ
ଷ
ୀଵ
= ሼ000,001,002,010,011,012,100,101,102,110,111,112}.
Specifying the group ܩ in Sect. 2.1.2 to be the group of ∏ୀଵ
ܨܩሺݍሻ and ݃ = ∏ୀଵ
ݍ, the
relations (3),(4) and (5) also hold over the ∏ୀଵ
ܨܩሺݍሻ domain.
Then, the characters ሼ ߯࢝ሺ࢞ሻ|࢝ ∈ ∏ୀଵ
ܨܩሺݍሻ} form an orthonormal system:
1
∏ୀଵ
ݍ
߯࢝ሺ࢞ሻ߯ࢠ
∗ሺ࢞ሻ
࢞∈∏సభ
ீிሺሻ
= ቄ
1, ࢝ = ࢠ,
0, ࢝ ≠ ࢠ,
ሺ6ሻ
Any function ݂: ∏ୀଵ
ܨܩሺݍሻ → ℂ, can be uniquely expressed as a linear combination of the
following characters:
݂ሺ࢞ሻ = ݂࢝
࢝ ∈∏సభ
ீிሺሻ
߯࢝ሺ࢞ሻ, ሺ7ሻ
where the complex number
݂࢝ =
1
∏ୀଵ
ݍ
݂ሺ࢞ሻ
࢞ ∈∏సభ
ீிሺሻ
߯࢝
∗ ሺ࢞ሻ, ሺ8ሻ
is the ࢝-th Fourier coefficient of ݂.
3. EXPERIMENTAL DESIGN
In this section, a short introduction to experimental design [2], [7] is provided.
3.1 Experimental Design Model
Let ܨଵ, ܨଶ, ⋯ , ܨ denote the ݊ factors to be included in an experiment. The levels of factor ܨ can
be represented by ܨܩሺݍሻ, and the level combinations can be represented by the ݊-tuples
࢞ = ሺݔଵ, ݔଶ, ⋯ , ݔሻ ∈ ∏ୀଵ
ܨܩሺݍሻ.
Example 2:
Let Machine (ܨଵ) and Worker (ܨଶ) be factors that might influence the quantity of a product.
ܨଵ : new machine (level 0), old machine (level 1),
4. 240 Computer Science & Information Technology (CS & IT)
ܨଶ: highly skilled worker (level 0), average skilled worker (level 1), unskilled worker (level 2).
For example, ࢞ = 01 represents a combination of new machine and average skilled worker.
Then, the effect of the machine, averaged over all workers, is referred to as the effect of main
factor ܨଵ. Similarly, the effect of the worker, averaged over both machines, is referred to as the
effect of main factor ܨଶ. The contrast between the effect of the machine for a highly skilled
worker, the effect of the machine for an average skilled worker, and the effect of the machine for
an unskilled worker is referred to as the effect of the interaction of ܨଵ and ܨଶ.
Next, an explanation of the model in the context of experimental design is given. In previous
works [8], [9], [10], all factors were restricted to have the same number of levels. In this paper, I
give the definition of the generalized model in which each factor has a different number of levels
as follows.
Definition 1: Generalized Model
y(x) is used to denote the response of the experiment with level combination x and assume the
model
ݕሺ࢞ሻ = ݂࢝߯࢝ሺ࢞ሻ
࢝∈ூಲ
+ ߳࢞, ሺ9ሻ
where
ܫ = ሼ ሺbଵaଵ, bଶaଶ, … , b୬a୬ሻ|ࢇ ∈ ,ܣ b୧ ∈ ܨܩሺݍሻ}. ሺ10ሻ
The set ܣ ⊆ ሼ 0,1 }୬
represents the general mean, main factors, and interactive factors included
in the model.
(For example, consider ܣ ⊆ ሼ 000,100,010,001,110 }.Then, 000,100,010,001,110 indicate the
general mean, main factor of ܨଵ, main factor of ܨଶ, main factor of ܨଷ, and interactive factor of ܨଵ
and ܨଶ, respectively.) The model includes a random error
߳࢞ satisfying the expected value ܧሺ߳࢞ሻ = 0 and constant variance ߪଶ
.
In addition, it is usually assumed that the set ܣ satisfies the following monotonicity condition [2].
Definition 2: Monotonicity
ࢇ ∈ ܣ → ࢇ′ ∈ ܣ ∀ ࢇ′ ሺࢇ′ ⊑ ࢇሻ, ሺ11ሻ
where ࢇ = ሺܽଵ, ܽଶ, ⋯ , ܽሻ, ࢇ′ = ሺܽ′ଵ, ܽ′ଶ, ⋯ , ܽ′ሻ and ࢇ′ ⊑ ࢇ means that if ܽ = 0 then
ܽ′ = 0, ݅ = 1,2, ⋯ , ݊.
Example 3:
Consider ܣ = ሼ 00000,10000,01000,00100,00010,00001,11000,10100,10010 }.
Since the set ܣ satisfies (11), ܣ is monotonic.
5. Computer Science & Information Technology (CS & IT) 241
Next, let ࢝ = ሺݓଵ, ݓଶ, ⋯ , ݓሻ. The main effect of ܨ is represented by ሼ ݂࢝| ݓ ≠ 0 ܽ݊݀ ݓ =
0 ݂ݎ ݇ ≠ ݅}. The interaction of ܨ and ܨ is represented by ሼ ݂࢝| ݓ ≠ 0 ܽ݊݀ ݓ ≠ 0 ܽ݊݀ ݓ =
0 ݂ݎ ݇ ≠ ݅, ݆}
Example 4:
Consider ܣ given in Example 3 and ݍଵ = 2, ݍ = 3, ݅ = 2, … , 5. Then, ܫ is given by
ܫ = ሼ00000,10000,01000,02000,00100,00200,00010,00020,
00001,00002,11000,12000}.
For example, the main effect of ܨଵ is represented by ݂ଵ, and the interaction of ܨଵ and ܨଶ is
represented by ݂ଵଵ and ݂ଵଶ.
In experimental design, we are given a model of the experiment. In other words, we are given a
set ܣ ⊆ ሼ 0,1 }
. Then, we determine a set of level combinations ݔ ∈ ܺ, ܺ ⊆ ∏ୀଵ
ܨܩሺݍሻ. The
set ܺ is called a design. Next, we perform a set of experiments according to the design ܺ and
estimate the effects from the result, ሼ ሺ࢞, ݕሺ࢞ሻሻ|࢞ ∈ ܺ }.
An important standard for evaluating designs is the maximum of the variances of the unbiased
estimators of effects calculated from the result of the experiments. It is known that, for a given
number of experiments, this criterion is minimized in an orthogonal design [6].
3.2 Orthogonal Designs
In this subsection, a definition of Orthogonal Designs for the generalized model is provided.
Definition 3: Orthogonal Designs
At first, define ݒሺࢇሻ = ሼ݅ |ܽ ≠ 0, 1 ≤ ݅ ≤ ݊ }.
For ࢇ = ሺܽଵଵ, ܽଵଶ, … , ܽଵሻ, ࢇ = ሺܽଶଵ, ܽଶଶ, … , ܽଶሻ ∈ ሼ0,1 }
, the addition of vectors ࢇ and
ࢇ is defined by ࢇ + ࢇ = ሺܽଵଵ ⊕ ܽଶଵ, ܽଵଶ ⊕ ܽଶଶ, … , ܽଵ ⊕ ܽଶሻ, where ⊕ is the exclusive
or operation.
An orthogonal design ܥୄ
for ܣ ⊆ ሼ0,1 }
is satisfies the condition that for any ࢇ, ࢇ′ ∈ ,ܣ
หܥభ,…,
ୄ
ሺ߮ଵ, … , ߮ሻห =
|ܥୄ|
ݍభ
ݍమ
… ݍ
,
߮ଵ ∈ ܨܩ൫ݍభ
൯, … , ߮ ∈ ܨܩ൫ݍ
൯ (12)
where ݅ଵ, … , ݅ are defined by ݒሺࢇ + ࢇᇱሻ = ሼ݅ଵ, … , ݅}, and ܥభ,…,
ୄ
ሺ߮ଵ, … , ߮ሻ = ሼ࢞|ݔభ
=
߮ଵ, … , ݔ
= ߮, ࢞ ∈ ܥୄ
}.
Example 5:
Consider ܣ given in Example 3 and ݍଵ = 2, ݍ = 3, ݅ = 2, … , 5.
Then, an orthogonal design ܥୄ
for ܣ is given as follows.
6. 242 Computer Science & Information Technology (CS & IT)
Table 1. Example of orthogonal design ܥୄ
.
ݔଵ ݔଶ ݔଷ ݔସ ݔହ
1 0 0 0 0 0
2 0 0 1 1 1
3 0 0 2 2 2
4 0 1 0 0 1
5 0 1 1 1 2
6 0 1 2 2 0
7 0 2 0 1 0
8 0 2 1 2 1
9 0 2 2 0 2
10 1 0 0 2 2
11 1 0 1 0 0
12 1 0 2 1 1
13 1 1 0 1 2
14 1 1 1 2 0
15 1 1 2 0 1
16 1 2 0 2 1
17 1 2 1 0 2
18 1 2 2 1 0
The Hamming weight ݓܪሺࢇሻ of a vector ࢇ = ሺܽଵ, ܽଶ, ⋯ , ܽሻ is defined as the number of nonzero
components. As a special case, if ܣ = ሼࢇ|ݓܪሺࢇሻ ≤ ,ݐ ࢇ ∈ ሼ0,1 }
}. ܥୄ
corresponds to the set of
rows of a subarray in a mixed level orthogonal array of strength 2ݐ [1]. Hence, ܥୄ
can be easily
obtained by using the results of orthogonal arrays.
However, because it is generally not easy to construct an orthogonal design for ,ܣ it is important
to consider efficiency in making the algorithm to produce the design. However, because the main
purpose of this paper is not to construct the orthogonal design, the algorithm is not included in
this paper.
4. SAMPLING THEOREM FOR FUNCTIONS OVER GALOIS FIELD
DOMAINS FOR EXPERIMENTAL DESIGN
In this section, I provide a sampling theorem for bandlimited functions over Galois field domains,
which is applicable to the experimental design model in which each factor has a different number
of levels.
4.1 Bandlimited Functions
The range of frequencies of ݂ is defined by a bounded set ܫ ⊂ ∏ୀଵ
ܨܩሺݍሻ. Then, ݂࢝ = 0 for all
࢝ ∈ ∏ୀଵ
ܨܩሺݍሻ ∖ .ܫ Any function whose range of frequencies is confined to a bounded set ܫ is
referred to as bandlimited to .ܫ
7. Computer Science & Information Technology (CS & IT) 243
4.2 A Sampling Theorem for Bandlimited Functions over ∏ୀ
ࡳࡲሺሻ Domains
Theorem 1:
Suppose a set ܣ is monotonic and ݂ሺ࢞ሻ is expressed as
݂ሺ࢞ሻ = ݂࢝
࢝ ∈ ூಲ
߯࢝ሺ࢞ሻ, ሺ13ሻ
where ܫ = ሼ ሺbଵaଵ, bଶaଶ, … , b୬a୬ሻ|ࢇ ∈ ,ܣ b୧ ∈ ܨܩሺݍሻ}. Then, the Fourier coefficients can be
computed by
݂࢝ =
1
|ܥୄ|
݂ሺ࢞ሻ
࢞ ∈఼
߯࢝
∗ ሺ࢞ሻ, ሺ14ሻ
where ܥୄ
is an orthogonal design for .ܣ
The proof of Theorem 1 requires the following three lemmas.
Lemma 1:
For any non principal character ߯ of ,ܪ
߯ሺࢎሻ
ࢎ ∈ு
= 0, ሺ15ሻ
Proof: This follows immediately [5, Lemma 2.4].
Lemma 2:
Suppose a set ܣ is monotonic, and ܥୄ
is an orthogonal design for .ܣ
Then, for ࢝, ࢠ ∈ ܫ,
หܥభ,…,
ୄ
ሺ߮ଵ, … , ߮ሻห =
|ܥୄ|
ݍభ
ݍమ
… ݍ
,
߮ଵ ∈ ܨܩ൫ݍభ
൯, … , ߮ ∈ ܨܩ൫ݍ
൯
(16)
where ݅ଵ, … , ݅are defined by ݒሺࢠ − ݓሻ = ሼ݅ଵ, … , ݅}.
Proof: Let ܵ = ሼ ݒሺࢇ + ࢇᇱሻ|ࢇ, ࢇᇱ
∈ ܣ }. Because a set ܣ is monotonic, ݒሺࢠ − ݓሻ ∈ ܵ holds for
࢝, ࢠ ∈ ܫ. Hence, by the definition of ܥୄ
, equation (16) holds.
Lemma 3:
Suppose a set ܣ is monotonic, and ܥୄ
is an orthogonal design for .ܣ Then,
8. 244 Computer Science & Information Technology (CS & IT)
߯ࢠሺ࢞ሻ߯࢝
∗ ሺ࢞ሻ
࢞∈఼
= ൜
|ܥୄ|, ࢝ = ࢠ;
0, ݐℎ݁,݁ݏ݅ݓݎ
ሺ17ሻ
for all ࢠ ∈ ܫ.
Proof: If ࢝ = ࢠ, then ߯ࢠሺ࢞ሻ߯࢝
∗ ሺ࢞ሻ = ߯ሺ࢞ሻ=1 for any ࢞. Hence, ∑ ߯ࢠሺ࢞ሻ߯࢝
∗ ሺ࢞ሻ࢞∈఼ = |ܥୄ|.
Next, consider the case that ࢝ ≠ ࢠ. Define ࢛ = ࢠ − ࢝ and let ݒሺ࢛ሻ = ሼ݅ଵ, … , ݅}. Then,
߯ࢠሺ࢞ሻ߯࢝
∗ ሺ࢞ሻ
࢞∈఼
= ࢛߯ሺ࢞ሻ
࢞∈఼
ሺ18ሻ
= ߯௨భ,…,௨
൫ݔଵ
, … , ݔ൯
࢞∈఼
ሺ19ሻ
=
|ܥୄ|
ݍభ
ݍమ
… ݍ
൮ ߯௨భ,…,௨
ሺࢎሻ
ࢎ∈∏ೕసభ
ீிቀೕቁ
൲ ሺ20ሻ
where ߯௨ೕ
ቀݔ
ቁ = 1 for ݑ
= 0, was used for the transformation from (18) to (19), and Lemma
2 was used for the transformation from (19) to (20). Then, by (20) and Lemma 1,
∑ ߯ࢠሺ࢞ሻ߯࢝
∗ ሺ࢞ሻ࢞∈఼ = 0 is obtained.
Proof of Theorem 1: The right hand side of Equation (14) is given by
1
|ܥୄ|
݂ሺ࢞ሻ
࢞ ∈఼
߯࢝
∗ ሺ࢞ሻ =
1
|ܥୄ|
൮ ݂ࢠ
ࢠ ∈ ூಲ
߯ࢠሺ࢞ሻ൲
࢞ ∈఼
߯࢝
∗ ሺ࢞ሻ
=
1
|ܥୄ|
݂ࢠ ቌ ߯ࢠሺ࢞ሻ
࢞ ∈఼
߯࢝
∗ ሺ࢞ሻቍ
ࢠ ∈ூಲ
ሺ21ሻ
= ݂࢝ ሺ22ሻ
where Lemma 3 was used for the transformation from (21) to (22). Hence, Theorem 1 is
obtained.
Theorem 1 is applicable to the generalized model given in Definition 1. When we experiment
according to an orthogonal design ܥୄ
, we can obtain unbiased estimators of the ݂࢝ in (9) using
Theorem 1 and the assumption that ϵ࢞ is a random error with zero mean,
݂መ࢝ =
1
|ܥୄ|
݂ሺ࢞ሻ
࢞ ∈఼
߯࢝
∗ ሺ࢞ሻ, ሺ23ሻ
9. Computer Science & Information Technology (CS & IT) 245
Hence, the parameters can be estimated by using Fourier transforms.
5. RELATIONSHIP BETWEEN THE SAMPLING THEOREM AND
ORTHOGONAL ARRAYS
Experiments are frequently conducted according to an orthogonal array. Here, the relationship
between the proposed sampling theorem and orthogonal arrays will be provided.
At first, mixed level orthogonal arrays of strength ݐ are defined as follows.
Definition 4: Orthogonal Arrays of strength ݐ [1]
An Orthogonal Array of strength ݐ is ܰ × ݊ matrix whose ݅-th column contains ݍ different
factor-levels in such a way that, for any $t$ columns, every $t$-tuple of levels appears equally
often in the matrix.
The ܰ rows specify the different experiments to be performed.
Next, the definition of orthogonal arrays of strength ݐ can be generalized by using a bounded set
ܣ instead of the strength .ݐ The definition of the generalized mixed level orthogonal arrays is
provided as follows.
Definition 5: Orthogonal Arrays for ܣ
An orthogonal array for ܣ is an ܰ × ݊ matrix whose ݅-th column contains ݍ different factor-
levels in such a way that, for any ࢇ, ࢇ′ ∈ ,ܣ and for any ݉ columns which are ݅ଵ-th column, …,
݅-th column, where ݅ଵ, … , ݅ are defined by ݒሺࢇ + ࢇᇱሻ = ሼ݅ଵ, … , ݅}, every ݉-tuple of levels
appears equally often in the matrix.
If ܣ = ሼࢇ|ݓܪሺࢇሻ ≤ ,ݐ ࢇ ∈ ሼ0,1}
}, an orthogonal array for ܣ is identical to a mixed level
orthogonal array of strength 2.ݐ In other words, Definition 4 is a special case of Definition 5.
Moreover, by Definition 3 and Definition 5, it is clear that the set of rows of an orthogonal array
for ܣ is an orthogonal design ܥୄ
for .ܣ Hence the following Corollary is obtained from Theorem
1 immediately.
Corollary 1:
Suppose a set ܣ is monotonic and ݂ሺ࢞ሻ is expressed as
݂ሺ࢞ሻ = ݂࢝
࢝ ∈ ூಲ
߯࢝ሺ࢞ሻ, ሺ24ሻ
where ܫ = ሼ ሺbଵaଵ, bଶaଶ, … , b୬a୬ሻ|ࢇ ∈ ,ܣ b୧ ∈ ܨܩሺݍሻ}. Then, the Fourier coefficients can be
computed by
݂࢝ =
1
|ܥୄ|
݂ሺ࢞ሻ
࢞ ∈఼
߯࢝
∗ ሺ࢞ሻ, ሺ25ሻ
10. 246 Computer Science & Information Technology (CS & IT)
where ܥୄ
is the set of rows of an orthogonal array for ܣ defined in Definition 5 and |ܥୄ
| = ܰ.
This corollary shows the relationship between the proposed sampling theorem and orthogonal
arrays.
6. CONCLUSIONS
In this paper, I have generalized the sampling theorem for bandlimited functions over ܨܩሺݍሻ
domains to one over ∏ୀଵ
ܨܩሺݍሻ domains. The generalized theorem is applicable to the
experimental design model in which each factor has a different number of levels and enables us
to estimate the parameters in the model by using Fourier transforms. I have also provided the
relationship between the proposed sampling theorem and orthogonal arrays.
ACKNOWLEDGEMENTS
This paper was partially supported by the Academic Committee of Yokohama College of
Commerce.
REFERENCES
[1] A.S. Hedayat, N.J.A. Sloane and J. Stufken, (1999) Orthogonal Arrays: Theory and Applications,
Springer.
[2] T. Okuno and T. Haga, (1969) Experimental Designs, Baifukan, Tokyo.
[3] A.V. Oppenheim and R.W. Schafer, (1975) Digital Signal Processing, Prentice-Hall.
[4] R.S. Stankovic and J. Astola, (2007) “Reading the Sampling Theorem in Multiple-Valued Logic: A
journey from the (Shannon) sampling theorem to the Shannon decomposition rule,” in Proc. 37th Int.
Symp. on Multiple-Valued Logic, Oslo, Norway.
[5] E.M. Stein and R. Shakarchi, (2003) Fourier Analysis: An Introduction, Princeton University Press.
[6] I. Takahashi, (1979) Combinatorial Theory and its Application, Iwanami Syoten, Tokyo.
[7] H. Toutenburg and Shalabh, (2009) Statistical Analysis of Designed Experiments (Third Edition),
Springer.
[8] Y. Ukita, T. Saito, T. Matsushima and S. Hirasawa, (2010) “A Note on a Sampling Theorem for
Functions over GF(q)^n Domain,” IEICE Trans. Fundamentals, Vol.E93-A, no.6, pp.1024-1031.
[9] Y. Ukita and T. Matsushima, (2011) “A Note on Relation between the Fourier Coefficients and the
Effects in the Experimental Design,” in Proc. 8th Int. Conf. on Inf., Comm. and Signal Processing,
pp.1-5.
[10] Y. Ukita, T. Matsushima and S. Hirasawa, (2012) “A Note on Relation Between the Fourier
Coefficients and the Interaction Effects in the Experimental Design,” in Proc. 4th Int. Conf. on
Intelligent and Advanced Systems, Kuala Lumpur, Malaysia, pp.604-609.
11. Computer Science & Information Technology (CS & IT) 247
[11] Sharma, S., Tim, U. S., Wong, J., Gadia, S., and Sharma, S. (2014) “A Brief Review on Leading Big
Data Models,” Data Science Journal, 13(0), pp.138-157.
[12] Sharma, S., Shandilya, R., Patnaik, S., and Mahapatra, A. (2015) Leading NoSQL models for
handling Big Data: a brief review, International Journal of Business Information Systems,
Inderscience.
AUTHORS
Yoshifumi Ukita has been a professor of the Department of Management Information at Yokohama
College of Commerce, Kanagawa, Japan since 2011. His research interests are artificial intelligence, signal
processing and experimental designs. He is a member of the Information Processing Society of Japan, the
Japan Society for Artificial Intelligence and IEEE.