关键词： Likert Scale Questionnaires   Competencies   Inverse problems   Genetic algorithms   Linear algebra   CAS  

摘要： A Likert scale is a psychometric response scale primarily used in questionnaires to obtain participants' preferences or degree of agreement with a statement or set of statements. Respondents are asked to indicate their level of agreement with a given statement using an ordinal scale. Nowadays, Companies often use Likert surveys to discern the capabilities and skills of current or potential employees, asking multiple questions about each competency. With such a questionnaire, different competencies are evaluated and therefore, the result of a questionnaire will provide important information about capabilities and skills of the respondents. As an example, we will describe, for a real questionnaire, how to classify each question with the corresponding competency. That is, to find, for each Likert item, which competency is evaluated. We will present how to face and solve the problem using two different techniques: an approximate method, using a genetic algorithm and an exact algebraic method, solving a quadratic system of n equations and n unknowns. Finally, we will set the basics to solve this competency-assignment problem for a generalized version of similar questionnaires with n Likert items for evaluating m competencies. The advantages and disadvantages of both techniques will be also shown.

关键词： Algebraic specification   Algebraic testing   Test case   Tabu search   Genetic algorithm  

摘要： To improve the effectiveness of generating test case for algebraic specification, an approach for generating test cases based on tabu search and genetic algorithm (Tabu GA) is presented. A prototype tool CASCATT (Common Algebraic Specification-based Class, Component and Web service Automatic Testing Tool) is implemented based on Tabu GA, which tests Class, Component and Web Service based on algebraic specification described by CASOCC-WS (Common Algebraic Specification of Components, Classes and Web service) language. The experiments results show the testing method is better effective, comparing with the existed random method in algebraic testing tool CASCAT (Common AS-based Component Automatic Testing) which generated test case from random data rewriting technology.

关键词： ontology   algebra of algorithms   design and synthesis of programs   parallel program   cloud computing  

摘要： An approach to the automated development of programs is proposed on the basis of ontological facilities and algebra-algorithmic tools for program design and synthesis. The approach is illustrated by examples of developing a parallel weather forecasting program and also a software application destined to run the developed program on a cloud computing platform.

关键词： Max-plus algebra   Generalized eigenmode   Power algorithm   Cycle time vector  

摘要： In this paper we discuss a generalization of power algorithms over max-plus algebra. We are interested in finding such a generalization starting from various existing power algorithms. The resulting algorithm can be used to determine the so-called generalized eigenmode of any square regular matrix over max-plus algebra. In particular, the algorithm can be applied in the case of regular reducible matrices in which the existing power algorithms can not be used to compute eigenvalues and corresponding eigenvectors.

摘要： This article examines how assemblages of complex types of knowledge and technologiesincluding algorithmic mathematics, law and accounting, and high-level logisticshave generated complex predatory formations. The complexity of these formations tends to camouflage their predatory character. Further, such formations are systemic in nature. They are not produced by an elementary seizure of power. Predatory formations are often beyond the reach of ordinary policy responses, in good part because they tend to assemble elements of separate domains into novel configurations. The focus here is on one of the more powerful and complex predatory formations, (high) finance. And the effort is to explain how even the most sophisticated financial instruments require certain elementary and brutal steps, resulting in highly degraded socio-economic outcomes. The sub-prime mortgage developed in the early 2000s differentiates itself from the original 1970s concept in that its aim was not to enable access to housing. Its aim was and is to use the actual physical good (the house) to develop an asset-backed security for the financial system itself.

关键词： coupled algebraic Riccati equations   homotopy methods   numerical analysis   control system   design  

摘要： This paper presents an algorithm based on a complex line homotopy mapping for the numerical solution of systems of coupled algebraic matrix Riccati equations which often met in continuous time control system design problems. Well-defined complex homotopy paths lead to solutions globally from independent initial conditions, and they are computed via continuous dynamic flow algorithms (ordinary differential equation solvers). Although the homotopy mapping is complex it is shown how it is possible in practice to obtain desired real solutions of certain definiteness even from zero initial conditions. Moreover, a scaling method is deployed within the algorithms for numerical enhancement and its effect to homotopy paths, convergence and stability is experimentally studied. In addition, a first- order perturbation analysis framework for the assessment of computed solutions is provided. Comparisons with other existing methods from the literature are made through several numerical examples considering mixed H2/H8, Nash games and stochastic control system design problems, where the efficiency of the proposed algorithm is illustrated. It is worth noticing that algorithmic implementation and numerical experimentation with complex homotopies for the coupled algebraic Riccati equations under study appears to be absent from the literature. Hence, the contribution of the present paper to related problems in systems and control.

关键词： imperialist competitive algorithm   fuzzy logic   dynamic adjust  

摘要： In this paper we are presenting a method using fuzzy logic for dynamic parameter adaptation in the imperialist competitive algorithm, which is usually known by its acronym ICA. The ICA algorithm was initially studied in its original form to find out how it works and what parameters have more effect upon its results. Based on this study, several designs of fuzzy systems for dynamic adjustment of the ICA parameters are proposed. The experiments were performed on the basis of solving complex optimization problems, particularly applied to benchmark mathematical functions. A comparison of the original imperialist competitive algorithm and our proposed fuzzy imperialist competitive algorithm was performed. In addition, the fuzzy ICA was compared with another metaheuristic using a statistical test to measure the advantage of the proposed fuzzy approach for dynamic parameter adaptation.

关键词： Assembly line balancing   Multi-manned workstations   Mixed integer mathematical programming  

摘要： Some feasible mathematical model solution results in a recent paper (Fattahi et al., Int J Adv Manuf Technol, 53:363-378, 2011) are incorrect. In this note, we show by counterexamples that the results are incorrect and mathematical formulation is corrected by additional constraints.

关键词： Health facilities   Testing laboratories   Quality control   Costs   Algorithms   Urban areas   Information systems   Rural areas  

摘要： Introduction: CD4 testing in South Africa is based on an integrated tiered service delivery model that matches testing demand with capacity. The National Health Laboratory Service has predominantly implemented laboratory-based CD4 testing. Coverage gaps, over-/undercapacitation and optimal placement of point-of-care (POC) testing sites need investigation. Objectives: We assessed the impact of relational algebraic capacitated location (RACL) algorithm outcomes on the allocation of laboratory and POC testing sites. Methods: The RACL algorithm was developed to allocate laboratories and POC sites to ensure coverage using a set coverage approach for a defined travel time (T). The algorithm was repeated for three scenarios (A: T = 4;B: T = 3;C: T = 2 hours). Drive times for a representative sample of health facility clusters were used to approximate T. Outcomes included allocation of testing sites, Euclidian distances and test volumes. Additional analysis included platform distribution and space requirement assessment. Scenarios were reported as fusion table maps. Results: Scenario A would offer a fully-centralised approach with 15 CD4 laboratories without any POC testing. A significant increase in volumes would result in a four-fold increase at busier laboratories. CD4 laboratories would increase to 41 in scenario B and 61 in scenario C. POC testing would be offered at two sites in scenario B and 20 sites in scenario C. Conclusion: The RACL algorithm provides an objective methodology to address coverage gaps through the allocation of CD4 laboratories and POC sites for a given T. The algorithm outcomes need to be assessed in the context of local conditions.