scholarly journals A Constraint Functional Logic Language for Solving Combinatorial Problems

2003 ◽  
pp. 337-350
Author(s):  
Antonio J. Fernández ◽  
Teresa Hortalá-González ◽  
Fernando Sáenz-Pérez
Keyword(s):  
Combinatorial Problems ◽  
Functional Logic

Solving Combinatorial Problems with a Constraint Functional Logic Language

2002 ◽  
pp. 320-338 ◽  
Author(s):  
Antonio J. Fernández ◽  
Teresa Hortalá-González ◽  
Fernando Sáenz-Pérez
Keyword(s):  
Combinatorial Problems ◽  
Functional Logic

Economic Development and Traditional Social Structures: Some Theoretical Considerations

1988 ◽  
Vol 27 (4II) ◽  
pp. 501-507 ◽  
Author(s):  
Soofia Mumtaz
Keyword(s):  
Third World ◽  
Development Process ◽  
Social Structures ◽  
Industrial System ◽  
Social Scientists ◽  
The Third ◽  
Nation States ◽  
Functional Logic ◽  
The Third World ◽  
Theoretical Considerations

This paper discusses some issues currently preoccupying social scientists with respect to the process of development and its implications for Third World countries. These issues have become highly significant considering the momentum and nature of the development process being launched in the so-called "underdeveloped" world, within the context of modern nation-states. Therefore, in this paper, we seek to identify: (a) What is meant by development; (b) How the encounter between this process and traditional social structures (with their own functional logic, based on earlier forms of production and social existence) takes place; (c) What the implications of this encounter are; and (d) What lessons we can learn in this regard from history and anthropology. Development as a planned and organized process, the prime issue concerning both local and Western experts in Third World countries, is a recent phenomenon in comparison to the exposure of Third World countries to the Western Industrial system. The former gained momentum subsequent to the decolonization of the bulk of the Third World in the last half of this century, whereas the latter dates to at least the beginning of this century, if not earlier, when the repercussions of colonization, and later the two World Wars, became manifest in these countries.

Diagnose Compound Hold Time Faults Caused by Spot Delay Defects at Clock Tree

2011 ◽  
Author(s):  
Yu Huang ◽  
Wu-Tung Cheng ◽  
Ting-Pu Tai ◽  
Liyang Lai ◽  
Ruifeng Guo ◽  
...  
Keyword(s):  
Hold Time ◽  
Clock Signal ◽  
Clock Tree ◽  
Scan Testing ◽  
Design Error ◽  
Functional Logic ◽  
Scan Chains ◽  
Delay Defects

Abstract If a signal on clock tree is slower than expected due to either a design error or a manufacturing defect, it may cause complicated fault behaviors during scan-based testing. It makes the diagnosis of such defect especially difficult if the defective clock signal is used for both shift and capture operations during the scan testing, because (1) the defect induces hold time faults on scan chains during shift cycles, and (2) hold-time faults may also be introduced during capture cycles in the functional logic paths. In this paper we illustrate the failure behaviors of such clock defects and propose an algorithm to diagnose it.

scholarly journals Q-Learnheuristics: Towards Data-Driven Balanced Metaheuristics

Mathematics ◽  
2021 ◽  
Vol 9 (16) ◽  
pp. 1839
Author(s):  
Broderick Crawford ◽  
Ricardo Soto ◽  
José Lemus-Romani ◽  
Marcelo Becerra-Rozas ◽  
José M. Lanza-Gutiérrez ◽  
...  
Keyword(s):  
Combinatorial Problems ◽  
Set Covering ◽  
Covering Problem ◽  
Integration Framework ◽  
Q Learning ◽  
Whale Optimization ◽  
Sine Cosine Algorithm ◽  
Exploration Exploitation ◽  
Selection Of

One of the central issues that must be resolved for a metaheuristic optimization process to work well is the dilemma of the balance between exploration and exploitation. The metaheuristics (MH) that achieved this balance can be called balanced MH, where a Q-Learning (QL) integration framework was proposed for the selection of metaheuristic operators conducive to this balance, particularly the selection of binarization schemes when a continuous metaheuristic solves binary combinatorial problems. In this work the use of this framework is extended to other recent metaheuristics, demonstrating that the integration of QL in the selection of operators improves the exploration-exploitation balance. Specifically, the Whale Optimization Algorithm and the Sine-Cosine Algorithm are tested by solving the Set Covering Problem, showing statistical improvements in this balance and in the quality of the solutions.

scholarly journals Inversion-free geometric mapping construction: A survey

2021 ◽  
Vol 7 (3) ◽  
pp. 289-318
Author(s):  
Xiao-Ming Fu ◽  
Jian-Ping Su ◽  
Zheng-Yu Zhao ◽  
Qing Fang ◽  
Chunyang Ye ◽  
...  
Keyword(s):  
Mesh Generation ◽  
Optimization Problem ◽  
Texture Mapping ◽  
Deformation Texture ◽  
Research Field ◽  
Combinatorial Problems ◽  
Open Problems ◽  
Nonlinear Constrained Optimization ◽  
Construction Methods ◽  
Geometric Mapping

AbstractA geometric mapping establishes a correspondence between two domains. Since no real object has zero or negative volume, such a mapping is required to be inversion-free. Computing inversion-free mappings is a fundamental task in numerous computer graphics and geometric processing applications, such as deformation, texture mapping, mesh generation, and others. This task is usually formulated as a non-convex, nonlinear, constrained optimization problem. Various methods have been developed to solve this optimization problem. As well as being inversion-free, different applications have various further requirements. We expand the discussion in two directions to (i) problems imposing specific constraints and (ii) combinatorial problems. This report provides a systematic overview of inversion-free mapping construction, a detailed discussion of the construction methods, including their strengths and weaknesses, and a description of open problems in this research field.

scholarly journals Picomolar-Level Melamine Detection via ATP Regulated CeO2 Nanorods Tunable Peroxidase-Like Nanozyme-Activity-Based Colorimetric Sensor: Logic Gate Implementation and Real Sample Analysis

Crystals ◽  
2021 ◽  
Vol 11 (2) ◽  
pp. 178
Author(s):  
Benazir Chishti ◽  
Zubaida A. Ansari ◽  
Hassan Fouad ◽  
Othman Y. Alothman ◽  
Mohamed Hashem ◽  
...  
Keyword(s):  
Linear Response ◽  
Limit Of Detection ◽  
Logic Gate ◽  
Colorimetric Sensor ◽  
Blue Color ◽  
Neutral Ph ◽  
Colorimetric Response ◽  
Relative Standard ◽  
Functional Logic ◽  
Gate Sensor

The capability of functional logic operations is highly intriguing, but far from being realized owing to limited recognition element (RE) and complex readout signals, which limit their applications. In this contribution, for a visual colorimetric sensor for melamine (MEL) we described the construction of two- and three-input AND logic gate by exploiting the intrinsic peroxidase (POD)-like activity of CeO2 nanorods (NRs) (~23.04% Ce3+ fraction and aspect ratio (RTEM) of 3.85 ± 0.18) as RE at acidic pH (4.5). Further ATP piloted catalytic tuning of POD-like activity in CeO2 NRs employed for a functional logic gate-controlled MEL sensing at neutral pH (7.4). AND logic circuit operated MEL sensing record colorimetric response time of 15 min to produce blue color proportionate to MEL concentration. The fabricated nanozyme (CeO2)-based logic gate sensor probe for MEL at pH 4.5 showed a linear response from 0.004 nM to 1.56 nM with a limit of detection (LOD) of 4 pM; while translation from acidic to neutral pH (at 7.4) sensor exhibited linear response ranging from 0.2 nM to 3.12 nM with a LOD value of 17 pM. Through CeO2 POD-like nanozyme behavior under acidic and neutral pH, the fabricated logic gate sensor showed high affinity for MEL, generating prominent visual output with picomolar sensitivity, good reproducibility, and stability with relative standard deviation (RSD) <1% and 2%, respectively. A feasibility study in real samples (raw milk and milk powder) showed good recoveries with negligible matrix effect, an anti-interference experiment revealed sensor selectivity, highlighting robust sensor practical utility. With the merits of high sensitivity, specificity, low cost, and simplified sample processing, the developed logic-controlled colorimetric MEL sensing platform with appropriate modifications can be recognized as a potent methodology for on-site analysis of various food adulterants and related applications.

scholarly journals Feature Selection and Parameter Optimization of Support Vector Machines Based on Modified Artificial Fish Swarm Algorithms

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Kuan-Cheng Lin ◽  
Sih-Yang Chen ◽  
Jason C. Hung
Keyword(s):  
Feature Selection ◽  
Parameter Optimization ◽  
Combinatorial Problem ◽  
Combinatorial Problems ◽  
Support Vector ◽  
Local Optimum ◽  
Artificial Fish Swarm Algorithm ◽  
Swarm Algorithms ◽  
Artificial Fish Swarm ◽  
Information And Communication

Rapid advances in information and communication technology have made ubiquitous computing and the Internet of Things popular and practicable. These applications create enormous volumes of data, which are available for analysis and classification as an aid to decision-making. Among the classification methods used to deal with big data, feature selection has proven particularly effective. One common approach involves searching through a subset of the features that are the most relevant to the topic or represent the most accurate description of the dataset. Unfortunately, searching through this kind of subset is a combinatorial problem that can be very time consuming. Meaheuristic algorithms are commonly used to facilitate the selection of features. The artificial fish swarm algorithm (AFSA) employs the intelligence underlying fish swarming behavior as a means to overcome optimization of combinatorial problems. AFSA has proven highly successful in a diversity of applications; however, there remain shortcomings, such as the likelihood of falling into a local optimum and a lack of multiplicity. This study proposes a modified AFSA (MAFSA) to improve feature selection and parameter optimization for support vector machine classifiers. Experiment results demonstrate the superiority of MAFSA in classification accuracy using subsets with fewer features for given UCI datasets, compared to the original FASA.

Lower bounds for combinatorial problems on graphs

1985 ◽  
Vol 6 (3) ◽  
pp. 393-399 ◽  
Author(s):  
Hiroyuki Nakayama ◽  
Takao Nishizeki ◽  
Nobuji Saito
Keyword(s):  
Lower Bounds ◽  
Combinatorial Problems
Sign in / Sign up

Export Citation Format

Share Document