Search results for: Constraint Satisfaction Problems

Authors: Abdolreza Hatamlou, Yusef Farhang, Mohammad Reza Meybodi

Abstract:

Variable ordering heuristics are used in constraint satisfaction algorithms. Different characteristics of various variable ordering heuristics are complementary. Therefore we have tried to get the advantages of all heuristics to improve search algorithms performance for solving constraint satisfaction problems. This paper considers combinations based on products and quotients, and then a newer form of combination based on weighted sums of ratings from a set of base heuristics, some of which result in definite improvements in performance.

Keywords: Constraint Satisfaction Problems, Variable Ordering Heuristics, Combination, Search Algorithms

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

Authors: Abdel-Reza Hatamlou, Mohammad Reza Meybodi

Abstract:

In this paper we present a hybrid search algorithm for solving constraint satisfaction and optimization problems. This algorithm combines ideas of two basic approaches: complete and incomplete algorithms which also known as systematic search and local search algorithms. Different characteristics of systematic search and local search methods are complementary. Therefore we have tried to get the advantages of both approaches in the presented algorithm. The major advantage of presented algorithm is finding partial sound solution for complicated problems which their complete solution could not be found in a reasonable time. This algorithm results are compared with other algorithms using the well known n-queens problem.

Keywords: Constraint Satisfaction Problem, Hybrid SearchAlgorithm.

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

Authors: Jeffrey L. Duffany

Abstract:

An optimal solution for a large number of constraint satisfaction problems can be found using the technique of substitution and elimination of variables analogous to the technique that is used to solve systems of equations. A decision function f(A)=max(A2) is used to determine which variables to eliminate. The algorithm can be expressed in six lines and is remarkable in both its simplicity and its ability to find an optimal solution. However it is inefficient in that it needs to square the updated A matrix after each variable elimination. To overcome this inefficiency the algorithm is analyzed and it is shown that the A matrix only needs to be squared once at the first step of the algorithm and then incrementally updated for subsequent steps, resulting in significant improvement and an algorithm complexity of O(n3).

Keywords: Algorithm, complexity, constraint, np-complete.

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

Authors: Bahare Fatemi, Seyed Mehran Kazemi, Nazanin Mehrasa

Abstract:

Sudoku is a logic-based combinatorial puzzle game which people in different ages enjoy playing it. The challenging and addictive nature of this game has made it a ubiquitous game. Most magazines, newspapers, puzzle books, etc. publish lots of Sudoku puzzles every day. These puzzles often come in different levels of difficulty so that all people, from beginner to expert, can play the game and enjoy it. Generating puzzles with different levels of difficulty is a major concern of Sudoku designers. There are several works in the literature which propose ways of generating puzzles having a desirable level of difficulty. In this paper, we propose a method based on constraint satisfaction problems to evaluate the difficulty of the Sudoku puzzles. Then we propose a hill climbing method to generate puzzles with different levels of difficulty. Whereas other methods are usually capable of generating puzzles with only few number of difficulty levels, our method can be used to generate puzzles with arbitrary number of different difficulty levels. We test our method by generating puzzles with different levels of difficulty and having a group of 15 people solve all the puzzles and recording the time they spend for each puzzle.

Keywords: Constraint satisfaction problem, generating Sudoku puzzles, hill climbing.

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

Authors: Shigeaki Sakurai, Youichi Kitahata, Ryohei Orihara

Abstract:

This paper proposes a method that discovers sequential patterns corresponding to user-s interests from sequential data. This method expresses the interests as constraint patterns. The constraint patterns can define relationships among attributes of the items composing the data. The method recursively decomposes the constraint patterns into constraint subpatterns. The method evaluates the constraint subpatterns in order to efficiently discover sequential patterns satisfying the constraint patterns. Also, this paper applies the method to the sequential data composed of stock price indexes and verifies its effectiveness through comparing it with a method without using the constraint patterns.

Keywords: Sequential pattern mining, Constraint pattern, Attribute constraint, Stock price indexes

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

Authors: Young-Seok Choi

Abstract:

We present a new framework of the data-reusing (DR) adaptive algorithms by incorporating a constraint on noise, referred to as a noise constraint. The motivation behind this work is that the use of the statistical knowledge of the channel noise can contribute toward improving the convergence performance of an adaptive filter in identifying a noisy linear finite impulse response (FIR) channel. By incorporating the noise constraint into the cost function of the DR adaptive algorithms, the noise constrained DR (NC-DR) adaptive algorithms are derived. Experimental results clearly indicate their superior performance over the conventional DR ones.

Keywords: Adaptive filter, data-reusing, least-mean square (LMS), affine projection (AP), noise constraint.

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

Authors: Abdenour Bounsiar, Edith Grall, Pierre Beauseroy

Abstract:

In this paper we are interested in classification problems with a performance constraint on error probability. In such problems if the constraint cannot be satisfied, then a rejection option is introduced. For binary labelled classification, a number of SVM based methods with rejection option have been proposed over the past few years. All of these methods use two thresholds on the SVM output. However, in previous works, we have shown on synthetic data that using thresholds on the output of the optimal SVM may lead to poor results for classification tasks with performance constraint. In this paper a new method for supervised classification with rejection option is proposed. It consists in two different classifiers jointly optimized to minimize the rejection probability subject to a given constraint on error rate. This method uses a new kernel based linear learning machine that we have recently presented. This learning machine is characterized by its simplicity and high training speed which makes the simultaneous optimization of the two classifiers computationally reasonable. The proposed classification method with rejection option is compared to a SVM based rejection method proposed in recent literature. Experiments show the superiority of the proposed method.

Keywords: rejection, Chow's rule, error-reject tradeoff, SupportVector Machine.

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

Authors: Pulak Swain, A. K. Ojha

Abstract:

Portfolio optimization is based on dealing with the problems of efficient asset allocation. Risk and Expected return are two conflicting criteria in such problems, where the investor prefers the return to be high and the risk to be low. Using multi-objective approach we can solve those type of problems. However the information which we have for the input parameters are generally ambiguous and the input values can fluctuate around some nominal values. We can not ignore the uncertainty in input values, as they can affect the asset allocation drastically. So we use Robust Optimization approach to the problems where the input parameters comes under box uncertainty. In this paper, we solve the multi criteria robust problem with the help of  E- constraint method.

Keywords: Portfolio optimization, multi-objective optimization, E-constraint method, box uncertainty, robust optimization.

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

Authors: Shahin Dezdar

Abstract:

Over the past few years, companies in developing countries have implemented enterprise resource planning (ERP) systems. Regardless of the various benefits of the ERP system, its adoption and implementation have not been without problems. Many companies have assigned considerable organizational resources to their ERP projects, but have encountered unexpected challenges. Neglecting a number of important factors in ERP projects might lead to failure instead of success. User satisfaction is among those factors that has a major influence on ERP implementation success. So, this paper intends to investigate the key factors that create ERP users- satisfaction and to discover whether ERP users- satisfaction varies among different users- profiles. The study was conducted using a survey questionnaire which was distributed to ERP users in Iranian organizations. A total of 384 responses were collected and analyzed. The findings indicated that younger ERP users tend to be more satisfied with ERP systems. Furthermore, ERP users with more experiences in IT and also more educated users have more satisfaction with ERP softwares. However, the study found no satisfaction differences between men and women users.

Keywords: ERP, Enterprise resource planning, User satisfaction, Iran, Developing country

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

Authors: Jeffrey L. Duffany

Abstract:

The equivalence class subset algorithm is a powerful tool for solving a wide variety of constraint satisfaction problems and is based on the use of a decision function which has a very high but not perfect accuracy. Perfect accuracy is not required in the decision function as even a suboptimal solution contains valuable information that can be used to help find an optimal solution. In the hardest problems, the decision function can break down leading to a suboptimal solution where there are more equivalence classes than are necessary and which can be viewed as a mixture of good decision and bad decisions. By choosing a subset of the decisions made in reaching a suboptimal solution an iterative technique can lead to an optimal solution, using series of steadily improved suboptimal solutions. The goal is to reach an optimal solution as quickly as possible. Various techniques for choosing the decision subset are evaluated.

Keywords: np-complete, complexity, algorithm.

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

Authors: Young-Seok Choi

Abstract:

We present a family of data-reusing and affine projection algorithms. For identification of a noisy linear finite impulse response channel, a partial knowledge of a channel, especially noise, can be used to improve the performance of the adaptive filter. Motivated by this fact, the proposed scheme incorporates an estimate of a knowledge of noise. A constraint, called the adaptive noise constraint, estimates an unknown information of noise. By imposing this constraint on a cost function of data-reusing and affine projection algorithms, a cost function based on the adaptive noise constraint and Lagrange multiplier is defined. Minimizing the new cost function leads to the adaptive noise constrained (ANC) data-reusing and affine projection algorithms. Experimental results comparing the proposed schemes to standard data-reusing and affine projection algorithms clearly indicate their superior performance.

Keywords: Data-reusing, affine projection algorithm, error constraint, system identification.

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

Authors: Young-Seok Choi

Abstract:

This paper presents a normalized subband adaptive filtering (NSAF) algorithm to cope with the sparsity condition of an underlying system in the context of compressive sensing. By regularizing a weighted l1-norm of the filter taps estimate onto the cost function of the NSAF and utilizing a subgradient analysis, the update recursion of the l1-norm constraint NSAF is derived. Considering two distinct weighted l1-norm regularization cases, two versions of the l1-norm constraint NSAF are presented. Simulation results clearly indicate the superior performance of the proposed l1-norm constraint NSAFs comparing with the classical NSAF.

Keywords: Subband adaptive filtering, sparsity constraint, weighted l1-norm.

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

Authors: Ana Horvat, Maja Krsmanovic, Mladen Djuric

Abstract:

Rapid growth of distance learning resulted in importance to conduct research on students- satisfaction with distance learning because differences in students- satisfaction might influence educational opportunities for learning in a relevant Web-based environment. In line with this, this paper deals with satisfaction of students with distance module at Faculty of organizational sciences (FOS) in Serbia as well as some factors affecting differences in their satisfaction . We have conducted a research on a population of 68 first-year students of distance learning studies at FOS. Using statistical techniques, we have found out that there is no significant difference in students- satisfaction with distance learning module between men and women. In the same way, we also concluded that there is a difference in satisfaction with distance learning module regarding to student-s perception of opportunity to gain knowledge as the classic students.

Keywords: distance learning, students' satisfaction

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

Authors: Akbar H. Borzabadi, Omid S. Fard

Abstract:

In this paper we introduce an approach via optimization methods to find approximate solutions for nonlinear Fredholm integral equations of the first kind. To this purpose, we consider two stages of approximation. First we convert the integral equation to a moment problem and then we modify the new problem to two classes of optimization problems, non-constraint optimization problems and optimal control problems. Finally numerical examples is proposed.

Keywords: Fredholm integral equation, Optimization method, Optimal control, Nonlinear and linear programming

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

Authors: Muna Tabuni

Abstract:

The paper contains an investigation on basic problems about the zeros of analytic theta functions. A brief introduction to analytic representation of finite quantum systems is given. The zeros of this function and there evolution time are discussed. Two open problems are introduced. The first problem discusses the cases when the zeros follow the same path. As the basis change the quantum state |f transforms into different quantum state. The second problem is to define a map between two toruses where the domain and the range of this map are the analytic functions on toruses.

Keywords: open problems, constraint, change of basis.

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

Authors: Khodamorad Nabaki, Jianhu Shen, Xiaodong Huang

Abstract:

This paper develops a method for considering the critical fatigue stress as a constraint in the Bi-directional Evolutionary Structural Optimization (BESO) method. Our aim is to reach an optimal design in which high cycle fatigue failure does not occur for a specific life time. The critical fatigue stress is calculated based on modified Goodman criteria and used as a stress constraint in our topology optimization problem. Since fatigue generally does not occur for compressive stresses, we use the p-norm approach of the stress measurement that considers the highest tensile principal stress in each point as stress measure to calculate the sensitivity numbers. The BESO method has been extended to minimize volume an object subjected to the critical fatigue stress constraint. The optimization results are compared with the results from the compliance minimization problem which shows clearly the merits of our newly developed approach.

Keywords: Topology optimization, BESO method, p-norm, fatigue constraint.

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

Authors: Anne M. Sørebø, Øystein Sørebø

Abstract:

The present study was designed to test the influence of confirmed expectations, perceived usefulness and perceived competence on e-learning satisfaction among university teachers. A questionnaire was completed by 125 university teachers from 12 different universities in Norway. We found that 51% of the variance in university teachers- satisfaction with e-learning could be explained by the three proposed antecedents. Perceived usefulness seems to be the most important predictor of teachers- satisfaction with e-learning.

Keywords: E-learning, User satisfaction, Teachers, IS success.

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

Authors: Maziyar Nouraee

Abstract:

Today, quality improvement is an essential manner that is notified primarily as an essence in industry, manufacturing, health and education. Whenever quality is noticed as a criterion, then it results into empowering managers and job satisfaction of staffs. The research is aimed to evaluate the rate of relationship between TQM executions toward rate of empowering and satisfaction of staff paper mill in Isfahan. Results showed that there is a meaningful relationship between TQM, empowerment and satisfaction and even between TQM and empowerment dimensions; total quality management can perfectly predict empowerment and job satisfaction.      

Keywords: TQM (total quality management), Empowerment, Job Satisfaction.

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

Authors: Faisal Ali, Mansoor Shuakat, Lirong Cui, Helena Uhde, Rabia Riasat, Janeth J. Marwa

Abstract:

HR is a department that enhances the power of employee performance in regard with their services, and to make the organization strategic objectives. The main concern of HR department is to organize people, focus on policies and their system. The empirical study shows the relationship between HRM (Human Resource Management practices) and their Job Satisfaction. The Hypothesis is testing on a sample of overall 320 employees of 5 different Pharmaceutical departments of different organizations in Pakistan. The important thing as Relationship of Job satisfaction with HR Practices, Impact on Job Satisfaction with HR Practices, Participation of Staff of Different Departments, HR Practices effects the Job satisfaction, Recruitment or Hiring and Selection effects the Job satisfaction, Training and Development, Performance and Appraisals, Compensation affects the Job satisfaction , and Industrial Relationships affects the Job satisfaction. After finishing all data analysis, the conclusion is that lots of Job related activities raise the confidence of Job satisfaction of employees with their salary and other benefits.

Keywords: HRM, HR practices, job satisfaction, TQM.

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

Authors: Parham Azimi, Hamid Reza Charmchi

Abstract:

In this research, we have developed a new efficient heuristic algorithm for the dynamic facility layout problem with budget constraint (DFLPB). This heuristic algorithm combines two mathematical programming methods such as discrete event simulation and linear integer programming (IP) to obtain a near optimum solution. In the proposed algorithm, the non-linear model of the DFLP has been changed to a pure integer programming (PIP) model. Then, the optimal solution of the PIP model has been used in a simulation model that has been designed in a similar manner as the DFLP for determining the probability of assigning a facility to a location. After a sufficient number of runs, the simulation model obtains near optimum solutions. Finally, to verify the performance of the algorithm, several test problems have been solved. The results show that the proposed algorithm is more efficient in terms of speed and accuracy than other heuristic algorithms presented in previous works found in the literature.

Keywords: Budget constraint, Dynamic facility layout problem, Integer programming, Simulation

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

Authors: Dezhi Li, Peng Cui, Bo Zhang, Tengyuan Chang

Abstract:

In order to solve the housing problem for the low-income families, the construction of affordable housing is booming in China. However, due to various reasons, the service facilities and systems in the indemnificatory residential community meet many problems. This article established a Satisfaction Evaluation System of the Fundamental Public Services for Large-scale Indemnificatory Residential Community based on the national standards and local criteria and developed evaluation methods and processes. At last, in the case of Huagang project in Nanjing, the satisfaction of basic public service is calculated according to a survey of local residents.

Keywords: Indemnificatory residential community, public services, satisfaction evaluation, structural equation modeling.

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

Authors: Nedra Bahri-Ammari

Abstract:

Literature review revealed the importance of the adoption of marketing Relationship for loyalty and retaining profitable customer (Customer Relationship Management). LPQ satisfaction will reinforce the loyalty and customer brand attachment. Customer will communicate the operator to others. The focus of this study is to examine the relationship between the LPPQ and the WOM recommendations through: customer satisfaction, loyalty and attachment. The results show that LPQ affect positively the satisfaction, negatively the loyalty. LPQ has an indirectly effect on WOM recommendations but through the satisfaction and attachment. The mediating effect of satisfaction in the relationship between LPQ and Loyalty is rejected. This finding can be explained by the nature of mobile sector in Tunisia.

Keywords: Attachment, Loyalty program quality, satisfaction, WOM

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

Authors: R. Öztürk

Abstract:

Experiential marketing is one of the marketing approaches that offer an exceptional framework to integrate elements of experience and entertainment in a product or service. Experiential marketing is defined as a memorable experience that goes deeply into the customer’s mind. Besides that, customer satisfaction is defined as an emotional response to the experiences provided by and associated with particular products or services purchased. Thus, experiential marketing activities can affect the level of customer satisfaction and loyalty. In this context, the research aims to explore the relationship among experiential marketing, customer satisfaction and customer loyalty among the cosmetic products customers in Konya. The partial least squares (PLS) method is used to analyze the survey data. Findings of the present study revealed that experiential marketing has been a significant predictor of customer satisfaction and customer loyalty, and also experiential marketing has a significantly positive effect on customer satisfaction and customer loyalty.

Keywords: Customer satisfaction, customer loyalty, experiential marketing.

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

Authors: Cheng Fang Hsu, Shinn-Jong Lin

Abstract:

This paper aims at a new challenge of customer satisfaction on mobile customer relationship management. In this paper presents a conceptualization of mCRM on its unique characteristics of customer satisfaction. Also, this paper develops an empirical framework in conception of customer satisfaction in mCRM. A single-case study is applied as the methodology. In order to gain an overall view of the empirical case, this paper accesses to invisible and important information of company in this investigation. Interview is the key data source form the main informants of the company through which the issues are identified and the proposed framework is built. It supports the development of customer satisfaction in mCRM; links this theoretical framework into practice; and provides the direction for future research. Therefore, this paper is very useful for the industries as it helps them to understand how customer satisfaction changes the mCRM structure and increase the business competitive advantage. Finally, this paper provides a contribution in practice by linking a theoretical framework in conception of customer satisfaction in mCRM for companies to a practical real case.

Keywords: Customer Satisfaction; mCRM; MobileCommunication.

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

Authors: Tooba Qasim, Uzma Javed, Muhammad Safder Shafi

Abstract:

This study empirically examines the differentiating impact of challenge-hindrance stressors on turnover intention through job satisfaction in IT industry of Pakistan. Moreover, perceived job alternatives were tested as a moderator in the relationship between job satisfaction and turnover intention. Primary data was collected from 186 randomly selected IT professionals, working in project-based IT organizations of Islamabad and Rawalpindi. Results indicated significant: (1) positive relationship between challenge stressors and job satisfaction, (2) negative relationship between hindrance stressors and job satisfaction, (3) negative relationship between job satisfaction and turnover intention, (4) Job satisfaction fully mediates the relationship between challenge stressor and turnover intention, (5) Job satisfaction partially mediates the relationship between hindrance stressor and turnover intention. However, it was observed that perceived job alternatives do not have any moderating effect. Proper balancing of two stressors may help top management to increase the job satisfaction and reduce the turnover intention of IT professionals.

Keywords: Challenge Stressors, Hindrance Stressors, Job Satisfaction, Perceived Job Alternatives, Project-based organizations, Turnover Intention.

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

Authors: Olga V. Krivobokova

Abstract:

A major goal of any enterprise is to create a ratings system of customer satisfaction, goods and services. It is obvious that the company cannot change what is not measured. In order to get a clearer picture of the preferences of the major consumer groups, this stage should be based on extensive research, including a variety of interviews and surveys. It is necessary to know the key benefits, which determine customer satisfaction in the market segment, of the properties of certain goods and services. It is important to estimate the terms of these preferences from the viewpoint of the client. This article discusses the importance of customer satisfaction, and ways of assessing it.

Keywords: Costs, customer, evaluation, organization, producer, quality management, satisfaction.

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

Authors: Ikilem Gocek, Senem Kursun, Yesim Iridag Beceren

Abstract:

The customer satisfaction for textile sector carries great importance like the customer satisfaction for other sectors carry. Especially, if it is considered that gaining new customers create four times more costs than protecting existing customers from leaving, it can be seen that the customer satisfaction plays a great role for the firms. In this study the affecting independent variables of customer satisfaction are chosen as brand image, perceived service quality and perceived product quality. By these independent variables, it is investigated that if any differences exist in perception of customer satisfaction according to the Turkish textile consumers in the view of gender. In data analysis of this research the SPSS program is used.

Keywords: Customer satisfaction, textile industry, brand image, service quality, product quality, gender.

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

Authors: Silva, Fátima, Fernandes, Paula Odete

Abstract:

The future of Higher Education Institutions (HEI) depend on their ability to attract and retain students, increase recognition and prestige. In order to respond to the 'customers' increasingly demanding, HEI need to identify the key factors that influence the satisfaction of a 'customers', thereby creating competitive advantages. These determinants of satisfaction are important elements that guide the strategy of an institution and allow the successful achievement of strategic plans, both teaching and administrative, to offer their ‘costumers’ services and products with higher quality. Following this way of thinking, the purpose of this study was to evaluate the satisfaction with the service quality of the School of Technology and Management of Bragança (ESTiG), of the Polytechnic Institute of Bragança, identifying, thus, the dimensions related to the quality of services that might influence students' satisfaction. The results showed that, in general, the students are satisfied with the performance of ESTiG.

Keywords: Customer Satisfaction, Higher Education Institutions, Importance-Satisfaction Model.

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

Authors: S. Anastasiou, C. Nathanailides

Abstract:

The purpose of this study is to examine the possible link between employee and customer satisfaction. The service provided by employees, help to build a good relationship with customers and can help at increasing their loyalty. Published data for job satisfaction and indicators of customer services of banks were gathered from relevant published works which included data from five different countries. The scores of customers and employees satisfaction of the different published works were transformed and normalized to the scale of 1 to 100. The data were analyzed and a regression analysis of the two parameters was used to describe the link between employee’s satisfaction and customer’s satisfaction. Assuming that employee satisfaction has a significant influence on customer’s service and the resulting customer satisfaction, the reviewed data indicate that employee’s satisfaction contributes significantly on the level of customer satisfaction in the Banking sector. There was a significant correlation between the two parameters (Pearson correlation R2=0.52 P<0.05). The reviewed data indicate that published data support the hypothesis that practical evidence link these two parameters. During the recent global economic crisis, the financial services sector was affected severely and job security, remuneration and recruitment of personnel of banks was in many countries, including Greece, significantly reduced. Nevertheless, modern organizations should always consider their personnel as a capital, which is the driving force for success in the future. Appropriate human resource management policies can increase the level of job satisfaction of the personnel with positive consequences for the level of customer’s satisfaction.

Keywords: Job satisfaction, job performance, customer service, banks, human resources management.

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

Authors: First G.M. Karthik, Second Ramachandra.V.Pujeri, Dr.

Abstract:

Generalized Center String (GCS) problem are generalized from Common Approximate Substring problem and Common substring problems. GCS are known to be NP-hard allowing the problems lies in the explosion of potential candidates. Finding longest center string without concerning the sequence that may not contain any motifs is not known in advance in any particular biological gene process. GCS solved by frequent pattern-mining techniques and known to be fixed parameter tractable based on the fixed input sequence length and symbol set size. Efficient method known as Bpriori algorithms can solve GCS with reasonable time/space complexities. Bpriori 2 and Bpriori 3-2 algorithm are been proposed of any length and any positions of all their instances in input sequences. In this paper, we reduced the time/space complexity of Bpriori algorithm by Constrained Based Frequent Pattern mining (CBFP) technique which integrates the idea of Constraint Based Mining and FP-tree mining. CBFP mining technique solves the GCS problem works for all center string of any length, but also for the positions of all their mutated copies of input sequence. CBFP mining technique construct TRIE like with FP tree to represent the mutated copies of center string of any length, along with constraints to restraint growth of the consensus tree. The complexity analysis for Constrained Based FP mining technique and Bpriori algorithm is done based on the worst case and average case approach. Algorithm's correctness compared with the Bpriori algorithm using artificial data is shown.

Keywords: Constraint Based Mining, FP tree, Data mining, GCS problem, CBFP mining technique.

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